ppxscal/embedding_network huggingface dataset:
Customized Slider Bars for Adjusting Multi-dimension Parameter Sets
Authors: Shigeru Owada, Makoto Okabe, Takeo Igarashi, Frank Nielsen, Norimichi Tsumura
Venue: Proceedings of the 8th international symposium on Smart Graphics (2007)

Application softwares usually support a single set of user interaction tools that are supposed to be optimal. It is satisfactory if the user interface (UI) is really optimal for everyone. However, since the user's intent and the preference vary one by one, such fixed toolkits may cause inefficiency of the UI.
An Improved Fingerprint Recognition Algorithm Using EBFNN
Authors: Jing Luo, Shuzhong Lin, Jianyun Ni, Ming Lei
Venue: Proceedings of the 2008 Second International Conference on Genetic and Evolutionary Computing (2008)

Radial basis function neural network (RBFNN) is widely applied in pattern recognition. Comparing with the Gaussian function of RBFNN, the ellipsoidal basis function (EBF) can make the partition of input space more specific. Ellipsoidal basis function neural network (EBFNN) is a forward-feedback neural network of which hidden-layer function is EBF, which can make the partition of input space limitary and bounded. A novel fingerprint recognition algorithm using EBFNN has been proposed in this paper. Wavelet transform (WT) is a mathematical tool based on many-layer function decomposition. Firstly, fingerprint features are extracted by six-layer WT decomposition on binary images. Then, the extracted features are input into the designed EBFNN. Finally, EBFNN is trained and fingerprint recognition is accomplished by the trained EBFNN. The resulting algorithm is tested on three different fingerprint verification challenge datasets and shows the algorithm has higher recognition rate and speed than WT-RBF.
An immersed boundary method for smoothed particle hydrodynamics of self-propelled swimmers
Authors: S. E. Hieber, P. Koumoutsakos
Venue: Journal of Computational Physics (2008)

We present a novel particle method, combining remeshed Smoothed Particle Hydrodynamics with Immersed Boundary and Level Set techniques for the simulation of flows past complex deforming geometries. The present method retains the Lagrangian adaptivity of particle methods and relies on the remeshing of particle locations in order to ensure the accuracy of the method. In fact this remeshing step enables the introduction of Immersed Boundary Techniques used in grid based methods. The method is applied to simulations of flows of isothermal and compressible fluids past steady and unsteady solid boundaries that are described using a particle Level Set formulation. The method is validated with two and three-dimensional benchmark problems of flows past cylinders and spheres and it is shown to be well suited to simulations of large scale simulations using tens of millions of particles, on flow-structure interaction problems as they pertain to self-propelled anguilliform swimmers.
3D Simulations in Environmental Impact Assessment
Authors: Maria Danese, Giuseppe Las Casas, Beniamino Murgante
Venue: Proceeding sof the international conference on Computational Science and Its Applications, Part I (2008)

The increase of petrol cost and the failure of Kyoto agreement generated huge investments in renewable energy sources. In recent times a lot of local authorities allowed wind farm location. In many cases, environmental impact assessments do not take into account visual aspects sufficiently. This component, often ignored, is the most observed by local communities. Visual noise produces strong opposition and public resistance to wind turbine generator placements. Some kinds of 3D simulations can support visual impact assessments each one with some limits and only for few aspects. This paper aims to highlight advantages of several techniques of 3D geo-visualization and improvements obtainable by means of geographical analysis as a support for environmental impact assessments. The study case has been applied in a region located in southern Italian Apennine with elevated wind power and at the same time excellent landscape from a naturalistic point of view.
Describing Ontology Applications
Authors: Thomas Albertsen, Eva Blomqvist
Venue: Proceedings of the 4th European conference on The Semantic Web: Research and Applications (2007)

