ppxscal/embedding_network huggingface dataset:
Analyzing Concurrency Control Algorithms When User and System Operations Differ
Authors: P. A. Bernstein
Venue: IEEE Transactions on Software Engineering (1983)

Concurrency control algorithms for database systems are usually regarded as methods for synchronizing Read and Write operations. Such methods are judged to be correct if they only produce serializable executions. However, Reads and Writes are sometimes inaccurate models of the operations executed by a database system. In such cases, serializability does not capture all aspects of concurrency control executions. To capture these aspects, we describe a proof schema for analyzing concurrency control correctness. We illustrate the proof schema by presenting two new concurrency algorithms for distributed database systems.
Distributed Selfish Caching
Authors: Nikolaos Laoutaris, Georgios Smaragdakis, Azer Bestavros, Ibrahim Matta, Ioannis Stavrakakis
Venue: IEEE Transactions on Parallel and Distributed Systems (2007)

Although cooperation generally increases the amount of resources available to a community of nodes, thus improving individual and collective performance, it also allows for the appearance of potential mistreatment problems through the exposition of one node’s resources to others. We study such concerns by considering a group of independent, rational, self-aware nodes that cooperate using on-line caching algorithms, where the exposed resource is the storage at each node. Motivated by content networking applications -- including web caching, CDNs, and P2P -- this paper extends our previous work on the off-line version of the problem, which was conducted under a game-theoretic framework, and limited to object replication. We identify and investigate two causes of mistreatment: (1) cache state interactions (due to the cooperative servicing of requests) and (2) the adoption of a common scheme for cache management policies. Using analytic models, numerical solutions of these models, as well as simulation experiments, we show that on-line cooperation schemes using caching are fairly robust to mistreatment caused by state interactions. To appear in a substantial manner, the interaction through the exchange of miss-streams has to be very intense, making it feasible for the mistreated nodes to detect and react to exploitation. This robustness ceases to exist when nodes fetch and store objects in response to remote requests, i.e., when they operate as Level-2 caches (or proxies) for other nodes. Regarding mistreatment due to a common scheme, we show that this can easily take place when the "outlier" characteristics of some of the nodes get overlooked. This finding underscores the importance of allowing cooperative caching nodes the flexibility of choosing from a diverse set of schemes to fit the peculiarities of individual nodes. To that end, we outline an emulation-based framework for the development of mistreatment-resilient distributed selfish caching schemes.
Efficient k-nearest-neighbor search algorthims for historical moving object trajectories
Authors: Yun-Jun Gao, Chun Li, Gen-Cai Chen, Ling Chen, Xian-Ta Jiang, Chun Chen
Venue: Journal of Computer Science and Technology (2007)

k Nearest Neighbor (kNN) search is one of the most important operations in spatial and spatio-temporal databases. Although it has received considerable attention in the database literature, there is little prior work on kNN retrieval for moving object trajectories. Motivated by this observation, this paper studies the problem of efficiently processing kNN (k ≥ 1) search on R-tree-like structures storing historical information about moving object trajectories. Two algorithms are developed based on best-first traversal paradigm, called BFPkNN and BFTkNN, which handle the kNN retrieval with respect to the static query point and the moving query trajectory, respectively. Both algorithms minimize the number of node access, that is, they perform a single access only to those qualifying nodes that may contain the final result. Aiming at saving main-memory consumption and reducing CPU cost further, several effective pruning heuristics are also presented. Extensive experiments with synthetic and real datasets confirm that the proposed algorithms in this paper outperform their competitors significantly in both efficiency and scalability.
Systematic development of data mining-based data quality tools
Authors: Dominik Luebbers, Udo Grimmer, Matthias Jarke
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

Data quality problems have been a persistent concern especially for large historically grown databases. If maintained over long periods, interpretation and usage of their schemas often shifts. Therefore, traditional data scrubbing techniques based on existing schema and integrity constraint documentation are hardly applicable. So-called data auditing environments circumvent this problem by using machine learning techniques in order to induce semantically meaningful structures from the actual data, and then classifying outliers that do not fit the induced schema as potential errors. However, as the quality of the analyzed database is a-priori unknown, the design of data auditing environments requires special methods for the calibration of error measurements based on the induced schema. In this paper, we present a data audit test generator that systematically generates and pollutes artificial benchmark databases for this purpose. The test generator has been implemented as part of a data auditing environment based on the well-known machine learning algorithm C4.5. Validation in the partial quality audit of a large service-related database at Daimler-Chrysler shows the usefulness of the approach as a complement to standard data scrubbing.
Research of Spatial Data Discovery Technology on Digital Forestry platform
Authors: Pinghui Yan, Xu Zhang, Fan Li
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

