ppxscal/embedding_network huggingface dataset:
Ubiquitous information services with JAIN platform
Authors: Tak-Goa Tsuei, Chih-Yang Sung
Venue: Mobile Networks and Applications (2003)

To provide responsive information services in a ubiquitous computing environment, service software and system development are indispensable. A component-based ubiquitous information system with a JAIN (Java APIs for Integrated Networks) platform to achieve seamless transmissions and reach-everywhere communications was designed in our research. In this development, numerous ubiquitous service modules were identified: location management, roaming, mobile IP and WAP networking. These component-based network modules were constructed using a component composition language with component specification and interface definition, running on top of a distributed service architecture using a JAIN platform to distribute the ubiquitous information services to mobile users. Two applications, Wireless-Application-Protocol (WAP) Mail and Video-on-Demand (VoD) services, show that the JAIN-like platform with the developed networking components effectively fills the gap for application developers between mobile appliances and various kinds of ubiquitous information services.
Bootstrapping for hierarchical document classification
Authors: Giordano Adami, Paolo Avesani, Diego Sona
Venue: Proceedings of the twelfth international conference on Information and knowledge management (2003)

Managing the hierarchical organization of data is starting to play a key role in the knowledge management community due to the great amount of human resources needed to create and maintain these organized repositories of information. Machine learning community has in part addressed this problem by developing hierarchical supervised classifiers that help maintainers to categorize new resources within given hierarchies. Although such learning models succeed in exploiting relational knowledge, they are highly demanding in terms of labeled examples, because the number of categories is related to the dimension of the corresponding hierarchy. Hence, the creation of new directories or the modification of existing ones require strong investments.This paper proposes a semi-automatic process (interleaved with human suggestions) whose aim is to minimize (simplify) the work required to the administrators when creating, modifying, and maintaining directories. Within this process, bootstrapping a taxonomy with examples represents a critical factor for the effective exploitation of any supervised learning model. For this reason we propose a method for the bootstrapping process that makes a first hypothesis of categorization for a set of unlabeled documents, with respect to a given empty hierarchy of concepts. Based on a revision of Self-Organizing Maps, namely TaxSOM, the proposed model performs an unsupervised classification, exploiting the a-priori knowledge encoded in a taxonomy structure both at the terminological and topological level. The ultimate goal of TaxSOM is to create the premise for successfully training a supervised classifier.
The toric Hilbert scheme of a rank two lattice is smooth and irreducible
Authors: Diane Maclagan, Rekha R. Thomas
Venue: Journal of Combinatorial Theory Series A (2003)

The toric Hilbert scheme of a lattice L ⊆Zn is the multigraded Hilbert scheme parameterizing all homogeneous ideals I in S = k[x1,...,xn] such that the Hilbert function of the quotient S/I has value one for every g in the grading monoid G+ = Nn/ L. In this paper we show that if L is two-dimensional, then the toric Hilbert scheme of L is smooth and irreducible. This result is false for lattices of dimension three and higher as the toric Hilbert scheme of a rank three lattice can be reducible.
Parallelisation of the particle filtering technique and application to Doppler-bearing tracking of maneuvering sources
Authors: V. Teulière, Olivier Brun
Venue: Parallel Computing (2003)

Particle filtering may cope with non-linear and/or non-Gaussian models. As a counterpart, this technique suffers from an heavy computation cost and cannot always satisfy the real time constraints of applications. A data parallel algorithm is proposed to achieve real-time particle filtering. Extensive results are presented in the passive SONAR tracking context for maneuvering targets.
Decoupling policy from mechanism in Internet routing
Authors: Alex C. Snoeren, Barath Raghavan
Venue: ACM SIGCOMM Computer Communication Review (2004)

