ppxscal/embedding_network huggingface dataset:
Fragmentation of Numerical Algorithms for the Parallel Subroutines Library
Authors: Victor E. Malyshkin, Sergey B. Sorokin, Ksenia G. Chajuk
Venue: Proceedings of the 10th International Conference on Parallel Computing Technologies (2009)

Fragmentation of the often used numerical algorithms for inclusion into the library of parallel numerical subroutines are considered. Algorithms and programs fragmentation allow to create parallel programs that can be executed on parallel computers of different types (multiprocessors and/or multicomputers) and can be dynamically tuned to all the available resources. Programs' fragmentation is the way of automatic providing of the dynamic properties of parallel programs, like dynamic load balancing. Algorithm's fragmentation is a technological method of numerical algorithms parallelization which provides their effective parallel implementation.
Motion Capture System Using an Optical Resolver
Authors: Takuji Tokiwa, Masashi Yoshidzumi, Hideaki Nii, Maki Sugimoto, Masahiko Inami
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part III: Ubiquitous and Intelligent Interaction (2009)

In this paper, we present a novel position measurement method that makes use of a couple of plane light sources created from an IR-LED matrix array and a photo-detector. The light sources emit light with the same frequency, but different phases, while the optical axes of the sources are set up orthogonally. Then, the signal place is diffused by the space with phase differences in each position. Finally, the signal received by the photo-detector is analyzed to determine the position.
Web User Interface Design Strategy: Designing for Device Independence
Authors: Panagiotis Karampelas, Ioannis Basdekis, Constantine Stephanidis
Venue: Proceedings of the 5th International Conference on Universal Access in Human-Computer Interaction. Addressing Diversity. Part I: Held as Part of HCI International 2009 (2009)

Until recently, Web services were available only through a desktop web browser. Nowadays, methods of access move beyond the desktop computer towards ubiquitous access through portable devices. As a consequence, users have the chance to interact with a growing diversity of computing devices such as PDAs, smart phones, etc., with diverse characteristics that tend to replace conventional laptop and desktop computers. User interface designers, on the other hand, strive to design usable interfaces to cater for the diverse requirements of these devices. The design strategy proposed in this paper aims at assisting user interface designers in designing for diverse devices recommending a specific line of activities in the process of design. A case study of application of the proposed design strategy is presented, outlining its advantages.
Parsing mildly non-projective dependency structures
Authors: Carlos Gómez-Rodríguez, David Weir, John Carroll
Venue: Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics (2009)

We present parsing algorithms for various mildly non-projective dependency formalisms. In particular, algorithms are presented for: all well-nested structures of gap degree at most 1, with the same complexity as the best existing parsers for constituency formalisms of equivalent generative power; all well-nested structures with gap degree bounded by any constant k; and a new class of structures with gap degree up to k that includes some ill-nested structures. The third case includes all the gap degree k structures in a number of dependency treebanks.
An M/G/1 retrial G-queue with preemptive resume and feedback under N-policy subject to the server breakdowns and repairs
Authors: Zaiming Liu, Jinbiao Wu, Gang Yang
Venue: Computers Mathematics with Applications (2009)

An M/G/1 retrial G-queue with preemptive resume and feedback under N-policy vacation subject to the server breakdowns and repairs, is investigated in this paper. Arrivals of both positive customers and negative customers are two independent Poisson processes, and positive customers receive service immediately if the server is free upon their arrivals. Otherwise, they may enter a retrial orbit and try their luck after a random time interval. All positive customers must receive preliminary first phase of service and primary second phase of service. While at the preliminary service, the server may push out the customer undergoing such service to the orbit, to commence preliminary service of an arriving positive customer. Negative customers not only remove the customer being in service, but also make the server under repair. The server leaves for an N-policy vacation as soon as the system empties. By applying the supplementary variables method, we obtain the steady-state solutions for both queueing measures and reliability quantities. The effects of various parameters on the system performance are analyzed numerically.
A Novel Fast Inter-mode Decision Algorithm for H.264/AVC Based on Motion Estimation Residual
Authors: Jie Yang, Yin Chen
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 01 (2009)

