ppxscal/embedding_network huggingface dataset:
Study for Setting up the Decision-Support System Based on KW, MW and DW
Authors: Zhou Xiao-qing
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 01 (2009)

This paper discusses a new decision-support system that integrates data warehouse, knowledge warehouse and model warehouse. Contrast to the fixed model of the old decision-support system and it’s limited application, the new system can overcome the shortcoming of the old system efficiently, and also it can simplify model-obtaining and coding. So the new system strengthens the effectiveness, intelligence and efficiency of the decision.
A Multipath Fault-Tolerant Routing Method for High-Speed Interconnection Networks
Authors: Gonzalo Zarza, Diego Lugones, Daniel Franco, Emilio Luque
Venue: Proceedings of the 15th International Euro-Par Conference on Parallel Processing (2009)

The intensive and continuous use of high-performance computers for executing computationally intensive applications, coupled with the large number of elements that make them up, dramatically increase the likelihood of failures during their operation.The interconnection network is a critical part of high-performance computer systems that communicates and links together the processing units. Network faults have an extremely high impact because the occurrence of a single fault may prevent the correct finalization of applications.This work focuses on the problem of fault tolerance for high-speed interconnection networks by designing a fault tolerant routing method. The goal is to solve a certain number of link and node failures, considering its impact, and occurrence probability. To accomplish this task we take advantage of communication path redundancy, by means of adaptive multipath routing approaches that fulfill the four phases of fault tolerance: error detection, damage confinement, error recovery, fault treatment and continuous service. Experiments show that our method allows applications to successfully finalize their execution in the presence of several number of faults, with an average performance value of 97% with respect to the fault-free scenarios.
Development of an Evaluation Method for Office Work Productivity
Authors: Kazune Miyagi, Hiroshi Shimoda, Hirotake Ishii, Kenji Enomoto, Mikio Iwakawa, Masaaki Terano
Venue: Proceedings of the 8th International Conference on Engineering Psychology and Cognitive Ergonomics: Held as Part of HCI International 2009 (2009)

The authors have developed a performance test, CPTOP2 (Cognitive Performance Test of Productivity), which consists of four task tests to evaluate cognitive abilities of office workers in order to quantitatively and objectively evaluate their productivity by controlling office environment. In addition, the testing time of CPTOP2 becomes shorter than conventional CPTOP2 in order to introduce it in evaluation of actual office environment. In this study, two subject experiments were conducted to verify its function and accuracy. The function of CPTOP2 was verified by measuring brain activity by fNIRS when conducting CPTOP2 test. The accuracy of CPTOP2 was verified by comparing improvement of performance indexes of CPTOP2 with that of simulated office work.
Region merging with topological control
Authors: Alexandre Dupas, Guillaume Damiand
Venue: Discrete Applied Mathematics (2009)

This paper presents a region merging process controlled by topological features on regions in three-dimensional (3D) images. Betti numbers, a well-known topological invariant, are used as criteria. Classical and incremental algorithms to compute the Betti numbers using information represented by the topological map of an image are provided. The region merging algorithm, which merges any number of connected components of regions together, is explained. A topological control of the merging process is implemented using Betti numbers to control the topology of an evolving 3D image partition. The interest in incremental approaches of the computation of Betti numbers is established by providing a processing time comparison. A visual example showing the result of the algorithm and the impact of topological control is also given.
From the Editor...
Authors: L. Robin Keller
Venue: Decision Analysis (2009)