Routing is a black art in today's Internet. End users and ISPs alike have little control over how their packets are handled outside of their networks, stemming in part from limitations of the current wide-area routing protocol, BGP. We believe that many of these constraints are due to policy-based restrictions on route-exportation. Separating forwarding policy from route discovery would allow users to select among the possibly many inter-AS paths available to them and enable ISPs to more effectively manage the end-to-end behavior of their customers' traffic.As a concrete mechanism for enforcing forwarding policy, we purpose the concept of a network capability that binds together a path request, an accountable resource principal, and an authorizing agent. Network capabilities are central to Platypus, a loose source routing protocol we are designing, which composes network capabilities authorized by multiple ISPs to construct alternative inter-AS routes that can be independently validated and accounted for on the fly.
On the unknotting number of minimal diagrams
Authors: A. Stoimenow
Venue: Mathematics of Computation (2003)

Answering negatively a question of Bleiler, we give examples of knots where the difference between minimal and maximal unknotting number of minimal crossing number diagrams grows beyond any extent.
Facilitating Fuzzy Association Rules Mining by Using Multi-Objective Genetic Algorithms for Automated Clustering
Authors: Mehmet Kaya, Reda Alhajj
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

In this paper, we propose an automated clustering methodbased on multi-objective genetic algorithms (GA); the aim ofthis method is to automatically cluster values of a givenquantitative attribute to obtain large number of largeitemsets in low duration (time). We compare the proposedmulti-objective GA-based approach with CURE-basedapproach. In addition to the autonomous specification offuzzy sets, experimental results showed that the proposedautomated clustering exhibits good performance overCURE-based approach in terms of runtime as well as thenumber of large itemsets and interesting association rules.
TROJAN: A Scalable Distributed Semantic Network System
Authors: Chain-Wu Lee, Chun-Hsi Huang, Sanguthevar Rajasekaran
Venue: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (2003)

This paper describes a new parallel semantic network system, the TROJAN. Unlike the synchronous and static marker passing algorithm previously used for parallel semantic network design, the TROJAN operates asynchronously, supporting knowledge sharing, dynamic loadbalancing and duplicate checking. Current implementation of the TROJAN focuses on path-based knowledge inferences, using ANSI C and the MPICH-G2 with flex lexical analyzer and the yacc parser generator. The performance tests have been carried out on a local Grid,consisting of three heterogeneous systems: a SUN Cluster, an SGI Origin 3800, and a Dell Pentium Cluster. The experiments demonstrate promising speedups.
High-Performance Power Grids For Nanometer Technologies
Authors: Sachin S. Sapatnekar
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

With shrinking noise margins and increasing numbersof on-chip noise sources, power grid design has become a critical performance determinant. This paper presents an overview of recent techniques for the analysis and optimization of supply networks, and discussesfuture trends in power grid design.
A translation machine with automated top-down parsing
Authors: Harold W. Lawson, David R. Doucette
Venue: ACM SIGPLAN Notices (1976)

The top-down method of parsing programming languages has been widely used in commercially available compilers. Suprisingly, techniques for automating syntax-directed, top-down parsing have not been <u>widely</u> available. This paper describes a practical top-down parsing method which is a part of a general purpose <u>translation machine</u> automaton. The syntactical description capabilities provide for the convenient and efficient specification of linguistic constructs which are difficult or lengthy to specify in BNF metalanguage. The translation machine, which provides for semantic as well as syntactic operations, has been designed for implementation in hardware, microcode, or software. The translation machine can be utilized for convenient and efficient construction of a wide variety of programs that perform source string to object string transformations.
Application-directed voltage scaling
Authors: Johan Pouwelse, Koen Langendoen, Henk J. Sips
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2003)

