ppxscal/embedding_network huggingface dataset:
Identity Escrow
Authors: Joe Kilian, Erez Petrank
Venue:  (1997)

We introduce the notion of {\em escrowed identity}, an application of key-escrow ideas to the problem of identification. In escrowed identity, one party $A$ does {\em not} give his identity to another party $B$, but rather gives him information that would allow an authorized third party $E$ to determine $A$''s identity. However, $B$ receives a guarantee that $E$ can indeed determine $A$''s identity. We give protocols for escrowed identity based on the El-Gamal (signature and encryption) schemes and on the RSA function. A useful feature of our protocol is that after setting up $A$ to use the system, $E$ is only involved when it is actually needed to determine $A$''s identity.
Measuring the Performance of Database Object Horizontal Fragmentation Schemes
Authors: C. I. Ezeife, Jian Zheng
Venue: Proceedings of the 1999 International Symposium on Database Engineering & Applications (1999)

A horizontal fragment of a database class in an object-oriented database system contains subsets of its instance objects (or class extents) reflecting the way applications are accessing database objects. Allocating well-defined fragments of classes to distributed sites has the advantage of minimizing transmission costs of data to remote sites as well as minimizing retrieval time of data needed locally. A refragmentation of the system is needed when application access and schema information have undergone sufficient changes.In this paper, we provide a technique for measuring the performance of object horizontal fragments placed at distributed sites. This work provides a platform for dynamic object horizontal fragmentation and for comparing object horizontal fragmentation schemes.
Project Management for System-on-Chip Using Multi-Chip Modules
Authors: Donald J. Dent
Venue: Proceedings of the 1st International Symposium on Quality of Electronic Design (2000)