Our first two articles address resource allocation, across risky projects and across budget allocations over time. First, Philip Bromiley demonstrates numerically that the interaction between cumulative prospect theory parameters rules out the ability to make simple general predictions of resource allocation choices in “A Prospect Theory Model of Resource Allocation.” Our second article, by Pekka Mild and Ahti Salo, on “Combining a Multiattribute Value Function with an Optimization Model: An Application to Dynamic Resource Allocation for Infrastructure Maintenance,” reports a generic model for allocating maintenance budgets over time that was originally developed for the Finnish Road Administration. Our third article, by Jesus Rios and David Rios Insua, develops a method for “Supporting Negotiations over Influence Diagrams,” for when there is disagreement about utilities and probabilities. Fourth, Ben Ewing and Erin Baker present their work on the “Development of a Green Building Decision Support Tool: A Collaborative Process.” In our final article, “On the Decision to Take a Pitch,” J. Eric Bickel analyzes a common decision in baseball, contributing to the area of sports decision analysis.
Generating clausal coordinate ellipsis multilingually: a uniform approach based on postediting
Authors: Karin Harbusch, Gerard Kempen
Venue: Proceedings of the 12th European Workshop on Natural Language Generation (2009)

Present-day sentence generators are often incapable of producing a wide variety of well-formed elliptical versions of coordinated clauses, in particular, of combined elliptical phenomena (Gapping, Forward and Backward Conjunction Reduction, etc.). The applicability of the various types of clausal coordinate ellipsis (CCE) presupposes detailed comparisons of the syntactic properties of the coordinated clauses. These nonlocal comparisons argue against approaches based on local rules that treat CCE structures as special cases of clausal coordination. We advocate an alternative approach where CCE rules take the form of postediting rules applicable to nonelliptical structures. The advantage is not only a higher level of modularity but also applicability to languages belonging to different language families. We describe a language-neutral module (called Elleipo; implemented in JAVA) that generates as output all major CCE versions of coordinated clauses. Elleipo takes as input linearly ordered nonelliptical coordinated clauses annotated with lexical identity and coreferentiality relationships between words and word groups in the conjuncts. We demonstrate the feasibility of a single set of postediting rules that attains multilingual coverage.
Accelerating Image Retrieval Using Factorial Correspondence Analysis on GPU
Authors: Nguyen-Khang Pham, Annie Morin, Patrick Gros
Venue: Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns (2009)

We are interested in the intensive use of Factorial Correspondence Analysis (FCA) for large-scale content-based image retrieval. Factorial Correspondence Analysis, is a useful method for analyzing textual data, and we adapt it to images using the SIFT local descriptors. FCA is used to reduce dimensions and to limit the number of images to be considered during the search. Graphics Processing Units (GPU) are fast emerging as inexpensive parallel processors due to their high computation power and low price. The G80 family of Nvidia GPUs provides the CUDA programming model that treats the GPU as a SIMD processor array. We present two very fast algorithms on GPU for image retrieval using FCA: the first one is a parallel incremental algorithm for FCA and the second one is an extension of the filtering algorithm in our previous work for filtering step.Our implementation is able to scale up the FCA computation a factor of 30 compared to the CPU version. For retrieval tasks, the parallel version on GPU performs 10 times faster than the one on CPU. Retrieving images in a database of 1 million images is done in about 8 milliseconds.
Test Case Generation from UML Subactivity and Activity Diagram
Authors: Xin Fan, Jian Shu, LinLan Liu, QiJun Liang
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 02 (2009)

UML activity diagram is suitable for modeling parallel and concurrent flows in an actual system. It is also significant for software testing. The subactivity state in activity diagram divides the activity diagram into two kinds: the atomic activity diagram and compound activity diagram, who constructs the hierarchy of the whole activity diagram. Dealing with the compound activity diagram is a key issue during test case generation. This paper proposes a method for generating test case from subactivity diagram to compound activity diagram hierarchically and introduces the idea of this method by taking the thought of functional decomposition, bottom-up integration testing strategy and round-robin strategy. The experimental result shows that the proposed approach can generate less test cases than the method taking complete combination strategy and have a good coverage as well.
Stack Filter Classifiers
Authors: Reid Porter, G. Beate Zimmer, Don Hush
Venue: Proceedings of the 9th International Symposium on Mathematical Morphology and Its Application to Signal and Image Processing (2009)