Clock (and voltage) scheduling is an important technique to reduce the energy consumption of processors that support voltage scaling. It is difficult, however, to achieve good results using only statistics from the operating system level when applications show bursty (unpredictable) behavior. We take the approach that such applications must be made power-aware and specify their average execution time (AET) and the deadline to the scheduler controlling the clock speed and processor voltage. This paper describes our energy priority scheduling (EPS) algorithm supporting power-aware applications. EPS orders tasks according to how tight their deadlines are and how often tasks overlap. Low-priority tasks are scheduled first, since they can be easily preempted to accommodate for high-priority tasks later. The EPS algorithm does not always yield the optimal schedule, but has a low complexity. We have implemented EPS on a StrongARM-based variable-voltage platform. We conducted experiments with a modified video decoder that estimates the AET of each frame. Measurements show that application-directed voltage scaling reduces processor power consumption with 50% for the bursty video decoder without missing any frame deadlines.
Unraveling Expertise and Knowledge Creation: Towards an Instance-Based Model of Knowledge (IMoK)
Authors: Charmaine Barreto, Michael D'Eredita
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 8 - Volume 8 (2004)

In this paper, we develop a synthesis of existing cognitive models and call it the Instance-based Model of Knowledge (IMoK). IMoK was developed to better understand the knowledge creation process as it enables expertise, creativity and collective learning in an organizational setting. IMoK directly contrasts more abstract concepts like those associated with tacit knowledge and implicit learning, by providing a concrete explanation of how expertise and creativity develop and can be fostered within an organization. IMoK addresses the development of fundamental and automatic behaviors that are assumed to form the foundation of skills and expertise by applying accepted theory. IMoK additionally accounts for the development of automaticity as it relates to decision-making and the creation of new knowledge within the workplace."If organization theory finds it useful to draw upon some of the ideas that have emerged in cognitive psychology, it will be advantageous to borrow also the terminology used in discussing these ideas. Without working toward a higher level of consistency in terminology than prevails in organization theory today, it will be difficult or impossible to cumulate and assemble into a coherent structure the knowledge we are gaining from individual case studies and experiments." ([76], pg. 13).
On the complexity of price equilibria
Authors: Xiaotie Deng, Christos Papadimitriou, Shmuel Safra
Venue: Journal of Computer and System Sciences (2003)

We prove complexity, approximability, and inapproximability results for the problem of finding an exchange equilibrium in markets with indivisible (integer) goods, most notably a polynomial algorithm that approximates the market equilibrium arbitrarily close when the number of goods is bounded and the utilities linear. We also show a communication complexity lower bound in a model appropriate for markets. Our result implies that the ideal informational economy of a market with divisible goods and unique optimal allocations is unattainable in general.
Phonics for young children: a computer based approach
Authors: Linda Snape, Tony Nicol, Stuart MacFarlane
Venue: Proceedings of the 2003 conference on Interaction design and children (2003)

The National Literacy Strategy was introduced in 1990 by the British Government into UK schools advocating a combination of the whole word and phonics approaches to teaching literacy to young children [2]. Research [1] supports the importance of developing phonic awareness in young children and a need for computer applications to support this area. The logical structure of the phonics code and the need for low teacher:student ratio required to effectively teach the fundamental phonic awareness skills of blending and segmenting has led to the development of a computer based teaching system. Characteristics of user interaction will be recorded by the system in order to analyse a child's progress and automatically predict learning difficulties. The first phase of testing has been carried out within a classroom environment and work on the user profile is in progress.
Mask distortion issues for next-generation lithography
Authors: P. L. Reu, R. L. Engelstad, E. G. Lovell
Venue: Microelectronic Engineering (2003)

Identifying mask distortion issues of next-generation lithography (NGL) technologies are critical to the timely development of a successor to optical lithography at the sub-65 nm regime. This paper presents the results of finite element (FE) simulations that characterize the distortions induced during the fabrication of an electron-beam projection lithography mask. Employing a 100-mm prototype format, both global and local image placement errors were predicted with the numerical simulations. Equivalent modeling and submodeling techniques were used to provide detailed information on the distortion of individual circuit features of an SRAM device. The FE results were subsequently verified with experiments performed at the IBM/Photronics Mask Center of Competency. The data presented illustrate the benefits of modeling and simulation for design and optimization before implementation of NGL technologies.
Granularity-Driven Dynamic Predicate Slicing Algorithms for Message Passing Systems
Authors: Hon F. Li, Juergen Rilling, Dhrubajyoti Goswami
Venue: Automated Software Engineering (2004)

