ppxscal/embedding_network huggingface dataset:
A semantic network dictionary for dysphasia therapy
Authors: János Bácsi
Venue: Acta Cybernetica (2004)

With the use of computer-assisted teaching and learning programs the speech therapy of children with dysphasia can be planned more effectively, than with the traditional, so-called prompted-image method employed by logopaedists. Our aim is the creation of a semantic network dictionary - on the basis of a huge quantity empirical database -, which predicts what other concepts will link to a concept in the STM of 4--7 year old children, i.e. what other concepts can the most easily be associated with an already existing one by the therapeut. Furthermore, the semantic network dictionary will enable the already literate child - on the basis of the idea of András Kocsor - to take a virtual tour through the connected words of the network dictionary by merely saying words into a microphone. Hence the software will help children develop and maintain semantic structures.
Workflow analysis for web publishing using a stage-activity process model
Authors: Jiannong Cao, Catherine Chan, Keith Chan
Venue: Journal of Systems and Software (2005)

Web publishing has been the core business of ICP (Internet Content Provider) companies. It is also a major functional component in other Internet industry sectors. However, although there have been on-going developments in this area, up to our knowledge, very little work has been done on web publishing process models and methodologies. In this paper we describe a general process model for web publishing based on workflow analysis. Using a case study approach, the existing web publishing methods used by major Hong Kong ICP companies have been evaluated. Based on the evaluation results and our observations, the issues and problems of the existing methods are identified. A general process model, called the stage-activity model, is proposed which facilitates the development of a framework for automating the web publishing process with the incorporation of workflow management. The results of this research contribute to a clear understanding of what challenges ICPs are currently facing and a solution for building an automating web publishing system. The framework can also be used to evaluate and select the web publishing tools in the market.
University of Colorado dialog systems for travel and navigation
Authors: B. Pellom, W. Ward, J. Hansen, R. Cole, K. Hacioglu, J. Zhang, X. Yu, S. Pradhan
Venue: Proceedings of the first international conference on Human language technology research (2001)

This paper presents recent improvements in the development of the University of Colorado "CU Communicator" and "CU-Move" spoken dialog systems. First, we describe the CU Communicator system that integrates speech recognition, synthesis and natural language understanding technologies using the DARPA Hub Architecture. Users are able to converse with an automated travel agent over the phone to retrieve up-to-date travel information such as flight schedules, pricing, along with hotel and rental car availability. The CU Communicator has been under development since April of 1999 and represents our test-bed system for developing robust human-computer interactions where reusability and dialogue system portability serve as two main goals of our work. Next, we describe our more recent work on the CU Move dialog system for in-vehicle route planning and guidance. This work is in joint collaboration with HRL and is sponsored as part of the DARPA Communicator program. Specifically, we will provide an overview of the task, describe the data collection environment for in-vehicle systems development, and describe our initial dialog system constructed for route planning.
A security assessment of the minos architecture
Authors: Jedidiah R. Crandall, Frederic T. Chong
Venue: ACM SIGARCH Computer Architecture News (2005)

Minos is a microarchitecture that implements Biba's low-water-mark integrity policy on individual words of data. Months of testing have revealed a robust system that stops attacks which corrupt control data to hijack program control flow. The low-water-mark policy is orthogonal to the memory model so that it works with existing software and middleware. The key is that Minos tracks the integrity of all data, but protects control flow by checking this integrity when a program uses the data for control transfer. Existing policies, in contrast, need to differentiate between control and non-control data a priori.Our implementation of Minos for Red Hat Linux 6.2 on a Pentium-based emulator is a usable Linux system on the network. We have demonstrated that Minos protects against a menagerie of real control data attacks, not just buffer overflows. This paper will detail our security assessments of Minos and other hardware and software mechanisms designed to stop the same class of attacks. We conclude that while Minos is substantially more secure than other approaches, existing C programs lack the semantic information necessary to totally secure their control flow. More details about the implementation of Minos are available in [1].
HCI Design and Interactive Sonification for Fingers and Ears
Authors: Mikael Fernstrom, Eoin Brazil, Liam Bannon
Venue: IEEE MultiMedia (2005)

We examine the use of auditory display for ubiquitous computing to extend the boundaries of human-computer interaction (HCI). Our design process is based on listening tests, gathering free text identification responses from participants. The responses and their classifications indicate how accurately sounds are identified and help us identify possible metaphors and mappings of sound to human action and/or system status.
COCOA: compressed continuity analysis for temporal databases
Authors: Kuo-Yu Huang, Chia-Hui Chang, Kuo-Zui Lin
Venue: Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases (2004)

