ppxscal/embedding_network huggingface dataset:
Luring: A framework to induce a suspected user into Context Honeypot
Authors: S. K. Gupta, Renu G. S. Damor, Anand Gupta, Vikram Goyal
Venue: Proceedings of the Second International Workshop on Digital Forensics and Incident Analysis (2007)

The objective of context honeypot is to identify a probable privacy violator before he actually succeeds in capturing desired precious information. We believe that in the environment of robust implementation of privacy policy, privacy breaches can occur only through masquerading. Success of context honeypot depends on efficient luring (by using lure messages) of probable privacy violator. Lure messages are built by using real and fake data in such a way that the probable violator remains oblivious of being lured. In this paper, we propose a lure model and an architecture for generating lure messages.
Relevance: A review of the literature and a framework for thinking on the notion in information science. Part II: nature and manifestations of relevance
Authors: Tefko Saracevic
Venue: Journal of the American Society for Information Science and Technology (2007)

Relevant: Having significant and demonstrable bearing on the matter at hand. A version of this article has been published in 2006 as a chapter in E.G. Abels & D.A. Nitecki (Eds.), Advances in Librarianship (Vol. 30, pp. 3&ndash;71). San Diego: Academic Press. (Saracevic, 2006). Relevance: The ability as of an information retrieval system to retrieve material that satisfies the needs of the user. &mdash;Merriam-Webster Dictionary 2005 Relevance is a, if not even the, key notion in information science in general and information retrieval in particular. This two-part critical review traces and synthesizes the scholarship on relevance over the past 30 years and provides an updated framework within which the still widely dissonant ideas and works about relevance might be interpreted and related. It is a continuation and update of a similar review that appeared in 1975 under the same title, considered here as being Part I. The present review is organized into two parts: Part II addresses the questions related to nature and manifestations of relevance, and Part III addresses questions related to relevance behavior and effects. In Part II, the nature of relevance is discussed in terms of meaning ascribed to relevance, theories used or proposed, and models that have been developed. The manifestations of relevance are classified as to several kinds of relevance that form an interdependent system of relevances. In Part III, relevance behavior and effects are synthesized using experimental and observational works that incorporate data. In both parts, each section concludes with a summary that in effect provides an interpretation and synthesis of contemporary thinking on the topic treated or suggests hypotheses for future research. Analyses of some of the major trends that shape relevance work are offered in conclusions. &copy; 2007 Wiley Periodicals, Inc.
Managing RFID data
Authors: Sudarshan S. Chawathe, Venkat Krishnamurthy, Sridhar Ramachandran, Sanjay Sarma
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

Radio-Frequency Identification (RFID) technology enables sensors to efficiently and inexpensively track merchandise and other objects. The vast amount of data resulting from the proliferation of RFID readers and tags poses some interesting challenges for data management. We present a brief introduction to RFID technology and highlight a few of the data management challenges.
Aerospace Computer Characteristics and Design Trends
Authors: D. O. Baechler
Venue: Computer (1971)

During the past year, we received calls from several Don Baechler fans scattered throughout the country asking if his comprehensive survey of aerospace computers printed two years ago was going to be updated. Well it was, has been and is. This marks Don's third appearance in these pages and we'd like to publicly thank him for regularly providing what is one of the most popular features in the magazine. –Ed. 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 Fuzzy Control in Electric Power Steering System
Authors: JianQiao Xiong, XiaoQi Tang, JiHong Chen
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

In this paper , the constituent of the electric power steering (EPS) system and its operational mechanism are introduced , Contrast tradition PID control and the limitation of the PID control, the feasibility applying fuzzy control on EPS system and the comparative advantages are analyzed in detail , on the base of which a primary fuzzy model of EPS system is presented. Finally has produced in the EPS project fuzzy control concrete realization. The practice result indicated, Uses the fuzzy control in the electric power steering control system to be allowed enable the system to have a stronger robustness. In the enhancement steering system operation smart simultaneously guaranteed the pilot can obtain the full road feeling, thus obtains ideally boosts the characteristic.
On the Power of Quantum, One Round, Two Prover Interactive Proof Systems
Authors: Alex Rapaport, Amnon Ta-Shma
Venue: Quantum Information Processing (2007)

We analyze quantum two prover one round interactive proof systems, in which noninteracting provers can share unlimited entanglement. The maximum acceptance probability is characterized as a superoperator norm. We get some partial results and in particular we analyze the "rank one" case.
A Matrix Method for Determining All Pairs of Compatible States of a Sequential Machine
Authors: I. Tomescu
Venue: IEEE Transactions on Computers (1972)

