ppxscal/embedding_network huggingface dataset:
Coverage Analysis for Message Flows
Authors: Netta Aizenbud-Reshef
Venue: Proceedings of the 12th International Symposium on Software Reliability Engineering (2001)

Application messaging focuses on enabling integration, linking and extension of business applications.This focus has led to intelligent middleware development that encompasses a modular, plug and play components approach to providing an open message broker framework.A message broker is a value added application-to-application middleware services that comprises one or more software facilities.It is capable of one-to-many, many-to-one and many-to-many message distribution.A message broker further enables one to decompose information transformation and routing requirements info message flows, which are a series of stepwise operations that can be connected using visual composition tools.A message flow is a new programming paradigm that supports message transformation, database integration, message warehousing, and message routing.In this paper we introduce the message flow concept and its execution model.Next, we concentrate on the definition of test adequacy criteria suitable for message flows and the description of a coverage analysis tool, based on the defined coverage criteria.The coverage analysis tool collects execution details from trace files, analyzes them and presents the coverage results to the user in an intuitive manner, both visually and textually.
International Comparative Study of Identity as Presented on the Internet
Authors: Saeko Nomura, Toru Ishida, Makoto Yokozawa
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

The objective of this study is to explore the cultural differences that appear in terms of Web usage.We examined the homepages of 987 individuals of homogeneous social standings from Japan, the United States, Germany and South Korea.The contents of the homepages, such as academic backgrounds, research outcomes and personal information, were found to exhibit interesting differences.Subjects in the United States are more likely to express the identity of researchers' aspect, Japanese their whole personal identities and Koreans social status.Professors from Germany tend to use prepared templates and do not offer muchinformation on their homepages.
ATPG for Path Delay Faults without Path Enumeration
Venue: Proceedings of the 2nd International Symposium on Quality Electronic Design (2001)

We present a new ATPG methodology for detecting path delay faults in combinational circuits. The proposed approach is non-enumerative and generates a small number of test patterns with high fault coverage. A new ATPG framework for path delay faults is introduced; it collapses the two phases (path sensitization and line justification) of traditional ATPGs into one. The proposed framework utilizes both structural and functional techniques. A BDD-based implementation and experimentation with the ISCAS'85 benchmarks shows that the proposed method outperforms all ATPG methods that bound the test set. The results also show that the approach is comparable to existing ATPG methods that do not bound the test set.
The Finite Volume Element Method For Elliptic and Parabollic Equations
Authors: Thomas F. Russell, Rick V. Trujillo
Venue:  (1996)

An error analysis of the finite volume element method for elliptic and parabolic partial differential equations is presented. Existing results apply to discretizations of steady diffusion equations by linear finite elements. These results are extended to steady and transient advection-reaction-diffusion equations and are generalized to polynomial finite elements of arbitrary order. Optimal-order error estimates are derived in a discrete H1 norm, under minimal regularity assumptions for the exact solution, the finite element triangulation, and the finite volume construction. With additional uniformity assumptions for the finite volumes, H1 superconvergence results are obtained for linear finite elements.
Distributed Virtual Malls on the World Wide Web
Authors: Arun Iyengar, Daniel Dias
Venue: Proceedings of the The 18th International Conference on Distributed Computing Systems (1998)

Virtual malls allow consumers to shop and purchase products on the World Wide Web from multiple stores. This paper presents a virtual mall in which stores may be distributed across multiple Web sites. Stores participate in the virtual mall by communicating with a mall coordinator. The virtual mall allows shoppers to perform actions across multiple stores simultaneously such as viewing product availability. Multiple purchases across different stores can be coordinated using multi-phase commits. The mall coordinator can authenticate clients on all stores participating in the virtual mall while only requiring clients to provide authentication information once. State information is preserved using dynamic argument embedding which is compatible with all browsers and servers supporting HTTP and is less obtrusive than cookies. The distributed virtual mall concept and infrastructure can be applied to other distributed electronic commerce applications on the Web.
A New Mechanism for Congestion and Deadlock Resolution
Authors: Yong Ho Song, Timothy Mark Pinkston
Venue: Proceedings of the 2002 International Conference on Parallel Processing (2002)

Efficient and reliable communication is essential for achieving high performance in a networked computing environment. Limited network resources bring about unavoidable competition among in-flight packets, resulting in network congestion and, possibly, deadlock. Many techniques have been proposed to improve performance by efficiently handling network congestion and deadlock. However, none of them provide an efficient way of accelerating the movement of packets involved in congestion onward to their destinations. In this paper, we propose a new mechanism for the detection and resolution of network congestion and deadlocks. The proposed mechanism is based on increasing the scheduling priority of packets involved in congestion and providing necessary resources for those packets to make forward progress. Simulation results show that the proposed technique outperforms previously proposed techniques by effectively dispersing network congestion.
Managing the managers: collaborative virtual teams with large staff and student numbers
Authors: Kathy Egea
Venue: Proceedings of the fifth Australasian conference on Computing education - Volume 20 (2003)