Digital forestry platform was introduced and special requirements of spatial data discovery were analyzed in this platform. The hierarchical and distributed architecture of spatial data discovery was put forward. Global metadata model, OLAP-oriented metadata aggregation and spatial relation knowledge repository were deeply researched. Global metadata model not only mainly provides spatial data entity description and Web service information but also builds relationship between them; OLAP-oriented metadata aggregation generates date cube through extracting and aggregating; spatial relation knowledge repository supplies necessary knowledge of spatial information process and analysis. Based on aforementioned technologies and researches, spatial data discovery module has realized multi-perspective view data and service display, data and service automatic match and on-demand data service. Thus, it meets special application system requirements on digital forestry platform.
On implementing mpeg-21 intellectual property management and protection
Authors: Nicholas Paul Sheppard
Venue: Proceedings of the 2007 ACM workshop on Digital Rights Management (2007)

The MPEG-21 Intellectual Property Management and Protection ("IPMP") Components specify a framework for inter-operable and renewable digital rights management based on IPMP tools that implement proprietary digital rights management features. MPEG-21 defines the mechanism by which protected multimedia objects are associated with proprietary IPMP tools, but does not specify the interface through which IPMP tools and MPEG-21 terminals communicate.This paper describes an implementation of the IPMP components including an interface to IPMP tools based on the MPEG Rights Expression Language; dynamic construction of authorisation proofs that permit a principal to carry out an action; and a cryptographic architecture bound to the existence of authorisation proofs. This implementation has been applied to scenarios in copyright protection, privacy protection and corporate document protection, suggesting that ``IPMP'' may be useful in applications other than intellectual property.
Program Testing Complexity and Test Criteria
Authors: Kuo-Chung Tai
Venue: IEEE Transactions on Software Engineering (1980)

This paper explores the testing complexity of several classes of programs, where the testing complexity is measured in terms of the number of test data required for demonstrating program correctness by testing. It is shown that even for very restrictive classes of programs, none of the commonly used test criteria, namely, having every statement, branch, and path executed at least once, is nearly sufficient to guarantee absence of errors.
Minimizing Interference in Satellite Communications Using Chaotic Neural Networks
Authors: Wen Liu, Haixiang Shi, Lipo Wang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

We solve the frequency assignment problem (FAP) in satellite communications with transiently chaotic neural networks (TCNN). The objective of this optimization problem is to minimize cochannel interference between two satellite systems by rearranging the frequency assignments. For anN-carrier-M-segment FAP problem, the TCNN consists of N × M neurons. The performance of the TCNN is demonstrated through solving a set of benchmark problems, where the TCNN finds comparative if not better solutions compared to the existing algorithms.
PEUC-WiN: Privacy Enhancement by User Cooperation in Wireless Networks
Authors: Karim Defrawy, Claudio Soriente
Venue: Proceedings of the 2006 2nd IEEE Workshop on Secure Network Protocols (2006)

Location awareness capabilities of today's wireless networks provide position tailored services but, at the same time, impose serious privacy implications for the wireless users. Interface identifiers allow an adversary to trace a user's movement and location over time in a wireless environment. This causes a significant privacy threat to users, since an adversary could learn a lot of information about them from their locations. Current proposed location privacy mechanisms suffer from a high rate of network disruption and degraded throughput. In this paper, we introduce a new scheme to improve the location privacy of wireless users while minimizing network disruption. The proposed scheme achieves its goals by exploiting the collaboration among users in the same coverage area of an access point in a wireless system.
Performance Evaluation of Handling Interrupts Schemes in Gigabit Networks
Authors: Salman A. AlQahtani
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

