Knowledge-Based Object Localization in Scanning Electron Microscopy Images for Hardware Assurance

2020 ◽  
Author(s):  
Hangwei Lu ◽  
Ronald Wilson ◽  
Nidish Vashistha ◽  
Navid Asadizanjani ◽  
Mark Tehranipoor ◽  
...  
Keyword(s):  
Target Location ◽  
Search Algorithm ◽  
Object Localization ◽  
Test Cases ◽  
Sem Images ◽  
Essential Step ◽  
Knowledge Based ◽  
Research Fields ◽  
Trojan Detection ◽  
Microscopy Images

Abstract Object localization is an essential step in image-based hardware assurance applications to navigate the view to the target location. Existing localization methods are well-developed for applications in many other research fields; however, limited study has been conducted to explore an accurate yet efficient solution in hardware assurance domain. To this end, this paper discusses the challenges of leveraging existing object localization methods from three aspects using the example scenario of IC Trojan detection and proposes a novel knowledge-based object localization method. The proposed method is inspired by the 2D string search algorithm; it also couples a mask window to preserve target topology, which enables multi-target localization. Evaluations are conducted on 61 test cases from five images of three node-technologies. The results validate the accuracy, time-efficiency, and the generalizability of the proposed method of locating multi-target from SEM images for hardware assurance applications.

Intelligent Process Planning Implemented As an Integrated Module of CIM

1997 ◽  
Author(s):  
Dusan N. Sormaz ◽  
Behrokh Khoshnevis
Keyword(s):  
Process Planning ◽  
Search Algorithm ◽  
Computer Integrated Manufacturing ◽  
Planning System ◽  
Process Selection ◽  
Process Sequencing ◽  
Knowledge Based ◽  
Completion Process ◽  
Integrative Process ◽  
The One

Abstract In this paper we describe an architecture of a new integrative process planning system as a part of computer integrated manufacturing research system. The process planning procedure is comprised of three phases: feature completion, process selection and process sequencing. We applied a knowledge-based approach to feature completion and process selection, and the space search algorithm for process sequencing. Description of these phases is provided and underlying knowledge representation explained. Integration between the process planning, on the one side, and CAD and scheduling, on the other, is discussed. System implementation has been described and several examples of the system execution are shown.

scholarly journals Improving the organization and interactivity of metabolic pathfinding with precomputed pathways

2020 ◽  
Vol 21 (1) ◽  
Author(s):  
Sarah M. Kim ◽  
Matthew I. Peña ◽  
Mark Moll ◽  
George N. Bennett ◽  
Lydia E. Kavraki
Keyword(s):  
Metabolic Pathways ◽  
Search Algorithm ◽  
Search Algorithms ◽  
Test Cases ◽  
Test Set ◽  
Computational Search ◽  
Hub Network ◽  
Pathway Search ◽  
Core Reaction ◽  
Modular Nature

Abstract Background The rapid growth of available knowledge on metabolic processes across thousands of species continues to expand the possibilities of producing chemicals by combining pathways found in different species. Several computational search algorithms have been developed for automating the identification of possible heterologous pathways; however, these searches may return thousands of pathway results. Although the large number of results are in part due to the large number of possible compounds and reactions, a subset of core reaction modules is repeatedly observed in pathway results across multiple searches, suggesting that some subpaths between common compounds were more consistently explored than others.To reduce the resources spent on searching the same metabolic space, a new meta-algorithm for metabolic pathfinding, Hub Pathway search with Atom Tracking (HPAT), was developed to take advantage of a precomputed network of subpath modules. To investigate the efficacy of this method, we created a table describing a network of common hub metabolites and how they are biochemically connected and only offloaded searches to and from this hub network onto an interactive webserver capable of visualizing the resulting pathways. Results A test set of nineteen known pathways taken from literature and metabolic databases were used to evaluate if HPAT was capable of identifying known pathways. HPAT found the exact pathway for eleven of the nineteen test cases using a diverse set of precomputed subpaths, whereas a comparable pathfinding search algorithm that does not use precomputed subpaths found only seven of the nineteen test cases. The capability of HPAT to find novel pathways was demonstrated by its ability to identify novel 3-hydroxypropanoate (3-HP) synthesis pathways. As for pathway visualization, the new interactive pathway filters enable a reduction of the number of displayed pathways from hundreds down to less than ten pathways in several test cases, illustrating their utility in reducing the amount of presented information while retaining pathways of interest. Conclusions This work presents the first step in incorporating a precomputed subpath network into metabolic pathfinding and demonstrates how this leads to a concise, interactive visualization of pathway results. The modular nature of metabolic pathways is exploited to facilitate efficient discovery of alternate pathways.

