Elementary Objects Research Articles

A new process-based ontology for KBE system implementation: application to inspection process planning

This paper focuses in the definition of a new ontology (Onto-Process) and the resulting informal model. The developed ontology constitutes an improvement to other ontologies since it covers the requirements of manufacturing processes engineering and, in particular, the inspection planning process with automated machines. Inspection planning activity usually implies to make repetitive and well-known decisions. These decisions are often based on the knowledge of inspection operators; therefore, it is a good candidate for implementing a knowledge-based engineering system. The sequence of activities involved in the inspection planning has been identified using Icam definition diagrams (IDEF0) in order to express the knowledge at a high level. These diagrams constitute an important support for defining the sequence of activities and the information flow. Later on, this information has been analyzed in depth using conceptual maps and it has been classified into units of knowledge. Then, each of these units of knowledge is decomposed into elementary objects of knowledge and relationships among them are defined. In a first approach, the ontology has been tested using a very particular but essential task in inspection planning: the activity related to the definition of contact points over inspection surfaces. In this activity, decisions must be made about the number, distribution, and sequencing of points. In the methodology developed in this paper the differences between form and non-form error inspection is considered. Finally, the knowledge required to support these decisions is represented using Onto-Process.

Structure of Hypercomplex Units and Exotic Numbers as Sections of Bi-Quaternions

A survey of all families of hypercomplex (HC-) numbers is suggested with emphasis on exotic sets. Systematic description of variety of representations of HC-units is given, and interior structure of the units is studied. Elementary math objects constituting the structure are demonstrated to possess variously algebraic, geometric and physical properties, being eigenfuctions of HC-vector operators, ideals of idempotent matrices, dyads (Lame coefficients) linking two 2-dimensional surfaces, projectors of matrix-vectors onto given axis, and spinors. It is also shown that full set of bi-quaternion numbers comprises as special cases real, complex, quaternion numbers and as well exotic sets split-complex and dual numbers. In particular a HC-unit of double numbers is found to be represented by a Pauli-type matrix, and a simple formula for null-modulus HC-unit of dual numbers is indicated.

Including parametric models in spectrogram decomposition.

Regarding the decomposition of an audio stream in elementary sound objects, the non-negative matrix factorization (NMF) is now one of the prominent tools that can be employed. For instance, in the context of an automatic music transcription application, the interest of the technique relies on its ability to use redundancies over a whole piece to hopefully be able to identify separated sound objects as musical notes. In this ideal case, the spectrogram factorizes into a matrix of inferred spectral atoms and a matrix of temporal activations associated to these atoms. However, the unconstrained version of the NMF does not guarantee that the resulting atoms are actually musical notes: the spectrum of a single note can be split into several atoms or, conversely, a single atom could represent more than one note. The work that will be presented here deals with parametric models designed to describe the spectral modifications that occur along the progress of a single audio event (e.g., a musical note) in order to obtain a more meaningful decomposition from a musical point of view.

Stablep-branes in Chern-Simons AdS supergravities

We construct static codimension-two branes in any odd dimension $D$, with a negative cosmological constant, and show that they are exact solutions of Chern-Simons (super)gravity theory for (super)${\mathrm{AdS}}_{D}$ coupled to external sources. The stability of these solutions is analyzed by counting the number of preserved supersymmetries. It is shown that static massive ($D\ensuremath{-}3$)-branes are unstable unless some suitable gauge fields are added and the brane is extremal. In particular, in three dimensions, a 0-brane is recognized as the negative mass counterpart of the Ba\~nados-Teitelboim-Zanelli black hole. For these 0-branes, we write explicitly magnetically charged Bogomol'nyi-Prasad-Sommerfield states with various numbers of preserved supersymmetries within the $OSp(p\ensuremath{\mid}2)\ifmmode\times\else\texttimes\fi{}OSp(q\ensuremath{\mid}2)$ supergroups. In five dimensions, we prove that stable 2-branes with magnetic charge always exist for the generic supergroup $SU(2,4\ensuremath{\mid}N)$, where $N\ensuremath{\ne}4$. For the special case $N=4$, in which Chern-Simons supergravity requires the addition of a nontrivial gauge field configuration in order to preserve the maximal number of degrees of freedom, we show for two different static 2-branes that they are Bogomol'nyi-Prasad-Sommerfield states (one of which is the ground state), and from the corresponding algebra of charges we show that the energy is bounded from below. In higher dimensions, our results admit a straightforward generalization, although there are presumably more solutions corresponding to different intersections of the elementary objects.

Optimization of supply diversity for the self-assembly of simple objects in two and three dimensions

