ppxscal/embedding_network huggingface dataset:
A Scalable Lock-Free Stack Algorithm and its Verification
Authors: Robert Colvin, Lindsay Groves
Venue: Proceedings of the Fifth IEEE International Conference on Software Engineering and Formal Methods (2007)

The design of efficient software supporting concurrent access to shared data is a challenging task. Often such programs will have at their core algorithms which utilise conceptual locks to restrict access to the data, and which are significantly more complex than their sequential (non-concurrent) counterparts. Lock-free algorithms, which have been developed to avoid problems such as priority inversion and deadlock, are more complex still due to the larger scope for interference between processes. These algorithms become even more complex when further mechanisms are added to achieve good performance under a wide range of workloads. In this paper we present a lock-free algorithm that efficiently manages interference on a shared stack, by allowing complementary stack operations to be eliminated without altering the stack. The algorithm we present is based on a published algorithm due to Hendler, Shavit and Yerushalmi [7], and incorporates simplifications and improvements that we discovered while attempting to verify the original algorithm. We present a high-level view of the formal verification of our algorithm, which was machine-checked using the PVS theorem prover.
Multiview Stereo via Volumetric Graph-Cuts and Occlusion Robust Photo-Consistency
Authors: George Vogiatzis, Carlos Hernández Esteban, Philip H. S. Torr, Roberto Cipolla
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2007)

This paper presents a volumetric formulation for the multi-view stereo problem which is amenable to a computationally tractable global optimisation using Graph-cuts. Our approach is to seek the optimal partitioning of 3D space into two regions labelled as &#x2018;object&#x2019; and &#x2018;empty&#x2019; under a cost functional consisting of the following two terms: (1) A term that forces the boundary between the two regions to pass through photo-consistent locations and (2) a ballooning term that inflates the &#x2018;object&#x2019; region. To take account of the effect of occlusion on the first term we use an occlusion robust photo-consistency metric based on Normalised Cross Correlation, which does not assume any geometric knowledge about the reconstructed object. The globally optimal 3D partitioning can be obtained as the minimum cut solution of a weighted graph.
Unifying Inspection Processes to Create a Framework to Support Static Quality Assurance Planning
Authors: Christian Denger, Frank Elberzhager
Venue: Proceedings of the 33rd EUROMICRO Conference on Software Engineering and Advanced Applications (2007)

Inspections, Reviews and walkthroughs are highly effective and efficient means for static software quality assurance. During the last three decades different variations and facets evolved on how to perform and apply such techniques, ranging from Fagan inspection over structured walkthroughs to Peer Reviews and simple Desk Checks. What is missing today is a systematic approach on how to select and apply the most appropriate technique under the consideration of the given development constraints and quality goals a company wants to achieve. This paper presents the first step towards a comprehensive planning framework for static quality assurance activities, i.e., the definition of a generic process that explicitly models the commonalities and variabilities of different techniques. The paper describes how such a process is defined by using concepts of product line engineering and how the generic process and a related decision model supports the selection of a technique.
Simulating Life as a Self-Organizing and Emergent Phenomenon
Authors: Yupanqui Julho Munoz, Leandro Nunes de Castro
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

This paper presents artificial life as a synthetic ap- proach to the study of behaviors, systems and organ- isms. The paper starts with a discussion about the methodological advantages of using bottom-up, instead of top-down, approaches for the computational synthe- sis of natural behaviors. As an outcome of bottom-up modeling, the resulting behaviors synthesized are characterized by two fundamental properties: self- organization and emergence. The presentation focuses on conceptualizing and illustrating self-organization and emergence in the context of artificial life for the synthesis of behaviors. One well-known ALife project is used to promote a discussion of some implications and contributions of ALife, namely, the simulation of collective behaviors of bird flocks.
A Precise Bandwidth Control Arbitration Algorithm for Hard Real-Time SoC Buses
Authors: Bu-Ching Lin, Geeng-Wei Lee, Juinn-Dar Huang, Jing-Yang Jou
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

On an SoC bus, contentions occur while different IP cores request the bus access at the same time. Hence an arbiter is mandatory to deal with the contention issue on a shared bus system. In different applications, IPs may have real-time and/or bandwidth requirements. It is very difficult to design an arbitration algorithm to simultaneously meet these two requirements. In this paper, we propose an innovative arbitration algorithm, RB_lottery, to meet both of the requirements. It can provide not only the hard real-time guarantee but also the precise bandwidth controllability. The experimental results show that RB_lottery outperforms several well-known existing arbitration algorithms.
Information extraction based on personalization and contextualization models for multimodal data
Authors: Maria Chiara Caschera, Arianna D'Ulizia
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

