ppxscal/embedding_network huggingface dataset:
Agent Behavior Alignment: A Mechanism to Overcome Problems in Agent Interactions During Runtime
Authors: Gerben G. Meyer, Nick B. Szirbik
Venue: Proceedings of the 11th international workshop on Cooperative Information Agents XI (2007)

When two or more agents interacting, their behaviors are not necessarily matching. Automated ways to overcome conflicts in the behavior of agents can make the execution of interactions more reliable. Such an alignment mechanism will reduce the necessary human intervention. This paper shows how to describe a policy for alignment, which an agent can apply when its behavior is in conflict with other agents. An extension of Petri Nets is used to capture the intended interaction of an agent in a formal way. Furthermore, a mechanism based on machine learning is implemented, to enable an agent to choose an appropriate alignment policy with collected problem information. Human intervention can reinforce certain successful policies in a given context, and can also contribute by adding completely new policies. Experiments have been conducted to test the applicability of the alignment mechanism and the main results are presented here.
Polynomial splines over hierarchical T-meshes
Authors: Jiansong Deng, Falai Chen, Xin Li, Changqi Hu, Weihua Tong, Zhouwang Yang, Yuyu Feng
Venue: Graphical Models (2008)

In this paper, we introduce a new type of splines-polynomial splines over hierarchical T-meshes (called PHT-splines) to model geometric objects. PHT-splines are a generalization of B-splines over hierarchical T-meshes. We present the detailed construction process of spline basis functions over T-meshes which have the same important properties as B-splines do, such as nonnegativity, local support and partition of unity. As two fundamental operations, cross insertion and cross removal of PHT-splines are discussed. With the new splines, surface models can be constructed efficiently and adaptively to fit open or closed mesh models, where only linear systems of equations with a few unknowns are involved. With this approach, a NURBS surface can be efficiently simplified into a PHT-spline which dramatically reduces the superfluous control points of the NURBS surface. Furthermore, PHT-splines allow for several important types of geometry processing in a natural and efficient manner, such as conversion of a PHT-spline into an assembly of tensor-product spline patches, and shape simplification of PHT-splines over a coarser T-mesh. PHT-splines not only inherit many good properties of Sederberg's T-splines such as adaptivity and locality, but also extend T-splines in several aspects except that they are only C^1 continuous. For example, PHT-splines are polynomial instead of rational; cross insertion/removal of PHT-splines is local and simple.
Geometrical Properties of Simulated Packings of Spherocylinders
Authors: Monika Bargieł
Venue: Proceedings of the 8th international conference on Computational Science, Part II (2008)

In a wide range of industrial applications there appear systems of hard particles of different shapes and sizes, known as "packings". In this work, the force-biased algorithm, primarily designed to model close packings of equal spheres, is adapted to simulate mixtures of spherocylindrical particles of different radii and aspect ratios. The packing densities of simulated mono and polydisperse systems, are presented as functions of particle elongation and different algorithm parameters. It is shown that spherocylinders can pack more densely than spheres, reaching volume fraction as high as 0.705.
Asymmetric interactions in symmetric multi-core systems: analysis, enhancements and evaluation
Authors: T. Scogland, P. Balaji, W. Feng, G. Narayanaswamy
Venue: Proceedings of the 2008 ACM/IEEE conference on Supercomputing (2008)

Multi-core architectures have spurred the recent rapid growth in high-end computing systems. While the vast majority of such multi-core processors contain symmetric hardware components, their interaction with systems software, in particular the communication stack, results in a remarkable amount of asymmetry in the effective capability of the different cores. In this paper, we analyze such interactions and propose a novel management library called SyMMer (Systems Mapping Manager) that monitors these interactions and dynamically manages the mapping of processes on processor cores to transparently improve application performance. Together with a detailed description of the SyMMer library, we also present performance evaluation comparing SyMMer to a vanilla communication library using various micro-benchmarks as well as popular applications and scientific libraries. Experimental results demonstrate more than a two-fold improvement in communication time and 10--15% improvement in overall application performance.
Research on Web Information Extraction Based on XML
Authors: Yan Hu, Yanyan Xuan
Venue: Proceedings of the 2008 Second International Conference on Genetic and Evolutionary Computing (2008)

