ppxscal/embedding_network huggingface dataset:
Developing Self-Organized Architecture Solution according to Model Driven Generative Domain Engineering
Authors: Hai-Hua Liang, Miao-Liang Zhu
Venue: Proceeding of the 2005 conference on Self-Organization and Autonomic Informatics (I) (2005)

The development of multi-agent based solution for outdoor mobile robot navigation is a complex multi-level process. Model Driven Generative Domain Engineering is one domain engineering method aim to developing optimized, reusable architectures, components and aspects for application engineering. According to MDGDE, we designed a set of event-driven agents, which enable the robot to initiate action adaptive to the dynamical changes in the environment. This paper describes our approach as well as its motivations and our practice.
Plenary lecture 1: field assisted processing of polymer nanocomposites with functionalized carbon nanotubes and nanofibres
Authors: Jose M. Kenny
Venue: Proceedings of the 1st WSEAS international conference on Nanotechnology (2009)

Light nanocomposite materials with exceptional mechanical and electronic properties can be made using different type of reinforcements and polymer matrices. In particular, carbon nanotubes (CNT), and more recently Carbon nanofibres (CNF) have been studied extensively because of their exceptional mechanical and electrical properties, yet their practical and extensive use in commercial materials is still missing. The utilization of CNTs and CNFs as reinforcement to design novel composites has been object of many different approaches in the last 10 years; however, there is a lack of a knowledge based approach to achieve the nanostructuration level required to optimize the CNT(CNF)/polymer composite performances. Currently, carbon nanoobjects are incorporated within the polymer matrix by mixing into the polymer, dispersion in solution or melt processing. However, these methodologies present several critical issues as for example the non-uniform dispersion of nanoreinforcements within the polymer matrix and the lack of control of the alignment or orientation of CNTs and CNFs in the resulting composites. Generally, it is difficult to disperse well a relative high concentration of these nanoobjects into the polymer precursors because of the viscosity of the polymers and the entanglement of the nanotubes. The challenge for the next future is to get innovative polymer composites filled with CNTs and CNFs in order to obtain nanostructured materials with tailor made properties. For example, the isotropic conductivity of the composites is not necessary in some cases. For instance, it is demanded that the electron charge can penetrate the antistatic shielding film as soon as possible. The conductivity perpendicular to the film surface should be as high as possible but the lateral conductivity is not important--perfect conductivity along one axis is enough to satisfy the application. Our goal is to investigate the effects of electric and magnetic fields on the physical properties of nanotube based nanocomposites under static loading conditions. We report here our results for different matrices: poly(methyl methacrylate), epoxy systems, block copolymers loaded with carbon nanotubes and carbon nanofibres. The influence of orientation on the electrical anisotropy as well as the role played by the magnetic field on the rheological properties is also reported. These results provide an initial understanding of how electric and magnetic fields can be used to control the bulk physical properties of such nanocomposites.
A processing pipeline for X3D earth-based spatial data view services
Authors: Thorsten Reitz, Michel Krämer, Simon Thum
Venue: Proceedings of the 14th International Conference on 3D Web Technology (2009)

Over the last years, a high demand for scenario-specific visualizations of 3D urban models has evolved. At the same time, established service specifications do not yet provide the means to define 3D map products and to deliver them in suitable formats, since they are focused on traditional 2D map products. In this paper, we present an approach for the definition of a 3D urban model view service. This approach consists of a three-step process, in which original geodata is integrated, filtered and then transformed into various scene graph formats such as X3D. We were able to maintain a high degree of compatibility with existing services and specifications such as Styled Layer Descriptors and the Web Map Service interface. The paper concludes with the experiences gathered from implementing and using this approach and provides an outlook as to how the lessons learned can be used in application and standardization.
Privacy-aware security applications using RFID technology
Authors: S. Srinivasan
Venue: Proceedings of the 5th Annual Workshop on Cyber Security and Information Intelligence Research: Cyber Security and Information Intelligence Challenges and Strategies (2009)

Radio Frequency IDentification (RFID) technology based applications are gaining widespread acceptance. Much of the RFID use at this time is in tracking objects. This type of application takes a variety of forms. Our goal in this paper is to outline the impact of RFID technology both from the security perspective as well as the level of privacy protection that it affords. We will focus on applications in transportation, medical, and financial areas.
The COLAC Model: Collaborative Paper-Writing in the Humanities
Authors: Guillaume Schiltz, Andreas Langlotz
Venue: Proceeding of the 2006 conference on Learning by Effective Utilization of Technologies: Facilitating Intercultural Understanding (2006)

