ppxscal/embedding_network huggingface dataset:
Combining stochastic and greedy search in hybrid estimation
Authors: Lars Blackmore, Stanislav Funiak, Brian Williams
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 1 (2005)

Techniques for robot monitoring and diagnosis have been developed that perform state estimation using probabilistic hybrid discrete/continuous models. Exact inference in hybrid dynamic systems is, in general, intractable. Approximate algorithms are based on either 1) greedy search, as in the case of k-best enumeration or 2) stochastic search, as in the case of Rao-Blackwellised Particle Filtering (RBPF). In this paper we propose a new method for hybrid state estimation. The key insight is that stochastic and greedy search methods, taken together, are often particularly effective in practice. The new method combines the stochastic methods of RBPF with the greedy search of k-best in order to create a method that is effective for a wider range of estimation problems than the individual methods alone. We demonstrate this robustness on a simulated acrobatic robot, and show that this benefit comes at only a small performance penalty.
Linguistic Challenges in Global Software Development: Lessons Learned in an International SW Development Division
Authors: Benedikt Lutz
Venue: Proceedings of the 2009 Fourth IEEE International Conference on Global Software Engineering (2009)

In multinational companies, English is used more and more as a "lingua franca" for international collaboration. This is for example true for a unit like Siemens’ Program and System Engineering Division SIS PSE, with headquarters in Austria and subsidiary units in many European countries and China. This article will initially present the concept of ELF (English as a lingua franca), which is steadily gaining importance in applied linguistics research. The main part of this article will outline the practical challenges of using English as a non-native language in international collaboration, including examples of oral and written communication (such as meetings, meeting minutes, training, and requirements specifications). It will be argued that these linguistic challenges are closely connected with intercultural ones. Dealing professionally with these topics is a key asset for project success, especially in project management and requirements engineering.
Phylogenetic Analysis Using Nuclear-Encoded Mitochondrial Proteins
Authors: Alan C. H. Chen, Han C. W. Hsiao, Jeffrey J. P. Tsai
Venue: Proceedings of the 2009 Ninth IEEE International Conference on Bioinformatics and Bioengineering (2009)

Mitochondria have been known as power sources for energy transduction in eukaryotic cells. Hence, mitochondrial genomes and proteins have been used widely forphylogenetic analysis. However, nuclear-encoded mitochondrial proteins are considered in this study to construct phylogenetic relationship among species. An intuitive yet effective and efficient approach to solving relative positions of species is proposed. The derived phylogenetic map demonstrates a satisfactory result, and may indicate an alternative way for phylogenetic analysis. A more complete data set is nevertheless a need.
Modeling spatial and temporal variation in motion data
Authors: Manfred Lau, Ziv Bar-Joseph, James Kuffner
Venue: ACM Transactions on Graphics (TOG) (2009)

We present a novel method to model and synthesize variation in motion data. Given a few examples of a particular type of motion as input, we learn a generative model that is able to synthesize a family of spatial and temporal variants that are statistically similar to the input examples. The new variants retain the features of the original examples, but are not exact copies of them. We learn a Dynamic Bayesian Network model from the input examples that enables us to capture properties of conditional independence in the data, and model it using a multivariate probability distribution. We present results for a variety of human motion, and 2D handwritten characters. We perform a user study to show that our new variants are less repetitive than typical game and crowd simulation approaches of re-playing a small number of existing motion clips. Our technique can synthesize new variants efficiently and has a small memory requirement.
Supporting mobile work processes in logistics with wearable computing
Authors: Ingrid Rügge, Carmen Ruthenbeck, Jakub Piotrowski, Christian Meinecke, Felix Böse
Venue: Proceedings of the 11th International Conference on Human-Computer Interaction with Mobile Devices and Services (2009)

Logistics is a very dynamic and heterogeneous application area which generates complex requirements regarding the development of information and communication technologies (ICT). For this area, it is a challenge to support mobile workers on-site in an unobtrusive manner. In this contribution, wearable computing technologies are investigated as basis for a "mobile worker supporting system" for tasks at an automobile terminal. The features of wearable computing technologies are checked against the requirements of the application area to come to an usable and acceptable mobile solution in an user-centred design process.
Fuzzy Clustering Based on Quotient Space and Its Application in CRM
Authors: Lu Bin, Zhao Xiaomin, Jin Ranran
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 01 (2009)

