ppxscal/embedding_network huggingface dataset:
Evolving Cellular Automata for Location Management in Mobile Computing Networks
Authors: Riky Subrata, Albert Y. Zomaya
Venue: IEEE Transactions on Parallel and Distributed Systems (2003)

Location management is a very important and complex problem in mobile computing. There is a need to develop algorithms that could capture this complexity yet can be easily implemented and used to solve a wide range of location management scenarios. This paper investigates the use of cellular automata (CA) combined with genetic algorithms to create an evolving parallel reporting cells planning algorithm. In the reporting cell location management scheme, some cells in the network are designated as reporting cells; mobile terminals update their positions (location update) upon entering one of these reporting cells. To create such an evolving CA system, cells in the network are mapped to cellular units of the CA and neighborhoods for the CA is selected. GA is then used to discover efficient CA transition rules. The effectiveness of the GA and of the discovered CA rules is shown for a number of test problems.
Existence for Shape Optimization Problems in Arbitrary Dimension
Authors: W. B. Liu, P. Neittaanmäki, D. Tiba
Venue: SIAM Journal on Control and Optimization (2002)

We discuss some existence results for optimal design problems governed by second order elliptic equations with the homogeneous Neumann boundary conditions or with the interior transmission conditions. We show that our continuity hypotheses for the unknown boundaries yield the compactness of the associated characteristic functions, which, in turn, guarantees convergence of any minimizing sequences for the first problem. In the second case, weaker assumptions of measurability type are shown to be sufficient for the existence of the optimal material distribution. We impose no restriction on the dimension of the underlying Euclidean space.
Digital Window Comparator DfT Scheme for Mixed-Signal ICs
Authors: Daniela De Venuto, Michael J. Ohletz, Bruno Riccò
Venue: Journal of Electronic Testing: Theory and Applications (2002)

The possibility of using window comparators for on-chip and potentially also on-line response evaluation of analogue circuits is investigated. No additional analogue test inputs are required. The additional circuitry can be either realised by means of standard digital gates taken from an available library or by full custom designed gates. With only a few gates an observation window can be realized, tailored to the application needs. With this approach, the test overhead can be kept extremely low. Due to the low gate capacitance also the load on the observed nodes is very low. Simulation results for some examples show that 100% of all assumed layout-realistic faults could be detected.
Lattice-Based Access Control Models
Authors: Ravi S. Sandhu
Venue: Computer (1993)

Lattice-based access control models were developed in the early 1970s to deal with the confidentiality of military information. In the late 1970s and early 1980s, researchers applied these models to certain integrity concerns. Later, application of the models to the Chinese Wall policy, a confidentiality policy unique to the commercial sector, was demonstrated. A balanced perspective on lattice-based access control models is provided. Information flow policies, the military lattice, access control models, the Bell-LaPadula model, the Biba model and duality, and the Chinese Wall lattice are reviewed. The limitations of the models are identified.
A Tool for Organizing Web Information
Authors: Kuhanandha Mahalingam, Michael N. Huhns
Venue: Computer (1997)

The physical and logical differences among information sources on the Internet complicate information retrieval. For instance, data is no longer just simple text or tuples, but now includes objects and multimedia. Data can also have varied and often arcane semantics. Sources have different policies, procedures, and conventions and are hosted by diverse platforms. Ontologies-models of concepts and their relationships-are a powerful way to organize query formulation and semantic reconciliation in large distributed information environments. They can capture both the structure and semantics of information environments, so an ontology-based search engine can handle both simple keyword-based queries as well as complex queries on structured data. Ontology-based interoperation is especially good at dealing with inconsistent semantics. However, ontologies are difficult to construct. The Java Ontology Editor (JOE) helps users build and browse ontologies. It also enables query formulation at several levels of abstraction. The authors discuss the use of JOE to develop a health care information system.
Real-time procedural generation of `pseudo infinite' cities
Authors: Stefan Greuter, Jeremy Parker, Nigel Stewart, Geoff Leach
Venue: Proceedings of the 1st international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2003)

We present an approach to procedural generation of `pseudo infinite' virtual cities in real-time. The cities contain geometrically varied buildings that are generated as needed. The building generation parameters are created by a pseudo random number generator, seeded with an integer derived from the building's position. The varied building geometries are extruded from a set of floor plans. The floor plans for each building are created by combining randomly generated polygons in an iterative process. A display list caching and frustum filling approach manages the generation of buildings and the use of system resources. This approach has been implemented on commodity PC hardware, resulting in interactive frame rates.
Electrical Characterization of Megabit DRAMs, Part 1: External Testing
Authors: G. Antonin, H. -D. Oberle, J. Kolzer
Venue: IEEE Design Test (1991)