Virtual teaming involving online presentations and peer reviews support the notion of collaborative student learning, whilst preparing them for the virtual work environment. However, implementation and administration of such teams, particularly when constraints include large numbers of multicultural students, within a complex multi-campus structure, needs careful planning and management.This paper discusses the implementation features of an in-house dynamic web administrative package designed, in part to address the problem of management within a complex teaching environment, of assessment processes requiring virtual teams activities. An essential component of the teamwork is that students collaborate as small teams, and virtually interact with several other small teams. For some students, the study environment is totally virtual, for others face-to-face contact is usual. The web application also provide virtual management tool for the geographically disburse multi-campus staff. The paper discusses the achievements and the limitations of the current implementation, and finally future developments for the program design.
Distributed Component-Based Tailorability for CSCW Applications
Authors: Oliver Stiemerling, Ralph Hinken, Armin B. Cremers
Venue: Proceedings of the The Fourth International Symposium on Autonomous Decentralized Systems (1999)

Tailorability is generally regarded as a key property of groupware systems due to the dynamics and diversity of cooperative work. This article investigates the use of software components as a generic architectural concept for designing tailorable groupware applications. First, the issues raised by this approach are discussed. The results of a first exploratory experiment led us to concentrate on the support of distributed tailorable CSCW applications. We discuss the question of an appropriate component model and develop requirements for a platform for the flexible deployment of distributed component-based applications. As a consequence of these reflections, we have developed the FLEXIBEANS component model and the EVOLVE platform whose design principles are described. Furthermore, an application example using the approach to design a tailorable distributed coordination tool is given. Finally, we summarize and propose venues of further research.
DISE: a programmable macro engine for customizing applications
Authors: Marc L. Corliss, E. Christopher Lewis, Amir Roth
Venue: Proceedings of the 30th annual international symposium on Computer architecture (2003)

Dynamic Instruction Stream Editing (DISE) is a cooperative software-hardware scheme for efficiently adding customization functionality---e.g, safety/security checking, profiling, dynamic code decompression, and dynamic optimization---to an application. In DISE, application customization functions (ACFs) are formulated as rules for macro-expanding certain instructions into parameterized instruction sequences. The processor executes the rules on the fetched instructions, feeding the execution engine an instruction stream that contains ACF code. Dynamic instruction macro-expansion is widely used in many of today's processors to convert a complex ISA to an easier-to-execute, finer-grained internal form. DISE co-opts this technology and adds a programming interface to it.DISE unifies the implementation of a large class of ACFs that would otherwise require either special-purpose hardware widgets or static binary rewriting. We show DISE implementations of two ACFs---memory fault isolation and dynamic code decompression---and their composition. Simulation shows that DISE ACFs have better performance than their software counterparts, and more flexibility (which sometimes translates into performance) than hardware implementations.
Process model reuse support-the OPSIS approach
Authors: D. Avrilionis, P.-Y. Cunin
Venue: Proceedings of the 10th International Software Process Workshop (1996)

Despite the efforts to devise enactable process modelling languages that are "non-technical" and very readable, the definition of enactable software process models still involves large amounts of detail and requires programming skills. Efforts to design new process modelling languages and tools will help to bring down the costs for process model development. However we believe that only a highly reuse based approach to software process engineering can provide the results that are needed. We rely on the taxonomy for software reuse techniques introduced by W. Krueger (1992) and we examine the differences/specificities which arise when applying these techniques to the software process model reuse domain. We illustrate this taxonomy using the reuse oriented features of the Opsis environment (D. Avrilionis et al., 1992).
Streaming Media Caching Algorithms for Transcoding Proxies
Authors: Xueyan Tang, Fan Zhang, Samuel T. Chanson
Venue: Proceedings of the 2002 International Conference on Parallel Processing (2002)

Streaming media is expected to become one of the most popular types of web content in the future. Due to increasing variety of client devices and the range of access speeds to the Internet, multimedia contents may be required to be transcoded to match the client's capability. With transcoding, both the network and the proxy CPU are potential bottlenecks for streaming media delivery. This paper discusses and compares various caching algorithmsdesigned for transcoding proxies. In particular, we propose a new adaptive algorithm that dynamically selects an appropriate metric for adjusting the management policy. Experimentalresults show that the proposed algorithm significantly outperforms those that cache only untranscoded or only transcoded objects. Moreover, motivated by the characteristics of many video compression algorithms, we investigate partitioning a video object into sections based on frame type and handling them individually for proxy caching. It is found that partitioning improves performance when CPU power rather than network bandwidth is the limiting resource, particularly when the reference pattern is not highly skewed.
Journey to the Center of the Internet: Now Showing in 3D
Authors: Pamela Rice Hahn
Venue:  (2002)

