ppxscal/embedding_network huggingface dataset:
Basic Program Structures for Avoiding Priority Inversions
Authors: K. H. (Kane) Kim
Venue: Proceedings of the Sixth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2003)

Structuring real-time concurrent programs in the form of groups of fixed-priority processes is an old art which is appropriate for only a small fraction of modern real-time distributed computing application systems. However, it is still practiced on the basis of an insufficient technical foundation. One of the basic issues in using the fixed-priority process structuring approach isto avoid the priority inversion phenomenon. It is argued that priority inversions are essentially due to the inappropriate approach used for structuring programs including the specification of the policy for allocating resources. Several basic program structuring techniques which are effective means of avoiding priority inversions are presented.
An Intelligent Brokering System to Support Multi-Agent Web-Based 4th-Party Logistics
Authors: Hoong Chuin Lau, Yam Guan Goh
Venue: Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence (2002)

An intelligent agent-based framework that supports fourth-party logistics (4PL) operations on the web is proposed in this paper. In our system, customers specify job requests over the web dynamically. An eMarket Place allows intelligent third-party logistics (3PL) agents to bid for customers' job requests. The intelligence lies on the e-Market Place to optimally decide whichagents' bids should be satisfied based on a set of predetermined factors (pricing, preferences and fairness). We model the underlying brokering problem as a Set Packing Problem (SPP), which is an NP-hard optimization problem. An iterative greedy approximation algorithm is proposed to solve the SPP, and experimental results show its effectiveness against the classical greedy method proposed by Chvatal.
Object-Oriented Query Optimization: What''s the Problem?
Authors: Gail Mitchell, Stanley B. Zdonik, Umeshwar Dayal
Venue:  (1991)