Multimedia applications over high-speed networks can generate heavy load conditions. When high-speed network end system is involved in processing the network traffic, its performance depends critically on how its tasks are scheduled. Therefore, the polices and mechanism that schedule incoming network traffic and other tasks should guarantee acceptable system throughput, reasonable latency and jitter, reasonable system availability, fair allocation of CPU resources among multimedia traffic reception, packets transmission, protocol processing, application processing, and over all system stability, without imposing excessive overhead. In this paper we compare different schemes for handling interrupts in Gigabit networking environment. Moreover, the performance measures of hard timer and soft timer polling schemes used for high-speed network interface with high traffic load are also studied and compared. In addition to the throughput performance metric in which most of the literatures focus on only, other performance metrics such as CPU availability, loss ratio, packet delay are defined and studied.
An Improved Kademlia Protocol In a VoIP System
Authors: Xiao Wu, Cuiyun Fu, Huiyou Chang
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

Kademlia, which has been widely used in file sharing systems such as eMule and Overnet, concerns mainly on the resources and prefer to locate precisely the right peers despite of time consuming. We proposed an improved kademlia protocol to adapt to VoIP systems meeting the need of real-time audio service and establishing a conversation in short delay. Beside, to provide an effective circuit switching we present timely backup channel for each peer to rescue interrupted conversation.
View Modeling and Integration Using the Functional Data Model
Authors: S. B. Yao
Venue: IEEE Transactions on Software Engineering (1982)

Conventional database design techniques rely heavily on the designer's skill and experience, which are neither efficient nor effective for large, realistic design problems. A computer design aid can help by storing many design parameters and performing simple preprocessing before design decisions are made. In this paper, we report on the development of such a system.
Medical Image Categorization Based on Wavelet Transform and Self-Organizing Map
Authors: Leonardo Augusto da Silva, Ramon Alfredo Moreno, Sergio Shiguemi Furuie, Emilio Del Moral Hernandez
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

Nowadays, images are fundamental data source in mod- ern medicine. The images stored in a database according with categories are an important step for data mining and content-based image retrieval (CBIR). These can support doctors and students in diagnostic decisions and provide research and didactic material. This work addresses the use of discrete wavelet transform and Self-Organizing Map (SOM) to medical image categorization. Furthermore, ex- tensive experiments to define map size, finetune using linear vector quantization and a contrastive study with another success approach of categorization are realized.
Motion control and implementation for an AC servomotor system
Authors: L. Canan Dülger, Ali Kireçci
Venue: Modelling and Simulation in Engineering (2007)

This paper presents a study on trajectory tracking problem for an AC synchronous servomotor. A mathematical model for the system including AC synchronous servomotor, gearbox, and a load is developed to examine the systems dynamic behavior. The system is controlled by a traditional PID (proportional + integral + derivative) controller. The required values for the controller settings are found experimentally. Different motion profiles are designed, and trapezoidal ones are implemented. Thus, the experimental validation of the model is achieved using the experimental setup. The simulation and experimental results are presented. The tracking performance of an AC servomotor system is illustrated with proposed PID controller.
Camera interface method in mobile handset and its performance comparison
Authors: Minyoung Eom, Jaegeun Oh, Seok Wook Kim
Venue: Proceedings of the 2007 International Conference on Parallel Processing Workshops (2007)

As 3G became the general tendency of mobile industry, new mobile handsets are challenged to show more and more functions. In order to process high-resolution images, the high-speed data transfer technology that was originally used in communication system or server system started to be adopted in mobile handsets. It is the purpose of this paper to describe and compare some technologies for highspeed data transfer between camera and ISP(Image Signal Processor) focusing on specifications in the PHY layer, after going over the structural features of the mobile handsets. Most of these technologies are based on serial interface and they show excellence in terms of power, bandwidth and EMI in comparison to the conventional parallel interface based on the LVCMOS technology. In order to verify this fact, this paper presents a comparison of the SMIA interfaced camera module which represents the serial interface (as an example of the subLVDS technology) and the parallel interfaced camera module which represents the parallel interface (as an example of a general LVCMOS technology).
A combinatorial testing strategy for concurrent programs
Authors: Yu Lei, Richard H. Carver, Raghu Kacker, David Kung
Venue: Software Testing, Verification Reliability (2007)

One approach to testing concurrent programs is called reachability testing, which derives test sequences automatically and on-the-fly, without constructing a static model. Existing reachability testing algorithms are exhaustive in that they are intended to exercise all possible synchronization sequences of a concurrent program with a given input. In this paper, we present a new testing strategy, called t-way reachability testing, that adopts the dynamic framework of reachability testing but selectively exercises a subset of synchronization sequences. The selection of the synchronization sequences is based on a combinatorial testing strategy called t-way testing. We present an algorithm that implements t-way reachability testing, and report the results of several case studies that were conducted to evaluate its effectiveness. The results indicate that t-way reachability testing can substantially reduce the number of synchronization sequences exercised during reachability testing while still effectively detecting faults. Copyright &copy; 2007 John Wiley & Sons, Ltd.
Games: Once More, with Feeling
Authors: Michael van Lent, William Swartout
Venue: Computer (2007)