By using method of fuzzy mathematics to quantitatively determine fuzzy relationship between samples, the fuzzy clustering analysis is able to reflect the world objectively and accurately. In this paper, combing the ideas of quotient space theory, hierarchical structure and fuzzy synthetic evaluation, a new model of fuzzy clustering analysis is proposed based on quotient space, which uses theory of granularities for attributes naturalization. The method not only reduces dimensions of attributes but also takes into account all effects of the important attributes by mapping them from low levels to high levels. Additionally, a new formula is proposed for similar matrix construction. In order to reduce the blindness for determination of the categories number, the threshold process is introduced, and we can gain the cluster outcome as soon as possible by regulating the grain-size. Finally, we did customer relationship management (CRM) in application and it is proved that the model is effective and reasonable for classification of Multi-dimensional data.
High-bandwidth network memory system through virtual pipelines
Authors: Banit Agrawal, Timothy Sherwood
Venue: IEEE/ACM Transactions on Networking (TON) (2009)

As network bandwidth increases, designing an effective memory system for network processors becomes a significant challenge. The size of the routing tables, the complexity of the packet classification rules, and the amount of packet buffering required all continue to grow at a staggering rate. Simply relying on large, fast SRAMs alone is not likely to be scalable or cost-effective. Instead, trends point to the use of low-cost commodity DRAM devices as a means to deliver the worst-case memory performance that network data-plane algorithms demand. While DRAMs can deliver a great deal of throughput, the problem is that memory banking significantly complicates the worst-case analysis, and specialized algorithms are needed to ensure that specific types of access patterns are conflict-free. We introduce virtually pipelined memory, an architectural technique that efficiently supports high bandwidth, uniform latency memory accesses, and high-confidence throughput even under adversarial conditions. Virtual pipelining provides a simple-to-analyze programming model of a deep pipeline (deterministic latencies) with a completely different physical implementation (a memory system with banks and probabilistic mapping). This allows designers to effectively decouple the analysis of their algorithms and data structures from the analysis of the memory buses and banks. Unlike specialized hardware customized for a specific data-plane algorithm, our system makes no assumption about the memory access patterns. We present a mathematical argument for our system's ability to provably provide bandwidth with high confidence and demonstrate its functionality and area overhead through a synthesizable design. We further show that, even though our scheme is general purpose to support new applications such as packet reassembly, it outperforms the state-of-the-art in specialized packet buffering architectures.
Reachability in Succinct and Parametric One-Counter Automata
Authors: Christoph Haase, Stephan Kreutzer, Joël Ouaknine, James Worrell
Venue: Proceedings of the 20th International Conference on Concurrency Theory (2009)

One-counter automata are a fundamental and widely-studied class of infinite-state systems. In this paper we consider one-counter automata with counter updates encoded in binary--which we refer to as the succinct encoding. It is easily seen that the reachability problem for this class of machines is in PSpace and is NP-hard. One of the main results of this paper is to show that this problem is in fact in NP, and is thus NP-complete.We also consider parametric one-counter automata, in which counter updates be integer-valued parameters. The reachability problem asks whether there are values for the parameters such that a final state can be reached from an initial state. Our second main result shows decidability of the reachability problem for parametric one-counter automata by reduction to existential Presburger arithmetic with divisibility.
A Study on the Risk Hierarchical Model and Risk Conduction Based on the Enterprise Complex Information System
Authors: Yang Huanchun
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 03 (2009)

Modern enterprises have ever-increasing dependence on the complex information system, and they are also faced with the enormous risks of the application information system. This paper proposes the significance of enterprise complex information system in the first place. Meantime, it analyzes various risks appeared in the enterprise complex information system, constructs risk hierarchical model of complex information system based on infrastructure risks, project risks, application risks, asset risks of information, business continuity risks, strategic risks of information system, supplier and outsourcing risks of the information system, external enterprise risks of the information system. Finally it gives a detailed analysis of the conduction relation of project risks, service supplier and outsourcing risks, application risks and infrastructure risks, strategic risks of the information system, and interaction among various risks.
The Performance of Erasure Codes Used in FT-MPI
Authors: Liu Xiaoguang, Wang Gang, Zhang Yu, Li Ang, Xie Fang
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 03 (2009)

Today, the scale of High performance computing (HPC) systems is much larger than ever. Some HPC systems consist of thousands or even tens of thousands of processors. The larger scale leads to a challenge that how to deal with process failures. The most important programming tool for HPC is MPI (Message Passing Interface). There are some existing methods to deal with fault-tolerance, such as MPICH-V, StarFish, MPI/FT and so on, using the MPI context. Most of them do the checkpoint on disk. In this paper, some erasure codes, which used in RAID systems usually, are applied to deal with the fault-tolerance in-memory. Based on fault-tolerance-MPI (FT-MPI) platform, RAID4, RAID5, RDP and X-Code are implanted to do the checkpoint in-memory. The experimental results show that RDP is feasible for double-fault-tolerance in-memory.
HECC Goes Embedded: An Area-Efficient Implementation of HECC
Authors: Junfeng Fan, Lejla Batina, Ingrid Verbauwhede
Venue: Selected Areas in Cryptography: 15th International Workshop, SAC 2008, Sackville, New Brunswick, Canada, August 14-15, Revised Selected Papers (2009)