Semantic Web technologies are finally, after a few years of infancy, truly entering the business world to support the growing needs of computer aided information selection and processing. There are already quite well-defined development processes and methods in the software engineering field to handle the construction of large scale and complex enterprise systems, and to reuse knowledge in different software domains patterns are considered to be common practise. Patterns can be described on different levels of abstraction, but the patterns in the focus of this paper are on the software architecture level. In this paper we present a definition of the notion "ontology application pattern", as a special form of software architecture patterns describing an ontology-based system. We also show how such patterns, as well as the description of the pattern instantiations, can be described using a modified architecture description language.
A Fast Security Mechanism for Mobile Communication in Ubiquitous Computing
Authors: Won-Goo Lee, Han-Jin Cho, Jeom-Goo Kim
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

Most solutions focus on the home network security server management and gateway device certification. It is unrealistic where the most subjects are mobile users who want to control home network devices. Therefore minor and fast certification structures are needed to control other devices with mobile device that has lower computing capacity. To solve the above problems, this paper wants to build safe certification frame work for internet and mobile users to control household devices safely. New certification structure is proposed to get out of heavy certification structure like PKI and to minimize encrypting and decrypting operation by compounding session key and public key.
A Hybrid Approach for Arabidopsis Root Cell Image Segmentation
Authors: Monica Marcuzzo, Pedro Quelhas, Ana Campilho, Ana Maria Mendonça, Aurélio Campilho
Venue: Proceedings of the 5th international conference on Image Analysis and Recognition (2008)

In vivo observation and tracking of the Arabidopsis thaliana root meristem, by time-lapse confocal microscopy, is important to understand mechanisms like cell division and elongation. The research herein described is based on a large amount of image data, which must be analyzed to determine the location and state of cells. The automation of the process of cell detection/marking is an important step to provide research tools for the biologists in order to ease the search for special events, such as cell division. This paper discusses a hybrid approach for automatic cell segmentation, which selects the best cell candidates from a starting watershed-based image segmentation and improves the result by merging adjacent regions. The selection of individual cells is obtained using a Support Vector Machine (SVM) classifier, based on the shape and edge strength of the cells' contour. The merging criterion is based on edge strength along the line that connects adjacent cells' centroids. The resulting segmentation is largely pruned of badly segmented and over-segmented cells, thus facilitating the study of cell division.
Introducing Additional Input Information into Interactive Machine Translation Systems
Authors: Germán Sanchis-Trilles, Maria-Teresa González, Francisco Casacuberta, Enrique Vidal, Jorge Civera
Venue: Proceedings of the 5th international workshop on Machine Learning for Multimodal Interaction (2008)

Statistical Machine Translation (SMT) has been receiving a very great amount of attention in recent years. However, translations provided by SMT systems are still far from being perfect. This fact leads to the necessity of including a human expert in the translation process to assure high quality translations. Among the possible ways to incorporate human knowledge in a translation process, we adopt the Interactive-Predictive (IP) framework. In this framework, we show how the mouse actions that the expert performs offer information to the IP system, and can be used to automatically improve the translation even before the user introduces a correction. In addition, we present an improved user interface, which introduces mouse actions as a novel, additional, input information source for the underlying SMT engine.
Application of Reflection in Model Transformation Languages
Authors: Ivan Kurtev
Venue: Proceedings of the 1st international conference on Theory and Practice of Model Transformations (2008)

Computational reflection is a well known technique applied in many existing programming languages ranging from functional to object-oriented languages. In this paper we study the possibilities and benefits of introducing and using reflection in rule-based model transformation languages. The paper identifies some language abstractions to achieve structural and behavioral reflection. Every reflective feature is motivated by examples of problems derived from the experience with currently used transformation languages. Example solutions are given by using an experimental language with reflective capabilities.The paper also outlines possible implementation strategies for adding reflection to a language and discusses their advantages and disadvantages.
Characterizations of multivariate life distributions
Authors: N. Unnikrishnan Nair, P. G. Sankaran
Venue: Journal of Multivariate Analysis (2008)