The field of algorithmic self-assembly is concerned with the design and analysis of self-assembly systems from a computational perspective, that is, from the perspective of mathematical problems whose study may give insight into the natural processes through which elementary objects self-assemble into more complex ones. One of the main problems of algorithmic self-assembly is the minimum tile set problem, which in the extended formulation we consider, here referred to as MTSP, asks for a collection of types of elementary objects (called tiles) to be found for the self-assembly of an object having a pre-established shape. Such a collection is to be as concise as possible, thus minimizing supply diversity, while satisfying a set of stringent constraints having to do with important properties of the self-assembly process from its tile types. We present a study of what, to the best of our knowledge, is the first practical approach to MTSP. Our study starts with the introduction of an evolutionary heuristic to tackle MTSP and includes selected results from extensive experimentation with the heuristic on the self-assembly of simple objects in two and three dimensions, including the possibility of tile rotation. The heuristic we introduce combines classic elements from the field of evolutionary computation with a problem-specific variant of Pareto dominance into a multi-objective approach to MTSP.

M-BRANE BOUND STATES AND THE SUPERSYMMETRY OF BPS SOLUTIONS IN THE BAGGER–LAMBERT THEORY

We continue our study of BPS equations and supersymmetric configurations in the Bagger–Lambert (BL) theory. The superalgebra allows three different types of central extensions which correspond to compounds of various M-theory objects: M2-branes, M5-branes, gravity waves and Kaluza–Klein monopoles which intersect or have overlaps with the M2-branes whose dynamics is given by the BL action. As elementary objects they are all 1/2-BPS, and multiple intersections of n-branes generically break the supersymmetry into 1/2n, as it is well known. But a particular composite of M-branes can preserve from 1/16 up to 3/4 of the original [Formula: see text] supersymmetries as previously discovered. In this paper we provide the M-theory interpretation for various BPS equations, and also present explicit solutions to some 1/2-BPS equations.

Quantum fusion of strings (flux tubes) and domain walls

We consider formation of composite strings and domain walls as a result of fusion of two elementary objects (elementary strings in the first case and elementary walls in the second) located at a distance from each other. The tension of the composite object T_2 is assumed to be less than twice the tension of the elementary object T_1, so that bound states are possible. If in the initial state the distance d between the fusing strings or walls is much larger than their thickness and satisfies the conditions T_1 d^2 >> 1 (in the string case) and T_1 d^3 >> 1 (in the wall case), the problem can be fully solved quasiclassically. The fusion probability is determined by the first, "under the barrier" stage of the process. We find the bounce configuration and its extremal action S_B. In the wall problem e^{-S_B} gives the fusion probability per unit time per unit area. In the string case, due to a logarithmic infrared divergence, the problem is well formulated only for finite-length strings. The fusion probability per unit time can be found in the limit in which the string length is much larger than the distance between two merging strings.

Enhanced inquiry method for malicious object identification

This paper proposes a new technique for malicious object detec-tion and identification. The technique is based on a concept of vi-rus inquiry. The inquiry is an activity that is performed by the malicious object during its initiation. The malicious object uses this activity to ensure its uniqueness in memory. The inquiry can be regarded as a common behavior of malicious object such as viruses. The proposed system is designed using the concept of Ob-ject Oriented Programming (OOP) that treats the operating system, user program, and virus as objects. It is constructed of three ele-mentary objects that perform their activities depending on two da-tabases.

A Transformational Space Structuring the Counterpoint in Adès’s “Auf dem Wasser zu singen”

The third movement of Thomas Adès’s string quartet Arcadiana features a complex, free textural counterpoint that seems resistant to the transformational analysis of the common sort that focuses, as does motivic analysis, on a small family of structured objects. However, by choosing a suitable space of very elementary objects, the pitch processes of the various streams can be represented in an animation that shows how they are coordinated to create musical form.

Qualitative Spatial Reasoning for High-Resolution Remote Sensing Image Analysis

High-resolution (HR) remote-sensing images allow us to access new kinds of information. Classical techniques for image analysis, such as pixel-based classifications or region-based segmentations, do not allow to fully exploit the richness of this kind of images. Indeed, for many applications, we are interested in complex objects which can only be identified and analyzed by studying the relationships between the elementary objects which compose them. In this paper, the use of a spatial reasoning technique called region connection calculus for the analysis of HR remote-sensing images is presented. A graph-based representation of the spatial relationships between the regions of an image is used within a graph-matching procedure in order to implement an object detection algorithm.

3D continuum percolation approach and its application to lava-like fuel-containing materials behaviour forecast