A continuity is a kind of inter-transaction association which describes the relationships among different transactions. Since it breaks the boundaries of transactions, the number of potential itemsets and the number of rules will increase drastically. In this paper we consider the problem of discovering frequent compressed continuity patterns, which have the same power as mining the complete set of frequent continuity patterns. We devised a three-phase algorithm, COCOA, for frequent compressed continuity mining.
Optimization and Control of Communication Networks
Authors: Mung Chiang, Steven Low
Venue: Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2005)

Recently, there has been a surge in research activities that utilize the power of recent developments in nonlinear optimization to tackle a wide scope of work in the analysis and design of communication systems, touching every layer of the layered network architecture, and resulting in both intellectual and practical impacts significantly beyond the earlier frameworks. These research activities are driven by both new demands in the areas of communications and networking, and new tools emerging from optimization theory. Such tools include new developments of powerful theories and highly efficient computational algorithms for nonlinear convex optimization, as well as global solution methods and relaxation techniques for nonconvex optimization.Optimization theory can be used to analyze, interpret, or design a communication system, for both forward-engineering and reverse-engineering. Over the last few years, it has been successfully applied to a wide range of communication systems, from the high speed Internet core to wireless networks, from coding and equalization to broadband access, and from information theory to network topology models. Some of the theoretical advances have also been put into practice and started making visible impacts, including new versions of TCP congestion control, power control and scheduling algorithms in wireless networks, and spectrum management in DSL broadband access networks.Under the theme of optimization and control of communication networks, this Hot Topic Session consists of five invited talks covering a wide range of issues, including protocols, pricing, resource allocation, cross layer design, traffic engineering in the Internet, optical transport networks, and wireless networks.
The impact of x86 instruction set architecture on superscalar processing
Authors: Rafael Rico, Juan-Ignacio Pérez, José Antonio Frutos
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2005)

Performance improvement of x86 processors is a relevant matter. From the point of view of superscalar processing, it is necessary to complement the studies on instruction use with analogous ones on data use and, furthermore, analyze the data flow graphs, as its dependencies are responsible for limitations on ILP. In this work, using instruction traces from common applications, quantitative analyses of implicit operands, memory addressing and condition codes have been performed, three sources of significant limitations on the maximum achievable parallelism in the x86 architecture. In order to get a deeper knowledge of these limitations, the data dependence graphs are built from traces. By means of graph matrix representation, potentially exploitable parallelism is quantified and parallelism distributions from the traces are shown. The method has also been applied to measure the impact of the use of condition codes. Results are compared with previous work and some conclusions are presented relating the obtained degree of parallelism with negative characteristics of x86 instruction set architecture.
A Novel FGS Base-Layer Encoding Model and Weight-Based Rate Adaptation for Constant-Quality Streaming
Authors: Jun Sun, Wen Gao, Qingming Huang
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

We examine the coding problem of base layer (BL) in fine granularity scalable videos and rate adaptation of enhancement layer (EL) during streaming in order to support constant quality streaming. The problem arises from the facts that different frames of BL often exhibit significant quality variation in the usual FGS BL encoding methods, and consequently the actual EL Rate-Distortion (R-D) curves of different frames present significant difference. Under this condition it would be computationally exhaustive to scale the EL to flatten out the fluctuating BL quality and to attain constant quality. We propose, in this paper, an accurate constant quality encoding method of BL, under which we investigate the similarity of actual EL R-D curves, and then a simple but effective weight-based EL rate allocation algorithm is introduced. Experiments show, compared with default methods, our fast and simple methods not only provide constant-quality streaming, but also decrease the average MSE of videos.
Concurrent common knowledge: defining agreement for asynchronous systems
Authors: Prakash Panangaden, Kim Taylor
Venue: Distributed Computing (1992)

In this paper we present a new, knowledge-theoretic definition of agreement designed for asynchronous systems. In analogy with common knowledge, it is called concurrent common knowledge. Unlike common knowledge, it is a form of agreement that is attainable asynchronously. In defining concurrent common knowledge, we give a logic with new modal operators and a formal semantics, both of which are based on causality and consequently capture only the relevant structure of purely asynchronous systems. We give general conditions by which protocols attain concurrent common knowledge and prove that two simple and efficient protocols do so. We also present several applications of our logic. We show that concurrent common knowledge is a necessary and sufficient condition for the concurrent performance of distributed actions. We also demonstrate the role of knowledge in taking snapshots for stable property detection and asynchronous broadcasts. In general, applications that involve all processes reaching agreement about some porperty of a consistent global state can be understood in terms of concurrent common knowledge.
Mac OS X Help Desk Essentials (Apple Training)
Venue:  (2005)

