ppxscal/embedding_network huggingface dataset:
Equivalence between priority queues and sorting
Authors: Mikkel Thorup
Venue: Journal of the ACM (JACM) (2007)

We present a general deterministic linear space reduction from priority queues to sorting implying that if we can sort up to n keys in S(n) time per key, then there is a priority queue supporting delete and insert in O(S(n)) time and find-min in constant time. Conversely, a priority queue can trivially be used for sorting: first insert all keys to be sorted, then extract them in sorted order by repeatedly deleting the minimum. Asymptotically, this settles the complexity of priority queues in terms of that of sorting. Previously, at SODA'96, such a result was presented by the author for the special case of monotone priority queues where the minimum is not allowed to decrease. Besides nailing down the complexity of priority queues to that of sorting, and vice versa, our result yields several improved bounds for linear space integer priority queues with find-min in constant time: Deterministically. We get O(log log n) update time using a sorting algorithm of Han from STOC'02. This improves the O((log log n)(log log log n)) update time of Han from SODA'01. Randomized. We get O(&sqrt;log log n) expected update time using a randomized sorting algorithm of Han and Thorup from FOCS'02. This improves the O(log log n) expected update time of Thorup from SODA'96. Deterministically in AC0 (without multiplication). For any &epsiv; > 0, we get O((log log n)1&plus;&epsiv;) update time using an AC0 sorting algorithm of Han and Thorup from FOCS'02. This improves the O((log log n)2) update time of Thorup from SODA'98. Randomized in AC0. We get O(log log n) expected update time using a randomized AC0 sorting algorithm of Thorup from SODA'97. This improves the O((log log n)1&plus;&epsiv;) expected update time of Thorup also from SODA'97. The above bounds assume that each integer is stored in a single word and that word operations take unit time as in the word RAM.
A FPGA Optimised Digital Real-Time Mutichannel Correlator Architecture
Authors: C. Jakob, A. Th. Schwarzbacher, B. Hoppe, R. Peters
Venue: Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (2007)

Digital correlation techniques are used in photon correlation spectroscopy (PCS) experiments to gain information about the diffusion coefficient and thereby the size and distribution of submicron particle structures in fluid media. A new multichannel single chip correlator architecture has been developed, implemented on a FPGA device as a HW/SW partitioned system. A fast hardware front-end combined with a highly optimised, hardware accelerated softcore processor allows the simultaneous processing of up to 32 input channels, each with a time dynamic range of 1013. This paper outlines the fundamental algorithmic concepts, the actual correlator implementation as well as the HW/SW design consideration to find an optimal trade-off between system resources and application requirements.
Support for OpenMP tasks in Nanos v4
Authors: Xavier Teruel, Xavier Martorell, Alejandro Duran, Roger Ferrer, Eduard Ayguadé
Venue: Proceedings of the 2007 conference of the center for advanced studies on Collaborative research (2007)

In this paper we describe an implementation overview of Nanos v4: an OpenMP Run Time Library (RTL) based on the nano-threads programming model. Our main goal is to discuss different aspects of the library development focusing on the implementation of a new feature introduced in the last OpenMP release: task support. We compare the performance of our prototype implementation and the workqueuing model available on the Intel compiler with a set of kernel applications.
A Discriminative Analysis of Approaches to Ranking Fuzzy Numbers in Fuzzy Decision Making
Authors: Hepu Deng
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

This paper presents a discriminative analysis of approaches to ranking fizzy numbers in fuzzy decision making based on a comprehensive review of existing approaches. The consistency and effectiveness of the approaches to ranking filzzy numbevs are examined in terms of two objective measures developed, leading to a better understanding of the relative performance of individual approaches in ranking fuzzy numbers. Repvesentative fuzzy numbers are selected for carrying out the comparative study of several typical approaches in vanking fizzy numbers. Several interesting Jindings are identzjied which may be ofpvactical significance to fuzzy decision making in veal situations.
Codes for Error Correction in High-Speed Memory Systems Part II: Correction of Temporary and Catastrophic Errors
Authors: C. V. Srinivasan
Venue: IEEE Transactions on Computers (1971)

A few classes of codes, suitable for error correction in high-speed memory systems, are presented. The codes have relatively simple parallel decoding nets. The codes may be used for the correction of both temporary and catastrophic errors.
How the Fast Fourier Transform Got its Name
Authors: T. S. Huang
Venue: Computer (1971)