The paper is devoted to the theoretical study of elementary permeable objects percolation and its application to real physical objects. Spheres and isotropic oriented capped sticks were chosen as elementary geometrical objects for percolation simulation, physically adequate for radiation defects behaviour description in brittle dielectrics, particularly in the so-called Lava-like Fuel Containing Materials (LFCM), where it effects their mechanical steadiness. LFCMs is high-radioactive glass, which was formed during active stage of well-known heavy nuclear accident, that occurred at Chornobyl nuclear facility in 1986. Physical processes taking place in the materials are of great practical interest. Furthermore, when applying percolation models to LFCM objects, an approximate behaviour forecast can be created. From the results of simulation, it appears that physical properties of the LFCM should drastically change within in the period of 2015 2045 calendar years, depending on variations in nuclear fuel content.

Probabilistic Model Checking of the One-Dimensional Ising Model

Probabilistic model checking is an emerging verification technology for probabilistic analysis. Its use has been started not only in computer science but also in interdisciplinary fields. In this paper, we show that probabilistic model checking allows one to analyze the magnetic behaviors of the one-dimensional Ising model, which describes physical phenomena of magnets. The Ising model consists of elementary objects called spins and its dynamics is often represented as the Metropolis method. To analyze the Ising model with probabilistic model checking, we build Discrete Time Markov Chain (DTMC) models that represent the behavior of the Ising model. Two representative physical quantities, i.e., energy and magnetization, are focused on. To assess these quantities using model checking, we devise formulas in Probabilistic real time Computation Tree Logic (PCTL) that represent the quantities. To demonstrate the feasibility of the proposed approach, we show the results of an experiment using the PRISM model checker.

Semantic fitting and reconstruction

The current methods to describe the shape of three-dimensional objects can be classified into two groups: methods following the composition of primitives approach and descriptions based on procedural shape representations . As a 3D acquisition device returns an agglomeration of elementary objects (e.g. a laser scanner returns points), the model acquisition pipeline always starts with a composition of primitives. Due to the semantic information carried with a generative description, a procedural model provides valuable metadata that make up the basis for digital library services: retrieval, indexing, and searching. An important challenge in computer graphics in the field of cultural heritage is to build a bridge between the generative and the explicit geometry description combining both worlds—the accuracy and systematics of generative models with the realism and the irregularity of real-world data. A first step towards a semantically enriched data description is a reconstruction algorithm based on decreasing exponential fitting. This approach is robust towards outliers and multiple dataset mixtures. It does not need a preceding segmentation and is able to fit a generative shape template to a point cloud identifying the parameters of a shape.

Conoscenza tacita e conoscenza esplicitata. Una ricerca cognitivista

The essay reports on a research inspired about a concept of tacit knowledge — valued in the second half of ’900 by Michael Polanyi — and, most in general, about the relationship between thought and language. The goal is about to show empirically the lack relationship between the two elements. Thought is not a tangible element if not by language. Anyway by language it is not possible to produce perfectly our thought.For this reason I emphasized the point that common man has not got a clear and unique idea not even about the most elementary objects (as a chair, as lamp or a lie.) in ordinary life. Defining a meaning who should be refer to a specific concept, people are not able to explicit all the typical elements about the intention of a concept, although people are able to delimit the extention of the concept itself.Through my analysis a few doubts have rised about cartesianan thesis in a clear and unique nature of human knowledge. Furthermore my analysis give me the chance to note the difference between people in a term definitions. Besides terminologics misunderstanding between interviewers and respondents are a classic theme of a methodological research. Lazarsfeld had already underlined the lack of attention to the compiling of questions and pre-codified answers, even so the standard questionnaire has based on a perfect condivision of an usual terms meaning between researchers, interviewers and respondents. By the fact that my respondents are not scientific researchers, the importance of this results for a science vision it is only an indirect matter. Eventought that full continuity between common knowledge and a scientific one is a thesis very supported in epistemological matter — by Schutz to Garfinkel, by Cicourel to the School of Edimburourgh, by Latour until Morin — it should be unjustified to give them irrelevant meaning.

Cluster dynamics of a uniform chain of dissipatively coupled rotators

The existence and stability of stationary cluster structures in uniform chains of dissipatively coupled rotators is investigated. Cluster synchronization is interpreted as the classical synchronization of cluster rotators, which are elementary structure-forming objects. The complete set of types of cluster rotators and simple cells is defined. This definition is equivalent to the definition of the complete set of types of cluster structures. The completeness of this set is proved. The problem of the stability of cluster structures is solved. Physical examples of chains of rotators and a physical interpretation of the results of this research are given.

An upland object based modelling of the vertical accuracy of the SRTM‐1 elevation dataset

The US National Elevation Dataset is used in order to assess the vertical accuracy of the SRTM‐1 DEM in the Humboldt Range (Nevada State of USA). Firstly the upland region, in which the error (elevation difference) is maximised, is delineated by density slicing of the slope image combined with size filtering of the segmented objects. Then major terrain sub‐classes are defined in the uplands region on the basis of both aspect and slope. Statistics indicate that the error is both geographic direction dependent (elevation is underestimated towards W, NW and N and over‐estimated towards E, SE and S), and linearly correlated to the terrain slope (the steeper the slope, the greater the /error/). Elementary terrain objects (aspect regions) are defined and parametrically represented on the basis of their geomorphometry and overall accuracy. A terrain object classification scheme and subsequent mapping prove that aspect is the key feature determining the SRTM accuracy.

