ppxscal/embedding_network huggingface dataset:
Embedding fault-free cycles in crossed cubes with conditional link faults
Authors: Jung-Sheng Fu, Hao-Shun Hung, Gen-Huey Chen
Venue: The Journal of Supercomputing (2009)

The crossed cube, which is a variation of the hypercube, possesses some properties that are superior to those of the hypercube. In this paper, we show that with the assumption of each node incident with at least two fault-free links, an n-dimensional crossed cube with up to 2n¿5 link faults can embed, with dilation one, fault-free cycles of lengths ranging from 4 to 2 n . The assumption is meaningful, for its occurrence probability is very close to 1, and the result is optimal with respect to the number of link faults tolerated. Consequently, it is very probable that algorithms executable on rings of lengths ranging from 4 to 2 n can be applied to an n-dimensional crossed cube with up to 2n¿5 link faults.
Towards a Type System for Security APIs
Authors: Gavin Keighren, David Aspinall, Graham Steel
Venue: Foundations and Applications of Security Analysis: Joint Workshop on Automated Reasoning for Security Protocol Analysis and Issues in the Theory of Security, ARSPA-WITS 2009, York, UK, March 28-29, 2009, Revised Selected Papers (2009)

Security API analysis typically only considers a subset of an API's functions, with results bounded by the number of function calls. Furthermore, attacks involving partial leakage of sensitive information are usually not covered.Type-based static analysis has the potential to alleviate these shortcomings. To that end, we present a type system for secure information flow based upon the one of Volpano, Smith and Irvine [1], extended with types for cryptographic keys and ciphertext similar to those in Sumii and Pierce [2]. In contrast to some other type systems, the encryption and decryption of keys does not require special treatment.We show that a well-typed sequence of commands is non-interferent, based upon a definition of indistinguishability where, in certain circumstances, the adversary can distinguish between ciphertexts that correspond to encrypted public data.
Mobile Phone Usability Questionnaire (MPUQ) and Automated Usability Evaluation
Authors: Young Sam Ryu
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part I: New Trends (2009)

The mobile phone has become one of the most popular products amongst today's consumers. The Mobile Phone Usability Questionnaire (MPUQ) was developed to provide an effective subjective usability measurement tool, tailored specifically to the mobile phone. Progress is being made in the HCI research community towards automating some aspects of the usability evaluation process. Given that this effort is gaining traction, a tool for measurement of subjective usability, such as MPUQ, may serve as a complement to automated evaluation methods by providing user-centered values and emotional aspects of the product. Furthermore, experimental comparison of MPUQ assessments and automated usability analysis may enable researchers to determine whether automated usability tools generate metrics that correlate with user impressions of usability.
An Automatic Method for Counting Annual Rings in Noisy Sawmill Images
Authors: Kristin Norell
Venue: Proceedings of the 15th International Conference on Image Analysis and Processing (2009)

The annual ring pattern of a log end face is related to the quality of the wood. We propose a method for computing the number of annual rings on a log end face depicted in sawmill production. The method is based on the grey-weighted polar distance transform and registration of detected rings from two different directions. The method is developed and evaluated on noisy images captured in on-line sawmill production at a Swedish sawmill during 2008, using an industrial colour camera. We have also evaluated the method using synthetic data with different ring widths, ring eccentricity, and noise levels.
Intelligent Information Processing in Semantically Enriched Web
Authors: Pavol Návrat, Mária Bieliková, Daniela Chudá, Viera Rozinajová
Venue: Proceedings of the 18th International Symposium on Foundations of Intelligent Systems (2009)

Acquiring information from the Web is a demanding task and currently subject of a world-wide research. In this paper we focus on research of methods, and experience with development of software tools designed for retrieval, organization, presentation of information in heterogeneous data source spaces such as the Web. We see the Web as a unique evolving and unbounded information system. The presented concepts can be used also in other specific contexts of information systems in organizations that increasingly become worldwide and weaved together considering information processing.
Extending pronunciation lexicons via non-phonemic respellings
Authors: Lucian Galescu
Venue: Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics, Companion Volume: Short Papers (2009)

This paper describes work in progress towards using non-phonemic respellings as an additional source of information besides spelling in the process of extending pronunciation lexicons for speech recognition and text-to-speech systems. Preliminary experimental data indicates that the approach is likely to be successful. The major benefit of the approach is that it makes extending pronunciation lexicons accessible to average users.
Grid broker selection strategies using aggregated resource information
Authors: Ivan Rodero, Francesc Guim, Julita Corbalan, Liana Fong, S. Masoud Sadjadi
Venue: Future Generation Computer Systems (2010)

