ppxscal/embedding_network huggingface dataset:
The C++ Standard, 2 edition
Authors: British Standards Institute
Venue:  (2003)

:The definitive reference for any C++ programmer or for programmers needing to work with C++ programs.Every book written about C++ refers frequently to the international standard that defines the language, this will be a must-have companion volume for everyone who is serious about programming in this language.* The complete C++ standard as approved by international standards bodies (BSI and ANSI)* The ONLY available bound version of the standard* Foreword by Bjarne Stroustrup* Most recent corrections and updates (Technical Corrigendum) are indicated with side bars to highlight where changes have taken place* An introductory chapter explains what the standards process is and how the reader can participate in the standards process 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
Collecting Cyclic Garbage in Distributed Systems
Authors: Xinfeng Ye, John Keane
Venue: Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (1997)

The proposed garbage collection scheme identifies and collects cycles of garbage scattered across several machines. The scheme identifies a garbage cycle by investigating: (a) whether the transitive closure of a given object form a cycle, and (b) whether objects in the transitive closure are referenced by objects outside the closure. The algorithm only traces objects in the transitive closure of the object suspected to be in a garbage cycle. Thus, compared to normal mark-sweep, the algorithm here has better scalability. In contrast to partly-mark-sweep, which marks objects in two rounds, this algorithm identifies garbage in one round. Thus, the algorithm here is more efficient in terms of speed. This algorithm does not interfere with the mutators' operations. Unlike many other schemes, the algorithm here does not require an object to reserve any memory to hold the information for running the algorithm. Thus, a large amount of memory can be saved.
Requirements Elicitation Driven by Interviews: The Use of Viewpoints
Authors: Julio Cesar Sampaio do Prado Leite, Ana Paula Pinho Gilvaz
Venue: Proceedings of the 8th International Workshop on Software Specification and Design (1996)

Requirements elicitation in the context of organizational information systems is well know to be a very hard task, much dependent on the experience and cleverness of the team performing the elicitation. In such a context the use of interviews is frequent and pointed out as the major technique for getting the requirements from the actors in the organization. We have been working with the idea of a general interview assistant and our first results are promising. In this article we elaborate on our original proposal in order to augment its assistant capability, without loosing its simplicity. We show how the use of viewpoint analysis improves the inference capability of our assistant.
Remote object translation methods for immersive virtual environments
Authors: Jurriaan D. Mulder
Venue:  (1998)

In this paper, seven methods are described to perform remote object translations with a six degree-of-freedom input device in an immersive virtual environment. By manipulating objects remotely, a number of disadvantages of the real-world `direct grab and drag'' metaphor can be avoided. The different methods are evaluated with a pilot user experiment. From the results of the experiment, some initial recommendations are formulated on the use of the methods for different manipulation tasks.
Partial servicing of on-line jobs
Authors: Rob Stee, J. A. L Poutre
Venue:  (2000)

We consider the problem of scheduling jobs online, where jobs may be served partially in order to optimize the overall use of the machines. Service requests arrive online to be executed immediately;
A Hybrid BIST Architecture and its Optimization for SoC Testing
Authors: Helena Kruus
Venue: Proceedings of the 3rd International Symposium on Quality Electronic Design (2002)

This paper presents a hybrid BIST architecture and methods for optimizing it to test systems-on-chip in a cost effective way. The proposed self-test architecture can be implemented either only in software or by using some test related hardware. In our approach we combine pseudorandom test patterns with stored deterministic test patterns to perform core test with minimum time and memory, without losing test quality. We propose two algorithms to calculate the cost of the test process. To speed up the optimization procedure, a Tabu search based method is employed for finding the global cost minimum. Experimental results have demonstrated the feasibility and efficiency of the approach and the significant decreases in overall test cost.
State-dependent M/G/1 type queueing analysis for congestion control in data networks
Authors: Eitan Altman, K. Avrachenkov, C. Barakat, Rudesindo N\''{u}\~{n}ez Queija
Venue:  (2000)

We study a TCP-like linear-increase multiplicative-decrease flow control mechanism. We consider congestion signals that arrive in batches according to a Poisson process. We focus on the case when the transmission rate cannot exceed a certain maximum value. The distribution of the transmission rate in steady state as well as its moments are determined. Our model is particularly useful to study the behavior of TCP, the congestion control mechanism in the Internet. Burstiness of packet losses is captured by allowing congestion signals to arrive in batches. By a simple transformation, the problem can be reformulated in terms of an equivalent M/G/1 queue, where the transmission rate in the original model corresponds to the workload in the `dual'' queue. The service times in the queueing model are not i.i.d., and they depend on the workload in the system.
Smart Business Systems for the Optimized Organization
Authors: Robert J. Thierauf, James J. Hoctor
Venue:  (2002)

