ppxscal/embedding_network huggingface dataset:
A Service Interworking Unit for Accommodating Multimedia Communications with Quality of Service between ATM and Internet
Authors: Tae-Man Han, You-Hyeon Jeong
Venue: Proceedings of the 2000 International Workshop on Parallel Processing (2000)

Much has been written about the potential of Quality of Service (QoS) and the Internet. The integration of voice, data and video services modified the target of networking technologies. Networks must have some the capabilities for integration of various services and also for QoS support as required by each of those services. The EAGIS (Efficient ATM Gateway for real-time Internet Service) consists of the inter-working unit and the service broker to provide seamless multimedia service between the ATM network and the Internet. In this paper, we explain the design of the inter-working unit of the EAGIS. For a real-time delivery of multimedia service between the ATM network and the Internet, the inter-working unit of the EAGIS performs the following functions: protocol conversion, data format conversion, traffic monitoring and bit-rate control. It converts the protocols of the ATM network to the Internet protocols for real-time delivery. In addition, it does data format conversion, traffic monitoring and bit-rate control to overcome bandwidth difference between the ATM network and the Internet.
Circuit Design from Kronecker Galois Field Decision Diagrams for Multiple-Valued Functions
Authors: Radomir S. Stankovic, Rolf Drechsler
Venue: Proceedings of the 27th International Symposium on Multiple-Valued Logic (1997)

