ppxscal/embedding_network huggingface dataset:
An Approach of Information Theory to Multiple Sequence Comparison
Authors: Fang Weiwu, Roberts Fred S., Ma Zhengrong
Venue:  (1999)

Multiple sequence comparison is a basic problem for molecular biology and other sciences. In this paper, we introduce the concept of complete information set and some measurement principles for measuring multiple sequence discrepancy. Based on them, we present a new measurement method satisfying the principles for comparing multiple sequences. We show that this method can effectively distinguish different random sequences or DNA sequences, for example, distinguish DNA sequences of length 8000 by comparisons of 6-8 symbol strings or protein sequences of length 8000 by comparisons of 3-4 strings. It can also measure slight changes of a sequence, e.g., insertion or deletion of a symbol. We apply it in the study of molecular evolution; the results show that there is a hierarchic relationship among the cytochrome C protein sequences of different species, much as that in taxonomy; moreover, these results are consistent with previous studies. Key Words: multiple sequence comparison, entropy, DNA, measurement
On Parallel Integer Sorting
Authors: Sanguthevar Rajasekaran, Sandeep Sen
Venue:  (1987)

An optimal algorithm for sorting integers in the range $[1,n ^ c ]$ (for any constant $c$) is given for the EREW PRAM model where the word length is $n ^ \epsilon $, for any $\epsilon < 0$. This algorithm gives a simple proof to most of the theorems in [Kirkpatrick, Reisch 84] and also strengthens them. Using this algorithm, the best known upper bounds for integer sorting (on the $0(log n)$ wordlength PRAM models) are improved. In addition, a novel parallel range reduction algorithm which results in a near optimal randomized integer sorting algorithm is also presented. For the case when the keys are uniformly distributed in the range $[1,n ^ c ]$, we give an algorithm that is optimal on the average and in the worst case. Finally, a randomized optimal algorithm on the $(0(log n)$ wordlength) CRCW PRAM is given for the problem of MAX-GAP.
Integrating QoS to Collaborative Distributed Virtual Reality Applications
Authors: Zièd Choukair, Damien Retailleau
Venue: Proceedings of the Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2000)

Today's virtual environments are expected to be distributed to allow collaboration for common purposes. However, they must ensure a high level of Quality of Service (QoS) to the user, especially in an open context with unknown, a priori, man-in-the-loop event occurrence. This paper presents our Distributed Virtual Environment COllaboration Model (DVECOM) and its implementation, which aims to provide an end-user QoS support for, distributed virtual reality applications.The idea of DVECOM is to guarantee full consistency and soft synchronization of the virtual world distributed displays, with the least rendering degradation possible, and also to auto-adapt the rendering in accordance with the retained strategy, ensuring best effort and least suffering for virtual world rendering.This representation degradation is driven by the users' choices. The receiver-side protocol is based upon the end-user preferences, physical level capability information, as well as the pertinence of the notification to each client (contextual end-user information). When available, such guarantees would make it possible to use DVE out of a closed, oversized, very restricted context for industrial collaborative applications with an expected QoS.
New and Improved Manipulation Algorithms for MEMS Arrays and Vibratory Parts Feeders: What Programmable Vector Fields Can (and Cannot) Do --Part II
Authors: Karl F. Bohringer, Bruce R. Donald, Noel C. MacDonald
Venue:  (1995)

This paper explores how to use programmable vector fields to control flexible planar parts feeders. For a description of these devices and their actuation technology, see our companion paper, Part~I~\cite{BohringerDonaldMacDonald96b}\ifDRAFT{}\else{, also submitted to ICRA}\fi . When a part is placed on our devices, the programmed vector field induces a force and moment upon it. Over time, the part may come to rest in a dynamic equilibrium state. By chaining together sequences of vector fields, the equilibria may be cascaded to obtain a desired final state. By analyzing and constraining the equilibria of programmable vector fields, we can generate and execute plans to orient and sort parts. These plans require no sensing. This paper describes new manipulation algorithms using the tools developed in Part~I~\cite{BohringerDonaldMacDonald96b}. In particular, we improve existing planning algorithms by a quadratic factor, and the plan-length by a linear factor. Using our new and improved strategies, we show how to simultaneously orient and pose any part, without sensing, from an arbitrary initial configuration. We relax earlier dynamic and mechanical assumptions to obtain more robust and flexible strategies. Finally, we consider parts feeders that can only implement a very limited "vocabulary" of vector fields (as opposed to the pixel-wise programmability assumed above). We show how to plan and execute parts-posing and orienting strategies for these devices, but with a significant increase in planning complexity and some sacrifice in completeness guarantees. We discuss the tradeoff between mechanical complexity and planning complexity.
Real-Time Specialization Track Masters of Software Engineering (MSE) Program
Authors: Carol L. Hoover
Venue:  (1995)