In this paper we introduce a pedagogical model that trains writing skills in a blended learning environment (online/in-class). The model has been successfully implemented in several university courses. The results of a formative evaluation support the effectiveness of the model but also point to problems related to the unfamiliar collaborative learning methods.
Allometry constants of finite-dimensional spaces: theory and computations
Authors: Simon Foucart
Venue: Numerische Mathematik (2009)

We describe the computations of some intrinsic constants associated to an n-dimensional normed space $${\mathcal{V}}$$, namely the N-th &#x201c;allometry&#x201d; constants $$\kappa_\infty^N(\mathcal{V}) := \inf \{\|T\| \cdot \|T'\|, \quad T\,:\,\ell_\infty^N \to \mathcal{V}, \; \; T': \mathcal{V} \to \ell_\infty^N, \; \;TT'={\rm Id}_{\mathcal{V}}\}.$$ These are related to Banach&#x2013;Mazur distances and to several types of projection constants. We also present the results of our computations for some low-dimensional spaces such as sequence spaces, polynomial spaces, and polygonal spaces. An eye is kept on the optimal operators T and T&#x2032;, or equivalently, in the case N =&#x00a0;n, on the best conditioned bases. In particular, we uncover that the best conditioned bases of quadratic polynomials are not symmetric, and that the Lagrange bases at equidistant nodes are best conditioned in the spaces of trigonometric polynomials of degree at most one and two.
An Experimental Comparison of Kernel Clustering Methods
Authors: Maurizio Filippone, Francesco Masulli, Stefano Rovetta
Venue: Proceeding of the 2009 conference on New Directions in Neural Networks: 18th Italian Workshop on Neural Networks: WIRN 2008 (2009)

In this paper, we compare the performances of some among the most popular kernel clustering methods on several data sets. The methods are all based on central clustering and incorporate in various ways the concepts of fuzzy clustering and kernel machines. The data sets are a sample of several application domains and sizes. A thorough discussion about the techniques for validating results is also presented. Results indicate that clustering in kernel space generally outperforms standard clustering, although no method can be proven to be consistently better than the others.
System theoretic viewpoint on modeling of complex systems: design, synthesis, simulation, and control
Authors: Armen G. Bagdasaryan
Venue: Proceedings of the 7th WSEAS international conference on Computational intelligence, man-machine systems and cybernetics (2008)

We consider the basic features of complex dynamic and control systems, including systems having hierarchical structure. Special attention is paid to the problems of design and synthesis of complex systems and control models, and to the development of simulation techniques and systems. A model of complex system is proposed and briefly analyzed.
Using the Borsuk-Ulam Theorem: Lectures on Topological Methods in Combinatorics and Geometry
Authors: Jiri Matousek
Venue: Universitext (2007)

A number of important results in combinatorics, discrete geometry, and theoretical computer science have been proved using algebraic topology. While the results are quite famous, their proofs are not so widely understood. They are scattered in research papers or outlined in surveys, and they often use topological notions not commonly known among combinatorialists or computer scientists. This book is the first textbook treatment of a significant part of such results. It focuses on so-called equivariant methods, based on the Borsuk-Ulam theorem and its generalizations. The topological tools are intentionally kept on a very elementary level (for example, homology theory and homotopy groups are completely avoided). No prior knowledge of algebraic topology is assumed, only a background in undergraduate mathematics, and the required topological notions and results are gradually explained. At the same time, many substantial combinatorial results are covered, sometimes with some of the most important results, such as Kneser's conjecture, showing them from various points of view. The history of the presented material, references, related results, and more advanced methods are surveyed in separate subsections. The text is accompanied by numerous exercises, of varying difficulty. Many of the exercises actually outline additional results that did not fit in the main text. The book is richly illustrated, and it has a detailed index and an extensive bibliography. This text started with a one-semester graduate course the author taught in fall 1993 in Prague. The transcripts of the lectures by the participants served as a basis of the first version. Some years later, a course partially based on that text was taught by G\"unter M. Ziegler in Berlin, who made book is based on a thoroughly rewritten version prepared during a pre-doctoral course I taught at the ETH Zurich in fall 2001. Most of the material was covered in the course: Chapter 1 was assigned as an introductory reading text, and the other chapters were presented in approximately 30 hours of teaching (by 45 minutes), with some omissions throughout and with only a sketchy presentation of the last chapter. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Fidelity-aware replication for mobile devices
Authors: Kaushik Veeraraghavan, Venugopalan Ramasubramanian, Thomas L. Rodeheffer, Douglas B. Terry, Ted Wobber
Venue: Proceedings of the 7th international conference on Mobile systems, applications, and services (2009)

