ppxscal/embedding_network huggingface dataset:
Manifold integration with Markov random walks
Authors: Heeyoul Choi, Seungjin Choi, Yoonsuck Choe
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 1 (2008)

Most manifold learning methods consider only one similarity matrix to induce a low-dimensional manifold embedded in data space. In practice, however, we often use multiple sensors at a time so that each sensory information yields different similarity matrix derived from the same objects. In such a case, manifold integration is a desirable task, combining these similarity matrices into a compromise matrix that faithfully reflects multiple sensory information. A small number of methods exists for manifold integration, including a method based on reproducing kernel Krein space (RKKS) or DISTATIS, where the former is restricted to the case of only two manifolds and the latter considers a linear combination of normalized similarity matrices as a compromise matrix. In this paper we present a new manifold integration method, Markov random walk on multiple manifolds (RAMS), which integrates transition probabilities defined on each manifold to compute a compromise matrix. Numerical experiments confirm that RAMS finds more informative manifolds with a desirable projection property.
Divide-and-Conquer Strategies for Process Mining
Authors: Josep Carmona, Jordi Cortadella, Michael Kishinevsky
Venue: Proceedings of the 7th International Conference on Business Process Management (2009)

The goal of Process Mining is to extract process models from logs of a system. Among the possible models to represent a process, Petri nets is an ideal candidate due to its graphical representation, clear semantics and expressive power. The theory of regions can be used to transform a log into a Petri net, but unfortunately the transformation requires algorithms with high complexity. This paper provides techniques to overcome this limitation. Either by using decomposition techniques, or by clustering events in the log and working on projections, the proposed approach can be used to widen the applicability of classical region-based techniques.
Fast Trilateral Filtering
Authors: Tobi Vaudrey, Reinhard Klette
Venue: Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns (2009)

This paper compares the original implementation of the trilateral filter with two proposed speed improvements. One is using simple look-up-tables, and leads to exactly the same results as the original filter. The other technique is using a novel way of truncating the look-up-table (LUT) to a user specified required accuracy. Here, results differ from those of the original filter, but to a very minor extent. The paper shows that measured speed improvements of this second technique are in the order of several magnitudes, compared to the original or LUT trilateral filter. 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
Studying the history of ideas using topic models
Authors: David Hall, Daniel Jurafsky, Christopher D. Manning
Venue: Proceedings of the Conference on Empirical Methods in Natural Language Processing (2008)

How can the development of ideas in a scientific field be studied over time? We apply unsupervised topic modeling to the ACL Anthology to analyze historical trends in the field of Computational Linguistics from 1978 to 2006. We induce topic clusters using Latent Dirichlet Allocation, and examine the strength of each topic over time. Our methods find trends in the field including the rise of probabilistic methods starting in 1988, a steady increase in applications, and a sharp decline of research in semantics and understanding between 1978 and 2001, possibly rising again after 2001. We also introduce a model of the diversity of ideas, topic entropy, using it to show that COLING is a more diverse conference than ACL, but that both conferences as well as EMNLP are becoming broader over time. Finally, we apply Jensen-Shannon divergence of topic distributions to show that all three conferences are converging in the topics they cover.
An integer programming approach for linear programs with probabilistic constraints
Authors: James Luedtke, Shabbir Ahmed, George L. Nemhauser
Venue: Mathematical Programming: Series A and B (2009)

Linear programs with joint probabilistic constraints (PCLP) are difficult to solve because the feasible region is not convex. We consider a special case of PCLP in which only the right-hand side is random and this random vector has a finite distribution. We give a mixed-integer programming formulation for this special case and study the relaxation corresponding to a single row of the probabilistic constraint. We obtain two strengthened formulations. As a byproduct of this analysis, we obtain new results for the previously studied mixing set, subject to an additional knapsack inequality. We present computational results which indicate that by using our strengthened formulations, instances that are considerably larger than have been considered before can be solved to optimality.
Information and communication technologies: an enhancing instrument of social inclusion: the case of Patagonia Austral
Venue: Proceedings of the 2008 Euro American Conference on Telematics and Information Systems (2008)

En los &uacute;ltimos a&ntilde;os, la comunidad internacional reconoce la importancia de favorecer el acceso y uso de las TIC como factor de desarrollo. Una de las iniciativas m&aacute;s importantes en este sentido, fue la Cumbre Mundial sobre la Sociedad de la Informaci&oacute;n (CMSI), celebrada en dos fases. La primera de ellas, en Ginebra en el a&ntilde;o 2003, y la segunda en T&uacute;nez en el a&ntilde;o 2005.
Improving the Accuracy of a Score Fusion Approach Based on Likelihood Ratio in Multimodal Biometric Systems
Authors: Emanuela Marasco, Carlo Sansone
Venue: Proceedings of the 15th International Conference on Image Analysis and Processing (2009)