An approach to the electrical characterization of dynamic RAMs in which chip design and DRAM process technology are verified and optimized concurrently is reported. Both parametric and functional tests were performed. The authors describe an information and scheduling system for analysis and testing that handles the required electrical measuring data from the testers. It is shown how data analysis supports the interpretations by data correlations on a real statistical basis. The short learning cycle required by this approach was obtained by ensuring the smooth cooperation of all those involved in the overall analysis.
A Structured Approach for Cooperative Query Answering
Authors: W. W. Chu, Q. Chen
Venue: IEEE Transactions on Knowledge and Data Engineering (1994)

This paper proposes the use of a type abstraction hierarchy as a framework for deriving cooperative query answers. The type abstraction hierarchy integrates the abstraction view with the subsumption (is-a) and composition (part-of) views of a type hierarchy. Such a framework provides multilevel object representation, which is an important aspect of cooperative query answering. The concept of pattern that specifies one or more conditions on an object is also proposed. Patterns have smaller granularity than types, and thus provide more specific semantic information. Cooperative query answering consists of query relaxation, generalization, specialization, and association on patterns. Query relaxation can be explicitly specified by the user or implicitly performed by the system. The implicit and explicit relaxations can also be combined and performed interactively by both the system and the user. CSQL, an extension of SQL for cooperative query answering, is also proposed. Preliminary experimental results reveal that the proposed type abstraction hierarchy provides an organized structure representing concepts at different knowledge levels in various domains, and provides a systematic and efficient method for cooperative query answering.
Timing Constraint Remapping to Achieve Time Equi-Continuity in Distributed Real-Time Systems
Authors: M. Ryu, J. Park, S. Hong
Venue: IEEE Transactions on Computers (2001)

Discretely synchronized, distributed real-time systems may suffer from a time discontinuity problem in that local clocks observe the disappearance or reappearance of time intervals. This problem occurs since traditional discrete clock synchronization algorithms adjust local clocks instantaneously. Such time discontinuities may lead to runtime faults due to the loss or gain of critical time points such as task release times and deadlines. In this paper, we propose a dynamic constraint transformation technique we call a constraint transformation for equi-continuity (CTEC) to correctly enforce timing requirements in a distributed real-time system possessing periodically synchronized distributed local clocks. While continuous clock synchronization is generally suggested to avoid the time discontinuity problem, it incurs too much runtime overhead to be implemented in software. The proposed CTEC technique can solve the time discontinuity problem without modifying discrete clock synchronization algorithms. The CTEC, working as an added component of discrete clock synchronization, moves timing constraints out of discontinuous time intervals. In doing so, it makes use of a mapping derived from continuous clock synchronization in order to exploit its continuity property. We formally prove the correctness of CTEC by showing that the CTEC with discrete clock synchronization generates the same task schedule as continuous clock synchronization. In order to show the effectiveness of CTEC, we have implemented it on a distributed platform based on the CAN bus and performed extensive experiments. The experimental results indicate that time discontinuities present a consistency problem to real-world systems. They also show that CTEC is an effective solution to the problem while incurring little run-tine overhead.
Election in Asynchronous Complete Networks with Intermittent Link Failures
Authors: H. Abu-Amara, J. Lokre
Venue: IEEE Transactions on Computers (1994)

