ppxscal/embedding_network huggingface dataset:
Multi-Coloured Hamilton Cycles in Random Edge-Coloured Graphs
Authors: Colin Cooper, Alan Frieze
Venue: Combinatorics, Probability and Computing (2002)

We define a space of random edge-coloured graphs &Gscr;n,m,&kappa; which correspond naturally to edge &kappa;-colourings of Gn,m. We show that there exist constants K0, K1 &le; 21 such that, provided m &ge; K0n log n and &kappa; &ge; K1n, then a random edge-coloured graph contains a multi-coloured Hamilton cycle with probability tending to 1 as the number of vertices n tends to infinity.
Can Ada replace FORTRAN for numerical computation?
Authors: Alfred H. Morris
Venue: ACM SIGPLAN Notices (1981)

In July 1980, the proposed final form of the Ada programming language was released by the U.S. Department of Defense [1]. Even though Ada was not designed specifically for general numeric scientific computation, nevertheless the question arises to whether it is appropriate for this purpose. This question can best be answered by consideration of the following question: Is Ada a suitable replacement for the programming language FORTRAN? This paper discusses those constructs of Ada which are pertinent to the matter and are considered defective. It is noted that the array defects are exceptionally critical, not providing needed capabilities that exist in FORTRAN and have been extensively used for a quarter century.
Anticipating interactivity: Henry Cowell and the Rhythmicon
Authors: Margaret Schedel
Venue: Organised Sound (2002)

In the early 1930s, maverick composer Henry Cowell collaborated with inventor Leon Theremin to build an electronic instrument capable of producing intricate polyrhythms. This instrument, dubbed the Rhythmicon, can be considered a rudimentary example of an interactive music system. Cowell and Theremin created the machine to fulfil a compositional need, but it ultimately failed to become a successful musical instrument. The Rhythmicon was one of the first electronic music instruments to use technology to extend performers' musical capacities, anticipating the interactive computer music movement by several decades. Despite its shortcomings, the Rhythmicon should be remembered as an important step on the road to interactivity.
Dynamic reallocation of capacity in logically fully-connected networks
Authors: B. A. Chiera
Venue: International Journal of Network Management (2004)

We study the benefits that can be realised when capacity reallocation schemes are implemented in telecommunications networks. Our basic model consists of a (possibly sparse) physical network above which is overlaid a logically fully-connected network. This is achieved by reserving capacity on the physical links for exclusive use by each origin-destination pair. If the capacity allocated to the origin-destination pairs is fixed, then such a network is likely to produce poor performance due to restriction of multiplexing opportunities. However, this effect can be largely negated by employing a capacity reallocation scheme, where capacity is moved in a dynamic fashion to areas where congestion is occurring. For such a scheme to be scalable, it is essential that it be distributed in nature. In this paper, we present three distributed, dynamic capacity reallocation schemes and compare their performance using a simulation model.
SynchNet: a Petri net based coordination language for distributed objects
Authors: Reza Ziaei, Gul Agha
Venue: Proceedings of the 2nd international conference on Generative programming and component engineering (2003)

We present SynchNet, a compositional meta-level language for coordination of distributed. Its design is based on the principle of separation of concerns, namely separation of the coordination from computational aspects. SynchNet can be used in combination with any object-based language capable of expressing sequential behavior of objects. SynchNet, which is inspired by Petri nets, has a simple syntax and semantics, but is expressive enough to code many of the commonly used coordination patterns. The level of abstraction that it provides allows tools and techniques developed for Petri nets to be readily applied to analysis and verification of the specified coordination patterns.
Some relationships between delay testing and stuck-open testing in CMOS circuits
Authors: R. David, S. Rahal, J. L. Rainard
Venue: Proceedings of the conference on European design automation (1990)

Various kinds of faults must be tested in CMOS circuits. Testing of an excessive delay as well as testing of a stuck-open fault requires a sequence of two successive input vectors. It has been observed by many authors that there are some similarities between delay testing and stuck-open testing. In this paper it is shown that if all the delay faults have been robustly tested in a combinational circuit, then all the stuck-open faults have been robustly tested too.
Correctness of Multiconnected Report Documents in Automatic Information Control Systems with a Nonlinear Compromise Scheme
Authors: K. S. Zaitsev, V. V. Pleikis
Venue: Automation and Remote Control (2004)

Multiconnected table-type documents are structured for designing a document packet model that is stable to structural and parametric perturbations. Analysis of documents is reduced to multicriteria optimization under uncertainty. A decision making support for processing data on report documents is developed using a nonlinear scheme of compromise between particular optimization criteria. This approach aids in analyzing documents with badly defined information.
Send-receive considered harmful: Myths and realities of message passing
Authors: Sergei Gorlatch
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (2004)

