ppxscal/embedding_network huggingface dataset:
Crowd patches: populating large-scale virtual environments for real-time applications
Authors: Barbara Yersin, Jonathan Maïm, Julien Pettré, Daniel Thalmann
Venue: Proceedings of the 2009 symposium on Interactive 3D graphics and games (2009)

Populating virtual environments (VEs) with large crowds is a subject that has been tackled for several years. Solutions have been proposed to offer realistic trajectories as well as interactivity, but limitations remain on the environment dimensions with respect to population density. In this paper, we extend the concept of motion patches [Lee et al. 2006] to densely populate large environments. We build a population from a set of blocks containing a pre-computed local crowd simulation. Each block is called a crowd patch. We address the problem of computing patches, assembling them to create VEs, and controlling their content to answer designers' needs. Our major contribution is to provide a drastic lowering of computation needs for simulating a virtual crowd at run-time. We can thus handle dense populations in large-scale environments with performances never reached so far. Our results illustrate the real-time population of a potentially infinite city with realistic and varied crowds interacting with each other and their environment. We discuss the advantages and drawbacks of the proposed solution, and its possible improvements in the future.
Grey Decision on Oil Distillation Tower Top Exchangers Maintenance Overhaul
Authors: Zhengfang Wang, Yong Wang, Weiqiang Wang, Yiyuan Cheng, Hui Qi, Dawei Qu
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

The exchangers on the top of tower exposed to wash erosion seriously when Shengli refinery processed Middle-east crude oil. Used grey system theory, aimed at general tube-shell exchangers and helix-baffled structure, tube of 20 carbon steel with TH847 coating, 20 steel aluminizing, 316L and dual phase steel, carried on grey decision. For exchangers rebuilding project, grey target decision shows that helix-baffled exchangers with 20+TH847 coating tube is the best preference plan, while grey incidence decision shows that the helix-baffled structure with 20 carbon steel aluminizing tube is the preferential plan. In general, helix-baffled structure is better than general contractures, should adopt advanced manufacture technology to lower the fabricate difficulty.
A grid based particle method for moving interface problems
Authors: Shingyu Leung, Hongkai Zhao
Venue: Journal of Computational Physics (2009)

We propose a novel algorithm for modeling interface motions. The interface is represented and is tracked using quasi-uniform meshless particles. These particles are sampled according to an underlying grid such that each particle is associated to a grid point which is in the neighborhood of the interface. The underlying grid provides an Eulerian reference and local sampling rate for particles on the interface. It also renders neighborhood information among the meshless particles for local reconstruction of the interface. The resulting algorithm, which is based on Lagrangian tracking using meshless particles with Eulerian reference grid, can naturally handle/control topological changes. Moreover, adaptive sampling of the interface can be achieved easily through local grid refinement with simple quad/oct-tree data structure. Extensive numerical examples are presented to demonstrate the capability of our new algorithm.
A Novel Cell-level Resource Allocation Scheme for OFDMA System
Authors: Weidong Wang, Lexi Xu, Yinghai Zhang, Jianrong Zhong
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

In OFDMA system, inter-cell interference (ICI) and multi-service requirement are challenging problems. Previous cell-level schemes ignored different QoS requirement of multi-service. Meanwhile, most of them only considered complex cell edge part separation but simplified cell inner part allocation to eliminate ICI, but refined inner part allocation could eliminate ICI effectively. To solve this problem, we propose a novel area location and service associated allocation scheme (LSA) based on soft frequency reuse. With investigation on interference of area location of inner part, LSA divide inner part and set area location priority. Considering multi-service requirement, we calculate average service priority of each area. Based on above two priorities we calculate frequency point allocation index (FAI). In parallel, LSA defines frequency point priority list, which helps FAI to optimize resource assignment in different areas.
Metaproperty aspects
Authors: Clayton G. Myers, Elisa L.A. Baniassad
Venue: Proceedings of the 8th ACM international conference on Aspect-oriented software development (2009)

Currently, it is possible to use Aspect-Oriented languages to attach behavior to code based on semantic or syntactic properties of that code. There is no language, however, that allows developers to attach behavior based on static metaproperties of code. Here, we demonstrate a technique for applying AOP methods to metaproperties of source code. We use advice to coherently define runtime behavior for subsets of code that need not share semantic or syntactic properties. To illustrate the approach, we use Java as a base language, and define a family of pointcuts based on the edit time of the source lines, then build a simple debugging application that applies runtime tracing to only the most recently changed code. Using this technique, the tracing code is neatly modularized and need not depend on any semantic properties of the base code. We believe that this approach has powerful applications for debugging as well as for software engineering researchers looking to explore the runtime effects of extra-linguistic features.
On Increasing the Number of Users in (t, n) Threshold Secret Sharing Schemes
Authors: Todorka Alexandrova, Hiroyoshi Morita
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