Program Slicing is a well-known decomposition technique that transforms a large program into a smaller one that contains only statements relevant to the computation of a selected function. In this paper, we present two novel predicate-based dynamic slicing algorithms for message passing programs. Unlike more traditional slicing criteria that focus only on parts of the program that influence a variable of interest at a specific position in the program, a predicate focuses on those parts of the program that influence the predicate. The dynamic predicate slices capture some global requirements or suspected error properties of a distributed program and computes all statements that are relevant. The presented algorithms differ from each other in their computational approaches (forward versus backward) and in the granularity of information they provide. A proof of correctness of these algorithms is provided. Through the introduction of dominant states and dominant events, critical statement executions are identified that change the value of the global predicate. Under this formulation, optimizing dynamic predicate slicing becomes a meaningful goal as well. Finally, we present how predicate slices can be applied to support comprehension tasks for analyzing and maintaining distributed programs.
Partitioning Matroids with Only Small Cocircuits
Authors: Bogdan Oporowski
Venue: Combinatorics, Probability and Computing (2002)

We show that, for every positive integer c&#x002A;, there is an integer n such that, if M is a matroid whose largest cocircuit has size c&#x002A;, then E(M) can be partitioned into two sets E1 and E2 such that every connected component of each of M&mid;E1 and M&mid;E2 has at most n elements.
Speculative Locking Protocols to Improve Performance for Distributed Database Systems
Authors: P. Krishna Reddy, Masaru Kitsuregawa
Venue: IEEE Transactions on Knowledge and Data Engineering (2004)

Abstract--In this paper, we have proposed speculative locking (SL) protocols to improve the performance of distributed database systems (DDBSs) by trading extra processing resources. In SL, a transaction releases the lock on the data object whenever it produces corresponding after-image during its execution. By accessing both before and after-images, the waiting transaction carries out speculative executions and retains one execution based on the termination (commit or abort) mode of the preceding transactions. By carrying out multiple executions for a transaction, SL increases parallelism without violating serializability criteria. Under the naive version of SL, the number of speculative executions of the transaction explodes with data contention. By exploiting the fact that a submitted transaction is more likely to commit than abort, we propose the SL variants that process transactions efficiently by significantly reducing the number of speculative executions. The simulation results indicate that even with manageable extra resources, these variants significantly improve the performance over two-phase locking in the DDBS environments where transactions spend longer time for processing and transaction-aborts occur frequently.
Wounds like flowers opening: a discussion of Hysteria for trombone and four-channel tape
Authors: Cindy Cox
Venue: Organised Sound (2003)

In this paper I discuss Hysteria, a work for trombone and four-channel tape. Abbie Conant, an internationally reco gnised trombonist, commissioned and performed Hysteria as part of her &lsquo;Wired Goddess&rsquo; project. I chose five lines of poetry from John Campion's Tongue Stones: &lsquo;matter/mater/meter/muthos&rsquo;, &lsquo;bowl of regeneration/quickener of wombs&rsquo;, &lsquo;follow the mysteries of your feet&rsquo;, &lsquo;Let dark ages be crucibles&rsquo; and &lsquo;wounds like flowers opening&rsquo;. With this text I created an implex of sonic images relating the body, fertility, menses and violence. The first line is particularly important and shapes the first two-thirds of the piece. The musical material complements the text and uses periodicity to suggest the body's heartbeat and breath. The heartbeat serves as a cantus firmus, occurring every five seconds, and pedal tones form the primary material for the trombone part and connect to the idea of breath. The punctuating gunshots occurring in the first half imply violence, and the dark red lighting suggests blood. The tape and trombone intertwine in a sonic world evoking the womb and regeneration. The four-channel tape heightens the sense of immersion that connected to the piece's resonance and dream-like atmosphere. The web of these associations constitutes an artistic reflection on the sensibility and experience of the feminine in a patriarchal society.
Impredicativity entails untypedness
Authors: Peter Lietz, Thomas Streicher
Venue: Mathematical Structures in Computer Science (2002)

