ppxscal/embedding_network huggingface dataset:
State Encoding of Finite-State Machines Targeting Threshold and Majority Logic Based Implementations with Application to Nanotechnologies
Authors: Rui Zhang, Niraj K. Jha
Venue: Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (2006)

In this paper, we address the problem of state encoding of finite-state machines (FSMs) targeting threshold and majority logic based implementations, which have applications in nanotechnologies. Previous work on state encoding is based on Boolean logic. These methods try to optimize either the literal count or sum-of-product (SOP) terms count, which are more relevant for CMOS technology based circuits. As progress is made in the material and physical understanding of nanoscale devices, functionally-correct nanoscale circuits based on threshold and majority gates are being successfully demonstrated. However, there exists no methodology or design automation tool for state encoding targeting threshold and majority gate based implementations. We propose such a methodology based on an evolutionary algorithm. Experimental results indicate that large reductions in gate count, area and interconnect count are possible, compared to some traditional state encoding methods.
An Approach to Architectural Enhancement for Embedded Speech Applications
Authors: Soumyajit Dey, Susmit Biswas, Arijit Mukhopadhyay, Anupam Basu
Venue: Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (2006)

Advances in Human Computer Interaction (HCI) technology has resulted in widespread development of natural language and speech applications. These applications are known to be computationally different from other end-user applications. In this paper, the architectural features of Text To Speech (TTS) and Automatic Speech Recognition (ASR) applications have been evaluated and cost effective optimal architectural solutions have been suggested. The results have shown that low cost solutions such as ISA extension and feature addition to an existing embedded architecture can lead to appreciable improvement in performance for these applications. This work also presents a design space exploration to suggest an optimized VLIW architecture for TTS and ASR applications.
Service Discovery through Multi-Agent Consensus
Authors: Chun-Lung Huang, Chi-Chun Lo, Yinsheng Li, Kuo-Ming Chao, Jen-Yao Chung, Ying Huang
Venue: Proceedings of the IEEE International Workshop (2005)

Service discovery is one of the key processes for facilitating the automation of service composition. The effectiveness of discovery relies on the appropriateness of descriptions for services and the consensus on the descriptions from participating bodies. However, existing work on service discovery did not address the issues associated with inconsistent understandings on the service descriptions from service providers and consumers. Pre-defined ontology may not be an appropriate solution in this case, due to its static nature and dynamic environment that web services are situated. In this paper, we attempt to address this issue by proposing a multi-agent consensus approach which is based on fuzzy logic and semantic web technologies in order to assist service providers and consumers in reaching consensus on their service advertisement and request with consideration of their expectations and preferences. In addition, a user friendly tool for constructing agent-based web service is introduced for assistance in repsenting user's preference and expectations as well as managing web services.
Mining rule semantics to understand legislative compliance
Authors: Travis D. Breaux, Annie I. Antón
Venue: Proceedings of the 2005 ACM workshop on Privacy in the electronic society (2005)

Organizations in privacy-regulated industries (e.g. healthcare and financial institutions) face significant challenges when developing policies and systems that are properly aligned with relevant privacy legislation. We analyze privacy regulations derived from the Health Insurance Portability and Accountability Act (HIPAA) that affect information sharing practices and consumer privacy in healthcare systems. Our analysis shows specific natural language semantics that formally characterize rights, obligations, and the meaningful relationships between them required to build value into systems. Furthermore, we evaluate semantics for rules and constraints necessary to develop machine-enforceable policies that bridge between laws, policies, practices, and system requirements. We believe the results of our analysis will benefit legislators, regulators and policy and system developers by focusing their attention on natural language policy semantics that are implementable in software systems.
Multiple-view geometry for image-based modeling
Authors: Jana Košecká, Yi Ma, Stefano Soatto, René Vidal
Venue: ACM SIGGRAPH 2004 Course Notes (2004)

This course presents the state of the art in multiple-view geometry, including methods and algorithms for reconstructing 3-D geometric models of scenes from video or photographs. This course is based on a novel approach to multiple-view geometry that only requires linear algebra, as opposed to more involved projective and algebraic geometry that most current methods employ. This new approach aims to make image-based modeling techniques accessible to a larger audience compared to existing ones. The presentations will be based on a recent Springer-Verlag textbook on 3D vision (coauthored by the course organizers). Matlab code for the algorithms will be made available at the book website.
Visualization PSE for Multi-Physics Analysis by Using OpenGL API Fusion Technique
Authors: Hideo Miyachi, Marie Oshima, Yoshitaka Ohyoshi, Takehiro Matsuo, Taiki Tanimae, Nobuyuki Oshima
Venue: Proceedings of the First International Conference on e-Science and Grid Computing (2005)