In this note a matrix method is given that enables one to determine all pairs of compatible states in the case of incompletely specified sequential automata.
Understanding and Documenting Programs
Authors: V. R. Basili
Venue: IEEE Transactions on Software Engineering (1982)

This paper reports on an experiment in trying to understand an unfamiliar program of some complexity and to record the authors' understanding of it. The goal was to simulate a practicing programmer in a program maintenance environment using the techniques of program design adapted to program understanding and documentation; that is, given a program, a specification and correctness proof were developed for the program. The approach points out the value of correctness proof ideas in guiding the discovery process. Toward this end, a variety of techniques were used: direct cognition for smaller parts, discovering and verifying loop invariants for larger program parts, and functions determined by additional analysis for larger program parts. An indeterminate bounded variable was introduced into the program documentation to summarize the effect of several program variables and simplify the proof of correctness.
A note on homogeneous bent functions
Authors: Xiaolin Wang, Jianqin Zhou, Yubing Zang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

Bent functions are used to build blocks for cryptographically strong S-boxes and spread spectrum systems. The concept of semi bent functions and quarter bent functions is presented. Based on the new concept, an approach to construct bent functions is proposed. A simpler method to find all 30 homogeneous bent functions of degree 3 in 6 boolean variables, which were previously discovered by a computer search, is given. It is proved that there do not exist homogeneous bent functions of degree m in 2m boolean variables for m \lge 3, without invoking results from the difference set theory.
Future scenarios of parallel computing: Distributed sensor networks
Authors: Virginio Cantoni, Luca Lombardi, Paolo Lombardi
Venue: Journal of Visual Languages and Computing (2007)

Over the past few years, motivated by the accelerating technological convergence of sensing, computing and communications, there has been a growing interest in potential and technological challenges of Wireless Sensor Network. This paper will introduce a wide range of current basic research lines dealing with ad hoc networks of spatially distributed systems, data rate requirements and constraints, real-time fusion and registration of data from distributed sensors, cooperative control, hypothesis generation, and network consensus filtering. This technical domain has matured to the point where a number of industrial products and systems have appeared. The presentation will also describe the state of the art regarding current and soon-to-appear applications.
Sybase IQ multiplex - designed for analytics
Authors: Roger MacNicol, Blaine French
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

The internal design of database systems has traditionally given primacy to the needs of transactional data. A radical re-evaluation of the internal design giving primacy to the needs of complex analytics shows clear benefits in large databases for both single servers and in multinode shared-disk grid computing. This design supports the trend to keep more years of more finely grained data online by ameliorating the data explosion problem.
An autonomic communication framework for sensor networks
Authors: Jingbo Sun, Rachel Cardell-Oliver
Venue: Proceedings of the 5th international conference on Embedded networked sensor systems (2007)

A novel autonomic communication framework is proposed for two-tiered heterogeneous sensor networks. The framework consists of an autonomic data-link protocol, LADD, and a communication scheduler. Networks consist of both sensing nodes and more powerful relaying nodes. LADD is able to adapt to time varying and asymmetric wireless links with minimal energy consumption. The distributed scheduling scheme provides fair and efficient co-ordination of communication streams over multiple radio hops.
Competitive Coevolution with K-Random Opponents for Pareto Multiobjective Optimization
Authors: Tse Guan Tan, Jason Teo, Hui Keng Lau
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

In this paper, our objective is to conduct comprehensive tests for competitive coevolution using an evolutionary multiobjective algorithm for 3 dimensional problems. This competitive coevolution will be implemented with K-Random Opponents strategy. A new algorithm which integrates Competitive Coevolution (CE) and the Strength Pareto Evolutionary Algorithm 2 (SPEA2) is proposed to achieve this objective. The resulting algorithm is referred to as the Strength Pareto Evolutionary Algorithm 2 with Competitive Coevolution (SPEA2-CE). The performance between SPEA2-CE is compared against SPEA2 to solve problems with each having three objectives using DTLZ suite of test problems. In general, the results show that the SPEA2-CE with K-Random Opponents performed well for the generational distance and coverage but performed less favorably for spacing.
Addressing & invocation of IMS-attached services
Authors: Roman Levenshteyn, Ioannis Fikouras, Salvatore Loreto, Gonzalo Camarillo
Venue: Proceedings of the 1st international conference on Principles, systems and applications of IP telecommunications (2007)

Services provided by non-IMS enabled platforms (e.g. home electronics, entertainment systems, and various home appliances) are typically not accessible to remote users such as IMS subscribers in spite of the ubiquity of modern mobile communications. This paper outlines an approach for providing IMS based access to such IMS-attached services through mechanisms for their detection, registration, discovery and invocation.
A shrinking-based approach for multi-dimensional data analysis
Authors: Yong Shi, Yuqing Song, Aidong Zhang
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