:One of the first books to probe the latest direction in computing technology, this innovative text explores ways in which smart business systems can help pick the best, most optimal, or near-optimal solutions from among hundreds, even thousands of possibilities that threaten to swamp organizational decision makers daily. Well-illustrated with examples and discussions of typical applications in such areas as strategic planning, marketing, manufacturing, and accounting, the book will help managers at all levels tie their organization's critical success factors into its key performance indicators and financial ratios.
A Generalization Model and Learning in Hardware
Authors: Alexander Nicholson
Venue:  (2000)

We study two problems in the field of machine learning. First, we propose a novel theoretical framework for understanding learning and generalization which we call the bin model. Using the bin model, a closed form is derived for the generalization error that estimates the out-of-sample performance in terms of the in-sample performance. We address the problem of overfitting, and show that using a simple exhaustive learning algorithm it does not arise. This is independent of the target function, input distribution and learning model, and remains true even with noisy data sets. We apply our analysis to both classification and regression problems and give an example of how it may be used efficiently in practice. Second, we investigate the use of learning and evolution in hardware for digital circuit design. Using the reactive tabu search for discrete optimization, we show that we can learn a multiplier circuit from a set of examples. The learned circuit makes less than 2% error and uses fewer chip resources than the standard digital design. We compare use of a genetic algorithm and the reactive tabu search for fitness optimization and show that the reactive tabu search performs significantly better on a 2-bit adder design problem for a similar execution time.
Complexity Issues in Global Optimization: A Survey
Authors: Stephen A. Vavasis
Venue:  (1993)

Complexity theory refers to the asymptotic analysis of problems and algorithms. How efficient is an algorithm for a particular optimization problem, as the number of variables gets large? Are there problems for which no efficient algorithm exists? These are the questions that complexity theory attempts to address. The theory originated in work by Hartmanis and Stearns (1965). By now there is much known about complexity issues in nonlinear optimization. In particular, our recent book Vavasis (1991) contains all the details on many of the results surveyed in this chapter. We begin the discussion with a look at convex problems in the next section. These problems generally have efficient algorithms. In Section 3 we study the complexity of two nonconvex problems that also have efficient algorithms because of special structure. In Section 4, we look into hardness results (proofs of the nonexistence of efficient algorithms) for general nonconvex problems. Finally, in Section 5 we look at recent developments in "approximation" algorithms. We follow the notation in this chapter that lower-case boldface letters are vectors, lower-case italic letters are scalars, and upper-case italic letters are sets or matrices. Superscript T indicates matrix transpose, and aTx indicates inner product. The operators''<'' and ''y if each entry of x is greater than or equal to the corresponding entry of y.
Some Comments on the Information Stored in Sparse Distributed Memory
Authors: Jan Kristoferson
Venue:  (2001)

An unknown number T of random data vectors have been stored in a sparse distributed memory with randomly chosen hard locations. A method is given to estimate T. The estimate is unbiased, and the coefficient of variation is roughly inversely proportional to the square root of MU, where M is the number of hard locations in the memory and U the length of data. 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 Performance Model of Adaptive Routing in k-Ary n-Cubes with Matrix-Transpose Traffic
Authors: Hamid Sarbazi-Azad, Lewis M. Mackenzie, Mohamed Ould-Khaoua
Venue: Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing (2000)

Several analytical models of fully adaptive routing in wormhole-routed k-ary n-cubes under the uniform traffic pattern have recently been proposed in the literature. Although the uniform reference model has been widely used in the past, it is not always true in practice as there are many applications that exhibit non-uniform traffic patterns. There has not been so far any study that describes an analytical model of fully adaptive routing under permutation traffic patterns. This paper describes a new analytical model of fully adaptive routing in k-ary n-cubes in the presence of non-uniform traffic generated by matrix-transpose permutations, which is an important communication operation found in many matrix computation problems. Results obtained through simulation experiments confirm that the model predicts message latency with a reasonable degree of accuracy under different working conditions.
The Complexity of Equivalence and Containment for Free Single Variable Program Schemes
Authors: Steven Fortune, John E. Hopcroft, Erik M Schmidt
Venue:  (1977)

Non-containment for free single variable program schemes is shown to be NP-complete. A polynomial time algorithm for deciding equivalence of two free schemes, provided one of them has the predicates appearing in the same order in all executions, is given. However, the ordering of a free scheme is shown to lead to an exponential increase in size.
Applying Use Cases for the Requirements Validation of Component-Based Real-Time Software
Authors: Wolfgang Fleisch
Venue: Proceedings of the 2nd IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (1999)