The only Apple-certified book on Mac OS X, this updated best-seller will take you deep inside the latest big-cat operating system, covering everything from networking technologies to system administration, customizing the operating system, command-line programming, and more. Whether you're a support technician or simply an ardent Mac user, you'll quickly learn and master the 150+ features new to Mac OS X Tiger, including the innovative Spotlight search system, a Dashboard filled with customizable Widget mini-apps, the Automator application for building customized workflows, and more. Following the learning objectives of the Apple Certified Technical Coordinator certification exam, this self-paced book is a perfect supplement to Apple's own training class and a first-rate primer for computer support personnel who need to troubleshoot and optimize Mac OS X as part of their jobs. Chapter review sections and quizzes summarize and reinforce gained knowledge.
Isomorphism Classes of Picard Curves over Finite Fields
Authors: Jong Won Lee
Venue: Applicable Algebra in Engineering, Communication and Computing (2005)

In this paper we count the number of isomorphism classes of pointed Picard curves, i.e., nonsingular plane curves y3=f(x) of genus 3 with the fixed point at infinity, over finite fields of characteristic different from 3. In the process of doing this we also provide reduced forms of Picard curves that represent the isomorphism classes together with the number of such forms up to isomorphism. In addition to its own theoretical meaning, it has applications to cryptography.
Study of Traffic Engineering Capabilities of MPLS Networks
Authors: Mansoor Alam, Praveen Bethoju, Min Song
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

This poster presents the Traffic Engineering (TE) capabilities of Multiprotocol Label Switching (MPLS) networks. The study is carried on Pentium PCs running Linux and using open software. Results show that it is necessary to examine the flows in a MPLS network before setting up paths from a TE point of view. The study also suggests that proper planning with respect to mapping similar traffic types onto the same label switched path will give a better performance.
Efficient comparison of platform alternatives in interactive virtual reality applications
Authors: Pablo Figueroa, Walter F. Bischof, Pierre Boulanger, H. James Hoover
Venue: International Journal of Human-Computer Studies (2005)

Virtual reality applications consist of an integrated combination of elements, such as hardware devices, interaction techniques, and content, in different modalities and qualities. Designers of virtual reality applications select combinations of such elements that allow users to accomplish their tasks, and it is feasible that more than one combination of such values will satisfy the user's needs. Unfortunately, current development environments, methodologies, and techniques in the field of virtual reality often preclude the exploration of the design alternatives, due to coverage or cost limitations. A limited number of options are covered by any given software development environment, and the development cost of new prototypes in such development platforms is too high to be considered as an evaluation tool. In this paper, we present a methodology for partial (i.e. hardware and interaction techniques alternatives) exploration of the design space of a virtual reality application, based on the creation of reusable components and a standard evaluation of alternatives. Since the cost of developing several versions of an application can be reduced by reusing elements from others, this method allows designers to evaluate the performance and user preferences of several implementations. As a proof of concept, we developed four versions of a simple matching application in different virtual reality platforms. Results of this study show how users react to each prototype and how the different solutions can be compared, no matter how different in technology they are.
Solving layered queueing networks of large client-server systems with symmetric replication
Authors: Tariq Omari, Greg Franks, Murray Woodside, Amy Pan
Venue: Proceedings of the 5th international workshop on Software and performance (2005)

Large distributed client-server systems often contain subsystems which are either identical to each other, or very nearly so, and this simplifies the system description for planning purposes. These replicated components and subsystems all have the same workload and performance parameters. It is known how to exploit this symmetry to simplify the solution of some kinds of performance models, using state aggregation in Markov Chains. This work considers the same problem for layered queueing models, using mean value analysis. The mean values are found for each group of replicas just once, and then are inserted appropriately into the solution of the system as a whole. An algorithm has been implemented in the Layered Queueing Network Solver (LQNS), including approximations to deal with interactions among the replicas, and is evaluated for accuracy and for efficiency. The resulting solver is insensitive (in time of solution) to the number of replicas in a group, and can efficiently calculate waiting times and throughputs for systems with tens of thousands of nodes and processes.
Extending UML for Model Composition
Authors: Jacky Estublier, Anca Daniela Ionita
Venue: Proceedings of the 2005 Australian conference on Software Engineering (2005)