In this paper we describe a high performance, area-efficient implementation of Hyperelliptic Curve Cryptosystems over GF(2 m ). A compact Arithmetic Logic Unit (ALU) is proposed to perform multiplication and inversion. With this ALU, we show that divisor multiplication using affine coordinates can be efficiently supported. Besides, the required throughput of memory or Register File (RF) is reduced so that area of memory/RF is reduced. We choose hyperelliptic curves using the parameters h(x) = x and $f(x)=x^5+f_3x^3+x^2+f_0$. The performance of this coprocessor is substantially better than all previously reported FPGA-based implementations. The coprocessor for HECC over GF(283) uses 2316 slices and 2016 bits of Block RAM on Xilinx Virtex-II FPGA, and finishes one scalar multiplication in 311 μs.
Provider-Independent Use of the Cloud
Authors: Terence Harmer, Peter Wright, Christina Cunningham, Ron Perrott
Venue: Proceedings of the 15th International Euro-Par Conference on Parallel Processing (2009)

Utility computing offers researchers and businesses the potential of significant cost-savings, making it possible for them to match the cost of their computing and storage to their demand for such resources. A utility compute provider enables the purchase of compute infrastructures on-demand; when a user requires computing resources a provider will provision a resource for them and charge them only for their period of use of that resource. There has been a significant growth in the number of cloud computing resource providers and each has a different resource usage model, application process and application programming interface (API)---developing generic multi-resource provider applications is thus difficult and time consuming. We have developed an abstraction layer that provides a single resource usage model, user authentication model and API for compute providers that enables cloud-provider neutral applications to be developed. In this paper we outline the issues in using external resource providers, give examples of using a number of the most popular cloud providers and provide examples of developing provider neutral applications. In addition, we discuss the development of the API to create a generic provisioning model based on a common architecture for cloud computing providers.
Just culture: who gets to draw the line?
Authors: Sidney W. A. Dekker
Venue: Cognition, Technology and Work (2009)

A just culture is meant to balance learning from incidents with accountability for their consequences. All the current proposals for just cultures argue for a clear line between acceptable and unacceptable behavior. This alone, however, cannot promote just culture as it falsely assumes that culpability inheres in the act, bearing immutable features independent of context, language or interpretation. The critical question is not where to draw the line, but who gets to draw it. Culpability is socially constructed: the result of deploying one language to describe an incident, and of enacting particular post-conditions. Different accounts of the same incident are always possible (e.g. educational, organizational, political). They generate different repertoires of countermeasures and can be more constructive for safety. The issue is not to exonerate individual practitioners but rather what kind of accountability promotes justice and safety: backward-looking and retributive, or forward-looking and change-oriented.
Design of Incentive Mechanism for Independent Directors Based on Monitoring Mechanism under Asymmetric Information Condition
Authors: Xu Yan-li
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 02 (2009)

The incentive mechanism for independent directors has yet to be established so far. Through mathematical models and game theory, this paper analyzes the optimal incentive contracts between stockholders and independent directors under asymmetric information condition in order to solve the problems in establishing incentive mechanism for independent directors. Supervision mechanism is introduced and analyzed in the design of incentive mechanism. It expands the theoretical frame for incentive mechanism. The results are as follows: Supervision mechanism is related and complementary with incentive mechanism. Both can encourage or guide the agent to work hard towards common goals. Therefore, the function of the incentive mechanism and the supervision mechanism should be considered simultaneously in the design of incentive contract. Introduction of supervision mechanism into incentive mechanism not only results in theoretical innovation, but also has great application value in practice.
Motion Integration Using Competitive Priors
Authors: Shuang Wu, Hongjing Lu, Alan Lee, Alan Yuille
Venue: Statistical and Geometrical Approaches to Visual Motion Analysis: International Dagstuhl Seminar, Dagstuhl Castle, Germany, July 13-18, 2008. Revised Papers (2009)