This document proposes a fast inter-mode decision method based on the residual of motion estimation for H.264/AVC. There are 7 different MB modes in inter-mode coding with a SKIP mode, as well as 9 modes of 4X4, 8X8 and 4 modes of 16X16 in intra-mode coding for P-slices coding, which brings drastic computational complexity to the encoder. To solve this problem, we suggest a novel fast inter-mode decision method using the variance and SAD of residual block. Our method computes the motion estimation residual block's variance and sum of absolute value (i.e. SAD) to decide the best mode of current MB, and computes residual sub-block’s sum of absolute value to decide sub-MB’s mode. Experimental results show that our method can save 30%-50% encoding time on PC platform without significant PSNR degradation or bitrate increasing.
Effect of Using Automated Auditing Tools on Detecting Compliance Failures in Unmanaged Processes
Authors: Yurdaer Doganata, Francisco Curbera
Venue: Proceedings of the 7th International Conference on Business Process Management (2009)

The effect of using automated auditing tools to detect compliance failures in unmanaged business processes is investigated. In the absence of a process execution engine, compliance of an unmanaged business process is tracked by using an auditing tool developed based on business provenance technology or employing auditors. Since budget constraints limit employing auditors to evaluate all process instances, a methodology is devised to use both expert opinion on a limited set of process instances and the results produced by fallible automated audit machines on all process instances. An improvement factor is defined based on the average number of non-compliant process instances detected and it is shown that the improvement depends on the prevalence of non-compliance in the process as well as the sensitivity and the specificity of the audit machine.
Estimation of Traffic Risk of Level Crossing Based on Stochastic Petri Nets Models and Social Economic Data
Authors: Wei Zheng, J. R. Mueller, R. Slovak, E. Schnieder
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 03 (2009)

This paper focuses on the estimation of trafficrisk of passive level railway crossing based on a formalgraphic model. Traditional analysis and estimationapproaches of traffic risk are based on the aggressivemathematical algorithms. Compared with thesetraditional methods, formal graphic model has bettergraphical interface to users, better modeling flexibility tothe change of system conditions. Following an explanationof application of social statistic data, Stochastic Petri netsare used to model the level railway crossing in respect ofprocess. The inputs and output of this model are bothcalculated from available social statistic data. Road users’behavior, one of the key parameters, is assumed to bepredicted by an approximation function representing thedependence of the behavior from the Gross DomesticProduction (GDP) of their nations. The model is validatedby available social statistic and empirical data. Finallylevel railway crossing traffic risks of different nations areestimated based on the analysis and simulation of thismodel.
An Effectiveness Measure for Ambiguous and Underspecified Queries
Authors: Charles L. Clarke, Maheedhar Kolla, Olga Vechtomova
Venue: Proceedings of the 2nd International Conference on Theory of Information Retrieval: Advances in Information Retrieval Theory (2009)

Building upon simple models of user needs and behavior, we propose a new measure of novelty and diversity for information retrieval evaluation. We combine ideas from three recently proposed effectiveness measures in an attempt to achieve a balance between the complexity of genuine users needs and the simplicity required for feasible evaluation.
The Information Society, Vol. 4, 1st edition
Authors: Robin Mansell
Venue:  (2009)

The information society refers to a constellation of developments arising from the growing use of communication technologies in the acquisition, storage, and processing of information, and the role of information in supporting the creation and exchange of knowledge. Research on information societies really began to take off in the 1970s when Daniel Bell wrote about the information age. While there were earlier works that focused on the growing importance of information in the economy, it was not until the mid-1990s and the spread of the Internet that this field of study experienced a huge expansion across a broad range of disciplines in the social sciences and beyond. A critical mass of scholarship has now accumulated, establishing the information society and information societies as a terrain of substance and complexity, the exploration and understanding of which requires increasingly sophisticated navigation skills. As research in and around the area continues to flourish as never before, this new title in Routledges Major Works series, Critical Concepts in Sociology, meets the need for an authoritative reference work to make sense of a rapidly growing and ever more complex corpus of literature, and to provide a map of the area as it has emerged and developed over the last thirty years or so.The Information Society is fully indexed and has a comprehensive introduction, newly written by the editor, which places the material in its historical and intellectual context. It is an essential work of reference and is destined to be valued by scholars and studentsas well as policy-makers and practitioners in the fieldas a vital one-stop research resource. 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
Control of Flexible Software Development Under Uncertainty
Authors: Michael L. Harris, Rosann Webb Collins, Alan R. Hevner
Venue: Information Systems Research (2009)

When should software development teams have the flexibility to modify their directions and how do we balance that flexibility with controls essential to produce acceptable outcomes? We use dynamic capabilities theory and an extension of control theory to understand these questions. This work is examined in a case study. Our results demonstrate that flexibility may be needed when the starting conditions are uncertain and that effective control in these situations requires use of traditional controls plus a new type of control we term emergent outcome control.
Holonic-Based Environment for Solving Transportation Problems
Authors: Michał Gołacki, Jarosław Koźlak, Małgorzata Żabińska
Venue: Proceedings of the 4th International Conference on Industrial Applications of Holonic and Multi-Agent Systems: Holonic and Multi-Agent Systems for Manufacturing (2009)