Stack Filters define a large class of increasing filter that is used used widely in image and signal processing. The motivations for using an increasing filter instead of an unconstrained filter have been described as: 1) fast and efficient implementation, 2) the relationship to mathematical morphology and 3) more precise estimation with finite sample data. This last motivation is related to methods developed in machine learning and the relationship was explored in [1]. In this paper we investigate this relationship by applying Stack Filters directly to classification problems. This provides a new perspective on how monotonicity constraints can help control estimation errors, and also suggests new learning algorithms for Boolean function classifiers when they are applied to real-valued inputs.
K-best suffix arrays
Authors: Kenneth Church, Bo Thiesson, Robert Ragno
Venue: Human Language Technologies 2007: The Conference of the North American Chapter of the Association for Computational Linguistics; Companion Volume, Short Papers on XX (2007)

Suppose we have a large dictionary of strings. Each entry starts with a figure of merit (popularity). We wish to find the k-best matches for a substring, s, in a dictinoary, dict. That is, grep s dict | sort -n | head -k, but we would like to do this in sublinear time. Example applications: (1) web queries with popularities, (2) products with prices and (3) ads with click through rates. This paper proposes a novel index, k-best suffix arrays, based on ideas borrowed from suffix arrays and kdtrees. A standard suffix array sorts the suffixes by a single order (lexicographic) whereas k-best suffix arrays are sorted by two orders (lexicographic and popularity). Lookup time is between log N and sqrt N.
A Novel Approach to Knowledge Sharing in Software Systems Engineering
Authors: Sarah B. Lee, Sajjan G. Shiva
Venue: Proceedings of the 2009 Fourth IEEE International Conference on Global Software Engineering (2009)

There are many stakeholders in the information technology (IT) domain, including the business community and software development and support staff. A high degree of collaboration and knowledge sharing is required to take a system from business concept to production implementation in complex organizations where numerous teams are involved in the software engineering process. Much of historical knowledge management strategy has a technology focus with knowledge collected, organized, and disseminated with a push or pull approach. An approach that considers common technology implementations, such as intranets, document management systems, and email, and how those can be exploited with little or no introduction of new processes or tools to promote knowledge sharing is suggested. Human and social aspects are considered fundamental to the success of a solution that leverages current technology implementations and capitalizes on the relationships that exist and are created among individuals in the context of software engineering work.
Two-machine flow shop problem with effects of deterioration and learning
Authors: Ji-Bo Wang, Li-Li Liu
Venue: Computers and Industrial Engineering (2009)

In this paper we consider a two-machine flow shop scheduling problem with effects of deterioration and learning. By the effects of deterioration and learning, we mean that the processing time of a job is a function of its execution starting time and its position in a sequence. The objective is to find a sequence that minimizes the total completion time. Optimal solutions are obtained for some special cases. For the general case, several dominance properties and some lower bounds are derived, which are used to speed up the elimination process of a branch-and-bound algorithm. A heuristic algorithm is also proposed, which is shown by computational experiments to perform effectively and efficiently in obtaining near-optimal solutions.
Culture & biometrics: regional differences in the perception of biometric authentication technologies
Authors: Chris Riley, Kathy Buckner, Graham Johnson, David Benyon
Venue: AI Society (2009)

Previous research has identified user concerns about biometric authentication technology, but most of this research has been conducted in European contexts. There is a lack of research that has investigated attitudes towards biometric technology in other cultures. To address this issue, data from India, South Africa and the United Kingdom were collected and compared. Cross-cultural attitudinal differences were seen, with Indian respondents viewing biometrics most positively while respondents from the United Kingdom were the least likely to have a positive opinion about biometrics. Multiple barriers to the acceptance of biometric technology were identified with data security and health and safety fears having the greatest overall impact on respondents&#x2019; attitudes towards biometrics. The results of this investigation are discussed with reference to Hofstede&#x2019;s cultural dimensions and theories of technology acceptance. It is argued that contextual issues specific to each country provide a better explanation of the results than existing theories based on Hofstede&#x2019;s model. We conclude that cultural differences have an impact on the way biometric systems will be used and argue that these factors should be taken into account during the design and implementation of biometric systems.
Digital Signature Scheme Based on the Inverse Bilinear Pairing Operation Problem
Authors: Xin Xiangjun, Shi Hailiang
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 02 (2009)