The increasing demand for high performance computing resources has led to new forms of collaboration of distributed systems, such as grid computing systems. Moreover, the need for interoperability among different grid systems through the use of common protocols and standards has become increased in the last few years. In this paper we describe and evaluate scheduling techniques for multiple grid scenarios. In particular, they consist of the proposed ''bestBrokerRank'' broker selection policy and two different variants. The first one uses the resource information in aggregated forms as input, and the second one also uses the broker average bounded slowdown as a dynamic performance metric. From our evaluations performed with simulation tools, we state that, although the aggregation algorithms lose resource information accuracy, the broker selection policies using aggregated resource data do not penalize their performance significantly. Moreover, we show that the best performance results are obtained with the coordinated policy using dynamic performance information, in addition to aggregated resource information. Therefore, we conclude that delegating part of the scheduling responsibilities to the underlying scheduling layers promotes separation of concerns and is a good way to balance the performance among the different grid systems.
Towards a game-theoretic approach to content determination
Authors: Ralf Klabunde
Venue: Proceedings of the 12th European Workshop on Natural Language Generation (2009)

This paper argues for a game-theoretic approach to content determination that uses text-type specific strategies in order to determine the optimal content for various user types. By means of content determination for the description of numerical data the benefits of a game-theoretic treatment of content determination are outlined.
Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, 1st edition
Authors: Roger Lee, Naohiro Ishii
Venue: Studies In Computational Intelligence (2009)

The 10th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, held in Daegu, Korea on May 27-29, 2009 is aimed at bringing together researchers and scientist, businessmen and entrepreneurs, teachers and students to discuss the numerous fields of computer science, and to share ideas and information in a meaningful way. This publication captures 20 of the conference's most promising papers, and we impatiently await the important contributions that we know these authors will bring to the field.
Estimate Link-Level Transition Matrix from End-to-End Observations
Authors: Weiping Zhu
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 01 (2009)

Network tomography aims to estimate network characteristics fromend-to-end (e2e) observation, e.g. link-level loss rate and delaydistribution. In this paper, a method is proposed to estimatelink-level transition matrix from e2e observations. The estimateobtained from the proposed method is an MLE. Simulation study showsthe estimate obtained by the proposed method is very close to thedirect measurement that makes it possible to use the estimatedcharacteristic to predict the performance of a link or a path for ashort period.
Searching Algorithm with Granularity Changing and the GNSS Integer Ambiguity Estimation
Authors: Xiaoping Chen, Rongle Kang
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

The traditional algorithm of GNSS orientation using LAMBDA for single frequency receiver, couldn’t estimate the integer ambiguity in a little time, sometimes, couldn’t find the exact value. Based on the theory of Rough integer mapping, we get a new algorithm for the estimation of integer ambiguity to solve the problems we meet. Searching algorithm with granularity changing could improve the searching efficiency of the integer ambiguity, and deal with the problem of the GNSS carrier phase measurement in real time nearly.
Connected Component Labeling Techniques on Modern Architectures
Authors: Costantino Grana, Daniele Borghesani, Rita Cucchiara
Venue: Proceedings of the 15th International Conference on Image Analysis and Processing (2009)

In this paper we present an overview of the historical evolution of connected component labeling algorithms, and in particular the ones applied on images stored in raster scan order. This brief survey aims at providing a comprehensive comparison of their performance on modern architectures, since the high availability of memory and the presence of caches make some solutions more suitable and fast. Moreover we propose a new strategy for label propagation based on a 2x2 blocks, which allows to improve the performance of many existing algorithms. The tests are conducted on high resolution images obtained from digitized historical manuscripts and a set of transformations is applied in order to show the algorithms behavior at different image resolutions and with a varying number of labels.
Grain Yield Estimating for Hubei Province Using Remote Sensing Data Take Semilate Rice as an Example
Authors: Junying Sun, Jinliang Huang, Jing Chen, Lihui Wang
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 01 (2009)

