Search results for "General Computer Science"
showing 10 items of 895 documents
An Approach to the Automatic Comparison of Reference Point-Based Interactive Methods for Multiobjective Optimization
2021
Solving multiobjective optimization problems means finding the best balance among multiple conflicting objectives. This needs preference information from a decision maker who is a domain expert. In interactive methods, the decision maker takes part in an iterative process to learn about the interdependencies and can adjust the preferences. We address the need to compare different interactive multiobjective optimization methods, which is essential when selecting the most suited method for solving a particular problem. We concentrate on a class of interactive methods where a decision maker expresses preference information as reference points, i.e., desirable objective function values. Compari…
Local Normal Forms for First-Order Logic with Applications to Games and Automata
1999
Building on work of Gaifman [Gai82] it is shown that every first-order formula is logically equivalent to a formula of the form ∃ x_1,...,x_l, \forall y, φ where φ is r-local around y, i.e. quantification in φ is restricted to elements of the universe of distance at most r from y. \par From this and related normal forms, variants of the Ehrenfeucht game for first-order and existential monadic second-order logic are developed that restrict the possible strategies for the spoiler, one of the two players. This makes proofs of the existence of a winning strategy for the duplicator, the other player, easier and can thus simplify inexpressibility proofs. \par As another application, automata mode…
The pruning-grafting lattice of binary trees
2008
AbstractWe introduce a new lattice structure Bn on binary trees of size n. We exhibit efficient algorithms for computing meet and join of two binary trees and give several properties of this lattice. More precisely, we prove that the length of a longest (resp. shortest) path between 0 and 1 in Bn equals to the Eulerian numbers 2n−(n+1) (resp. (n−1)2) and that the number of coverings is (2nn−1). Finally, we exhibit a matching in a constructive way. Then we propose some open problems about this new structure.
Localized forms of the LBB condition and a posteriori estimates for incompressible media problems
2018
Abstract The inf–sup (or LBB) condition plays a crucial role in analysis of viscous flow problems and other problems related to incompressible media. In this paper, we deduce localized forms of this condition that contain a collection of local constants associated with subdomains instead of one global constant for the whole domain. Localized forms of the LBB inequality imply estimates of the distance to the set of divergence free fields. We use them and deduce fully computable bounds of the distance between approximate and exact solutions of boundary value problems arising in the theory of viscous incompressible fluids. The estimates are valid for approximations, which satisfy the incompres…
An efficient data model for energy prediction using wireless sensors
2019
International audience; Energy prediction is in high importance for smart homes and smart cities, since it helps reduce power consumption and provides better energy and cost savings. Many algorithms have been used for predicting energy consumption using data collected from Internet of Things (IoT) devices and wireless sensors. In this paper, we propose a system based on Multilayer Perceptron (MLP) to predict energy consumption of a building using collected information (e.g., light energy, day of the week, humidity, temperature, etc.) from a Wireless Sensor Network (WSN). We compare our system against four other classification algorithms, namely: Linear Regression (LR), Support Vector Machin…
Mathematical logic and quantum finite state automata
2009
AbstractThis paper is a review of the connection between formulas of logic and quantum finite-state automata in respect to the language recognition and acceptance probability of quantum finite-state automata. As is well known, logic has had a great impact on classical computation, it is promising to study the relation between quantum finite-state automata and mathematical logic. After a brief introduction to the connection between classical computation and logic, the required background of the logic and quantum finite-state automata is provided and the results of the connection between quantum finite-state automata and logic are presented.
An overall description of retinotopic mapping in the cat's visual cortex areas 17, 18, and 19.
1985
Mathematical functions are derived which model the retinotopic mapping in the cat's visual cortical areas 17, 18, and 19. All three mappings are simple modifications of a complex power function with an exponent of 0.43. This function is decomposed so as to give an intermediate stage which is common to all three mappings and can be regarded as a model of the lateral geniculate nucleus mapping. The influence of retinotopic mapping on visual receptive fields was studied. The results show that a dependence of the receptive field properties on the position in the visual field is to be expected.
On the analysis of the cat's pattern recognition system
1983
The objective of the paper is to determine in abstract terms the algorithms used by the cat detecting simple patterns and to quantify the contributions of the visual areas 17, 18, 19 for this task. The data incorporated in the algorithm are collected from behavioral experiments where the animals had to distinguish between two patterns. The patterns were superimposed with gaussian noise and the detection probability was measured. The resulting model describes pattern recognition in two steps: first extraction of features and second classification. The test of the validity of the model system was to predict the outcome of similar experiments but with different patterns. With the help of the m…
Modelling the carbon Snoek peak in ferrite: Coupling molecular dynamics and kinetic Monte-Carlo simulations
2008
Abstract Molecular statics, molecular dynamics and kinetic Monte-Carlo are used to model the carbon Snoek peak in ferrite. Using an interatomic EAM potential for the Fe–C system, saddle point energies for the diffusion of carbon have been evaluated under uniaxial stress by molecular statics. These energies have been reintroduced in a kinetic Monte-Carlo scheme to predict the repartition of carbon atoms in different octahedral sites. This repartition leads to an anelastic deformation calculated by molecular dynamics, which causes internal friction (the Snoek peak) for cyclic stress. This approach leads to quantitative predictions of the internal friction, which are in good agreement with exp…
Introductory Quantum Physics Courses using a LabVIEW multimedia module
2007
We present the development of a LabVIEW multimedia module for introductory Quantum Physics courses and our experience in the use of this application as an educational tool in learning methodologies. The program solves the Time Dependent Schrodinger Equation for arbitrary potentials. We describe the numerical method used for solving this equation, as well as some mathematical tools employed to reduce the calculation time and to obtain more accurate results. As an illustration, we present the evolution of a wave packet for three different potentials: the repulsive barrier potential, the repulsive step potential, and the harmonic oscillator. This application has been successfully integrated in…