Constructing ideal (t,n) threshold secret sharing schemes leads to some limitations on the maximum number of users, that are able to join the secret sharing scheme. We aim to remove these limitations by reducing the information rate of the constructed threshold secret sharing schemes. In this paper we propose recursive construction algorithms of (t,n) threshold secret sharing schemes, based on the generalized vector space construction. Using these algorithms we are able to construct a (t,n) threshold secret sharing scheme for any arbitrary n.
A high performance fpga-based implementation of position specific iterated blast
Authors: Server Kasap, Khaled Benkrid, Ying Liu
Venue: Proceeding of the ACM/SIGDA international symposium on Field programmable gate arrays (2009)

We present in this paper the first reported FPGA implementation of the Position Specific Iterated BLAST (PSI-BLAST) algorithm. The latter is a heuristic biological sequence alignment algorithm that is widely used in the bioinformatics and computational biology world in order to detect weak homologs. The architecture of our FPGA implementation is parameterized in terms of sequence lengths, scoring matrix, gap penalties and cut-off and threshold values. It is composed of various blmocks each of which performs one step of the algorithm in parallel. This results in high performance implementations, which easily outperform equivalent software implementations by one order of magnitude or more. Furthermore, the core was captured in an FPGA-platform-independent language, namely the Handel-C language, to which no specific resource inference or placement constraints were applied. This makes our core portable across different FPGA families and architectures.
Construction Kits as Learning Environments
Authors: Carol Strohecker
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

Two software applications illustrate principles of microworld design. WayMaker is a tool for constructing maps and virtual scenes of ciQscapes. With DemBones, users build cartoon-like skeletons from images of dinosaur bones, and experiment with simulated legged locomotion in animating the creatures. Each kit is both a learning environment and a toolfor learning research.
A DP algorithm for minimizing makespan and total completion time on a series-batching machine
Authors: Cheng He, Yixun Lin, Jinjiang Yuan
Venue: Information Processing Letters (2009)

This paper studies a bicriteria scheduling problem on a series-batching machine with objective of minimizing makespan and total completion time simultaneously. A series-batching machine is a machine that can handle up to b jobs in a batch and the completion time of all jobs in a batch is equal to the finishing time of the last job in the batch and the processing time of a batch is the sum of the processing times of jobs in the batch. In addition, there is a constant setup time s for each batch. For the problem we can find all Pareto optimal solutions in O(n^2) time by a dynamic programming algorithm, where n denotes the number of jobs.
Robustness to Code and Data Deletion in Autocatalytic Quines
Authors: Thomas Meyer, Daniel Schreckling, Christian Tschudin, Lidia Yamamoto
Venue: Transactions on Computational Systems Biology X (2008)

Software systems nowadays are becoming increasingly complex and vulnerable to all sorts of failures and attacks. There is a rising need for robust self-repairing systems able to restore full functionality in the face of internal and external perturbations, including those that affect their own code base. However, it is difficult to achieve code self-repair with conventional programming models.We propose and demonstrate a solution to this problem based on self-replicating programs in an artificial chemistry. In this model, execution proceeds by chemical reactions that modify virtual molecules carrying code and data. Self-repair is achieved by what we call autocatalytic quines: programs that permanently reproduce their own code base. The concentration of instructions reflects the health of the system, and is kept stable by the instructions themselves. We show how the chemistry of such programs enables them to withstand arbitrary amounts of random code and data deletion, without affecting the results of their computations.
Proceedings of the combined workshops on UnConventional high performance computing workshop plus memory access workshop
Venue: Conference On Computing Frontiers (2009)

Recently, the rapidly increasing, inexpensive computing power of game platforms has attracted much interest from the HPC community. Despite being unconventional for HPC, the usage of GPUs for general purpose computing (GPGPU) as well as game processors such as the Cell BE is a great success. The aim of the workshop is to focus on such hardware, which could be potentially conventional for HPC tomorrow (therefore the capital inner-word C in the title). Four papers will be presented at the UCHPC workshop this year, covering different aspects of unconventional HPC. The topics include two types of GPGPU implementations as well as problems of porting to application accelerators like the GPU and Clearspeed, but also interesting aspects of cloud computing for HPC. The issues behind the "memory wall" have existed for quite some time now. However, the gap between performance of emerging multi- and many-core processors on the one side, and main memory on the other side is widening even faster than ever. The workshop is expected to highlight both hardware as well as software solutions to be able to relax or cope with the limits of the memory connection. This year, we unfortunately were able to accept only one good submission, which focuses on the software side of the memory access problem. As it is expected that manycore and GPU architectures will evolve into a similar direction, eventually combined on one chip, we used the chance to combine MAW'09 with UCHPC'09, envisioning an inspiring session.
Egocentric and exocentric teleoperation interface using real-time, 3D video projection
Authors: François Ferland, François Pomerleau, Chon Tam Le Dinh, François Michaud
Venue: Proceedings of the 4th ACM/IEEE international conference on Human robot interaction (2009)