Existing data analysis techniques have difficulty in handling multi-dimensional data. In this paper, we first present a novel data preprocessing technique called shrinking which optimizes the inner structure of data inspired by the Newton's Universal Law of Gravitation[22] in the real world. This data reorganization concept can be applied in many fields such as pattern recognition, data clustering and signal processing. Then, as an important application of the data shrinking preprocessing, we propose a shrinking-based approach for multi-dimensional data analysis which consists of three steps: data shrinking, cluster detection, and cluster evaluation and selection. The process of data shrinking moves data points along the direction of the density gradient, thus generating condensed, widely-separated clusters. Following data shrinking, clusters are detected by finding the connected components of dense cells. The data-shrinking and cluster-detection steps are conducted on a sequence of grids with different cell sizes. The clusters detected at these scales are compared by a cluster-wise evaluation measurement, and the best clusters are selected as the final result. The experimental results show that this approach can effectively and efficiently detect clusters in both low- and high-dimensional spaces.
An Architecture of Hybrid Neural Network Based Navigation System for Mobile Robot
Authors: Andrev V. Gavrilov, Sungyoung Lee
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

This paper presents novel hybrid architecture of control system of mobile robot oriented on navigation tasks and based on hybrid neural network MLP-ART2. Using of this model allows movement to target avoiding the obstacles almost without assistance of human operator after just small learning.
A quality-of-service signaling architecture for seamless handover support in next generation, IP-based mobile networks
Authors: Roland Bless, Joachim Hillebrand, Christian Prehofer, Martina Zitterbart
Venue: Wireless Personal Communications: An International Journal (2007)

The coupling of signaling protocols for mobility management and resource reservation plays an important role to achieve Quality-of-Service (QoS) in wireless environments. When performing a handover, request and allocation of resources have to be done in the shortest possible time to avoid disruptions for the user service. Therefore, it is preferable to ensure resource availability in advance, which we call anticipated handover. This approach for providing seamless handovers in turn poses challenges for the overall design of the QoS architecture and its associated QoS signaling protocol. This article describes the design, implementation, and evaluation of a comprehensive QoS architecture and a suitable QoS signaling protocol. It discusses intrinsic problems of reservations in IP based networks such as session ownership as well as a number of protocol design issues regarding the integration of QoS signaling with other protocols, such as Mobile IP. In particular, we define an end-to-end QoS architecture and a mobility-aware reservation signaling protocol Mobility Aware Reservation Signaling Protocol (MARSP) that supports anticipated handover, thus enabling seamless services over heterogeneous wireless access networks. The presented architecture and protocol were implemented and evaluated by measurements. They show that anticipated handovers not only outperform hard handovers regarding handover latency, but that they also provide functional and robustness advantages.
Exploring interface with representation of gesture for remote collaboration
Authors: Jane Li, Anja Wessels, Leila Alem, Cara Stitzlein
Venue: Proceedings of the 19th Australasian conference on Computer-Human Interaction: Entertaining User Interfaces (2007)

This paper reports on a laboratory study into the gesture representation interface for remote collaboration on physical tasks. Measured by task performance and user's perception of interaction, the experiment assessed two gesture representations (hands vs. cursor pointer) in the context of a video mediated interface which included a view of the remote partner. We did not find any significant difference between the hands condition and the pointer condition when measuring user's task performance. However, our result showed that participants reported an overall preference of using the pointer functionality than using the hands'. We found that participants perceived higher quality of interaction in the hands condition than in the pointer condition and there was a significant difference. Additionally, majority of the participants valued the ability of being able to see each other's face during the collaboration. We conclude with a discussion on the importance of accounting for the user's perception of interaction in addition to the traditional task performance measure in evaluating gesture representation interface, and the importance of considering these two factors in recommending the most suitable interface design with gesture representation for collaboration on physical tasks.
Dog Days for Broadband
Authors: Shane Greenstein
Venue: IEEE Micro (2007)

It is essential to get the proportionate units right in economic measurement. The present analysis of dial-up and broadband markets, however, contains a problem with its units. A one-dollar decline from $20 in dial-up prices is treated as equivalent to a two-dollar decline from $40 in broadband prices. This assessment undervalues broadband revenues, because it doesn't factor in the greater satisfaction per dollar experienced by converts from dial-up to broadband. In this column, Greenstein seeks to correct the units of comparison.
Comments on the Review of "Peripheral Devices"
Authors: I. Flores
Venue: IEEE Transactions on Computers (1975)