Considers the problem of fault-tolerant leader election in asynchronous complete (fully-connected) distributed networks. The processors are reliable, but some of the communication channels may fail intermittently before or during the execution of the algorithm. Channel failures are undetectable due to the asynchronous nature of the network. Let n be the number of processors in the network and f be the maximum number of faulty channels incident on each processor, where f/spl les/ 1/2 [n-1]. Our algorithm uses at most O(n/sup 2/+nf/sup 2/) messages to elect a unique leader of the network. Each message consists of at most O(log|T|) bits, where |T| is the cardinality of the set of processor identifiers. All previous algorithms either tolerated only benign failures such as fail-stop failures, assumed that the network is synchronous, tolerated only a small number of failures, or assumed that the faults are detectable. Our algorithm is the first election algorithm that is designed specifically for asynchronous intermittently faulty complete networks in which up to 1/4 n[n-1] channels may be faulty, where each processor is adjacent to no more than 1/2 [n-1] faulty channels, and where the faults are undetectable.
Smart wavelet image coding: X-tree approach
Authors: Canhui Cai, Sanjit K. Mitra, Runtao Ding
Venue: Signal Processing (2002)

This paper presents a novel scheme of wavelet image coding, called X-tree coding. An X-tree is defined as a spatial hierarchical tree whose all descendants are insignificant, and it is used to denote 2-D clustered insignificant wavelet coefficients of an image. Two new coding schemes, the progressive X-tree approach and the stack X-tree approach, which are the X-tree versions of the embedded zerotree wavelet (EZW) algorithm and the stack-run coding algorithm, respectively, are proposed. Experimental results have shown that the performances of the proposed algorithms are better than those of the stack-run and the EZW algorithms, and are highly comparable to that of the set partitioning in hierarchical trees algorithm.
Efficient Processor Assignment Algorithms and Loop Transformations for Executing Nested Parallel Loops on Multiprocessors
Authors: C. M. Wang, S. D. Wang
Venue: IEEE Transactions on Parallel and Distributed Systems (1992)

An important issue for the efficient use of multiprocessor systems is the assignment of parallel processors to nested parallel loops. It is desirable for a processor assignment algorithm to be fast and always generate an optimal processor assignment. The paper proposes two efficient algorithms to decide the optimal number of processors assigned to each individual loop. Efficient parallel counterparts of these two algorithms are also presented. These algorithms not only always generate an optimal processor assignment, but also are much faster than the exiting optimal algorithm in the literature. The paper discusses improving the performance of parallel execution by transforming a nested parallel loop into a semantically equivalent one. Three loop transformations are investigated. It is observed that, in most cases, the parallel execution time is improved after applying these transformations.
Enhancing conversational flexibility in multimodal interactions with embodied lifelike agent
Authors: Kyoshi Mori, Adam Jatowt, Mitsuru Ishizuka
Venue: Proceedings of the 8th international conference on Intelligent user interfaces (2003)

Research carried out in authoring systems for embodied agent based presentations have traditionally been confined to scripted interactive presentations. In recent years, however, there has been a gradual shift to adopting a more dynamic approach that supports a higher degree of flexibility in user-agent interactivity, where the user is allowed to engage in more natural conversations with the agent. In this paper, we will describe a conversational module based on techniques used in chat-bots, that we have implemented as an extension to our previously developed agent authoring system
Tangible bits: designing the seamless interface between people, bits, and atoms
Authors: Hiroshi Ishii
Venue: Proceedings of the 8th international conference on Intelligent user interfaces (2003)