The user interface is the central element of a telepresence robotic system and its visualization modalities greatly affect the operator's situation awareness, and thus its performance. Depending on the task at hand and the operator's preferences, going from ego- and exocentric viewpoints and improving the depth representation can provide better perspectives of the operation environment. Our system, which combines a 3D reconstruction of the environment using laser range finder readings with two video projection methods, allows the operator to easily switch from ego- to exocentric viewpoints. This paper presents the interface developed and demonstrates its capabilities by having 13 operators teleoperate a mobile robot in a navigation task.
Fault Tolerance Requirements Analysis Using Deviations in the CORRECT Development Process
Authors: Andrey Berlizev, Nicolas Guelfi
Venue: Methods, Models and Tools for Fault Tolerance (2009)

Current requirements analysis methods focus on the functional properties of fault free systems. It is known that, regardless of the type of software system, many faults are made during engineering and that these faults may conduct system errors and then system failures. We believe that faulty engineering activities, as well as correct activities, should be given precedence during software development. In this paper we present CORA, which is the analysis phase for the CORRECT methodology. CORA introduces semi-formal models based on UML and OCL that allow for the specification of normal system behaviors, as well as abnormal behaviors, together with their associated recovery strategy. CORA proposes to specify fault-tolerant systems using a domain model as a custom UML class diagram and an activity model as a custom UML activity diagram. The deviation and recovery strategies are expressed explicitly in a specific section of the CORA Activity Diagram. This paper introduces CORA conceptually and it explicitly defines the syntax and semantics of the proposed analysis models. We also use a running example to illustrate our approach.
Different metaheuristic strategies to solve the feature selection problem
Authors: Silvia Casado Yusta
Venue: Pattern Recognition Letters (2009)

This paper investigates feature subset selection for dimensionality reduction in machine learning. We provide a brief overview of the feature subset selection techniques that are commonly used in machine learning. Different metaheuristic strategies are proposed to solve the feature selection problem - GRASP, Tabu Search and Memetic Algorithm. These three strategies are compared with a Genetic Algorithm (which is the metaheuristic strategy most frequently used to solve this problem) and with other typical feature selection methods, such as Sequential Forward Floating Selection (SFFS) and Sequential Backward Floating Selection (SBFS). The results show that, in general, GRASP and Tabu Search obtain significantly better results than the other methods.
Supporting the Development of Applications in Heterogeneous Ubiquitous Computing Environments
Authors: Nelson Baloian, Gustavo Zurita
Venue: Computer Supported Cooperative Work in Design IV: 11th International Conference, CSCWD 2007, Melbourne, Australia, April 26-28, 2007. Revised Selected Papers (2008)

Ubiquitous computing is increasingly becoming part of our lives. Various computing devices, having different sizes and capabilities, and using different software platforms are part of our working, leisure and living scenario, where mobile devices coexist and communicate with desktop and laptop computers. Because of this phenomenon, the need for reliable and efficient mechanisms to connect applications running on different platforms is increasing. In this paper we present a middleware which easies the process of development applications running in different platforms in a peer-to-peer computing environment. The papers also present the results of benchmarking tests and the experience of developing different applications with this platform.
A team formation model based on knowledge and collaboration
Authors: Hyeongon Wi, Seungjin Oh, Jungtae Mun, Mooyoung Jung
Venue: Expert Systems with Applications: An International Journal (2009)

Appointing a good leader to the position of team manager and having competent workers collaborate as team members is a key to success in business activities of an enterprising institution. The traditional methodologies of human resource management have defined the required abilities for team managers and team members, and evaluated those abilities of employees. However, it is difficult to consider those abilities systematically in practice. In addition, the current management paradigm undergoes rapid transitions into knowledge management. In step with these trends, this study presents a framework for analyzing the knowledge of the candidates for managers and team members for the new team, and proposes a genetic algorithm and social network measures for choosing a team manager and team members. A prototype was built for testing the feasibility of the model. The testing data are from an R&D institute's human resource management department. The results show that our proposed approach is a quantitative and systematic method for selecting proper personnel for appropriate teams.
Generation, Validation and Analysis of SPEC CPU2006 Simulation Points Based on Branch, Memory and TLB Characteristics
Authors: Karthik Ganesan, Deepak Panwar, Lizy K. John
Venue: Proceedings of the 2009 SPEC Benchmark Workshop on Computer Performance Evaluation and Benchmarking (2009)