Multimedia data concern visual, audio, textual, information involving voice, gestures and others, so there are several challenges related to their storage and retrieval. Context awareness and personalization are key aspects to consider to manage any information-related content. In this paper we propose a general profiling model to define the user and context profiles in order to preserve and use their interrelationships. This general profiling model can be used to filter the user query in a more precise and selective way and to filter the multimedia contents in the repository that match the user query. In this paper the personalization relies on the combined use of the user profiles and context profiles, and the combination driving in particular the choice of the interaction mode in order to make relevant information available to people in the appropriate form.
B74-17 The Theory of Parsing, Translation, and Compiling Volume II: Compiling
Authors: P. M. Lewis
Venue: IEEE Transactions on Computers (1974)

The two volumes in this set belong in every library on compiler design. Together they achieve a level of rigor and completeness not attained by any other book on the subject. 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
Small-diamond-based search algorithm for fast block motion estimation
Authors: Shen-Chuan Tai, Ying-Ru Chen, Yu-Hung Chen
Venue: Image Communication (2007)

A good fast motion search algorithm should efficiently speed up the encoding time and keep the quality of encoded video stable at the same time. Researches have shown that many fast algorithms lose the quality requirement in some special video sequences. These video sequences often have heavy motions and need large search windows for motion vector search. E3SS, DS, and E-HEXBS, which are famous algorithms, are not good enough in these sequences. As to UMHexagonS, it is able to meet the high video quality requirement very well, but it costs too much computation. This paper introduces a multi-stage motion estimation algorithm. The algorithm ensures getting good video quality while decreases the motion search time efficiently. It divides the search regions into many un-overlapped small-diamond regions and forces the motion search to go outward for larger motion vectors. This method is also designed to avoid mistaking local optimal motion vectors. For this reason, the selected motion vector is refined by several stages. Experimental results show that the proposed algorithm uses almost the same number of checking points as E3SS but achieves a better quality. Furthermore, the proposed algorithm is also tested in H.264/AVC JM9.5 encoder; the experimental results show that this algorithm is also suitable for variable block-size motion estimation.
An algorithm for the appraisal of assurance indicators for complex business processes
Authors: Fabio Massacci, Artsiom Yautsiukhin
Venue: Proceedings of the 2007 ACM workshop on Quality of protection (2007)

In order to provide certified security services we must provide indicators that can measure the level of assurance that a complex business process can offer. Unfortunately the formulation of security indicators is not amenable to efficient algorithms able to evaluate the level of assurance of complex process from its components.In this paper we show an algorithm based on FD-Graphs (a variant of directed hypergraphs) that can be used to compute in polynomial time (i) the overall assurance indicator of a complex business process from its components for arbitrary monotone composition functions, (ii) the subpart of the business process that is responsible for such assurance indicator (i.e. the best security alternative).
Compilers and Computer Architecture
Authors: W. A. Wulf
Venue: Computer (1981)

An examination of the relation between architecture and compiler design leads to several principles which can simplify compilers and improve the object code they produce.
An Approach to Distributed Computing System Software Design
Authors: S. S. Yau
Venue: IEEE Transactions on Software Engineering (1981)

Distributed computing systems represent a wide variety of computer systems, ranging from a centralized star network to a completely decentralized computer system. The design of software for distributed computing systems is more complicated due to many design constraints and interactions of software components of the system.
A Detection Method of Radar Signal by Wavelet Transforms
Authors: Shanwen Zhang, Jianbo Fan, Lidan Shou, Jinxiang Dong
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

In this paper, an effective detection method of radar signal is presented based on the wavelet analysis. The purpose of this paper is to provide the review of the wavelet analysis research and to detect radar target from radar echo. The theory of wavelet analysis is presented including continuous and discrete wavelet transform. Then specific application, namely radar target detection is presented. In this paper, using wavelet transform to preprocess the radar echo, we are able to obtain multiple data series at different scales of the wavelet transform. These multiple data series can then be used as input to sensors of independent component analysis for detection of a single independent source. The proposed method is applied to radar target detection using a real signal series. It is demonstrated that the method in combination with wavelet transform is effective with feasible result. It has greater theoretical significance and actual applied value in regarded to radar signal processing and target identifying in our aerial defense weapon system.
FPGA-accelerated seed generation in Mercury BLASTP
Authors: Arpith Jacob, Joseph Lancaster, Jeremy Buhler, Roger D. Chamberlain
Venue: Proceedings of the 15th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (2007)