A SOFTWARE TEST AND EVALUATION ENVIRONMENT BASED ON LONGITUDINAL DATABASE

2002 ◽  
Vol 12 (03) ◽  
pp. 223-244
Author(s):  
S. OHARA ◽  
F. TSUNODA ◽  
H. MAEZAWA ◽  
A. K. ONOMA ◽  
M. HUI ◽  
...  
Keyword(s):  
Ad Hoc ◽  
Development Project ◽  
Software Test ◽  
Test Cases ◽  
Test Results ◽  
Software Development Project ◽  
Knowledge Based ◽  
Test And Evaluation ◽  
Other Information

To assure the quality of software by running test cases and evaluating the results is one of the difficult parts of the entire software development project. The difficulty usually comes from the lack of appropriate supporting tools and the complexity of the software. In the past ad hoc supporting tools were made for each project and test results were usually not used across projects. This conventional way of test and evaluation (T&E) is time consuming, and the most important decision "When is this software ready to ship?" is left to the engineers depending on their experiences. Our objective is to build a knowledge-based T&E environment such that tests cases, test results, object snapshots and other information are accumulated in a database. These longitudinal data can be automatically tracked and analyzed to provide decision support information. As a result, test results can be reviewed repeatedly and software quality can be assured by analyzing these data from various perspectives.

scholarly journals A research model in didactics of programming

2020 ◽  
Vol 23 (1) ◽  
Author(s):  
Sylvia Rita Da Rosa ◽  
Federico Gabriel Gómez
Keyword(s):  
Data Structure ◽  
Computer Science ◽  
Data Structures ◽  
Search Algorithm ◽  
Empirical Studies ◽  
Specific Area ◽  
Research Model ◽  
Algorithms And Data Structures ◽  
Construction Of Knowledge ◽  
Knowledge Based

This paper presents a research model in didactics of programming elaborated within the theoretical framework of the epistemological theory of Jean Piaget. That theory explains the construction of scientific knowledge based on empirical studies made by Piaget over many years. The model arises from the analysis of the results of the application of principles of the theory, especially the triad of intra-inter-trans stages, to the empirical study of the construction of the concepts of algorithm, data structure and program. The elaboration of the model is a contribution to the development of the didactics of programming and, in general, of the didactics of computer science, since the model can be used in other computer science topics. Didactics is a specific area within computer science, with its own foundations and methods, which studies in depth topics related to education in the discipline. Two empirical studies about the construction of knowledge of algorithms and data structures, and of the corresponding programs as executable objects, are briefly described to illustrate the model.Both examples use a search algorithm (binary and linear) and the implementations are in the programming language C.

scholarly journals Image analysis method for heterogeneity and porosity characterization of biomimetic hydrogels

F1000Research ◽  
2021 ◽  
Vol 9 ◽  
pp. 1461
Author(s):  
Maryam Jamshidi ◽  
Cavus Falamaki
Keyword(s):  
Kernel Density ◽  
Analysis Method ◽  
Morphological Transformation ◽  
Porous Network ◽  
Sem Images ◽  
Processing Procedure ◽  
Cryogenic Scanning Electron Microscopy ◽  
Microscopy Images ◽  
Porosity Characterization