Crop yield estimation models using remote sensing data were developed to forecast crop yield for Hubei province. Firstly, simulated counties were chosen using productivity zoning method, and the fluctuated yield was obtained by analyzing history trend. Secondly, the correlation coefficient between fluctuated yield and remote sensing index was calculated. Then, the index with the highest correlation coefficient was selected as key factor to build simple linear regression models to estimate the crop yield. Finally, the error analysis was processed by comparing the actual crop yield from statistic data with that from modeling results. The results indicate that the precision error ranges from -14.38% to 11.31% compared with statistics data, and the coefficient of determination R2 is 0.872.The results calculated by this method meet the accuracy requirements for the crop yield estimation in most part of Hubei province, and can support the decision making of the government and corporations.
CHARACTERIZATION OF MOBILITY IN MANETS: ANALYTICAL MODELS AND PERFORMANCE CONSIDERATION
Authors: Xianren Wu
Venue:  (2009)

We consider the fundamental questions on how nodal mobility affects the behavior and performance of protocol stacks of wireless mobile ad hoc networks (MANETs). In the book, we attempt to investigate all aspects of mobility effects on the network behavior, from link-level, path-level to eventually protocol level. The findings and proposed models could significantly contribute to the design of adaptive routing protocols, better accommodating the dynamic nature of the underlying network and providing reliable services to upper layer. 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
Design of a Filter Based on Polynomial Interpolation and Local Fit
Authors: Xianlin Zeng, Ping Yang, Wu Niu
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 03 (2009)

The drawbacks of commonly used Deslauriers-Dubuc interpolation filter are that the redundancy is large and dual-regularity property is not good. For improving the performance of the interpolation filter, the Deslauriers-Dubuc interpolation filter may be generalized to general interpolation filters. An interpolation filter design method based on local polynomial fit algorithm was presented in this paper. By comparing the differences and relations of the two filters, it is discovered that Deslauriers-Dubuc interpolation filter may be regarded as one special filter of polynomial interpolation and local fit filter. The simulation result of signal denoising show that the filter based on polynomial interpolation and local fit can make better use of the data, and is more robust for denoising.
The Reachability Problem over Infinite Graphs
Authors: Wolfgang Thomas
Venue: Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications (2009)

We survey classical and selected recent work on the reachability problem over finitely presented infinite graphs. The problem has a history of 100 years, and it is central for automatic verification of infinite-state systems. Our focus is on graphs that are presented in terms of word or tree rewriting systems.
Rapid Interactive Installation Development Using Robust Computer Vision and Image-Based Rendering
Authors: Denis Perevalov
Venue: Proceedings of the 8th International Conference on Entertainment Computing (2009)

The paper describes a technique which lets designers implement artistic ideas rapidly into an autonomous interactive art system. The technique consists of two parts: the fixed set of computer vision algorithms and image-based rendering with branching animation sequences.Despite some limitations, the technique provides easy implementation of the wide range of fascinating interactive scenes. 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 Novel Financial Risk Evaluation Model Based on Adaptive Genetic Algorithm
Authors: Junchen Jiang, Ling Zhang, Zhibin Liu
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 02 (2009)

For the particularity of electric power enterprises themselves, the commonly methods used to forecast their financial risk is limited and inadequate. To forecast the financial risk of the power enterprises scientifically and accurately, this paper establishes a financial risk evaluation index system with the camel rating thinking, and then describes the adaptive genetic algorithm (AGA) evaluation mechanism. In this paper, we take the financial risk index data as the network operator samples. The financial risk forecast of 4 power enterprises in National Power Company shows that the improved model is stable and reliable, and this method to forecast the financial risk of the power enterprises is feasible.
Proceedings of the 1st Annual Workshop on Simplifying Complex Network for Practitioners
Venue: Workshop on Simplifying Complex Network for Practitioners (2009)

SIMPLEX is the forum aimed at simplifying network science for practitioners, and particularly for computer communication practitioners. This event focuses on applications of network science relevant for the analysis, the design and the simulation of communication networks and protocols. This year's workshop was held in the beautiful city of Venice, and was co-located with NetSci'09, one of the major network science conferences. Having as a goal to stimulate collaboration between communication networks and network science, the program of SIMPLEX'09 was made not only of technical sessions, but also of several tutorials as well as a panel. The main technical session was made of papers carefully reviewed by at least three members of the Technical Program Committee. Only those papers are published in the ACM Digital Library. The main technical session was followed by tutorials aimed at explaining to the network science community the data available from communication networks and to discuss some methodological issues with the use of such data. Most of the data types available from communication networks were covered by the tutorials: cellular networks, human mobility and wireless networks, as well as fixed networks. After the tutorials, a joint session between SIMPLEX and NetSci was organized in order to let the network science community present their work relevant for SIMPLEX. This joint session was made of short presentations. The papers of the joint session have not been peer-reviewed as the main technical session, hence these papers are not included in the proceedings.
Real-Time Ray Tracing with CUDA
Authors: Min Shih, Yung-Feng Chiu, Ying-Chieh Chen, Chun-Fa Chang
Venue: Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing (2009)