Characterizations of multivariate distributions has been a topic of great interest in applied statistics literature for the last three decades. In this paper, we develop characterizations of multivariate lifetime distributions by relationship between multivariate failure rates (reversed failure rates) and the left (right) truncated expectations of functions of random variables. We, then, discuss the application of the results to derive a multivariate Stein type identity.
A multi-layered ontology for comparing relationship semantics in conceptual models of databases
Authors: Sandeep Purao, Veda C. Storey
Venue: Applied Ontology (2005)

Relationships are an integral part of the design of a database. Comparing and integrating relationships from heterogeneous databases requires that the relationships be mapped to each other or to a common classification. Identifying similarities and resolving differences in relationships across large data sources is a resource-intensive task that could benefit greatly from semi-automated approaches. A prerequisite to developing such approaches is a clear understanding of the semantics of relationships used in database design. This research presents a layered ontology for classifying the semantics of relationships. It consists of a core layer that captures the fundamental types of relationships between entities. A middle layer provides the internal context, obtained from entities surrounding the relationship, to interpret the fundamental types. The outer layer allows further interpretation using the external context, that is, the domain in which a relationship is being used. An initial assessment on relationships from a variety of application domains demonstrates that the ontology can be adequate and useful for comparing relationships across databases.
High-precision measurements of very small displacements using the laser vibration meter
Authors: Radu Munteanu,  Jr., Dan Iudean, Mihai Munteanu, Rozica Moga, Mirela Trusca, Vasile Dorca
Venue: Proceedings of the 9th WSEAS International Conference on International Conference on Automation and Information (2008)

The paper presents a system which is capable to perform a measuring method for very small displacements (microns). The measurements were made using a laser vibration meter, are very precise and can be controlled with a PC. Through the static and dynamic analyze of the system, we noticed if the polarity of the current is changed, using the same current settings in the computer, the displacements of a loudspeaker's membrane are different. The displacement of the membrane is smaller for the advancement than for the receding. A copper line could be attached to the system, line which could suffer tensions or distortions, but could be displaced horizontally very precise.
Motion editing for animated characters
Authors: Petros Faloutsos
Venue:  (2007)

Animated, human-like characters play an important role in virtual reality, interactive entertainment and simulations. The human body is a very complicated system, and thus creating realistic-looking human motion for animated characters is a difficult task. Synthesizing arbitrary motion for a humanoid character is a difficult control problem. Motion capture data is readily available and can playback an actors movements on an animated character. However, it is impractical to capture all variations in motion in order to accommodate the range of activities of an animated character in the virtual world. As such, animators have utilized motion editing as a means to modify motion capture data to suit the needs of the virtual environment. Generally speaking, motion editing is a difficult task and the more the motion capture data is modified, the less realistic the resulting animation. This thesis presents three novel approaches for motion editing that produce results that were either difficult or impossible to produce using traditional motion editing methods such as keyframing, while still maintaining realistic looking animations. These tasks include: (1) Editing the style of a motion from one type to another while maintaining the motion semantics, (2) editing motion capture data to accommodate moving characters, moving obstacles and moving reach targets, (3) editing motion capture data in order to accommodate large disturbances from other characters and objects in the environment. In addition, this thesis presents a framework and software system for editing and synthesizing character animations.
Quantification the quality of dairy products by imaging and texture analysis
Authors: A. Bensoudane, K. Afdel, Y. Khamlichi, F. Bakkali, A. Amghar, L. Koutti, A. Moudden
Venue: Proceedings of the WSEAS International Conference on Applied Computing Conference (2008)

