Search results for "Computer Science Applications"
showing 10 items of 3993 documents
Chemical Bath Deposition as a Simple Way to Grow Isolated and Coalesced ZnO Nanorods for Light-Emitting Diodes Fabrication
2018
A way to grow and characterize isolated and coalesced ZnO nanorods on $p$ -GaN/sapphire structure is presented. Chemical bath deposition can be used to grow ZnO nanorods of device-quality, simply controlling the duration time of the growth process and the concentration of the nutrient solution in the bath. Increasing the duration of the process, as well as the concentration of the solution, leads to compact and sound layers instead of separated nanorods. However, too high concentrations stop the growth process. Light-emitting diodes fabricated on these ZnO-p-GaN heterostructure have a peak of electroluminescence at 400 nm and exhibit interesting electrical and optical properties. Optical po…
Toward a virtual reconstruction of an antique three-dimensional marble puzzle
2017
International audience; Abstract | Introduction | Related Work | Acquisition Setup, Proposed Prototype: Calibration and Visibility | Preprocessing of Scanned Three-Dimensional Fragment Data | Processing of Scanned Three-Dimensional Surface Data: Matching | Conclusion and Future Works | Appendices | Acknowledgments | ReferencesAbstract. The reconstruction of broken objects is an important field of research for many applications, such as art restoration, surgery, forensics, and solving puzzles. In archaeology, the reconstruction of broken artifacts is a very time-consuming task due to the handling of fractured objects, which are generally fragile. However, it can now be supported by three-dim…
Extending CSG with projections: Towards formally certified geometric modeling
2015
We extend traditional Constructive Solid Geometry (CSG) trees to support the projection operator. Existing algorithms in the literature prove various topological properties of CSG sets. Our extension readily allows these algorithms to work on a greater variety of sets, in particular parametric sets, which are extensively used in CAD/CAM systems. Constructive Solid Geometry allows for algebraic representation which makes it easy for certification tools to apply. A geometric primitive may be defined in terms of a characteristic function, which can be seen as the zero-set of a corresponding system along with inequality constraints. To handle projections, we exploit the Disjunctive Normal Form,…
Ontology and protocol secure for SCADA: Int. J. of Metadata, Semantics and Ontologies, 2014 Vol.9, No.2, pp.114 - 127
2014
International audience; In this work, we present a semantic cyber security system and we study its semantic intelligent systems vulnerabilities, focusing on the semantic attacks. For resolving semantic problems we propose a security global solution for the new generation of SCADA systems. The proposed solution aims at protecting critical semantic SCADA processes from the effects of major failures and semantic vulnerabilities in the modern IT-SCADA network. We used a security block in the global network access point, security protocols deployed in different network (OSI) levels and security ontologies deployed in security devices. We used our mixed coordinates (ECC) cryptography solution, th…
Guest Editors' Introduction: Multimedia Metadata and Semantic Management
2009
This special issue assesses the current status and technologies and describes major challenges and proper solutions for effective multimedia production and management related to evolving Semantic Web strategies. The included articles, which cover different facets of the semantic management of multimedia and multimedia metadata from retrieval and processing to consumption and presentation, represent a step forward in research targeted at improving aspects of the semantic metadata life cycle.
Extensions of the witness method to characterize under-, over- and well-constrained geometric constraint systems
2011
International audience; This paper describes new ways to tackle several important problems encountered in geometric constraint solving, in the context of CAD, and which are linked to the handling of under- and over-constrained systems. It presents a powerful decomposition algorithm of such systems. Our methods are based on the witness principle whose theoretical background is recalled in a first step. A method to generate a witness is then explained. We show that having a witness can be used to incrementally detect over-constrainedness and thus to compute a well-constrained boundary system. An algorithm is introduced to check if anchoring a given subset of the coordinates brings the number …
The Hierarchical Agglomerative Clustering with Gower index: a methodology for automatic design of OLAP cube in ecological data processing context
2015
In Press, Corrected Proof; International audience; The OLAP systems can be an improvement for ecological studies. In fact, ecology studies, follows and analyzes phenomenon across space and time and according to several parameters. OLAP systems can provide to ecologists browsing in a large dataset. One focus of the current research on OLAP system is the automatic design of OLAP cubes and of data warehouse schemas. This kind of works makes accessible OLAP technology to non information technology experts. But to be efficient, the automatic OLAP building must take into account various cases. Moreover the OLAP technology is based on the concept of hierarchy. Thereby the hierarchical clustering m…
OPTIMIZATIONS FOR TENSORIAL BERNSTEIN–BASED SOLVERS BY USING POLYHEDRAL BOUNDS
2010
The tensorial Bernstein basis for multivariate polynomials in n variables has a number 3n of functions for degree 2. Consequently, computing the representation of a multivariate polynomial in the tensorial Bernstein basis is an exponential time algorithm, which makes tensorial Bernstein-based solvers impractical for systems with more than n = 6 or 7 variables. This article describes a polytope (Bernstein polytope) with a number of faces, which allows to bound a sparse, multivariate polynomial expressed in the canonical basis by solving several linear programming problems. We compare the performance of a subdivision solver using domain reductions by linear programming with a solver using a c…
Regularization of chattering phenomena via bounded variation controls
2018
In control theory, the term chattering is used to refer to strong oscillations of controls, such as an infinite number of switchings over a compact interval of times. In this paper we focus on three typical occurences of chattering: the Fuller phenomenon, referring to situations where an optimal control switches an infinite number of times over a compact set; the Robbins phenomenon, concerning optimal control problems with state constraints, meaning that the optimal trajectory touches the boundary of the constraint set an infinite number of times over a compact time interval; the Zeno phenomenon, referring as well to an infinite number of switchings over a compact set, for hybrid optimal co…
Computerized delimitation of odorant areas in gas-chromatography-olfactometry by kernel density estimation: Data processing on French white wines
2017
International audience; GC-O using the detection frequency method gives a list of odor events (OEs) where each OE is described by a linear retention index (LRI) and by the aromatic descriptor given by a human assessor. The aim of the experimenter is to gather OEs in a total olfactogram on which he tries to delimit odorant areas (OAs), then to compute each detection frequency. This paper proposes a computerized mathematical method based on kernel density estimation that makes up the total olfactogram as continuous and differentiable function from the OEs LRI only. The corresponding curve looks like a chromatogram, the peaks of which are potential OAs. The limits of an OA are the LRI of the t…