Multimodal biometric systems integrate information from multiple sources to improve the performance of a typical unimodal biometric system. Among the possible information fusion approaches, those based on fusion of match scores are the most commonly used. Recently, a framework for the optimal combination of match scores that is based on the likelihood ratio (LR) test has been presented. It is based on the modeling of the distributions of genuine and impostor match scores as a finite Gaussian mixture models. In this paper, we propose two strategies for improving the performance of the LR test. The first one employs a voting strategy to circumvent the need of huge datasets for training, while the second one uses a sequential test to improve the classification accuracy on genuine users.Experiments on the NIST multimodal database confirmed that the proposed strategies can outperform the standard LR test, especially when there is the need of realizing a multibiometric system that must accept no impostors.
Approximation techniques for response-time analysis of static-priority tasks
Authors: Thi Huyen Nguyen, Pascal Richard, Enrico Bini
Venue: Real-Time Systems (2009)

We consider sporadic tasks with static priorities and constrained deadlines to be executed upon a uniprocessor platform. Pseudo-polynomial time algorithms are known for computing worst-case response times for this task model. Some applications require to evaluate efficiently upper bounds of response times. For this purpose, we propose parametric algorithms that allow to make a tradeoff between quality of results and computational effort according to an input accuracy parameter. In this paper, we present a parametric polynomial-time algorithm for computing upper bounds of worst-case response times, that is based on an improved fptas (Fully Polynomial Time Approximation Scheme). Then, we show that our bound does not achieve constant error bound in comparison with the exact worst-case response time. However, using the resource augmentation technique, we obtain a performance guarantee that allows to define a compromise between our response-time bound and processor capacity requirements. The algorithm average behavior is then analyzed through numerical experimentations.
A Two-stage Approach for Estimating Jump-diffusion Model with Application to Daily Returns of USD/CNY Exchange Rates
Authors: Ruicheng Yang, Yingying Zhou
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 01 (2009)

The time series of daily returns of USD/CNY exchange rates suggest that there exists a leptokurtic feature (higher peak and fat tail) that results from some occasional jumps. So, we introduce the jump-diffusion model to describe the time series of daily returns. Since the traditional parameter estimation method, for example, MLE, can hardly detect the jumps exactly, then, we combine the jump detection method proposed by Lee and Mykland into the MLE method, formulate the two-stage approach for estimating the jump-diffusion model. Based on this, we further do some empirical results for daily returns of USD/CNY exchange rates, derive that the two-stage approach can fit the real data relatively better.
Demo abstract: A Trusted Platform based framework for participatory sensing
Authors: Akshay Dua, Wen Hu, Nirupama Bulusu
Venue: Proceedings of the 2009 International Conference on Information Processing in Sensor Networks (2009)

“Participatory sensing” is an exciting new paradigm where people voluntarily sense their local environment and share this data using mobile phones and the Internet. It can revolutionize applications such as intelligent transportation, public health and social networking. However, a major concern is the amount of trust that can be placed in the shared data. We address this concern in our demonstration by using a Trusted Platform Module (TPM) in conjunction with a smart phone. The TPM is responsible for attesting the application on the phone to assure remote entities that the application has not been tampered with. To the best of our knowledge, this is the first demonstration of application attestation on a smart phone employing a TPM.
Evaluation on the Reforming Performance of RMB Exchange Rate Based on the Flexibility of Exchange Rate
Authors: Xianyong Zheng, Hanmin Huang
Venue: Proceedings of the 2009 IITA International Conference on Services Science, Management and Engineering (2009)

According to the perspective of policy flexibility, this paper analyzes the impact of exchange rate fluctuation on the exporting under two different exchange rate systems via related theories and compares the reforming performances after two exchange rate reform that occurred in 1994 and 1995 separately. As the empirical results shows, the exchange rate of pegging “a package of currencies”, which should be steadily proposed in China, have a more flexible formation and transmission mechanism.
Research and Implementation of Compression Shell Unpacking Technology for PE File
Authors: Li Lu, Liu Qiuju, Xu Tingrong
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 01 (2009)

Packing Portable Executable (PE) file is an effective mean to protect software, but malware authors can also use packing to conceal their malicious executable string data and code. These methods make it difficult to analyze them in detail for virus analyst and software security researcher. They have to unpack the malware first. This paper illustrated the general unpacking methods and principles, using the notepad program in windows as an instance. Firstly analyzed the PE file structure and the principle of packing, and then expounded the steps of unpacking, finally, from the compression shell's point of view, focused on the principles and methods of unpacking technology.
Layout-aware limiarization for readability enhancement of degraded historical documents
Authors: Flávio Bertholdo, Eduardo Valle, Arnaldo de A. Araújo
Venue: Proceedings of the 9th ACM symposium on Document engineering (2009)