Component-based software development is a promising way to improve quality, time to market and handle the increasing complexity of software for real-time systems. In this paper the basic properties of an event-triggered component model for real-time software are introduced. For the early exposure of design errors a process for the simulation based validation of component-based software applying use cases is presented. A template for structuring use cases helps gathering the course-oriented requirements which describe the required behaviour of the composed software. Requirements sequence diagrams are extracted from the use cases and compared with the simulated behaviour of the component-based software. A case study of a power window control from the automotive body electronics domain demonstrates practical experience with applying use cases for the requirements validation.
A March-Based Fault Location Algorithm for Static Random Access Memories
Authors: V. A. Vardanian, Y. Zorian
Venue: Proceedings of the Proceedings of The Eighth IEEE International On-Line Testing Workshop (IOLTW'02) (2002)

A March-based fault location algorithm is proposed for repair of word-oriented Static RAMs. A March CL algorithm of complexity 12N, N is the number of memory words, is defined for fault detection and partial diagnosis. A 3N or 4N March-like algorithm is used for location of the aggressor words of inter-word state, idempotent, inversion, write-disturb coupling faults (CF). Then another March-like algorithm of complexity 9(1+logB), B is the number of bits in the word, is applied to locate the aggressor bit in the aggressor word. Finally, a March algorithm of complexity 6(1+logB) N is used to detect and locate intra-word stuck-at, transition faults, aswell as CFs. The proposed algorithm has higher fault location ability and lower time complexity than other known algorithms developed for fault location in SRAMs.
NeuroWeb: An Internet-Based Neural Network Simulator
Authors: Erich Schikuta
Venue: Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence (2002)

The NeuroWeb project is an Internet-based framework for the simulation of neural networks. It aims for using the Internet as a transparent environment to allow users the exchange of information (neural network objects, neural network paradigms) and the exploit of available computing resources for neural network specific tasks (specifically training of neural networks). NeuroWeb's design principles are acceptance, homogeneity, and efficiency.
A Synchronization and Flow Control Scheme for Interactive Multimedia-on-Demand (MOD) Systems
Authors: Chung-Ming Huang, Chian Wang, Hsu-Yang Kung
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems (2000)

An interactive Multimedia-on-Demand (MOD) system in the multi-stream environment should have the following two features. (i) According to the media type, media units are stored in text, image, graphics, audio, and video media bases at the server site and are transmitted to the client site through text, image, graphics, audio, and video communication channels, respectively. (ii) VCR-like user interactions, i.e., reverse, skip, freeze-restart, and scale are provided. However, synchronization control with VCR-like user interactions in the multi-stream environment is very complicated and difficult. The main reasons are that (i) those media units stored in the client buffers and flowing in the networks may be either useful or useless when the user interaction is issued, and (ii) the servers' media transmission should be adjusted according to the presentation status of the client. Additionally, different VCR-like user interactions have their own processing considerations, which result in different control schemes for different VCR-like user interactions. In this paper, we propose some control schemes to handle interactive multimedia communication in the distributed multi-stream environment and develop an MOD system on SUN SPARC workstations accordingly.
Dynamic Transport Protocol Selection in a CORBA System
Authors: Tatsuo Nakajima
Venue: Proceedings of the Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2000)

This paper reports supporting dynamic transport selection in omniORB2, which is a CORBA 2.0 compliant CORBA system that has been developed at AT& T Laboratories, in Cambridge. We describe our design and implementation of supporting dynamic transport protocol selection in our system, and some initial experiments with the system.In our approach, IIOP can be selected for ensuring interoperability between applications. Thus, applications adopting our system can communicate with those adopting other CORBA systems, which run on the Internet environment. On the other hand, an application can select more suitable transport protocols for improving its performance or ensuring its real-time constraints if a server also supports the same transport protocol according to the characteristic of the application.
Techniques that Improved the Timing Convergence of the Gekko PowerPC Microprocessor
Venue: Proceedings of the 2nd International Symposium on Quality Electronic Design (2001)

Wire capacitance models used in some synthesis tools have been based on number of fanouts. These wire capacitance models can be misleading when compared to real wiring. This discrepancy can cause synthesis tools to optimize incorrectly causing severe problems with chip level timing convergence. Designs may take longer than expected and designers may work on timing paths that are not critical thus increasing the design cycle. In sub-micron designs it is crucial to improve the timing convergence between synthesis and physical design.This paper describes several practical approaches used in timing convergence of the IBM Gekko PowerPC1 microprocessor that is used in the Nintendo Gamecube system. The impact of each approach is evaluated on the timing and size of the microprocessor. 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
Minimizing Inter-Clock Coupling Jitter
Authors: Ming-Fu Hsiao, Malgorzata Marek-Sadowska, Sao-Jie Chen
Venue: Proceedings of the 4th International Symposium on Quality Electronic Design (2003)