Everyone agrees that the Fast Fourier Transform (FFT) has revolutionized digital signal processing. However, no one knows with certainty the true history of the FFT. I had been as confused as everybody else until one day when I found in an old book store at Harvard Square a manuscript by Kipling which contained some unpublished Just-So Stories, one of which was entitled, "How the Fast Fourier Transform Got its Name." The time has now come to publish this historical account to quiet all rumors and hearsay.
A J2ME transparent middleware to support HTTP connections over Bluetooth
Authors: Vincenzo Auletta, Carlo Blundo, Emiliano De Cristofaro
Venue: Proceedings of the Second International Conference on Systems and Networks Communications (2007)

Over the last years, a call for embedding computation into the environment has been arisen. This philosophy has been often referred to as pervasive or ubiquitous computing, to remark the aim to a dense and widespread interaction among computing devices. User intervention and awareness are discarded, in opposition to an automatic adaptation of applications to location and context. To this aim, much attention is drawn to technologies supporting dynamicity and mobility over small devices which can follow the user anytime, anywhere. The Bluetooth standard particularly fits this idea, by providing a versatile and flexible wireless network technology with low power consumption. Operating in a license-free frequency, users are not charged for accessing the network nor they need an account with any company. Bluetooth dynamically sets up and manages evolving networks, by providing the possibility of automatically discovering devices and services within its transmission range. Research studies have forecasted that within a few years, most of the devices accessing the Web will be mobile, and presumably most of them will be Bluetooth-enabled. Therefore, we need solutions that encompass networking, systems, and application issues involved in realizing mobile and ubiquitous access to services. In this paper, we present a transparent middleware which extends the possibility of accessing Web resources also from Bluetooth-enabled smartphones. All the implementation details will be hidden both to users and to application developers, allowing an easy and complete portability of applications working on traditional TCP/IP communication protocols towards the Bluetooth technology.
Smart Spaces: Indoor Wireless Location Management System
Authors: Vimal Joy, Vimal P. Laxman
Venue: Proceedings of the The 2007 International Conference on Next Generation Mobile Applications, Services and Technologies (2007)

Determining the location of objects or people in a smart space is one of the prerequisites enabling smart applications. The ideal location system makes use of existing infrastructure such as wireless LAN or cellular communication systems. However, in indoor environment typical wireless LAN systems do not provide sufficient accuracy for many smart applications and such as WLAN based location system needs to be enhanced. This paper involves proposal of a heterogeneous location system based on a combination of IEEE 802.11 WLAN and a sensor network based ultra wideband radar system. The proposed system provides greater accuracy than other proposed systems and provides the added advantage that the sensor network can be utilized for other ubiquitous computing applications.
Proof-infused streams: enabling authentication of sliding window queries on streams
Authors: Feifei Li, Ke Yi, Marios Hadjieleftheriou, George Kollios
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

As computer systems are essential components of many critical commercial services, the need for secure online transactions is now becoming evident. The demand for such applications, as the market grows, exceeds the capacity of individual businesses to provide fast and reliable services, making outsourcing technologies a key player in alleviating issues of scale. Consider a stock broker that needs to provide a real-time stock trading monitoring service to clients. Since the cost of multicasting this information to a large audience might become prohibitive, the broker could outsource the stock feed to third-party providers, who are in turn responsible for forwarding the appropriate sub-feed to clients. Evidently, in critical applications the integrity of the third-party should not be taken for granted. In this work we study a variety of authentication algorithms for selection and aggregation queries over sliding windows. Our algorithms enable the end-users to prove that the results provided by the third-party are correct, i.e., equal to the results that would have been computed by the original provider. Our solutions are based on Merkle hash trees over a forest of space partitioning data structures, and try to leverage key features, like update, query, signing, and authentication costs. We present detailed theoretical analysis for our solutions and empirically evaluate the proposed techniques.
Ubiquitous Commerce Utilizing a Process Model
Authors: Sang Chan Park, Cheol Young Kim, Kwang Hyuk Im
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

This paper defines a process model for an ubiquitous commerce. Defined processes include analyzing collected information of customers using questionnaire as well as remotely monitoring customer behavior information. Using the RFID tag, Intermediary collects sensing data about customer's location, frequency of using cosmetics on a continual basis. Cosmetics companies match customer behavior patterns by mapping RFID tag ID in received contextual data and customer ID in customer DB. Using customer behavior patterns, the company can provide the target customers with highly personalized service in so called u-commerce environment.
Programming: Sorcery or Science?
Authors: C. A. R. Hoare
Venue: IEEE Software (1984)

Professional programming practice should be based on underlying mathematical theories and follow the traditions of better-established engineering disciplines. Success will come through improved education.
An Approach to Modeling Hypermedia Web Applications
Authors: QIAN Zhong-sheng, MIAO Huai-kou, HE Tao
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

