scholarly journals Algorithms for Finding Vulnerabilities and Deploying Additional Sensors in a Region with Obstacles

Electronics ◽  
2021 ◽  
Vol 10 (12) ◽  
pp. 1504
Author(s):  
Kibeom Kim ◽  
Sunggu Lee

Consider a two-dimensional rectangular region guarded by a set of sensors, which may be smart networked surveillance cameras or simpler sensor devices. In order to evaluate the level of security provided by these sensors, it is useful to find and evaluate the path with the lowest level of exposure to the sensors. Then, if desired, additional sensors can be placed at strategic locations to increase the level of security provided. General forms of these two problems are presented in this paper. Next, the minimum exposure path is found by first using the sensing limits of the sensors to compute an approximate “feasible area” of interest, and then using a grid within this feasible area to search for the minimum exposure path in a systematic manner. Two algorithms are presented for the minimum exposure path problem, and an additional subsequently executed algorithm is proposed for sensor deployment. The proposed algorithms are shown to require significantly lower computational complexity than previous methods, with the fastest proposed algorithm requiring O(n2.5) time, as compared to O(mn3) for a traditional grid-based search method, where n is the number of sensors, m is the number of obstacles, and certain assumptions are made on the parameter values.

Author(s):  
Robert L. McMasters ◽  
Filippo de Monte ◽  
James V. Beck ◽  
Donald E. Amos

This paper provides a solution for two-dimensional heating over a rectangular region on a homogeneous plate. It has application to verification of numerical conduction codes as well as direct application for heating and cooling of electronic equipment. Additionally, it can be applied as a direct solution for the inverse heat conduction problem, most notably used in thermal protection systems for re-entry vehicles. The solutions used in this work are generated using Green’s functions. Two approaches are used which provide solutions for either semi-infinite plates or finite plates with isothermal conditions which are located a long distance from the heating. The methods are both efficient numerically and have extreme accuracy, which can be used to provide additional solution verification. The solutions have components that are shown to have physical significance. The extremely precise nature of analytical solutions allows them to be used as prime standards for their respective transient conduction cases. This extreme precision also allows an accurate calculation of heat flux by finite differences between two points of very close proximity which would not be possible with numerical solutions. This is particularly useful near heated surfaces and near corners. Similarly, sensitivity coefficients for parameter estimation problems can be calculated with extreme precision using this same technique. Another contribution of these solutions is the insight that they can bring. Important dimensionless groups are identified and their influence can be more readily seen than with numerical results. For linear problems, basic heating elements on plates, for example, can be solved to aid in understanding more complex cases. Furthermore these basic solutions can be superimposed both in time and space to obtain solutions for numerous other problems. This paper provides an analytical two-dimensional, transient solution for heating over a rectangular region on a homogeneous square plate. Several methods are available for the solution of such problems. One of the most common is the separation of variables (SOV) method. In the standard implementation of the SOV method, convergence can be slow and accuracy lacking. Another method of generating a solution to this problem makes use of time-partitioning which can produce accurate results. However, numerical integration may be required in these cases, which, in some ways, negates the advantages offered by the analytical solutions. The method given herein requires no numerical integration; it also exhibits exponential series convergence and can provide excellent accuracy. The procedure involves the derivation of previously-unknown simpler forms for the summations, in some cases by virtue of the use of algebraic components. Also, a mathematical identity given in this paper can be used for a variety of related problems.


2014 ◽  
Author(s):  
Kolea Zimmerman ◽  
Daniel Levitis ◽  
Ethan Addicott ◽  
Anne Pringle

We present a novel algorithm for the design of crossing experiments. The algorithm identifies a set of individuals (a ?crossing-set?) from a larger pool of potential crossing-sets by maximizing the diversity of traits of interest, for example, maximizing the range of genetic and geographic distances between individuals included in the crossing-set. To calculate diversity, we use the mean nearest neighbor distance of crosses plotted in trait space. We implement our algorithm on a real dataset ofNeurospora crassastrains, using the genetic and geographic distances between potential crosses as a two-dimensional trait space. In simulated mating experiments, crossing-sets selected by our algorithm provide better estimates of underlying parameter values than randomly chosen crossing-sets.


2021 ◽  
Vol 8 (14) ◽  
pp. 73-90
Author(s):  
Perry Y.C. Lee ◽  
Joshua B. Lee

Abstract This paper presents the total time required to mow a two-dimensional rectangular region of grass using a push mower. In deriving the total time, each of the three ‘well known’ (or intuitive) mowing patterns to cut the entire rectangular grass area is used. Using basic mathematics, analytical and empirical time results for each of the three patterns taken to completely cover this rectangular region are presented, and examples are used to determine which pattern provides an optimal total time to cut a planar rectangular region. This paper provides quantitative information to aid in deciding which mowing pattern to use when cutting one’s lawn.


Author(s):  
Hamza Gharsellaoui ◽  
Hamadi Hasni

The paper deals with the purpose of one hybrid approach for solving the constrained two-dimensional cutting (2DC) problem. The authors study this hybrid approach that combines the genetic algorithm and the Tabu search method. For this problem, they assume a packing of a whole number of rectangular pieces to cut, and that all cuts are of guillotine type in one sheet of a fixed width and an infinite height. Finally, they undertake an extensive experimental study with a large number of problem instances extracted from the literature by the Hopper’s benchmarks in order to support and to prove their approach and to evaluate the performance.


2020 ◽  
Vol 32 (1) ◽  
pp. 51-67
Author(s):  
Jinting Wang ◽  
Sheng Zhu ◽  
Simiao Du

Abstract We develop a mathematical model to study optimal preventive maintenance (PM) strategy under a two-dimensional stair-case warranty policy considering both age and usage of a product. During the warranty term, sellers implement preventive maintenance within the stair-case region of the warranty policy and upon failure a product is repaired minimally and immediately. Our objective is to find the optimal PM strategy that minimizes the seller’s cost of warranty while jointly considering the age and usage intervals of the PM policy and the level of PM executed. We also discuss how our results compare to those in a two-dimensional warranty policy with a rectangular region, and we find that the stair-case policy is preferable for sellers. An algorithm is provided to find the optimal solution and a numerical example is presented to illustrate how to find an optimal strategy with our proposed method. We show numerically that the expected total warranty cost is convex both in the age and the usage of the product under certain conditions.


Author(s):  
STEVEN L. TANIMOTO ◽  
RUSS MILLER

The two-dimensional mesh computer architecture has proven to be an appropriate means to apply parallel computation to problems in image processing. However, this is most often done using local-neighbourhood operations to accomplish image filtering and morphological transformations. The discovery of structures in an image such as repetitions and symmetries is another form of visual analysis, and yet relatively little has been done to apply mesh computers to this problem. In this paper, we apply the primitive operations of prefix scanning and sorting to efficiently implement a repetition finding algorithm for arrays. The computational complexity of the algorithm on a n×n mesh is O(n log k) where k is the width of the largest repeated block in the array. The algorithm was implemented on a MasPar MP-1 computer. We describe variations of the algorithm for solving several related problems including the detection of partial symmetries in an image and repetitions in images modulo pixel-value transformations.


1992 ◽  
Vol 18 (3-4) ◽  
pp. 227-246 ◽  
Author(s):  
W.Kenneth Jenkins ◽  
Jeffrey C. Strait ◽  
Richard P. Faust

Sign in / Sign up

Export Citation Format

Share Document