ppxscal/embedding_network huggingface dataset:
Hummingbirds Go Skiing: Using Wearable Computers to Support Social Interaction
Authors: Alexandra Weilenmann, Lars Erik Holmquist
Venue: Proceedings of the 3rd IEEE International Symposium on Wearable Computers (1999)

The Hummingbird is a wearable computer that aims to support communication in co-located groups of people, by giving users a continuous awareness of the physical presence (or absence) of others. To examine the effect on group communication, we performed a study where six ski instructors used the Hummingbirds during a five-day trip. The study showed that the Hummingbirds were used more as a support for informal social interaction than for the actual work activities of the test group. In subsequent focus group sessions, we saw a clear difference between instructors who had used the devices and those who had not, in that the first group gave many enthusiastic suggestions for improvements and new usage areas, whereas the second group had great difficulties in seeing any use for the devices at all.
Rule-Driven Coordination Agents: A Self-Configurable Agent Architecture for Distributed Control
Authors: M. Brian Blake
Venue: Proceedings of the Fifth International Symposium on Autonomous Decentralized Systems (2001)

The need for coordination among autonomous entities is common in dynamically changing domains. One such domain is the coordination of components in distributed component architectures. In these architectures, asynchronous communication is used to ensure autonomy. Management systems that control such architectures must respect this autonomy by decentralizing interaction policies and control. Middle agents [6] have been introduced as brokers or mediators in such dynamic settings. Rule-Driven Coordination (RDC) Agents are middle agents that act as brokers to the individual components in component architectures. These RDC agents encapsulate the interaction policy definition (rules) and the aspects of communication, data management, and policy execution. This paper defines each of these aforementioned aspects of the RDC agents. Furthermore, there is the use of RDC agents to manage a workflow of Java-based components in a typical electronic commerce domain.
Some remarks on direct execution computers
Authors: Hossam El-Halabi, Dharma P. Agrawal
Venue: ACM SIGARCH Computer Architecture News (1982)

As Direct-Execution Computers (D.E.C.s) are expected to reduce the semantic gap between the software and the hardware concepts to zero, they have been considered to be innovative in computer architecture. It is our objective to discuss this claim in the light of some major issues such as hardware technology, multilanguage environment, etc.
The p-Competition Graphs of Strongly Connected and Hamiltonian Digraphs
Authors: Larry Langley, J. R Lundgren, Patricia A. McKenna, Sarah K. Merz, Craig W. Rasmussen
Venue:  (1995)

Competition graphs were first introduced by Joel Cohen in the study of food webs and have since been extensively studied. Graphs which are the competition graph of a strongly connected or Hamiltonian digraph are of particular interest in applications to communication networks. It has been previously established that every graph without isolated vertices (except K2) which is the competition graph of a loopless digraph is also the competition graph of a strongly connected digraph. We establish an analogous result for one generalization of competition graphs, the p-competition graph. Furthermore, we establish some large classes of graphs, including trees, as the p-competition graph of a loopless Hamiltonian digraph and show that interval graphs on n<=4 vertices are the 2-competition graphs of loopless Hamiltonian digraphs.
A Framework for Dynamic Graph Drawing
Authors: R. F. Cohen, G. Battista, R. Tamassia, I.G.Tollis
Venue:  (1992)

Drawing graphs is an important problem that combines flavors of computational geometry and graph theory. Applications can be found in a variety of areas including circuit layout, network management, software engineering, and graphics. The main contributions of this paper can be summarized as follows: \begin{itemize} \item We devise a model for dynamic graph algorithms, based on performing queries and updates on an implicit representation of the drawing, and we show its applications. \item We present several efficient dynamic drawing algorithms for trees, series-parallel digraphs, {planar $st$-digraph} s, and planar graphs. These algorithms adopt a variety of representations (e.g., straight-line, polyline, visibility), and update the drawing in a smooth way. \end{itemize}
The Formal Specification of the Fieldbus Foundation Link Scheduler in E-LOTOS
Authors: N Petalidis, D. S. Gill
Venue: Proceedings of the Second IEEE International Conference on Formal Engineering Methods (1998)

This paper examines the applicability of the new specification language ELOTOS in the description of real time applications. E-LOTOS is the new extended version of LOTOS, currently under consideration by the ISO/IEC committee. The paper presents the complete process of producing the formal specification of a real time scheduler from its informal description. During this process, a semi-formal model of the scheduler is first built that helps identify the critical parts of the scheduler. This model is then used as the basis for the formal specification of the scheduler. Finally, the degree at which ELOTOS has succeeded in describing the critical parts of the scheduler is examined. The chosen, real life, paradigm is the Link Active Scheduler (LAS) of the Fieldbus Foundation (FF) Data Link Layer (DLL) protocol. Its formal specification has not been presented before.
Optimization and Parallelization of a Commodity Trade Model for the SP1, Using Parallel Programming Tools
Authors: Donna Bergmark, Marcia Pottle
Venue:  (1994)