Mobile devices often store data in reduced resolutions or custom formats in order to accommodate resource constraints and tailor-made software. The Polyjuz framework enables sharing and synchronization of data across a collection of personal devices that use formats of different fidelity. Layered transparently between the application and an off-the-shelf replication platform, Polyjuz bridges the isolated worlds of different data formats. With Polyjuz, data items created or updated on high-fidelity devices-such as laptops and desktops-are automatically replicated onto low-fidelity, mobile devices. Similarly, data items updated on low-fidelity devices are reintegrated with their high-fidelity counterparts, when the application permits it. Polyjuz performs these fidelity reductions and reintegrations as devices exchange data in a peer-to-peer manner, ultimately extending the eventual-consistency guarantee of the underlying replication platform to the multi-fidelity universe. In this paper, we present the design and implementation of Polyjuz and demonstrate its benefits for a fidelity-aware contacts-management application.
What Every Librarian Should Know about Electronic Privacy
Authors: Jeannette Woodward
Venue:  (2007)

Library computer users are often novices and may not be aware that even seemingly innocuous information supplied to Web sites can be mined by government agencies, unscrupulous businesses, and criminals. Even the donated computers that libraries accept and pass on to otherwcan reveal confidential information like social security numbers. The recent discovery that online service providers have been supplying vast quantities of data to government agencies without the public's knowledge dramatically brought this threat to light. This book will help you, as a librarian, understand the threats and pitfalls of electronic privacy and develop a solid plan to protect the privacy of your patrons. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
A Knowledge Discovery Methodology for Identifying Vulnerability Factors of Mental Disorder in an Intellectually Disabled Population
Authors: Xavier Lluis Martorell, Raimon Massanet Vila, Karina Gibert, Miquel Sànchez-Marrè, Juan Carlos Martín, Almudena Martorell
Venue: Proceeding of the 2007 conference on Artificial Intelligence Research and Development (2007)

This paper proposes a knowledge discovery methodology for generating new hypothesis to a particular knowledge theory. A combination of AI and Statistical techniques is proposed to increase the corpus of current knowledge of the target domain. In this paper a particular application to analyze comorbid mental disorders with intellectual disability is presented as an example.
E-Government: on the Way Towards Frameworks for Application Engineering
Authors: Marie-Noëlle Terrasse, Marinette Savonnet, Eric Leclercq, George Becker, Thierry Grison, Laurence Favier, Carlo Daffara
Venue: Proceeding of the 2008 conference on Information Modelling and Knowledge Bases XIX (2008)

In this article we present high-level architectures for e-Government applications. These architectures depend on a country's strategy for e-Government integration and they give rise to two major issues. The first issue is how to guarantee semantical quality of information regardless of the chosen architecture. The second issue is how to facilitate sound transition of e-Government applications from one architecture to another under evolutionary pressures of a country's political strategy. In order to address these two issues we use Model-Driven Engineering which places metamodels, models and their transformations at the core of the engineering process. Overall semantical quality is thus guaranteed by metamodels while model transformations guarantee soundness under evolution. We propose two adjustments to OMG's architectures for Model-Driven Engineering of highly-complex application domains. In OMG's architectures, a metamodel describes an application domain (reusable information) while a model describes an application (contextual information). By introducing a reusable model for a family of applications, we can share pieces of model-level information.
NLP-based extraction of modificatory provisions semantics
Authors: Alessandro Mazzei, Daniele P. Radicioni, Raffaella Brighi
Venue: Proceedings of the 12th International Conference on Artificial Intelligence and Law (2009)

In this paper we illustrare a research based on NLP techniques aimed at automatically annotate modificatory provisions. We propose an approach which pairs deep syntactic parsing with rule-based shallow semantic analysis relying on a fine-grained taxonomy of modificatory provisions. The implemented system is evaluated on a large dataset hand-crafted by legal experts; the results are discussed and future directions of the research outlined.
Reducing Channel-Change Times with the Real-Time Transport Protocol
Authors: Ali C. Begen, Neil Glazebrook, William Ver Steeg
Venue: IEEE Internet Computing (2009)

In a multicast IPTV distribution network, each channel is offered in a different multicast session, and the IP set-top box joins the respective session when the viewer tunes to a new channel. Due to delays associated with network components and encoding schemes, the time difference between the channel-change request and when the new channel shows up on the screen can be annoyingly large. This article examines the Real-Time Transport Protocol (RTP) in IPTV networks and describes how RTP and its control protocol can help reduce channel-change times.
A formal model for Web service composition
Authors: Freddy Lécué, Alain Léger
Venue: Proceeding of the 2006 conference on Leading the Web in Concurrent Engineering: Next Generation Concurrent Engineering (2006)

