ppxscal/embedding_network huggingface dataset:
Hacker Cracker: A Journey from the Mean Streets of Brooklyn to the Frontiers of Cyberspace
Authors: Ejovi Nuwere, David Chanoff
Venue:  (2003)

:One of the most gripping yet improbable stories spawned by the computer revolution, Hacker Cracker is a classic American-dream success story set on the razor edge of high technology. Ejovi Nuwere takes the reader on the roller-coaster ride of his extraordinary life, from the bullet-riddled, drugged-out streets of one of America's most notorious ghettos to a virtual world where identities shift and paranoia rules, where black-hat hackers and white-hat sleuths confront each other by day and switch roles at night in the ongoing war to control America's most sensitive computer systems. It is a story of an African American boy coming of age in the new millennium, a story that vibrates with the themes of American life, those we know and those we are just beginning to glimpse.
Hidden Loop Recovery for Handwriting Recognition
Authors: David Doermann, Nathan Intrator, Ehud Rivlin, Tal Steinherz
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

One significant challenge in the recognition of offline handwriting is in the interpretation of loopstructures. Although this information is readily available in online representation, close proximity of strokes often merges their centers making them difficult to identify. In this paper a novel approach to the recovery of hidden loops in offline scanned document images is presented.The proposed algorithm seeks blobs that resemble truncated ellipses. We use a sophisticated form analysis method based on mutual distance measurements between the two sides of a symmetric shape. The experimental results are compared with the ground truth of the onlinerepresentations of each offline word image. More than 86% percent of the meaningful loops are handled correctly.
Acyclic and k-distance coloring of the grid
Authors: Guillaume Fertin, Emmanuel Godard, André Raspaud
Venue: Information Processing Letters (2003)

