ppxscal/embedding_network huggingface dataset:
Towards Model-Based and CCM-Based Applications for Real-Time Systems
Authors: Wendy Roll
Venue: Proceedings of the Sixth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2003)

New advances in software component and modeling standards promise to ease the burden of development complexity while improving flexibility and reliability. These solutions raise the level of abstraction from object-oriented classes to coarser components and support the creation and configuration of systems using modeling or other specification standards. This paper outlines the challenges inherent in the original Bold Stroke component model developed in the late 1990's and then discusses an evolved component model that leverages work being done in the Object Management Group (OMG) and in government funded research that addresses these issues in a distributed real-time embedded (DRE) application context.
Optimal Algorithms for Multipacket Routing Problems on Rings
Authors: Fillia Makedon, Antonios Symvonis
Venue:  (1991)

We study multipacket routing problems. We divide the multipacket routing problem into two classes, namely, distance limited and bisection limited routing problems. Then, we concentrate on rings of processors. We prove a new lower bound of 2n/ 3 routing steps for the case of distance limited routing problems. We also give an algorithm that tightens this lower bound. For bisection limited problems the lower bound is kn/ 4,k <2, where k is the number of packets per processor. The trivial algorithm needs in the worst case k | n /2| steps to terminate. An algorithm that completes the routing in kn /4 + 2.5 n routing steps is given. We define the class of pure routing algorithms and we demonstrate that new lower bounds hold if the routing is to be done by an algorithm in this class.
On Providing Highly Available Fault-Tolerant Video-on-Demand Services
Authors: Yuewei Wang, David H. C. Du
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems (1998)

Due to the large number of magnetic disks involved in a video server, the probability of disk failure is fairly high. Traditional parity-based and duplex-based (mirroring) approaches provide full data recovery, but do not guarantee full availability of the service in the presence of even a single disk failure.If a video server would like to provide non-disruptable services to a large number of viewers, the issue of high availability needs to be addressed. In this paper, we proposed a general scheme for accomplishing both fault tolerance and high availability in a video server.The tradeoffs between memory buffer space and reduandant disk storage space are discussed. A video allocation problem based on the proposed scheme is formulated and heuristic algorithms to solve this problem is presented. Our scheme can be easily implemented in a highly available fault-tolerant video server.
Program comprehension risks and opportunities in extreme programming
Authors: Arie Deursen
Venue:  (2001)

We investigate the relationship between reverse engineering and program comprehension on the one hand, and software process on the other. To understand this relationship, we select one particular existing software process, extreme programming (XP), and study the role played in it by program comprehension and reverse engineering. To that end, we analyze five key XP practices in depth: pair programming, unit testing, refactoring, evolutionary design, and collaborative planning. The contributions of this paper are (1) the identification of promising research areas in the field of program comprehension; (2) the identification of new application perspectives for reverse engineering technology; (3) a critical analysis of XP resulting in research questions that could help resolve some of the uncertainties surrounding XP; (4) a process assessment framework for analyzing software processes from the comprehension and reverse engineering point of view.
Dynamic Adaptation of Sharing Granularity in DSM Systems
Authors: Ayal Itzkovitz, Nitzan Niv, Assaf Schuster
Venue: Proceedings of the 1999 International Conference on Parallel Processing (1999)

The tradeoff between false sharing elimination and aggregation in Distributed Shared Memory (DSM) systems has a major effect on their performance. Some studies in this area show that fine grain access is advantageous, while others advocate the use of large coherency units. One way to resolve the tradeoff is to dynamically adapt the granularity to the application memory access pattern.In this paper we propose a novel technique for implementing multiple sharing granularities over page based DSMs. We present protocols for efficient switching between small and large sharing units during runtime. We show that applications may benefit from adapting the memory sharing to the memory access pattern, using both coarse grain sharing and fine grain sharing interchangeably in different stages of the computation. Our experiments show a substantial improvement in the performance using adapted granularity level over using a fixed granularity level.
Boxed Economy Simulation: Platform and Foundation Model
Authors: Takashi Iba, Yohei Takabe, Yoshihide Chubachi, Yoshiyasu Takefuji
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

In this paper, we propose "Bozed Economy Simulation Platform", which is a sharableBasis for agent-based economic simulations.By providing the basic design of the socialModel, which we call " Bozed Economy Foundation Model", it enables collaborative research more efficiently.Sharing and cumulating the model components can be promoted by the domain-specific design at the level of social model rather than the levelof abstract general-purpose model.It will be able to contribute to remove factors that have been making difficult for social scientists to participate in and conduct agent-basedresearch.
An Efficient RPC Scheme in Mobile CORBA Environment
Authors: Lee Man Kei, Xiaohua Jia
Venue: Proceedings of the 2000 International Workshop on Parallel Processing (2000)