BLASTP is the most popular tool for comparative analysis of protein sequences. In recent years, an exponential increase in the size of protein sequence databases has required either exponentially more runtime or a cluster of machines to keep pace. To address this problem, we have designed and built a high-performance FPGA-accelerated version of BLASTP, Mercury BLASTP. In this paper, we focus on seed generation, the first stage of the BLASTP algorithm. Our seed generator is capable of processing database residues at up to 219 Mresidues/second for 2048- residue queries. The full Mercury BLASTP pipeline, including our seed generator, achieves a speedup of 37× over the popular NCBI BLASTP software on a 2.8 GHz Intel P4 CPU, with sensitivity more than 99% that of the software. Our architecture can be generalized to accelerate the seed generation stage in other important biocomputing applications.
Guest Editors' Introduction: IT Quality Enhancement and Process Improvement
Authors: Phillip A. Laplante, William W. Agresti, G. Reza Djavanshir
Venue: IT Professional (2007)

Planning is key to achieving higher levels of quality and improved processes in IT.
Just in time indexing for up to the second search
Authors: Ronny Lempel, Yosi Mass, Shila Ofek-Koifman, Dafna Sheinwald, Yael Petruschka, Ron Sivan
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

E-commerce and intranet search systems require newly arriving content to be indexed and made available for search within minutes or hours of arrival. Applications such as file system and email search demand even faster turnaround from search systems, requiring new content to become available for search almost instantaneously. However, incrementally updating inverted indices, which are the predominant datastructure used in search engines, is an expensive operation that most systems avoid performing at high rates. We present JiTI, a Just-in-Time Indexing component that allows searching over incoming content (nearly) as soon as that content reaches the system. JiTI's main idea is to invest less in the preprocessing of arriving data, at the expense of a tolerable latency in query response time. It is designed for deployment in search systems that maintain a large main index and that rebuild smaller stop-press indices once or twice an hour. JiTI augments such systems with instant retrieval capabilities over content arriving in between the stop-press builds. A main design point is for JiTI to demand few computational resources, in particular RAM and I/O. Our experiments consisted of injecting several documents and queries per second concurrently into the system over half-hour long periods. We believe that there are search applications for which the combination of the workloads we experimented with and the response times we measured present a viable solution to a pressing problem.
Scan registration for autonomous mining vehicles using 3D-NDT: Research Articles
Authors: Martin Magnusson, Achim Lilienthal, Tom Duckett
Venue: Journal of Field Robotics (2007)

Scan registration is an essential subtask when building maps based on range finder data from mobile robots. The problem is to deduce how the robot has moved between consecutive scans, based on the shape of overlapping portions of the scans. This paper presents a new algorithm for registration of 3D data. The algorithm is a generalization and improvement of the normal distributions transform (NDT) for 2D data developed by Biber and Strasser, which allows for accurate registration using a memory-efficient representation of the scan surface. A detailed quantitative and qualitative comparison of the new algorithm with the 3D version of the popular ICP (iterative closest point) algorithm is presented. Results with actual mine data, some of which were collected with a new prototype 3D laser scanner, show that the presented algorithm is faster and slightly more reliable than the standard ICP algorithm for 3D registration, while using a more memory-efficient scan surface representation. &copy; 2007 Wiley Periodicals, Inc.
An interactive UNIX shell for low-end sensor nodes with LiteOS
Authors: Qing Cao, Tarek Abdelzaher, John Stankovic, Tian He
Venue: Proceedings of the 5th international conference on Embedded networked sensor systems (2007)

This demonstration highlights an interactive Unix-like shell for operating wireless sensor networks, where the user uses familiar Unix commands to complete tasks ranging from wireless installation of user applications to retrieval of data reports with the help of a built-in Unix-like file system.
Design of a network architecture with inherent data path security
Authors: Tilman Wolf
Venue: Proceedings of the 3rd ACM/IEEE Symposium on Architecture for networking and communications systems (2007)

Next-generation Internet architectures require designs with inherent security guarantees.We present a network architecture that uses credentials to audit traffic in the data path, where defenses can be employed often more quickly and efficiently than on end-systems.
An adaptive medium access control protocol using m-ary tree algorithms for quality-of-service support in single-cell ad hoc networks
Authors: Orestis Tsigkas, Fotini-Niovi Pavlidou
Venue: Ad Hoc Networks (2008)

Concurrent with the rapid expansion of wireless networks is an increasing interest in providing Quality-of-Service (QoS) support to them. As a consequence, a number of medium access control protocols has been proposed which aims at providing service differentiation at the distributed wireless medium access layer. However, most of them provide only average performance assurances. We argue that average performance guarantees will be inadequate for a wide range of emerging multimedia applications and ''per-flow'' service assurances must be provided instead. Based on m-ary tree algorithms, we propose an adaptive and distributed medium access algorithm for single-cell ad hoc networks to provide ''per-flow'' service assurances to flows whose QoS requirement can be expressed as a delay requirement. Both analytical and simulation experiments are conducted to assess the performance of the proposed scheme.
Clever Uses of Matrices for Neutral Delay Difference Systems
Authors: Guang Zhang, Bao Shi
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