Psychophysical experiments show that humans are better at perceiving rotation and expansion than translation [5][9]. These findings are inconsistent with standard models of motion integration which predict best performance for translation. To explain this discrepancy, our theory formulates motion perception at two levels of inference: we first perform model selection between the competing models (e.g. translation, rotation, and expansion) and then estimate the velocity using the selected model. We define novel prior models for smooth rotation and expansion using techniques similar to those in the slow-and-smooth model [23] (e.g. Green functions of differential operators). The theory gives good agreement with the trends observed in four human experiments.
Efficient Decoding of Ternary Error-Correcting Output Codes for Multiclass Classification
Authors: Sang-Hyeun Park, Johannes Fürnkranz
Venue: Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part II (2009)

We present an adaptive decoding algorithm for ternary ECOC matrices which reduces the number of needed classifier evaluations for multiclass classification. The resulting predictions are guaranteed to be equivalent with the original decoding strategy except for ambiguous final predictions. The technique works for Hamming Decoding and several commonly used alternative decoding strategies. We show its effectiveness in an extensive empirical evaluation considering various code design types: Nearly in all cases, a considerable reduction is possible. We also show that the performance gain depends on the sparsity and the dimension of the ECOC coding matrix.
Study on LUCC in Wanzhou District Based on Virtual Reality and 3S
Authors: Zhou Qigang, Zhang Ye
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 03 (2009)

This study focused on the technology of LUCC (land use and land cover change, LUCC) information extracting based on Virtual Reality and 3S in Wanzhou district. Taken remote sensing images and topographic maps as date resource, a Virtual reality system was built. LUCC in formations from 2000 to 2003 in Wanzhou district were extracted in the system. The results indicate that objects in three dimension viewer distinguish with other are more easy than those in two dimension. Combining Virtual Reality system with 3S technology, LUCC can extracted more easily with higher precision. The data of LUCC extraction based on Virtual Reality and 3S technology is more reasonable. It can provide good reference to government to manage the land resource reasonable, and to other researcher to obtain LUCC data quickly and accurately in other area.
Importance of semantic representation: dataless classification
Authors: Ming-Wei Chang, Lev Ratinov, Dan Roth, Vivek Srikumar
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 2 (2008)

Traditionally, text categorization has been studied as the problem of training of a classifier using labeled data. However, people can categorize documents into named categories without any explicit training because we know the meaning of category names. In this paper, we introduce Dataless Classification, a learning protocol that uses world knowledge to induce classifiers without the need for any labeled data. Like humans, a dataless classifier interprets a string of words as a set of semantic concepts. We propose a model for dataless classification and show that the label name alone is often sufficient to induce classifiers. Using Wikipedia as our source of world knowledge, we get 85.29% accuracy on tasks from the 20 Newsgroup dataset and 88.62% accuracy on tasks from a Yahoo! Answers dataset without any labeled or unlabeled data from the data sets. With unlabeled data, we can further improve the results and show quite competitive performance to a supervised learning algorithm that uses 100 labeled examples.
A modal logic for beliefs and pro attitudes
Authors: Kaile Su, Abdul Sattar, Han Lin, Mark Reynolds
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 1 (2007)

Agents' pro attitudes such as goals, intentions, desires, wishes, and judgements of satisfactoriness play an important role in how agents act rationally. To provide a natural and satisfying formalization of these attitudes is a longstanding problem in the community of agent theory. Most of existing modal logic approaches are based on Kripke structures and have to face the so-called side-effect problem. This paper presents a new modal logic formalizing agents' pro attitudes, based on neighborhood models. There are three distinguishing features of this logic. Firstly, this logic naturally satisfies Bratman's requirements for agents' beliefs and pro attitudes, as well as some interesting properties that have not been discussed before. Secondly, we give a sound and complete axiom system for characterizing all the valid properties of beliefs and pro attitudes. We introduce for the first time the notion of linear neighborhood frame for obtaining the semantic model, and this brings a new member to the family of non-normal modal logics. Finally, we argue that the present logic satisfies an important requirement proposed from the viewpoint of computation, that is, computational grounding, which means that properties in this logic can be given an interpretation in terms of some concrete computational model. Indeed, the presented neighborhood frame can be naturally derived from probabilistic programming with utilities.
An adaptive and safe ubicomp for HPC applications
Authors: Xuanhua Shi, Jean-Louis Pazat
Venue: International Journal of Ad Hoc and Ubiquitous Computing (2009)

This paper presents an adaptive component-based infrastructure, which is composed with two parts, the mobile devices and the grid infrastructure. Because of the distributed, dynamic, and large-scale features, the ubiquitous computing (ubicomp) is vulnerable to malicious attacks for HPC applications. This paper presents an adaptive component at the grid infrastructure side to target the safety problems; the adaptive component makes adaptive replication actions according to different kinds of safety situations. This paper also presents the evaluation for the adaptive actions, which show that the adaptive method can handle the safety problems for HPC applications in ubicomp.