ppxscal/embedding_network huggingface dataset:
Wireless Communications Systems: Advanced Techniques for Signal Reception
Authors: Xiaodong Wang, H. Vincent Poor
Venue:  (2003)

:A unified framework for using today's most advanced signal processing techniquesDriven by the rapidly escalating capacity demands of emerging wireless systems, researchers havedeveloped a wide array of novel signal processing techniques for use in such systems. Now, twoleading researchers synthesize the field's vast new literature, giving working engineers practicalguidance for designing advanced wireless receivers.Drs. Xiaodong Wang and H. Vincent Poor offer a complete framework for developing, analyzing, andunderstanding the explicit algorithms needed for advanced processing in emerging wireless systems.They address a full range of physical-layer issues, including multipath, dispersion, interference,dynamism, and multiple-antenna systems. In many cases, the authors themselves developed the methodsthey present. Coverage includes: An overview of contemporary wireless signaling environments and basic receiver signal processing techniques Blind, group-blind, space-time, and turbo multiuser detection Robust multiuser detection in non-Gaussian channels Narrowband interference suppression: linear and non-linear predictive techniques, performance comparisons, and more Monte Carlo Bayesian signal processing Signal processing for fast fading channels Advanced signal processing for coded OFDM systems
Flexible security policies in SQL
Authors: Steve Barker, Arnon Rosenthal
Venue: Proceedings of the fifteenth annual working conference on Database and application security (2001)

We show how a wide variety of role-based access control policies may be formally specified in the stratified subset of clause form logic. We then show how these formal specifications may be automatically translated into a small subset of SQL to be used to seamlessly protect an SQL database from unauthorized read and update requests made by authenticated users. We demonstrate the power of our approach by showing how a variety of access control policies can be represented.
Solaris 9 Operating Environment Reference
Authors: Janice Winsor
Venue:  (2002)

From the Book:PrefaceThe Solaris 9 Operating Environment Reference is your complete guide to all of the manual pages in Section 1, "User Commands," of the online reference documentation (except the FMLI commands).All documentation references within this guide are to the official Solaris documentation. AudienceThis book is for any user of the Solaris Operating Environment who needs to refer to any of the Section 1 User Commands in the online manual pages for quick reference or for more detailed information.How This Book Is OrganizedThe Introduction chapter provides a quick reference to the contents of this book by functional grouping. The commands are grouped alphabetically within their installation package categories. Within the "Core Solaris (Usr)" category, the commands are grouped by function.The Introduction chapter also provides a list of commands added in the Solaris 8 and Solaris 9 releases along with a list of commands that were removed from each release.This book is a dictionary-style alphabetic reference to the A through Z commands.
Source-Tree Routing in Wireless Networks
Authors: J. J. Garcia-Luna-Aceves, Marcelo Spohn
Venue: Proceedings of the Seventh Annual International Conference on Network Protocols (1999)

We present the source-tree adaptive routing (STAR) protocol and analyze its performance in wireless networks with broadcast radio links. Routers in STAR communicate to its neighbors their source routing trees either incrementally or in atomic updates. Source routing trees are specified by stating the link parameters of each link belonging to the paths used to reach every destination. Hence, a router disseminates link-state updates to its neighbors for only those links along paths used to reach destinations. Simulation results show that STAR is an order of magnitude more efficient than any topology-broadcast protocol, and four times more efficient than ALP, which was the most efficient table-driven routing protocol based on partial link-state information reported to date. The results also show that STAR is even more efficient than the Dynamic Source Routing (DSR) protocol, which has been shown to be one of the best performing on-demand routing protocols.
The linearity of low frequency traffic flow: an intrinsic I/O property in queueing systems
Authors: J. D. Pruneski, San-Qi Li
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2 (1995)

Consider a class of queueing systems which can be modeled by a finite quasi-birth-death (QBD) process. In this paper we develop a powerful computational technique for spectral analyses (i.e. second-order statistics) of output, queue and loss. Emphasis is placed on output power spectrum and input-output coherence function in response to various input power spectral properties and system parameters. The coherence function is defined to measure linear relationship between input and output processes. A key technical contribution of this paper is the exploration of linearity of low frequency traffic flow. Through the evaluation of the coherence function, one can identify a so-called nonlinear break frequency, /spl omega//sub b/, under which the low frequency traffic stay intact via a queueing system. Such a low frequency I/O linearity plays an important role in characterizing the output process, which may form a partial input to other "downstream" queues of the network. After all, it is the "upstream" output low frequency characteristics that will have most impact on the "downstream" queueing performance. Our study further indicates that the link capacity required by an input process is essentially characterized by its maximum input rate filtered at /spl omega//sub b/.
Mobile Flash MX, 1 edition
Authors: Alan Yeung, Nicholas Pang
Venue:  (2003)