In this paper, a system based on the concept of holons for solving transportation problems is presented. Such a system focuses on the possibility of comparing the quality of solutions offered by the system with the results obtained from classical algorithms for commonly used sets of test problems. These problems were modified in order to take into consideration the fundamental features offered by the holonic approach.
A Grid Workflow Process Engine: Architecture and Simulation
Authors: Xu Huibin, Liu Xinran, Zhang Hong
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 01 (2009)

Grid workflow applications are emerging as a more and more important way to manage and process large data sets, and execute scientific experiments on heterogeneous and distributed Grid environment. Therefore, many efforts have been made towards the development of Grid workflow management engine for Grid computing. This paper proposes and simulates a new workflow process engine with hierarchical architecture. Under this architecture the workflow engine receives and processes workflows in a distributed way, but corresponds to users' workflow submission requests and gets concrete task scheduling information centrally. Also, the engine uses a genetic algorithm (GA) based scheduler. Compared to the current engines, it's more flexible, reliable and scalable, and also can generate more efficient solutions for workflows' performance and minimize conflict problems that exist in Grid environment.
BPI-TWIG: XML Twig Query Evaluation
Authors: Neamat El-Tazi, H. V. Jagadish
Venue: Proceedings of the 6th International XML Database Symposium on Database and XML Technologies (2009)

We propose a new algorithm, BPI-TWIG, to evaluate XML twig queries. The algorithm uses a set of novel twig indices to reduce the number of comparisons needed for the twig evaluation and transform the join operation to an intersection operation between the contributing twig paths inside the query. In this paper, we present our technique and experimentally evaluate its performance.
Comparison of network criticality, algebraic connectivity, and other graph metrics
Authors: Alireza Bigdeli, Ali Tizghadam, Alberto Leon-Garcia
Venue: Proceedings of the 1st Annual Workshop on Simplifying Complex Network for Practitioners (2009)

The study of robustness and connectivity properties are important in the analysis of complex networks. This paper reports on an effort to compare different network topologies according to their algebraic connectivity, network criticality, average node degree, and average node betweenness. We consider different network types and study the behavior of these various metrics as scale is increased. Based on extensive simulations, we suggest some guidelines for the design and simplification of networks. The main finding is that, algebraic connectivity, network criticality, average degree, and average node betweenness capture different properties of a graph. Depending on the nature of the problem at hand, one needs to select which one is appropriate to use as the main metric for network analysis.
Intelligent Identification System of Power Quality Disturbance
Authors: Hongzhi Zang, Yishu Zhao
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 01 (2009)

Studies of power quality phenomena have emerged as an important subject in recent years due to renewed interest in improving the quality of the electricity supply. Because the wide application of high-power electronics switchgear, problems of power quality are becoming more serious as each passing day. How to identify power quality disturbances from large number of power signals and how to recognize them automatically are important for further understanding and improving of power quality. In this work, we propose an intelligent system for detection and classification of Power quality disturbance using wavelet transform and multi-lay support vector machines. The proposed technique allows creating such expert systems with the extensible knowledge base, which can be used for identification of power quality disturbances. The simulation result verifies its validity to classify power quality disturbances.
Sparse B-spline polynomial descriptors for human activity recognition
Authors: Antonios Oikonomopoulos, Maja Pantic, Ioannis Patras
Venue: Image and Vision Computing (2009)

The extraction and quantization of local image and video descriptors for the subsequent creation of visual codebooks is a technique that has proved very effective for image and video retrieval applications. In this paper we build on this concept and propose a new set of visual descriptors that provide a local space-time description of the visual activity. The proposed descriptors are extracted at spatiotemporal salient points detected on the estimated optical flow field for a given image sequence and are based on geometrical properties of three-dimensional piecewise polynomials, namely B-splines. The latter are fitted on the spatiotemporal locations of salient points that fall within a given spatiotemporal neighborhood. Our descriptors are invariant in translation and scaling in space-time. The latter is ensured by coupling the neighborhood dimensions to the scale at which the corresponding spatiotemporal salient points are detected. In addition, in order to provide robustness against camera motion (e.g. global translation due to camera panning) we subtract the motion component that is estimated by applying local median filters on the optical flow field. The descriptors that are extracted across the whole dataset are clustered in order to create a codebook of 'visual verbs', where each verb corresponds to a cluster center. We use the resulting codebook in a 'bag of verbs' approach in order to represent the motion of the subjects within small temporal windows. Finally, we use a boosting algorithm in order to select the most discriminative temporal windows of each class and Relevance Vector Machines (RVM) for classification. The presented results using three different databases of human actions verify the effectiveness of our method.
Telecommunications Convergence and Broadband Internetworking Technologies Services for Market Evolution and Competitiveness in Mexico
Authors: Gerardo Chavez
Venue: Proceedings of the 2009 Fourth International Conference on Digital Telecommunications (2009)