Diffusion in tight confinement: A lattice-gas cellular automaton approach. II. Transport properties

In this second paper the authors study the transport properties of the lattice-gas cellular automaton presented in Paper I [J. Chem. Phys. 126, 194709 (2007)] to model adsorption and dynamics of particles in a lattice of confining cells. Their work shows how a surprisingly simple parallel rule applied to a static network of cells joined by links set in space and time can generate a wide range of dynamical behaviors. In their model the cells are the elementary constituent objects of the network. They are a portion of space structured in sites which are energetically different. Each cell can accommodate a given maximum number of particles, and each pair of neighboring cells can exchange at most one particle at a time. The predictions of the model are in qualitative agreement with both experimental observations and molecular dynamics simulation results.

QUARK MODEL ESTIMATES OF THE STRUCTURE OF THE MESON-N-N*(1/2-) TRANSITION VERTICES

We address an actual problem of baryon-resonance dominated meson-exchange processes in the low GeV regime, i.e. the phase and the structure of meson-NN* transition vertices. Our starting point is a quark-diquark model for the baryons (obeying approximate covariance; the mesons are kept as elementary objects), together with the relative phases for the NN vertices, as determined from low energy NN scattering. From the explicit representation of the N and N* baryons, we exemplify the derivation of phases, coupling constants and form factors of the NN* (J = 1/2-) transition vertices for pseudo-scalar, scalar and vector mesons.

Using Eigenvectors to Partition Circuits

Many fields, ranging from bioinformatics to databases to large-scale integrated circuits, deal with the interrelation between elementary objects. Objects are represented as vertices and the relationships between them are represented as nets (edges that connect two or more vertices) in the form of a hypergraph. We seek a placement of vertices that groups like objects and separates unlike objects. This involves separating related objects into a few, possibly disjoint, blocks. These hypergraph-partitioning problems are NP-hard so cannot be solved exactly, except for very small instances. We develop and use a numerical technique based on eigenvector decomposition of the connectivity matrix associated with the circuit netlist to partition hypergraphs emanating from circuit netlists. The eigenvector components of the circuit connectivity matrix are then used to determine vertex coordinates in one dimension that are then rounded in some fashion to determine block assignments. The inherent difficulty with eigenvector techniques is that the eigenvector components tend to cluster, making it difficult to determine correct block assignments. Our technique uses weights on nets, vertices, and fixed vertices to obtain a more “discrete” placement of vertices, making it easier to determine correct block assignments.

Special issue on Hybrid Intelligence using rough sets

The problem of imperfect knowledge under uncertain environments has been tackled for a long time by philosophers, logicians and mathematicians. Rough set theory proposed by Zdzislaw Pawlak [1] has attracted attention of many researchers and practitioners all over the world, and has a fast growing group of researchers interested in this methodology. Fuzzy set theory proposed by Lotfi Zadeh [2] helps to understand and manipulate imperfect knowledge. Fuzzy sets are defined by partial membership, in contrast to crisp membership used in classical definition of a set. Rough set theory, expresses vagueness, not by means of membership, but employing a boundary region of a set. The back bone of rough set theory is the approximation space and lower and upper approximations of a set. The approximation space is a classification of the domain of interest into disjoint categories. The lower approximation is a description of the domain objects which are known with certainty to belong to the subset of interest, whereas the upper approximation is a description of the objects which possibly belong to the subset. Any subset defined through its lower and upper approximations is called a rough set. The main advantage of rough set theory is that it does not need any preliminary or additional information about data – like probability in statistics, grade of membership in fuzzy set and so on. Readers may consult the International Rough Set Society Web page [3] for more online resources, publications etc. The Third International Conference on Hybrid Intelligent Systems (HIS’03) gathered individual researchers who see the need for synergy between various intelligent techniques. This special issue comprising of four papers is focused on hybrid intelligence using rough set theory and its applications. Papers were selected on the basis of fundamental ideas/concepts rather than the thoroughness of techniques deployed. The papers are organized as follows. In the first paper, Polkowski proposes a framework for hybridizing rough, fuzzy and neural computational models. The concept is based on rough mereology and by having rough inclusions that are logical connectives of rough mereology it is possible to construct granules of knowledge that constitute elementary objects for calculi merging rough, fuzzy and neurocomputing schemes. The idea of rough inclusions provide a bridge between rough and fuzzy theories linking them across the gap resulting from distinct approaches to model uncertainty of knowledge.