This work presents an image processing procedure for characterization of porosity and heterogeneity of hydrogels network mainly based on the analysis of cryogenic scanning electron microscopy (cryo-SEM) images and can be extended to any other type of microscopy images of hydrogel porous network. An algorithm consisting of different filtering, morphological transformation, and thresholding steps to denoise the image whilst emphasizing the edges of the hydrogel walls for extracting either the pores or hydrogel walls features is explained. Finally, the information of hydrogel porosity and heterogeneity is presented in form of pore size distribution, spatial contours maps and kernel density dot plots. The obtained results reveal that a non-parametric kernel density plot effectively determines the spatial heterogeneity and porosity of the hydrogel.

scholarly journals Procurement Interaction Minimize Test Arrangement Formation of Software Testing Using Cuckoo Search Methods

2018 ◽  
Vol 7 (4.6) ◽  
pp. 302
Author(s):  
Dr. Anandam Velagandula ◽  
P. Buddha Reddy ◽  
N. Hanuman Reddy ◽  
G. Srikanth Reddy ◽  
Ch Anil
Keyword(s):  
Particle Swarm Optimization ◽  
Service Oriented Architecture ◽  
Heuristic Algorithms ◽  
Search Algorithm ◽  
Harmony Search ◽  
Interaction Strength ◽  
Particle Swarm ◽  
Cuckoo Search ◽  
Test Cases ◽  
Swarm Optimization

As of late number of meta based heuristic algorithms are suggested to fill in as the premise of test era technique (where shows the interaction strength) embracing  with Simulated Annealing (SA), Ant Colony Optimization (ACO), Cuckoo Search (CS), Genetic Algorithms (GA), Harmony Search (HS) and Particle Swarm Optimization (PSO). Albeit helpful methodologies are requiring particular area learning so as to permit successful tuning before great quality arrangements can be gotten. The multi-target molecule swarm optimization, and multithreading is utilized to overwhelm the compound judgement criteria for an ideal arrangement. The procedure and its related algorithms are assessed broadly utilizing diverse benchmarks and examinations. In our proposed technique test cases are advanced by utilizing Particle Swarm Optimization algorithm (PSO). At that point the streamlined test cases are organized by utilizing to enhanced Cuckoo Search algorithm (ECSA). As the quantity of inserted systems increments quickly, there has been developing interest for the utilization of Service Oriented Architecture (SOA) for some requests. At last, the enhanced outcome will be assessed by programming quality measures.

scholarly journals Algorithms for Generating Ordered Solutions for Explicit AND/OR Structures

2012 ◽  
Vol 44 ◽  
pp. 275-333 ◽  
Author(s):  
P. Ghosh ◽  
A. Sharma ◽  
P.P. Chakrabarti ◽  
P. Dasgupta
Keyword(s):  
Search Algorithm ◽  
Search Space ◽  
Compact Representation ◽  
Implicit Representation ◽  
Knowledge Based ◽  
The Matrix ◽  
Multiplication Problem ◽  
Best First Search ◽  
Alternative Solutions ◽  
Potential Use

We present algorithms for generating alternative solutions for explicit acyclic AND/OR structures in non-decreasing order of cost. The proposed algorithms use a best first search technique and report the solutions using an implicit representation ordered by cost. In this paper, we present two versions of the search algorithm -- (a) an initial version of the best first search algorithm, ASG, which may present one solution more than once while generating the ordered solutions, and (b) another version, LASG, which avoids the construction of the duplicate solutions. The actual solutions can be reconstructed quickly from the implicit compact representation used. We have applied the methods on a few test domains, some of them are synthetic while the others are based on well known problems including the search space of the 5-peg Tower of Hanoi problem, the matrix-chain multiplication problem and the problem of finding secondary structure of RNA. Experimental results show the efficacy of the proposed algorithms over the existing approach. Our proposed algorithms have potential use in various domains ranging from knowledge based frameworks to service composition, where the AND/OR structure is widely used for representing problems.

scholarly journals Theorizing the Triple Helix model: Past, present, and future