Mutli-Chip Module (MCM) projects are complex, in terms of the technology used, and are expensive, typically in excess of $50,000. MCM technology is very unforgiving in that mistakes cannot be easily rectified or the device easily re-worked. The Mosaic Earth Sensor Mutli-Chip Module (MESMCM) project, which was the subject of a case study, was a high speed, first-of-a-kind development that ran into some difficulties in spite of rigorous project management. It is intended to compare the project management structure used for a technology demonstrator with the new structure used on subsequent MCM designs. One of the outcomes of this case study was that the management of an MCM project is just as crucial as the technical aspects and resulted in several guidelines about the nature and composition of the design team. The lessons learned from the MESMCM project were applied very effectively to further MCM designs.
Case Study: Design and Assessment of an Enhanced Geographic Information System for Exploration of Multivariate Health Statistics
Authors: Robert M. Edsall, Alan M. MacEachren, Linda Pickle
Venue: Proceedings of the IEEE Symposium on Information Visualization 2001 (INFOVIS'01) (2001)

An implementation of an interactive parallel coordinate plot linked with the ArcView(r) geographic information system (GIS) is presented. The integrated geographic visualization system was created for the exploratory analysis of mortality data from specific cancers as they relate, specifically spatially, to other mortality causes and to demographic and socioeconomic risk factors. The linked and interactive parallel coordinate plot was tested with and compared to a similarly interactive and linked scatterplot in usability assessments designed to assess each representation's relative effectiveness for exploration of these data sets. Evidence from these studies suggests that multivariate, spatial, and/or time series exploration is enhanced through the use of the parallel coordinate plot linked to maps.
Improving Data Consistency in Mobile Computing Using Isolation-Only Transactons
Authors: Qi Lu, Mahadev Satyanarayanan
Venue:  (1995)

Disconnected operation is an important technique for providing mobile access to shared data in distributed file systems. However, data inconsistency resulting from partitioned sharing remains a serious concern. This paper presents a new mechanism called isolation-only transaction (IOT) that uses serializability constraints to automatically detect read/write conflicts. The IOT consistency model provides a set of options for automatic and manual conflict resolution. In addition, application specific knowledge can be incorporated to detect and resolve conflicts. To preserve upward Unix compatibility, the IOT mechanism is provided as an optional file system facility and its flexible interfaces allow any existing Unix application to be executed as an IOT. This paper describes high level system design and implementation and concludes with related work and current status.
Modeling chaotic behavior of stock indices using intelligent paradigms
Authors: Ajith Abraham, Ninan Sajith Philip, P. Saratchandran
Venue: Neural, Parallel Scientific Computations (2003)

The use of intelligent systems for stock market predictions has been widely established. In this paper, we investigate how the seemingly chaotic behavior of stock markets could be well represented using several connectionist paradigms and soft computing techniques. To demonstrate the different techniques, we considered Nasdaq-100 index of Nasdaq Stock MarketSM and the S&P CNX NIFTY stock index. We analyzed 7 year's Nasdaq 100 main index values and 4 year's NIFTY index values. This paper investigates the development of a reliable and efficient technique to model the seemingly chaotic behavior of stock markets. We considered an artificial neural network trained using Levenberg-Marquardt algorithm, Support Vector Machine (SVM), Takagi-Sugeno neurofuzzy model and a Difference Boosting Neural Network (DBNN). This paper briefly explains how the different connectionist paradigms could be formulated using different learning methods and then investigates whether they can provide the required level of performance, which are sufficiently good and robust so as to provide a reliable forecast model for stock market indices. Experiment results reveal that all the connectionist paradigms considered could represent the stock indices behavior very accurately.
A goodness of fit approach to testing mean residual times
Authors: Ahmed H. El-Bassiouny, Ibrahim A. Alwasel
Venue: Applied Mathematics and Computation (2003)

The random residual lifetime is a random variable representing the remaining life of a system of age x ≥ 0. The mean residual life at age x, is the expected value of the remaining life beyond that age which is well known and extensively studied for both testing and estimation.In this article, a new approach is presented for testing constant versus decreasing residual life. The new test is much simpler to compute, asymptotically normal and performs better than previous tests in terms of power and Pitman asymptotic efficiencies for several alternatives.
Spectral Transforms of Mixed-radix MVL Functions
Authors: Mitchell A. Thornton
Venue: Proceedings of the 33rd International Symposium on Multiple-Valued Logic (2003)

Mixed-radix "Multiple Valued Logic" (MVL) functions areassumed to be finite and discrete-valued and depend on afinite-valued variable support set {xi,...,xj} such that xi is qi-valued and xj is qj-valued withqi \ne qj.The spectra ofsuch MVL functions is of interest to circuit designers andautomated design tool researchers and developers.Spectraltransforms are described that are applicable to such functionsover the elementary additive (mod(p)) Abelian groups.Three formulation of such transforms are described here; alinear transformation matrix derived from a group charactertable, a Kronecker-based expansion allowing for a 'fast'transform algorithm, and a Cayley graph spectrum computation.It is shown that a particular spectral transformationof a discrete mixed-radix function over Z6 is equivalent tothat over Z2 \times Z3 within a permutation.Also, it is shownthat a Cayley graph may be formed over Z6 with a generatorcorresponding to the discrete function of interest.
Wearable Computers for Performance Support: Initial Feasibility Study
Authors: Jennifer J. Ockerman, Lawrence J. Najjar, J. Christopher Thompson
Venue: Proceedings of the 1st IEEE International Symposium on Wearable Computers (1997)

We have suggested that wearable computers combined with a performance support system could be a useful resource for mobile workers. Literature provides little guidance as to whether this is a feasible solution for aiding mobile workers in the performance of their tasks. In order to evaluate the feasibility of this concept a small, initial study was conducted. The initial study compared a voice-activated, computer-based performance support system with a book for learning and performing three simple tasks. The study demonstrated the feasibility of a performance support system on a wearable computer, but did not show it to be superior to the book in this context. Guidance on the design of future performance support systems and suggestions for future studies are provided.
Optimal view selection for multidimensional database systems
Authors: E. Soutyrina, F. Fotouhi
Venue: Proceedings of the 1997 International Symposium on Database Engineering & Applications (1997)

This paper presents a greedy algorithm to compute the best set of views with respect to a given set of queries and their frequencies, for multidimensional databases. Previous approaches have not taken frequency of queries into consideration. We show that our proposed algorithm determines a set of views with the most benefits compared to previous approaches.
CODI-a system for cooperative 3D design
Authors: R. Galli, P. Palmer, M. Mascaro, M. Dias, Y. Luo
Venue: Proceedings of the IEEE Conference on Information Visualisation (1997)

A system that integrates 3D virtual scene generation tools and data communication techniques for 3D cooperative design work is presented. The system, named CODI (Sistema Cooperativo de Diseno3D) supports two major functions: 3D cooperative design and multiple client distant access. The system is implemented using Open Inventor Toolkit in C++ with VRML compatibility.
VLSI Placement Using Uncertain Costs
Authors: Cheryl L. Harkness, Daniel P. Lopresti
Venue:  (1990)

Many objective functions used to evaluate placement quality contain uncertain parameters. While these values (e.g., channel width, cell area, wire length, and circuit delay) can be estimated, they cannot be precisely known until the layout is finished or sometimes until the chip is fabricated. As a result, current automatic placement algorithms must use `expected'' values in their objective functions providing one possible estimate of placement nquality. An algorithm that uses the full range of potential values when computing placement cost can yield a more credible prediction of placement quality and reveal more about the structure of optimal configurations. In this paper, we propose an interval-based approach to modeling uncertainty in automatic placement algorithms. We illustrate our methodology by implementing an interval branch-and-bound placement algorithm. Using this example, we demonstrate how interval operators can be used to compute bounds on placement cost and to determine minimum-cost configurations. We also test the performance of our algorithm and analyze the results.
An Efficient Cache Maintenance Scheme for Mobile Environment
Authors: S. Khurana, A. Kahol, S. K. S. Gupta, P. K. Srimani
Venue: Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000) (2000)

In this paper, we present a new cache maintenance scheme, called AS, suitable for wireless mobile environment. Our scheme integrates mobility management scheme of Mobile IP with cache maintenance scheme used in CODA file system. As opposed to broadcasting invalidation report schemes [1], AS supports arbitrary disconnection patterns and uses less wireless bandwidth. We present analytical and simulation results to show the superiority of our caching scheme.
Computing Power and Political Opportunism
Authors: Abbe Mowshowitz
Venue:  (1976)

NO SUPPLIED
A Flexible Run-time Support for Distributed Dependable Hard Real-time Applications
Authors: Emmanuelle Anceaume, Gilbert Cabillic, Pascal Chevochot, Isabelle Puaut
Venue: Proceedings of the 2nd IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (1999)

Typically, most distributed, dependable, real-time systems designed in the past can only meet the particular requirements of the application domain to which they were targeted. This approach led to specific, non-flexible, dedicated and non-reusable solutions, often based on specialized hardware.This paper presents an alternative approach where a flexible run-time support for distributed dependable hard real-time applications is built on top of off-the-shelf hardware. This support has been designed by considering three fundamental and complementary aspects: real-time, to support applications that exhibit strict timing constraints; fault-tolerance, to provide a high degree of reliability through the transparent provision of fault tolerant mechanisms; and flexibility, to allow the modifications of components of the run-time support without having to rewrite it entirely, and to support a large range of application domains, real-time kernels and hardware.
On Order-Generic Queries
Authors: Oleg V. Belegradek, Alexei P. Stolboushkin, Michael A. Taitslin
Venue:  (1996)

We consider relational databases organized over an ordered domain with some additional relations---a typical example is the ordered domain of rational numbers together with the ternary relation $+$ of addition. In the focus of our study are the first order queries that are invariant under order-preserving ``permutations''''---such queries are called order-generic. In fact, we consider two formalizations of this notion: ``generic'''', and ``locally generic'''', queries. For several domains order-generic queries fail to express more than pure order queries, for example, every order-generic query over rational numbers with $+$ can be rewritten without $+$. Our goal is to find general conditions on the domain that allow for such a simplification of order-generic queries. An important difference of this paper from a recent series of related papers (see, for example,~\cite{PBG95,BDLW95}) is that we generalize all notions to the case of finitely representable database states---as opposed to finite states---and develop a general lifting technique that, essentially, allows us to extend any result of the kind we are interested in, from finite to finitely-representable states, and thus all the results in this paper are proved for the general case of {\em constraint databases.} On the simplification of order-generic queries, we offer two types of results. The results of the first type address {\em equivalence\/} of order-generic queries that use the additional predicates (extended queries) to pure order queries. Here we establish the necessary and sufficient condition for an extended query to be equivalent to a pure order query, in terms of behavior of this extended query over the ultra-product of this domain by a non-principal ultra-filter over $\omega$. This characterization relies upon the Continuum Hypothesis, and is used as instrumental in establishing equivalence of generic, as well as locally generic, extended queries to pure order queries for several classes of domains, including in particular the so-called $o$-minimal domains, integers with $+$, and such. Although, by Shoenfield''s Absoluteness Theorem, the Continuum Hypothesis can be eliminated from these latter results, the fact remains, no translation algorithm can be extracted from arguments of this type. That is why we also offer {\em effective algorithms\/} of translating extended to pure order queries for divisible ordered Abelian groups. Such groups---including real or rational numbers with $+$---are all $o$-minimal.
Formal Development and Validation of Java Dependable Distributed Systems
Authors: Giovanna Di Marzo Serugendo, Nicolas Guelfi, Alexander Romanovsky, Avelino Francisco Zorzo
Venue: Proceedings of the 5th International Conference on Engineering of Complex Computer Systems (1999)

The rapid expansion of Java programs into software market is often not supported by a proper development methodology. Here, we present a formal development methodology well-suited for Java dependable distributed applications. It is based on the stepwise refinement of model-oriented formal specifications, and enables validation of the obtained system wrt the client's requirements.Three refinement steps have been identified in the case of fault-tolerant distributed applications: first, starting from informal requirements, an initial formal specification is derived. It does not depend on implementation constraints and provides a centralized solution; second, dependability and distribution constraints are integrated; third, the Java implementation is realized. The CO-OPN/2 language is used to express specification formally; and the dependability and distribution design is based on the Coordinated Atomic action concept. The methodology and the three refinement steps are presented through a very simple fault-tolerant distributed Java application.
The Horizontal Rotate Crossed Cube HCQ Interconnection Network
Authors: Susumu Horiguchi, Masayuki Konuki
Venue: Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (1997)

Massively parallel computers have been used for high performance computation in advanced science and technology. The Hypercube (HC) network has attractive properties such as strong connectivity, recursive interconnection, simple routing, and a good link complexity. However, as the number of processing elements (PEs) increases, the diameter and average distance of HC become large in proportion to a logarithm of the number of PEs. This causes a large latency in communication between PEs and consequently, it reduces system performance. To solve this problem, two approaches have been investigated. The first approach is a theoretical approach to find a network topology reducing a diameter and an average distance between PEs. The second approach reduces the physical distances between PEs by integrating a large interconnection on a small chip for a silicon wafer. In this paper, we propose a new interconnection network ; The HCQ (Horizontal Rotate Crossed Cube) by taking into account a WSI implementation. Theoretical network properties such as the diameter, the average distance, a routing algorithm are discussed in detail. It is shown that HCQ is a suitable network topology for massively parallel computers for WSI.
Home Networking
Authors: Walter Y. Chen
Venue:  (2003)

:This complete technical guide to home network media, protocols, and implementation is the first systematic technical guide to all leading transmission media and communication protocols for in-home networking.Using detailed simulation techniques provided as MATLAB files and SIMULINK models (downloadable from the companion website), Walter Y. Chen covers the technical challenges and implementation of twisted-pair telephone wiring, coax, powerline, and RF transmission. Next, Chen thoroughly reviews each leading communications protocol: Ethernet, HomePNA 1.0/2.0, FireWire, X-10, CEBus, HomePlug, Wireless LAN, and HomeRF. Finally, he covers today's leading mechanisms and protocols for linking the Internet with home networks. Coverage includes: Transmission potentials for each medium, including channel and noise models, and channel capacity calculationKey features of each standard, with corresponding implementation approachesStandardized transmission protocols, corresponding transceiver structures, and performance estimatesHome network topologies and interconnection protocols, including Peer-to-Peer, NAT, and MAC Bridging
A Stabilizing Search Tree with Availability Properties
Authors: Ted Herman, Toshimitsu Masuzawa
Venue: Proceedings of the Fifth International Symposium on Autonomous Decentralized Systems (2001)

The ability of a system to recover from unexpected change in its environment or disruptions to its internal state is an indication of robust design and autonomous control. Recovery can be constrained by service availability requirements, so that even during periods of recovery, new service requests should be admitted and processed in a timely manner. Given that complex systems are constructed from many components, it is sensible to investigate how individual components can facilitate recovery and also satisfy availability requirements. The component presented in this paper is a search tree data structure that can recover from any disruption: it is a self-stabilizing data structure. No matter how severe the damage to its internal state, new operations on the data structure behave properly and the responses to operations are accurate indicators of any change to the search tree, even as the search tree recovery is underway. This paper resolves, for the first time, issues of dynamic allocation and pointer organization in a stabilizing data structure. After any sequence of O(m) operations in an arbitrary initial search tree of m nodes, the tree becomes balanced, all operations have O(lg n) running time, and free chains are adequate to supply new nodes for insertions. To meet availability constraints, operations have O(lg K) running time during periods of recovery, where K is the maximum number of items that the data structure can contain.
A facilitator method for upstream design activities with diverse stakeholders
Authors: R. M. Gonzales, A. L. Wolf
Venue: Proceedings of the 2nd International Conference on Requirements Engineering (ICRE '96) (1996)

The paper presents a method that can be used for the elicitation and specification of requirements and high level design. It supports stakeholder based modeling, rapid feasibility feed back to marketing, and the interpersonal dynamics that are necessary to develop a product. The method centers on the role of the facilitator, an independent agent whose purpose is to build the Integrated System Model (ISM). The ISM is the result of merging the independent system views from all stakeholders at any given abstraction level. Formulation of this method was based on the real world experience of developing a complex, high technology medical product with critical time to market pressures. It has proven to be a practical approach to the evolution of requirements definition and provides a necessary link to the marketing aspect of a product.
An Automated Shielding Algorithm and Tool For Dynamic Circuits
Authors: Gin S. Yee, Tyler Thorp, Ron Christopherson, Ban P. Wang, Carl Sechen
Venue: Proceedings of the 1st International Symposium on Quality of Electronic Design (2000)

This paper describes an algorithm and automated physical design methodology for noise sensitive dynamic circuits using a systematic shielding strategy to reduce capacitive coupling. As process technology scales, the wire width and spacing become smaller, while wire thickness is proportionately higher. This results in increasing capacitive coupling between neighboring wires, which increases wire propagation delay and crosstalk of neighboring the wires. More importantly, coupled noise or crosstalk can affect the functionality of noise sensitive receivers. Thus, for noise sensitive datapath and control blocks, shielding signals from each other has become a necessity for implementing reliable circuits.The methodology and tool described in this paper were used to reduce the design time of domino logic control blocks in the UltraSparcIII(tm) microprocessor. The two blocks reported here had delays half that of their static CMOS counterparts, the same area as the static design, cupucitive coupling noise of less than 5% of VDD, and were designed in record time using the tools.