Search results for "Algorithm"
showing 10 items of 4887 documents
Behavior adaptation and selection.
2010
6 pages; The evolutionary approach to behavior is concerned with the evolutionary origin and adaptive function of behavioral traits. Like any other part of the phenotype, behavior can be shaped by natural selection to produce adaptations. However, behavior often shows large phenotypic variation and flexibility, and can be both – subject to selection and a major agent of selection. Therefore, the study of adaptation and evolution of behavior is a particularly complex one, involving a wide range of methodologies and techniques, including mathematical modeling, comparative methods, phenotypic engineering, quantitative genetics, genetic dissection, and artificial selection.
Real-Time Routing Selection in Flexible Manufacturing Systems
1993
Routing flexibility is one of the main peculiarities of Flexible Manufacturing Systems. This paper proposes three methods for real-time routing selection. The first one makes decisions comparing the current workload of machines in each alternative path. The second method considers the current workloads at the bottleneck machines in each allowed route. The third approach makes real-time decisions minimizing a merit index that represents a measure of the still required resource amount. The index is computed by short discrete-event simulation runs. Some case studies evaluate and compare the proposed approaches.
An Interactive Simple Indicator-Based Evolutionary Algorithm (I-SIBEA) for Multiobjective Optimization Problems
2015
This paper presents a new preference based interactive evolutionary algorithm (I-SIBEA) for solving multiobjective optimization problems using weighted hypervolume. Here the decision maker iteratively provides her/his preference information in the form of identifying preferred and/or non-preferred solutions from a set of nondominated solutions. This preference information provided by the decision maker is used to assign weights of the weighted hypervolume calculation to solutions in subsequent generations. In any generation, the weighted hypervolume is calculated and solutions are selected to the next generation based on their contribution to the weighted hypervolume. The algorithm is compa…
Tracking of Quantized Signals Based on Online Kernel Regression
2021
Kernel-based approaches have achieved noticeable success as non-parametric regression methods under the framework of stochastic optimization. However, most of the kernel-based methods in the literature are not suitable to track sequentially streamed quantized data samples from dynamic environments. This shortcoming occurs mainly for two reasons: first, their poor versatility in tracking variables that may change unpredictably over time, primarily because of their lack of flexibility when choosing a functional cost that best suits the associated regression problem; second, their indifference to the smoothness of the underlying physical signal generating those samples. This work introduces a …
Search forBs0→μ+μ−andB0→μ+μ−Decays with CDF II
2011
A search has been performed for B{sub s}{sup 0} {yields} {mu}{sup +}{mu}{sup -} and B{sup 0} {yields} {mu}{sup +}{mu}{sup -} decays using 7 fb{sup -1} of integrated luminosity collected by the CDF II detector at the Fermilab Tevatron collider. The observed number of B{sup 0} candidates is consistent with background-only expectations and yields an upper limit on the branching fraction of {Beta}(B{sup 0} {yields} {mu}{sup +}{mu}{sup -}) < 6.0 x 10{sup -9} at 95% confidence level. We observe an excess of B{sub s}{sup 0} candidates. The probability that the background processes alone could produce such an excess or larger is 0.27%. The probability that the combination of background and the expe…
Hardware-efficient matrix inversion algorithm for complex adaptive systems
2012
This work shows an FPGA implementation for the matrix inversion algebra operation. Usually, large matrix dimension is required for real-time signal processing applications, especially in case of complex adaptive systems. A hardware efficient matrix inversion procedure is described using QR decomposition of the original matrix and modified Gram-Schmidt method. This works attempts a direct VHDL description using few predefined packages and fixed point arithmetic for better optimization. New proposals for intermediate calculations are described, leading to efficient logic occupation together with better performance and accuracy in the vector space algebra. Results show that, for a relatively s…
From Random Walker to Vehicular Traffic: Motion on a Circle
2014
Driving of cars on a highway is a complex process which can be described by deterministic and stochastic forces. It leads to equations of motion with asymmetric interaction and dissipation as well as to new energy flow law already presented at previous TRAFFIC AND GRANULAR FLOW meetings. Here we consider a model, where motion of an asymmetric random walker on a ring with periodic boundary conditions takes place. It is related to driven systems with active particles, energy input and depot. This simple model can be further developed towards more complicated ones, describing vehicular or pedestrian traffic. Three particular cases are considered, starting with discrete coordinate and time, the…
Importance of quantiser design compared to optimal multigrid motion estimation in video coding
2000
Adaptive flow computation and DCT quantisation play complementary roles in motion compensated video coding schemes. Since the introduction of the intuitive entropy-constrained motion estimation of Dufaux et al. (1995), several optimal variable-size block matching algorithms have been proposed. Many of these approaches put forward their intrinsic optimality, but the corresponding visual effect has not been explored. The relative importance of optimal multigrid motion estimation with regard to quantisation is addressed in the context of MPEG-like coding. It is shown that while simpler (suboptimal) motion estimates give subjective results as good as the optimal motion estimates, small enhancem…
TU-E-116-01: Clinical Implementation for Advanced Brachytherapy Dose Calculation Algorithms Beyond the TG-43 Formalism
2013
With the recent introduction of heterogeneity correction algorithms for brachytherapy, the AAPM community is still unclear on how to commission and implement these into clinical practice. The recently‐published AAPM TG‐186 report discusses important issues for clinical implementation of these algorithms. In this practical medical physics course, specific examples on how to perform the commissioning process are presented, as well as descriptions of the clinical impact from recent literature reporting comparisons of TG‐43 and heterogeneity‐based dosimetry. A proposed commissioning flowchart will be discussed, guiding the audience through the clinical process. Further, QA tests specific to the…
MHT-X: Offline Multiple Hypothesis Tracking with Algorithm X
2021
An efficient and versatile implementation of offline multiple hypothesis tracking with Algorithm X for optimal association search was developed using Python. The code is intended for scientific applications that do not require online processing. Directed graph framework is used and multiple scans with progressively increasing time window width are used for edge construction for maximum likelihood trajectories. The current version of the code was developed for applications in multiphase hydrodynamics, e.g. bubble and particle tracking, and is capable of resolving object motion, merges and splits. Feasible object associations and trajectory graph edge likelihoods are determined using weak mas…