In this paper, by considering the eigenvalues and their corresponding eigenvetors of matrices, the miscellaneous solutions for a class of neutral delay difference systems are considered. Some necessary and/or sufficient conditions are obtained.
Query-io
Authors: Patrick Dussud
Venue: ACM SIGPLAN Lisp Pointers (1987)

We had a network server running in background exchanging ASCII strings with its remote clients. These strings included decimal numbers. When someone using the Lisp Listener on that machine set *print-base* to 16, the background server started sending base 16 numbers to its clients which created errors.
A Parametric-Space-Based Scan-Line Algorithm for Rendering Bicubic Surfaces
Authors: X. Pueyo, P. Brunet
Venue: IEEE Computer Graphics and Applications (1987)

This article presents a new scan-line algorithm for displaying bicubic surfaces. Patches are decomposed on regions of constant sign of the z component of the normal before the scan process. Most of the computations are done in parametric space. The algorithm computes the intersection of the surfaces with only a restricted subset of scan planes and obtains the intersection with other scan planes by linear interpolation between exact instersections. A bound of the algorithm's error is given. Finally, the new method is compared with Whitted's algorithm.
Tutorial on System Safety for Software Engineers in Global Industry: Concepts and Implementation
Authors: Andrew J. Kornecki
Venue: Proceedings of the International Conference on Global Software Engineering (2007)

This introductory tutorial is designed to provide a perspective on development of software-intensive safety-related system in a regulated industry where the multidisciplinary projects reach across national boundaries. The safety concepts and implementations are discussed focusing on the necessary conformance to local and international safety standards and guidelines.
Context-specific infinite mixtures for clustering gene expression profiles across diverse microarray dataset
Authors: X. Liu, S. Sivaganesan, K. Y. Yeung, J. Guo, R. E. Bumgarner, Mario Medvedovic
Venue: Bioinformatics (2006)

Motivation: Identifying groups of co-regulated genes by monitoring their expression over various experimental conditions is complicated by the fact that such co-regulation is condition-specific. Ignoring the context-specific nature of co-regulation significantly reduces the ability of clustering procedures to detect co-expressed genes due to additional ‘noise’ introduced by non-informative measurements. Results: We have developed a novel Bayesian hierarchical model and corresponding computational algorithms for clustering gene expression profiles across diverse experimental conditions and studies that accounts for context-specificity of gene expression patterns. The model is based on the Bayesian infinite mixtures framework and does not require a priori specification of the number of clusters. We demonstrate that explicit modeling of context-specificity results in increased accuracy of the cluster analysis by examining the specificity and sensitivity of clusters in microarray data. We also demonstrate that probabilities of co-expression derived from the posterior distribution of clusterings are valid estimates of statistical significance of created clusters. Availability: The open-source package gimm is available at Contact: Mario.Medvedovic@uc.edu Supplementary information:
Polynomial-time approximation schemes for piercing and covering with applications in wireless networks
Authors: Paz Carmi, Matthew J. Katz, Nissan Lev-Tov
Venue: Computational Geometry: Theory and Applications (2008)

Let D be a set of disks of arbitrary radii in the plane, and let P be a set of points. We study the following three problems: (i) Assuming P contains the set of center points of disks in D, find a minimum-cardinality subset P^* of P (if exists), such that each disk in D is pierced by at least h points of P^*, where h is a given constant. We call this problem minimum h-piercing. (ii) Assuming P is such that for each D@?D there exists a point in P whose distance from D's center is at most @ar(D), where r(D) is D's radius and 0=
Growth and structural properties of crystalline LaAlO3 on Si (001)
Authors: J. W. Reiner, A. Posadas, M. Wang, T. P. Ma, C. H. Ahn
Venue: Microelectronic Engineering (2008)

Crystalline LaAlO"3 was grown by oxide molecular beam epitaxy (MBE) on Si (001) surfaces utilizing a 2ML SrTiO"3 buffer layer. This SrTiO"3 buffer layer, also grown by oxide MBE, formed an abrupt interface with the silicon. No SiO"2 layer was detectable at the oxide-silicon interface when studied by cross-sectional transmission electron microscopy. The crystalline quality of the LaAlO"3 was assessed during and after growth by reflection high energy electron diffraction, indicating epitaxial growth with the LaAlO"3 unit cell rotated 45^o relative to the silicon unit cell. X-ray diffraction indicates a (001) oriented single-crystalline LaAlO"3 film with a rocking curve of 0.15^o and no secondary phases. The use of SrTiO"3 buffer layers on silicon allows perovskite oxides which otherwise would be incompatible with silicon to be integrated onto a silicon platform.