ppxscal/embedding_network huggingface dataset:
Personal Color Decision System Using Fuzzy Logic
Authors: Jung-Min Oh, Cheol-Soo Bang, Geuk Lee
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

This paper, which is based on the research in the personal color decision system, uses the fuzzy logic and fuzzy ratiocination rule to improve the personal color decision method of the existing personal color system and to get more objective and reliable result for personal color. We propose the method which constructs more systematic color selection system using personal color database and fuzzy logic.
2nd International Workshop on Visualisation in Software Product Line Engineering (ViSPLE 2008)
Authors: Rick Rabiser, Patrick Healy, Daren Nestor, Mike Mannion, David Sellier
Venue: Proceedings of the 2008 12th International Software Product Line Conference (2008)

To leverage the explicit and extensive use of shared software artifacts, many companies use a product line approach to build different variants of their products for use within a variety of systems. Product lines can be large and could easily incorporate thousands of elements together with relationships between those elements. This makes product line management and systematic product derivation extremely difficult.
Analyzing the Performance of Spam Filtering Methods When Dimensionality of Input Vector Changes
Authors: J. R. Méndez, B. Corzo, D. Glez-Peña, F. Fdez-Riverola, F. Díaz
Venue: Proceedings of the 5th international conference on Machine Learning and Data Mining in Pattern Recognition (2007)

Spam is a complex problem that makes difficult the exploitation of Internet resources. In this sense, several authorities have alerted about the dimension of this problem and aim everybody to fight against it. In this paper we present an extensive analysis showing how the effect of changing the dimensionality of message representation influences the accuracy of some well-known classical spam filtering techniques. The conclusions drawn from the experiments carried out will be useful for building a comparison of the dimensionality reorganization effects between classical filtering techniques and a successful spam filter model called SpamHunting.
The Local Nature of List Colorings for Graphs of High Girth
Authors: Flavio Chierichetti, Andrea Vattani
Venue: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I (2008)

We consider list coloring problems for graphs $\mathcal{G}$ of girth larger than c log&Delta;-1 n, where n and &Delta; &ge; 3 are, respectively, the order and the maximum degree of $\mathcal{G}$, and c is a suitable constant. First, we determine that the edge and total list chromatic numbers of these graphs are $\chi'_l({\mathcal{G}}) = \Delta$ and $\chi''_l({\mathcal{G}}) = \Delta + 1$. This proves that the general conjectures of Bollob&aacute;s and Harris (1985), Behzad and Vizing (1969) and Juvan, Mohar and `krekovski (1998) hold for this particular class of graphs. Moreover, our proofs exhibit a certain degree of "locality", which we exploit to obtain an efficient distributed algorithm able to compute both kinds of optimal list colorings. Also, using an argument similar to one of Erd&ouml;s, we show that our algorithm can compute k-list vertex colorings of graphs having girth larger than c logk-1 n.
Agent-based models for animal cognition: a proposal and prototype
Authors: Elske van der Vaart, Rineke Verbrugge
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2 (2008)

Animal ecologists have successfully applied agent-based models to many different problems. Often, these focus on issues concerning collective behaviors, environmental interactions, or the evolution of traits. In these cases, patterns of interest can usually be investigated by constructing the appropriate multiagent system, and then varying or evolving model parameters. In recent years, however, the study of animal behavior has increasingly expanded to include the study of animal cognition. In this field, the question is not just how or why a particular behavior is performed, but also what its 'mental underpinnings' are. In this paper, we argue that agent-based models are uniquely suited to explore questions concerning animal cognition, as the experimenter has direct access to agents' internal representations, control over their evolutionary history, and a perfect record of their previous learning experience. To make this possible, a new modeling paradigm must be developed, where agents' reasoning processes are explicitly simulated, and can evolve over time. We propose that this be done in the form of "if-then" rules, where only the form is specified, not the content. This should allow qualitatively different reasoning processes to emerge, which may be more or less "cognitive" in nature. In this paper, we illustrate the potential of such an approach with a prototype model. Agents must evolve explicit rule sets to forage for food, and to escape predators. It is shown that even in this relatively simple setup, different strategies emerge, as well as unexpected outcomes.
Definition and recovery of kinematic features for recognition of American sign language movements
Authors: Konstantinos G. Derpanis, Richard P. Wildes, John K. Tsotsos
Venue: Image and Vision Computing (2008)