First, based on the bilinear pairings, a new computing problem, Inverse Bilinear Paring Operation Problem (IBPOP), is proposed, which is proved to be not easier than the computing Diffie-Hellman problem (CDHP) and not harder than discrete logarithm problem (DLP). So, if the symbol “≤” denotes the increase of the hardness of computing problem, it can be deduced that CDHP≤IBPOP≤DLP. Then, based on the hardness assumption of IBPOP, by using the bilinear pairing, a certificate-based and randomized signature scheme is proposed. Under the hardness assumption of IBPOP, the signature scheme can be proved to be secure in random oracle. On the other hand, the security of most of the known pairing-based signature schemes depends on the hardness assumption of CDHP, which is a stronger assumption than the new scheme. The new signature is an efficient pairing-based one, since there is only one operation of pairings in it.
On the stability of boundary conditions for molecular dynamics
Authors: Xiantao Li
Venue: Journal of Computational and Applied Mathematics (2009)

We study the stability of boundary conditions for molecular dynamics simulations. A general stability criterion is established. We first consider a one-dimensional model with nearest neighbor interaction and multiple-neighbor interactions. We then generalize the results to more realistic models in 3D with nonlinear atomic interaction.
Optimal and Near-Optimal Energy-Efficient Broadcasting in Wireless Networks
Authors: Christos A. Papageorgiou, Panagiotis C. Kokkinos, Emmanouel A. Varvarigos
Venue: Proceedings of the 15th International Euro-Par Conference on Parallel Processing (2009)

In this paper we propose an energy-efficient broadcast algorithm for wireless networks for the case where the transmission powers of the nodes are fixed. Our algorithm is based on the multicost approach and selects an optimal energy-efficient set of nodes for broadcasting, taking into account: i) the node residual energies, ii) the transmission powers used by the nodes, and iii) the set of nodes that are covered by a specific schedule. Our algorithm is optimal, in the sense that it can optimize any desired function of the total power consumed by the broadcasting task and the minimum of the current residual energies of the nodes, provided that the optimization function is monotonic in each of these parameters. Our algorithm has non-polynomial complexity, thus, we propose a relaxation producing a near-optimal solution in polynomial time. Using simulations we show that the proposed algorithms outperform other established solutions for energy-aware broadcasting with respect to both energy consumption and network lifetime. Moreover, it is shown that the near-optimal multicost algorithm obtains most of the performance benefits of the optimal multicost algorithm at a smaller computational overhead.
The Berkeley Tricorder: Ambulatory Health Monitoring
Authors: Reza Naima, John Canny
Venue: Proceedings of the 2009 Sixth International Workshop on Wearable and Implantable Body Sensor Networks (2009)

We developed and tested the Berkeley Tricorder, a health monitoring device capable of measuring a subject's ECG, EMG, Blood Oxygenation, Respiration (via Bioimpedance), and motion--almost equivalent to the feature set of a hospital bedside patient monitor. Our focus has been a highly integrated design incorporating the radio and all associated circuitry on a single PCB. The device stores data locally on microSD flash and/or transmits via Bluetooth.We will also discuss a strap we have developed which utilizes reusable electrodes for data acquisition as well as a desktop and mobile application for real-time data telemetry. We have evaluated the efficacy of the device in recording ambulatory data from 24 subjects and found the data acquisition relatively free of motion artifacts.
Colorimetric and Photometric Compensation for Optical See-Through Displays
Authors: Christian Weiland, Anne-Kathrin Braun, Wolfgang Heiden
Venue: Proceedings of the 5th International on ConferenceUniversal Access in Human-Computer Interaction. Part II: Intelligent and Ubiquitous Interaction Environments (2009)