:Go mobile with the most popular motion tool on the Web. Written by a team of software development experts, this thorough resource will help you build, deploy, and run rich media applications across multiple channels and devices. Plus, utilize JSP, ASP.NET, or ColdFusion MX to port information dynamically.
The Next Generation Software Platform for Mobile Phones
Authors: Yukikazu Nakamoto
Venue: Proceedings of the Sixth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2003)

Recently mobile phones provide not only voice service but internet access, multi-media message services, games, local communication controller and so on. Therefore, more productive software platforms are required. We develop the next generation software platform based on Linux. In the paper, we describe a summary of the software platform. First, backgrounds are mentioned, including recent and future functionalities in mobile phones. Then, we summarize requirements for mobile phone Linux. Third, we describe functionalities of middleware for the mobile phones on top of Linux. Lastly future trends in mobile phone software are presented.
Design and evaluation of the mechanism for object references in a parallel object-oriented database system
Authors: K. Imasaki, T. Ono, T. Horibuchi, A. Makinouchi, H. Amano
Venue: Proceedings of the 1997 International Symposium on Database Engineering & Applications (1997)

Four object reference mechanisms for a parallel object-oriented database system (OODBS) and used by a massively parallel programming language (MAPPLE) are tested by the parallel 001 Benchmark. Out of these mechanisms, the object allocation table (OAT) was the most successful when many objects existed and were moved across processors. The OAT stores object identifiers (OIDs) that are independent of the object location and are paired with an indicator of the object location. In addition, the evaluation results show that when the number of object references among processors is large, an OAT entry should be inserted when an object is created. If the number is small, an OAT entry should be inserted when an object is referenced for the first time.
On planarity and colorability of circulant graphs
Authors: Clemens Heuberger
Venue: Discrete Mathematics (2003)

For given positive integers n, a1,..., am, we consider the undirected circulant graph G = (V, E) with set of vertices V = {0,..., n - 1} and set of edges E = {[i,j]: i - j ≡ ±ak (mod n) for some 1 ≤ k ≤ m}. We prove that G is planar if m = 1 and non-planar if m ≥ 3. For m = 2 we completely characterize planarity. It is shown that G is bipartite if and only if there is an l such that 2l divides a1,..., am, 2l+1|n, but 2l+1|aj for 1 ≤ j ≤ m. If m ≤ 2, we also calculate the chromatic number of G.
Building Responsive Systems from Physically-correct Specifications
Authors: Azer Bestavros
Venue:  (1993)