During the software crisis of the 1960s, Dijkstra's famous thesis "goto considered harmful" paved the way for structured programming. This short communication suggests that many current difficulties of parallel programming based on message passing are caused by poorly structured communication, which is a consequence of using low-level send-receive primitives. We argue that, like goto in sequential programs, send-receive should be avoided as far as possible and replaced by collective operations in the setting of message passing. We dispute some widely held opinions about the apparent superiority of pairwise communication over collective communication and present substantial theoretical and empirical evidence to the contrary in the context of MPI (Message Passing Interface).
Light-weight xPath processing of XML stream with deterministic automata
Authors: Makoto Onizuka
Venue: Proceedings of the twelfth international conference on Information and knowledge management (2003)

Several applications based on XML stream processing have recently emerged, such as those for air traffic control and the selective dissemination of information (SDI). Their common need is to process a large number of XPath expressions in continuous XML streams at high throughput.This paper proposes four techniques for XPath expression processing based on Deterministic Finite Automata (DFA) for two purposes: to improve the memory usage efficiency of the automata and to support the processing of branching XPath expressions. The first technique, called n-DFA, clusters the given XPath expressions into n clusters to reduce the number of DFA states. The second, called shared NFA state table, lets the Non-Deterministic Finite Automata (NFA) state set be shared among the DFA states. Our experiments show that memory usage in an 8-DFA can, with the shared NFA state table, be reduced to 1/40th that of the original 1-DFA. The optimized NFA conversion and general XPath expression processing algorithm techniques contribute to the processing of branching XPath expressions efficiently; overall performance is better than is possible with earlier approaches.
Hyperscore: A Graphical Sketchpad for Novice Composers
Authors: Morwaread M. Farbood, Egon Pasztor, Kevin Jennings
Venue: IEEE Computer Graphics and Applications (2004)

The Hyperscore graphical computer-assisted composition system for users with limited or no musical training takes freehand drawing as input, letting users literally sketch their pieces.
Managing Security Policy in a Large Distributed Web Services Environment
Authors: Symon Chang, Qiming Chen, Meichun Hsu
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

Effectively managing security policies in a largedistributed Web Services environment is the key tosecure e-business transactions. Security policy mustensure the end-to-end agreement for many-to-manyinteroperation; ensure the versioning interoperabilityand privacy of collaborating partners; and ensurethe dynamic establishment of security policies becauseany statically defined security policy tends to beunsecured after a certain period of time. The traditionalsecurity policy configuration mechanisms, eitherthe local configuration mechanism or the centralizedconfiguration mechanism, cannot fully meet theabove requirements.In this paper we describe a solution for managingsecurity policies in a collaborative Web Services environment.This solution is based on ebXML CPP/CPAmodel and uses Interoperability Contract Document(ICD). It allows the collaboration parties to establishsecurity policy dynamically for each individual interoperation;makes the selected policy confidential; andaddresses the software, message, and policy versioningand interoperability issues. Our experience revealsthe advantages of this approach over others.
Towards a new distributed programming environment (CORDS)
Authors: Jacob Slonim, Patrick Finnigan, Alberto Mendelson, Toby Teorey, Michael Bauer, Paul Larson, Richard McBride, Yechiam Yemini, Shaula Yemini
Venue: Proceedings of the 1991 conference of the Centre for Advanced Studies on Collaborative research (1991)

The main objective of the proposed research described here is to create a prototype environment for developing and managing distributed applications. Its specific focuses are: building extensions to third-generation languages to exploit the process model; developing a new high-level language based on the process model; designing new techniques for recovery and network transport abstractions; network management techniques for distributed applications; modelling and analysis of distributed systems; integration of transaction, database and directory services to support distributed applications; distributed debugging; and visualization of distributed applications. The environment is to be built upon existing platforms, such as X-windows, Motif, Open Software Foundation's Distributed Computing Environment (OSF/DCE), ISO Open Systems Interconnect (ISO/OSI), Systems Application Architecture (SAA). This collaborative research brings together experts in different areas of computer science and the technologies and tools developed will be experimentally validated through the construction of distributed applications operating across the member sites.
Personal and situational factors as predictors of end user performance
Authors: I. M. Jawahar
Venue: Advanced topics in end user computing (2003)