Where the sea meets the land, life has blossomed into a myriad of unique forms in the turbulence of water, sand, and wind. At another seashore between the land of atoms and the sea of bits, we are now acing the challenge of reconciling our dual citizenships in the physical and digital worlds. Windows to the digital world are confined to flat square screens and pixels, or "painted bits." Unfortunately, one cannot feel and confirm the virtual existence of this digital information through one's body. Tangible Bits, our vision of Human Computer Interaction (HCI), seeks to realize seamless interfaces between humans, digital information, and the physical environment by giving physical form to digital information, making bits directly manipulable and perceptible. The goal is to blur the boundary between our bodies and cyberspace and to turn the architectural space into an interface between the people, bits, and atoms. In this talk, I will present a variety of tangible user interfaces the Tangible Media Group has designed and presented within the CHI, SIGGRAPH, UIST, CSCW, IDSA, ICSID, ICC, and Ars Electronica communitiesHiroshi Ishii is a tenured Associate Professor of Media Arts and Sciences, at the MIT Media Lab. His research focuses upon the design of seamless interfaces between humans, digital information, and the physical environment.At the MIT Media Lab, he founded and directs the Tangible Media Group pursuing a new vision of Human Computer Interaction (HCI): "Tangible Bits." His team seeks to change the "painted bits" of GUIs to "tangible bits" by giving physical form to digital information. He also co-directs Things That Think (TTT) Consortium at the MIT Media Lab.Ishii and his students have presented their vision of "Tangible Bits" at a variety of academic, industrial design, and artistic venues (including ACM SIGCHI, ACM SIGGRAPH, Industrial Design Society of America, and Ars Electronica), emphasizing that the development of tangible interfaces requires the rigor of both scientific and artistic review. A display of many of the groups projects took place at the NTT InterCommunication Center (ICC) in Tokyo in summer 2000. A new, two-year-long exhibition "Get in Touch" that features the Tangible Media group's work opened at Ars Electronica Center (Linz, Austria) in September 2001Prior to MIT, from 1988-1994, he led a CSCW research group at the NTT Human Interface Laboratories, where his team invented TeamWorkStation and ClearBoard. In 1993 and 1994, he was a visiting assistant professor at the University of Toronto, Canada. He received B. E. degree in electronic engineering, M. E. and Ph. D. degrees in computer engineering from Hokkaido University, Japan, in 1978, 1980 and 1992, respectively.Home page for Hiroshi Ishii: <http://web.media.mit.edu/~ishii/>.
Ordering and Path Constraints over Semistructured Data
Authors: Elisa Bertino, Ahmed K. Elmagarmid, Mohand-Saïd Hacid
Venue: Journal of Intelligent Information Systems (2003)

Constraints are a valuable tool for managing information. Feature constraints have been used for describing records in constraint programming (A&iuml;t-Kaci and Podelski, 1993&semi; Smolka and Treinen, 1994) and record like structures in computational linguistics (Kaplan and Bresnan, 1982&semi; Shieber, 1986). In this paper, we consider how constraint-based technology can be used to query and reason about semistructured data. The constraint system FT&le; (M&uuml;ller et al., 1997) provides information ordering constraints interpreted over feature trees. Here, we show how a generalization of FT&le; combined with path constraints can be used to formally represent, state constraints, and reason about semistructured data. The constraint languages we propose provide possibilities to straightforwardly capture, for example, what it means for a tree to be a subtree or subsumed by another, or what it means for two paths to be divergent. We establish a logical semantics for our constraints thanks to axiom schemes presenting our first-order theory constraint system. We propose using the constraint systems for querying semistructured data.
Concurrent Engineering for Real-Time Systems
Authors: Petri J. Pulli, Marko P. Heikkinen
Venue: IEEE Software (1993)

The Incremental Prototyping Technology for Embedded Real-Time Systems (Iptes) project, which is part of ESPRIT II, is described. The goal of the project is to develop methodologies and tools for the distributed prototyping of real-time systems. The work concentrates on two areas of support for concurrent engineering: adapting graphical-animation techniques to real-time-system development and creating a mechanism for propagating changes within and between tasks.
A learning support system for beginners in pencil drawing
Authors: Saeko Takagi, Noriyuki Matsuda, Masato Soga, Hirokazu Taki, Takashi Shima, Fujiichi Yoshimoto
Venue: Proceedings of the 1st international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2003)