Achieving increased player engagement involves adding deep emotional experiences to videogames.
HMM-Based Online Handwriting Recognition System for Telugu Symbols
Authors: V. Babu, L. Prasanth, R. Sharma, G. V. Rao, A. Bharath
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01 (2007)

In this paper we present an online handwritten symbol recognition system for Telugu, a widely spoken language in India. The system is based on Hidden Markov Models (HMM) and uses a combination of time-domain and frequency-domain features. The system gives top-1 accuracy of 91.6% and top-5 accuracy of 98.7% on a dataset containing 29,158 train samples and 9,235 test samples. We also introduce a cost-effective and natural data collection procedure based on ACECAD® Digimemo® and describe its usage in building a Telugu handwriting dataset.
Neural Networks for Approximation of Real Functions with the Gaussian Functions
Authors: Xuli Han, Muzhou Hou
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

We present a type of single-hidden layer feedforward neural networks with the Gaussian activation function. First, we give a new and quantitative proof of the fact that a single layer neural networks with n + 1 hidden neurons can learn n + 1 distinct samples with zero error. Then we give approximate interpolants. They can approximate interpolate, with arbitrary precision, any set of distinct data in one or several dimensions. They can uniformly approximate any continuous function of one variable.
An assessment of the impact of ELEXSA visualizations on operator situation awareness
Authors: Keith Mason, Catherine Howard, Jeff Sturm, Craig Keogh
Venue: Proceedings of the 19th Australasian conference on Computer-Human Interaction: Entertaining User Interfaces (2007)

Decision making in the tactical military domain is a time-critical, high stress, high stake activity. This paper presents the results of a human-in-the-loop experiment conducted to assess the impact of novel visualizations of radar detection ranges and safe areas on operator situation awareness of the tactical environment. The experiment involved comparing the performance of two groups of eight operators attempting to achieve the same tactical goals within the same scenario using two different, but functionally equivalent, situation awareness environments; one environment incorporated the novel visualizations outlined in this paper and one did not. The experiment showed that the novel visualizations: (1) increased operator survivability; (2) shortened mission duration; and (3) reduced the time the operator spent vulnerable to radar detection compared to the standard environment. Analysis of operator perceptions elicited via post simulation interviews showed that operators using the visualizations experienced lower workload and stress levels and had more accurate perceptions of their vulnerability to radar detection than those operators using the standard environment.
Analysis and test of efficient methods for building recursive deterministic perceptron neural networks
Authors: David A. Elizondo, Ralph Birkenhead, Mario Góngora, Eric Taillard, Patrick Luyima
Venue: Neural Networks (2007)

The Recursive Deterministic Perceptron (RDP) feed-forward multilayer neural network is a generalisation of the single layer perceptron topology. This model is capable of solving any two-class classification problem as opposed to the single layer perceptron which can only solve classification problems dealing with linearly separable sets. For all classification problems, the construction of an RDP is done automatically and convergence is always guaranteed. Three methods for constructing RDP neural networks exist: Batch, Incremental, and Modular. The Batch method has been extensively tested and it has been shown to produce results comparable with those obtained with other neural network methods such as Back Propagation, Cascade Correlation, Rulex, and Ruleneg. However, no testing has been done before on the Incremental and Modular methods. Contrary to the Batch method, the complexity of these two methods is not NP-Complete. For the first time, a study on the three methods is presented. This study will allow the highlighting of the main advantages and disadvantages of each of these methods by comparing the results obtained while building RDP neural networks with the three methods in terms of the convergence time, the level of generalisation, and the topology size. The networks were trained and tested using the following standard benchmark classification datasets: IRIS, SOYBEAN, and Wisconsin Breast Cancer. The results obtained show the effectiveness of the Incremental and the Modular methods which are as good as that of the NP-Complete Batch method but with a much lower complexity level. The results obtained with the RDP are comparable to those obtained with the backpropagation and the Cascade Correlation algorithms.