In standard realizability one works with respect to an untyped universe of realizers called a partial combinatory algebra (pca). It is well known that a pca &Ascr; gives rise to a categorical model of impredicative type theory via the category Asm(&Ascr;) of assemblies over &Ascr; or the realizability topos over &Ascr;.Recently, John Longley introduced a typed version of pca's (Longley 1999b). The above mentioned construction of categorical models extends to the typed case. However, in general these are no longer impredicative. We show that for a typed pca &Tscr; the ensuing models are impredicative if and only if &Tscr; has a universal type U. Such a type U can be endowed with the structure of an untyped pca such that U and &Tscr; induce equivalent realizability models: in other words, a typed pca &Tscr; with a universal type is essentially untyped. Thus, a posteriori it turns out that nothing is lost by restricting to (untyped) pca's as far as realizability models of impredicative type theories are concerned.For instance, we show that for a typed pca &Tscr; the fibred category of discrete families in Asm(&Tscr;) is small if and only if &Tscr; has a universal type. As the category of &not;&not;-separated objects of the modified realizability topos is equivalent to Asm(&Tscr;) for an appropriate typed pca &Tscr; without a universal type, it follows that the discrete families in the subcategory of &not;&not;-separated objects of the modified realizability topos do not provide a model of polymorphic &lambda;-calculus.
A BIST Pattern Generator Design for Near-Perfect Fault Coverage
Authors: Mitrajit Chatterjee, Dhiraj K. Pradhan
Venue: IEEE Transactions on Computers (2003)

Abstract--A new design methodology for a pattern generator is proposed, formulated in the context of on-chip BIST. The design methodology is circuit-specific and uses synthesis techniques to design BIST generators. The pattern generator consists of two components: a pseudorandom pattern generator (like an LFSR or, preferably, a GLFSR) and a combinational logic to map the outputs of the pseudorandom pattern generator. This combinational logic is synthesized to produce a given set of target patterns by mapping the outputs of the pseudorandom pattern generator. It is shown that, for a particular CUT, an area-efficient combinational logic block can be designed/synthesized to achieve 100 (or almost 100) percent single stuck-at fault coverage using a small number of test patterns. This method is significantly different from weighted pattern generation and can guarantee testing of all hard-to-detect faults without expensive test point insertion. Experimental results on common benchmark netlists demonstrate that the fault coverage of the proposed pattern generator is significantly higher compared to conventional pattern generation techniques. The design technique for the logic mapper is unique and can be used effectively to improve existing pattern generators for combinational logic and scan-based BIST structures.
Neuronal Substrates for Choice Under Ambiguity, Risk, Gains, and Losses
Authors: Kip Smith, John Dickhaut, Kevin McCabe, José V. Pardo
Venue: Management Science (2002)

Economic forces shape the behavior of individuals and institutions. Forces affecting individual behavior are attitudes about payoffs (gains and losses) and beliefs about outcomes (risk and ambiguity). Under risk, the likelihoods of alternative outcomes are fully known. Under ambiguity, these likelihoods are unknown. In our experiment, payoffs and outcomes were manipulated independently during a classical choice task as brain activity was measured with positron emission tomography (PET). Here, we show that attitudes about payoffs and beliefs about the likelihood of outcomes exhibit interaction effects both behaviorally and neurally. Participants are risk averse in gains and risk-seeking in losses; they are ambiguity-seeking in neither gains nor losses. Two neural substrates for choice surfaced in the interaction between attitudes and beliefs: a dorsomedial neocortical system and a ventromedial system. This finding reveals that the brain does not honor a prevalent assumption of economics--the independence of the evaluations of payoffs and outcomes. The demonstration of a relationship between brain activity and observed economic choice attests to the feasibility of a neuroeconomic decision science.