In this paper we define the Kronecker Galois Field Decision Diagrams (KGFDDs), a generalization of Kronecker Decision Diagrams (KDDs) to the representation of Multiple-Valued (MV) functions. Starting from the Multi-place Decision Diagrams (MDDs) and Galois Field Decision Diagrams (GFDDs) we give a generalization that allows more compact representation with respect to the nodes needed.Based on KGFDDs we present a new method for circuit design for MV circuits. In contrast to previously presented approaches the resulting circuits have only logarithmic (instead of linear) depth.
Full Utilization, Fairness and Bounded Access Delay on High Speed Bus Networks
Authors: Angela L. Chiu, Robert G. Gallager
Venue: Proceedings of the 1996 International Conference on Network Protocols (ICNP '96) (1996)

The purpose of this paper is to understand the relationship between utilization, fairness and access delay in high speed slotted bus networks. We illustrate this relationship by means of a protocol called FUFA (fully utilized and fair). We define full utilization, and fairness precisely, and show that both are achieved together in the FUFA protocol. In addition, the protocol provides bounded access delay that is linear in the round trip propagation delay, and at most a constant away from its minimum possible value for any bus protocol that is both fully utilized and fair. The main idea is that each station takes account of the idle slots propagated previously to interpret the information from downstream (i.e., estimated aggregate number of data segments in queue downstream and estimated number of active downstream stations). This allows the active downstream stations to be served in a round robin fashion according to the updated information.
SMART: Simulation and Markovian Analyzer for Reliability and Timing
Authors: Gianfranco Ciardo, Andrew S. Miner
Venue: Proceedings of the 2nd International Computer Performance and Dependability Symposium (IPDS '96) (1996)

SMART is a new tool for performance, reliability, availability, and performability modeling. Numerical solution algorithms are available for both continuous- and discrete-time Markov chains. Mixed-time non-Markovian models can be studied using simulation. Multiple interacting models and fixed-point iterative techniques for the decomposition and solution of complex models can be easily specified. To assist in the model specification and help in avoiding common mistakes, the input language is strongly typed.
Model Checking UML Specifications of Real Time Software
Authors: Vieri Del Bianco, Luigi Lavazza, Marco Mauri
Venue: Proceedings of the Eighth International Conference on Engineering of Complex Computer Systems (2002)

UML is being increasingly used to model real-timesoftware. On one hand this is reasonable, since UML isvery popular and relatively easy to use. On the otherhand, the semantics of UML is not well defined, thus UMLdoes not support formal analysis, which is needed toprove properties like safety, utility, liveness, etc. Thisarticle describes a way to make UML models formallyverifiable. The presented approach is made possible byextending UML in order to represent time-dependentinformation and time constraints, and by formalizing theresulting language. The formalization is achieved bymapping UML state diagrams to Timed Statecharts. UMLstate models are translated into timed automata, so thatthe model checking tool Kronos can be employed to verifytime-dependent properties. A central issue of the workpresented here is that developers can take advantage ofthe formal methods being employed while skipping thecomplex and expensive formal modeling phase.
Dynamical Automata
Authors: Whitney Tabor
Venue:  (1998)

The recent work on automata whose variables and parameters are real numbers (e.g., Blum, Shub, and Smale, 1989; Koiran, 1993; Bournez and Cosnard, 1996; Siegelmann, 1996; Moore, 1996) has focused largely on questions about computational complexity and tractability. It is also revealing to examine the metric relations that such systems induce on automata via the natural metrics on their parameter spaces. This brings the theory of computational classification closer to theories of learning and statistical modeling which depend on measuring distances between models. With this in mind, I develop a generalized method of identifying pushdown automata in one class of real-valued automata. I show how the real-valued automata can be implemented in neural networks. I then explore the metric organization of these automata in a basic example, showing how it fleshes out the skeletal structure of the Chomsky Hierarchy and indicates new approaches to problems in language learning and language typology. 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
Design and Performance Evaluation of Differentiated Services Router for Next Generation Internet
Authors: Bin Pang, Wen Gao
Venue: Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01) (2001)

The current Internet provides only "best effort" services, however, applications and users expect different QoS (Quality of Service). To meet these requirements, Differentiated Services (DiffServ) architecture is introduced. Because DiffServ is regarded as the foundation of the next generation Internet QoS architecture, it's helpful to design a DiffServ Router (DSR) and evaluate its performance. In this paper, we first analyze the specifications on DSR and then outline the modules required to construct DSR based on IETF standards and drafts. In order to evaluate the performance of DSR, a new prototype DSR is provided and implemented in Network Simulator (NS). Evaluations of prototype DSR show that different structures andparameters affect the performance of DiffServ services. The results of prototype DSR simulating are useful for the design of future router.
Navigating through a forest of quad trees to spot images in a database
Authors: H. G.P. Bosch, Niels Nes, Martin L. Kersten
Venue:  (2000)

This paper describes how we maintain color and spatial index information on more than 1,000,000 images and how we allow users to browse the spatial color feature space. We break down all our images in color-based quad trees and we store all quad trees in our main-memory database. We allow users to browse the quad trees directly, or they can pre-select images through our color bit vector, which acts as an index accelerator. A Java based \textsc{gui} is used to navigate through our image indexes.
A Network Package for the Macintosh Using the DoD Internet Protocols
Authors: Mark Sherman
Venue:  (1986)

This memo describes the design, implementation and use of the MacIP libraries and programs for running DoD Internet Protocols on the Macintosh over Apple Talk. It is preliminary documentation and out of date, but it is all that exists.
A Component Based Architecture for Mobile Information Access
Authors: Chaitanya Pullela, Liang Xu, Dipanjan Chakraborty, Anupam Joshi
Venue: Proceedings of the 2000 International Workshop on Parallel Processing (2000)

Implicit in today's mobile information access scenarios is the assumption that the information required by the mobile host is readily available on the network and its location is ¿known¿ in a static fashion. There is a significant ongoing research on ways to overcome the problems (such as low-bandwidth of mobile networks) existing in delivering available information to mobile systems. We investigate the situations where the information required is not readily available on the network and it needs to be obtained by dynamically locating the required data and then possibly initiating a series of computations to obtain the information. This paper presents a layered architecture for addressing this problem generally and our initial implementation of this architecture.
Software maintenance offloading at the Union Bank of Switzerland
Authors: E. Nyary, H. M. Sneed
Venue: Proceedings of the International Conference on Software Maintenance (1995)

This paper reports on the offloading of software maintenance from the mainframe to a PC-based maintenance workbench at the Union Bank of Switzerland. The objective of the offloading activity was to increase maintenance productivity by providing automated aids for analyzing, editing, reengineering, testing and reverse engineering JSP/COBOL host programs under a graphical interface. The maintenance workbench was completed at the end of 1994 and is now undergoing pilot testing.
Functional Safety of Safety-Related Systems: The Influence of IEC 1508 and Developments in Conformity Assessment Schemes on Business Drivers
Authors: Stuart R. Nunns
Venue: Proceedings of the 3rd International Software Engineering Standards Symposium (ISESS '97) (1997)

Industry faces many challenges and unremitting pressures within increasingly competitive markets. There are increasing regulatory demands to address risks to safety and the environment in a world where public concern for safety is rising. A consistent approach to the use of new technology and standards is essential to avoid the potential confusion of different approaches to safety being followed by different application sectors. Programmable Electronics, is a technology that if properly used in the implementation of safety related systems, supported by internationally acceptable standards, with supporting conformity assessment schemes offers significant benefits to industry in meeting its challenges, whilst maintaining and improving safety. This paper presents a range of current technical issues and business drivers within manufacturing industry, and discusses the relevance and importance of the emerging international standard, IEC 1508 in assisting industry in satisfying their evolving business drivers and continuous organizational restructuring. A UK Government sponsored research project FRESCO has developed a conformity assessment scheme from process industry requirements based on IEC 1508. The paper outlines the organizational framework and assessment methodology developed by the FRESCO project.
A Model Analysis of Staged Computation
Authors: Rowan Davies, Frank Pfenning
Venue:  (1995)

We show that a type system based on the intuitionistic modal logic S4 provides an expressive framework for specifying and analyzing computation stages in the context of functional languages. Our main technical result is a conservative embedding of Nielson & Nielson''s two-level functional language in our language Mini-ML^(box), which in addition to partial evaluation also supports multiple computation stages, sharing of code across multiple stages, and run-time code generation.
Learning-based Cursive Handwriting Synthesis
Authors: Jue Wang, Chenyu Wu, Ying-Qing Xu, Heung-Yeung Shum, Liang Ji
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

In this paper, an integrated approach for modeling, learning and synthesizing personal cursive handwriting is proposed. Cursive handwriting is modeled by a tri-unit handwriting model, which focuses on both the handwritten letters and the interconnection strokes of adjacent letters.Handwriting strokes are formed from generative models that are based on control points and B-spline curves. In the two-step learning process, a template-based matching algorithm and a data congealing algorithm are proposed to extract training vectors from handwriting samples, and then letter style models and concatenation style models are trained separately. In the synthesis process, isolated letters and ligature strokes are generated from learned models and concatenated with each other to produce the whole word trajectory, with guidance from a deformable model. Experimental results show that the proposed system can effectively learn the individual style of cursive handwriting and has the ability to generate novel handwriting of the same style.
U.S. Government on the Web: Getting the Information You Need, 3 edition
Authors: Peter Hernon, Robert E. Dugan, John A. Shuler
Venue:  (2003)

:The definitive guide to United States government information on the Web has been expanded and updated with the latest information from the current administration, including material on the Department of Homeland Security, the Patriot Act, and the E-Government Act of 2002. Peter Hernon, one of the country's foremost authorities on government information, and his colleagues provide additional Web sites and offer valuable strategies for effectively accessing and using government information online.
Multimedia Information Systems in Education
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

Multimedia applications within the academic environment can be varied and include such things as: marketing of courses with an interactive prospectus; providing general administrative information (student handbooks, timetables, assignment schedules, module content, etc.); facilitating co-operative working using such things as computer conferencing or collaborative whiteboards; and for the purposes of computer-assisted- learning (CAL). In addition, multimedia can be used as an end in itself through students employing the embedded techniques in development of a spectrum of products.The main purpose of this paper is to explore the lessons that might be learnt through the application of information systems research to the field of multimedia education. By adopting this approach, parallels might be drawn between the two application areas to highlight the convergence of underlying philosophies and methods in order to inform good practice. The paper aims to promote discussion of the various aspects involved in multimedia systems development within an educational environment.
A Presetting Location Strategy for Personal Communication Using Hierarchical Location Database
Authors: Hwa-Chuan Lin, SingLing Lee
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops (2000)

We propose a new strategy of location management, presetting approach, for hierarchical database architecture in the mobile computing environment. When a called receiver leaves its old registration area, our strategy is to store its new registration address to its previous caller's location database. Our presetting strategy will only need one more database updating than the caching strategy. This approach will gain benefit from those subscribers who receive calls and change registration areas frequently. We compare the performance of our strategy with caching strategy by analyzing database accessing cost and communication cost in details. Our result shows that when the rate of crossing regional area is small, these two strategies almost have the same cost, and when the rate of crossing regional area is becoming large, presetting strategy is better than caching strategy.
A Unified Algebraic Framework for Specifying Communication Protocols
Authors: Mohamed Jmaiel
Venue: Proceedings of the 3rd IEEE International Conference on Formal Engineering Methods (2000)

This paper provides a unified framework for the specification of communication protocols. This framework enables to integrate within algebraic specifications different formalisms permitting the description of dynamic aspects of distributed systems, such as temporal logic, Petri nets and process algebra. These integrations provide different languages allowing specifications, which may include both data aspects and behavioral aspects of protocols. In addition, this paper gives a unified semantics for the different languages based on algebra and event structures. Finally, we illustrate our framework by specifying the Alternating Bit Protocol using the different behavioral formalisms.
Determining Acceptance Possibility for a Quantum Computation is Hard for the Polynomial Hierarchy
Authors: Stephen Fenner, Frederic Green, Steven Homer, Randall Pruim
Venue:  (2000)

Abstract It is shown that determining whether a quantum computation has a non-zero probability of accepting is at least as hard as the polynomial time hierarchy. This hardness result also applies to determining in general whether a given quantum basis state appears with nonzero amplitude in a superposition, or whether a given quantum bit has positive expectation value at the end of a quantum computation. This result is achieved by showing that the complexity class NQP of Adleman, Demarrais, and Huang, a quantum analog of NP, is equal to the counting class $co-C equals P$.
Refinements in Training Schemes for the Coulom Energy Network
Authors: J. F. Vassilopoulos, C. Koutsougeras
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

We discuss the interesting perspective offered by the Coulomb Energy network and we identify certain disadvantages with the existing approach to training it. We address these problems by constraining its architecture (topology) and offer a derivation of the new associated training algorithm. We study further refinements of this algorithm. Most notably, existing genetic algorithms are employed as initial search techniques and simulation results are provided.
Performance models for large scale multiagent systems: using distributed POMDP building blocks
Authors: Hyuckchul Jung, Milind Tambe
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Given a large group of cooperative agents, selecting the right coordination or conflict resolution strategy can have a significant impact on their performance (e.g., speed of convergence). While performance models of such coordination or conflict resolution strategies could aid in selecting the right strategy for a given domain, such models remain largely uninvestigated in the multiagent literature. This paper takes a step towards applying the recently emerging distributed POMDP (partially observable Markov decision process) frameworks, such as MTDP (Markov team decision process), in service of creating such performance models. To address issues of scale-up, we use small-scale models, called building blocks that represent the local interaction among a small group of agents. We discuss several ways to combine building blocks for performance prediction of a larger-scale multiagent system.We present our approach in the context of DCSPs (distributed constraint satisfaction problems), where we first show that there is a large bank of conflict resolution strategies and no strategy dominates all others across different domains. By modeling and combining building blocks, we are able to predict the performance of five different DCSP strategies for four different domain settings, for a large-scale multiagent system. Our approach thus points the way to new tools for strategy analysis and performance modeling in multiagent systems in general.
Source Animation as a Means of Program Comprehension
Authors: Harry M. Sneed
Venue: Proceedings of the 8th International Workshop on Program Comprehension (2000)

Object-oriented systems are particularly difficult to comprehend because of the distribution of functionality, encapsulation of data, inheritance and polymorphism. Polymorphism, in particular, limits the effectiveness of conventional static analysis methods. This paper proposes a dynamic analysis approach using animation to simulate use cases in a large financial application. The objective is to offer maintenance programmers a means of familiarizing themselves with complex C++ code while at the same time validating the correctness of the code. For this purpose, control flow slicing and concept lattices are used.
Probability and Statistics for Computer Science
Authors: James Lee Johnson
Venue:  (2003)

:Many computer science curricula include only a first probability course. However, there is a recognized need for further study, at least in the form of an elective second course, if ont in a required sequel to the introductory course. Anticipatin gthat this increased attention will also expose the need for a more complete mathematical treatment of the material, the author has provided unusually detailed excursions into supporting topics, such as estimation arguments with limits, properties of power series, and Markov processes.
Architectural Considerations about Open Distributed Agent Support Platforms
Authors: M. Mendes, O. Falsarella, I. Fontes, S. Krause, W. Loyolla, C. Mendez, P. S. Silva, C. Tobar
Venue: Proceedings of the 3rd International Symposium on Autonomous Decentralized Systems (1997)

Agents are becoming one of the most important topics in massively distributed and autonomous decentralized systems. Here, agents are considered as software computational entities, created and supported through Agent Platforms, and acting in an Agent Environment.Based on some recognized agent skills and roles, this paper presents a discussion about the capabilities required in order that a standardized platform supports the action of agents in distributed heterogeneous systems. After posing some architectural goals and principles, a proposal is presented for an Agent Platform Architecture that offers a set of configurable functionalities aiming to support generic agent necessities within their execution environment. The proposal follows the concepts of agent facilities described for Corba environments.
Data Mining for Selective Visualization of Large Spatial Datasets
Authors: Shashi Shekhar, Chang-Tien Lu, Pusheng Zhang, Rulin Liu
Venue: Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence (2002)

Data mining is the process of extracting implicit, valuable, and interesting information from large sets of data. Visualization is the process of visually exploring data for pattern and trend analysis, and it is a common method of browsing spatial datasets to look for patterns. However, the growing volume of spatial datasets make it difficult for humans to browse such datasets in their entirety, and data mining algorithms are needed to filter out large uninteresting parts of spatial datasets. We construct a web-based visualization software package for observing the summarization of spatial patterns and temporal trends. We also present data mining algorithms for filtering out vast parts of datasets for spatial outlier patterns. The algorithms were implemented and tested with a real-world set of Minneapolis-St. Paul (Twin Cities) traffic data.