An approach to recognizing human hand gestures from a monocular temporal sequence of images is presented. Of concern is the representation and recognition of hand movements that are used in single-handed American sign language (ASL). The approach exploits previous linguistic analysis of manual languages that decompose dynamic gestures into their static and dynamic components. The first level of decomposition is in terms of three sets of primitives, hand shape, location and movement. Further levels of decomposition involve the lexical and sentence levels and are beyond the scope of the present paper. We propose and subsequently demonstrate that given a monocular gesture sequence, kinematic features can be recovered from the apparent motion that provide distinctive signatures for 14 primitive movements of ASL. The approach has been implemented in software and evaluated on a database of 592 gesture sequences with an overall recognition rate of 86% for fully automated processing and 97% for manually initialized processing.
Extracting Semantic Networks from Text Via Relational Clustering
Authors: Stanley Kok, Pedro Domingos
Venue: Proceedings of the 2008 European Conference on Machine Learning and Knowledge Discovery in Databases - Part I (2008)

Extracting knowledge from text has long been a goal of AI. Initial approaches were purely logical and brittle. More recently, the availability of large quantities of text on the Web has led to the development of machine learning approaches. However, to date these have mainly extracted ground facts, as opposed to general knowledge. Other learning approaches can extract logical forms, but require supervision and do not scale. In this paper we present an unsupervised approach to extracting semantic networks from large volumes of text. We use the TextRunner system [1] to extract tuples from text, and then induce general concepts and relations from them by jointly clustering the objects and relational strings in the tuples. Our approach is defined in Markov logic using four simple rules. Experiments on a dataset of two million tuples show that it outperforms three other relational clustering approaches, and extracts meaningful semantic networks.
Minimalist Grammars with Unbounded Scrambling and Nondiscriminating Barriers Are NP-Hard
Authors: Alexander Perekrestenko
Venue: Language and Automata Theory and Applications: Second International Conference, LATA 2008, Tarragona, Spain, March 13-19, 2008. Revised Papers (2008)

Minimalist Grammars were proposed in [15] as a formalization of the basic structure-building component of the Minimalism Program, a syntactic framework introduced in [2] and [3]. In the present paper we investigate the effects of extending this formalism with an unrestricted scrambling operator together with nondiscriminating barriers. We show that the recognition problem for the resulting formalism NP-hard. The result presented here is a generalization of the result shown by the author in [14] for Minimalist Grammars with unrestricted scrambling and category-sensitive barriers.
Computational Forensics: An Overview
Authors: Katrin Franke, Sargur N. Srihari
Venue: Proceedings of the 2nd international workshop on Computational Forensics (2008)

Cognitive abilities of human expertise modeled using computational methods offer several new possibilities for the forensic sciences. They include three areas: providing tools for use by the forensic examiner, establishing a scientific basis for the expertise, and providing an alternate opinion on a case. This paper gives a brief overview of computational forensics with a focus on those disciplines that involve pattern evidence.
Approximating real functions which possess nth derivatives of bounded variation and applications
Authors: Sever S. Dragomir
Venue: Computers Mathematics with Applications (2008)

The main aim of this paper is to provide an approximation for the function f which possesses continuous derivatives up to the order n-1(n>=1) and has the nth derivative of bounded variation, in terms of the chord that connects its end points A=(a,f(a)) and B=(b,f(b)) and some more terms which depend on the values of the k derivatives of the function taken at the end points a and b, where k is between 1 and n. Natural applications for some elementary functions such as the exponential and the logarithmic functions are given as well.
Optimal Unroll Factor for Reconfigurable Architectures
Authors: Ozana Silvia Dragomir, Elena Moscu-Panainte, Koen Bertels, Stephan Wong
Venue: Proceedings of the 4th international workshop on Reconfigurable Computing: Architectures, Tools and Applications (2008)

Loops are an important source of optimization. In this paper, we address such optimizations for those cases when loops contain kernels mapped on reconfigurable fabric. We assume the Molen machine organization and Molen programming paradigm as our framework. The proposed algorithm computes the optimal unroll factor u for a loop that contains a hardware kernel K such that u instances of K run in parallel on the reconfigurable hardware, and the targeted balance between performance and resource usage is achieved. The parameters of the algorithm consist of profiling information about the execution times for running K in both hardware and software, the memory transfers and the utilized area. In the experimental part, we illustrate this method by applying it to a loop nest from a real-life application (MPEG2), containing the DCT kernel.
A study of evaluation papers and surveys about learning content management systems
Authors: Lejla Abazi-Bexheti, Zamir Dika
Venue: Proceedings of the 7th WSEAS International Conference on Software Engineering, Parallel and Distributed Systems (2008)

Change appears to be the only constant in the field of ICT and what was treated as advanced feature few years ago is today old-fashioned. If dealing with such rapid change in the field is increasingly difficult and complex, it is even more complicated when one tries to simplify the concepts and processes and define the learning system's model and the features that would contribute to a more effective teaching. As part of the research team engaged in creating a Learning Content Management System (LCMS) for our university, we wanted to start our project with a comparative study in the field of LCMSs. Lately a lot of research has been done in comparing and evaluating LCMSs. We went through more than 20 research papers which were published in the last decade about this issue, ant try to define the demand of key features in a LCMS and the changing scheme of these demands through time. By this we hope we can define present demand and features in order to include them in our future LCMS.
Automated Drug Information System for Aged and Visually Impaired Persons
Authors: Géza Németh, Gábor Olaszy, Mátyás Bartalis, Géza Kiss, Csaba Zainkó, Péter Mihajlik, Csaba Haraszti
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