:Who runs the Internet? How can you connect to a computer thousands of miles away? How does my email leave my computer and end up at my aunt's house, two states away? At any point in time, how many people are on the Net? What website has the most content on it  and how did it all get there? How do search engines find and access all that information? Journey to the Center of the Internet answers these questions while demystifying technology, allowing anyone to understand the "stuff" that makes the Internet run. With its title borrowed from the classic Jules Verne novel Journey to the Center of the Earth, this guide captures that same spirit of adventure and discovery as it charts a course through the Internet, helping readers experience the Net in a fun and meaningful way. Designed to be read in conjunction with the included CD, the book features a CD icon that directs users when to open the CD to view detailed animations of concepts presented in the text.
Reduced Fault Tree Models and Solutions
Authors: B J Dugan, Malathi Veeraraghavan, Mark Boyd, Nitin Mittal
Venue:  (1988)

We study several methods for reducing complex fault tree models of fault tolerant systems, and for each method we provide bounds on the estimate of unreliability. We first discuss methods for truncating the solution of a model expressed as a fault tree, and then develop techniques that apply to the construction of the fault tree model. The emphasis is on producing approximate (but bounded) results applicable to realistic systems. We also discuss methods for incorporating dynamic system behavior (error handling and redundancy management) into fault tree models, and the corresponding truncated solution. Realistic examples are given to illustrate the approach.
Testing Delay-Insensitive Circuits
Authors: Pieter J Hazewindus
Venue:  (1992)

A method is developed to test delay-insensitive circuits, using the single stuck-at fault model. These circuits are synthesized from a high-level specification. Since the circuits are hazard-free by construction, there is no test for hazards in the circuit. Most faults cause the circuit to halt during test, since they cause an acknowledgement not to occur when it should. There are stuck-at faults that do not cause the circuit to halt under any condition. These are stimulating faults; they cause a premature firing of a production rule. For such a stimulating fault to be testable, the premature firing has to be propagated to a primary output. If this is not guaranteed to occur, then one or more test points have to be added to the circuit. Any stuck-at fault is testable, with the possible addition of test points. For combinational delay-insensitive circuits, finding test vectors is reduced to the same problem as for synchronous combinational logic. For sequential circuits, the synthesis method is used to find a test for each fault efficiently, to find the location of the test points, and to find a test that detects all faults in a circuit. The number of test points needed to fully test the circuit is very low, and the size of the additional testing circuitry is small. A test derived with a simple transformation of the handshaking expansion yields high fault coverage. Adding tests for the remaining faults results in a small complete test for the circuit.
A flexible protocol synthesis method for adopting requirement changes
Authors: B. Bahadur Bista, K. Takahashi, H. Kaminaga, N. Shiratori
Venue: Proceedings of the 1996 International Conference on Parallel and Distributed Systems (1996)

Communicating entities in a protocol specification communicate with each other and provide services to their users. Once the behaviours of the entities (specification of the protocol) are specified they are not changed. The entities provide a fixed set of services to their users. However, different users have different requirements and their requirements change often. The requirement changes in general are small in terms of the size of the behaviour expressions of the entities. Traditional protocol synthesis techniques have given considerable attention in construction of new protocols for fixed set of services but less attention to the attractive maintenance issue of protocol to adopt new protocol requirement changes. What is desirable is a protocol synthesis method which adopts new protocol requirement changes into the behaviours of entities or protocol specifications. In this paper, we propose a protocol synthesis method which adopts the new protocol requirement changes into the protocol specification. In this way, we can use existing protocol specifications and maintain them to adopt requirement changes. We use the formal specification language LOTOS to specify requirement changes and the behaviours of entities.
A Characterization for Parity Graphs and a Coloring Problem with Costs
Authors: Klaus Jansen
Venue:  (1998)

In this paper, we give a characterization for parity graphs. A graph is a parity graph, if and only if for every pair of vertices all minimal chains joining them have the same parity. We prove that $G$ is a parity graph, if and only if the cartesian product $G \times K_2$ is a perfect graph. Furthermore, as a consequence we get a result for the polyhedron corresponding to an integer linear program formulation of a coloring problem with costs. For the case that the costs $k_{v,3} = k_{v,c}$ for each color $c \ge 3$ and vertex $v \in V$, we show that the polyhedron contains only integral $0 / 1$ extrema if and only if the graph $G$ is a parity graph.
Using the O-A Diagram to Encapsulate Dynamic Memory Access
Authors: Paolo Tonella
Venue: Proceedings of the International Conference on Software Maintenance (1998)

