ppxscal/embedding_network huggingface dataset:
Parameterized Complexity of Inverse Scope Problems in Metabolic Networks
Authors: Hong Liu, Haodi Feng, Daming Zhu
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 02 (2009)

Inverse Scope Problem aims to determine, by analyzing the structure of a metabolic network, the minimum cardinality set of seed compounds required for the synthesis of a specific compound or set of compounds. This paper examines the computational complexity of three variants of the inverse scope problem from parameterized complexity view. With as natural parameter the minimum number of metabolites necessary for synthesizing a set of target metabolites, we prove that inverse scope problem with two forbidden sets is W[2]-hard. In addition, we point out that the inverse scope problem with no forbidden set and the inverse scope problem with a forbidden set are also W[2]-hard.
Reducing Soft Errors through Operand Width Aware Policies
Authors: Oguz Ergin, Osman Unsal, Xavier Vera, Antonio Gonzalez
Venue: IEEE Transactions on Dependable and Secure Computing (2009)

Soft errors are an important challenge in contemporary microprocessors. Particle hits on the components of a processor are expected to create an increasing number of transient errors with each new microprocessor generation. In this paper, we propose simple mechanisms that effectively reduce the vulnerability to soft errors in a processor. Our designs are generally motivated by the fact that many of the produced and consumed values in the processors are narrow and their upper order bits are meaningless. Soft errors caused by any particle strike to these higher order bits can be avoided by simply identifying these narrow values. Alternatively, soft errors can be detected or corrected on the narrow values by replicating the vulnerable portion of the value inside the storage space provided for the upper order bits of these operands. As a faster but less fault tolerant alternative to ECC and parity, we offer a variety of schemes that make use of narrow values and analyze their efficiency in reducing soft error vulnerability of different data-holding components of a processor. On average, techniques that make use of the narrowness of the values can provide 49 percent error detection, 45 percent error correction, or 27 percent error avoidance coverage for single bit upsets in the first level data cache across all Spec2K. In other structures such as the immediate field of the issue queue, an average error detection rate of 64 percent is achieved.
Survey on Collaborative AR for Multi-user in Urban Studies and Planning
Authors: Ajune Wanis Ismail, Mohd Shahrizal Sunar
Venue: Proceedings of the 4th International Conference on E-Learning and Games: Learning by Playing. Game-based Education System Design and Development (2009)

This paper describes an augmented reality (AR) environment that allows multiple participants or multi-user to interact with 2D and 3D data. AR simply can provide a collaborative interactive AR environment for urban planning, where users can interact naturally and intuitively. In addition, the collaborative AR makes multi-user in urban planning to share simultaneously a real world and virtual world. The fusion between real and virtual world, existed in AR environment by see-through HMDs, achieves higher interactivity as a key features of collaborative AR. In real-time, precise registration between both worlds and multi-user are crucial for the collaborations. Collaborative AR allow multi-user to simultaneously share a real world surrounding them and a virtual world. Common problems in AR environment will be discussed and major issues in collaborative AR will be explained details in this survey. The features of collaboration in AR environment are will be identified and the requirements of collaborative AR will be defined. This paper will give an overview on collaborative AR environment for multi-user in urban studies and planning. The work will also cover numerous systems of collaborative AR environments for multi-user.
An Implementation of a Framework for Open Distributed Computing
Authors: Chia-Chu Chiang
Venue: Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing (2009)

In the sequential model of programming, instructions in a program are executed sequentially. Existing programming languages are mainly designed for the sequential model. As the programming paradigm shifts from the sequential to distributed computing, existing sequential programming languages have their limitations. Nevertheless, the sequential languages are the languages which most of programmers are most familiar with. One of the motivations of this research is to implement a framework to support the implementations of distributed applications using sequential programming languages such as C/C++, COBOL, and Java. In this paper, we present an implementation of a framework for open distributed programming. Allowing programmers to write distributed programs in their favorite sequential programming languages makes the programming paradigm very unique to the existing programming paradigms.
Online Police Station, A State-of-Art Italian Semantic Technology against Cybercrime
Authors: Federico Neri, Paolo Geraci, Gianluca Sanna, Liviana Lotti
Venue: Proceedings of the 2009 International Conference on Advances in Social Network Analysis and Mining (2009)

