ppxscal/embedding_network huggingface dataset:
Using Reflexivity to Interface with CORBA
Authors: Roberto Ierusalimschy, Renato Cerqueira, Noemi Rodriguez
Venue: Proceedings of the 1998 International Conference on Computer Languages (1998)

Most bindings to CORBA are based on the construction of stubs, which translate a language call into a CORBA invocation. This paper shows an alternative way to build a binding, using the reflexive facilities of an interpreted language. Like other CORBA bindings, this binding allows a program to manipulate CORBA objects in the same way it manipulates local objects. Unlike conventional bindings, however, it is based on the CORBA Dynamic Invocation Interface, mapping its dynamic character to the dynamic type system of the language. In this way, a program has immediate access to any CORBA component, without the need of stubs or pre-defined IDL headers.
User Level Communication on Alpha Linux Systems
Authors: J. Chen, W. Watson III
Venue: Proceedings of the 2000 International Symposium on Parallel Architectures, Algorithms and Networks (2000)

Recent advances in commodity network interface technology enable scientists and engineers to build clustersof workstations or PCs to execute parallel applications.However, raw-hardware network performance is rarely deliveredto applications because of the overheads of communication software and operating systems. To reduce these overheads, a technique called user-level communication can be used to allow applications to access the network interface directly without intervention from the operating system. In this paper we examine two user-level communication systems, GM and BIP, on alpha based systems connected by a Myrinet network. In addition quantitative studies on how DMA initiation costs, flow control and reliable communication will effect the performance of communication software are presented.
Query Result Size Estimation Using a Novel Histogram-like Technique: The Rectangular Attribute Cardinality Map
Authors: B. John Oommen, Murali Thiyagarajah
Venue: Proceedings of the 1999 International Symposium on Database Engineering & Applications (1999)

Current database systems utilize histograms to approximate frequency distributions of attribute values of relations. These are used to efficiently estimate query result sizes and access plan costs. Even though they have been in use for nearly two decades, there has been no significant mathematical techniques (other than those used in statistics for traditional histogram approximations) to study them. In this paper, we introduce a new histogram-like approximation strategy, called the Rectangular Attribute Cardinality Map (R-ACM), that aims to approximate the density of the underlying attribute values using the philosophies of numerical integration.In this new histogram-like approximation method, the density function within a given sector is approximated by a rectangular cell, where the height of the cell is obtained so as to guarantee that the actual probability density differs from the approximated one by a maximum of a user-specified tolerance, _ . Furthermore, unlike the two traditional histogram types, namely equi-width and equi-depth, the R-ACM is neither equi-width nor equi-depth. Analytically, we show that for the R-ACM, the distribution of an attribute value within the sector is Binomially distributed.This permits us to derive worst-case and average-case results for the estimation errors of the probability mass itself. Our theoretical results, which include a rigorous maximum likelihood and expected-case analyses, and an extensive set of experiments demonstrate that the R-ACM scheme (which is essentially histogram-like) is much more accurate than the traditional histograms for query result size estimation. Due to its high accuracy and low construction costs, we hope that it could become an invaluable tool for query optimization in the future database systems.
Tom Clancy's Ghost Recon (Ps2/GC)
Venue:  (2002)

:Command America's Elite Fighters ·Stealthy tactics to evade all enemies ·In-depth walkthroughs for all 23 Missions ·Tips for completing all objectives and unlocking special characters ·Hints on assigning the right soldier to each mission ·Detailed maps for every level ·Strategy for all weapons and equipment including submachine guns, the powerful M4 carbine, grenades, stealthy night vision goggles, and the deadly OICW assault rifle ·Killer combat tricks 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
Factoring and decomposing ore polynomials over Fq(t)
Authors: Mark Giesbrecht, Yang Zhang
Venue: Proceedings of the 2003 international symposium on Symbolic and algebraic computation (2003)

We present algorithms for computing factorizations and least common left multiple (LCLM) decompositions of Ore polynomials over Fq(t), for a prime power q=pμ. Our algorithms are effective in Fq(t)[D; σ,δ], for any automorphism σ and σ-derivation δ of Fq(t). On input f ∈ Fq(t)[D;σ,δ], the algorithms run in time polynomial in degD(f), degt(f), p and μ.
Multi-relational data mining
Authors: Arno J. Knobbe, H. Blockeel, Arno P.J.M. Siebes, D. M.G. Wallen
Venue:  (1999)