Aged and visually impaired persons belong to those groups of people, who can get information about drugs not so easily, as others. Although in Hungary lately Braille prints (containing the name of the medicament) are placed on the boxes of the drugs, but getting detailed information about the drug, i.e. to access the content of the written Patient Information Leaflets (PIL), is complicated. The Medicine Line (MLN) service may help in solving this problem. This automatic telephone information system was developed and put into operation in Hungary in December 2006. The computer system speaks and understands Hungarian, so the aged and visually impaired can get the information about the drug by voice. Adaptation to other languages is also possible. As we know, no such system is available in the European Union.
Multiple faults in Reed-Muller canonic networks
Authors: K. K. Saluja, S. M. Reddy
Venue: Proceedings of the 13th Annual Symposium on Switching and Automata Theory (swat 1972) (1972)

Fault detecting test sets to detect multiple stuck-at-faults in certain networks realizing Reed-Muller canonic expressions are given. It is shown that to detect t faults, t ≥ 1, in a network realizing an arbitrary n-variable logic function only 4 + Σ i=1 [log22t] (in) tests need be applied ([x] is the integer part of x) and that these tests are independent of the function being realized. Techniques to design the checker for these test sets are given.
The 2006 Upper Ontology Summit Joint Communiqu&eacute;
Authors: Leo Obrst, Patrick Cassidy, Steve Ray, Barry Smith, Dagobert Soergel, Matthew West, Peter Yim
Venue: Applied Ontology (2006)

On March 14-15, 2006, at the US National Institute of Standards and Technology (NIST) in Gaithersburg, MD, there took place the first Upper Ontology Summit (UOS). This was a convening of custodians of several prominent upper ontologies, key technology participants, and interested other parties, with the purpose of finding a means to relate the different ontologies to each other. The result is reflected in a joint communiqu&eacute;, directed to the larger ontology community and the general public, and expressing a joint intent to build bridges among the existing upper ontologies in ways designed to increase and rationalize their utilization and to enhance their semantic interoperability. The Upper Ontology Summit was sponsored by NIST, Ontolog, the National Center for Ontological Research (NCOR), MITRE, and many other organizations. The UOS was organized by a committee consisting of Pat Cassidy, Peter Yim, Steve Ray, Dagobert Soergel, and Leo Obrst.
Guest Editors' Introduction: Software Patterns
Authors: Michael Kircher, Markus Völter
Venue: IEEE Software (2007)

Patterns have become part of the software development mainstream. They're available for all phases of the development process, including analysis, documentation, design, testing, and configuration management, to name a few. In addition to documenting the current status of software patterns, this special issue will reflect critically on and discuss the achievements of the pattern community. This article is part of a special issue on software patterns.
Artistic 3D Object Creation Using Artificial Life Paradigms
Authors: Iver Bailly-Salins, Herve Luga
Venue: Proceedings of the 8th international symposium on Smart Graphics (2007)

This article describes a new interaction model for artistic shape generation. Instead of using a metaphor of the classical sculpting tools we propose a new approach based on a two level editing which both uses genetic programming methods: objects are created by means of subjective selection and generative evolution. We develop a new way to define these objects combining algebraic definition of implicit surfaces and CSG-like composition of these shapes. Along with these we propose a software tool that implements a simple way to manage this new approach in three dimensional objects design.
Post-Processing Functions for a Biased Physical Random Number Generator
Authors: Patrick Lacharme
Venue: Fast Software Encryption: 15th International Workshop, FSE 2008, Lausanne, Switzerland, February 10-13, 2008, Revised Selected Papers (2008)

A corrector is used to reduce or eliminate statistical weakness of a physical random number generator. A description of linear corrector generalizing post-processing described by M. Dichtl at FSE'07 [5] is introduced. A general formula for non linear corrector, determining the bias and the minimal entropy of the output of a function is given. Finally, a concrete and efficient construction of post-processing function, using resilient functions and cyclic codes, is proposed.
The synthesis of biological molecules in the universe
Authors: Nigel Aylward
Venue: Proceedings of the 10th WSEAS International Conference on Mathematical Methods and Computational Techniques in Electrical Engineering (2008)

