ppxscal/embedding_network huggingface dataset:
Dynamic Learning of Automata from the Call Stack Log for Anomaly Detection
Authors: Zhen Liu, Susan M. Bridges
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

Anomaly detection based on monitoring of sequences of system calls has proved to be an effective approach for detection of previously unknown attacks on programs. This paper describes a new model for profiling normal program behavior that can be used to detect intrusions that change application execution flow. The model (hybrid push down automaton, HPDA) incorporates call stack information and can be learned by dynamic analysis of training data captured from the call stack log. The learning algorithm uses call stack information maintained by the program to build a finite state automaton. When compared to other approaches including VtPath which also uses call stack information, the HPDA model produces a more compact and general representation of control flow, handles recursion naturally, can be learned with less training data, and has a lower false positive rate when used for anomaly detection. In addition, dynamic learning can also be used to supplement a model acquired from static analysis.
Comparative and Functional Genomics: Special Section - A Special Section of reviews from the 2nd Conference on Standards and Ontologies for Functional Genomics (SOFG)
Authors: Staff
Venue: Comparative and Functional Genomics (2004)

Presented by The Jackson Laboratory, University of Pennsylvania and European Bioinformatics Institute 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
Head Tracking with Shape Modeling and Detection
Authors: Maolin Chen, Seokcheol Kee
Venue: Proceedings of the 2nd Canadian conference on Computer and Robot Vision (2005)

Color-based tracking has proved efficient and robust recently. Trackers build the object appearance model with histogram statistics, search and evaluate hypothesis in a probabilistic framework. This method relies much on the discrimination between object and scene blobs. Color clutter in the scene, although not so many in quantity, may distract these trackers. We build explicitly object shape model and insert the head detector into the observation model to resist these clutters in the scene for improved tracker. The detector scans the image and output probability value as the possibility of current window being a candidate human head. Experiments demonstrate the method can work more accurately and robustly.
Proceedings of the 5th symposium on Operating systems design and implementationDue to copyright restrictions we are not able to make the PDFs for this conference available for downloading
Venue: Operating Systems Design and Implementation (2002)

OSDI '02 continues the conference's tradition of presenting the best innovative work in the systems software area, taking a broad view of what the area encompasses. We believe that this year's conference contains some of the most original, intriguing, and important work in the field today. OSDI '02 drew a highly competitive selection from a large collection of diverse, original work submitted by authors internationally to form a program of creative, well-developed papers opening up new and innovative areas--not merely incremental results building on prior work.The program presents important results in a wide range of areas, including distributed storage systems, robust software construction, OS kernel innovations, sensor networks, virtual machine monitors, large-scale network simulation, resource management architectures for Internet services, peer-to-peer systems, network analysis, and migration of execution environments.OSDI '02 received 150 submissions; all submissions were reviewed by several members of the program committee and selected external reviewers, comprising roughly 700 reviews. Program committee members did not participate in the review or discussion of any papers co-authored by themselves, members of their home institutions, former students, advisors, or recent collaborators. The program committee met at the Intel Berkeley research lab on July 30, 2002, to make the final program selection during an eleven-hour meeting.
Shape-preserving properties of univariate cubic L1 splines
Authors: Hao Cheng, Shu-Cherng Fang, John E. Lavery
Venue: Journal of Computational and Applied Mathematics (2005)

The results in this paper quantify the ability of cubic L2 splines to preserve the shape of nonparametric data. The data under consideration include multiscale data, that is, data with abrupt changes in spacing and magnitude. A simplified dual-to-primal transformation for a geometric programming model for cubic L1 splines is developed. This transformation allows one to establish in a transparent manner relationships between the shape-preserving properties of a cubic L1 spline and the solution of the dual geometric-programming problem. Properties that have often been associated with shape preservation in the past include preservation of linearity and convexity/concavity. Under various circumstances, cubic L1 splines preserve linearity and convexity/concavity of data. When four consecutive data points lie on a straight line, the cubic L1 spline is linear in the interval between the second and third data points. Cubic L1 splines of convex/concave data preserve convexity/concavity if the first divided differences of the data do not increase/decrease too rapidly. When cubic L2 splines do not preserve convexity/concavity, they still do not cross the piecewise linear interpolant and, therefore, they do not have extraneous oscillation.
Coping with the Grasping Uncertainties in Force-closure Analysis
Authors: Yu Zheng, Wen-Han Qian
Venue: International Journal of Robotics Research (2005)