End-user computing (EUC) has the potential to enhance productivity. However, for this potential to be realized, end users must learn EUC skills and perform at high levels. Because of the significance of end user performance to organizations, it is important to uncover factors that influence end user performance. However, prior research has relied almost exclusively on person factors to predict end user performance even though several models suggest that both person and situational factors influence behavior and performance. This limitation of previous research was overcome by examining the influence of both person and situational factors on end user performance. The three person factors and four situational factors investigated in this study, together, explained almost 40% of the variance in end user performance. Suggestions to enhance end user performance are offered, and directions for future research are discussed.
COTS Characterization Model in a COTS-Based Development Environment
Authors: Sihem Ben Sassi, Lamia Labed Jilani, Henda Hajjami Ben Ghezala
Venue: Proceedings of the Tenth Asia-Pacific Software Engineering Conference Software Engineering Conference (2003)

Commercial Off-The-Shelf (COTS) components aremore and more used in the new applications development.They promise to reduce cost and risks, and to ensuresoftware higher quality. However, in practice, manyproblems are faced during the evaluation, selection andintegration. Major causes of these problems are due tothe lack of knowledge about COTS products, the ignoranceof the available methods of evaluation, selection andintegration, and the lack of guidance for choosingbetween these methods. Therefore, a COTS-baseddevelopment environment (CBDE) turns out to beessential. In this perspective, this paper proposes a surveyof COTS characterizations and proposes an extendedmodel. The use of these attributes in a CBDE is specifiedby a scenario denoted by a multi-model process known asmap formalism. The same development process is thenillustrated with a map scenario focusing on the differenttypes of selection / integration existing methods.
Optimizing the Observation Windows Size for Kernel Attack Signatures
Authors: William S. Harrison, Axel W. Krings, Nadine Hanebutte
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 7 - Volume 7 (2004)

In this paper we introduce a signature-based intrusion detection methodology which utilizes low-level kernel data in order to identify network attacks in real time. Different types of attacks have different behavior characteristics over time, and thus require observation intervals of different length to clearly identify attack data within a network data stream. Our technique involves a pseudo-continuous stream of network kernel data that is processed in order to identify attacks. An additional advantage of a pseudo-continuous system is that it allows dynamic adjustment to account for varying levels of network load. This allows a higher precision and lower false positive rate than in a fixed-interval system because only the data needed for identification is compared to the stored signature. Further, response time is near-immediate as only the minimum data needed in order to detect the attack must be sampled.
Masking of Unknown Output Values during Output Response Compression byUsing Comparison Units
Authors: Irith Pomeranz, Sandip Kundu, Sudhakar M. Reddy
Venue: IEEE Transactions on Computers (2004)

Abstract--A circuit may produce unknown output values during simulation of a test set, e.g., due to an unknown initial state or due to the existence of tristate elements. Unknown output values in the output response of a circuit make it impossible to determine a single unique signature for the fault-free circuit when built-in self-test is used for testing the circuit. We consider the problem of synthesizing a logic block that replaces unknown output values in the output response of a circuit with a known constant. The logic block is constructed from building blocks called comparison units. The synthesis procedure ensures that the built-in self-test scheme will be able to detect all the faults detectable by the test set applied to the circuit while allowing a single unique signature to be computed. Two variations of the synthesis procedure are considered, a two-dimensional version suitable for synchronous sequential circuits without scan and for scan circuits with multiple scan chains and a one-dimensional version suitable for scan circuits with a single scan chain.
Bluetooth and sensor networks: a reality check
Authors: Martin Leopold, Mads Bondo Dydensborg, Philippe Bonnet
Venue: Proceedings of the 1st international conference on Embedded networked sensor systems (2003)

The current generation of sensor nodes rely on commodity components. The choice of the radio is particularly important as it impacts not only energy consumption but also software design (e.g., network self-assembly, multihop routing and in-network processing). Bluetooth is one of the most popular commodity radios for wireless devices. As a representative of the frequency hopping spread spectrum radios, it is a natural alternative to broadcast radios in the context of sensor networks. The question is whether Bluetooth can be a viable alternative in practice. In this paper, we report our experience using Bluetooth for the sensor network regime. We describe our tiny Bluetooth stack that allows TinyOS applications to run on Bluetooth-based sensor nodes, we present a multihop network assembly procedure that leverages Bluetooth's device discovery protocol, and we discuss how Bluetooth favorably impacts in-network query processing. Our results show that despite obvious limitations the Bluetooth sensor nodes we studied exhibit interesting properties, such as a good energy per bit sent ratio. This reality check underlies the limitations and some promises of Bluetooth for the sensor network regime.
Toward an integrative model of application-software security
Authors: Vijay V. Raghavan
Venue: Practicing software engineering in the 21st century (2003)