In this paper, we give a relatively simple though very efficient way to color the d-dimensional grid G(n1,n2,...,nd) (with ni vertices in each dimension 1 ≤ i ≤ d), for two different types of vertex colorings: (1) acyclic coloring of graphs, in which we color the vertices such that (i) no two neighbors are assigned the same color and (ii) for any two colors i and j, the subgraph induced by the vertices colored i or j is acyclic; and (2) k-distance coloring of graphs, in which every vertex must be colored in such a way that two vertices lying at distance less than or equal to k must be assigned different colors. The minimum number of colors needed to acyclically color (respectively k-distance color) a graph G is called acyclic chromatic number of G (respectively k-distance chromatic number), and denoted a(G) (respectively χk(G)).The method we propose for coloring the d-dimensional grid in those two variants relies on the representation of the vertices of Gd(n1,...,nd) thanks to its coordinates in each dimension; this gives us upper bounds on a(Gd(n1,...,nd)) and χk(Gd(n1,...,nd)).We also give lower bounds on a(Gd(n1,...,nd)) and χk(Gd(n1,...,nd)). In particular, we give a lower bound on a(G) for any graph G; surprisingly, as far as we know this result was never mentioned before. Applied to the d-dimensional grid Gd(n1,...,nd), the lower and upper bounds for a(Gd(n1,...,nd)) match (and thus give an optimal result) when the lengths in each dimension are "sufficiently large" (more precisely, if Σ i=1d 1/ni ≤ 1). If this is not the case, then these bounds differ by an additive constant at most equal to 1- ⌊Σi=1d1/ni⌋. Concerning χk(Gd(n1,...,nd)), we give exact results on its value for (1) k = 2 and any d ≥ 1, and (2) d = 2 and any k ≥ 1.In the case of acyclic coloring, we also apply our results to hypercubes of dimension d, Hd, which are a particular case of Gd(n1,...,nd) in which there are only 2 vertices in each dimension. In that case, the bounds we obtain differ by a multiplicative constant equal to 2.
Survivable Discrete Circuits Design
Authors: A. Matrosova, V. Andreeva, Yu. Sedov
Venue: Proceedings of the Proceedings of The Eighth IEEE International On-Line Testing Workshop (IOLTW'02) (2002)

Schemes providing a synchronous sequential circuit (SSC) or combinational circuit (CC) survivability for unidirectional transient and intermittent faults are suggested. They are based on doubling self-checking circuits with using a self-testing checker for one of them and masking a fault manifestation with OR, AND and MX circuits. The schemes ensure a correct behavior when any scheme permissible fault occurs. We mean single stuck-at faults at gates poles and d flip-flops poles of the scheme. A method of cutting overhead during survivable self-checking SSC design is proposed. It is oriented to only transient faults.
Authoring scenes for adaptive, interactive performances
Authors: Patrick Gebhard, Michael Kipp, Martin Klesen, Thomas Rist
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

In this paper, we introduce a toolkit called SceneMaker for authoring scenes for adaptive, interactive performances. These performances are based on automatically generated and pre-scripted scenes which can be authored with the SceneMaker in a two-step approach: In step one, the scene flow is defined using cascaded finite state machines. In a second step, the content of each scene must be provided. This can be done either manually by using a simple scripting language, or by integrating scenes which are automatically generated at runtime based on a domain and dialogue model. Both scene types can be interweaved in our plan-based, distributed platform. The system provides a context memory with access functions that can be used by the author to make scenes user-adaptive. Using CrossTalk as the target application, we describe our models and languages, and illustrate the authoring process. CrossTalk is an interactive installation with animated presentation agents which "live" beyond the actual presentation and systematically step out of character within the presentation, both to enhance the illusion of life. The context memory allows to adapt to user feedback and generates data for later evaluation of user/system behavior. The SceneMaker toolkit should enable the non-expert to compose adaptive, interactive performances in a rapid prototyping approach.
Implementation Considerations for Higher-Order Features in Logic Programming
Authors: Gopalan Nadathur, Bharat Jayaramn, Sue D Wilson
Venue:  (1993)

This paper examines implementation problems that arise from providing for aspects of higher-order programming within and enhancing the metalanguage abilities of logic programming. One issue of concern is a representation for the simply-typed lambda terms that replace the usual first-order terms as data structures; this representation must support an efficient realization of $\lambda$-conversion operations on these terms. Another issue is the handling of higher-order unification that becomes an integral part of the computational model. An implementation must cater to the branching nature of this operation and also provide a means for temporarily suspending the solution of a unification problem. A final issue concerns the treatment of goals whose structure is not statically apparent. These problems are discussed in detail and solutions to them are described. A representation for lambda terms is presented that uses the de Bruijn ``nameless'''' notation and also permits reduction substitutions to be performed lazily. This notation obviates % the need for $\alpha$-conversion and also supports an efficient implementation of $\beta$-reduction. Branching in unification is implemented by using a depth-first search strategy with backtracking. A structure that is called a branch point record and is akin to the choice point record of the Warren Abstract Machine (WAM) is described for remembering alternatives in unification. An explicit representation for unification problems is presented that permits sharing and also supports the rapid reinstatement of earlier versions of the problem. The implementation of unification is tuned to yield an efficient solution to first-order like problems, in fact through the use of compiled code as in the WAM. A compilation method is also discussed for goals whose structure changes during execution. The various ideas presented here form part of an ongoing implementation of a higher-order logic programming language called $\lambda$Prolog.
A Framework for Assessing Standards for Safety Critical Computer-Based Systems
Authors: K. A. Eastaughffe, A. Cant, M. A. Ozols
Venue: Proceedings of the 4th IEEE International Symposium and Forum on Software Engineering Standards (1999)

This paper presents a framework for assessing different standards for computer-based safety-critical systems. Key attributes of standards forming a basis for comparison are described. Three examples of standards are described using this framework: MIL-STD 882C; RTCA Standard DO178B for avionics software; and the recently published Australian Defence Standard Def (Aust) 5679.
The Whole Transaction Model for Heterogeneous Multidatabases
Authors: Marian H. Nodine, Patrice A. Tegan
Venue:  (1991)

A heterogeneous multidatabase allows a user to manipulate data contained in a collection of individual, autonomous databases managed by different database management systems. In this paper, we introduce the {\em whole transaction model} for multidatabases. This model is distinguished from other models in that it does not require the global transactions on the multidatabase to be atomic. Rather, the user specifies the atomic steps required to do the multidatabase transaction but different multidatabase transactions can interleave their steps arbitrarily. This paper presents a method for defining global transactions in the whole transaction model and discusses concurrency control and related issues. We also discuss an implementation of this model which includes a language for defining transactions in the heterogeneous multidatabase, and a design for a database server which executes these transactions and enforces concurrency control and compensation-based recovery.
An investigation on the importance of train-bridge interaction at resonance
Authors: P. Museros, E. Alarcón
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

In this paper the fundamental parameters governing the dynamic behaviour of single-track, simply supported railway bridges are presented, and their influence on the reduction of structural response due to train-bridge interaction at resonance is analysed. On the basis of a dimensionless formulation of the equations of motion of the Simplified Interaction Model the fundamental parameters are identified. Subsequently, a parametric study is conducted in which the influence of the most relevant parameters is investigated; some of them are found to play a decisive role in the reduction of the response caused by train-bridge interaction in resonance situations.
Reliability Modeling Using SHARPE
Authors: A R Sahner, S K Trivedi
Venue:  (1986)

Combinatorial models such as fault trees and reliability block diagrams are efficient for model specification and often efficient in the evaluation of system models. But it is difficult, if not impossible, to allow for various types of dependencies (such as repair dependency and near-coincident-fault type dependency), transient and intermittent faults, standby systems with warm spares, and so forth. Markov models can capture such important system behavior, but the size of a Markov model may grow exponentially with the number of components in the system. This paper presents an approach for avoiding the large state space problem. The approach uses a hierarchical modeling technique for analyzing complex reliability models. It allows the flexibility of Markov models where necessary and retains the efficiency of combinatorial solution where possible. Based on this approach a computer program called SHARPE (Symbolic Hierarchical Automated Reliability and Performance Evaluator) has been written. Examples are presented that show how combinations of models can be used to evaluate the reliability and availability of large systems using SHARPE.
Your 24/7 Online Job Search Guide
Authors: Lamont Wood
Venue:  (2002)

:A step-by-step guide to finding a job over the InternetThis book speaks directly to the Web-challenged, offering guidance to get the reader hunting successfully for a job on-line in just a few hours. Key areas covered include building and positioning an electronic resume, using e-mail, working the online databases, winning online job strategies, and more. Author Lamont Wood also presents numerous screen shots, which demonstrate the techniques outlined in this user-friendly guide.
General Flow Problems and Graph Grammars
Authors: Lishing Lui
Venue:  (1977)

NO SUPPLIED 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
Collision Models in the Hawk DSMC Implementation
Authors: Sergey Gimelshein, Gennady Markelov, Marc Rieffel
Venue:  (1996)

This paper presents a series of tests that have been conducted to validate the collision models of the Hawk DSMC implementation. These tests cover the hard sphere (HS), variable hard sphere (VHS), and variable soft sphere (VSS) collision models, and the Larsen-Borgnakke energy exchange model, for non-reacting gas mixtures. The results show that Hawk obtains the correct results in all cases under consideration.
Critique of orthogonal persistence
Authors: T. Cooper, M. Wise
Venue: Proceedings of the 5th International Workshop on Object Orientation in Operating Systems (IWOOOS '96) (1996)

Many researchers are pursuing the goal of providing 'orthogonal persistence'. In an orthogonally persistent system, every language-level object in the system can be referenced by the same mechanisms, regardless of longevity or location, with no exceptions. In this paper, we argue that orthogonal persistence is undesirable. The alternatives to orthogonal persistence include other forms of persistence, where persistence is still orthogonal to type but where there are typically restrictions on what objects can reference what objects. Such systems are often structured around 'fine-grained objects' and 'coarse-grained objects', where coarse-grained objects are used as the units of permissions, locking, transferral and so on. We argue that a design involving coarse-grained objects both helps the programmer organise data and provides much better efficiency.
Safety Related Standards: A Tutorial
Authors: Victoria Stavridou
Venue: Proceedings of the 4th IEEE International Symposium and Forum on Software Engineering Standards (1999)

The objective of this tutorial is to introduce current and emerging standards that address computer system and software safety. We consider relevant available standards and identify their strengths and weaknesses, we explore how to evaluate standards and we consider their application in practice. We address in depth IEC 61508 and Def Stan 00-56, two important standards. In addition, we will discuss current safety standards activity within the IEEE Software Engineering Standards Committee and we will touch upon the thorny issue of introducing standards into an organization. The tutorial will be practical and will address the application - not just the theory of safety standards. The tutorial is aimed at managers, project managers, safety engineers and software engineers with system or safety responsibility during the lifecycle of safety critical systems.
Applications of Electrical Impedance Tomography to Nondestructive Evaluation
Authors: Fadil Sandosa
Venue:  (1995)

Electrical impedance tomography is a technique for imaging the interior of a region using DC curent and voltage measurements collected on the boundary of the region. The image obtained corresponds to the conductivity of the material in the region. This tomographic method has its origins in geophysical exploration and biomedical imaging. In this paper, we describe two applications of this technique for NDE. In the first application, we devise a method for determining the length and the location of a straight-line crack in a circular domain. The second application concerns the use of electrical impedance for imaging corrosion in plates. This review will appear in the Proceedings of the Symposium on Parameter Identification, organized by H. T. Banks for the 1995 ASME Fifteenth Biennial Conference on Mechanical Vibration and noise and the 1995 ASME Design Technical Conferences, September 1995, Boston, MA. 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 Fast IP Lookup Scheme for Longest-Matching Prefix
Authors: Lih-Chyau Wuu, Shou-Yu Pin
Venue: Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01) (2001)

One of the key design issues for the next generation IP routers is the IP Lookup mechanism.IP lookup is an important action in router that is to find the next hop of each incoming packet with a longest-prefix-match address in the routing table.In this paper, we propose an IP lookupmechanism with the number of memory access for an IP lookup being one in the best case and being four in the worst case.The forwarding table needed by our mechanism issmall enough to fit in the SRAM.For example, a largerouting table with 40000 routing entries can be compacted to a forwarding table of 260Kbytes in our scheme.
Photoshop 7/ImageReady for the Web Hands-On Training
Authors: Lynda Weinman, Jan Kabili
Venue:  (2002)

:When scanning the bookstore for Photoshop titles, it may seem like there are as many books on how to use Photoshop 7 as there are people to use it. The trick is to find that one book that addresses your specific needs. For example, if you want to learn how to use Photoshop 7 with ImageReady 7 to create high-quality images for the Web, you can bypass all of the more general titles in favor of Photoshop 7/ImageReady Hands-On Training. The update to this best-selling book focuses specifically on using Photoshop 7 and ImageReady 7 for the Web with guided, tutorial-based lessons and exercises that have been developed and tested in Lynda Weinman's lynda.com digital arts training center. Each lesson contains extensive background information designed to help you understand the process as well as the particular exercise. You'll also learn how to create Photoshop rollovers, animations, image maps, transparency, layer styles, automation techniques, and more. If you're a beginning to intermediate Web designer, or a Photoshop user who is looking for a great tool to create graphics for the Web, this book has exactly what you've been looking for!
Transistor Modeling for the VDSM Era
Authors: Michael S. Shur, Tor A. Fjeldly, Trond Ytterdal
Venue: Proceedings of the 1st International Symposium on Quality of Electronic Design (2000)

We review field effect transistor modeling with emphasis on device parameter extraction for testing. We consider the physics-based universal charge control model, which allows us to describe the subthreshold, the weak inversion, and the strong inversion regimes in MOSFETs using a relatively small set of parameters, most of which are related to the device structure or fabrication process. This small parameter set makes the task of parameter extraction easier. The model accounts for velocity saturation, finite output conductance in saturation, drain induced barrier lowering, kink effect, floating body effect, and subthreshold leakage. The model has been applied to MOSFETs, SOI transistors, GaAs MESFETs, GaAs based HEMTs, amorphous, polysilicon and organic TFTs, AlGaN/GaN HEMTs, and to new emerging hetero-dimensional transistors. For compound semiconductor devices, additional effects, such as frequency dispersion and temperature dependence of model parameters, and gate leakage current, including hot-carrier leakage, have been accounted for.
Performance Analysis of Mobile Agents for Filtering Data Streams on Wireless Networks
Authors: David Kotz, Guofei Jiang, Robert S. Gray, George Cybenko, Ronald A. Peterson
Venue:  (2000)

Wireless networks are an ideal environment for mobile agents, because their mobility allows them to move across an unreliable link to reside on a wired host, next to or closer to the resources they need to use. Furthermore, client-specific data transformations can be moved across the wireless link, and run on a wired gateway server, with the goal of reducing bandwidth demands. In this paper we examine the tradeoffs faced when deciding whether to use mobile agents to support a data-filtering application, in which numerous wireless clients filter information from a large data stream arriving across the wired network. We develop an analytical model and use parameters from our own experiments to explore the model''s implications.
Detecting deception in reputation management
Authors: Bin Yu, Munindar P. Singh
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

We previously developed a social mechanism for distributed reputation management, in which an agent combines testimonies from several witnesses to determine its ratings of another agent. However, that approach does not fully protect against spurious ratings generated by malicious agents. This paper focuses on the problem of deception in testimony propagation and aggregation. We introduce some models of deception and study how to efficiently detect deceptive agents following those models. Our approach involves a novel application of the well-known weighted majority technique to belief function and their aggregation. We describe simulation experiments to study the number of apparently accurate witnesses found in different settings, the number of witnesses on prediction accuracy, and the evolution of trust networks.
On Decreasing the Computing Time for Modular Arithmetic
Authors: Lee E. Heindel, Ellis Horowitz
Venue:  (1971)

In this paper it is shown that by suitably modifying Garner''s algorithm for applying the Chinese Remainder Theorem to optimally employ the fast multiplication techniques of Schonhage and Strassen, one can often decrease the computing time of algebraic algorithms employing modular (congruence, residue) arithmetic.
Dynamic schemes for speculative execution of code
Authors: Prabhakar Raghavan, Hadas Shachnai, Mira Yaniv
Venue: Performance Evaluation (2003)

Speculative execution of code is becoming a key technique for enhancing the performance of pipeline processors. In this work we study schemes that predict the execution path of a program based on the history of branch executions. Building on previous work, we present a model for analyzing the effective speedup from pipelining, when speculative execution is employed. We follow this with stochastic analyses of several schemes for speculative execution.A main result of our study is that if we can predict branch resolution with high probability (as in the Pentium Pro processor, e.g.) the Single Path scheme commonly used on modern processors is within factor of 2 from the optimal. We conclude with simulations covering several of the settings that we study.