Crosstalk noise is a crucial factor affecting chip performance indeep submicron technologies. Among all possible crosstalk noisesources, clock is the most common aggressor as well as victim.Crosstalk on clock nets can increase clock jitter, which maydegrade significantly the system performance. Besides, in modernchip designs, there is usually more than one clock net, and sometimeseven tens of them. It is therefore imperative to design clocktopologies to prevent possible crosstalk among them. In this paper,we address the inter-clock crosstalk. We propose algorithms todesign clock topology and to perform routing minimizing the effectivecrosstalk. Our experimental results show a significant reductionof clock jitter compared to the conventional clock treesynthesis which does not take into account the inter-clock crosstalkeffects.
Asymptotic energy behavior of two classical intermediate benchmark shell problems
Authors: Lourenco Beirao da Veiga
Venue:  (2002)

We consider two classical problems which are widely used as benchmark tests for shell numerical methods: the Scordelis-Lo roof and the pinched roof. Due to the particular load and boundary conditions applied, neither belongs to the well known classes of purely bending or purely membrane dominated shells. Consequently the asymptotic energy norm behavior, which is useful not only because it represents the structure stiffness, but also for numerical comparison purposes, is not a priori known. In this work, using space interpolation techniques and a recently developed ``intermediate'''' shell theory, the asymptotic energy behavior of both problems is found analytically. The results are in agreement with the numerical estimates obtained in other papers.
From Metaphor to Method: Cartographic Perspectives on Information Visualization
Authors: André Skupin
Venue: Proceedings of the IEEE Symposium on Information Vizualization 2000 (2000)

By virtue of their spatio-cognitive abilities, humans are able to navigate through geographic space as well as meaningfully communicate geographic information represented in cartographic form. The current dominance of spatial metaphors in information visualization research is the result of the realization that those cognitive skills also have value in the exploration and analysis of non-geographic information. While mapping or landscape metaphors are routinely used in this field, there is a noticeable lack of consideration for existing cartographic expertise. This is especially apparent whenever problematic issues are encountered, such as graphic complexity or feature labeling. There are a number of areas in which a cartographic outlook could provide a valuable perspective. This paper discusses how geographic and cartographic notions may influence the design of visualizations for textual information spaces. Map projections, generalization, feature labeling and map design issues are discussed.
Directional Newton Methods in n Variables
Authors: Levin Yuri, Ben Adi
Venue:  (2000)

Directional Newton methods for functions $f$ of $n$ variables are shown to converge, under typical assumptions, to a solution of $f(\mathbf{x})=0$. The rate of convergence is quadratic, for near-gradient directions, and directions along components of the gradient of $f$ with maximal modulus. These methods are applied to solving systems of equations without inversion of the Jacobian matrix. Key words and phrases. Newton Method, Single equations, Systems of equations Mathematics Subject Classification. Primary 65H05, 65H10; Secondary 49M15
C++ from the Ground Up, Third Edition, 3 edition
Authors: Herbert Schildt
Venue:  (2003)

This excellent primer provides a plethora of C++ programming information for beginning to intermediate users on topics like classes, objects, expressions, arrays, pointers. Plus, it also covers advanced topics like inheritance, namespaces, STL, custom string class, and the Standard C++ Class Library. For users of all levels, this guide teaches with examples of source code and a thorough display of the results.Table of contents 1: The Story of C++ 2: An Overview of C++ 3: The Basic Data Types 4: Program Control Statements 5: Arrays and Strings 6: Pointers 7: Functions, Part One: The Fundamentals 8: Functions, Part Two: References, Overloading, and Default Arguments 9: More Data Types and Operators 10: Structures and Unions 11: Introducing the Class 12: A Closer Look at Classes 13: Operator Overloading 14: Inheritance 15: Virtual Functions and Polymorphism 16: Templates 17: Exception Handling 18: The C++ I/O System 19: Run-Time Type ID and the Casting Operators 20: Namespaces and Other Advanced Topics 21: Introducing the Standard Template Library 22: The C++ Preprocessor A: C-Based I/O B: Working with an Older C++ Compiler C: The .NET Managed Extensions to C++
Condition Numbers for Polyhedra with Real Number Data
Authors: Stephen Vavasis, Yinyu Ye
Venue:  (1993)

We develop a condition-based complexity analysis for homogeneous polyhedra with real number data. We analyze the dependency of primal-dual interior point algorithm efficiency on this condition number for finding a point in a polyhedron. Keywords: polyhedron, interior point algorithms, condition-based complexity