PSE has become increasingly important as the computer environment has become ever more complex. In addition, the development of multi-physics calculations has complicated software systems, and an environment in which multi-simulation codes can be integrated has also become important in the software business. Because of this, we here propose a visualization PSE for multi-physics simulation. We are not proposing a new visualization tool for it, but an integration environment to merge the outputs of two or more existing visualization software visually. We developed a prototype which merges multi-outputs from any OpenGL programs without recompiling or re-linking by using the GLR (GL-DLL Replacement) technique. And the performance characteristics of the system were examined.
Supervised Ordering — An Empirical Survey
Authors: Toshihiro Kamishima, Hideto Kazawa, Shotaro Akaho
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

Ordered lists of objects are widely used as representational forms. Such ordered objects include Web search results or bestseller lists. In spite of their importance, methods of processing orders have received little attention. However, research concerning orders has recently become common; in particular, researchers have developed various methods for the task of Supervised Ordering to acquire functions for object sorting from example orders. Here, we give a unified view of these methods and our new one, and empirically survey their merits and demerits.
An evolutionary algorithm to generate ellipsoid network intrusion detectors
Authors: Joseph M. Shapiro, Gary B. Lamont, Gilbert L. Peterson
Venue: Proceedings of the 2005 workshops on Genetic and evolutionary computation (2005)

This paper introduces the ellipsoid as a geometric structure for detecting network intrusions. Section 2 describes and analyzes the design of the ellipsoid generation algorithm. Experimental design is set forth in Section 3. In Section 4 we analyze experimental results. Section 5 summarizes the paper and provides direction for continued research.
Cooperative Scheduling Among Time-Bounded Agents
Authors: Habiba Belleili, Maroua Bouzid, Mokhtar Sellami
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

This paper defines a coordination process allowing hierarchical agents equipped with multiple methods to treat efficiently arriving tasks. The aim is to find an optimal (ie. maximizing the utility of the result) combination of methods within the time window specified by the task. Agents are resource-limited and operate under time constraints. Agents (with their chosen methods) will be used in sequential levels to progressively improve the quality of a task response.
Steering Model-Driven Evolution by Responsibilities
Authors: Ming-Jen Huang, Takuya Katayama
Venue: Proceedings of the Eighth International Workshop on Principles of Software Evolution (2005)

The model-driven development approach provides an alternative solution to human-centered software evolution. In this paper, we propose using the concept of responsibility to define model mapping where responsibility represents a high-level description of "tasks to be accomplished by something". Based on this concept, we have created RESTDA, a development architecture for building enterprise information systems. In RESTDA, a software system is defined by three world levels and two views. The three world levels represent different levels of abstraction within the software system. The two views separate the structural concepts and behavioral concepts of each world level. RESTDA applies a two-phase generation. The first phase generates an intermediate model from high-level models. The second phase generates code from the intermediate model. The automatic transformation promises that any change to the business requirements results in corresponding code generation. The intermediate model separates changes to the underlying implementation technology from the top-most level.
A Session Layer Concept for Overlay Networks
Authors: Tom Mahieu, Pierre Verbaeten, Wouter Joosen
Venue: Wireless Personal Communications: An International Journal (2005)

Current day mobility solutions are characterized by a number of essential restrictions that prevent them from being successful in an overlay network environment. This paper proposes 4 properties that mobility solutions must have to address these restrictions: application cooperation, higher layer mobility awareness, general applicability and protocol heterogeneity. Subsequently, a mobility solution that realizes all these properties is described. The solution introduces a session layer in the protocol stack that consists of two subsystems: the connection abstraction system and the address management system. Other mobility solutions found in the literature, session layer and others, typically only realize a subset of the four properties.
Extracting relations from large text collections
Authors: Luis Gravano
Venue:  (2005)

A wealth of information is hidden within unstructured text. Often, this information can be beat exploited in structured or relational form, which is well suited for sophisticated query processing, for integration with relational database management systems, and for data mining. This thesis addresses two fundamental problems in extracting relations from large text collections: (1) portability: tuning extraction systems for new domains and (2) scalability: scaling up information extraction to large collections of documents. To address the first problem, we developed the Snowball information extraction system, a domain-independent system that learns to extract relations from unstructured text based on only a handful of user-provided example relation instances. Snowball can then be adapted to extract new relations with minimum human effort. Snowball improves the extraction accuracy by automatically evaluating the quality of both the acquired extraction patterns and the extracted relation instances. To address the second problem, we developed the QXtract system, which learns search engine queries that retrieve the documents that are relevant to a given information extraction system and extraction task. QXtract can dramatically improve the efficiency of the information extraction process, and provides a building block for extracting structured information and text data mining from the web at large.
Exploratory basis pursuit classification
Authors: M. Brown, N. P. Costen
Venue: Pattern Recognition Letters (2005)