The objective of this work is to provide the main elements to support the fact that Mexico has not increased its levels of competitiveness and it neither has equaled to other countries in the region.It is required to implement comprehensive reforms in sectors such as education, infrastructure, healthcare, information technologies and telecommunications, among others. As a result of this analysis, it is concluded that different aspects such as the adjustments needed in regulations, the availability of Broadband Internetworking Technologies (BBINT), the expansion of the Telecommunications Industry (TI) infrastructure, mobile mainly, the promotion mechanisms for innovation and the existence of good and fair conditions for research and development on this BBINT arena are some of the key factors to success on this matter.
Collaborative Filtering Recommendation Algorithm Using Dynamic Similar Neighbor Probability
Authors: Chuangguang Huang, Jian Yin, Jing Wang, Lirong Zheng
Venue: Proceedings of the 5th International Conference on Advanced Data Mining and Applications (2009)

In this paper, we focus on how to overcome several limitations in the traditional research of collaborative filtering(CF). We present a novel CF recommendation algorithm, named DSNP(Dynamic Similar Neighbor Probability). This algorithm improves the neighbors' similarities computations of both users and items to choose the neighbors dynamically as the recommendation sets. How to select the confident subsets which are the most effective neighbors to the target object, it is the first stage. A major innovation is by defining a dynamic neighbor probability over the trustworthy subsets. Moreover, we define a prediction algorithm that combines the advantages of dynamic neighbor coefficient with the user-based CF and the item-based CF algorithms. Experimental results show that the algorithm can achieve consistently better prediction accuracy than traditional CF algorithms, and effectively leverage the result between user-based CF and item-based CF. Furthermore, the algorithm can alleviate the dataset sparsity problem.
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
Authors: Jon Lee, Maxim Sviridenko, Jan Vondrák
Venue: Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (2009)

In this paper, we consider the problem of maximizing a non-negative submodular function f, defined on a (finite) ground set N, subject to matroid constraints. A function $f: 2^N \rightarrow {\mathbb R}$ is submodular if for all S, T ¿ N, f(S ¿ T) + f(S ¿ T) ≤ f(S) + f(T). Furthermore, all submodular functions that we deal with are assumed to be non-negative. Throughout, we assume that our submodular function f is given by a value oracle; i.e., for a given set S ¿ N, an algorithm can query an oracle to find the value f(S). Without loss of generality, we take the ground set N to be [n] = {1,2,...,n}.
Collaboration of Metaheuristic Algorithms through a Multi-Agent System
Authors: Richard Malek
Venue: Proceedings of the 4th International Conference on Industrial Applications of Holonic and Multi-Agent Systems: Holonic and Multi-Agent Systems for Manufacturing (2009)

This paper introduces a framework based on multi-agent system for solving problems of combinatorial optimization. The framework allows running various metaheuristic algorithms simultaneously. By the collaboration of various metaheuristics, we can achieve better results in more classes of problems.
Text categorization from category name via lexical reference
Authors: Libby Barak, Ido Dagan, Eyal Shnarch
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)

Requiring only category names as user input is a highly attractive, yet hardly explored, setting for text categorization. Earlier bootstrapping results relied on similarity in LSA space, which captures rather coarse contextual similarity. We suggest improving this scheme by identifying concrete references to the category name's meaning, obtaining a special variant of lexical expansion.
On the Computation of Correctly-Rounded Sums
Authors: P. Kornerup, V. Lefevre, N. Louvet, J. M. Muller
Venue: Proceedings of the 2009 19th IEEE Symposium on Computer Arithmetic (2009)

This paper presents a study of some basic blocks needed in the design of floating-point summation algorithms. In particular, we show that among the set of the algorithms with no comparisons performing only floating-point additions/subtractions, the 2Sum algorithm introduced by Knuth is minimal, both in terms of number of operations and depth of the dependency graph. Under reasonable conditions, we also prove that no algorithms performing only round-to-nearest additions/subtractions exist to compute the round-to-nearest sum of at least three floating-point numbers. Starting from an algorithm due to Boldo and Melquiond, we also present new results about the computation of the correctly-rounded sum of three floating-point numbers.