This paper describes a content enabling system that provides deep semantic search and information access to large quantities of distributed multimedia data for both experts and general public. It provides with a language independent search and dynamic classification features for a broad range of data collected from several sources in a number of culturally diverse languages. This system is part of the Online Police Station, launched by the Italian Minister of the Interior in 2006. The Online Police Station uses a virtual reality interface to provide general information and online assistance. Citizens can download forms, make complaints, receive advice and/or report events of an illegal nature. Police specialists can monitor criminal trends to ensure that responses are appropriately focused, and that scarce resources are more effectively employed against criminality. Online Police Station was voted as the Most inspiring good practice for creative solutions to common challenges, at the European eGovernment Awards 2007.
Supporting End-User Development of Personalized Mobile Learning Tools
Authors: Marco Sá, Luís Carriço
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part IV: Interacting in Various Application Domains (2009)

Mobile devices present great features for the support of pervasive learning and content personalization. This paper presents a framework which takes advantage of these features and supports end-users while creating their customized tools for their students. Additionally, the framework comprises means for teachers to include persuasive and motivational mechanisms and hints, promoting student engagement while pursuing their learning activities. We describe the framework's architecture, its features, including the supporting guidelines and development process, and detail some of the already developed material and the results that emerged during initial trials and case studies, also stressing their contributions to the field of m-learning.
Towards automatic animated storyboarding
Authors: Patrick Ye, Timothy Baldwin
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 1 (2008)

In this paper, we propose a machine learning-based NLP system for automatically creating animated storyboards using the action descriptions of movie scripts. We focus particularly on the importance of verb semantics when generating graphics commands, and find that semantic role labelling boosts performance and is relatively robust to the effects of unseen verbs.
Portable embedded medical box implementation for health monitoring applications in avionic environments
Authors: Konstantinos Anastasopoulos, Pavlos Kouros, Dimitrios Marinos, Konstantinos Aidinis, Nikolaus Schmitt, Jirka Klaue, Thomas Pistner
Venue: Proceedings of the 2009 IEEE International Workshop on Medical Measurements and Applications (2009)

In the work described in this article, several types of health monitoring sensor modules have been integrated in a compact portable enclosure - such as Electrocardiogram, pulse rate, blood pressure, oximetry, temperature. In addition, a control board was designed and implemented with the purpose of interfacing and processing the data arriving from the sensor modules, and their transfer to a standard RS232 interface. The board was designed for low power operation at the minimum output data rate. To this end, maximum measurement time and also low sampling rate regarding the continuous health monitoring measurements (ECG, Oximetry) were considered. A two layered (Master-Slave) microcontroller architecture was configured to process the sensor output frame and embed relevant information, such as seat number, in order to make storage and data retrieval possible over a large network. A graphic display was also integrated with the aim of projecting passenger health state and triggering alarms when necessary. The medical box is connected to a wireless optical data network inside the aircraft cabin providing maximum flexibility. Although the primary purpose of the system realized was the alerting of trained onboard staff about a broad spectrum of possible health failures, remote health monitoring at ground presents itself as a possibility under the network infrastructure already in place.
A Group Recommender System for Tourist Activities
Authors: Inma Garcia, Laura Sebastia, Eva Onaindia, Cesar Guzman
Venue: Proceedings of the 10th International Conference on E-Commerce and Web Technologies (2009)

This paper introduces a method for giving recommendations of tourist activities to a group of users. This method makes recommendations based on the group tastes, their demographic classification and the places visited by the users in former trips. The group recommendation is computed from individual personal recommendations through the use of techniques such as aggregation, intersection or incremental intersection. This method is implemented as an extension of the e-Tourism tool, which is a user-adapted tourism and leisure application, whose main component is the Generalist Recommender System Kernel (GRSK), a domain-independent taxonomy-driven search engine that manages the group recommendation.
Interactions between Modes of Supply of Trade in Service: A Econometric Test
Authors: Ying Hua Meng, Ning Huang
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 02 (2009)

According to the GATS, services can be traded through four different modes of supply, and there is much evidence to indicate interdependence across these four modes in services trade. So it is more complicated when constructing policy of trade in service than trade in goods. With service US export data and econometric methods, we take an econometric study to find what the intrinsic relations and quantify of these effects, corresponding policies are also concluded.
A path-load based adaptive routing algorithm for networks-on-chip
Authors: Leonel Tedesco, Fabien Clermidy, Fernando Moraes
Venue: Proceedings of the 22nd Annual Symposium on Integrated Circuits and System Design: Chip on the Dunes (2009)