The coagulation of milk is a process during which the milk that is liquid becomes a strong viscous. It is the first and most important stage in cheese industry. Among the methods more used to control the process of the milk coagulation, it is necessary to mention the method ultrasonic sound. This method permits followed it on-line of the coagulation but does not give some information on the manner with which takes place the coagulation and how propagates itself in volume. This coagulation can be homogeneous and or in heap what will have some consequences on the quality of the dairy product manufacture as cheese. For it we used the scan to follow the process of the coagulation in volume and the analysis of texture. A certain number of texture parameters have been found pertinently. Its can use to quantify homogeneity and the fineness of the process of milk's coagulation. The results obtained are potentially useful for the dairy industry and contribute to understand better the physicochemical process occurring during the milk gelation.
Murg term rewrite systems
Authors: Sándor Vágvölgyi
Venue: Information Processing Letters (2008)

The union of a monadic and a right-ground term rewrite system is called a murg term rewrite system. We show that for murg TRSs the ground common ancestor problem is undecidable. We show that for a murg term rewrite system it is undecidable whether the set of descendants of a ground tree is a recognizable tree language. We show that it is undecidable whether a murg term rewrite system over @S preserves @S-recognizability.
Using Hybrid Hadamard Error Correcting Output Codes for Multi-class Problem Based on Support Vector Machines
Authors: Shilei Huang, Xiang Xie, Jingming Kuang
Venue: Computational Intelligence and Security: International Conference, CIS 2006, Guangzhou, China, November 3-6, 2006, Revised Selected Papers (2007)

The Error-Correcting Output Codes (ECOC) method reduces the multi-class learning problem into a series of binary classifiers. In this paper, we propose a modified Hadamard-type ECOC method. This method uses both N'th order and N/2'th-order Hadamard matrix to construct error correcting output codes, which is called Hybrid Hadamard ECOC. Experiments based on dichotomizers of Support Vector Machines (SVM) have been carried out to evaluate the performance of the proposed method. When compared to normal Hadamard ECOC, computation of the method is reduced greatly while the accuracy of classification only drops slightly.
Binary Neuro-Fuzzy Classifiers Trained by Nonlinear Quantum Circuits
Authors: Massimo Panella, Giuseppe Martinelli
Venue: Proceedings of the 7th international workshop on Fuzzy Logic and Applications: Applications of Fuzzy Sets Theory (2007)

The possibility of solving an optimization problem by an exhaustive search on all the possible solutions can advantageously replace traditional algorithms for learning neuro-fuzzy networks. For this purpose, the architecture of such networks should be tailored to the requirements of quantum processing. In particular, it is necessary to introduce superposition for pursuing parallelism and entanglement. In the present paper the specific case of neuro-fuzzy networks applied to binary classification is investigated. The peculiarity of the proposed method is the use of a nonlinear quantum algorithm for extracting the optimal neuro-fuzzy network. The computational complexity of the training process is considerably reduced with respect to the use of other classical approaches.
A New Type of ART2 Architecture and Application to Color Image Segmentation
Authors: Jiaoyan Ai, Brian Funt, Lilong Shi
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part I (2008)

A new neural network architecture based on adaptive resonance theory (ART) is proposed and applied to color image segmentation. A new mechanism of similarity measurement between patterns has been introduced to make sure that spatial information in feature space, including both magnitude and phase of input vector, has been taken into consideration. By these improvements, the new ART2 architecture is characterized by the advantages: (i) keeping the traits of classical ART2 network such as self-organizing learning, categorizing without need of the number of clusters, etc.; (ii) developing better performance in grouping clustering patterns; (iii) improving pattern-shifting problem of classical ART2. The new architecture is believed to achieve effective unsupervised segmentation of color image and it has been experimentally found to perform well in a modified L ¿ u ¿ v ¿ color space in which the perceptual color difference can be measured properly by spatial information.
Producer/Consumer in Membrane Systems and Petri Nets
Authors: Francesco Bernardini, Marian Gheorghe, Maurice Margenstern, Sergey Verlan
Venue: Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World (2007)