Feature selection is a fundamental process in many classifier design problems. However, it is NP-complete and approximate approaches often require requires extensive exploration and evaluation. This paper describes a novel approach that represents feature selection as a continuous regularization problem which has a single, global minimum, where the model's complexity is measured using a 1-norm on the parameter vector. A new exploratory design process is also described that allows the designer to efficiently construct the complete locus of sparse, kernel-based classifiers. It allows the designer to investigate the optimal parameters' trajectories as the regularization parameter is altered and look for effects, such as Simpson's paradox, that occur in many multivariate data analysis problems. The approach is demonstrated on the well-known Australian Credit data set.
A Memory Efficient, 100 Gb/sec MAC Classification Engine
Authors: V. Papaefstathiou, I. Papaefstathiou
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

In this paper, we propose a classification engine employed at Ethernet's MAC Layer which uses an innovative hashing scheme and internal replacement of MAC Vendor IDs; the Hash Based Classification Engine (HBCE) compacts the MAC address tables and supports extremely high speed decisions. Its very low memory requirements make it a very promising candidate for Ethernet equipments that would need to support classification at Data Link Layer and at Multi- Gigabit per second network speeds. Moreover HBCE can also so be used very efficiently in lower-bandwidth wireless environments.
A Generic Model for Symbolic Analyzing Security Protocols
Authors: Yonggen Gu, Yuxi Fu, Yang Li, Xiaoju Dong
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

Formal methods have proved useful in the analysis of security protocols. In this paper, we propose a generic model for symbolic analyzing security protocols (GSPM for short) that supports message passing semantics and constructs for modelling the behavior of protocol participants. GSPM is simple, but it is expressive enough to express security protocols and properties in a precise and faithful manner. In order to address that the execution of a protocol generates infinitely many paths, we use symbolic method. Based on GSPM, it is shown how security properties such as confidentiality, authentication, non-repudiation, fairness and anonymity can be described.
Segment-Based Injection Attacks against Collaborative Filtering Recommender Systems
Authors: Robin Burke, Bamshad Mobasher, Runa Bhaumik, Chad Williams
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

Significant vulnerabilities have recently been identi- fied in collaborative filtering recommender systems. Researchers have shown that attackers can manipulate a system's recommendations by injecting biased profiles into it. In this paper, we examine attacks that concentrate on a targeted set of users with similar tastes, biasing the system's responses to these users. We show that such attacks are both pragmatically reasonable and also highly effective against both user-based and item-based algorithms. As a result, an attacker can mount such a "segmented" attack with little knowledge of the specific system being targeted and with strong likelihood of success.
Sharing User Models for Adaptive Hypermedia Applications
Authors: Maria Bielikova, Jaroslav Kuruc
Venue: Proceedings of the 5th International Conference on Intelligent Systems Design and Applications (2005)

In this paper we present an approach to sharing a user model among several adaptive hypermedia applications. Current adaptive hypermedia applications often realize the user model as the internal part of the system without any possibility to share this model with other applications. We introduce a web service called UMOWS (User Model Web Service). The web service acts as a store of user characteristics represented in pre-defined ontologies that define semantics of the stored knowledge. Access and corresponding privileges to the web service is managed by the user through the management interface. The user is also allowed to inspect/ modify the state of the user model.
The call of the other 0.1%: genetic aesthetics and the new Moreaus
Authors: Susan McHugh
Venue: AI Society (2005)

Remakes of popular novels and films indicate how animals have become a primary means of representing not only the rapid development and proliferation of genetically modified organisms in plant form but also the interplay of aesthetics and scientific technologies in the post-Darwinian emphasis on species as a social form. Where vivisection worked in the 1896 novel The Island of Dr. Moreau as a scientific mechanism for social dominance, ensuing versions of the story over the past 100&#x00a0;years have come to position eugenic breeding and, most recently, transgenic splicing as the trope for playing out the central cultural work of ordering species in the distinction of human species being. But the contradictions of representing animals also open up other possibilities for genetic aesthetics. Especially in the 1996 film remake, the isolation of the successful transgenic animal (akin to what artist Eduardo Kac calls &#x201c;the beautiful chimera&#x201d;) and her alignment with the human become the conditions of possibility for a theriocentric (nonhuman animal centered) community of animal transgenics that emerges in opposition to the human genetic aesthetic. Animals remain the medium in which these struggles are (re)enacted, but their transgenic forms enable an investigation of how and why the human is increasingly defined as genetically 0.1% removed from the animal.
Methods of Analyzing the Nonstationary Time Series with Implicit Changes in Their Properties
Authors: E. A. Grebenyuk
Venue: Automation and Remote Control (2005)