Friction uncertainty and contact position uncertainty may have a disastrous effect on the closure properties of grasps. This paper reflects our approach to handling these uncertainties in force-closure analysis. The former uncertainty is measured by the possible reduction rate &kgr; of friction coefficients, while the radius &rgr; of contact regions is used to quantify the latter uncertainty. The actual contact point may deviate from the desired position but not farther than &rgr; &middot; &rgr;S, the supremum of &rgr; without loss of force-closure, indicates the grasp tolerance to contact position uncertainty. For investigating the above uncertainties systematically, we propose three new problems in force-closure: whether a grasp with given &kgr; and &rgr; achieves force-closure, what value &rgr;S equals if &kgr; is given, and how &rgr;S varies versus &kgr;. To facilitate their solutions, we extend the scope of the infinitesimal motion approach from form-closure analysis to force-closure. A necessary and sufficient condition for force-closure is deduced by means of the duality between some convex cones, which play the key role in solving the problems. Finally, efficient algorithms are developed and applied to two illustrative examples.
Exploring speech-enabled dialogue with the Galaxy Communicator infrastructure
Authors: Samuel Bayer, Christine Doran, Bryan George
Venue: Proceedings of the first international conference on Human language technology research (2001)

This demonstration will motivate some of the significant properties of the Galaxy Communicator Software Infrastructure and show how they support the goals of the DARPA Communicator program.
The complexity of agreement
Authors: Scott Aaronson
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

A celebrated 1976 theorem of Aumann asserts that Bayesian agents with common priors can never "agree to disagree": if their opinions about any topic are common knowledge, then those opinions must be equal. But two key questions went unaddressed: first, can the agents reach agreement after a conversation of reasonable length? Second, can the computations needed for that conversation be performed efficiently? This paper answers both questions in the affirmative, thereby strengthening Aumann's original conclusion.We show that for two agents with a common prior to agree within ε about the expectation of a [0,1] variable with high probability over their prior, it suffices for them to exchange O(1/ε2) bits. This bound is completely independent of the number of bits n of relevant knowledge that the agents have. We also extend the bound to three or more agents; and we give an example where the "standard protocol" (which consists of repeatedly announcing one's current expectation) nearly saturates the bound, while a new "attenuated protocol" does better. Finally, we give a protocol that would cause two Bayesians to agree within ε after exchanging O(1/ε2) messages, and that can be simulated by agents with limited computational resources. By this we mean that, after examining the agents' knowledge and a transcript of their conversation, no one would be able to distinguish the agents from perfect Bayesians. The time used by the simulation procedure is exponential in 1/ε6 but not in n.
Book Review: Artificial Intelligence Applications in Materials Science by Ralph J. Harrison and Lewis D. Roth (The Metallurgical Society, 1987)
Venue: Issue 106 (October 1988) (1988)

This volume assesses the state of the art in machine vision, emphasizing industrial applications. Topics covered include machine vision applications in manufacturing, smart sensors for machine vision, computation with parallel image processors, learning structural descriptions of shape, extracting of three-dimensional structure and motion from images, analysis of range images, and new approaches to computer architecture for machine vision applications. 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
Efficient indexing of the historical, present, and future positions of moving objects
Authors: Dan Lin, Christian S. Jensen, Beng Chin Ooi, Simonas Šaltenis
Venue: Proceedings of the 6th international conference on Mobile data management (2005)

Although significant effort has been put into the development of efficient spatio-temporal indexing techniques for moving objects, little attention has been given to the development of techniques that efficiently support queries about the past, present, and future positions of objects. The provisioning of such techniques is challenging, both because of the nature of the data, which reflects continuous movement, and because of the types of queries to be supported. This paper proposes the BBx -index structure, which indexes the positions of moving objects, given as linear functions of time, at any time. The index stores linearized moving-object locations in a forest of B+ -trees. The index supports queries that select objects based on temporal and spatial constraints, such as queries that retrieve all objects whose positions fall within a spatial range during a set of time intervals. Empirical experiments are reported that offer insight into the query and update performance of the proposed technique.
Enabling the Efficient Use of SMP Clusters: The GAMESS/DDI Model
Authors: Ryan M. Olson, Michael W. Schmidt, Mark S. Gordon, Alistair P. Rendell
Venue: Proceedings of the 2003 ACM/IEEE conference on Supercomputing (2003)

An important advance in cluster computing is the evolution from single processor clusters to multi-processor SMP clusters. Due to the increased complexity in the memory model on SMP clusters, new approaches are needed for applications that make use of distributed-memory paradigms. This paper presents new communications software developments that are designed to take advantage of SMP cluster hardware. Although the specific focus is on the central field of computational chemistry and materials science, as embodied in the popular electronic structure package GAMESS (General Atomic and Molecular Electronic Structure System), the impact of these new developments will be far broader in scope. Following a summary of the essential features of the distributed data interface (DDI) in the current implementation of GAMESS, the new developments for SMP clusters are described. The advantages of these new features are illustrated using timing benchmarks on several hardware platforms, using a typical computational chemistry application.
Three dozen papers on online algorithms
Authors: Wojciech Jawor
Venue: ACM SIGACT News (2005)