People have been taking digs at my work for many years, and I have taken no recourse to reply. The review in the May 1974 issue of the IEEE TRANSACTIONS ON COMPUTERS issue by Professor Barnard seems highly unfair and does not clearly consider the position of an author describing a changing technology. He should understand something of the publishing field and that it takes at least two years to research and write a book; to have the book reviewed by the publisher, to revise it, and to get it into production takes another two years; and, finally, to get the book reviewed takes another year. One of the reviewer's most devastating criticisms is that the material is five years old. From the above time-table how could I possibly publish information on current machines? How could I ever catchup? 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
Data-Fusion Techniques and Its Application
Authors: Hairong Dong, David Evans
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

This paper mainly describes the data-fusion techniques combining the data from two independent sensor systems with the aim of improving overall system performance. The data-fusion algorithms that form the core of the system are described in detail, together with the development work being undertaken. Using simulated data generated by a software model and real data, the analysis of improving system performance is discussed in detail.
The Next Big Thing
Authors: George Neville-Neil
Venue: Queue (2007)

Dear KV, I know you did a previous article where you listed some books to read (Kode Vicious Bugs Out, April 2006). I would also consider adding How to Design Programs, available free on the Web (http://www.htdp.org/). This book is great for explaining the process of writing a program. It uses the Scheme language and introduces FP (functional programming). I think FP could be the future of programming. John Backus of the IBM Research Laboratory suggested this in 1977 (http://www.stanford.edu/class/cs242/readings/backus.pdf). Even Microsoft has yielded to FP by introducing FP concepts in C# with LINQ (Language Integrated Query). Do you feel FP has a future in software development, or are we stuck with our current model of languages with increasing features?
A New Supervised Clustering Algorithm for Data Set with Mixed Attributes
Authors: Shijin Li, Jing Liu, Yuelong Zhu, Xiaohua Zhang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

Because of the complexity of data set with mixed attributes, the traditional clustering algorithms appropriate for this kind of dataset are few and the effect of clustering is not good. K-prototype clustering is one of the most commonly used methods in data mining for this kind of data. We borrow the ideas from the multiple classifiers combing technology, use k-prototype as the basis clustering algorithm to design a multi-level clustering ensemble algorithm in this paper, which adaptively selects attributes for re-clustering. Comparison experiments on Adult data set from UCI machine learning data repository show very competitive results and the proposed method is suitable for data editing.
Performance evaluation of a new BPSK-OFDM timing estimation algorithm
Authors: Jyh-Horng Wen, Gwo-Ruey Lee, Wen-Hui Kuan, Cheng-Ying Yang
Venue: Wireless Personal Communications: An International Journal (2007)

Previously, the timing estimation in OFDM system employs cyclic prefix has been presented with the assumption of independent identified distributed OFDM symbol. The information used to find the symbol synchronization depends on the length of cyclic prefix. Actually, the data in the BPSK-OFDM modulated symbol, transferred by inverse fast Fourier transform, is with a complex symmetry character. With this character, more information from the whole OFDM symbol could be provided for the symbol timing. In this paper, the proposed algorithm uses the autocorrelation of the received signal to obtain the symbol timing. The simulation of Beek's algorithm and the proposed scheme are presented. The performances of these algorithms are evaluated based on the missing symbol probability and the estimator mean square error. The simulation results show that the proposed algorithm is suitable to achieve a better symbol synchronization.
Utility Based Query Dissemination in Spatial Data Grid
Authors: Dafei Yin, Bin Chen, Zhou Huang, Xin Lin, Yu Fang
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

Spatial Information Grid is an ideal infrastructure to handle the data-intensive and computing-intensive geo-spatial processing. In order that each agency could ad hoc connect to this computing environment and make autonomous decision, we build a Geospatial Data Grid in peer-to-peer way. The query processor module in each peer can decompose the user's query into sub-queries that executed in different nodes. One problem in the parallel spatial join query optimization is how to determine an appropriate node group to disseminate the sub-queries. Especially, if there is more than one node sharing the same area of interest, there is a dilemma: on the one hand, the task scheduler tends to decompose this query into sub-queries and disseminate them to as many as possible nodes so that they could process the user's query in parallel; on the other hand, recruiting too many nodes will also bring in overhead in repetitive computing, redundant data transmission, and the result merging. Based on the study of trade-off between increasing parallelism and reducing redundancy using the Utility Theory in economics, we put forward a fast node selection algorithm for the parallel spatial join query dissemination. The test in our system shows this strategy could balance the above two conflict demands and is appropriate for use in Data Grid.