We compare two different approaches to parallelization of Fortran programs. The first approach is to optimize the serial code so that it runs as fast as possible on a single processor, and then optimize the parallel version. In this paper a variety of parallel programming tools is used to obtain an optimal, parallel version of an economic policy modelling application for the IBM SP1. We apply a new technique called Data Access Normalization; we use an extended ParaScope as our parallel programming environment; we use FORGE 90 as our parallelizer; and we use KAP as our optimizer. We make a number of observations about the effectiveness of these tools. Both strategies obtain a working, parallel program, but use different tools to get there. On this occasion, both KAP and Data Access Normalization lead to the same critical transformation of inverting four of the twelve loop nests in the original program. The next most important optimization is parallel I/O, one of the few transformations that had to be done by hand. Speedups are obtained on the SP1 (using MPLp communication over the High Speed Switch). Keywords: multiprocessors, program transformations, parallel programming tools, data access normalization, ParaScope, Lambda Toolkit, Fortran, HPF, FORGE, SP1, SPMD, KAP, parallel I/O, PED LAMBDA, data parallel, loop distribution, loop fusion, trace analyzers
Hidden Markov Model Length Optimization for Handwriting Recognition Systems
Authors: Matthias Zimmermann, Horst Bunke
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

This paper investigates the use of three different schemes to optimize the number of states of linear left-to-right Hidden Markov Models (HMM). As the first method we describe the fixed length modeling scheme where each character model is assigned the same number of states. The second method considered is the Bakis length modeling where the number of model states is set to a given fraction of the average number of observations of the corresponding character. In the third length modeling scheme the number of model states is set to a specified quantile of the corresponding character length histogram. This method is called quantile length modeling. A comparison of the different length modeling schemes has been carried out with a handwriting recognition system using off-line images of cursively handwritten English words from the IAM database. For the fixed length modeling a recognition rate of 61% has beenachieved. Using Bakis or quantile length modeling the word recognition rates could be improved to over 69%.
Creating transient hypertextual access structures for C programs
Authors: J. Koskinen
Venue: Proceedings of the 7th Israeli Conference on Computer-Based Systems and Software Engineering (1996)

The paper describes how hypertextual access structures can be formed to support the maintenance of C programs. The access structures are formed automatically based on the HyperSoft model and method developed earlier. The automatic creation is based on syntactical fragmentation of program text and on relationships between these fragments. The access structures are transient, meaning that instead of storing them permanently they are created on user request. HyperSoft enables flexible navigation between the program parts which are relevant to a certain maintenance situation. The HyperSoft system currently supports C language and five access structures: occurrence lists for variables and functions, forward and backward calling dependence structures, intraprocedural backward slices, and interprocedural forward slices. Access structures are represented to the user as a set of highlighted nodes and graphical links on top of the original program text. The HyperSoft system has been developed in co-operation with the four largest software houses in Finland.
Microsoft Windows 2000 Security
Authors: Rashi Gupta
Venue:  (2002)

:Due to the necessity of instant communication and data transfer in today's business world, a secure computer network is critical. Security is not just your company's firewall. A more detailed strategy is needed to ward off threats from viruses, hackers, and unauthorized users. Microsoft Windows 2000 Security is your complete guide to system and network administration. It gives you the knowledge to maximize the benefits of the Microsoft Windows 2000 Advanced server to keep your network safe and gain a competitive edge! Start by learning the basics of Microsoft Windows 2000 security technologies and then move on to discovering the practical and real-life uses of this operating system. This book contains practice questions based on case studies so you can test your knowledge along the way and easily relate what you learn to your own working environment. Also included is a list of best practices and FAQs that you can immediately put to use to make your network more secure.
A Note on Natural Creative Sets and Goedel Numberings
Authors: Juris Hartmanis
Venue:  (1980)