In hypermedia web applications, the coexistence of different interactive styles, of hypermedia features with application operations, of complex information structures with transactions upon them, raises new problems for modelers to require a new modeling paradigm urgently. In this paper, we propose a modeling approach to partly solve the problems. A PFD (Page Flow Diagram) is first constructed. Then, a typed PFD is derived from the initial PFD by associating pages and links with type information. Moreover, an LTS (Labeled Transition System) provides a convenient way to model the structure and behavior of hypermedia web applications in a way that avoids issues associated with the implementation. To further model the hypermedia structures precisely, we change/extend some of LTS's constructors and get a typed LTS corresponding to the typed PFD. The typed LTS is a mathematical analytical tool/notation that makes it possible to test and verify software automatically.
The Analogy Between Electrical Networks and Flowcharts
Authors: A. C. Davies
Venue: IEEE Transactions on Software Engineering (1980)

A recently proposed analogy between discrete systems and flowcharts is discussed. It is pointed out that the analog of Kirchhoff's voltage law does not apply to flowcharts, and that the analogy is likely to be of limited value as an aid to program analysis.
Assessment of the probabilities for evolutionary structural changes in protein folds
Authors: Juris Vīksna, David Gilbert
Venue: Bioinformatics (2007)

Motivation: The evolution of protein sequences can be described by a stepwise process, where each step involves changes of a few amino acids. In a similar manner, the evolution of protein folds can be at least partially described by an analogous process, where each step involves comparatively simple changes affecting few secondary structure elements. A number of such evolution steps, justified by biologically confirmed examples, have previously been proposed by other researchers. However, unlike the situation with sequences, as far as we know there have been no attempts to estimate the comparative probabilities for different kinds of such structural changes. Results: We have tried to assess the comparative probabilities for a number of known structural changes, and to relate the probabilities of such changes with the distance between protein sequences. We have formalized these structural changes using a topological representation of structures (TOPS), and have developed an algorithm for measuring structural distances that involve few evolutionary steps. The probabilities of structural changes then were estimated on the basis of all-against-all comparisons of the sequence and structure of protein domains from the CATH-95 representative set. The results obtained are reasonably consistent for a number of different data subsets and permit the identification of several ‘most popular’ types of evolutionary changes in protein structure. The results also suggest that alterations in protein structure are more likely to occur when the sequence similarity is >10% (the average similarity being ∼6% for the data sets employed in this study), and that the distribution of probabilities of structural changes is fairly uniform within the interval of 15–50% sequence similarity. Availability: The algorithms have been implemented on the Windows operating system in C++ and using the Borland Visual Component Library. The source code is available on request from the first author. The data sets used for this study (representative sets of protein domains, matrices of sequence similarities and structural distances) are available on http://bioinf.mii.lu.lv/epsrc_project/struct_ev.html. Contact: juris.viksna@mii.lu.lv
BlueTorrent: Cooperative content sharing for Bluetooth users
Authors: Sewook Jung, Uichin Lee, Alexander Chang, Dae-Ki Cho, Mario Gerla
Venue: Pervasive and Mobile Computing (2007)

People wish to enjoy their everyday lives in various ways, among which entertainment plays a major role. In order to improve lifestyle with more ready access to entertainment content, we propose BlueTorrent, a P2P file sharing application based on ubiquitous Bluetooth-enabled devices such as PDAs, cellphones and smart phones. Using BlueTorrent, people can share audio/video contents as they move about shopping malls, airports, subway stations etc. BlueTorrent poses new challenges caused by limited bandwidth, short communications range, mobile users and variable population density. A key ingredient is efficient peer discovery. This paper approaches the problem by analyzing the Bluetooth periodic inquiry mode and by finding the optimum inquiry/connection time settings. At the application layer, the BlueTorrent index/block dissemination protocol is then designed and analyzed. The entire system is integrated and implemented both in simulation and in an experimental testbed. Simulation and measurement results are used to evaluate and validate the performance of BlueTorrent in content sharing scenarios.
A Proposition of Retrieval Tools for Historical Document Images Libraries
Authors: N. Journet, J.-Y. Ramel, R. Mullot, V. Eglin
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

In this article, we propose a method of characterization of pictures of old documents based on a texture approach. This characterization is carried out with the help of a multi- resolution study of the textures contained in the pictures of the document. So, by extracting five features linked to the frequencies and to the orientations in the different parts of a page, it is possible to extract and to compare elements of high semantic level without expressing any hypothesis about the physical or logical structure of the analysed documents. Experiments show the feasibility of the fulfillment of tools for the navigation or the indexation help. In these experi- mentations, we will lay the emphasis upon the pertinence of these texture features and the advances that they represent in terms of characterization of content of a deeply hetero- geneous corpus.
A Virtual Machine Migration System Based on a CPU Emulator
Authors: Koichi Onoue, Yoshihiro Oyama
Venue: Proceedings of the 2nd International Workshop on Virtualization Technology in Distributed Computing (2006)