In this paper we propose a technique of limiarization (also known as thresholding or binarization) tailored to improve the readability of degraded historical documents. Limiarization is a simple image processing technique, which is employed in many complex tasks like image compression, object segmentation and character recognition. The technique also finds applications on itself: since it results in a high-contrast image, in which the foreground is clearly separated from the background, it can greatly improve the readability of a document, provided that other attributes (like character shape) do not suffer. Our technique exploits statistical characteristics of textual documents and applies both global and local thresholding. Under visual inspection on experiments made in a collection of severely degraded historical documents, it compares favorably with the state of the art.
An investigation of the option space in conceptual building design for advanced building simulation
Authors: Christian Struck, Pieter J. C. J. de Wilde, Christina J. Hopfe, Jan L. M. Hensen
Venue: Advanced Engineering Informatics (2009)

This article describes research conducted to gather empirical evidence on size, character and content of the option space in building design projects. This option space is the key starting point for the work of any climate engineer using building performance simulation who is supporting the design process. The underlying goal is to strengthen the role of advanced computing in building design, especially in the early conceptual stage, through a better integration of building performance simulation tools augmented with uncertainty analysis and sensitivity analysis. Better integration will need to assist design rather than automate design, allowing a spontaneous, creative and flexible process that acknowledges the expertise of the design team members. This research investigates and contrasts emergent option spaces and their inherent uncertainties in an artificial setting (student design studios) and in real-life scenarios (commercial design project case studies). The findings provide empirical evidence of the high variability of the option space that can be subjected to uncertainty analysis and sensitivity analysis.
Learning-based named entity recognition for morphologically-rich, resource-scarce languages
Authors: Kazi Saidul Hasan, Altaf ur Rahman, Vincent Ng
Venue: Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics (2009)

Named entity recognition for morphologically rich, case-insensitive languages, including the majority of semitic languages, Iranian languages, and Indian languages, is inherently more difficult than its English counterpart. Worse still, progress on machine learning approaches to named entity recognition for many of these languages is currently hampered by the scarcity of annotated data and the lack of an accurate part-of-speech tagger. While it is possible to rely on manually-constructed gazetteers to combat data scarcity, this gazetteer-centric approach has the potential weakness of creating irreproducible results, since these name lists are not publicly available in general. Motivated in part by this concern, we present a learning-based named entity recognizer that does not rely on manually-constructed gazetteers, using Bengali as our representative resource-scarce, morphologically-rich language. Our recognizer achieves a relative improvement of 7.5% in F-measure over a baseline recognizer. Improvements arise from (1) using induced affixes, (2) extracting information from online lexical databases, and (3) jointly modeling part-of-speech tagging and named entity recognition.
Assessing the lifetime performance index of products with the exponential distribution under progressively type II right censored samples
Authors: Wen-Chuan Lee, Jong-Wuu Wu, Ching-Wen Hong
Venue: Journal of Computational and Applied Mathematics (2009)

In practice, lifetime performance index C"L is used to measure the potential and performance of a process, where L is the lower specification limit. Progressive censoring scheme is quite useful in many practical situations where budget constraints are in place or there is a demand for rapid testing. In this paper, under the assumption of exponential distribution, this study constructs a maximum likelihood estimator (MLE) of C"L based on the progressively type II right censored sample. The MLE of C"L is then utilized to develop the hypothesis testing procedure in the condition of known L. The new testing procedure can be employed by product managers to assess whether the lifetime of products (or items) adheres to the required level in the condition of known L. Finally, we give one example to illustrate the use of the testing algorithmic procedure under given significance level.
Global Minimization of the Projective Nonnegative Matrix Factorization
Authors: Zhijian Yuan
Venue: Advances in Neuro-Information Processing: 15th International Conference, ICONIP 2008, Auckland, New Zealand, November 25-28, 2008, Revised Selected Papers, Part II (2009)

The Nonnegative Matrix Factorization (NMF) is a widely used method in approximating high dimensional data. All the NMF type methods find only the local minimizers. In this paper, we use filled function method to find the global minimizer of the Projective Nonnegative Matrix Factorization optimal problem.
Influence of Sheet Material Characteristics on the Torsional Free Vibration of Single Lap-Jointed Cantilevered SPR Joints
Authors: Xiaocong He
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 01 (2009)