Applications executing in current MPSoCs present traffic behavior with different characteristics in terms of QoS requirements and traffic modeling. Another important MPSoC traffic feature is its unpredictability and dynamic nature. Networks-on-chip (NoCs) are communication structures being used due to higher degree of parallelism, fault tolerance, and scalability, when compared to busses. Even with increased bandwidth due to parallelism, some flows may compete for the same network resources, affecting the applications performance, and possibly violating QoS requirements. Adaptive routing algorithms may reduce such congestion, enabling dynamic path modification according to some congestion evaluation metric. State of the art approaches have a limited view of the congestion areas, since each router take routing decisions based on its neighbors congestion status. Such local decision may lead packets to another NoC congested region, therefore being inefficient. This paper proposes a new method, using the information of all routers in the source-target path. This method relies on a protocol for QoS session establishment, followed by distributed monitoring, and reroute to non-congested routers. The set of executed experiments presents results concerning latency and buffer utilization when the method proposed is applied.
Parallel Lattice Boltzmann Simulation for Fluid Flow on Multicore Platform
Authors: Weibin Guo, Cheqing Jin, Jianhua Li, Gaoqi He
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 01 (2009)

During the past fifteen years Lattice Boltzmann method has attracted much attention in the area of CFD, whereas it has also been recognized that it is both computationally demanding and memory intensive. In this paper we give a brief introduction to the equations for LBM and the basic features, describe the programming model in multicore computing environment, and outline the parallelization strategies. Moreover, we explore corresponding implementation on multicore platform. In order to demonstrate the efficiency, several benchmark steady fluid flow experiments have been performed. The results show that our approach achieves good performance.
Extend Reading Resources Presentation for Effective Online Writing
Authors: Sun Zhong
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 01 (2009)

More and more primary students have the opportunities to do their online writing with the rapid development of school network in china. This article addressed on the research of what kind of extend reading resources should be supplied by the literature teachers to improve students’ writing abilities. The result verified that extend reading resources is good for writing indeed with quantities research.
Assessing the Impact of Measurement Uncertainty on User Models in Spatial Domains
Authors: Daniel F. Schmidt, Ingrid Zukerman, David W. Albrecht
Venue: Proceedings of the 17th International Conference on User Modeling, Adaptation, and Personalization: formerly UM and AH (2009)

This paper examines the problem of uncertainty due to instrumentation in user modeling systems within spatial domains. We consider the uncertainty of inferring a user's trajectory within a physical space combined with the uncertainty due to inaccuracies in measuring a user's position. A framework for modeling both types of uncertainties is presented, and applied to a real-world case study from the museum domain. Our results show that this framework may be used to investigate the effects of layout in a gallery, and to explore the degradation in the predictive performance of user models due to measurement error. This information in turn may be used to guide the curation of the space, and the selection of sensing technologies prior to instrumenting the space.
A Storage Efficient Redactable Signature in the Standard Model
Authors: Ryo Nojima, Jin Tamura, Youki Kadobayashi, Hiroaki Kikuchi
Venue: Proceedings of the 12th International Conference on Information Security (2009)

In this paper, we propose a simple redactable signature scheme for super-sets whose message-signature size is O(|M| + ¿), where ¿ is a security parameter and M is a message to be signed. The scheme proposed by Johnson et al. in CT-RSA 2003 has the similar performance but this scheme was proven secure based on the RSA assumption in the random oracle model. In this paper, we show that such a scheme can be constructed based on the RSA assumption without the random oracles.
AI Goggles: Real-time Description and Retrieval in the Real World with Online Learning
Authors: Hideki Nakayama, Tatsuya Harada, Yasuo Kuniyoshi
Venue: Proceedings of the 2009 Canadian Conference on Computer and Robot Vision (2009)

In this paper, we present the AI Goggles system, which can instantly describe objects and scenes in the real world and retrieve visual memories about them using keywords input by the users. This is a stand-alone wearable system working on a tiny mobile computer. Also, the system can quickly learn unknown objects and scenes by teaching and learn to label and retrieve them on site, without loss of recognition ability for previously learnt ones. As the core algorithm of the system, we propose and implement a new method of multi labeling and retrieval of unconstrained real-world images. Our method outperforms the current state-of-the-art method, in terms of both accuracy and computation speed on the standard benchmark dataset. This is a major contribution to development of visual and memory assistive man-machine user interface.
A Statistical Model of White Matter Fiber Bundles Based on Currents
Authors: Stanley Durrleman, Pierre Fillard, Xavier Pennec, Alain Trouvé, Nicholas Ayache
Venue: Proceedings of the 21st International Conference on Information Processing in Medical Imaging (2009)