Theoretical chemistry is applied to describe in detail the formation of reactive intermediates in a primeval atmosphere composed of hydrogen, carbon monoxide and ammonia that at a suitable temperature could equilibrate to form a cascade of the biological molecules that allow molecular evolution. Of particular importance is the formation of porphin that can act as a powerful catalyst. The Faraday effect is invoked to explain the formation of the chirality of the L-amino-acids and D-sugars. Also described is the formation of the information molecules, the nucleic acid bases, the nucleosides, nucleotides and their polymerization to RNA and DNA. The formation of the terpenes allows the further formation of the glycerides. This atmosphere also leads to the formation of the vitamins. Most of the reactions appear to be exothermic except condensations involving carbon monoxide or ammonia. The reactions have been shown to be feasible from the overall enthalpy changes in the ZKE approximation at the HF and MP2 /6-31G* level.
Statistical Behaviors of Distributed Transition Planning
Authors: Ning Wu, Alva L. Couch
Venue: Proceedings of the 2nd international conference on Autonomous Infrastructure, Management and Security: Resilient Networks and Services (2008)

The transition planning problem is to move a system from an existing starting configuration to a desired final configuration at the lowest possible cost. Prior work shows that the transition planning problem can be reduced to a bipartite matching problem and the stable marriage algorithm can be used to approximate a minimum cost transition in a distributed environment. In this paper, we study the efficiency of this mapping, including its best-case, worst-case, and statistical behavior. We discuss the relationship between algorithm performance and the distribution of the input data. We show that while there are cases in which this algorithm performs poorly, works well when the costs of transitioning between distributed resources follow a normal distribution. We discuss the applicability of this algorithm to real-world situations in which resources are thus distributed.
Continuous Hand Gesture Recognition in the Learned Hierarchical Latent Variable Space
Authors: Lei Han, Wei Liang
Venue: Proceedings of the 5th international conference on Articulated Motion and Deformable Objects (2008)

We describe a hierarchical approach for recognizing continuous hand gestures. It consists of hierarchical nonlinear dimensionality reduction based feature extraction and Hierarchical Conditional Random Field (Hierarchical CRF) based motion modeling. Articulated hands can be decomposed into several hand parts and we explore the underlying structures of articulated action spaces for both the hand and hand parts using Hierarchical Gaussian Process Latent Variable Model (HGPLVM). In this hierarchical latent variable space, we propose a Hierarchical CRF, which can simultaneously capture the extrinsic class dynamics and learn the relationship between motions of hand parts and class labels, to model the hand motions. Approving recognition performance is obtained on our user-defined hand gesture dataset.
An approach of a knowledge management system in an automated manufacturing environment
Authors: Berger Ulrich, Lebedynska Yuliya, Minhas Sarfraz
Venue: Proceedings of the 9th WSEAS International Conference on International Conference on Automation and Information (2008)

In this paper, our focus is towards incorporation of a knowledge management systems in remote human machine interface devices (e.g. Personal Digital Assistants) for extracting concrete and precise information and knowledge about manufacturing systems and processes in highly automated manufacturing environment. By introducing the information system based on precise knowledge management approach in the manufacturing environment helps the user in accessing the information material in an organized form so that on-process modification and optimization can be done faster, safer and simpler depending upon the maturity level of the user.
Succinct NP Proofs from an Extractability Assumption
Authors: Giovanni Crescenzo, Helger Lipmaa
Venue: Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms (2008)

We prove, using a non-standard complexity assumption, that any language in has a 1-round (that is, the verifier sends a message to the prover, and the prover sends a message to the verifier) argument system (that is, a proof system where soundness holds against polynomial-time provers) with communication complexity only polylogarithmic in the size of the instance. We also show formal evidence that the nature of the non-standard complexity assumption we use is analogous to previous assumptions proposed in the cryptographic literature. The question of whether complexity assumptions of this nature can be considered acceptable or not remains of independent interest in complexity-theoretic cryptography as well as complexity theory.
WADE: a software platform to develop mission critical applications exploiting agents and workflows
Authors: Giovanni Caire, Danilo Gotta, Massimo Banzi
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems: industrial track (2008)

In this paper, we describe two mission critical applications currently deployed by Telecom Italia in the Operations Support System domains. The first one called "Network Neutral Element Manager" implements a mediation layer between network elements and OSS systems. The second one, known as "Wizard", provides step-by-step guidance to technicians performing maintenance operations in the fields. Both applications have strong requirements in terms of scalability and flexibility and exploit the combination of agents and workflows to meet them. As such both of them are based on a common software platform called WADE (Workflows and Agents Development Environment). WADE is the main evolution of JADE a popular Open Source framework that facilitates the development of interoperable intelligent multi-agent systems. WADE adds to JADE the support for the execution of tasks defined according to the workflow metaphor and a number of mechanisms that help managing the complexity of the distribution both in terms of administration and fault tolerance. In this paper in particular we focus on the workflow aspect and we show how WADE tries to bring the workflow approach from the business process level to the level of system internal logic.