An object-oriented database model can support features such as abstract data types, methods, encapsulation, subtyping (or inheritance), complex structures, and object identity. The processing of queries in such a model also entails support for these features. Query optimization will require new techniques for supporting the object-oriented features. Although many of the problems that must be solved by an object-oriented query optimizer are similar to problems solved by relational and extensible optimizers, there are also many problems that are unique to the object-oriented model. In this paper we explore some of the problems that are encountered when trying to optimize queries in an object-oriented database. We present these problems in the context of the modeling constructs which generate the problem. We also survey current approaches to solving some of these problems and discuss problems that are not addressed by these approaches.
A Survey to Determine Federal Agency Needs for a Role-Based Access Control Security Product
Authors: C. Smith
Venue: Proceedings of the 3rd International Software Engineering Standards Symposium (ISESS '97) (1997)

This paper is an overview of a study done for the National Institute of Standards and Technology (NIST) to determine what potential market there is for a role-based access control (RBAC) product. Thirty security managers from 27 large civil federal organizations were interviewed using a six-page questionnaire. Their security needs were identified and it was concluded that these organizations desired an RBAC product to complement their mandatory and discretionary access control products. The results of the main reference study (Smith et al., 1996) will be used by NIST personnel as an input to the formulation of standards for future RBAC products.
A Developer's Guide to Silhouette Algorithms for Polygonal Models
Authors: Tobias Isenberg, Bert Freudenberg, Nick Halper, Stefan Schlechtweg, Thomas Strothotte
Venue: IEEE Computer Graphics and Applications (2003)

Generating object silhouettes lies at the heart of nonphotorealism and is needed for many styles of rendering. This article describes, categorizes, discusses, and recommends algorithms for computing the silhouette of a polygonal model, thus guiding developers to the optimal approach for their specific needs.
An Architecture to Support Distributed Trade Documents
Authors: H. Wing, R. M. Colomb
Venue: Proceedings of the 3rd International Symposium on Autonomous Decentralized Systems (1997)

By integrating the many different technologies and approaches involved in electronic education and commerce, we can effectively support advanced applications in these areas. This paper describes an architecture which can be used to facilitate the specification, execution, and distribution of incremental trade documents among heterogeneous interchanges. We argue that the conventional, top-down, centralized approach to workflow, in its current state, is not suitable to support the undetermined nature of an advanced trade application. What this approach lacks is a unified object-oriented model which can be used to design interoperable trading systems with a single set of well-defined abstractions. This paper, in an attempt to overcome the limitations imposed by the conventional approach, presents an overview of principles relating to object interoperability, semantic heterogeneity, and the document-centric paradigm associated with trade documents. A view object model, and its relevant components are also discussed.
A model for strategy in constraint solving
Authors: Jarke J. Wijk
Venue:  (1997)

The use of constraints for the definition of graphical user interfaces has been recognized as a great concept. However, often many valuations of the variables will satisfy the constraints, and which particular valuation matches best with the expectation of the user cannot be decided without further information. Three typical examples of user interfaces are presented where this occurs, and from these, requirements on a more cooperative constraint solver are derived. A new method for the definition and implementation of the strategy to decide which variables to adapt is presented. The model is based on two notions: hierarchy and grouping. Variables are divided into groups, and for each group three parameters are set. These are used to determine the level of variables, dependent on which group they belong, and which variables are modified. These levels are used in turn to select the variables to be adapted. An implementation of this method is described, as part of the Computational Steering Environment (CSE) developed at CWI. The resulting constraint solver can handle simultaneous sets of non-linear, multi-way constraints; and can handle a high-level definition of the strategy to be followed. Finally, the results are discussed, and suggestions for further work are done.
Estimating the Attainable Accuracy of Recursively Computed Residual Methods
Authors: Anne Greenbaum
Venue:  (1995)

Many conjugate gradient-like methods for solving linear systems $Ax=b$ use recursion formulas for updating residual vectors, instead of computing the residuals directly. For such methods it is shown that the difference between the actual residuals and the updated approximate residual vectors generated in finite precision arithmetic depends on the machine precision $\epsilon$ and on the maximum norm of an iterate divided by the norm of the true solution. It is often observed numerically, and can sometimes be proved, that the norms of the updated approximate residual vectors converge to zero, or, at least, become orders of magnitude smaller than the machine precision. In such cases, the actual residual norm reaches the level $\epsilon \| A \| \| x \|$ times the maximum ratio of the norm of an iterate to that of the true solution. Using exact arithmetic theory to bound the size of the iterates, we give a priori extimates of the size of the final residual for a number of algorithms.
Long Term Distributed File Reference Tracing: Implementation and Experience
Authors: Lily Mummert, Mahadev Satyanarayanan
Venue:  (1994)

DFSTrace is a system to collect and analyze long-term file reference data in a distributed UNIX workstation environment. The design of DFSTrace is unique in that it pays particular attention to efficiency, extensibility, and the logistics of long-term trace data collection in a distributed environment. The components of DFSTrace are a set of kernel hooks, a kernel buffer mechanism, a data extraction agent, a set of collection servers, and post-processing tools. Our experience with DFSTrace has been highly positive. Tracing has been virtually unnoticeable, degrading performance 3-7%, depending on the level of detail of tracing. We have collected file reference traces from approximately 30 workstations continuously for over two years. We have implemented a post-processing library to provide a convenient programmer interface to the traces, and have created an on-line database of results from a suite of analysis programs to aid trace selection. Our data has been used for a wide variety of purposes, including file system studies, performance measurement and tuning, and debugging. Extensions of DFSTrace have enabled its use in applications such as field reliability testing and determining disk geometry. This paper presents the design, implementation, and evaluation of DFSTrace and associated tools, and describes how they have been used.
Deterministic Polynomial Time O(log n) Queries
Authors: Jim Kadin
Venue:  (1986)

$P^{NP[\log n]}$ is the class of languages recognizable by determining polynomial time machines that make $O(\log n)$ queries to an oracle for NP. Many of the languages related to optimal solution sizes of NP optimization problems are members of this class. We relate $P^{NP[\log n]}$ to the study of sparse oracles for NP by showing that if NP has a sparse $\leq^{P}_{T}$-complete set, then the polynomial time hierarchy collapses to $P^{NP[\log n]}$. We also discuss complete problems and show that UOCSAT, the set of CNF formulas with the property that every assignment that satisfies the maximum number of clauses satisfies the same set of clauses, is $\leq^{P}_{m}$-complete for $P^{NP[\log n]}$.
Real World Adobe GoLive 6
Authors: Jeff Carlson, Glenn Fleishman
Venue:  (2002)

:Navigating the intricacies of a full-featured Web site design and management tool like Adobe GoLive 6 without a roadmap can leave even an advanced designer in the dark. That's why you need Real World GoLive 6. Revised to cover all the new features in GoLive 6 (including built-in tools to put database content directly in pages and the new Adobe Web Workgroup Server for collaborative site building), this industrial-strength guide provides the information you need to tap the true power of this popular development tool.Beginning with the basicslike creating and editing Web pages and sitesand moving on to more complex topicslike scripting languages and animationveteran Webheads Jeff Carlson and Glenn Fleishman cover it all. You'll return to Real World GoLive 6 again and againnot just for its coverage of new features like live content editing of Photoshop, Illustrator, and LiveMotion files, but for the inside tips and shortcuts Jeff and Glenn provide. They've done the work; now you get to benefit from their experience! For intermediate to advanced site builders, Real World GoLive 6 provides a complete reference you'll soon deem an invaluable resource.
Fast Self-Similar Teletraffic Generation Based on FGN and Wavelets
Authors: Hae-Duck J. Jeong, Don McNickle, Krzysztof Pawlikowski
Venue: Proceedings of the 7th IEEE International Conference on Networks (1999)

It is generally accepted that self-similar (or fractal) processes may provide better models of teletraffic in modern computer networks than Poisson processes. Thus, an important requirement for conducting simulation studies of telecommunication networks is the ability to generate long synthetic stochastic self-similar sequences. A new generator of pseudo-random self-similar sequences, based on the fractional Gaussian noise (FGN) and a wavelet transform, is proposed and analyzed in this paper. Specifically, this generator uses Daubechies wavelets. The motivation behind this selection of wavelets is that Daubechies wavelets lead to more accurate results by better matching the self-similar structure of long range dependent processes, than other types of wavelets. The statistical accuracy and time required to produce sequences of a given (long) length are experimentally studied. This generator shows a high level of accuracy of the output data (in the sense of the Hurst parameter) and is fast. Its theoretical algorithmic complexity is O(n).
Arithmetic Circuits for Analog Digits
Authors: Aryan Saed, Majid Ahmadi, Graham A. Jullien
Venue: Proceedings of the Twenty Ninth IEEE International Symposium on Multiple-Valued Logic (1999)

The Overlap Resolution Number System (ORNS) employs bit level analog residue arithmetic, and opens up a powerful approach to digital computing. This new redundant representation of signals, with Continuous Valued Digits, presents new methods for binary arithmetic and digital signal processing. The number system is based on analog residue digits, as opposed to binary or multiple-valued digit levels. Importantly, arithmetic in ORNS is tolerant to VLSI circuit tolerances. This allows simple elementary analog circuits to be employed, targeting digital accuracy.
Recover-X: An Adaptive Router with Limited Escape Channels
Authors: Tsutomu Yoshinaga, Masaya Hayashi, Maki Horita, Sayuri Nakamura, Kanemitsu Ootsu, Takanobu Baba
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems (2000)

In order to improve network performance, a variety of adaptive routing algorithms has been proposed. Recent research focuses on their implementation costs, as well as the performance to enhance their practical applications. This paper proposes the Recover-x adaptive routing, which limits escape message candidates in a blocked or deadlocked configuration. This limitation simplifies the routing logic and offers a chance to balance the usage between adaptive and non-adaptive channels.The cost and performance of four wormhole routers based on Verilog-HDL designs were compared. Synthesis results for the chosen gate array technology show that the Recover-x router attains a fast operating speed and low-latency, with high-bandwidth communication performance.
Internet Applications in Product Design and Manufacturing
Authors: George Q. Huang, K.L. Mak
Venue:  (2003)

:This book fills an information gap in digital manufacturing in the Internet era. It deals with Web applications in product design and manufacture. The contents assist both developers and users to appreciate the potentials, as well as difficulties with suggested solutions, in developing and adopting Web applications. The objective is to equip potential users and practitioners of Web applications with a better image of the technology. In addition, Web application developers and new researchers in this field are expected to gather improved and clearer ideas regarding the selection of system architecture and design, development and implementation techniques, and deployment strategies. The book is divided into two main parts. The first part gives an overview of Web and Internet applications in product design and manufacture. The second part includes eight chapters of typical Web applications.
Efficient Dynamic Network Flow Algorithms
Authors: Bruce Hoppe
Venue:  (1995)

Dynamic network flows model transportation. A dynamic network consists of a graph with capacities and transit times on its edges. Flow moves through a dynamic network over time. Edge capacities restrict the rate of flow and edge transit times determine how long each unit of flow spends traversing the network. Dynamic network flows have been studied extensively for decades. This thesis introduces the first polynomial algorithms to solve several important dynamic network flow problems. We solve them by computing chain-decomposable flows, a new class of structured dynamic flows. We solve the quickest transshipment problem. An instance of this problem consists of a dynamic network with several sources and sinks. Each source has a specified supply and each sink a specified demand of flow. The goal is to move the appropriate amount of flow out of each source and into each sink within the least overall time. Previously, this problem could only be solved efficiently in the special case of a single source and single sink. Our quickest transshipment algorithm depends on efficient solutions to the dynamic transshipment problem and the lexicographically maximum dynamic flow problem. The former is a version of the quickest transshipment problem in which the time bound is specified. The latter is a maximum flow problem in a dynamic network with prioritized sources and sinks; the goal is to maximize the amount of flow leaving each high-priority subset of sources and sinks. We also consider the universally maximum dynamic flow problem. A universally maximum dynamic flow sends flow between a source and sink so that the sink receives flow as quickly as possible; subject to that, the source releases flow as late as possible. We describe the first polynomial algorithm to approximate a universally maximum dynamic flow within a factor of $(1+\eps)$, for any $\eps<0$. We also describe the first polynomial algorithm to compute the value of a universally maximum dynamic flow at a single specified moment of time.
Absolute Beginner's Guide to Corel WordPerfect 10
Authors: Laura Acklen
Venue:  (2003)

:In recent news, Corel announced that HP, the world's largest PC manufacturer, Dell, the second-largest, and Sony have all agreed to preinstall WordPerfect 10 and Quattro Pro 10 on some of their computer lines. Cost differential between Microsoft's Office and Works Suites, as well as Microsoft's Office licensing terms is helping fuel the trend to switch software vendors. With more consumers using this product, the need for a beginner-level book on these software programs has increased as well, and the Absolute Beginner's Guide to Corel WordPerfect 10 is the only such resource available! The book assumes absolutely no prior knowledge of the topic, and the information is presented in an easy-to-read, lighthearted style. Bonus chapters on QuattroPro 10 and TaskManager appear in the book and other material is available on www.quepublishing.com. This title is for those who are new to WordPerfect and want to learn how to use the word processing program from start to finish. It is also a great guide for users who are upgrading from previous versions of the software and want to know the newest features.
Multiple Media Correlation: Theory and Applications
Authors: Charles B. Owen
Venue:  (1998)

This thesis introduces multiple media correlation, a new technology for the automatic alignment of multiple media objects such as text, audio, and video. This research began with the question: what can be learned when multiple multimedia components are analyzed simultaneously? Most ongoing research in computational multimedia has focused on queries, indexing, and retrieval within a single media type. Video is compressed and searched independently of audio, text is indexed without regard to temporal relationships it may have to other media data. Multiple media correlation provides a framework for locating and exploiting correlations between multiple, potentially heterogeneous, media streams. The goal is computed synchronization, the determination of temporal and spatial alignments that optimize a correlation function and indicate commonality and synchronization between media objects. The model also provides a basis for comparison of media in unrelated domains. There are many real-world applications for this technology, including speaker localization, musical score alignment, and degraded media realignment. Two applications, text-to-speech alignment and parallel text alignment, are described in detail with experimental validation. Text-to-speech alignment computes the alignment between a textual transcript and speech-based audio. The presented solutions are effective for a wide variety of content and are useful not only for retrieval of content, but in support of automatic captioning of movies and video. Parallel text alignment provides a tool for the comparison of alternative translations of the same document that is particularly useful to the classics scholar interested in comparing translation techniques or styles. The results presented in this thesis include (a) new media models more useful in analysis applications, (b) a theoretical model for multiple media correlation, (c) two practical application solutions that have wide-spread applicability, and (d) Xtrieve, a multimedia database retrieval system that demonstrates this new technology and demonstrates application of multiple media correlation to information retrieval. This thesis demonstrates that computed alignment of media objects is practical and can provide immediate solutions to many information retrieval and content presentation problems. It also introduces a new area for research in media data analysis.
Digital Photography Expert: Light & Lighting
Authors: Michael Freeman
Venue:  (2003)

:Instructive text and images of major tools and equipment make this comprehensive resource essential to every digital photographer's library. With it, they can master both the technical and creative aspects of lighting through a combination of traditional photographic skills and the limitless possibilities of digital technology. Three-hundred-and-fifty photographs--including before and after shots--and expert information demonstrate the key techniques. The full spectrum of light, and how the camera measures it, is explained, along with advice on achieving color accuracy. Photographers can experiment with natural light, bright or dim; explore frontal versus side lighting; and see what can be done indoors using window techniques, tungsten light, flash, candlelight, and post-production techniques. Here's how to make the most out of built-in and portable flashes, fluorescent and studio lights, diffusion, and every possible aspect of photographic lighting.
C# Language Specification
Authors: Anders Hejlsberg, Scott Wiltamuth, Peter Golde
Venue:  (2003)

C# is a simple, modern, object-oriented, and type-safe programming language that combines the high productivity of rapid application development languages with the raw power of C and C++. Written by the language's architect and design team members, The C# Programming Language is the definitive technical reference for C#. Moving beyond the online documentation, the book provides the complete specification of the language along with descriptions, reference materials, and code samples from the C# design team.The first part of the book opens with an introduction to the language to bring readers quickly up to speed on the concepts of C#. Next follows a detailed and complete technical specification of the C# 1.0 language, as delivered in Visual Studio .NET 2002 and 2003. Topics covered include Lexical Structure, Types, Variables, Conversions, Expressions, Statements, Namespaces, Exceptions, Attributes, and Unsafe Code.The second part of the book provides an introduction to and technical specification of the four major new features of C# 2.0: Generics, Anonymous Methods, Iterators, and Partial Types.Reference tabs and an exhaustive print index allow readers to easily navigate the text and quickly find the topics that interest them most. An enhanced online index allows readers to quickly and easily search the entire text for specific topics.With the recent acceptance of C# as a standard by both the International Organization for Standardization (ISO) and ECMA, understanding the C# specification has become critical. The C# Programming Language is the definitive reference for programmers who want to acquire an in-depth knowledge of C#.0321154916B10142003