53 resultados para Binary programming
Resumo:
In multiobject pattern recognition the height of the correlation peaks should be controlled when the power spectrum of ajoint transform correlator is binarized. In this paper a method to predetermine the value of detection peaks is demonstrated. The technique is based on a frequency-variant threshold in order to remove the intraclass terms and on a suitable factor to normalize the binary joint power spectrum. Digital simulations and experimental hybrid implementation of this method were carried out.
Resumo:
The statistical theory of signal detection and the estimation of its parameters are reviewed and applied to the case of detection of the gravitational-wave signal from a coalescing binary by a laser interferometer. The correlation integral and the covariance matrix for all possible static configurations are investigated numerically. Approximate analytic formulas are derived for the case of narrow band sensitivity configuration of the detector.
Resumo:
Molecular dynamics simulation is applied to the study of the diffusion properties in binary liquid mixtures made up of soft-sphere particles with different sizes and masses. Self- and distinct velocity correlation functions and related diffusion coefficients have been calculated. Special attention has been paid to the dynamic cross correlations which have been computed through recently introduced relative mean molecular velocity correlation functions which are independent on the reference frame. The differences between the distinct velocity correlations and diffusion coefficients in different reference frames (mass-fixed, number-fixed, and solvent-fixed) are discussed.
Resumo:
Biometric system performance can be improved by means of data fusion. Several kinds of information can be fused in order to obtain a more accurate classification (identification or verification) of an input sample. In this paper we present a method for computing the weights in a weighted sum fusion for score combinations, by means of a likelihood model. The maximum likelihood estimation is set as a linear programming problem. The scores are derived from a GMM classifier working on a different feature extractor. Our experimental results assesed the robustness of the system in front a changes on time (different sessions) and robustness in front a change of microphone. The improvements obtained were significantly better (error bars of two standard deviations) than a uniform weighted sum or a uniform weighted product or the best single classifier. The proposed method scales computationaly with the number of scores to be fussioned as the simplex method for linear programming.
Resumo:
We present a study of binary mixtures of Bose-Einstein condensates confined in a double-well potential within the framework of the mean field Gross-Pitaevskii (GP) equation. We re-examine both the single component and the binary mixture cases for such a potential, and we investigate what are the situations in which a simpler two-mode approach leads to an accurate description of their dynamics. We also estimate the validity of the most usual dimensionality reductions used to solve the GP equations. To this end, we compare both the semi-analytical two-mode approaches and the numerical simulations of the one-dimensional (1D) reductions with the full 3D numerical solutions of the GP equation. Our analysis provides a guide to clarify the validity of several simplified models that describe mean-field nonlinear dynamics, using an experimentally feasible binary mixture of an F = 1 spinor condensate with two of its Zeeman manifolds populated, m = ±1.
Resumo:
We present a study of binary mixtures of Bose-Einstein condensates confined in a double-well potential within the framework of the mean field Gross-Pitaevskii (GP) equation. We re-examine both the single component and the binary mixture cases for such a potential, and we investigate what are the situations in which a simpler two-mode approach leads to an accurate description of their dynamics. We also estimate the validity of the most usual dimensionality reductions used to solve the GP equations. To this end, we compare both the semi-analytical two-mode approaches and the numerical simulations of the one-dimensional (1D) reductions with the full 3D numerical solutions of the GP equation. Our analysis provides a guide to clarify the validity of several simplified models that describe mean-field nonlinear dynamics, using an experimentally feasible binary mixture of an F = 1 spinor condensate with two of its Zeeman manifolds populated, m = ±1.
Resumo:
The reason for this study is to propose a new quantitative approach on how to assess the quality of Open Access University Institutional Repositories. The results of this new approach are tested in the Spanish University Repositories. The assessment method is based in a binary codification of a proposal of features that objectively describes the repositories. The purposes of this method are assessing the quality and an almost automatically system for updating the data of the characteristics. First of all a database was created with the 38 Spanish institutional repositories. The variables of analysis are presented and explained either if they are coming from bibliography or are a set of new variables. Among the characteristics analyzed are the features of the software, the services of the repository, the features of the information system, the Internet visibility and the licenses of use. Results from Spanish universities ARE provided as a practical example of the assessment and for having a picture of the state of the development of the open access movement in Spain.
Resumo:
Annualising work hours (AH) is a means of achievement flexibility in the use of human resources to face the seasonal nature of demand. In Corominas et al. (1) two MILP models are used to solve the problem of planning staff working hours with annual horizon. The costs due to overtime and to the employment of temporary workers are minimised, and the distribution of working time over the course of the year for each worker and the distribution of working time provided by temporary workers are regularised.In the aforementioned paper, the following is assumed: (i) the holiday weeks are fixed a priori and (ii) the workers are from different categories who are able to perform specific type of task have se same efficiency; moreover, the values of the binary variables (and others) in the second model are fixed to those in the first model (thus, in the second model these will intervene as constants and not as variables, resulting in an LP model).In the present paper, these assumptions are relaxed and a more general problem is solved. The computational experiment leads to the conclusion that MILP is a technique suited to dealing with the problem.
Resumo:
This paper presents a programming environment for supporting learning in STEM, particularly mobile robotic learning. It was designed to maintain progressive learning for people with and without previous knowledge of programming and/or robotics. The environment was multi platform and built with open source tools. Perception, mobility, communication, navigation and collaborative behaviour functionalities can be programmed for different mobile robots. A learner is able to programme robots using different programming languages and editor interfaces: graphic programming interface (basic level), XML-based meta language (intermediate level) or ANSI C language (advanced level). The environment supports programme translation transparently into different languages for learners or explicitly on learners’ demand. Learners can access proposed challenges and learning interfaces by examples. The environment was designed to allow characteristics such as extensibility, adaptive interfaces, persistence and low software/hardware coupling. Functionality tests were performed to prove programming environment specifications. UV BOT mobile robots were used in these tests
Resumo:
Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating the treatment of possibilistic uncertainty at the object-language level. In spite of its expressive power, an important limitation in P-DeLP is that imprecise, fuzzy information cannot be expressed in the object language. One interesting alternative for solving this limitation is the use of PGL+, a possibilistic logic over Gödel logic extended with fuzzy constants. Fuzzy constants in PGL+ allow expressing disjunctive information about the unknown value of a variable, in the sense of a magnitude, modelled as a (unary) predicate. The aim of this article is twofold: firstly, we formalize DePGL+, a possibilistic defeasible logic programming language that extends P-DeLP through the use of PGL+ in order to incorporate fuzzy constants and a fuzzy unification mechanism for them. Secondly, we propose a way to handle conflicting arguments in the context of the extended framework.