Creative sets (or the complete recursively enumerable sets) play an important role in logic and mathematics and they are known to be recursively isomorphic. Therefore, on the one hand, all the creative sets can be viewed as equivalent, on the other hand, we intuitively perceive some creative sets as more ``natural and simpler'''' than others. In this note, we try to capture this intuitive concept precisely by defining a creative set to be natural if all other recursively enumerable sets can be reduced to it by computationally simple reductions and show that these natural creative sets are all isomorphic under the same type of computationally simple mappings. The same ideas are also applied to define natural Goedel numberings.
Derivation of a Maximally Parallel Algorithm for Balancing Binary Search Trees
Authors: Abha Moitra, S. S Iyengar
Venue:  (1984)

A recent trend in program methodologies is to derive efficient parallel programs from sequential programs. This paper explores the question of transforming a sequential algorithm into an efficient parallel algorithm by considering the problem of balancing binary search trees. The derivation of the parallel algorithm makes use of stepwise refinement. We first derive a new iterative balancing algorithm that exploits the similarity of pointer restructuring required at all the nodes at the same level. From this we derive a parallel algorithm that has time complexity O(1) on an $N$-processor configuration. This achieves the theoretical limit of speed-up possible in a multi-processor configuration.
Output-Sensitive Reporting of Disjoint Paths
Authors: Giuseppe D Battista, Roberto Tamassia, Luca Vismara
Venue:  (1996)

A $k$-path query on a graph consists of computing $k$ vertex-disjoint paths between two given vertices of the graph, whenever they exist. In this paper, we study the problem of performing $k$-path queries, with $k \leq 3$, in a graph $G$ with $n$ vertices. We denote with $\ell$ the total length of the paths reported. For $k \leq 3$, we present an optimal data structure for $G$ that uses $O(n)$ space and executes $k$-path queries in output-sensitive $O(\ell)$ time. For triconnected planar graphs, our results make use of a new combinatorial structure that plays the same role as bipolar ($st$) orientations for biconnected planar graphs. This combinatorial structure also yields an alternative construction of convex grid drawings of triconnected planar graphs.
A multicast protocol in multistage interconnection networks
Venue: Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks (1996)

Efficient collective communication among processor nodes is critical to the performance of massively parallel systems. A system-level multicast service in which the same message is delivered from a source node to an arbitrary number of destination nodes, is fundamental in supporting collective communication primitives including the application-level broadcast, reduction, and barrier synchronization. This paper addresses a hardware supported multicast in wormhole-routed multistage networks whose switches have multicast forwarding capability. In this protocol, the source node does not need to send the message to every destination, and any receiving node does not need to forward the message. The proposed multicast protocol can significantly reduce network traffic and transmission time. Moreover, this paper compares the broadcast performance of this protocol with that of two other multicast algorithms.
A Wavelet-Based Image Watermarking Scheme
Authors: Alessandra Lumini, Dario Maio
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

With the coming and the expansion of the World Wide Web an increased amount of digital information, become available to a large number of people. Since the digital network is often used to offer digital media for profit, there is a strong need for copyright protection and a considerable interest in methods for inserting in a multimedia document an invisible mark to identify the owner. Such ¿digital signature¿, also called ¿watermark¿, can be used to identify the document owner, to discourage unauthorized document copying and distribution, and, possibly, to earn royalties.A wavelet-based image-watermarking scheme is proposed in this work, based on the insertion of pseudo-random codes in the frequency domain. The watermark, consisting of a sequence of pseudo-random numbers normally distributed, is embedded into most perceptually significant coefficients of the frequency domain. The scheme is private, that is the original image is required for the watermark detection.In order to optimize the tradeoff between robustness and imperceptibility of the watermark, the ¿strength¿ of the signature to be embedded depends on the image to be marked, thus fitting its perceptual capacity. The insertion procedure scales the watermark differently from one image to another: that means to add more watermark energy inside detailed images, where slight modifications do not reduce image fidelity, and vice versa to decrease the watermark energy in homogeneous images, characterized by large regions with few color variations. The experimental results prove that the method is more tamper resistant and less perceptible than other well-known private methods in the frequency domains. Moreover, the proposed method is able to cast watermarks in any kind of image, included cartoon images, which are characterized by a very low perceptual capacity, and thus allow only a little information to be hidden.
Programming ASP.NET, 2 edition
Authors: Jesse Liberty, Dan Hurwitz
Venue:  (2003)

:ASP.NET is the successor technology to Active Server Pages (ASP), the world's most successful development environment for building server-side web applications. ASP.NET leverages the power of Microsoft's new .NET platform to allow you to write dynamic, data-driven applications that run over the World Wide Web. In Programming ASP.NET, Jesse Liberty and Dan Hurwitz teach you everything you need to know to write web applications and web service. The book focuses on ASP.NET development using both C# and Visual Basic .NET, and coding examples are presented in both languages. Programming ASP.NET includes a detailed tutorial on Web Forms, which, in conjunction with Visual Studio .NET, allow you to apply Rapid Application Development techniques (including drag-and-drop control placement) to web development. Programming ASP.NET includes extensive coverage of each type of server control, including web server controls, HTML server controls, and custom controls. Since most web applications and web services involve retrieving data and returning it to a client browser, Programming ASP.NET also offers extensive coverage of data access issues. These include topics such as using ASP.NET's list-bound controls, accessing data using the ADO.NET object model, and updating data with or without transaction support.
Experiments in Automatic Phrase Indexing For Document Retrieval: A Comparison of Syntactic and Non-Syntactic Methods
Authors: Joel L Fagan
Venue:  (1987)

In order for an automatic information retrieval system to effectively retrieve documents related to a given subject area, the content of each document in the system''s database must be represented accurately. This study examines the hypothesis that better representations of document content can be constructed if the content analysis method takes into consideration the syntactic structure of document and query texts. Two methods of automatically generating phrases for use as content indicators have been implemented and tested experimentally. The non-syntactic (or statistical) method is based on simple text characteristics such as word frequency and the proximity of words in text. The syntactic method uses augmented phrase structure rules (production rules) to selectively extract phrases from parse trees generated by an automatic syntactic analyzer. Experimental results show that the effect of non-syntactic phrase indexing is inconsistent. For the five collections tested, increases in average precision ranged from 22.7% to 2.2% over simple, single term indexing. The syntactic phrase indexing method was tested on two collections. Precision figures averaged over all test queries indicate that non-syntactic phrase indexing performs significantly better than syntactic phrase indexing for one collection, but that the difference is insignificant for the other collection. More detailed analysis of individual queries, however, indicates that the performance of both methods is highly variable, and that there is evidence that syntax-based indexing has certain benefits not available with the non-syntactic approach. Possible improvements of both methods of phrase indexing are considered. It is concluded that the prospects for improving the syntax-based approach to document indexing are better than for the non-syntactic approach. The PLNLP system was used for syntactic analysis of document and query texts, and for implementing the syntax-based phrase construction rules. The SMART information retrieval system was used for retrieval experimentation.
System Synthesis of Synchronous Multimedia Applications
Authors: Gang Qu, Malena Mesarina, Miodrag Potkonjak
Venue: Proceedings of the 12th international symposium on System synthesis (1999)

Modern system design is being increasingly driven by applications such as multimedia and wireless sensing and communications, which all have intrinsic quality of service (QoS) requirements, such as throughput, error-rate, and resolution. One of the most crucial QoS guarantees that the system has to provide is the timing constraints among the interacting media (synchronization) and within each media (latency). We have developed the first framework for systems design with timing QoS guarantees, latency and synchronization. In particular, we address how to design system-on-chip with minimal silicon area to meet timing constraints. We propose the two-phase design methodology. In the first phase, we select an architecture which facilitates the needs of synchronous low latency applications well. In the second phase, for a given processor configuration, we use our new scheduler in such a way that storage requirements are minimized. We have develop scheduling algorithms that solve the problem optimally for a-priori specified applications. The algorithms have been implemented and their effectiveness demonstrated on a set of simulated MPEG streams from popular movies.
Analytical and numerical results for feedback based flow control of B-ISDN/ATM networks with significant propagation delays
Authors: R. Pazhyannur, R. Agrawal
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2 (1995)

We consider a system comprising of a single bottleneck node fed by multiple Markov modulated fluid sources each of which is policed by a corresponding access regulator that marks all excess traffic as well as drops some of the excess traffic. The amount of excess traffic released is varied dynamically based on delayed feedback from the bottleneck. We present analytical and numerical results for this model that allow us to study the role of delayed feedback vis-a-vis certain time constants and traffic parameters associated with the system. In particular we show that even for a large propagation delay such as that required for the length of the continental USA the feedback policy is more effective, though the relative improvement of the feedback policy decreases as the delay increases. We also find that the feedback policy is most effective when the sources are moderately bursty.
Monte Carlo Study of the Random-field Ising Model
Authors: M. E. J. Newman, G. T. Barkema
Venue:  (1995)

Using a cluster-flipping Monte Carlo algorithm combined with a generalization of the histogram reweighting scheme of Ferrenberg and Swendsen, we have studied the equilibrium properties of the thermal random-field Ising model on a cubic lattice in three dimensions. We have equilibrated systems of L x L x L spins, with values of L up to 32, and for these systems the cluster-flipping method appears to a large extent to overcome the slow equilibration seen in single-spin-flip methods. From the results of our simulations we have extracted values for the critical exponents and the critical temperature and randomness of the model by finite size scaling. For the exponents we find v=1.02 +0.06, B=0.06 +0.07, y=1.9 +0.2, and mean(y)=2.9 +0.2.
Packing Messages as a Tool for Boosting the Performance of Total Ordering Protocols
Authors: Roy Friedman, Robbert van Renesse
Venue:  (1995)

This paper compares the throughput and latency of four protocols that provide total ordering. Two of these protocols are measured with and without message packing. We used a technique that buffers application messages for a short period of time before sending them, so more messages are packed together. The main conclusion of this comparison is that message packing influences the performance of total ordering protocols under high load overwhelmingly more than any other optimization that was checked in this paper, both in terms of throughput and latency. This improved performance is attributed to the fact that packing messages reduces the header overhead for messages, the contention on the network, and the load on the receiving CPUs.