The standard XML technology is used for Web information extraction in this paper, and a generic XML-based Web information extraction solution is proposed. In the extraction process, two key technologies are proposed and implemented: the XML-based Web data conversion technology and the DOM-based XPath generation technology, to simplify the information extraction work. XSLT is used as the description language of extraction rules, which is conductive to the unity of extraction patterns.
Permissiveness in Transactional Memories
Authors: Rachid Guerraoui, Thomas A. Henzinger, Vasu Singh
Venue: Proceedings of the 22nd international symposium on Distributed Computing (2008)

We introduce the notion of permissiveness in transactional memories (TM). Intuitively, a TM is permissive if it never aborts a transaction when it need not. More specifically, a TM is permissive with respect to a safety property p if the TM accepts every history that satisfies p. Permissiveness, like safety and liveness, can be used as a metric to compare TMs. We illustrate that it is impractical to achieve permissiveness deterministically, and then show how randomization can be used to achieve permissiveness efficiently. We introduce Adaptive Validation STM (AVSTM), which is probabilistically permissive with respect to opacity; that is, every opaque history is accepted by AVSTM with positive probability. Moreover, AVSTM guarantees lock freedom. Owing to its permissiveness, AVSTM outperforms other STMs by up to 40% in read dominated workloads in high contention scenarios. But, in low contention scenarios, the book-keeping done by AVSTM to achieve permissiveness makes AVSTM, on average, 20-30% worse than existing STMs.
The use of LISP at computer centers in Western Germany
Authors: Jerome Chailloux
Venue: Issue 2 (July 1978) (1978)

A summary of G. G&Ouml;RZ "Die Verwendung von LISP an wissenschaft-lichen Rechenzentren in der BRD", IAB Nr 63, Universit&auml;t Erlangen-n&uuml;rnberg, Rechenzentrum, Dez. 76.
Women in computer science: harnessing the power of web 2.0 to draw women to computer science fields
Authors: Nazli Hardy
Venue: Proceedings of the 9th ACM SIGITE conference on Information technology education (2008)

A poster outlining a seminar course targeting freshman women who are undeclared in a major or who are interested in Computer Science (CS). This course is envisioned to showcase to female students (and possibly male students) the broad scope of application in CS that is shaping their future. Taking into account the individual interests of the students, we will develop projects that merge computer science and technology with their interests. For this course we will utilize Web 2.0 technology as a complementary tool in the class since many of the students are already familiar with social networking and other aspects of the technology and will use these to build a CS portfolio.
Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures
Authors: Stephan Falke, Deepak Kapur
Venue: Proceedings of the 19th international conference on Rewriting Techniques and Applications (2008)

This paper defines an expressive class of constrained equational rewrite systems that supports the use of semantic data structures (e.g., sets or multisets) and contains built-in numbers, thus extending our previous work presented at CADE 2007 [6]. These rewrite systems, which are based on normalized rewriting on constructor terms, allow the specification of algorithms in a natural and elegant way. Built-in numbers are helpful for this since numbers are a primitive data type in every programming language. We develop a dependency pair framework for these rewrite systems, resulting in a flexible and powerful method for showing termination that can be automated effectively. Various powerful techniques are developed within this framework, including a subterm criterion and reduction pairs that need to consider only subsets of the rules and equations. It is well-known from the dependency pair framework for ordinary rewriting that these techniques are often crucial for a successful automatic termination proof. Termination of a large collection of examples can be established using the presented techniques.
Dynamic Epistemic Logic and Knowledge Puzzles
Authors: H. P. Ditmarsch, W. Hoek, B. P. Kooi
Venue: Proceedings of the 15th international conference on Conceptual Structures: Knowledge Architectures for Smart Applications (2007)