There is an increasing demand for software to support real-time applications such as air traffic control, factory automation, patient monitoring systems, and video-conferencing. Software engineers who develop real-time software need to understand functional constraints such as timing, fault tolerance, and reliability that distinquish real-time from non-real-time applications. The Real-Time Specialization Track within the Masters of Software Engineering (MSE) Program at Carnegie Mellon University enables graduate software engineering students to acquire knowledge about real-time applications, to obtain an understanding of fundamental principles of real-time computing, and to gain experience in the development of real-time software. The track is flexible in that it allows students to choose their own set of track courses from a list of approved real-time courses. This report describes the track rationale and requirements with educational guidelines to help students select courses, lists the approved courses, and presents brief synopses of the approved courses. The track is based on the author''s work in developing specialization tracks for the MSE Program. The author started this work during the spring of 1993.
An Agent-Based Approach to Developing Intelligent Virtual Reality-Based Training Systems
Authors: Fuhua Lin, Chuan-Jun Su, Mitchell M. Tseng
Venue: Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence (1999)

This paper presents an agent-based approach to developing intelligent Virtual Reality-based training systems. The architecture of an intelligent Virtual Reality-based training system is modeled as five collaborative agents: training task-planning agent, simulation agent, performance evaluation agent, on-line instruction agent, and intelligent interface agent. The behavioral and knowledge models of each agent type and the mechanism of inter-agent interaction and coordination are described. A Petri Nets-based specification approach that gives the work formalism for effective modeling and implementation is elaborated. Finally, Computerized Numeric Control milling operations virtual training system is briefly introduced to show the effectiveness of this approach.
On the Convergence of Reflective Newton Methods for Large-scale Nonlinear Minimization Subject to Bounds
Authors: Thomas F. Coleman, Yuying Li
Venue:  (1992)

We consider a new algorithm, a reflective Newton method, for the problem of minimizing a smooth nonlinear function of many variables, subject to upper and/or lower bounds on some of the variables. This approach generates strictly feasible iterates by following piecewise linear paths ("reflection" paths) to generate improved iterates. The reflective Newton approach does not require identification as an "activity set." In this report we establish that the reflective Newton approach is globally and quadratically convergent. Moreover, we develop a specific example of this general reflective path approach suitable for large-scale and sparse problems.
Complementarity Problems
Authors: Stephen C. Billups, Katta G. Murty
Venue:  (1999)

This paper provides an introduction to complementarity problems, with an emphasis on applications and solution algorithms. Various forms of complementarity problems are described along with a few sample applications, which provide a sense of what types of problems can be addressed effectively with complementarity problems. The most important algorithms are presented along with a discussion of when they can be used effectively. We also provide a brief introduction to the study of matrix classes and their relation to linear complementarity problems. Finally, we provide a brief summary of current research trends.
Performance Analysis and Optimization of Asynchronous Circuits
Authors: Steven M. Burns
Venue:  (1991)

Analytical techniques are developed to determine the performance of asynchronous digital circuits. These techniques can be used to guide the designer during the synthesis of such a circuit, leading to a high-performance, efficient implementation. Optimization techniques are also developed that further improve this implementation by determining the optimal sizes of the low-level devices (CMOS transistors) that compose the circuit.
PARM: Power Aware Reconfigurable Middleware
Authors: Shivajit Mohapatra, Nalini Venkatasubramanian
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

In distributed environments, generic middleware services (e.g. caching, location management etc.) are widelyused to satisfy application needs in a cost-effective manner.Such middleware services consume system resourcessuch as storage, computation and communication and canbe sources of significant power overheads when executedon low-power devices. We present a distributed middlewareframework(PARM), that is inherently power-awareand reconfigures itself to adapt to diminishing power levelsof low-power devices. In this paper, we i) determinewhether a reconfigurable component-based middlewareframework can be utilized to achieve energy gainsin low-power devices, while preserving the semantics ofthe middleware services, ii) present and evaluate a graphtheoretic approach for dynamically determining middlewarecomponent reconfigurations and ascertaining the optimalfrequency at which the restructuring should occur,for maximal energy gains at the device. We use extensiveprofiling to chart the energy usage patterns of middlewarecomponents and applications, and use the profiled data todrive our reconfiguration decisions. Our simulation resultsdemonstrate that our framework is able to save 5%to 35% of energy depending on the nature and class ofapplications and middleware components used.
A New Framework for Secure Network Management
Authors: Farid Hatefi, Forouzan Golshani
Venue: Proceedings of the 6th International Conference on Computer Communications and Networks (1997)