Migration of virtual computing environments is a useful mechanism for advanced management of servers and utilization of a uniform computing environment on different machines. There have been a number of studies on migration of virtual computing environments based on virtual machine monitors (e.g., VMware) or language-level virtual machines (e.g., Java). However, migration systems based on a CPU emulator have not received much attention and their viability in a practical setting is not clear. In this paper, we describe Quasar, a virtual machine (VM) migration system implemented on top of the QEMU CPU emulator. Quasar can migrate a whole operating system between physical machines whose architectures are different (e.g., between an x86 machine and a PowerPC machine). Quasar provides a virtual networking facility, which allows migrating VMs to continue communication without disconnecting sockets for migration. Quasar also provides a staged migration function to reduce the downtime of migrating VMs. We have examined the viability of Quasar through experiments, in which Quasar was compared with Xen, SBUML, and UML. The experiments assessed the performance of virtual server hosting, the sizes of the files that represent VMs, and the amount of downtime for VM migration.
On the Accuracy of Spectrum-based Fault Localization
Authors: Rui Abreu, Peter Zoeteweij, Arjan J. C. van Gemund
Venue: Proceedings of the Testing: Academic and Industrial Conference Practice and Research Techniques - MUTATION (2007)

Spectrum-based fault localization shortens the test- diagnose-repair cycle by reducing the debugging effort. As a light-weight automated diagnosis technique it can easily be integrated with existing testing schemes. How- ever, as no model of the system is taken into account, its diagnostic accuracy is inherently limited. Using the Siemens Set benchmark, we investigate this diag- nostic accuracy as a function of several parameters (such as quality and quantity of the program spectra collected during the execution of the system), some of which directly relate to test design. Our results indicate that the superior performance of a particular similar- ity coeficient, used to analyze the program spectra, is largely independent of test design. Furthermore, near- optimal diagnostic accuracy (exonerating about 80% of the blocks of code on average) is already obtained for low-quality error observations and limited numbers of test cases. The influence of the number of test cases is of primary importance for continuous (embedded) processing applications, where only limited observation horizons can be maintained.
Competitiveness via primal-dual
Authors: Marek Chrobak
Venue: ACM SIGACT News (2007)

From the editor: So you are reading this paper on online algorithms. At first the paper reads well, and you get through the first few pages in no time -- until the authors pull a rabbit out of a hat: the online algorithm. Fine, you say to yourself, patience, it all will start making sense when I get to the analysis, just keep reading. But it doesn't -- the proof is by an even more mysterious trick, and this time out of the hat comes a humpback whale: yes, a potential function. Sound familiar?
mPower -- a component-based development framework for multi-agent systems to support business processes
Authors: J. W. Shepherdson, H. Lee, P. Mihailescu
Venue: BT Technology Journal (2007)

One of the obstacles preventing the widespread adoption of multi-agent systems in industry is the difficulty of implementing heterogeneous interactions among participating agents via asynchronous messages. This difficulty arises from the need to understand how to combine elements of various content languages, ontologies, and interaction protocols in order to construct meaningful and appropriate messages. In this paper mPower, a component-based layered framework for easing the development of multi-agent systems, is described, and the facility for customising the components for reuse in similar domains is explained. The framework builds on the JADE-LEAP platform, which provides a homogeneous layer over diverse operating systems and hardware devices, and allows ubiquitous deployment of applications built on multi-agent systems both in wired and wireless environments. The use of the framework to develop mPowermobile, a multi-agent system to support mobile workforces, is also reported.
Fast Correlation Tracking Method based on Circular Projection
Authors: Meili Shen, Huajun Song, Weiwei Sheng, Zunnian Liu
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

An algorithm for a rotation invariant tem- plate matching method based on correlation value cir- cular projection target tracking algorithm is proposed in this paper. This algorithm projects the model im- age as circular and gets the radius and the sum of the same radius pixel value. In order to improve the match- ing speed and get the illumination invariance, the tra- ditional correlation method is combined with circular projection algorithm. This method computes the corre- lation value between model image radius pixel sum and the scene image radius pixel sum and gets the maximal that so that it gets the matching result. The experi- mental results show that this algorithm has good rotate invariance, real-time and high precision property.
Proceedings. 14th IEEE International Symposium on High Performance Distributed Computing (IEEE Cat. No. 05TH8800)
Venue: Proceedings of the High Performance Distributed Computing, 2005. HPDC-14. Proceedings. 14th IEEE International Symposium (2005)

The following topics are dealt with: high performance distributed computing; grid services; application environments; runtime; data management; resource management; scheduling; security policy; middleware; and system services. 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