ppxscal/embedding_network huggingface dataset:
Provable programs and processors
Authors: Donald I. Good
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

"A proof of correctness guarantees that a program will run correctly every time it is executed." That statement is not necessarily true. Suppose, for sake of concreteness, that a valid proof of a Fortran program has been constructed. When this program was proved, it most likely was proved in isolation from the other software components which ultimately will be involved in actually making the program run. So, even though we have proved the Fortran program, one of these other components, or the system hardware, may malfunction causing the actual machine language program that is executed to produce an error. These comments are not an argument against proving programs at the Fortran level, but rather an indication of the eventual need for a completely proved computing system.
Non-negative Matrix Factorization on Manifold
Authors: Deng Cai, Xiaofei He, Xiaoyun Wu, Jiawei Han
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

Recently Non-negative Matrix Factorization (NMF) has received a lot of attentions in information retrieval, computer vision and pattern recognition. NMF aims to find two non-negative matrices whose product can well approximate the original matrix. The sizes of these two matrices are usually smaller than the original matrix. This results in a compressed version of the original data matrix. The solution of NMF yields a natural parts-based representation for the data. When NMF is applied for data representation, a major disadvantage is that it fails to consider the geometric structure in the data. In this paper, we develop a graph based approach for parts-based data representation in order to overcome this limitation. We construct an affinity graph to encode the geometrical information and seek a matrix factorization which respects the graph structure. We demonstrate the success of this novel algorithm by applying it on real world problems.
High accurate positioning technique for AUV
Authors: Tain-Sou Tsay
Venue: WSEAS Transactions on Systems and Control (2009)

In this paper, a high accurate positioning technique is proposed for autonomous underwater vehicle(AUV). It needs not position correction from Global Position System (GPS) above the sea surface and short- or long-baseline acoustic positioning system(SBL or LBL) under the sea. Two long time experiments gave maximal and average deviations are less than 33.6m and 15.1m; respectively. Position deviations are verified by tracking datum of a long-baseline acoustic position system with post navigation processing datum. These deviations are much less than the tracking range of sonar. High accurate positioning results let vehicles have less supporting from launching vessel and give flexible and mobile operations.
Revising an assessment plan to conform to the new ABET-CAC guidelines
Authors: Donald B. Sanderson
Venue: Proceedings of the 40th ACM technical symposium on Computer science education (2009)

This paper will describe the changes made to an existing student outcomes assessment system to more closely conform to the new assessment guidelines of the Computer Accreditation Commission of ABET. The processes, results and effectiveness of the techniques will be examined.
Parameter extraction for PSP MOSFET model using hierarchical particle swarm optimization
Authors: R. A. Thakker, M. B. Patil, K. G. Anil
Venue: Engineering Applications of Artificial Intelligence (2009)

The particle swarm optimization (PSO) algorithm is applied to the problem of MOSFET parameter extraction for the first time. It is shown to perform significantly better than the genetic algorithm (GA). Several modifications of the basic PSO algorithm have been implemented: (a) Hierarchical PSO (HPSO) in which particles are hierarchically arranged and influenced by the positions of the local and global leaders, (b) memory loss operation due to which a particle forgets its past best position, (c) intensive local search in which the solution space around the global leader is searched with a high resolution, and (d) adaptive inertia which causes the inertia of the particles to change adaptively, depending on the fitness of the population. It is demonstrated that the above features improve the performance of the basic PSO algorithm both for the MOSFET parameter extraction problem and for benchmark functions.
About the Computation Time of Adaptive Evolutionary Algorithms
Authors: Lixin Ding, Jinghu Yu
Venue: Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence (2008)

The computation time of general adaptive evolutionary algorithms based on finite search space is investigated in this paper. An adaptive evolutionary algorithm can be formalized as an inhomogeneous Markov chain. By using Markov property, some exact analytic expressions of the mean first hitting time corresponding to the adaptive evolutionary algorithm are obtained. The upper and lower bounds are also estimated by introducing drift analysis and Dynkin's formula. Furthermore, the convergence of a constructive adaptive (1 + 1) ¿EA is studied and its time complexity for a well-known toy problem is given.
PenLight: combining a mobile projector and a digital pen for dynamic visual overlay
Authors: Hyunyoung Song, Tovi Grossman, George Fitzmaurice, François Guimbretiere, Azam Khan, Ramtin Attar, Gordon Kurtenbach
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Digital pen systems, originally designed to digitize annotations made on physical paper, are evolving to permit a wider variety of applications. Although the type and quality of pen feedback (e.g., haptic, audio, and visual) have a huge impact on advancing the digital pen technology, dynamic visual feedback has yet to be fully investigated. In parallel, miniature projectors are an emerging technology with the potential to enhance visual feedback for small mobile computing devices. In this paper we present the PenLight system, which is a testbed to explore the interaction design space and its accompanying interaction techniques in a digital pen embedded with a spatially-aware miniature projector. Using our prototype, that simulates a miniature projection (via a standard video projector), we visually augment paper documents, giving the user immediate access to additional information and computational tools. We also show how virtual ink can be managed in single and multi-user environments to aid collaboration and data management. User evaluation with professional architects indicated promise of our proposed techniques and their potential utility in the paper-intensive domain of architecture.
Improving the Efficiency of Load Balancing Games through Taxes
Authors: Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos
Venue: Proceedings of the 4th International Workshop on Internet and Network Economics (2008)