We introduce a new protocol, SNMS (Secure Network Management System) with four primary goals. First, use encryption to establish a secure channel between a network manager and a network agent. Second, allow network management tasks be performed from any station on the network. Third, enable a manager to remotely add manageable objects to an agent. Finally, make a prototype along with a set of guidelines to make a transition from SNMP (Simple Network Management Protocol) to SNMS. SNMS combines features from HTTP (Hyper Text Transfer Protocol), SSL (Secure Socket Layer) security mechanism, and CGI (Common Gateway Interface) programming techniques, and deals with the entire Web client/server paradigm. Network managers can securely monitor and control the network elements from any station on the network. Compared with SNMP, which does not provide any safety measures for exchanging information between a manager and an agent, SNMS offers a high degree of security by encrypting all the traffic between the manager and an agent. SNMS applies public key and private key encryption and decryption with a mixture of digital signature and two way authentication.
Mobile radio slotted ALOHA with capture and diversity
Authors: M. Zorzi
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1 (1995)

The slotted ALOHA protocol in a mobile radio environment, in the presence of Ricean fading, twofold antenna diversity and multiple reception capability, is considered. The capture probabilities and the average throughput are computed, and the issue of stability is addressed. It is shown that diversity can improve the system performance, although only to a certain extent. Some extensions are also considered: in particular the use of a higher degree of diversity is investigated.
Minimal program covering based on the output variables
Authors: H. Ammari, A. Jaoua
Venue: Proceedings of the IEEE Symposium on Computers and Communications (ISCC'95) (1995)

This paper discusses how a program can be represented by a binary relation, R, and how to decompose the latter into a set of rectangular relations. Next, we present our methodology based on relational operators and dependence relations, to show how we can use these rectangles to obtain more interesting ones that describe the entire behavior of every variable in the program. The notion of lattice of maximal rectangles is effective in that it permits to have a particular representation of the program which shows all the different parts that constitute the original program. By looking at this lattice structure, we find that the set of the leaves of this lattice, which represent "pertinent" rectangles associated to output variables, gives a minimal program covering.
Usage-based pricing of packet data generated by a heterogeneous user population
Authors: M. L. Honig, K. Steiglitz
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2 (1995)

Usage-based pricing of offered traffic to a data network can be an effective technique for congestion control. To gain insight into the benefits usage-based pricing offers, the authors propose and study a simple model in which many users wish to transmit packets to a single-server queue. Based on the announced price per packet and the available quality of service (QoS) (e.g., mean delay), each user independently decides whether or not to transmit. Given statistical assumptions about the incoming traffic streams and the QoS as a function of offered load, the equilibrium relationship between price and QoS is determined by a fixed-point equation. The relationships among price, QoS, revenue, and server capacity are illustrated numerically, assuming a particular type of random user population. These examples indicate that adjusting the price to maximize revenue results in an efficient use of service capacity with an associated small mean delay.
UGA: A Unified Graphics Architecture
Authors: Philip M. Hubbard, Matthias M. Wloka, Robert C. Zeleznik
Venue:  (1991)

UGA is a system that supports research into the integration of modeling and animation paradigms. The heart of the system is a database of objects whose attributes can change over time. The database allows a variety of techniques to be used to modify and display the attributes of objects. Emphasis has been placed on maintaining the flexibility of the system without sacrificing the speed necessary for interactive applications. This document focuses on the implementation of UGA database. The important database algorithms are described, and the software packages that implement these algorithms are summarized.
Distributed channel allocation for PCN with bursty traffic
Authors: P. P. Bhattacharya, L. Georgiadis, A. Krishna
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1 (1995)

Considers the design of efficient channel allocation algorithms in personal communication networks where the cells have varying traffic loads. A common communication channel is to be dynamically shared between the cells. The authors propose a distributed inter-cell channel allocation policy that is easy to implement through the use of simple signalling between neighboring cells. For cells arranged in a line they show that the proposed policy achieves maximum throughput. The same is true when the cells are arranged in a circle and the channel can be reused in every other cell. For larger reuse distances and planar hexagonal arrays, the policy may not always achieve maximal throughput. For these cases the authors provide regions of achievable cell throughputs under the proposed policy and show that they are tight in certain cases.
A Study on the Design of Flash Analog to Quaternary Converter Using DLC Comparator
Authors: Sung Il Han, Young Hee Choi, Hyeon Kyeong Seong, Heung Soo Kim
Venue: Proceedings of the 33rd International Symposium on Multiple-Valued Logic (2003)

This paper describes a 3.3V low power 4 digit CMOSflash analog to quaternary converter (AQC) designed withneuron MOS down literal circuit comparators and binaryto quaternary encoding blocks. The neuron MOS downliteral comparator allows the designed AQC to reducenot only the number of MOS transistors, but also powerdissipations compared with conventional ADCs. Fastsettling time and low power consumption of the AQC areachieved by utilizing the proposed architecture. Thesimulation results of the designed 4 digit AQC show asampling rate of 16MHz and a power dissipation of28.5mW with a single power supply of 3.3V for a doublepoly four metal standard CMOS 0.35 \bullet n-well technology.
Decomposition of multiple-valued relations
Authors: M. Perkowski, M. Marek-Sadowska, L. Jozwiak, T. Luba, S. Grygiel, M. Nowicka, R. Malvi, Z. Wang, J. S. Zhang
Venue: Proceedings of the 27th International Symposium on Multiple-Valued Logic (1997)

This paper presents a new decomposition problem: decomposition of multi-valued (MV) relations, and a method of its solution. Decomposition is non-disjoint and multi-level. A fundamental difference in decomposition of MV functions and MV relations is discussed: the column (cofactor) pair compatibility translates to the group compatibility for functions, but not for relations. This makes the decomposition of relations more difficult. The method is especially efficient for strongly unspecified data typical for Machine Learning (ML). It is implemented in program GUD-MV.
Oracle9i for Windows NT/2000 Handbook
Authors: Anand Adkoli, Rama Velpuri
Venue:  (2002)

:This authorized guide from Oracle Press explains how to implement the Oracle9i Server on Windows NT/2000. You'll get details on operating system fundamentals,installation,and configuration,plus intermediate and advanced topics such as architecture,migration,clustering,parallel server,performance monitoring,troubleshooting,and using Oracle Enterprise Manager.
Programming with dynamic predicate logic
Authors: D. J Eijck
Venue:  (1998)

We propose to bring together two research traditions, computation with first order logic from computer science, and dynamic interpretation of first order logic from natural language semantics. We define a new executable process interpretation for first order logic, and show that it is a faithful approximation of the dynamic interpretation procedure for first order formulas. We then demonstrate the dynamic logic programming alternative to destructive assignment and show how to obtain a versatile logic programming language by adding constructs for bounded choice and for bounded and unbounded iteration. Finally, we show that the operational semantics for first order logic given in Apt and Bezem \cite{AptBezem:fap} is an approximation of our executable semantics. It follows that the operational semantics is faithful to the dynamic interpretation of first order logic. Our results relate a recent turn in executable computational interpretation of FOL formulas to a research tradition from natural language semantics, and suggest a new paradigm of dynamic logic programming that combines imperative power with dynamic declarative semantics.
Querying XML using structures and keywords in timber
Authors: Cong Yu, H. V. Jagadish, Dragomir R. Radev
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

This demonstration will describe how Timber, a native XML database system, has been extended with the capability to answer XML-style structured queries (e.g., XQuery) with embedded IR-style keyword-based non-boolean conditions. With the original structured query processing engine and the IR extensions built into the system, Timber is well suited for efficiently and effectively processing queries with both structural and textual content constraints.
The Intellectual Model of Control over Loose Couplings' Rolling Down Process Based on an Indistinct Dynamic System
Authors: Alexandr N. Shabelnikov
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

The problem of automation of the rolling-stock hump shunting process on marshalling yards is considered. There is a model of knowledge about technological process, obtained byformalization of the hump yard operators' experience, in the basis of the approach offered. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Indexing for Data Models with Constraints and Classes
Authors: Paris Kanellakis, Sridhar Ramaswamy, Darren Vengroff, Scott J Vitter
Venue:  (1994)

We examine I/O-efficient data structures that provide indexing support for new data models. The database languages of these models include concepts from constraint programming (e.g., relational tuples are generalized to conjunctions of constraints) and from object-oriented programming (e.g., objects are organized in class hierarchies). Let $n$ be the size of the database, $c$ the number of classes, $B$ the secondary storage page size, and $t$ the size of the output of a query. Indexing by one attribute in the constraint data model (for a fairly general type of constraints) is equivalent to external dynamic interval management, which is a special case of external dynamic 2-dimensional range searching. We present a semi-dynamic data structure for this problem which has optimal worst-case space $O(n/B)$ pages and optimal query I/O time $O(\log_B n + t/B)$ and has $O(\log_B n + (\log^2_B n) / B)$ amortized insert I/O time. If the order of the insertions is random then the expected number of I/O operations needed to perform insertions is reduced to $O(\log_B n)$. Indexing by one attribute and by class name in an object-oriented model, where objects are organized as a forest hierarchy of classes, is also a special case of external dynamic 2-dimensional range searching. Based on this observation we first identify a simple algorithm with good worst-case performance for the class indexing problem. Using the forest structure of the class hierarchy and techniques from the constraint indexing problem, we improve its query I/O time from $O(\log_2 c \log_B n +t/B)$ to $O(\log_B n + t/B + \log_2 B)$.