Search results for "General Computer Science"
showing 10 items of 895 documents
Robust technique for 3D shape reconstruction
2017
Abstract In this paper a robust and simple scheme is presented for three dimensional (3D) shape reconstruction of real object. A novel composite pattern technique is proposed for projecting the light pattern on the object of interest. The proposed scheme reduces the number of patterns by combining the primary color coded channels into one composite format. Our approach uses both spatial and temporal intensity variation for calibration and construction phase. Gamma calibration is considered with the propose scheme. High quality depth map is obtained from the linear light reflected by the shape of object without complex calculations. Experimental results demonstrated that proposed technique i…
Economic Robustness Analysis of Adaptive Chart Schemes for Monitoring the Total Nonconformities Number in Inspection Units
2015
In recent years, a variety of enhanced schemes for the c chart have been developed aimed at the effectiveness improving of the related statistical process control (SPC) procedures. However, the performance of such chart schemes can be very sensitive to values assumed for some operating and cost parameters, in particular to the considered process shift magnitude arising from out-of-control conditions. In such a circumstance, the effectiveness of such chart schemes can be subjected to substantial reductions when they are implemented in operative contexts given that, in practice, such value is unknown and it can be very difficult to accurately estimate. For this reason, in the present paper i…
L’expérience du consommateur dans le commerce de détail. Une revue de littérature
2013
Résumé Le thème de l’expérience s’est constitué en objet de recherche en marketing, grâce aux efforts investis par de nombreux distributeurs dans la création d’offres expérientielles. La littérature académique s’est d’abord concentrée sur les antécédents, la recherche et les conséquences de l’expérience, avant de prendre en compte le contenu même de l’expérience. Les stratégies des détaillants peuvent être analysées en mobilisant des grilles de lecture fondées sur la nature de la participation du consommateur à la production de l’expérience, ou sur le caractère extraordinaire ou ordinaire de l’expérience proposée. Le modèle synthétique proposé permet de rendre compte de l’expérience du con…
A Cooperative Multi-Agent System for Crowd Sensing Based Estimation in Smart Cities
2020
The concept of Smart City has spread as a solution to ensure better access to information and services to citizens, but also as a means to reduce the environmental footprint of cities. To this end, a continuous and wide observation of the environment is necessary to analyze information that enables government bodies to act on the environment appropriately. Moreover, a diffused acquisition of information requires adequate infrastructure and proper devices, which results in relevant installation and maintenance costs. Our proposal enables reducing the number of necessary sensors to be deployed while ensuring that information is available at any time and anywhere. We present the HybridIoT syst…
A beam search algorithm for minimizing crane times in premarshalling problems
2022
The premarshalling problem consists of sorting the containers placed in a bay of the container yard so that they can be retrieved in the order in which they will be required. We study the premarshalling problem with crane time minimization objective and develop a beam search algorithm, with some new elements adapted to the characteristics of the problem, to solve it. We propose various evaluation criteria, depending on the type of container movement, for its local evaluation; a new heuristic algorithm including local search for blue its global evaluation; and several new dominance rules. The computational study shows the contribution of each new element. The performance of the complete algo…
Approximate Taylor methods for ODEs
2017
Abstract A new method for the numerical solution of ODEs is presented. This approach is based on an approximate formulation of the Taylor methods that has a much easier implementation than the original Taylor methods, since only the functions in the ODEs, and not their derivatives, are needed, just as in classical Runge–Kutta schemes. Compared to Runge–Kutta methods, the number of function evaluations to achieve a given order is higher, however with the present procedure it is much easier to produce arbitrary high-order schemes, which may be important in some applications. In many cases the new approach leads to an asymptotically lower computational cost when compared to the Taylor expansio…
Statistical properties of general Markov dynamical sources: applications to information theory
2004
In \textitDynamical sources in information theory: fundamental intervals and word prefixes, B. Vallée studies statistical properties of words generated by dynamical sources. This is done using generalized Ruelle operators. The aim of this article is to generalize sources for which the results hold. First, we avoid the use of Grotendieck theory and Fredholm determinants, this allows dynamical sources that cannot be extended to a complex disk or that are not analytic. Second, we consider Markov sources: the language generated by the source over an alphabet \textbfM is not necessarily \textbfM^*.
Scatter search for an uncapacitated p-hub median problem
2015
Scatter search is a population-based method that has been shown to yield high-quality outcomes for combinatorial optimization problems. It uses strategies for combining solution vectors that have proved effective in a variety of problem settings. In this paper, we present a scatter search implementation for an NP -hard variant of the classic p-hub median problem. Specifically, we tackle the uncapacitated r-allocation p-hub median problem, which consists of minimizing the cost of transporting the traffics between nodes of a network through special facilities that act as transshipment points. This problem has a significant number of applications in practice, such as the design of transportati…
A hybrid evolution strategy for the open vehicle routing problem
2010
This paper presents a hybrid evolution strategy (ES) for solving the open vehicle routing problem (OVRP), which is a well-known combinatorial optimization problem that addresses the service of a set of customers using a homogeneous fleet of non-depot returning capacitated vehicles. The objective is to minimize the fleet size and the distance traveled. The proposed solution method manipulates a population of @m individuals using a (@m+@l)-ES; at each generation, a new intermediate population of @l offspring is produced via mutation, using arcs extracted from parent individuals. The selection and combination of arcs is dictated by a vector of strategy parameters. A multi-parent recombination …
First-principles calculations on surface hydroxyl impurities in BaF2
2012
Abstract OH − impurities located near the (1 1 1) BaF 2 surface have been studied by using density functional theory (DFT) with hybrid exchange potentials, namely DFT-B3PW. Twenty surface OH − configurations were studied, and the hydroxyls located on the first surface layer are the energetically most favorable configurations. For the (1 1 1) BaF 2 surface atomic layers, the surface hydroxyls lead to a remarkable XY -translation and a dilating effect in the Z -direction, overcoming the surface shrinking effect in the perfect slab. Bond population analysis shows that the surface effect strengthens the covalency of surface OH − impurities. The studies on band structures and density of states (…