This column contains a summary of last year's research on online algorithms presented at the STOC, FOCS, ICALP, ESA, and STACS conferences. Unfortunately, due to space constraints, the report could not be entirely exhaustive, and results from other conferences or journal articles are not covered. We hope that all readers will find in the survey something of interest, to fill those long winter evenings. The papers in the report are organized roughly by applications.
iMovie HD and iDVD 5 for Mac OS X: Visual QuickStart Guide (Visual Quickstart Guides)
Authors: Jeff Carlson
Venue:  (2005)

Bestselling author Jeff Carlson is back with a fully updated revision of theï¾ iMovie Visual QuickStart Guide. Completely overhauled for iMovie HD and iDVD 5, this book uses step-by-step instructions and loads of illustrations to get readers up to speed quickly in the process of making movies with iMovie and creating Hollywood-quality DVDs on which to share them (as well as photos, music, and more). First-time movie and DVD makers will find all the basics covered here--from shooting and capturing footage, viewing clips, and working in the iMovie timeline to dragging and dropping iMovies into new iDVD projects and adding GarageBand-created songs to their newly created DVDs. Readers will find coverage of both of the programs' niftiest new features, including iMovie's new HD compatibility, dozens of new video effects, sound effects, and transitions, more powerful editing features, and the new "Magic iMovie" feature, which automatically creates a simple iMovie for you with the existing footage in your camcorder. iDVD 5 offers 15 new Apple-designed themes and OneStep DVD, which exports a movie into a finished DVD automatically.
A hybrid list decoding and chase-like algorithm of Reed-Solomon codes
Authors: Wei Jin, Hong Jun Xu, Fambirai Takawira
Venue: Proceedings of the 4th international symposium on Information and communication technologies (2005)

This paper presents a hybrid chase-like algorithm for Reed-Solomon (RS) codes, which is based on list decoding algorithm. The main idea of this paper is to apply chase-like algorithm to change the input to the interpolation step of list algorithm based on the bit reliability. Simulation results show that the performance of hybrid algorithm for (7,5) RS code can approach the one of maximum likelihood decoding, and the performance of (15,7) RS code can correct one more symbol errors than list decoding algorithm.
A data structure for the description and the handling of engineering drawings
Authors: C. Cavagna, U. Cugini
Venue: ACM SIGDA Newsletter (1976)

The specifications of a data structure are essentially linked to the model which it is wished to represent, to the functional links which it is wished to obtain amongst the various data and the action which it is wished to take on such structure.
A Note On Generating Systems Composed Of Binary And Ternary Random Variables
Authors: Henry Block, Mainak Mazumdar, Sheldon M. Ross
Venue: Probability in the Engineering and Informational Sciences (2005)

We present some tips for generating multiple sequences of two- and three-valued random variables.
Evaluating kilo-instruction multiprocessors
Authors: Marco Galluzzi, Ramón Beivide, Valentin Puente, José-Ángel Gregorio, Adrian Cristal, Mateo Valero
Venue: Proceedings of the 3rd workshop on Memory performance issues: in conjunction with the 31st international symposium on computer architecture (2004)

The ever increasing gap in processor and memory speeds has a very negative impact on performance. One possible solution to overcome this problem is the Kilo-instruction processor. It is a recent proposed architecture able to hide large memory latencies by having thousands of in-flight instructions. Current multiprocessor systems also have to deal with this increasing memory latency while facing other sources of latencies: those coming from communication among processors. What we propose, in this paper, is the use of Kilo-instruction processors as computing nodes for small-scale CCNUMA multiprocessors. We evaluate what we appropriately call Kilo-instruction Multiprocessors. This kind of systems appears to achieve very good performance while showing two interesting behaviours. First, the great amount of in-flight instructions makes the system not just to hide the latencies coming from the memory accesses but also the inherent communication latencies involved in remote memory accesses. Second, the significant pressure imposed by many in-flight instructions translates into a very high contention for the interconnection network, what indicates us that more efforts need to be employed in designing routers capable of managing high traffic levels.
The Local Projective Shape of Smooth Surfaces and Their Outlines
Authors: Svetlana Lazebnik, Jean Ponce
Venue: International Journal of Computer Vision (2005)