The graphics processors (GPUs) have recently emerged as a low-cost alternative for parallel programming. Since modern GPUs have great computational power as well as high memory bandwidth, running ray tracing on them has been an active field of research in computer graphics in recent years. Furthermore, the introduction of CUDA, a novel GPGPU architecture, has removed several limitations that the traditional GPU-based ray tracing suffered. In this paper, an implementation of high per formance CUDA ray tracing is demonstrated. We focus on the perfor mance and show how our design choices in various optimization lead to an implementation that outperforms the previous works. For reasonably complex scenes with simple shading, our implementation achieves the performance of 30 to 43 million traced rays per second. Our implementation also includes the effects of recursive specular reflection and refraction, which were less discussed in previous GPU-based ray tracing works.
Instruction, Feedback and Biometrics: The User Interface for Fingerprint Authentication Systems
Authors: Chris Riley, Graham Johnson, Heather Mccracken, Ahmed Al-Saffar
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part II (2009)

Biometric authentication is the process of establishing an individual's identity through measurable characteristics of their behaviour, anatomy or physiology. Biometric technologies, such as fingerprint systems, are increasingly being used in a diverse range of contexts from immigration control, to banking and personal computing. As is often the case with emerging technologies, the usability aspects of system design have received less attention than technical aspects. Fingerprint systems pose a number of challenges for users and past research has identified issues with correct finger placement, system feedback and instruction. This paper describes the development of an interface for fingerprint systems using an iterative, participative design approach. During this process, several different methods for the presentation of instruction and feedback were identified. The different types of instruction and feedback were tested in a study involving 82 participants. The results showed that feedback had a statistically significant effect on overall system performance, but instruction did not. The design recommendations emerging from this study, and the use of participatory design in this context, are discussed.
Combination of Vector Quantization and Visualization
Authors: Olga Kurasova, Alma Molytė
Venue: Proceedings of the 6th International Conference on Machine Learning and Data Mining in Pattern Recognition (2009)

In this paper, we present a comparative analysis of a combination of two vector quantization methods (self-organizing map and neural gas), based on a neural network and multidimensional scaling that is used for visualization of codebook vectors obtained by vector quantization methods. The dependence of computing time on the number of neurons, the ratio between the number of neuron-winners and that of all neurons, quantization and mapping qualities, and preserving of a data structure in the mapping image are investigated.
Dynamic, user-centered resolution in interactive stories
Authors: Nikitas M. Sgouros
Venue: Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2 (1997)

One of the most important parts of a story is its ending. This is the point in which all open questions and conflicts in the narrative must be resolved. This paper presents a dynamic resolution method for interactive stories. The type of stories we support allows the user to participate as one of the characters and influence dynamically the development of the plot. The rest of the cast consists of discrete computer characters. Our resolution method takes into account the motives of the user character to decide on: (i) the outcome of all character actions and (ii) the presentation sequence for these outcomes. The decision process is based on the current story context. In addition, it addresses the need to avoid ambiguities, to preserve consistency and to create suspense during the end. We have integrated this method in PEGASUS, an interactive story system set in ancient Greece.
Context Based Wikipedia Linking
Authors: Michael Granitzer, Christin Seifert, Mario Zechner
Venue: Advances in Focused Retrieval: 7th International Workshop of the Initiative for the Evaluation of XML Retrieval, INEX 2008, Dagstuhl Castle, Germany, December 15-18, 2008. Revised and Selected Papers (2009)

Automatically linking Wikipedia pages can be done either content based by exploiting word similarities or structure based by exploiting characteristics of the link graph. Our approach focuses on a content based strategy by detecting Wikipedia titles as link candidates and selecting the most relevant ones as links. The relevance calculation is based on the context, i.e. the surrounding text of a link candidate. Our goal was to evaluate the influence of the link-context on selecting relevant links and determining a links best-entry-point. Results show, that a whole Wikipedia page provides the best context for resolving link and that straight forward inverse document frequency based scoring of anchor texts achieves around 4% less Mean Average Precision on the provided data set.