Populist approaches to studying information systems security include architectural, infrastructure-related and system-level security. This study focuses on software security implemented and monitored during systems development and implementation stages. Moving away from the past checklist methods of studying software security, this study provides a model that could be used in categorizing checklists into meaningful clusters. Many constructs, such as principle of least privilege, execution monitoring, social engineering and formalism and pragmatism in security implementations, are identified in the model. The identification of useful constructs to study can form the basis of evaluating security in software systems as well as provide guidelines of implementing security in new systems developed.
Mesh Simplification with Hierarchical Shape Analysis and Iterative Edge Contraction
Authors: Jingqi Yan, Pengfei Shi, David Zhang
Venue: IEEE Transactions on Visualization and Computer Graphics (2004)

Abstract--This paper presents a novel mesh simplification algorithm. It decouples the simplification process into two phases: shape analysis and edge contraction. In the analysis phase, it imposes a hierarchical structure on a surface mesh by uniform hierarchical partitioning, marks the importance of each vertex in the hierarchical structure, and determines the affected regions of each vertex at the hierarchical levels. In the contraction phase, it also divides the simplification procedure into two steps: half-edge contraction and optimization. In the first step, memoryless quadric metric error and the importance of vertices in the hierarchical structure are combined to determine one operation of half-edge contraction. In the second step, it repositions the vertices in the half-edge simplified mesh by minimizing the multilevel synthesized quadric error on the corresponding affected regions from the immediately local to the more global. The experiments illustrate the competitive results.
XML and Computational Science
Authors: George K. Thiruvathukal, David Beazley
Venue: Computing in Science and Engineering (2004)

In this first article in a series about XML in computational science, I present some background and lightweight examples of XML usage, describe some XML component frameworks along with their purpose and applicability to computational science, and describe some technical obstacles to overcome for the language to be taken seriously in computational science.
Coordinating Mechanisms in Care Provider Groups: Relational Coordination as a Mediator and Input Uncertainty as a Moderator of Performance Effects
Authors: Jody Hoffer Gittell
Venue: Management Science (2002)

This paper proposes a model of how coordinating mechanisms work, and tests it in the context of patient care. Consistent with organization design theory, the performance effects of boundary spanners and team meetings were mediated by relational coordination, a communication- and relationship-intensive form of coordination. Contrary to organization design theory, however, the performance effects of routines were also mediated by relational coordination. Rather than serving as areplacement for interactions, as anticipated by organization design theory, routines work byenhancing interactions among participants. Likewise, all three coordinating mechanisms, including routines, were found to be increasingly effective under conditions of uncertainty.
Unifying Static and Dynamic Approaches to Evolution through the Compliant Systems Architecture
Authors: Katrina Falkner, Henry Detmold, Diana Howard, David S. Munro, Ron Morrison, Stuart Norcross
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 9 - Volume 9 (2004)

Support for evolution can be classified as static or dynamic. Static evolvability is principally concerned with structuring systems as separated abstractions. Dynamic evolvability is concerned with the means by which change is effected. Dynamic evolution provides the requisite flexibility for application evolution, however, the dynamic approach is not scalable in the absence of static measures to achieve separation of abstractions. This separation comesat a price in that issues of concern become trapped within static abstraction boundaries, thereby inhibiting dynamic evolution.The need for a unified approach has long been recognised but existing systems that attempt to address this need do so in an ad-hoc manner. The principal reason for this is that these approaches fail to resolve the incongruence in the underlying models. Our contention is that this disparity is incidental rather than fundamental to the problem. To this end we propose an alternative model based on the Compliant Systems Architecture (CSA), a structuring methodology for constructing software systems.The overriding benefit of this work is increased flexibility. Specifically our contribution is an instantiation of the CSA that supports unified static and dynamic evolution techniques. Our model is explored through a worked example in which we evolve an application's concurrency model.
A Stochastic Negotiation Model for Organizational Choice
Authors: Siva Sankaran, Tung Bui
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 1 - Volume 1 (2004)

Traditional group negotiation has focused largely on human conduct with regard to large and generally isolated problems such as procurement and claim settlements. Once the negotiation is accomplished, the process usually attains closure and is quickly forgotten or the long-term impacts of the outcome are often ignored. In organizations, however, decisions involving gives and takes are also made on a continuous basis in that there is a ripple effect in thesequential nature of decision making. When lengthy periods are involved, the organizational contexts can change significantly. Hence, methods useful to a "one-shot" bargaining strategy may neither be applicable nor effective. Furthermore, when organizations face consequences of their own past decisions as well as that of external random events, it is hard to predict where the organization will be at a future time. In this research, we postulate that organizations evolve from one state to another following a probabilistic transition pattern than totally random. Considered this way, organizations can be modeled using sequential Markov chains having a tendency to achieve homeostasis. Understanding organizational behavior in this perspective can be greatly beneficial to negotiators by enabling them to accept short term losses in favor of the larger and better payoffs that are to come.