This article examines projectively-invariant local geometric properties of smooth curves and surfaces. Oriented projective differential geometry is proposed as a general framework for establishing such invariants and characterizing the local projective shape of surfaces and their outlines. It is applied to two problems: (1) the projective generalization of Koenderink's famous characterization of convexities, concavities, and inflections of the apparent contours of solids bounded by smooth surfaces, and (2) the image-based construction of rim meshes, which provide a combinatorial description of the arrangement induced on the surface of an object by the contour generators associated with multiple cameras observing it.
Retouching Photos in Photoshop Elements: Visual QuickProject Guide (Visual Quickproject Series)
Authors: Nolan Hester
Venue:  (2005)

Like all of the Visual QuickProject Guides, Retouching Photos in Photoshop Elements takes a task-based approach to teaching the essential elements of the program. Instead of drowning the reader in lengthy explanations about every possible variation, the book focuses on topics every photographer wants to learn. It uses big, color illustrations coupled with clear, concise step-by-step instructions to show the reader how to complete specific projects in a matter of minutes. The book walks readers through the most common-and vexing-problems that confront every digital photographer: flash-induced red eye, blown-out highlights and murky shadows, inaccurate skin tones, and distracting background objects. Chock full of time-saving tips, the book also shows how to share those polished photos with friends and family through email, the Web and online print labs. In short: Everything the photographer wants to know-and not a bit more.ï¾
Refereed Papers: Real-time Log File Analysis Using the Simple Event Correlator (SEC)
Authors: John P. Rouillard
Venue: Proceedings of the 18th USENIX conference on System administration (2004)

Log analysis is an important way to keep track of computers and networks. The use of automated analysis always results in false reports, however these can be minimized by proper specification of recognition criteria. Current analysis approaches fail to provide sufficient support for the recognizing the temporal component of log analysis. Temporal recognition of event sequences fall into distinct patterns that can be used to reduce false alerts and improve the efficiency of response to problems. This paper discusses these patterns while describing the rationale behind and implementation of a ruleset created at the CS department of the University of Massachusetts at Boston for SEC - the Simple Event Correlation program.
Analysis and optimization of pilot-symbol-assisted M-QAM for OFDM systems: Research Articles
Authors: Jiming Chen, Youxi Tang, Shaoqian Li
Venue: Wireless Communications Mobile Computing (2005)

Orthogonal frequency division multiplexing (OFDM) is very attractive for next generation high-speed wireless communication because of its various advantages in lessening the severe effects of frequency-selective fading. When using pilot symbol assisted (PSA) M-ary quadrature amplitude modulation (M-QAM) in OFDM systems, if the power of pilot is too low, the channel parameters cannot be accurately estimated, whereas, high pilot power will lead to less power left for data symbols under the condition that the total transmitted power is constrained to be a constant. In this paper, we present how pilot power affects the demodulation performance in Rayleigh fading propagation environments. Consequently, the pilot-to-data power ratio (PDR) is optimized analytically, and degradation of system performance due to inaccurate channel estimation is also evaluated. The theoretical and simulation results show that the optimum PDR is affected by the signal-to-noise ratio (SNR), Doppler frequency and interpolation size etc. When the optimum PDR is adopted for an OFDM system, the total transmission power will be minimal for certain bit error rate (BER) target. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Compiling almost-whole Java programs: Research Articles
Authors: Zoran Budimlić, Ken Kennedy
Venue: Concurrency and Computation: Practice Experience (2005)

This paper presents a strategy, called almost-whole-program compilation, for extending the benefits of whole-program optimization to large collections of Java components that are packaged as a group after the development phase. This strategy has been implemented in a framework that uses Java visibility and scoping rules to transform a collection of classes into a package that is amenable to whole-program optimizations, without precluding extensions to the optimized and compiled code. Thus, it enables the Java developer to balance performance against flexibility of the program after the development phase, without compromising the design process. The transformation is shown to incur only modest performance penalties, which are more than compensated for by the interprocedural optimizations it enables. The paper concludes with experimental results showing the benefits that can be achieved using this approach. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Space-Time Behavior Based Correlation
Authors: Eli Shechtman, Michal Irani
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

We introduce a behavior-based similarity measure which tells us whether two different space-time intensity patterns of two different video segments could have resulted from a similar underlying motion field. This is done directly from the intensity information, without explicitly computing the underlying motions. Such a measure allows us to detect similarity between video segments of differently dressed people performing the same type of activity. It requires no foreground/background segmentation, no prior learning of activities, and no motion estimation or tracking. Using this behavior-based similarity measure, we extend the notion of 2-dimensional image correlation into the3-dimensional space-time volume, thus allowing to correlate dynamic behaviors and actions. Small space-time video segments (small video clips) are "correlated" against entire video sequences in all three dimensions (x,y, and t). Peak correlation values correspond to video locations with similar dynamic behaviors. Our approach can detect very complex behaviors in video sequences (e.g., ballet movements, pool dives, running water), even when multiple complex activities occur simultaneously within the field-of-view of the camera.