The SPEC CPU2006 suite, released in Aug 2006 is the current industry-standard, CPU-intensive benchmark suite, created from a collection of popular modern workloads. But, these workloads take machine weeks to months of time when fed to cycle accurate simulators and have widely varying behavior even over large scales of time [1]. It is to be noted that we do not see simulation based papers using SPEC CPU2006 even after 1.5 years of its release. A well known technique to solve this problem is the use of simulation points [2]. We have generated the simulation points for SPEC CPU2006 and made it available at [3]. We also report the accuracies of these simulation points based on the CPI, branch misspredictions, cache TLB miss ratios by comparing with the full runs for a subset of the benchmarks. It is to be noted that the simulation points were only used for cache, branch and CPI studies until now and this is the first attempt towards validating them for TLB studies. They have also been found to be equally representative in depicting the TLB characteristics. Using the generated simulation points, we provide an analysis of the behavior of the workloads in the suite for different branch predictor cache configurations and report the optimally performing configurations. The simulations for the different TLB configurations revealed that usage of large page sizes significantly reduce the translation misses and aid in improving the overall CPI of the modern workloads.
Generating design knowledge though data mining
Authors: Jennifer Davidson, Xi Zhang, Guy-Alain Amoussou
Venue: Journal of Computing Sciences in Colleges (2009)

Designing software is an expensive process. Our claim is that designing software can become more efficient if designers have knowledge about their design processes. One avenue of capturing the design process is through documentation. People have not focused on documentation for the purpose of generating design knowledge. A design platform called Lifecycle Manager (LCM) allows designers to document all steps of their design process. However, LCM does not have the means for interpreting the documentation that it collects. Our goal is to add that capability by studying how data mining can be applied to generate design knowledge. We developed a data mining tool and implemented four data mining algorithms on data captured by LCM, to learn that design knowledge cannot be gained from only one pattern. We learned about the evolution of LCM design by analyzing the data mining results. We plan to incorporate our tool into LCM.
From HCI to media experience: methodological implications
Authors: Elizabeth F. Churchill, Jeffrey Bardzell
Venue: Proceedings of the 21st British HCI Group Annual Conference on HCI 2008: People and Computers XXI: HCI...but not as we know it - Volume 2 (2007)

The landscape of interactive technology design and evaluation is expanding. In the past, usability and task efficiency were the main focus for research in human computer interaction; evaluation methods worked from single user data over constrained tasks. This kind of work remains central to our discipline. However, new issues are complicating this scenario. For example, how do we design for quintessentially elusive concepts like "experience"? Especially when that experience is not singular, but social, where data are spread across many people, potentially many platforms and devices, and many settings. Where the lab test cannot shed light on ways that experience unfolds over time. The units of analysis and the data to be gathered are contested. In this workshop we invite discussion of interactive media experience and how to design for and evaluate it.
Coordination in high-risk organizations: the need for flexible routines
Authors: Gudela Grote, Johann C. Weichbrodt, Hannes G&#x00fc;nter, Enik&#x00f6; Zala-Mez&#x00f6;, Barbara K&#x00fc;nzle
Venue: Cognition, Technology and Work (2009)

In this article, we link the literatures on organizational routines and the management of uncertainties in order to establish the concept of flexible routines. Supported by flexible rules, this type of routine is argued to help achieve the right balance between standardization and flexibility, thus enabling resilience through loose coupling in high-risk organizations. The operationalization of the concept of flexible routine can help strategic decision-making regarding the design of high-risk systems as well as operational decision-making in the course of handling complex work processes. To underpin these arguments, findings from a case study on rules management in a railway organization are presented, where alignment of rules with the amount of uncertainty and actors&#x2019; competencies for handling uncertainties were analyzed. Implications for future research on flexible routines are discussed.
OVerFA: a collaborative framework for the semantic annotation of documents and websites
Authors: Francesco Moscato, Beniamino Di Martino, Salvatore Venticinque, Angelo Martone
Venue: International Journal of Web and Grid Services (2009)

Ontology-based annotation is one of the leading trends in the creation of metadata. It uses ontologies as vocabularies. Several languages and tools exist which support annotations of different types of media. Usually, such languages are tightly coupled with specific tools and they are able to describe only those features the tools are designed to manage. Furthermore, very few tools and languages (or none at all) support annotations of multiple media types or documents, or ontologies and annotations versioning, so they are not so useful in a collaborative infrastructure which aims to produce annotations of multimedia resources. In this work the main architecture and the language to create annotations of the Ontology-based VERsioned Framework for Annotation (OVerFA) are presented. How the framework allows for collaborative annotation of documents of different media types and how it is possible to exploit useful features in order to produce clear and complete ontology-based annotations are shown.