An important aspect of data mining algorithms and systems is that they should scale well to large databases. A consequence of this is that most data mining tools are based on machine learning algorithms that work on data in attribute-value format. Experience has proven that such ''single-table'' mining algorithms indeed scale well. The downside of this format is, however, that more complex patterns are simply not expressible in this format and, thus, cannot be discovered. One way to enlarge the expressiveness is to generalize, as in ILP, from one-table mining to multiple table mining, i.e., to support mining on full relational databases. The key step in such a generalization is to ensure that the search space does not explode and that efficiency and, thus, scalability are maintained. In this paper we present a framework and an architecture that provide such a generalization. In this framework the semantic information in the database schema, e.g., foreign keys, are exploited to prune the search space and, in the architecture, database primitives are defined to ensure efficiency. Moreover, the framework induces a canonical generalization of algorithms, i.e., if the generalized algorithms are run on a single table database, they give the same results as their single-table counterparts. The framework is illustrated by the Warmr algorithm, which is a multi-relational generalization of the Apriori algorithm.
Mobile Cache Protocol: A Dynamic Object Relocation Protocol for Wide Area Networks
Authors: T. Watanabe, A. Mori, Y. Yamamoto
Venue: Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000) (2000)

This paper proposes a relocation protocol of a replicated object in a widely distributed object system called Mobile Cache Protocol (MCP). MCP has four basic features: (1) It creates a replicated object and allocates it on an intermediate site to reduce the latency of object retrieval in a wide area network, (2) it supports both client and server oriented updates to achieve object consistency, (3) it supports reservation of replication of an object, and (4) several clients can share a replicated object to enhance storage efficiency.The protocol is summarized and implementation and various experiments of the protocol are described. Though it is designed for a distributed object based system, MCP also can be applied to dynamic web caching.
Analysis of Hypergeometric Distribution Software Reliability Model
Authors: T. Dohi, N. Wakana, S. Osaki, K. Trivedi
Venue: Proceedings of the 12th International Symposium on Software Reliability Engineering (2001)

This article gives the detailed mathematical results on the hypergeometric distribution software reliability model (HGDSRM) proposed by Tohmaet al.[IEEE Trans.Software Eng. (1989, 1991)].In the above papers, Tohma et al.developed the HGDSRM as a discrete-time stochastic model and derived a recursive formula for the mean cumulative number of software faults detected up to the i-th (>0) test instance in test-ing phase.Since their model is based on only the mean value of the cumulative number of faults, it is impossible to estimate not only the software reliability but also the other probabilistic dependability measures.In this article, we introduce the concept of cumulative trial processes, and describe the dynamic behavior of the HGDSRM exactly.In particular, we derive the probability mass function of the number of software faults detected newly at the i-th test instance and itsmean as well as the software reliability defined as the probability that no faults are detected up to an arbi-trary time. In numerical examples with real software failure data, we compare several HGDSRMs with different model parameters in terms of least squared sum and show that the mathematical results obtained here are very useful to assess the software reliability withthe HGDSRM.
Professional Visual Basic 6: A Programmers Resource
Authors: Jerry Ablan, Donald Xie, Fabio Claudio Ferracchiati, Kent Tegels, Ryan Payet
Venue:  (2003)

:Since its release in 1998, Visual Basic 6 has become one of the world's most popular programming languages, with over 3 million programmers having used it to build Windows based applications. Its success in the programming world can be ascribed to a combination of its accessibility, productivity, and power; VB6 comes with a robust, intuitive development environment that provides an ideal entry point for the novice, yet supports features that the more experienced developer needs to build sophisticated enterprise level applications. Wrox has, since our inception, striven to build an understanding of the programmer community and deliver books that give the professional the knowledge they need to succeed in the workplace. This is particularly true in VB6 where a stream of respected titles have established our credibility.So, to support today's VB6 practitioner who knows that they need to get the most from VB6 (while appreciating that they need to be aware of the potential of VB.NET), this book takes the collected Wrox knowledge in 4 major areas (data access, component development, server side programming, and XML), distills it and brings it bang up to date to deliver a VB6 programmer's resource. Completely new content in the areas of VB6 application architecture, SOAP and Web Services, and how to develop VB6 applications in the light of .NET ensures this title places VB6 programming in a contemporary context. Furthermore, the book comes with a CD of hand picked case studies selected from previous books, access to the original books via the online WroxBase technology, along with novel appendices on VB6 Tips and Tricks and application packaging and deployment tools. This book is for the intermediate VB6 programmer looking for the essential pieces of information that will help them to deliver powerful VB6 solutions today. Not only does this compendium address such important topics as ADO, COM+, ASP, and SOAP it will also provide an insight into what you need to do to equip your VB6 applications for the .NET wave.
Message Passing Server Internals, 1 edition
Authors: Bill Blunden
Venue:  (2003)