Automated composition of Web services or the process of forming new value added Web services is one of the most promising challenges in the semantic Web service research area. Semantics is one of the key elements for such a task. Even if semantics enables Web service to describe their capabilities and processes, there is still some work to be done. Indeed Web services described at functional level need a formal model to perform the automated composition of Web services. The suggested model (i.e. Causal link matrix) is a necessary starting point to apply problem-solving techniques such as regression-based search for Web service composition. The innovative model supports a semantic context in order to find a solution for an AI planning-oriented Web service composition.
Handling Large Formal Context Using BDD --- Perspectives and Limitations
Authors: Andrei Rimsa, Luis E. Zárate, Mark A. Song
Venue: Proceedings of the 7th International Conference on Formal Concept Analysis (2009)

This paper presents Binary Decision Diagrams (BDDs) applied to Formal Concept Analysis (FCA). The aim is to increase the FCA capability to handle large formal contexts. The main idea is to represent formal context using BDDs for later extraction of the set of all formal concepts from this implicit representation. BDDs have been evaluated based on several types of randomly generated synthetic contexts and on density variations in two distinct occasions: (1) computational resources required to build the formal contexts in BDD; and (2) to extract all concepts from it. Although BDDs have had fewer advantages in terms of memory consumption for representing formal contexts, it has true potential when all concepts are extracted. In this work, it is shown that BDDs could be used to deal with large formal contexts especially when those have few attributes and many objects. To overcome the limitations of having contexts with fewer attributes, one could consider vertical partitions of the context to be used with distributed FCA algorithms based on BDDs.
Beyond Singleton Arc Consistency
Authors: M. R. C. van Dongen
Venue: Proceeding of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy (2006)

Shaving algorithms, like singleton arc consistency (SAC), are currently receiving much interest. They remove values which are not part of any solution. This paper proposes an efficient shaving algorithm for enforcing stronger forms of consistency than SAC. The algorithm is based on the notion of weak k-singleton arc consistency, which is equal to sac if k=1 but stronger if k>1. This paper defines the notion, explains why it is useful, and presents an algorithm for enforcing it. The algorithm generalises Lecoutre and Cardon's algorithm for establishing sac. Used as pre-processor for MAC it improves the solution time for structured problems. When run standalone for k>1, it frequently removes more values than sac at a reasonable time. Our experimental results indicate that at the sac phase transition, it removes many more values than SAC-1 for k=16 in less time. For many problems from the literature the algorithm discovers lucky solutions. Frequently, it returns satisfiable csps which it proves inverse consistent if all values participate in a lucky solution.
Two-Dimensional Maximum Clustering-Based Scatter Difference Discriminant Analysis for Synthetic Aperture Radar Automatic Target Recognition
Authors: Liping Hu, Hongwei Liu, Shunjun Wu
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part II (2009)

In this paper, a novel image feature extraction technique, called two-dimensional maximum clustering-based scatter difference (2DMCSD) discriminant analysis, is proposed. This method combines the ideas of two-dimensional clustering-based discriminant analysis (2DCDA) and maximum scatter difference (MSD), which can directly extract the optimal projection vectors from 2D image matrices rather than 1D image vectors based on the cluster scatter difference criterion. 2DMCSD not only avoids the linearity and singularity problems frequently occurred in the classical Fisher linear discriminant analysis (FLDA) due to the high dimensionality and small sample size problems, but also saves much time for feature extraction. Extensive experiments conducted on the moving and stationary target acquisition and recognition (MSTAR) public database demonstrate that the proposed method is more effective than the existing subspace analysis methods, such as two-dimensional principal component analysis (2DPCA) and two-dimensional linear discriminant analysis (2DLDA).
A new look at the roles of spinning and blocking
Authors: Ryan Johnson, Manos Athanassoulis, Radu Stoica, Anastasia Ailamaki
Venue: Proceedings of the Fifth International Workshop on Data Management on New Hardware (2009)

Database engines face growing scalability challenges as core counts exponentially increase each processor generation, and the efficiency of synchronization primitives used to protect internal data structures is a crucial factor in overall database performance. The trade-offs between different implementation approaches for these primitives shift significantly with increasing degrees of available hardware parallelism. Blocking synchronization, which has long been the favored approach in database systems, becomes increasingly unattractive as growing core counts expose its bottlenecks. Spinning implementations improve peak system throughput by a factor of 2x or more for 64 hardware contexts, but suffer from poor performance under load. In this paper we analyze the shifting trade-off between spinning and blocking synchronization, and observe that the trade-off can be simplified by isolating the load control aspects of contention management and treating the two problems separately: spinning-based contention management and blocking-based load control. We then present a proof of concept implementation that, for high concurrency, matches or exceeds the performance of both user-level spin-locks and the pthread mutex under a wide range of load factors.