The problems of analysis of the nonstationary time series with explicit and implicit changes in their properties were discussed. The main approaches and methods of analysis of the nonstationary processes were described. Consideration was given to the trend-stationary and difference-stationary processes. The algorithms to determine the process type hinge on verifying hypotheses like "initial process is a DS-process (TS-process)" against the alternative ones. The notions of false regression and cointegration were discussed. The problems arising at analysis of the varying-property processes and methods of their solution were reviewed. Consideration was given to the cases of explicit and implicit changes and algorithms of detection in the current and a posteriori modes.
Multi-instance tree learning
Authors: Hendrik Blockeel, David Page, Ashwin Srinivasan
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

We introduce a novel algorithm for decision tree learning in the multi-instance setting as originally defined by Dietterich et al. It differs from existing multi-instance tree learners in a few crucial, well-motivated details. Experiments on synthetic and real-life datasets confirm the beneficial effect of these differences and show that the resulting system outperforms the existing multi-instance decision tree learners.
Automated Verification of Proper Choreography Implementation
Authors: Erwin Jansen, Hen-I Yang, Sumi Helal
Venue: Proceedings of the International Symposium on Applications on Internet (2006)

As business transactions become more complex it is important that all participants obey the so called rules of engagement. These rules of engagement can be captured in an interaction protocol or choreography. A choreography provides rules on how various webservices act together, in terms of observable behavior.We investigate how we can extract a protocol from a program and verify whether or not the implementation adheres to the protocol.We derive an algorithm to verify whether a program is operationally compatible with a protocol, meaning the program does not violate the protocol. This guarantees that a program will be from anomalies suchs as dead lock or failure due to unexpected messages.
Algorithms for Perfectly Contractile Graphs
Authors: Frédéric Maffray, Nicolas Trotignon
Venue: SIAM Journal on Discrete Mathematics (2005)

We consider the class ${\cal A}$ of graphs that contain no odd hole, no antihole of length at least $5$, and no prism (a graph consisting of two disjoint triangles with three disjoint paths between them) and the class ${\cal A}'$ of graphs that contain no odd hole, no antihole of length at least $5$, and no odd prism (prism whose three paths are odd). These two classes were introduced by Everett and Reed and are relevant to the study of perfect graphs. We give polynomial-time recognition algorithms for these two classes. In contrast we prove that determining if a general graph contains a prism (or an even prism, or an odd prism) is NP-complete.
Defects, Yield, and Design in Sublithographic Nano-electronics
Authors: Mehdi B. Tahoori
Venue: Proceedings of the 20th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2005)

It is anticipated that defect densities in bottom-up self-assembled nanotechnology are much higher than those in conventional VLSI technologies. Therefore, defect tolerance needs to be included in various steps of the design automation flow. In this paper, a new defect tolerant flow is proposed and a new yield metric, based on this flow, is defined. This metric is evaluated for various molecular crossbars with different defect densities. Test and diagnosis of molecular crossbars, as the main building blocks in this technology, are also investigated.
Analytical Design of Invariant Controllers
Authors: M. Sh. Misrikhanov
Venue: Automation and Remote Control (2005)

Constructive conditions for the invariance of linear systems are derived from pencils of reduced-order matrices and applied to develop a method of design of invariant controllers. Examples illustrating the application of the analytical design method are given.
An improved QTCQ wavelet image coding method using DCT and coefficient reorganization
Authors: Li Chen, Jia Wang
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

An improved quadtree classification and TCQ (QTCQ) wavelet image compression method is proposed in this paper. The method applies small block DCT to coefficients in the high frequency subbands and reorders them before quantizing and coding. Experiments results show that the proposed method outperforms QTCQ and other state-of-the-art wavelet coding methods. For example, for Barbara image, at 0.5 bit/pixel, this algorithm outperforms QTCQ, SPIHT, SLCCA and JPEG2000 by 0.4dB, 1.04dB, 0.54dB and 0.17dB in PSNR, respectively. It is also observed that this algorithm works extremely well for textured images like fingerprint images.