In load balancing games, there is a set of available servers and a set of clients; each client wishes to run her job on some server. Clients are selfish and each of them selects a server that, given an assignment of the other clients to servers, minimizes the latency she experiences with no regard to the global optimum. In order to mitigate the effect of selfishness on the efficiency, we assign taxes to the servers. In this way, we obtain a new game where each client aims to minimize the sum of the latency she experiences and the tax she pays. Our objective is to find taxes so that the worst equilibrium of the new game is as efficient as possible. We present new results concerning the impact of taxes on the efficiency of equilibria, with respect to the total latency of all clients and the maximum latency (makespan).
W41K: digitally augmenting traditional game environments
Authors: Steve Hinske, Marc Langheinrich
Venue: Proceedings of the 3rd International Conference on Tangible and Embedded Interaction (2009)

Augmented game environments use unobtrusively embedded technology to augment traditional games with virtual information and novel interaction capabilities. This article establishes and discusses a set of guidelines for designing and implementing such environments, based on our experiences in creating digital augmentations of existing play environments. We suggest a two-step process comprised of game flow virtualization and physical artifact augmentation to create augmented game environments based on existing table top games. We will then demonstrate how these guidelines can be put to practice by presenting the augmented version of a miniature war game.
L-fuzzy interiors and L-fuzzy closures
Authors: Fu-Gui Shi
Venue: Fuzzy Sets and Systems (2009)

In this paper, we introduce new definitions of L-fuzzy neighborhood systems, L-fuzzy interior operators and L-fuzzy closure operators. Three characterizations of the category L-FTOP of L-fuzzy topological spaces and their L-fuzzy continuous mappings are presented by means of the category L-FNS of L-fuzzy neighborhood spaces and their continuous mappings, the category L-FIS of L-fuzzy interior spaces and their L-fuzzy continuous mappings, and the category L-FCS of L-fuzzy closure spaces and their L-fuzzy continuous mappings.
A hybrid channel allocation algorithm with priority to handoff calls in mobile cellular networks
Authors: Yuhong Zhang, Ezzatollah Salari
Venue: Computer Communications (2009)

This paper proposes and investigates a novel analytical model of a hybrid channel allocation algorithm within wireless cellular networks. Each cell of the network consists of a predesigned fixed number of channels and the network may approve the request for extra channels for both new and handoff calls if all predesigned channels are occupied. This approval depends on the types of new and handoff calls, as well as the number of approved additional channels in the cell. If a request is denied for the arriving new call, this call will be blocked and cleared from the system. However, if a request is denied for an arriving handoff call, this call will not be blocked immediately but rather put on hold in a buffer with finite space. The implication behind this is to give priority to handoff calls. For this proposed hybrid channel allocation scheme, we first obtain the stationary distribution of each cell when there are i calls connecting to the system and j calls holding on in the buffer. We then derive new and handoff call blocking probabilities, the average number of borrowed channels, and the average delay period of handoff calls. The numerical results show that the proposed hybrid algorithm is more efficient than other approaches, specifically, in comparison with methods without a borrowing capability for new calls and those without a reserved buffer priority for handoff calls. The idea and results presented in this paper are expected to provide guidelines for field data processing within current wireless and mobile network design and performance evaluation.
On BAN logic and hash functions or: how an unjustified inference rule causes problems
Authors: Wouter Teepe
Venue: Autonomous Agents and Multi-Agent Systems (2009)

BAN logic, an epistemic logic for analyzing security protocols, contains an unjustifiable inference rule. The inference rule assumes that possession of H(X) (i.e., the cryptographic hash value of X) counts as a proof of possession of X, which is not the case. As a result, BAN logic exhibits a problematic property, which is similar to unsoundness, but not strictly equivalent to it. We will call this property `unsoundness' (with quotes). The property is demonstrated using a specially crafted protocol, the two parrots protocol. The `unsoundness' is proven using the partial semantics which is given for BAN logic. Because of the questionable character of the semantics of BAN logic, we also provide an alternative proof of `unsoundness' which we consider more important.
A neural network based approach for protein structural class prediction
Authors: Ayan Datta, Veera Talukdar, Amit Konar, Lakhmi C. Jain
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2009)

