Fusion of multi-sensor information is an important technology, which is growing exponentially due to its tremendous application potential in many areas. Effective fusion of data from sensors is very critical in increasing an intelligent system's capability to accomplish complex tasks. Appropriate fusion technologies are needed to be developed specially when a system requires redundant sensors to be used. More the redundancy in sensors, more is the computational complexity for controlling the system and more is its intelligence level. This research presents a strategy developed for multiple sensor fusion, based on geometric optimization. Each sensor's uncertainty has been modeled using classical Lagrangian optimization techniques. However, the uniqueness and effectiveness of the present technique lies on the fact that starting from the optimized value as initial estimate the accuracy of the sensory information has further been improved up to any pre defined bounded range, by developing two architectures – FFA (fission–fusion architecture) and FDD (fusion in differential domain). Sufficient evidences and analyses have been provided in the paper to show its effectiveness in various applications. 相似文献
A stochastic search technique, simulated annealing (SA), is used to optimize the operation of multiple reservoirs. Seminal application of annealing technique in general to multi-period, multiple-reservoir systems, along with problem representation and selection of different parameter values used in the annealing algorithm for specific cases is discussed. The search technique is improved with the help of heuristic rules, problem-specific information and concepts from the field of evolutionary algorithms. The technique is tested for application to a benchmark problem of four-reservoir system previously solved using a linear programming formulation and its ability to replicate the global optimum solution is examined. The technique is also applied to a system of four hydropower generating reservoirs in Manitoba, Canada, to derive optimal operating rules. A limited version of this problem is solved using a mixed integer nonlinear programming and results are compared with those obtained using SA. A better objective function value is obtained using simulated annealing than the value from a mixed integer non-linear programming model developed for the same problem. Results obtained from these applications suggest that simulated annealing can be used for obtaining near-optimal solutions for multi-period reservoir operation problems that are computationally intractable. 相似文献
This paper concerns the following problem: given a set of multi-attribute records, a fixed number of buckets and a two-disk system, arrange the records into the buckets and then store the buckets between the disks in such a way that, over all possible orthogonal range queries (ORQs), the disk access concurrency is maximized. We shall adopt the multiple key hashing (MKH) method for arranging records into buckets and use the disk modulo (DM) allocation method for storing buckets onto disks. Since the DM allocation method has been shown to be superior to any other allocation methods for allocating an MKH file onto a two-disk system for answering ORQs, the real issue is knowing how to determine an optimal way for organizing the records into buckets based upon the MKH concept.
A performance formula that can be used to evaluate the average response time, over all possible ORQs, of an MKH file in a two-disk system using the DM allocation method is first presented. Based upon this formula, it is shown that our design problem is related to a notoriously difficult problem, namely the Prime Number Problem. Then a performance lower bound and an efficient algorithm for designing optimal MKH files in certain cases are presented. It is pointed out that in some cases the optimal MKH file for ORQs in a two-disk system using the DM allocation method is identical to the optimal MKH file for ORQs in a single-disk system and the optimal average response time in a two-disk system is slightly greater than one half of that in a single-disk system. 相似文献
A method for detection of multiple open cracks in a slender Euler-Bernoulli beams is presented based on frequency measurements. The method is based on the approach given by Hu and Liang [J. Franklin Inst. 330 (5) (1993) 841], transverse vibration modelling through transfer matrix method and representation of a crack by rotational spring. The beam is virtually divided into a number of segments, which can be decided by the analyst, and each of them is considered to be associated with a damage parameter. The procedure gives a linear relationship explicitly between the changes in natural frequencies of the beam and the damage parameters. These parameters are determined from the knowledge of changes in the natural frequencies. After obtaining them, each is treated in turn to exactly pinpoint the crack location in the segment and determine its size. The forward, or natural frequency determination, problems are examined in the passing. The method is approximate, but it can handle segmented beams, any boundary conditions, intermediate spring or rigid supports, etc. It eliminates the need for any symbolic computation which is envisaged by Hu and Liang [J. Franklin Inst. 330 (5) (1993) 841] to obtain mode shapes of the corresponding uncracked beams. The proposed method gives a clear insight into the whole analysis. Case studies (numerical) are presented to demonstrate the method effectiveness for two simultaneous cracks of size 10% and more of section depth. The differences between the actual and predicted crack locations and sizes are less than 10% and 15% respectively. The numbers of segments into which the beam is virtually divided limits the maximum number of cracks that can be handled. The difference in the forward problem is less than 5%. 相似文献