ppxscal/embedding_network huggingface dataset:
Conducting the Oracle Job Interview: IT Manager Guide for Oracle Job Interviews with Oracle Interview Questions
Authors: Mike R. Ault, Donald K. Burleson
Venue:  (2003)

:Using Oracle job interview questions that are not available to the general public, with this book the IT manager will be able to quickly assess the technical ability of any Oracle job candidate. Listed are the personality characteristics of successful Oracle professionals and how to identify candidates with the right demeanor as well as a checklist of background characteristics that indicate a suitable Oracle job candidate. Also provided are methods for evaluating academic and work history and oral interview questions for Oracle DBAs, developers, and Oracle analysts. Techniques for quickly scanning resumes for pertinent information are also given.About the Author:Mike Ault is a senior technical management consultant with TUSC, holds five Oracle master certificates, and is the author of fourteen Oracle related books. He lives in Atlanta, Georgia. Donald K. Burleson is the author of sixteen Oracle database books and is the editor-in-chief of Oracle Internals. His is an Oracle consultant with extensive experience with designing and implementing Oracle8 databases, including systems architect, project manager, data warehouse design, implementation and tuning, tuning massively parallel Oracle databases, Oracle SQL tuning, using Oracle with SAP and tuning very large Oracle databases. He lives in Kittrell, North Carolina.
A ramp model for distributed key distribution schemes
Authors: Carlo Blundo, Paolo D'Arco, Carles Padró
Venue: Discrete Applied Mathematics (2003)