The purpose of this paper is to measure the variability of a population of white matter fiber bundles without imposing unrealistic geometrical priors. In this respect, modeling fiber bundles as currents seems particularly relevant, as it gives a metric between bundles which relies neither on point nor on fiber correspondences and which is robust to fiber interruption. First, this metric is included in a diffeomorphic registration scheme which consistently aligns sets of fiber bundles. In particular, we show that aligning directly fiber bundles may solve the aperture problem which appears when fiber mappings are constrained by tensors only. Second, the measure of variability of a population of fiber bundles is based on a statistical model which considers every bundle as a random diffeomorphic deformation of a common template plus a random non-diffeomorphic perturbation. Thus, the variability is decomposed into a geometrical part and a "texture" part. Our results on real data show that both parts may contain interesting anatomical features.
Generality and equivalence relations in default logic
Authors: Katsumi Inoue, Chiaki Sakama
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 1 (2007)

Generality or refinement relations between different theories have important applications to generalization in inductive logic programming, refinement of ontologies, and coordination in multi-agent systems. We study generality relations in disjunctive default logic by comparing the amounts of information brought by default theories. Intuitively, a default theory is considered more general than another default theory if the former brings more information than the latter. Using techniques in domain theory, we introduce different types of generality relations over default theories. We show that generality relations based on the Smyth and Hoare orderings reflect orderings on skeptical and credulous consequences, respectively, and that two default theories are equivalent if and only if they are equally general under these orderings. These results naturally extend both generality relations over first-order theories and those for answer set programming.
Implementing Blocked Sparse Matrix-Vector Multiplication on NVIDIA GPUs
Authors: Alexander Monakov, Arutyun Avetisyan
Venue: Proceedings of the 9th International Workshop on Embedded Computer Systems: Architectures, Modeling, and Simulation (2009)

We discuss implementing blocked sparse matrix-vector multiplication for NVIDIA GPUs. We outline an algorithm and various optimizations, and identify potential future improvements and challenging tasks. In comparison with previously published implementation, our implementation is faster on matrices having many high fill-ratio blocks but slower on matrices with low number of non-zero elements per row.
System Level Performance of Multiuser Diversity in Cooperative Relay Based OFDMA Networks
Authors: Tiankui Zhang, Lin Xiao, Chunyan Feng, Laurie Cuthbert
Venue: Proceedings of the 2009 Second International Conference on Advances in Mesh Networks (2009)

In cooperation relay system, two relay stations transmit cooperatively for the relay link users, and the relay link users receive signal by maximal ratio combining. The traditional multiuser scheduling algorithms, Max C/I algorithm for system throughput maximization and proportional fairness (PF) algorithm for user fairness, are extended into the DF cooperative relay systems. The simulation results show that the Max C/I algorithm obtains great multiuser diversity gain and cooperation diversity gain. In the Max C/I algorithm, deploying more RSs in the cell has a constructive effect on the multiuser diversity. However in PF algorithm, adding more RSs in the cell has an adverse effect on the multiuser diversity. Varying number of users has big impact on the user fairness performance of Max C/I, but the user fairness of PF is mainly affected by the RS number.
FTPA: Supporting Fault-Tolerant Parallel Computing through Parallel Recomputing
Authors: Xuejun Yang, Yunfei Du, Panfeng Wang, Hongyi Fu, Jia Jia
Venue: IEEE Transactions on Parallel and Distributed Systems (2009)

As the size of large-scale computer systems increases, their mean-time-between-failures are becoming significantly shorter than the execution time of many current scientific applications. To complete the execution of scientific applications, they must tolerate hardware failures. Conventional rollback-recovery protocols redo the computation of the crashed process since the last checkpoint on a single processor. As a result, the recovery time of all protocols is no less than the time between the last checkpoint and the crash. In this paper, we propose a new application-level fault-tolerant approach for parallel applications called the Fault-Tolerant Parallel Algorithm (FTPA), which provides fast self-recovery. When fail-stop failures occur and are detected, all surviving processes recompute the workload of failed processes in parallel. FTPA, however, requires the user to be involved in fault tolerance. In order to ease the FTPA implementation, we developed Get it Fault-Tolerant (GiFT), a source-to-source precompiler tool to automate the FTPA implementation. We evaluate the performance of FTPA with parallel matrix multiplication and five kernels of NAS Parallel Benchmarks on a cluster system with 1,024 CPUs. The experimental results show that the performance of FTPA is better than the performance of the traditional checkpointing approach.
A Note on Unambiguity, Finite Ambiguity and Complementation in Recognizable Two-Dimensional Languages
Authors: Marcella Anselmo, Maria Madonia
Venue: Proceedings of the 3rd International Conference on Algebraic Informatics (2009)

The paper deals with some open questions related to unambiguity, finite ambiguity and complementation of two-dimensional recognizable languages. We give partial answers based on the introduction of special classes of languages of "high complexity", in a sense specified in the paper and motivated by some necessary conditions holding for recognizable and unambiguous languages. In the last part of the paper we also show a new necessary condition for recognizable two-dimensional languages on unary alphabet.