Triple Helix ◽  
2020 ◽  
pp. 1-38 ◽  
Author(s):  
Yuzhuo Cai ◽  
Henry Etzkowitz
Keyword(s):  
Organizational Behavior ◽  
Triple Helix ◽  
Explanatory Power ◽  
Theoretical Development ◽  
Knowledge Based ◽  
Research Fields ◽  
Triple Helix Model ◽  
The University ◽  
University Industry

The Triple Helix of university-industry-government interactions, highlighting the enhanced role of the university in the transition from industrial to knowledge-based society, has become widespread in innovation and entrepreneurship studies. We analyze classic literature and recent research, shedding light on the theoretical development of a model that has engendered controversy for being simultaneously analytical and normative, theoretical, practical and policy-relevant. We identify lacunae and suggest future analytical trajectories for theoretical development of the Triple Helix model. The explanatory power of Triple Helix has been strengthened by integrating various social science concepts, e.g. Simmel’s triad, Schumpeter’s organizational entrepreneur, institutional logics and social networks, into its framework. As scholars and practitioners from various disciplinary and inter-disciplinary research fields, e.g. artificial intelligence, political theory, sociology, professional ethics, higher education, regional geography and organizational behavior join Triple Helix studies or find their perspectives integrated, new directions appear for Triple Helix research.

Multi- Objective Crow Search and Fruit Fly Optimization for Combinatorial Test Case Prioritization

2021 ◽  
Vol 9 (4) ◽  
pp. 0-0
Keyword(s):  
Performance Metrics ◽  
Search Algorithm ◽  
Fitness Function ◽  
Test Case ◽  
Test Cases ◽  
Test Case Prioritization ◽  
Optimal Test ◽  
Fruit Fly Optimization ◽  
Average Percentage ◽  
Multi Objective

This paper proposes a novel test case prioritization technique, namely Multi- Objective Crow Search and Fruitfly Optimization (MOCSFO) for test case prioritization. The proposed MOCSFO is designed by integrating Crow search algorithm (CSA) and Chaotic Fruitfly optimization algorithm (CFOA). The optimal test cases are selected based on newly modelled fitness function, which consist of two parameters, namely average percentage of combinatorial coverage (APCC) and Normalized average of the percentage of faults detected (NAPFD). The test case to be selected is decided using a searching criterion or fitness based on sequential weighed coverage size. Accordingly, the effective searching criterion is formulated to determine the optimal test cases based on the constraints. The experimentation of the proposed MOCSFO method is performed by considering the performance metrics, like NAPFD, and APCC. The proposed MOCSFO outperformed the existing methods with enhanced NAPFD of 0.7, and APCC of 0.837.

scholarly journals Modified bug-1 algorithm based strategy for obstacle avoidance in multi robot system

2018 ◽  
Vol 144 ◽  
pp. 01012 ◽  
Author(s):  
Jom J. Kandathil ◽  
Robins Mathew ◽  
Somashekhar S. Hiremath
Keyword(s):  
Obstacle Avoidance ◽  
Target Location ◽  
Search Algorithm ◽  
Global Knowledge ◽  
Robot System ◽  
Practical Applications ◽  
Global Goal ◽  
Starting Location ◽  
Start Location ◽  
Multi Robot

One of the primary ability of an intelligent mobile robot system is obstacle avoidance. BUG algorithms are classic examples of the algorithms used for achieving obstacle avoidance. Unlike many other planning algorithms based on global knowledge, BUG algorithms assume only local knowledge of the environment and a global goal. Among the variations of the BUG algorithms that prevail, BUG-0, BUG-1 and BUG-2 are the more prominent versions. The exhaustive search algorithm present in BUG-1 makes it more reliable and safer for practical applications. Overall, this provides a more predictable and dependable performance. Hence, the essential focus in this paper is on implementing the BUG-1 algorithm across a group of robots to move them from a start location to a target location. The results are compared with the results from BUG-1 algorithm implemented on a single robot. The strategy developed in this work reduces the time involved in moving the robots from starting location to the target location. Further, the paper shows that the total distance covered by each robot in a multi robot-system is always lesser than or equal to that travelled by a single robot executing the same problem.

Sign in / Sign up

Export Citation Format

Share Document