CORBA RPC calling in current mobile environment is suffering from poor performance and insufficient support of disconnection. This greatly degrades the reliability of services and upsets user expectation. To improve the reliability and performance and provide adequate support to involuntary disconnection of mobile clients, RPC Proxy is introduced in this paper. The impact of handoff and disconnection to the RPC Proxy would be discussed. The aim of this work is to improve the performance and reliability of CORBA RPC in mobile environment by minimizing slow and unstable wireless traffic.
FINESSE: a financial information spreadsheet
Authors: A. Varshney, A. Kaufman
Venue: Proceedings of the 1996 IEEE Symposium on Information Visualization (INFOVIS '96) (1996)

We outline a spreadsheet-based system for visualization of real-time financial information. Our system permits the user to define arithmetic and presentation relationships amongst the various cells of the spreadsheet. The cells contain primitives that can be numbers, text, images, functions and graphics. Presenting financial information in this format allows its intended clients, the financial analysts, to work in the familiar environment of a spreadsheet and allows them the flexibility afforded by the powerful interface of the spreadsheet paradigm. In addition, our system permits real-time visualization of the financial data stream allowing its user to visually trade the changing market trends in two and three dimensions.
Simulation of beam-column stability with automatic strain incrementation
Authors: J. Szalai, F. Papp
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

In Monte-Carlo simulation methods the deterministic procedures represents the real physical meaning of the system. The probabilistic behaviour is strongly connecting to the distributions of input random variables, but the accuracy of the certain calculations belongs to the correct physical meaning and accordingly to the deterministic procedure [9]. Nowadays the FEM is a plausible choice for analysing the response of a structure, but on the other hand a sufficiently correct non-linear FEM procedure can be time consuming what can not be allowed in Monte-Carlo method because of the great number of repetition. Another problem is that the deterministic procedure should be fully automatic for a wide range of problems that can occur during the simulation. The paper describes a strain based load incrementation technique for FEM, which handles all mentioned problems, works automatically, efficiently and reliably at a great amount of cases.
An Algebraic Characterization of First-Order Definability
Authors: A. J. Kfoury, M. Wymann-Boeni
Venue:  (1993)

Abstract We give a variable-free relational calculus which defines exactly all first-order definable relations in a arbitrary structure. We then show that, over an arbitrary class $\C$ of finite ordered structures with signature $\{ \LE, R_1, \ldots, R_\alpha \}$, the unary relations uniformly defined by this calculus over $\C$ are characterized by a another simplified variable-free calculus which we call $\Q$. $\Q$ is the least set of formal expressions such that: \begin{eqnarray*} \Q &\supseteq&\ \{ \varnothing, R_1,\ldots, R_\alpha \}\ \cup\\ & &\ \{ (Q\PLUS x)\ |\ Q\in\Q, x\in\omega \cup \{\infty\} \}\ \cup \ \{ (Q\MINUS x)\ |\ Q\in\Q, x\in\omega \cup \{\infty\} \}\ \cup \\ & &\ \{ (\NOT Q)\ |\ Q\in\Q\}\ \cup \ \{ (Q_1\AND Q_2)\ |\ Q_1,Q_2\in\Q\}\ \cup \ \{ (Q_1\OR Q_2)\ |\ Q_1,Q_2\in\Q\}\ .\ \end{eqnarray*} where $\PLUS$ and $\MINUS$ are ``shift'''' operators defined in Section 3. \end{abstract}
The Role Assignment Model Nearly Fits Most Social Networks
Authors: Pekec Aleksandar, Roberts Fred S.
Venue:  (1999)

Role assignments, introduced by Everett and Borgatti \cite{Everett91}, who called them role colorings, formalize the idea, arising in the theory of social networks, that individuals of the same social role will relate in the same way to individuals playing counterpart roles. If $G$ is a graph, a $k${\em -role assignment} is a surjective function mapping each vertex into a positive integer $1,2,\ldots,k$, so that if $x$ and $y$ have the same role, then the sets of roles assigned to their neighbors are the same. We show that all graphs $G$ having no astronomical discrepancies between the minimum and the maximum degree have a $k$-role assignment. Furthermore, we introduce and study a natural measure expressing how close an onto map $f:V(G)\rightarrow\{1,\ldots, k\}$ is to being a $k$-role assignment of a graph $G=(V,E)$, and show that almost all graphs nearly have a $k$-role assignment.
On Shape to Specifications Adequacy
Authors: Christian Minich
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

Computer Aided Design now aims to provide designers with a support during the early stages of design. The purpose is to translate the client's specifications into a shape as automatically as possible. However, the processing of a text in natural language is still out of reach. We then assume that the client's specifications are manually translated into intermediate specifications composed of intermediate constraints upon physical parameters. Our efforts concern the transformation of these intermediate specifications into a shape, precisely the way to compute whether a shape satisfies the intermediate specifications or not. We first study the case in which the shape is a single primitive solid; we shall also give elements to choose the instance that best fits the specifications. Then, we shall study the extension of the method to solids defined by a combination of primitive solids.
A proposal for indexing bitemporal databases via cooperative B/sup +/-trees
Authors: M. A. Nascimento, M. H. Dunham
Venue: Proceedings of the 1997 International Symposium on Database Engineering & Applications (1997)

We propose an indexing structure for bitemporal databases. Such structure is based on two trees, one indexing valid time and another indexing transaction time. The trees share pointers to the actual data records, which are thus not duplicated. Bitemporal queries are processed by dividing the query in two parts, a valid time part and a transaction time part. Each tree is searched according to these partial queries, and the answer is determined by the correct composition of the partial answers. We show how simple coordination of the tree searching, along with a simple assumption on the temporal data, improves query processing performance. The proposed structure also allows querying either time dimension, separately from the other one.
TCP-probing: towards an error control schema with energy and throughput performance gains
Authors: V. Tsaoussidis, H. Badr
Venue: Proceedings of the 2000 International Conference on Network Protocols (2000)

Today's universal communications increasingly involve mobile and battery-powered devices (e.g. hand-held, laptop) over wired and wireless networks. Energy efficiency as well as throughput, are becoming service characteristics of dominant importance in communication protocols. Although standard TCP versions lack the functionality to efficiently adjust their error-control strategies to distinct characteristics of network environments and to specific constraints of communicating devices, the wide range of TCP-based applications have rendered TCP the de facto standard for reliable end-to-end communications. In this work we propose "grafting" two components of strategic significance onto standard TCP: a probing mechanism and an immediate recovery strategy. Our results show that these enhancements yield higher throughput while maintaining lower levels of energy expenditure, and thus have the potential of promoting TCP's congestion control to a universal error control schema for heterogeneous wired/wireless channels. Furthermore, the enhancements do not damage the end-to-end characteristics of the TCP, nor do they require changes to its semantics: the mechanism are implemented as option extensions to the TCP header. We compare "TCP-probing" with Tahoe, Reno, and New Reno, and show that is can be a protocol of choice for heterogeneous wired/wireless communications with respect to energy and throughput performance.
MCSE Training Guide (70-270): Windows XP Professional
Authors: Gord Barker, Robert L. Bogue
Venue:  (2002)

:This complete learning package is a single source for authoritative preparation for Microsoft's challenging MCSE exam on Windows XP Professional (70-270). The authors present a systematic review of every key topic covered on the exam, including installation, administration, managing hardware, monitoring and optimizing system performance and reliability; configuring and troubleshooting the Windows XP desktop; managing and troubleshooting networking; optimizing security; and more. The authors are both Microsoft-certified Windows XP specialists and leading IT consultants, and all content in this book has been reviewed for both technical accuracy and clarity by a team of industry experts. The authors reinforce their comprehensive coverage with an extensive collection of exam tips, study strategies, and case studies; hands-on review exercises; guided practice exercises; summaries and review breaks in every chapter; and a complete practice exam. The accompanying CD-ROM contains an extensive library of additional test questions, delivered via the proven ExamGear testing software. It also contains a complete electronic copy of the book, enabling you to study anywhere you can bring a notebook computer.
Resolution and binary decision diagrams cannot simulate each other polynomially
Authors: Jan F Groote, Hans Zantema
Venue:  (2000)

There are many different ways of proving formulas in proposition logic. Many of these can easily be characterized as forms of resolution. Others use so-called binary decision diagrams (BDDs). Experimental evidence suggests that BDDs and resolution based techniques are fundamentally different, in the sense that their performance can differ very much on benchmarks. In this paper we confirm these findings by mathematical proof. We provide examples that are easy for BDDS and exponentially hard for any form of resolution, and vice versa, examples that ar easy for resolution and exponentially hard for BDDs.
Understanding email interaction increases organizational productivity
Authors: Thomas W. Jackson, Ray Dawson, Darren Wilson
Venue: Communications of the ACM (2003)

To minimize the effect of email interruption on employee productivity, limit the frequency of new-email alerts (silence them, too), make it easier to assess each message's importance, and remove the reply-to-all facility.
Computation of Equilibria in Noncooperative Games
Authors: Salman Azhar, Andrew McLennan, H J Reif
Venue:  (1991)

\indent This paper presents algorithms for finding equilibria of mixed strategy in multistage noncooperative games of incomplete information (like probabilistic blindfold chess, where at every opportunity a player can perform different moves with some probability). We assume that the game is either presented in normal form with information sets, or this can be constructed from the next move relationship by algebraic techniques. Our main result is an algorithm for computing {\em Sequential equilibrium}, which is the most widely accepted class of equilibrium (for mixed strategies of noncooperative probabilistic games) in mainstream economic game theory. Previously, there were no known algorithms for computing sequential equilibria strategies (except for the special case of single stage games). Given a recursively represented game, with a position space bound $S(n)$ and a log space computable next move relation, we can determine the existence of sequential equilibrium and compute an example mixed strategy satisfying the sequential equilibria condition, all in space bound $O(S(n)^{2})$. Furthermore, in space $O(S(n)^{3})$, we can compute the connected components of mixed strategies satisfying sequential equilibria.
Fastab: Solving the Pitch to Notation Problem
Authors: Jeremy I. Robin
Venue:  (2001)

I have always been frustrated with the length of time necessary to notate a piece of music. Computers have simplified so many other aspects of our lives, it seems that they should be able to simplify this task as well. In fact, there are already two distinct ways that engineers have attempted to attack this problem. The first analyzes the waveform generated by microphone input and relies on Fourier Analysis and other similar methods. The other examines the analog signal generated by a electric guitar-like pickup placed beneath the strings. The method used by Fastab relies much less on the musical properties of an instrument. Instead, Fastab records where and when the fingers and pick contact the instrument using digital electronics and microprocessor technology. Fastab provides a solution to the pitch to notation problem which is cheaper and more accurate than any other device available today. 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
SenToy: an affective sympathetic interface
Authors: Ana Paiva, Marco Costa, Ricardo Chaves, Moisés Piedade, Dário Mourão, Daniel Sobral, Kristina Höök, Gerd Andersson, Adrian Bullock
Venue: International Journal of Human-Computer Studies (2003)

We describe the design and implementation of SenToy: a tangible doll with sensors that allows a user to influence the emotions of a synthetic character in a game. SenToy is an input device that allows the user to perform gestures or movements that the sensors inside the doll pick up. The gestures are interpreted according to a scheme found through two different user studies: one Wizard of Oz study and one study with a fully functioning SenToy. Different gestures express one of the following emotions: anger, fear, surprise, sadness, gloating and happiness. Depending upon the expressed emotion, the synthetic character in the game will, in turn, perform different actions (trading, duelling, etc.). The evaluation of SenToy acting as the interface to the computer game Fantasy A has shown that the users were able to express the desired emotions to influence the synthetic characters, and that overall players liked the doll as an interface.
Learning implicit resource relationships from past plans in multi-agent systems
Authors: Toshiharu Sugawara, Satoshi Kurihara, Osamu Akashi
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

This paper discusses storing and analyzing the hierarchical planning results in the past in order to identify implicit costs and resource relationships between activities in multi-agent contexts.
A Statistical Sampler for a New On-line Analog Test Method
Authors: M. Negreiros, L. Carro, A. A. Susin
Venue: Proceedings of the Proceedings of The Eighth IEEE International On-Line Testing Workshop (IOLTW'02) (2002)

In this work a new strategy to the on-line test of analog circuits is presented. The technique presents a very low analog overhead and it is completely digital. For the System-on-Chip (SoC) environment, this allows the implementation of on-line test using processing power already present in the system. As all the signal processing is done in the digital domain, it allows use of a purely digital tester or a digital BIST technique. The main principle of operation is based on the observation of statistical properties of the circuit under test. Due to the low analog power and performance overhead, the proposed technique can be used to analyze the output ofseveral stages of complex analog systems without the use of switches or analog multiplexors, as no additional AD converter is needed. This paper presents the fundamentals of the proposed test method and some preliminary results concerning linear analog systems.
Efficient Dominating Sets in Cayley Graphs
Authors: Dejter Italo J., Serra Oriol
Venue:  (2000)

An independent set $C$ of vertices in a graph is an efficient dominating set when each vertex not in $C$ is adjacent to exactly one vertex in $C$. A countable family of nested graphs, each of which has at least one efficient dominating set, is produced for each real number in the unit interval [0,1]. These families range from star graphs, for which the efficient domination property was proved by Arumugam and Kala, to pancake graphs. The families obtained are extended to partitions of the vertex sets into efficient dominating sets. Uniqueness holds for the given partitions whenever the countable family is not that of the star graphs. For star graphs, all the possible ways in which such a partition occurs are established.
A New Upper Bound on Codes Decodable into Size-2 Lists
Authors: Ashikhmin A., Barg A., Litsyn S.
Venue:  (1999)

A new asymptotic upper bound on the size of binary codes with the property described in the title is derived. The proof relies on the properties of the distance distribution of binary codes established in earlier related works of the authors.