Optical see-through displays are an established technology within augmented reality. Wearing such a display the users eyes automatically adapt to the luminance of the real world environment, while the virtual part is displayed using a steadybrightness. This often results in clear differences between real and virtual elements. This paper shows a technique for colorimetric compensation which avoids this effect. Furthermore algorithms for photometric compensation will be demonstrated. The appearance of background shapes and colours arise from the combination of the luminance of the background and the projected luminance of the object. These "ghosts" are photometrically compensated.
Camera Resectioning from a Box
Authors: Henrik Aanæs, Klas Josephson, François Anton, Jakob Andreas Bærentzen, Fredrik Kahl
Venue: Proceedings of the 16th Scandinavian Conference on Image Analysis (2009)

In this paper we describe how we can do camera resectioning from a box with unknown dimensions, i.e. determine the camera model, assuming that image pixels are square. This assumption is equivalent to assuming that the camera has an aspect ratio of one and zero skew, and this holds for most -- if not all -- digital cameras. Our proposed method works by first deriving 9 linear constraints on the projective camera matrix from the box, leaving a 3-dimensional subspace in which the projective camera matrix can lie. A single solution in this 3D subspace is then found via a method by Triggs in 1999, which uses the square pixel assumption to set up a 4th degree polynomial to which the solution is the desired model. This approach is, however, numerically challenging, and we use several means to tackle this issue. Lastly the solution is refined in an iterative manner, i.e. using bundle adjustment.
Using Linkability Information to Attack Mix-Based Anonymity Services
Authors: Stefan Schiffner, Sebastian Clauß
Venue: Proceedings of the 9th International Symposium on Privacy Enhancing Technologies (2009)

There exist well established models for anonymity focusing on traffic analysis, i. e., analysing properties of single messages as, e. g., timing. However there is only little work done that use linkability information, that is information about the probability that two messages have been sent by the same sender.In this paper we model information about linkability between messages as a weighted graph. We show lower and upper bounds with regards to the usefulness of linkability information for matching messages to senders. In addition to that we present simulation results, showing to which extent a matching of messages to senders is possible by using linkability information with different grades of noise.
Parallelization of Temperature Distribution Simulations for Semiconductor and Polymer Composite Material on Distributed Memory Architecture
Authors: Norma Alias, Roziha Darwis, Noriza Satam, Mohamed Othman
Venue: Proceedings of the 10th International Conference on Parallel Computing Technologies (2009)

The implementations of parallel algorithms in solving partial differential equations (PDEs) for heat transfer problems are based on the high performance computing using distributed memory architecture. In this paper, the parallel algorithms are exploited finite difference method in solving multidimensional heat transfer problem for semiconductor components and polymer composite materials. Parallel Virtual Machine (PVM) and C language based on Linux operating system are the platform to run the parallel algorithms. This research focused on Red-Black Gauss Seidel (RBGS) iterative method. Parallel performance evaluations in terms of speedup, efficiency, effectiveness, temporal performance and communication cost are analyzed.
Mixed-integer programming methods for finding Nash equilibria
Authors: Thomas Sandholm, Andrew Gilpin, Vincent Conitzer
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 2 (2005)

We present, to our knowledge, the first mixed integer program (MIP) formulations for finding Nash equilibria in games (specifically, two-player normal form games). We study different design dimensions of search algorithms that are based on those formulations. Our MIP Nash algorithm outperforms Lemke-Howson but not Porter-Nudelman-Shoham (PNS) on GAMUT data. We argue why experiments should also be conducted on games with equilibria with medium-sized supports only, and present a methodology for generating such games. On such games MIP Nash drastically outperforms PNS but not Lemke-Howson. Certain MIP Nash formulations also yield anytime algorithms for Ε-equilibrium. with provable bounds. Another advantage of MIP Nash is that it can be used to find an optimal equilibrium (according to various objectives). The prior algorithms can be extended to that setting, but they are orders of magnitude slower.