The paper investigates different relationships between membrane systems and Petri nets by focusing on modelling variants of the producer/consumer paradigm. Two models of producer/consumer systems based on membrane systems are described, and it is shown how to translate these models into equivalent Petri nets with a corresponding semantics. It is then observed a direct correspondence between the Petri nets representation of the proposed models and standard solutions based on Petri nets already present in the literature.
Hiding Software Watermarks in Loop Structures
Authors: Mila Dalla Preda, Roberto Giacobazzi, Enrico Visentini
Venue: Proceedings of the 15th international symposium on Static Analysis (2008)

In this paper we propose a software watermarking technique based on the fact that different semantic instances might be abstracted in the same syntactic object. Our idea is to hide the watermark in a particular semantic instance and to distribute the corresponding syntactic construct. The extraction process uses a secret key in order to recover the information loss and reconstruct the watermark. In particular, we focus on loops and we base the embedding and extraction algorithm on the semantic understanding of loop-unrolling.
Integration of manufacturing strategy and process validation for pharmaceutical industries: a case study
Authors: M. Reza Abdi, Jose Repolles
Venue: International Journal of Computer Applications in Technology (2008)

Safety of patients should be considered as the key element for production planning in pharmaceutical industries. Compliance with stringent regulations from regulatory agencies to guarantee quality and safety drugs, has been recognised by all pharmaceutical companies. Accordingly, a process validation strategy is required to optimise manufacturing processes, cleaning validation and equipment qualification while gaining routine flexibility. In this paper, an integrated approach is developed to link a pharmaceutical manufacturing strategy with its process validation in order to optimise the validation efforts through using a product-equipment cleaning matrix. Product selection for the next validation stages is derived by using a multi-criteria decision making model. In particular, an Analytical Hierarchy Process (AHP) model is proposed to analyse product candidates for validation through a case study whilst considering the critical decision elements.
The History of the JOHNNIAC
Authors: F. J. Gruenberger
Venue: IEEE Annals of the History of Computing (1979)

This reprint of an early RAND Memorandum by the author describes the thirteen-year life of the JOHNNIAC computer, a Princeton-class machine designed and built at The RAND Corporation in 1953. The history presented here is based on documents and recollections of the individuals involved in the creation of JOHNNIAC.
On f-Edge Cover-Coloring of Simple Graphs
Authors: Jihui Wang, Sumei Zhang, Jianfeng Hou
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

Let G(V,E) be a simple graph, and let f be an integer function on V with 1 ≤ f(v) ≤ d(v) to each vertex v ¿ V. An f-edge cover-coloring of a graph G is a coloring of edge set E such that each color appears at each vertex v ¿ V at least f(v) times. The f-edge cover chromatic index of G, denoted by ¿¿ fc (G), is the maximum number of colors such that an f-edge cover-coloring of G exists. Any simple graph G has f-edge cover chromatic index equal to ¿ f or ¿ f -1, where $\delta_{f}=\min\limits^{}_{v\in V}\{\lfloor\frac{d(v)}{f(v)}\rfloor\}$. If ¿¿ fc (G) = ¿ f , then G is of C f I class; otherwise G is of C f II class. In this paper, we give some sufficient conditions for a graph to be of C f I class, and discuss the classification problem of complete graphs on f-edge cover-coloring.
Tool Support for the Circus Refinement Calculus
Authors: Alessandro Cavalcante Gurgel, Cristiano Gurgel Castro, Marcel Vinicius Oliveira
Venue: Proceedings of the 1st international conference on Abstract State Machines, B and Z (2008)

Circus combine both data and behavioural aspects of concurrent systems using a combination of CSP, Z, and Dijkstra's command language. Its associated refinement theory and calculus distinguishes itself from other such combinations. Using a refinement calculus, we can correctly construct programs in a stepwise fashion. Each step is justified by the application of a refinement law, possibly with the discharge of proof obligations (hereafter called POs). The manual application of the refinement calculus, however, is an error-prone and hard task.