A key distribution center (KDC) of a network is a server enabling private communications within groups of users. The center provides the secret keys for encrypting and decrypting the messages. A distributed key distribution center (DKDC) is a set of servers that jointly realizes a KDC. In this paper we introduce a ramp model for unconditionally secure DKDC. In the ramp approach, the required resources (randomness, information storage, messages to be exchanged, etc.) can be reduced at the cost of a security degradation which depends on the size of the coalition of users who tries to break the scheme. We show lower bounds on the amount of information needed to setup and manage such a DKDC and describe a simple protocol meeting the bounds.
On the relationship between file sizes, transport protocols, and self-similar network traffic
Authors: Kihong Park, Gitae Kim, Mark Crovella
Venue: Proceedings of the 1996 International Conference on Network Protocols (ICNP '96) (1996)

Recent measurements of local-area and wide-area traffic have shown that network traffic exhibits variability at a wide range of scales. In this paper, we examine a mechanism that gives rise to self-similar network traffic and present some of its performance implications. The mechanism we study is the transfer of files or messages whose size is drawn from a heavy-tailed distribution.First, we show that in a ``realistic'' client/server network environment---i.e, one with bounded resources and coupling among traffic sources competing for resources---the degree to which file sizes are heavy-tailed can directly determine the degree of traffic self-similarity at the link level. We show that this causal relationship is robust with respect to changes in network resources (bottleneck bandwidth and buffer capacity), network topology, the influence of cross-traffic, and the distribution of interarrival times.Second, we show that properties of the transport layer play an important role in preserving and modulating this relationship. In particular, the reliable transmission and flow control mechanisms of TCP (Reno, Tahoe, or Vegas) serve to maintain the long-range dependency structure induced by heavy-tailed file size distributions. In contrast, if a non-flow-controlled and unreliable (UDP-based) transport protocol is used, the resulting traffic shows little self-similarity: although still bursty at short time scales, it has little long-range dependence.Third, we show performance implications of self-similarity as represented by performance measures including packet loss rate, retransmission rate, and queueing delay. Increased self-similarity, as expected, results in degradation of performance. Queueing delay, in particular, exhibits a drastic increase with increasing self-similarity. Throughput-related measures such as packet loss and retransmission rate, however, increase only gradually with increasing traffic self-similarity as long as reliable, flow-controlled transport protocol is used.
Micro-simulation modelling of traffic load on long-span congested bridges
Authors: E. O'Brien, H. Leendertz, A. A. Hayrapetova
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

This paper presents an alternative approach to the modelling and assessment of congested traffic loading events for long-span bridges. Micro-simulation, the process of modelling individual vehicles that is widely used in traffic engineering, is presented here as a means of predicting imposed traffic loading on long-span bridges. The traffic flow on congested bridge is modelled using a random mixing process for trucks and cars in each lane, calibrated to match driver behaviour. The method has been tested using a multi-span bridge in the Netherlands, which is heavily congested on regular basis.
A Proposal on FlexibleCUG Service Architecture
Authors: Teruyuki Komiya, Hitoshi Fuji, Motoi Sato
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops (2000)

VPN provides logical and secure communication groups independent of physical network configurations. When network users request to construct a VPN path, a network administrator has to check the consistency between the user request and the organization's security policy and to manually change the configurations of VPN equipment. In this paper, we propose a FlexCUG (Flexible Closed User Group) service architecture, which provides secure communication groups without any configuration by network administrators. This architecture is based on a three-layer model, in which network users can generate FlexCUG in accordance with the organization's security policy. As a result, this architecture achieves higher usability of VPN while complying with the organization's security policy.
Collaboration via internet and web
Authors: Ivan Tomek
Venue: Computer Science in Perspective: Essays Dedicated to Thomas Ottmann (2003)

Internet was originally created to make it possible to run programs on remote computers distributed over a variety of interconnected networks. In the next major advance, the Web was invented mainly to make access to documents on Internet as easy as possible. Current Web-related work - the Semantic Web - is motivated by the need for automated document processing. Although document access remains the Web's main purpose, both the Internet and the Web have also always been extensively used for various forms of social interaction, perhaps most importantly for collaboration. With the universal spread of computing and advancing globalization, support for social interaction and collaboration is becoming ever more important and research and development in this area are intense. In this paper, we classify the main approaches to social interaction support, present a model of a powerful framework for collaboration, and give examples of several existing Internet and Web-based applications that support parts of this model. We conclude by hypothesizing that a next step in Web development might be to use accumulated experience with ad hoc platform-dependent collaboration tools to develop a general Web framework supporting social interaction. This framework would advance the Web from its document-and data-centric present to a technology that supports collaboration and social interaction. We call this paradigm the Inhabited Web.
An overlapping domain decomposition preconditioner for a class of discontinuous Galerkin approximations of advection-diffusion problems
Authors: Caroline Lasser, Andrea Toselli
Venue: Mathematics of Computation (2003)

We consider a scalar advection-diffusion problem and a recently proposed discontinuous Galerkin approximation, which employs discontinuous finite element spaces and suitable bilinear forms containing interface terms that ensure consistency. For the corresponding sparse, nonsymmetric linear system, we propose and study an additive, two-level overlapping Schwarz preconditioner, consisting of a coarse problem on a coarse triangulation and local solvers associated to a family of subdomains. This is a generalization of the corresponding overlapping method for approximations on continuous finite element spaces. Related to the lack of continuity of our approximation spaces, some interesting new features arise in our generalization, which have no analog in the conforming case. We prove an upper bound for the number of iterations obtained by using this preconditioner with GMRES, which is independent of the number of degrees of freedom of the original problem and the number of subdomains. The performance of the method is illustrated by several numerical experiments for different test problems using linear finite elements in two dimensions.
AIDA-based Real-Time Fault-Tolerant Broadcast Disks
Authors: Azer Bestavros
Venue:  (1996)

Abstract The proliferation of mobile computers and wireless networks requires the design of future distributed real-time applications to recognize and deal with the significant asymmetry between downstream and upstream communication capacities, and the significant disparity between server and client storage capacities. Recent research work proposed the use of Broadcast Disks as a scalable mechanism to deal with this problem. In this paper, we propose a new broadcast disks protocol, based on our Adaptive Information Dispersal Algorithm (AIDA). Our protocol is different from previous broadcast disks protocols in that it improves communication timeliness, fault-tolerance, and security, while allowing for a finer control of multiplexing of prioritized data (broadcast frequencies). We start with a general introduction of broadcast disks. Next, we propose broadcast disk organizations that are suitable for real-time applications. Next, we present AIDA and show its fault-tolerance and security properties. We conclude the paper with the description and analysis of AIDA-based broadcast disks organizations that achieve both timeliness and fault-tolerance, while preserving downstream communication capacity.
Class-Confidence Critic Combining
Authors: Matti Aksela, Ramunas Girdziu"as, Jorma Laaksonen, Erkki Oja
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

This paper discusses a combination of two techniques for improving the recognition accuracy of on-line handwritten character recognition: committee classification and adaptation to the user. A novel adaptive committee structure, namely the Class-Confidence Critic Combination (CCCC) scheme, is presented and evaluated. It is shown to be able to improve significantly on its member classifiers. Also the effect of having either more or less diverse sets of memberclassifiers is considered.
Branch Classification to Control Instruction Fetch in Simultaneous Multithreaded Architectures
Authors: P. M. W. Knijnenburg, A. Ramirez, F. Latorre, J. Larriba, M. Valero
Venue: Proceedings of the International Workshop on Innovative Architecture for Future Generation High-Performance Processors and Systems (IWIA'02) (2002)

In Simultaneous Multithreaded architectures many separate threads are running concurrently, sharing processor resources, thereby realizing a high utilization rate of theavailable hardware. However, this also implies that threads are competing for resources and in many cases this competition can actually degrade overall performance. There are two major causes for this: first, instructions that, because of a long latency data cache miss, cause dependent instructions not to proceed for many cycles thereby wasting space in the instruction queues, and second, execution of instructions that belong to a mispredicted path. Both of these have a harmful effect on throughput and the second moreover wastes energy.In this paper we propose a fetch policy that avoids issuing instructions to the pipeline if we are not confident that the instruction belongs to the correct execution path. In this way, we avoid using resources for instructions that will not contribute to performance. This fetch policy, called agstall, is based on a dynamic branch classification mechanism. Branch instances are classified as either strongly biased or not strongly biased. We consider all strongly biasedbranches as easy to predict, and we stall the thread on not strongly biased branches to avoid mispredicting them. Our results show that agstall achieves similar or better performance than icount, and reduces by up to 86% the number of wrong-path instructions executed.
A Full-Parallel Digital Implementation for Pre-Trained NNs
Authors: Tamás Szabó, Lörinc Antoni, Gábor Horváth, Béla Fehér
Venue: Proceedings of the IEEE-INNS-ENNS International Joint Conference on Neural Networks (IJCNN'00)-Volume 2 - Volume 2 (2000)

In many applications, the most significant advantages of neural networks come mainly from their parallel architectures ensuring rather high operation speed. The difficulties of parallel digital hardware implementation arise mostly from the high complexity of the parallel many-multiplier structure. This paper suggests a new bit-serial/parallel neural network implementation method for pre-trained networks. The method makes possible significant hardware cost savings. The proposed approach - which is based on the results of a previously suggested method for efficient implementation of digital filters - uses bit-serial distribute d arithmetic.The efficient implementation of a matrix-vector multiplier is base d on an optimization algorithm, which utilizes the advantages of CSD (Canonic Signed Digit) encoding and bit-level pattern coincidences. The resulting architecture performs full-precision computation and allows high-speed bit-level pipeline operation. The proposed approach seems to be a promising one for FPGA and ASIC realization of pre-trained neural networks and can be integrated into automatic neural network design environments. However, these implementation methods can be useful in many other fields of digital signal processing.
Visualization of Large Complex Datasets Using Virtual Reality
Authors: S. Sarathy, K. Shujaee, K. Cannon
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

Major advances in high performance computing software and hardware have made it possible for designers and analysts to obtain detailed information about the behavior of complex systems. However, this has lead to a proliferation of vast amounts of data, which is beyond the ability of humans to easily comprehend using traditional visualization methods.The method presented here combines emerging visualization tools with data filtering and data mining techniques. This method uses Virtual Reality (VR) coupled with multi-media techniques to display information within an environment that allows non-expert users to understand and interpret the data. A prototype visualization tool was developed under a NASA SBIR Phase II effort.This paper builds on the results of this work and suggests a visualization framework that can be used to examine, comprehend and interpret results in any complex data set, particularly those used in support of decision making activities.
Statistical characteristics and multiplexing of MPEG streams
Authors: M. Krunz, R. Sass, H. Hughes
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2 (1995)

This paper presents a study of the statistical characteristics and multiplexing of variable-bit-rate (VBR) MPEG-coded video streams. Our results are based on 23 minutes of video obtained from the entertainment movie, The Wizard of Oz. The experimental setup which was used to capture, digitize, and compress the video stream is described. Although the study is conducted at the frame level (as opposed to the slice level), it is observed that the inter-frame correlation structure for the frame-size sequence involves complicated forms of pseudo-periodicity that are mainly affected by the compression pattern of the sequence. A simple model for an MPEG traffic source is developed in which frames are generated according to the compression pattern of the original captured video stream. The number of cells per frame is fitted by a lognormal distribution. Simulations are used to study the performance of an ATM multiplexer for MPEG streams.
Molecular Dynamics Simulation and Visualization
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

We have developed atomic-scale material models capable of melting, crystallization and amorphization. These models feature molecular dynamics governed by Langevin equations of motion in which particle interact through attractive covalent forces and short-range repulsion forces. Also, we present an interactive virtual visualization tool for the simulation of atomic scale material behavior. An application of this research is to understand the processes that can control the quality of a single-crystal Si grown from the melt.
Critical Sections and Producer/Consumer Queues in Weak Memory Systems
Authors: Lisa Higham, Jalal Kawash
Venue: Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (1997)

In machines with a weak memory consistency model, the ordering constraints on memory accesses are few. In order to properly program these machines, certain powerful explicit synchronization instructions are additionally provided by their architecture. We show that although a solution to the critical section problem (also referred to as the mutual exclusion problem) is impossible without such powerful synchronization, certain versions of the producer/consumer problem can be solved even in the weakest systems without the need for any such powerful instructions. These instructions are expensive, and avoiding their use is desirable for better performance.
Chaining Techniques for Automated Theorem Proving in Many-Valued Logics
Authors: Harald Ganzinger, Viorica Sofronie-Stokkermans
Venue: Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic (2000)

We apply chaining techniques to automated theorem proving in many-valued logics. In particular, we show that superposition specializes to a refined version of the many-valued resolution rules introduced by Baaz and Fermüller, and that ordered chaining can be specialized to a refutationally complete inference system for regular clauses.
Streets of Byzantium: Network Architecture for Fast Reliable Broadcasts
Authors: Ozalp Babaoglu, Rogerio Drummond
Venue:  (1984)

A site broadcasting its local value to all other sites in a fault-prone environment is a fundamental paradigm in constructing reliable distributed systems. Time complexity lower bounds and network connectivity requirements for reliable broadcast protocols in point-to-point communication networks are well known. In this paper we consider the reliable broadcast problem in distributed systems with broadcast networks (for example, Ethernets) as the basic communication architecture. We show how properties of such network architectures can be used to effectively restrict the externally visible behavior of faulty processors. We use these techniques to derive simple protocols that implement reliable broadcast in only two rounds, independent of the failure upper bounds.
Learning Red Hat Linux (with CD-ROM), Second Edition, 2 edition
Authors: Bill McCarty
Venue:  (2002)

: New users are flocking to Linux literally by the millions. Yet most of these new users draw from Microsoft Windows as their primary computing experience; for them an operating system from the UNIX family is an unfamiliar experience. In Learning Red Hat Linux, Bill McCarty has written a book aimed specifically at this new audience. Learning Red Hat Linux will guide any new user of Linux through the installing and use of Red Hat Linux, the free operating system that is shaking up the commercial world of software. It demystifies Linux in terms familiar to Windows users and gives readers only what they need to start being successful users of Linux. Built around the popular Red Hat distribution of Linux, Learning Red Hat Linux takes the reader step by step through the process of installing and setting up a Red Hat Linux system, and provides a thorough but gentle introduction to the basics of using Red Hat Linux. Because the book is written specifically for the enclosed CD, the reader needs nothing else to get started with this exciting new operating system.
Efficient meta-level control in bounded-rational agents
Authors: Anita Raja, Victor Lesser
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

An important issue for complex agents operating in open real-time environments is how to sequence execution and computation actions without consuming too many resources. An empirical approach to this meta-level control problem is presented. We show that explicit meta-level control leads to significant improvement in agent performance.
Agent-Oriented Material Flow Control System Based on DCOM
Authors: R. Schoop, R. Neubert
Venue: Proceedings of the Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2000)

This paper reports on the design and realization of an agent-oriented control system dedicated for material flow systems. The implementation is based on DCOM (Distributed Component Object Model). Regarding the increasing availability, performance and acceptance of distributed object-oriented systems as well as the growing number of agent-oriented software it is natural to adapt and use the capabilities of both object-oriented and agent-oriented software as a platform for distributed industrial applications.
Developing a Linear Algorithm for Cubing a Cyclic Permutation
Authors: Jinyun Xue, David Gries
Venue:  (1986)

A linear algorithm is developed for cubing a cyclic permutation stored as a function in an array. This continues work discussed in [0] and [1] on searching for disciplined methods for developing and describing algorithms that deal with complicated data structures such as linked lists. Here, a different representation of a cyclic permutation reveals a simple algorithm; then, an equally simple coordinate transformation is used to yield the final algorithm.