Abstract Predictability -- the ability to foretell that an implementation will not violate a set of specified reliability and timeliness requirements -- is a crucial, highly desirable property of responsive embedded systems. This paper overviews a development methodology for responsive systems, which enhances predictability by eliminating potential hazards resulting from physically-unsound specifications. The backbone of our methodology is the Time-constrained Reactive Automaton (TRA) formalism, which adopts a fundamental notion of space and time that restricts expressiveness in a way that allows the specification of only reactive, spontaneous, and causal computation. Using the TRA model, unrealistic systems -- possessing properties such as clairvoyance, caprice, infinite capacity, or perfect timing -- cannot even be specified. We argue that this ``ounce of prevention'''' at the specification level is likely to spare a lot of time and energy in the development cycle of responsive systems -- not to mention the elimination of potential hazards that would have gone, otherwise, unnoticed. The TRA model is presented to system developers through the Cleopatra programming language. Cleopatra features a C-like imperative syntax for the description of computation, which makes it easier to incorporate in applications already using C. It is event-driven, and thus appropriate for embedded process control applications. It is object-oriented and compositional, thus advocating modularity and reusability. Cleopatra is semantically sound; its objects can be transformed, mechanically and unambiguously, into formal TRA automata for verification purposes, which can be pursued using model-checking or theorem proving techniques. Since 1989, an ancestor of Cleopatra has been in use as a specification and simulation language for embedded time-critical robotic processes.
Optimal Tracing and Incremental Reexecution for Debugging Long-Running Programs
Authors: Robert H.B. Netzer, Mark H. Weaver
Venue:  (1994)

Debugging requires execution replay. Locations of bugs are rarely known in advance, so an execution must be repeated over and over to track down bugs. A problem arises with repeated reexecution for long-running programs and programs that have complex interactions with their environment. Replaying long-running programs from the start incurs too much delay. Replaying programs that interact with their environment requires the difficult (and sometimes impossible) task of exactly reproducing this environment (such as the connections over a one-day period to an X server). We solve these problems by incremental checkpointing and replay. By periodically checkpointing parts of the execution''s state, it can be restarted from intermediate points, bounding the delay to replay any part of the execution and allowing parts of the execution to be skipped. We present adaptive tracing strategies that provide bounded-time incremental replay and that are nearly optimal. Our techniques track reads and writes to memory using space-efficient two-level bitvectors. Our implementation on a Sparc 10 traces less than 15 kilobytes/sec for CPU-intensive programs and for interactive programs the slowdown is low enough that tracing can be left on all the time.
A Scientific Basis for Computational Science
Authors: Raul E. Valdes-Perez
Venue:  (1993)

Computational science is a productive intellectual activity. It produces highly useful computer programs that require much creativity and ingenuity to develop. Moreover, computation is a powerful theoretical tool for natural scientists. However, can computational science have a scientific foundation, quite apart from its roles as a juxtaposition of disciplines and as another theoretical tool for scientists? That is, can computational science develop concepts that enable a broad systematic understanding of inference and discovery in science? This paper makes a case for an affirmative answer that relies on the concept of "generic scientific task." We will argue that theoretical understanding is to be attained by identifying and automating such tasks. To develop the idea, we configure samples of previous work in computational science (broadly construed), lay a road map to guide further research, and suggest experimental tools to generate research problems and to re-deploy proven techniques.
A Local Approach to Reasoning with Conditional Knowledge Bases
Authors: Salem Benferhat, Laurent Garcia
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

This paper investigates a local approach for reasoning with conditional knowledge bases (with default rules of the form "generally, if a then b" and having possibly some exceptions). The idea is that when a conflict appears (due to observing exceptional situations), we first localize the sets of pieces of information which are responsible for conflicts. Next, using specificity principle (subclasses must be preferred to general classes), we attach priorities to default rules inside each conflict. These priorities, implicitly computed from the knowledge base, reflect the hierarchical structure of the knowledge base. Lastly, we rank-order and solve conflicts in a way that only minimal sets of rules are given up from the knowledge base in order to restore its consistency. This local way to deal with conflicts addresses correctly the well known problems of specificity, irrelevance, blocking of inheritance, etc.
Expected search duration for finite backtracking adaptive search
Authors: D. L. J. Alexander, D. W. Bulger, G. R. Wood
Venue: Journal of Algorithms (2003)

Backtracking adaptive search is an optimisation algorithm which generalises pure adaptive search and hesitant adaptive search. This paper considers the number of iterations for which the algorithm runs, on a problem with finitely many range levels, in order to reach a sufficiently extreme objective function level. A difference equation for the expectation of this quantity is derived and solved. Several examples of backtracking adaptive search on finite problems are presented, including special cases that have received attention in earlier papers.
A Comparative Study of Environmental Cognition in a Real Environment and its VRML Simulation (Virtual Reality Modelling Language)
Authors: Ayman H. Mahmoud, Andrew Clayden
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

This paper investigates the acquisition of environmental cognitive knowledge in a real world and its desktop VRML simulation. It focuses on the effect of design background and gender on spatial cognition in both displays. A post-test-only control-group design is used examine to what extent, could a desktop VRML simulation provide users with cognitive data that is comparable to real-world experience. Results indicate that there is a between-group agreement and disagreement depending on the typology of space. Participants in desktop VRML could provide cognitive distance estimations that are equivalent to their counterparts in real world. Design background did have a significant effect on spatial cognition in real world, however it did not show a remarkable effect in desktop VRML. Gender has an effect on estimating heights in real world, however it does not show any effect in desktop VRML.
Weight structures for approximate reasoning with weighted expressions
Authors: S. Lehmke
Venue: Proceedings of the 26th International Symposium on Multiple-Valued Logic (1996)

One method of constructing an 'approximate reasoning' system is to use a 'classical' system of many-valued logic and attach to each logical expression a 'weight' which assesses the validity of this expression. Several such systems have been described in the literature, with varying interpretations concerning structure and semantics of weights. In this paper, a 'canonical' principle for defining the fundamental relations model and semantic consequence for logics with weighted expressions is described, which not only allows a large variety of truth-value and weight structures, but furthermore allows to transfer the results of 'classical' model theory to the resulting logics in a natural way.
Loop Quantization: an Analysis and Algorithm
Authors: Alexander Aiken, Alexandru Nicolau
Venue:  (1987)

Loop unwinding is a well-known technique for reducing loop overhead, exposing parallelism, and increasing the efficiency of pipelining. Traditional loop unwinding is limited to the innermost loop of a set of nested loops and the amount of unwinding is either fixed or must be specified by the user. In this paper we present a general technique, loop quantization, for unwinding multiple nested loops, explain its advantages over other transformations, and illustrate its practical effectiveness. An abstraction of nested loops is presented which leads to results about the complexity of computing quantizations and an algorithm.
A Design for Test Proposal for Improving Dynamic Current Testing Reliability on Regenerative Sense Amplifiers
Authors: Javier Arguelles, Salvador Bracho
Venue: Proceedings of the 1997 IEEE International Workshop on IDDQ Testing (IDDQ '97) (1997)

A design for test method for improving dynamic supply current testing reliability on regenerative sense amplifier structures is described in this paper. This proposal uses a built-in current monitor to represent the supply current trough the regenerative sense amplifier by a digital signature, externally analyzed by a digital tester. A fully differential fast comparator circuit has been used as a demonstrator to explore the effectiveness of the proposal. Different catastrophic faults at transistor level were considered, simulation results are discussed.
Estimation of Sparse Hessian Matrices and Graph Coloring Problems
Authors: Thomas F. Coleman, Jorge J. More
Venue:  (1982)

Large scale optimization problems often require an approximation to the Hessian matrix. If the Hessian matrix is sparse then estimation by differences of gradients is attractive because the number of required differences is usually small compared to the dimension of the problem. The problem of estimating Hessian matrices by diferences can be phrased as follows: Given the sparsity structure of a symmetric matrix $A$, obtain vectors $d_{1},d_{2},\ldots,d_{p}$ such that $Ad_{1},Ad_{2},\ldots,Ad_{p}$ determine $A$ uniquely with $p$ as small as possible. We approach this problem from a graph theoretic point of view and show that both direct and indirect approaches to this problem have a natural graph coloring interpretation. The complexity of the problem is analyzed and efficient practical heuristic procedures are developed. Numerical results illustrate the differences between the various approaches.
A Practical Approach to Knowledge Representation and Reasoning in Relational Databases
Authors: Jie Cheng, David A. Bell, and Weiru Liu
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

In this paper we briefly describe a practicable approach to extend relational databases to deductive databases by using a two-level-knowledge-representation mechanism. By this approach, we developed a deductive database add-in module that can be easily integrated with relational databases. Therefore, users can get deductive reasoning functionality without changing their favorite relational databases and query languages. This approach proved to be efficient on knowledge-base organization and reasoning in real world applications.
Fairy Dust, Secrets, and the Real World
Authors: S. W. Smith
Venue: IEEE Security and Privacy (2003)

Simply trying to keep something a secret challenges us to rethink the assailability of our systems' defenses.
Nonexhaustive Generalized Fibonacci Trees in Unequal Costs Coding Problems
Authors: Julia Abrahams
Venue:  (1998)

In a sequence of generalized Fibonacci trees, the k-th tree has the (k-c(i))-th tree as its i-th subtree for a nondecreasing sequence of positive integers c(i), i=1,...,r. For particular initializations, each tree in the generalized Fibonacci sequence solves a minimax coding problem related to Varn coding. Specifically, each symbol from a uniformly distributed source is to be encoded by a string of code symbols associated with the path through the tree from the root to the leaf associated with the source symbol, the i-th code symbol costs c(i), and the goal is to minimize maximum codeword cost. 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
Representing Generic Solid Models by Constraints
Authors: Lee A Barford
Venue:  (1986)

A generic solid is a representation of a class of similar solid objects. This report introduces microCOSM, a constraint language for specifying generic solids. MicroCOSM allows relationships between parts of an object to be expressed as constraints between those parts. As a result, microCOSM can express many more such relationships than current languages for building generic solids. An editor for building and modifying two-dimensional generic solids in microCOSM has been written. This report describes the microCOSM language, the user interface, and implementation of the editor, and concludes with a discussion of some improvements that should be made to the editor.
Estimating 3D Body Pose using Uncalibrated Cameras
Authors: Romer Rosales, Matheen Siddiqui, Jonathan Alon, Stan Sclaroff
Venue:  (2001)

Abstract An approach for estimating 3D body pose from multiple, uncalibrated views is proposed. First, a mapping from image features to 2D body joint locations is computed using a statistical framework that yields a set of several body pose hypotheses. The concept of a ``virtual camera'''' is introduced that makes this mapping invariant to translation, image-plane rotation, and scaling of the input. As a consequence, the calibration matrices (intrinsics) of the virtual cameras can be considered completely known, and their poses are known up to a single angular displacement parameter. Given pose hypotheses obtained in the multiple virtual camera views, the recovery of 3D body pose and camera relative orientations is formulated as a stochastic optimization problem. An Expectation-Maximization algorithm is derived that can obtain the most likely (self-consistent) combination of body pose hypotheses. Performance of the approach is evaluated with synthetic sequences as well as real video sequences of human motion.