We briefly give an overview of Dynamic Epistemic Logic (DEL), mainly in semantic terms. We focus on the simplest of epistemic actions in DEL, called public announcements. We also sketch the effect of more complex epistemic actions, and briefly show how als factual change can be modelled in the same framework. We then apply the logic of public announcements in DEL to the analysis of a knowledge puzzle, called `What Sum'.
An Artificial Intelligence Course Used to Investigate Students' Learning Style
Authors: Elvira Popescu
Venue: Proceedings of the 7th international conference on Advances in Web Based Learning (2008)

This paper introduces a course module in the domain of Artificial Intelligence, implemented in a web-based educational system called WELSA. The course is specifically tailored to capture the learning style of the students, while they browse through the module. The way of organizing and indexing the constituent educational resources is briefly introduced and then illustrated with a course fragment. In order to validate the proposed approach, a selection of learners' behavioural patterns are analyzed and interpreted, being subsequently correlated with the learning preferences of the students.
Image to sound transforms and sound to image visualizations based on the chromaticism of music
Authors: Dionysios Politis, Dimitrios Margounakis, Michail Karatsoris
Venue: Proceedings of the 7th WSEAS International Conference on Artificial intelligence, knowledge engineering and data bases (2008)

Numerous algorithms have been proposed for image to sound and sound to image transforms. Based on heuristic assignments of sound frequencies to RGB values, they perform effective mappings between musical entities (notes) and values for optical wavelengths. In this paper, the chromaticism of the sound domain is taken into account and the colouring of the performed music is depicted for interrelated sound segments that have acoustic polymorphism and form entities of pitch organization. This algorithm helps visualize musical files according to their melodic structure and not only according to their temporal characteristics (i.e. rhythm).
Context-Aware Deployment of Services in Public Spaces
Authors: Ichiro Satoh
Venue: Proceedings of the 6th IFIP WG 10.2 international workshop on Software Technologies for Embedded and Ubiquitous Systems (2008)

This paper presents the context-aware deployment of user-assistant services in public spaces, e.g., museums. Using location-sensing systems, it detects the locations of users and deploys user-assistant services, e.g., visitor guides, at computers near to the their current locations. When users move between exhibits in a museum, it enables agents to follow users to annotate the exhibits in personalized form and navigate them to the next exhibits along their routes. To demonstrate the utility and effectiveness of the framework, we constructed and operated a location/user-aware visitor-guide service in a museum as case studies in the development of context-aware services in public spaces.
Transparent Complexity by Goals
Authors: Vytautas Čyras, Friedrich Lachmayer
Venue: Proceedings of the 7th international conference on Electronic Government (2008)

Making the teleological structure of e-government explicit can contribute to reduce its complexity. E-government can be viewed from distinct standpoints --- from authorities and citizens, but also from conception and construction. This view of administrative and legal informatics requires paradigmatic changes in the effective development of e-government. We have an impression that a currently dominant normative thinking is not enough to solve specific problems of e-government. Here a new concept of legal teleology is required. We propose to supplement norms and even structural parts of a whole legal system with teleological relations. This will form a separate structural layer of legal knowledge representation. Such a layer can contribute to metadata of legal documents. This is important in the search of legal documents and information retrieval. Proposed notation A te B contains three elements: a basic element A, a target element B and a teleological relation te.
An Improved Connectionist Translator between Natural Languages
Authors: Gustavo A. Casañ, Maria Asunción Castaño
Venue: Proceedings of the 11th Ibero-American conference on AI: Advances in Artificial Intelligence (2008)

The RECONTRA translator, a simple connectionist translator between natural languages, has been able to approach several simple MT tasks. In this paper we create a variant of the RECONTRA topology which takes into account what seems to be the natural work of the human brain in the translation process: complete paragraphs or sentences are translated, not individual words. Thus, the RECONTRA translator is modified to present as output several words at the same time. Experimentally, this simple modification has shown an improvement in the translation results.
Improving Question Answering Tasks by Textual Entailment Recognition
Authors: Óscar Ferrández, Rafael Muñoz, Manuel Palomar
Venue: Proceedings of the 13th international conference on Natural Language and Information Systems: Applications of Natural Language to Information Systems (2008)

This paper explores a suitable way to integrate a Textual Entailment (TE) system, which detects unidirectional semantic inferences, into Question Answering (QA) tasks. We propose using TE as an answer validation engine to improve QA systems, and we evaluate its performance using the Answer Validation Exercise framework. Results point out that our TE system can improve the QA task considerably.
List Error-Correction with Optimal Information Rate (Invited Talk)
Authors: Venkatesan Guruswami
Venue: Proceedings of the 3rd international conference on Information Theoretic Security (2008)

The construction of error-correcting codes that achieve the best possible trade-off between information rate and the amount of errors that can be corrected has been a long sought-after goal. This talk will survey some of the work on list error-correction algorithms for algebraic codes [8,5], culminating in the construction of codes with the optimal information rate for any desired error-correction radius [7,4]. Specifically, these codes can correct a fraction p of worst-case errors (for any desired 0 < p < 1) with rate 1 ¿ p ¿ ¿ for any constant ¿> 0. We will describe these codes, which are called folded Reed-Solomon codes, and give a peek into the algebraic ideas underlying their list decoding.Over the years, list-decodable codes have also found applications extraneous to coding theory [3], including several elegant ones in cryptography. The problem of decoding Reed-Solomon codes (also known as polynomial reconstruction) and its variants from a large number of errors has been suggested as an intractability assumption to base the security of protocols on [6]. Progress on list decoding algorithms for algebraic codes has led to cryptanalysis of some of these schemes. It is interesting to note that the line of research that eventually led to the above-mentioned result for folded Reed-Solomon codes can be traced back to a cryptographic assumption concerning simultaneous polynomial reconstruction and algorithms for decoding "interleaved" Reed-Solomon codes that it inspired [1,2]. Given the cryptographic theme of the ICITS conference, we will also briefly allude to the above connection in the talk.
A New Bitmap Index and a New Data Cube Compression Technology
Authors: Jianqing Xi, Fuqiang Chen, Pingjian Zhang
Venue: Proceedings of the international conference on Computational Science and Its Applications, Part II (2008)

This paper introduces a new kind of bitmap index. A tuple in the data cube is mapped to a sequential key (seqkey) determined by its value in each dimension. Furthermore, the quotient bit sequence is constructed according to whether the corresponding cell of a seqkey exists in the cover quotient cube or not, and the cover quotient cube is indexed by this quotient bit sequence (qcbit index). A compression method is presented for the seqkey cover quotient cube, which compress the cover quotient cube via omitting dimension attributes for all cells. To improve the storage and query of data cubes, based on these index and compression methods, algorithms are proposed to query the cover quotient cube and seqkey cover quotient cube. Experimental results on the dataset weather show that the volume of the qcbit index file is only 11% of the value-list index file, and the volume of seqkey cover quotient cube is only 27.75% of the original cover quotient cube.
Enabling indoor exhibition automated guidance and multimedia content delivery on mobile devices
Authors: Charalampos Doukas, Thomas Pliakas, John Karigiannis, Ilias Maglogiannis
Venue: Proceedings of the 3rd international conference on Digital Interactive Media in Entertainment and Arts (2008)

Multimedia content delivery is an important issue in assistive guidance systems for exhibition areas. This paper presents an automatic guidance and multimedia content presentation system utilizing location-based services and their deployment on mobile devices. A prototype installation and experimental usage in a real exhibition environment has provided promising results regarding the system's user acceptance and functionality.
MR Brain Tissue Classification Using an Edge-Preserving Spatially Variant Bayesian Mixture Model
Authors: Giorgos Sfikas, Christophoros Nikou, Nikolaos Galatsanos, Christian Heinrich
Venue: Proceedings of the 11th international conference on Medical Image Computing and Computer-Assisted Intervention - Part I (2008)

In this paper, a spatially constrained mixture model for the segmentation of MR brain images is presented. The novelty of this work is an edge-preserving smoothness prior which is imposed on the probabilities of the voxel labels. This prior incorporates a line process, which is modeled as a Bernoulli random variable, in order to preserve edges between tissues. The main difference with other, state of the art methods imposing priors, is that the constraint is imposed on the probabilities of the voxel labels and not onto the labels themselves. Inference of the proposed Bayesian model is obtained using variational methodology and the model parameters are computed in closed form. Numerical experiments are presented where the proposed model is favorably compared to state of the art brain segmentation methods as well as to a spatially varying Gaussian mixture model.
dNSP: A biologically inspired dynamic Neural network approach to Signal Processing
Authors: José Manuel Cano-Izquierdo, Julio Ibarrola, Miguel Pinzolas, Miguel Almonacid
Venue: Neural Networks (2008)

The arriving order of data is one of the intrinsic properties of a signal. Therefore, techniques dealing with this temporal relation are required for identification and signal processing tasks. To perform a classification of the signal according with its temporal characteristics, it would be useful to find a feature vector in which the temporal attributes were embedded. The correlation and power density spectrum functions are suitable tools to manage this issue. These functions are usually defined with statistical formulation. On the other hand, in biology there can be found numerous processes in which signals are processed to give a feature vector; for example, the processing of sound by the auditory system. In this work, the dNSP (dynamic Neural Signal Processing) architecture is proposed. This architecture allows representing a time-varying signal by a spatial (thus statical) vector. Inspired by the aforementioned biological processes, the dNSP performs frequency decomposition using an analogical parallel algorithm carried out by simple processing units. The architecture has been developed under the paradigm of a multilayer neural network, where the different layers are composed by units whose activation functions have been extracted from the theory of Neural Dynamic [Grossberg, S. (1988). Nonlinear neural networks principles, mechanisms and architectures. Neural Networks, 1, 17-61]. A theoretical study of the behavior of the dynamic equations of the units and their relationship with some statistical functions allows establishing a parallelism between the unit activations and correlation and power density spectrum functions. To test the capabilities of the proposed approach, several testbeds have been employed, i.e. the frequencial study of mathematical functions. As a possible application of the architecture, a highly interesting problem in the field of automatic control is addressed: the recognition of a controlled DC motor operating state.
Extracting Object Interactions Out of Software Contracts Using Model Transformations
Authors: Andrés Vignaga, Daniel Perovich, María Cecilia Bastarrica
Venue: Proceedings of the 1st international conference on Theory and Practice of Model Transformations (2008)

One popular approach to object design proposes to identify responsibilities from software contracts, apply a number of principles to assign them to objects, and finally construct an object interaction that realizes the contract. This three-step activity is currently a manual process that is time-consuming and error-prone, and is among the most challenging activities in object-oriented development. In this paper, we present a model transformation that partially automates this activity. Such a transformation is modularized in three stages. The first stage automatically transforms a software contract to a trace of state modification actions. In the second stage the designer manually extends the trace with design decisions. Finally, the extended trace is automatically transformed to an object interaction in the third stage. A prototype of the whole transformation was developed and successfully applied to a case study from the literature. Our technique allows the extraction of valuable information from software contracts, provides a bridge between analysis and design artifacts, and significantly reduces the effort of interaction design.
New Paradigms for Password Security
Authors: Xavier Boyen
Venue: Proceedings of the 13th Australasian conference on Information Security and Privacy (2008)

For the past several decades, cryptographers have consistently provided us with stronger and more capable primitives and protocols that have found many applications in security systems in everyday life. One of the central tenets of cryptographic design is that, whereas a system's architecture ought to be public and open to scrutiny, the keys on which it depends -- long, utterly random, unique strings of bits -- will be perfectly preserved by their owner, and yet nominally inaccessible to foes.