Good software design is characterized by low coupling between modules and high cohesion inside each module. This is obtained by encapsulating the details about the internal structure of data and exporting only public functions with a clean interface. For programming languages such as C, which offer little support for encapsulation, code analysis tools may help in assessing and improving the access to data structures.In this paper a new representation of the accesses of functions to dynamic locations, called the O-A diagram, is proposed. By isolating meaningful groups of functions working on common dynamic data, such a diagram can be used to evaluate the encapsulation in a program and to drive possible interventions to improve it.Experimental results suggest that the aggregations identified by the O-A diagram are actually cohesive functions operating on a shared data structure. The results are useful in themselves, by providing the programmer with information about the organization of the accesses to dynamic memory. In addition the O-A diagram permits highlighting violations of encapsulation, so that proper restructuring actions can be performed.
An optimal PRAM algorithm for a spanning tree on trapezoid graphs
Authors: Debashis Bera, Madhumangal Pal, Tapan K. Pal
Venue: The Korean Journal of Computational Applied Mathematics (2003)

Let G be a graph with n vertices and m edges. The problem of constructing a spanning tree is to find a connected subgraph of G with n vertices and n - 1 edges. In this paper, we propose an O(log n) time parallel algorithm with O(n/log n) processors on an EREW PRAM for constructing a spanning tree on trapezoid graphs.
Infinite Horizon Stochastic Differential Games with Uncertain Future Payoff Structures
Authors: David Wing-Kay Yeung
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

In this paper we consider infinite horizon stochastic differential games with an autonomous structure and steady branching payoffs While the introduction of additionalstochastic elements via branching payoffs offers a fruitful alternative to modeling game situations under uncertainty the solution to such a problem is not known.A theorem on the characterization of a Nash equilibrium solution for this kind of games is presented. An application in renewable resource extraction is provided to illustrate the solution mechanism 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
A Low Cost Searching Device for an ATM Adapter
Authors: R. J. Glaise, J. Munier
Venue: Proceedings of the 6th International Conference on Computer Communications and Networks (1997)

A key function of an ATM adapter is its ability to sort the incoming traffic from the VPi/VCi field of the cell headers. This has to be done at media speed and requires a hardware assist to keep up with the high-speed lines over which ATM cells are transported. Although the device of choice to perform a search is a Content Addressable Memory (CAM) such devices are seldom used, especially in the cost sensitive part of the market, because they require large die size to be built and are too expensive. However, numerous methods have been devised just using regular R/W RAMs. The most efficient, based on various tree structures, tend to be difficult to manage when updating is considered (especially deletions). Hashing, because of its simplicity, is often preferred. Although "no hash function is perfect" some are better adapted in a particular situation. Thus, it is the purpose of this paper to describe a hash device, making use of the HEC header field as the hash function, requiring a modest RAM space and able to sort cell traffic at the ingress of an ATM adapter with predictable performances.
An Efficient Seeds Selection Method for LFSR-based Test-per-clock BIST
Venue: Proceedings of the 3rd International Symposium on Quality Electronic Design (2002)

In this paper we propose a new algorithm for seeds selection in LFSR-based test-per-clock BIST. The proposed algorithm uses the well-known concept of solving systems of linear equations and, based on heuristics, minimizes the number of seeds and test vectors while achieving 100% fault coverage. Experimental results indicate that it compares favorably to the other known techniques.
Revolutionary Final Cut Pro 3: Digital Post-Production, 1 edition
Authors: Diannah Morgan, Ned Soltz, Noah Kadner
Venue:  (2002)

:The book covers: The professional features of Final Cut Pro's interface The many 3rd party hardware/software enhancements such as Boris FX, 3D Invigorator, Contour Shuttlepro and Post-Op color-coded keyboards Creating a proper EDL for film and 24p projects using FCP 3 and such products as FilmLogic How to color correct in Final Cut Pro for consistency as well as to achieve new effects and styles How to output projects for film, television, DVD and the Internet How to take advantage of the Real-time features offered in FCP 3 including: Media Management Tools for compression and transfer and when to use them Using Offline RT for Real-time editing both on a desktop and on a Powerbook G4 Creating titles with the new Real-time Text generators Using RT filters and transitions to achieve amazing effects Special techniques and power-user secrets that take FCP 3 beyond the boundaries stated by Apple- including how to accelerate RT effects on lower-end G4 machines How to program your own unique effects using the FXBuilder A supporting CD is also included.