A picture is one of important research subjects to make our life spiritually rich. Most studies on pictures, however, only propose some substitute functions of actual drawing or painting materials. There is no system that evaluates pictures drawn by users and gives advice about them. We propose a learning support system of beginner's pencil drawing that is the basis of pictures. Our system receives a motif data set and a user's sketch image, and returns advice to the user. The processing is composed of the four functions: feature extraction of motifs, feature extraction of sketches, error identification, and generation and presentation of advice. We developed and experimented a prototype system limited to treat a basic motif and principal advice. As a result, the validity of the proposed system was confirmed.
Redesigning Air Traffic Control: An Exercise in Software Design
Authors: Daniel Jackson, John Chapin
Venue: IEEE Software (2000)

In the Fall of 1998, these authors redesigned a component of CTAS, an air traffic control system developed by NASA and now deployed in several US airports. This case study demonstrates how basic software engineering techniques can make a complex system dramatically simpler. The authors describe lessons learned from reverse-engineering an air traffic control system with a variety of tools and redesigning it to be smaller, simpler, and more flexible.
Happy Birthday, HAL!
Authors: David G. Stork
Venue: Computer (1997)

"I am a HAL 9000 computer, production number 3. I became operational at the HAL plant in Urbana, Illinois, on January 12, 1997."ý2001: A Space Odyssey
On the Individuality of Fingerprints
Authors: Sharath Pankanti, Salil Prabhakar, Anil K. Jain
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2002)

Fingerprint identification is based on two basic premises: 1) persistence: the basic characteristics of fingerprints do not change with time and 2) individuality: the fingerprint is unique to an individual. The validity of the first premise has been established by the anatomy and morphogenesis of friction ridge skin. While the second premise has been generally accepted to be true based on empirical results, the underlying scientific basis of fingerprint individuality has not been formally established. As a result, the validity of fingerprint evidence is now being challenged in several court cases. A scientific basis for establishing fingerprint individuality will not only result in the admissibility of fingerprint identification in the courts of law, but will also establish an upper bound on the performance of an automatic fingerprint verification system. We address the problem of fingerprint individuality by quantifying the amount of information available in minutiae features to establish a correspondence between two fingerprint images. We derive an expression which estimates the probability of a false correspondence between minutiae-based representations from two arbitrary fingerprints belonging to different fingers. For example, the probability that a fingerprint with 36 minutiae points will share 12 minutiae points with another arbitrarily chosen fingerprint with 36 minutiae points is 6.10\times 10^{-8}. These probability estimates are compared with typical fingerprint matcher accuracy results. Our results show that 1) contrary to the popular belief, fingerprint matching is not infallible and leads to some false associations, 2) while there is an overwhelming amount of discriminatory information present in the fingerprints, the strength of the evidence degrades drastically with noise in the sensed fingerprint images, 3) the performance of the state-of-the-art automatic fingerprint matchers is not even close to the theoretical limit, and 4) because automatic fingerprint verification systems based on minutia use only a part of the discriminatory information present in the fingerprints, it may be desirable to explore additional complementary representations of fingerprints for automatic matching.
Binary Rule Generation via Hamming Clustering
Authors: Marco Muselli, Diego Liberati
Venue: IEEE Transactions on Knowledge and Data Engineering (2002)

The generation of a set of rules underlying a classification problem is performed by applying a new algorithm called Hamming Clustering (HC). It reconstructs the and-or expression associated with any Boolean function from a training set of samples. The basic kernel of the method is the generation of clusters of input patterns that belong to the same class and are close to each other according to the Hamming distance. Inputs which do not influence the final output are identified, thus automatically reducing the complexity of the final set of rules. The performance of HC has been evaluated through a variety of artificial and real-world benchmarks. In particular, its application in the diagnosis of breast cancer has led to the derivation of a reduced set of rules solving the associated classification problem.