The free torsional vibration characteristics of single lap-jointed cantilevered SPR beams are investigated theoretically in this paper using the three dimensional finite element method (FEM). Numerical examples are provided to show the influence on the natural frequencies and natural frequency ratios of these beams caused by variations in the material properties of the sheet materials. It is shown that the torsional natural frequencies of single lap jointed cantilevered SPR beams increases significantly as the Young’s modulus of the sheet materials increases, but only slight changes are encountered for variations of Poisson’s ratio. It is also found that the material densities of the sheets have significant effects on the free torsional vibration characteristics of the beams.
Modeling and Simulation of Multi-legged Walking Machine Prototype
Authors: Gang Wang, Lixun Zhang, Dongliang Chen, Defeng Liu, Xi Chen
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 02 (2009)

In this paper, a scheme of multi-legged walking machine is put forward accordingly. The mechanical design of the legs and freedom arrangement of the eight legs have been assembled according to the bionics. Based on biologically inspired, we set freedom by abstracting walking leg structure of a crab. Also this design proved that the robot can overturn itself when it was overturned by surf or by other things. In this paper, single leg trajectory planning problem is discussed deeply through presenting the trajectory planning algorithm of polynomial approximation and the kinematics and dynamics of multi-legged robot is simulated using ADAMS.
The Effect of Open Market Repurchase on Company's Value
Authors: Xu Fengju, Wang Feng
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 03 (2009)

This paper investigated on the nine listed Companies in Shanghai and Shenzhen stock markets that implemented the Open Market Repurchase program OMR. In this research, the event study method is employed to analyze the effect of the OMR on the Companies' value. At last the paper found the rule of effect of OMR on listed company's value and indicated that the effect needs a long-term process of gradual release. The result of this paper is very valuable and provides a new perspective for the decision-making of share repurchase to the Chinese listed companies.
Resource Allocation Optimization for GSD Projects
Authors: Supraja Doma, Larry Gottschalk, Tetsutaro Uehara, Jigang Liu
Venue: Proceedings of the International Conference on Computational Science and Its Applications: Part II (2009)

As globalization has become main phenomena in software development in the US since the year 2000, many software projects have been shipped out to other countries. Although the off-sourcing saves companies a significant amount of cost, Global Software Development (GSD) projects have created a significant challenge to the companies in terms of difference in geographical locations, time zones, and cultures. While 24-hour development model sounds to reduce the time and then the cost of software development, the expected outcome cannot be ensured if the tasks are not allocated to the proper resources in remote teams with considerations of the dependencies and constraints. In this paper, we propose an approach that can be used to reduce the overall time of GSD project development by allocating the tasks to the best possible resources based on an integrated analysis of the constraints and their impact on the overall product development.
Formal Reasoning about Concurrent Assembly Code with Reentrant Locks
Authors: Ming Fu, Yu Zhang, Yong Li
Venue: Proceedings of the 2009 Third IEEE International Symposium on Theoretical Aspects of Software Engineering (2009)

This paper focuses on the problem of reasoning about concurrent assembly code with reentrant locks. Our verification technique is based on concurrent separation logic (CSL). In CSL, locks are treated as non-reentrant locks and each lock is associated with a resource invariant, the lock-protected resources are obtained and released through acquiring and releasing the lock respectively. In order to accommodate for reentrancy, we introduce some additional notions into our specification language to describe reentrant level for each acquiring and releasing lock operation. Keeping track of the reentrant level for each lock in the pre- and post- conditions enables the program logic to ensure that resources are not reacquired upon reentrancy, thus resources owned by a thread are prevented from reintroducing in the postcondition. Our framework is fully mechanized. Its soundness has been verified using the Coq proof assistant. We demonstrate the usage of our framework through giving a safety proof of a simple program.
Flexible coordinator design for modeling resource sharing in multi-agent systems
Authors: Jiexin Lian, Sol M. Shatz, Xudong He
Venue: Journal of Systems and Software (2009)

One approach to modeling multi-agent systems (MASs) is to employ a method that defines components which describe the local behavior of individual agents, as well as a special component, called a coordinator. The coordinator component coordinates the resource sharing behavior among the agents. The agent models define a set of local plans, and the combination of local plans and a coordinator defines a system's global plan. Although earlier work has provided the base functionality needed to synthesize inter-agent resource sharing behavior for a global, conflict-free MAS environment, the lack of coordination flexibility limits the modeling capability at both the local plan level and the global plan level. In this paper, we describe a flexible design method that supports a range of coordinator components. The method defines four levels of coordination and an associated four-step coordinator generation process, which allows for the design of coordinators with increasing capabilities for handling complexity associated with resource coordination. Colored Petri net based simulation is used to analyze various properties that derive from different coordinators and synthesis of a reduced coordinator component is discussed for cases that involve homogeneous agents.