:Don't just deploy it--deploy it for speed. One of the most active areas of development in communications, messaging is the almost instantaneous passing of short messages from one network to another, or from one network component to another. Pagers, cell phones, and PDAs are all messaging systems, as is AOL Instant Messaging (R). Big software suites for the enterprise like ERP, EAI, and SAP all contain messaging components.One reason for messaging's new popularity is the recent publication of programming interfaces for Java. Now these systems are not only widespread but accessible. Developers need background on message passing internals and how message systems are designed and deployed in order to use these tools. This is the first book on message passing written for the veteran developer and the newcomer who wants to work in communications.Production quality components and system management tools are available on the CD-ROM. 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
Improve the service quality of multi-agent system: ontology management
Authors: Kwun-tak Ng, Qin Lu
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

The association of ontology with services enables service providers to export their services and also enables clients to declare desired services so that new service providers can serve existing clients. Changes and enhancements can be kept track of through the ontology management. The ontology management platform in our system not only declares semantics of agent services, but also provides interface specification for clients to use such a system with semantic information provided.
Fundamental R&D Issues in Real-Time Distributed Computing
Authors: Insup Lee, Mike Jones, Hermann Kopetz, Kane Kim, Thomas F. Lawrence, Bhavani Thuraisingham
Venue: Proceedings of the Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2000)

In spite of rapidly growing industrial activities involving real-time distributed computer systems, the scientific foundation for real-time distributed computing remains in a weak state. For many reasons, use of object oriented (OO) programming approaches in constructing real-time distributed computer systems is gaining popularity steadily. However, fundamental research issues in real-time distributed computing cannot be melted away by simple adoption of C++ or Java as a basic programming language. At the same time, new fundamental extensions of conventional OO approaches might offer a new dimension of solution possibilities. In this panel, experts from both industry and academia with extensive research experiences in real-time distributed computing will discuss what they perceive as unresolved R&D issues of fundamental nature and promising directions for searching for effective technological solutions. The discussion will not be confined to the cases of OO systems.
Logarithmic Conversion by Four Partitioned Hybrid-ROMs
Venue: Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks (1996)

The logarithmic number systems (LNS) have long been used in arithmetic to simplify the process such as: multiplication to addition, division to subtraction, and powers to multiplication, etc.. The difficult problem may arise from the accuracy of conversion during the processing operations and a very large number of product terms should be generated if a look-up table is realized by a ROM. In some occurrences, it may be impossible to be implemented by such a large capacity ROM (say, 2e24x24) if no partitioned scheme is used. This paper presents a four-partition conversion scheme in order to be implemented by small sized ROMs. It can generate better result and higher speed conversion comparing with previous methods for two- or three-partition schemes. This algorithm can also be used in conversion of antilogarithms as well.
OptoNet - A Case Study in Using Rigorous Analysis Techniques to Justify a Revised Product Assurance Strategy
Authors: Leesa Murray, Alena Griffiths, Paul Strooper
Venue: Proceedings of the Eighth International Conference on Engineering of Complex Computer Systems (2002)

When upgrading software in mission-critical orsafety-relate dindustrial control systems, it is imperativeto ensure that system integrity properties are preserved.Comprehensive system testing is one way togain this assurance. This has limitations, however, inthat the hardware may be too expensive to assemble alarge test rig, or where a product upgrade is to be deployedin diversely configured systems. This paperdescribes a method that uses rigorous system analysis tojustify the replacement of system testing with both staticanalysis of the system configuration and dynamic testingof the upgraded system components. The paper reports on industrial experience in applying this method to the OptoNet product, which is anembedded software product used in industrial controlsystems. System analysis techniques are used to develop a detailed understanding of how OptoNet com-ponents (RTUs) interact to realise OptoNet system behaviour. Based on this detailed understanding, recommendations for a revised assurance strategy are made.The lessons learnt in the trial application of this methodto the OptoNet product are discussed, and possible ex-tensions to the method are proposed.
Quality of Service Architectures for Wireless Networks: IntServ and DiffServ Models
Authors: Indu Mahadevan, Krishna M. Sivalingam
Venue: Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks (1999)

Guaranteeing Quality of Service (QoS) in the Internet has been proposed using two different models -- the Integrated services (IntServ) model and the Differentiated services (DiffServ) model. IntServ uses the per-flow approach to provide guarantees to individual streams, while DiffServ provides aggregate assurances for a group of applications. Both these models have been designed to work for wired networks. Our aim is to identify modifications that need to be made to make them suitable for wireless networks. In this paper, some possible modifications to the IntServ and DiffServ models for use with wireless networks are presented. A description of an experimental testbed built to implement and test the proposed enhancements, and results from the testbed are also provided.
La fotografia digital: Guia para la creacion y manipulacion de imagenes
Authors: Tom Ang
Venue:  (2002)