The success of UML and more generally, of the model driven approach, has led to a proliferation of models, representing various systems, but the description of large applications may actually be composed of several system models. Therefore, the challenge is to determine how to compose independent system models, in order to build large applications. We present in this paper the software federation approach developed by our team. A federation relies on the concept of a domain, which describes a specific application domain, represented with a specific meta-model. Building a software federation means composing independently developed domains, by composing their meta-models. The UML standard, which is well supported by tools, has been found convenient for describing our meta-models, but it turns out that it does not contain sufficient modelling capabilities for the composition of these models. This paper analyses the need for model composition, the available UML concepts related to model composition and proposes an UML profile allowing the composition of models in software federations.
Randomized instruction set emulation
Authors: Elena Gabriela Barrantes, David H. Ackley, Stephanie Forrest, Darko Stefanović
Venue: ACM Transactions on Information and System Security (TISSEC) (2005)

Injecting binary code into a running program is a common form of attack. Most defenses employ a &ldquo;guard the doors&rdquo; approach, blocking known mechanisms of code injection. Randomized instruction set emulation (RISE) is a complementary method of defense, one that performs a hidden randomization of an application's machine code. If foreign binary code is injected into a program running under RISE, it will not be executable because it will not know the proper randomization. The paper describes and analyzes RISE, describing a proof-of-concept implementation built on the open-source Valgrind IA32-to-IA32 translator. The prototype effectively disrupts binary code injection attacks, without requiring recompilation, linking, or access to application source code. Under RISE, injected code (attacks) essentially executes random code sequences. Empirical studies and a theoretical model are reported which treat the effects of executing random code on two different architectures (IA32 and PowerPC). The paper discusses possible extensions and applications of the RISE technique in other contexts.
The geometry of carpentry and joinery
Authors: Pat Morin, Jason Morrison
Venue: Discrete Applied Mathematics (2004)

In this paper, we propose to model a simplified wood shop. Following the work of Demaine et al. (Comput. Geom.: Theory Appl. 20 (1-2) (2002) 69) we limit the cutting tools of our carpenter to a circular saw. We extend that previous work to include a model of basic rules of carpentry and joinery. This model is then applied to the problem of building a polygon P by joining together strips of wood and cutting them with a circular saw. We describe a linear time algorithm to decide if a blueprint can be constructed in such a workshop.
Face Exemplars Selection from Video Streams for Online Learning
Authors: M. Castrillon-Santana, O. Deniz-Suarez, J. Lorenzo-Navarro, M. Hernandez-Tejera
Venue: Proceedings of the 2nd Canadian conference on Computer and Robot Vision (2005)

This paper tackles the problem of online acquisition of exemplars for dynamic updating of classifiers for facial analysis. Most facial analysis systems apply a previously computed classifier to a set of images, or recently to the output of real-time face detection systems. Here we describe an approach to select significant detected faces during interactive sessions in order to learn and modify online, with the initial help of an expert, a classifier for a given task. Preliminary experiments are reported related to gender recognition.
High-Performance Direct Pairwise Comparison of Large Genomic Sequences
Authors: Christopher Mueller, Mehmet Dalkilic, Andrew Lumsdaine
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 7 - Volume 08 (2005)

Many applications in Comparative Genomics lend themselves to implementations that take advantage of common high-performance features in modern microprocessors. However, the common suggestion that a dataparallel, multithreaded, or high-throughput implementation is possible often ignores the complexity of actually creating such software. In this paper, we present a dataparallel algorithm for a classic comparative genomics algorithm, the dot plot, along with a multiprocessor extension. For large genomic comparisons, these new algorithms achieve speedups of up to 14.4x over the sequential version. This speedup introduces the opportunity of performing full pairwise comparisons on entire genomes on a much larger scale than previously possible. We also present the experimental, model-driven approach used to develop the algorithm that allowed us to carefully study and evaluate implementation options and fully understand the parameters effecting its performance.
Managing service level agreements in premium IP networks: a business-oriented approach
Authors: S. D'Antonio, M. D'Arienzo, M. Esposito, S. P. Romano, G. Ventre
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2004)

This paper presents a market-enabling framework where users, content providers and network operators can interact in the seamless, transparent sale and delivery of a wide range of services. The framework allows for dynamic creation, configuration and delivery of services with quality assurance, via automated management of Service Level Agreements (SLAs). We propose an approach relying on a systemic treatment of business, service and network layer issues, which translates into a layered architecture where components belonging to different levels interact on the basis of a mediation paradigm. We use mediation as a generic term for a combination of negotiation, brokerage and state notification, jointly concurring to the realization of the entire life-cycle of a service.