The paper provides an alternative approach to protein structural class prediction employing artificial neural network. Existing works on protein structural class prediction are computationally intensive. The method employs SOFM for extraction of representative feature vectors, for the four different structural classes and then uses Principal Component Analysis for finding optimum feature vector dimension. Nearest neighborhood classification technique is finally utilised; to classify these protein datapoints to their respective classes. The proposed work presented in this paper, maintains the same level of classification accuracy in minimum computation time, as it employs most prominent and reduced number of feature set for classification.
Analysis of the oral interface in the interactive servicing systems. I
Authors: R. V. Bilik, V. A. Zhozhikashvili, N. V. Petukhova, M. P. Farkhadov
Venue: Automation and Remote Control (2009)

The oral technologies created a new type of the human-computer interaction. The oral servers and oral portals which implement a new model of human-computer communications may be studied using the methods of the queuing theory. Development of the analytical models to estimate some numerical characteristics of the human-computer one-channel dialogue such as the probability of successful dialogue, number of overinterrogations, and mean time of dialogue are the immediate subject matters of such studies. These characteristics may be used further to analyze operation of the entire queuing system that models the multichannel oral portal. The main parameters of the human-computer dialogue such as the probability of correct recognition of an element and the entire dialogue at overinterrogations and the time used for a dialogue element were considered. The parameters for estimation of the dialogue length were determined. A classification of the dialogue control algorithms at oral interaction of the client with the computer-aided information and servicing systems was developed. The algorithms were compared in terms of duration with regard for the desired reliability of recognition.
X-Ray Image Classification and Retrieval Using Ensemble Combination of Visual Descriptors
Authors: Jeonghee Shim, Kihee Park, Byoungchul Ko, Jaeyeal Nam
Venue: Proceedings of the 3rd Pacific Rim Symposium on Advances in Image and Video Technology (2009)

In this paper, we propose a novel algorithm for the efficient classification and retrieval of medical images, especially X-ray images. Since medical images have bright foreground against dark background, we extract MPEG-7 visual descriptor from only salient parts of foreground. For color descriptor, Color Structure Descriptor (H-CSD) is extracted from salient points, which are detected by Harris corner detector. For texture descriptor, Edge Histogram Descriptor (EHD) is extracted from global and local parts of images. Then extracted feature vector is applied to multi-class Support Vector Machine (SVM) to give membership scores for each image. From the membership scores of H-CSD and EHD, two membership scores are combined as one ensemble feature and it is used for similarity matching of our retrieval system, MISS (Medical Information Searching System). The experimental results using CLEF-Med2007 images show that our system can indeed improve retrieval performance compared to other global property-based or other classification-based retrieval methods.
Passive Reflectometry
Authors: Fabiano Romeiro, Yuriy Vasilyev, Todd Zickler
Venue: Proceedings of the 10th European Conference on Computer Vision: Part IV (2008)

Different materials reflect light in different ways, so reflectance is a useful surface descriptor. Existing systems for measuring reflectance are cumbersome, however, and although the process can be streamlined using cameras, projectors and clever catadioptrics, it generally requires complex infrastructure. In this paper we propose a simpler method for inferring reflectance from images, one that eliminates the need for active lighting and exploits natural illumination instead. The method's distinguishing property is its ability to handle a broad class of isotropic reflectance functions, including those that are neither radially-symmetric nor well-represented by low-parameter reflectance models. The key to the approach is a bi-variate representation of isotropic reflectance that enables a tractable inference algorithm while maintaining generality. The resulting method requires only a camera, a light probe, and as little as one HDR image of a known, curved, homogeneous surface.
Integration of bottom-up and top-down contextual knowledge in text error correction
Authors: Sargur N. Srihari, Jonathan J. Hull, Ramesh Choudhari
Venue: Proceedings of the June 7-10, 1982, national computer conference (1982)

This paper presents an efficient method for the integration of two forms of contextual knowledge into the correction of character substitution errors in words of text: bottom-up knowledge in the form of character transitional probabilities and top-down knowledge in the form of a dictionary. The method is a modification of the Viterbi algorithm---which maximizes string a posteriori probability by using character confusion and transitional probabilities---so that only legal strings are output. The algorithm achieves its efficiency by using a trie structure representation of a dictionary in the search process. An analysis of the computational complexity and the results of experimentation with the approach are presented.
Letters: An analysis on global robust exponential stability of neural networks with time-varying delays
Authors: Jin-Liang Shao, Ting-Zhu Huang, Sheng Zhou
Venue: Neurocomputing (2009)