:This comprehensive guide offers both beginning and advanced techniques for creating perfect digital images. Instruction covers how digital cameras work, what computer skills are necessary, and digital techniques to improve conventional photography. Also featured are workshops on how to use cutting-edge technology to create personal and artistic effects.Author Biography: Tom Ang is a senior lecturer in photography at the University of Westminster in London. His work has been widely exhibited and he contributes regularly to magazines such as What Digital Camera and the British Journal of Photography.
A Generic Framework for Indulgent Consensus
Authors: Rachid GUERRAOUI, Michel Raynal
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

Consensus is a fundamental distributed agreement problemthat has to be solved when one has to design or implementreliable applications. As consensus cannot be solvedin pure asynchronous distributed systems, those systemshave to be equipped with appropriate oracles to circumventthe impossibility. Several oracles (unreliable failure detector,leader capability, random number generator) have beenproposed, and consensus protocols based on such ad hoc oracleshave been designed. This paper presents a genericconsensus framework that can be instantiated with any oracle,or combination of oracles, that satisfies a set of properties.This generic framework provides indulgent consensusprotocols that are particularly simple and efficient both inwell-behaved runs (i.e., when there are no failures), and instable runs (i.e., when there is no failure during the executionalthough some processes can be initially crashed). Inthose runs, the protocols terminate in two communicationsteps (which is optimal). Indulgence means that the resultingprotocol never violates its safety property even whenthe underlying oracle behaves arbitrarily. Interestingly, theprotocol can also allow processes to decide in one communicationstep in some specific configurations.
Time dependent priority scheduling for guaranteed QoS systems
Authors: S. Chaudhry, A. Choudhary
Venue: Proceedings of the 6th International Conference on Computer Communications and Networks (1997)

With the advances in server technology, and the advent of fast gigabit networks, it has become possible to support multimedia applications. To support the requirements for the transmission of isochronous data, the network must provide service guarantees to connections, including minimum bandwidth, packet delay, delay jitter, and loss. Three factors determine the utilization of the network when providing these services. These are the scheduling algorithm employed at each switch; the accuracy (tightness) of the admission control (schedulability condition) that detects violations to the service guarantees; accuracy of the input traffic characterization. In this paper we present a scheduling algorithm, its schedulability condition and implementation. The schedulability condition is free of input traffic characterization and thus any input traffic model can be used. Further, the algorithm is capable of achieving up to maximum efficiency possible at each switch.
Cool-Cache: A compiler-enabled energy efficient data caching framework for embedded/multimedia processors
Authors: Osman S. Unsal, Raksit Ashok, Israel Koren, C. Mani Krishna, Csaba Andras Moritz
Venue: ACM Transactions on Embedded Computing Systems (TECS) (2003)

The unique characteristics of multimedia/embedded applications dictate media-sensitive architectural and compiler approaches to reduce the power consumption of the data cache. Our goal is exploring energy savings for embedded/multimedia workloads without sacrificing performance. Here, we present two complementary media-sensitive energy-saving techniques that leverage static information. While our first technique is applicable to existing architectures, in our second technique we adopt a more radical approach and propose a new tagless caching architecture by reevaluating the architecture--compiler interface.Our experiments show that substantial energy savings are possible in the data cache. Across a wide range of cache and architectural configurations, we obtain up to 77&percnt; energy savings, while the performance varies from 14&percnt; improvement to 4&percnt; degradation depending on the application.
On the Conditioning of DFP ad BFGS Updates for Unconstrained Optimization
Authors: Howell H Mei
Venue:  (1975)

A necessary and sufficient condition on when the conditioning of DFP updates is given and a line search strategy which ensures that the DFP is better conditioned than the BFGS is given.
Analytical Redundancy Based Approach for Concurrent Fault Detection in Linear Digital Systems
Authors: A. Abdelhay, E. Simeu
Venue: Proceedings of the 6th IEEE International On-Line Testing Workshop (IOLTW) (2000)

With the advent of VLSI technology, large numbers of processing elements, which cooperate with each other to achieve a complex function, have become feasible. A major concern in the design of these complex devices has been the ability to verify and in some instances guarantee their fault free operation. Since any error in processed data may have catastrophic effects, therefore some levels of fault detection must be incorporated in order to increase the reliability of systems. This paper presents a general method for concurrent error detection in linear digital systems using analytical redundancy, i.e., relations between the measured variables. The fault detection mission can be performed using only the available connectable (measurable) variables, e.g. the external inputs and outputs, while the hardware overhead of the test circuit can be optimized through connecting on some internal measurable state variables. Generally, this method is applicable to all linear digital systems while the test circuit obtained for on-line detector implementation is still very reasonable.