The paper presents a new sufficient condition for the existence, uniqueness and global robust exponential stability of the equilibrium point for interval neural networks with time-varying delays. Theoretical analysis indicates that the obtained result improves and generalizes some previous results derived in the literatures. It is also shown by a numerical example that a recently reported result is invalid because the proof of it is not always right. Finally, a numerical example and the corresponding simulation are given to show the effectiveness of the obtained result.
Efficient estimation of copula-GARCH models
Authors: Yan Liu, Richard Luger
Venue: Computational Statistics Data Analysis (2009)

An iterative (fixed-point) algorithm for the maximum-likelihood estimation of copula-based models that circumvents the need to compute second-order derivatives of the full likelihood function is adapted and examined. The algorithm exploits the structure of copula-based models that yield a natural decomposition of a potentially complicated likelihood function into two parts. The first part is a working likelihood that only involves the parameters of the marginals and the residual part is used to update estimates from the first part. A modified algorithm based on a working likelihood that accounts for some degree of correlation between the marginals is proposed. Compared to the original algorithm based on the working likelihood with the independent correlation, the modified one provides a better approximation to the full likelihood and overcomes convergence difficulties. A numerical example illustrates the efficiency gains of the estimation algorithms in the context of a benchmark copula-GARCH model. The modified algorithm is illustrated by an application to daily returns on two major stock market indices.
A new method for safe distance estimation between moving vehicles
Authors: Mahdi Mirzabaki
Venue: Proceedings of the 3rd WSEAS international conference on Computer engineering and applications (2009)

One of the main dangerous specially in high speeds that threaten the life of drivers, is this fact that human reaction is low and in comparison with high velocity of moving vehicles in some special conditions such as in freeways, it will be lower. So, driver would not have enough time to react and it causes some bad accidents. What you will see in this paper, is a new method and system that can estimate differential velocity and distance of a vehicle that it is situated, from other car that is moving head of the mentioned car. Whereas our system is based on image processing, first a summary of done research and works in traffic control that uses image processing, will be presented. Then new method will be explained. And we look at a background method that proposed method is based on it and at last we will see the advantages and limitation of this method and discuss about the result of experiments.
Privacy-preserving incremental data dissemination
Authors: Ji-Won Byun, Tiancheng Li, Elisa Bertino, Ninghui Li, Yonglak Sohn
Venue: Journal of Computer Security (2009)

Although the k-anonymity and &ell;-diversity models have led to a number of valuable privacy-protecting techniques and algorithms, the existing solutions are currently limited to static data release. That is, it is assumed that a complete dataset is available at the time of data release. This assumption implies a significant shortcoming, as in many applications data collection is rather a continual process. Moreover, the assumption entails &ldquo;one-time&rdquo; data dissemination; thus, it does not adequately address today's strong demand for immediate and up-to-date information. In this paper, we consider incremental data dissemination, where a dataset is continuously incremented with new data. The key issue here is that the same data may be anonymized and published multiple times, each of the time in a different form. Thus, static anonymization (i.e., anonymization which does not consider previously released data) may enable various types of inference. In this paper, we identify such inference issues and discuss some prevention methods.
Perfectly fair channel assignment in non-cooperative multi-radio multi-channel wireless networks
Authors: Tingting Chen, Sheng Zhong
Venue: Computer Communications (2009)

The channel assignment problem is very important in wireless networks. In this letter, we study the non-cooperative channel assignment problem in competitive multi-radio multi-channel wireless networks, with a focus on fairness issues. We propose a Nash equilibrium solution with stronger guarantee on fairness among players than existing works, by requiring a payment from each player. We show that, in our scheme, when system converges to a stable status achieving Nash equilibrium, all players obtain the same throughput. Simulation results verify that our scheme achieves perfect fairness.
Plenary lecture II: feature extraction methods in machine vision systems
Authors: Ryszard S. Choras
Venue: Proceedings of the 8th conference on Signal processing, computational geometry and artificial vision (2008)

The machine vision systems have not only to "see" where an object is placed and how it is placed but sometimes also to identify the object. A visual system can perform the following functions: the image acquisition and analysis, the recognition of an object or objects within an object groups. In machine vision systems, visual features such as shape, color and texture are extracted to characterize images. Each of the features is represented using one or more feature descriptors. The feature extraction methods for this applications are discussed.