ppxscal/embedding_network huggingface dataset:
HOBI: Hierarchically Organized Bitmap Index for Indexing Dimensional Data
Authors: Jan Chmiel, Tadeusz Morzy, Robert Wrembel
Venue: Proceedings of the 11th International Conference on Data Warehousing and Knowledge Discovery (2009)

In this paper we propose a hierarchically organized bitmap index (HOBI) for optimizing star queries that filter data and compute aggregates along a dimension hierarchy. HOBI is created on a dimension hierarchy. The index is composed of hierarchically organized bitmap indexes, one bitmap index for one dimension level. It supports range predicates on dimensional values as well as roll-up operations along a dimension hierarchy. HOBI was implemented on top on Oracle10g and evaluated experimentally. Its performance was compared to a native Oracle bitmap join index. Experiments were run on a real dataset, coming from the biggest East-European Internet auction platform Allegro.pl. The experiments show that HOBI offers better star query performance than the native Oracle bitmap join index.
A Crowd Model for Emergency and Panic Situations: Structure, Characteristics and Behaviours
Authors: Mohd Bazli Ab Karim, Abdullah Zawawi Talib, Ahmad Izani Ismail, Bahari Belaton
Venue: Multi-Agent Systems for Society: 8th Pacific Rim International Workshop on Multi-Agents, PRIMA 2005, Kuala Lumpur, Malaysia, September 26-28, 2005, Revised Selected Papers (2009)

We describe a crowd model in emergency and panic situations. First, we describe the crowd structure of our model that comprises a combination of group-based and individual-based agents. This is followed by a description on the agent's characteristics and its behaviours for emergency and panic situations. Detailed descriptions on agent's behaviours including graphical illustrations and pseudo-scripts are also given. Finally, we summarize the paper and discuss the future work on the implementation of the crowd model for emergency and panic situations.
KTR: An Efficient Key Management Scheme for Secure Data Access Control in Wireless Broadcast Services
Authors: Qijun Gu, Liu Peng, Lee Wang-Chien, Chu Chao-Hsien
Venue: IEEE Transactions on Dependable and Secure Computing (2009)

Wireless broadcast is an effective approach for disseminating data to a number of users. To provide secure access to data in wireless broadcast services, symmetric-key-based encryption is used to ensure that only users who own the valid keys can decrypt the data. With regard to various subscriptions, an efficient key management for distributing and changing keys is in great demand for access control in broadcast services. In this paper, we propose an efficient key management scheme, namely, key tree reuse (KTR), to handle key distribution with regard to complex subscription options and user activities. KTR has the following advantages. First, it supports all subscription activities in wireless broadcast services. Second, in KTR, a user only needs to hold one set of keys for all subscribed programs instead of separate sets of keys for each program. Third, KTR identifies the minimum set of keys that must be changed to ensure broadcast security and minimize the rekey cost. Our simulations show that KTR can save about 45 percent of communication overhead in the broadcast channel and about 50 percent of decryption cost for each user compared with logical-key-hierarchy-based approaches.
On GPU's viability as a middleware accelerator
Authors: Samer Al-Kiswany, Abdullah Gharaibeh, Elizeu Santos-Neto, Matei Ripeanu
Venue: Cluster Computing (2009)

Today Graphics Processing Units (GPUs) are a largely underexploited resource on existing desktops and a possible cost-effective enhancement to high-performance systems. To date, most applications that exploit GPUs are specialized scientific applications. Little attention has been paid to harnessing these highly-parallel devices to support more generic functionality at the operating system or middleware level. This study starts from the hypothesis that generic middleware-level techniques that improve distributed system reliability or performance (such as content addressing, erasure coding, or data similarity detection) can be significantly accelerated using GPU support.We take a first step towards validating this hypothesis and we design StoreGPU, a library that accelerates a number of hashing-based middleware primitives popular in distributed storage system implementations. Our evaluation shows that StoreGPU enables up twenty five fold performance gains on synthetic benchmarks as well as on a high-level application: the online similarity detection between large data files.
Stochastic language generation for spoken dialogue systems
Authors: Alice H. Oh, Alexander I. Rudnicky
Venue: Proceedings of the ANLP-NAACL 2000 Workshop on Conversational Systems (2000)

The two current approaches to language generation, template-based and rule-based (linguistic) NLG, have limitations when applied to spoken dialogue systems, in part because they were developed for text generation. In this paper, we propose a new corpus-based approach to natural language generation, specifically designed for spoken dialogue systems.
Network-aware selective job checkpoint and migration to enhance co-allocation in multi-cluster systems
Authors: William M. Jones
Venue: Concurrency and Computation: Practice Experience (2009)

Multi-site parallel job schedulers can improve average job turn-around time by making use of fragmented node resources available throughout the grid. By mapping jobs across potentially many clusters, jobs that would otherwise wait in the queue for local resources can begin execution much earlier; thereby improving system utilization and reducing average queue waiting time. Recent research in this area of scheduling leverages user-provided estimates of job communication characteristics to more effectively partition the job across system resources. In this paper, we address the impact of inaccuracies in these estimates on system performance and show that multi-site scheduling techniques benefit from these estimates, even in the presence of considerable inaccuracy. While these results are encouraging, there are instances where these errors result in poor job scheduling decisions that cause network over-subscription. This situation can lead to significantly degraded application performance and turnaround time. Consequently, we explore the use of job checkpointing, termination, migration, and restart (CTMR) to selectively stop offending jobs to alleviate network congestion and subsequently restart them when (and where) sufficient network resources are available. We then characterize the conditions and the extent to which the process of CTMR improves overall performance. We demonstrate that this technique is beneficial even when the overhead of doing so is costly. Copyright &copy; 2009 John Wiley & Sons, Ltd. This is an extended version of &lsquo;Using Checkpointing to Recover from Poor Multi-site Parallel Job Scheduling Decisions&rsquo; that appeared in the 5th International Workshop on Middleware for Grid Computing, held in conjunction with the 2007ACM-IFIP-USENIX 8th International Middleware Conference, 26 November 2007, [1].
Tangible Drag-and-Drop: Transferring Digital Content with a Remote Control
Authors: Mathieu Hopmann, Daniel Thalmann, Frédéric Vexo
Venue: Proceedings of the 4th International Conference on E-Learning and Games: Learning by Playing. Game-based Education System Design and Development (2009)

Despite the fact that dematerialization of all our multimedia content brings advantages, the absence of physical medium brings also a lack of tangibility. This paper presents a gesture-based interface to bring back tangibility in our dematerialized multimedia content. Our concept is to apply the drag-and-drop paradigm in the real world, using a remote control as a portal between virtual content and physical devices. In order to validate our concept, we designed a prototype focused on the transfer of digital pictures between two different devices: from a TV screen to a digital photo frame. User experiment has proven that our concept brings efficiency, easiness and a natural way to interact with digital multimedia content.
Simulation-Based Discomfort Prediction of the Lower Limb Handicapped with Prosthesis in the Climbing Tasks
Authors: Yan Fu, Shiqi Li, Mingqiang Yin, Yueqing Bian
Venue: Proceedings of the 2nd International Conference on Digital Human Modeling: Held as Part of HCI International 2009 (2009)

This paper generalizes a discomfort model for climbing tasks of the handicapped with prosthesis limb. The model is integrated, by ICT technology, into the simulated task scenario to indicate to what extent the climbing task causes discomfort and to analyze the direct cause of discomfort at the micro-motion level. Furthermore, it can predict the potential harm and accidents in the climbing tasks by calculating the accumulated biomechanical results of joints posture displacement and torque. Meanwhile the research focuses on the analysis on each movement of around the prosthesis socket, which will provide analysis tool for the design of prosthesis from the point of comfort.
Processing MPI Datatypes Outside MPI
Authors: Robert Ross, Robert Latham, William Gropp, Ewing Lusk, Rajeev Thakur
Venue: Proceedings of the 16th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface (2009)

The MPI datatype functionality provides a powerful tool for describing structured memory and file regions in parallel applications, enabling noncontiguous data to be operated on by MPI communication and I/O routines. However, no facilities are provided by the MPI standard to allow users to efficiently manipulate MPI datatypes in their own codes.We present MPITypes, an open source, portable library that enables the construction of efficient MPI datatype processing routines outside the MPI implementation. MPITypes enables programmers who are not MPI implementors to create efficient datatype processing routines. We show the use of MPITypes in three examples: copying data between user buffers and a "pack" buffer, encoding of data in a portable format, and transpacking. Our experimental evaluation shows that the implementation achieves rates comparable to existing MPI implementations.
Research on Method of the Subsection Learning of Double-Layers BP Neural Network in Prediction of Traffic Volume
Authors: Yuming Mao, Shiying Shi
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 03 (2009)

Prediction of traffic volume is the key technology in intelligent transportation systems．BP neural network is universally used in prediction of traffic volume. This research aimed at advancing BP neural network’s precision in prediction of traffic flow. The method of prediction of traffic volume was based on the subsection learning of double-layers BP neural network. The improved method was used to predict the traffic volume of Jingshi Road Jinan City,then compared the results maked by subsection-learning method and by common method. Using subsection-learning method,the average relative tolerance was decreased by 2.52%. The improved BP neural network can be used to predict the traffic volume．
Boosting CBR Agents with Genetic Algorithms
Authors: Beatriz López, Carles Pous, Albert Pla, Pablo Gay
Venue: Proceedings of the 8th International Conference on Case-Based Reasoning: Case-Based Reasoning Research and Development (2009)

In this paper we present a distributed system in which several case-based reasoning (CBR) agents cooperate under a boosting schema. Each CBR agent knows part of the cases (a subset of the available attributes) and is trained with a subset of the available cases (so not all the agents know the same cases). The solution of the system is then computed by means of a weighted average of the solutions provided by the CBR agents. Weights are actively learnt by a genetic algorithm. The system has been applied to a breast cancer application domain. The results show that with our methodology we can improve the results obtained with a case base in which attributes have been manually selected by physicians, saving physicians work in future.
Evaluation Framework towards All Inclusive Mainstream ICT
Authors: Maria Gemou, Evangelos Bekiaris
Venue: Proceedings of the 5th International Conference on Universal Access in Human-Computer Interaction. Addressing Diversity. Part I: Held as Part of HCI International 2009 (2009)

The current paper presents the evaluation framework and plans developed for the evaluation of the applications to be developed in the context of the ÆGIS Integrating Project (Grant Agreement: 224348) of the 7th Framework Programme, which aims to embed support for accessibility through the development of an Open Accessibility Framework, upon which open source accessibility interfaces and applications for the users as well as accessibility toolkits for the developers will be built. Within ÆGIS, three mainstream markets are targeted, namely the desktop, rich Internet applications and mobile devices/applications market segments. Upon the basis of an overall user-centred approach, the developed evaluation framework will involve all types of targeted end-users, namely persons with disabilities as well as experts in Assistive Technology, trainers/tutors and developers as well as a series of other related stakeholders. Evaluation will be held in three iterative phases and across 4 Pilot sites (Belgium, Spain, Sweden and in the UK), providing in-between each phase, feedback to the development teams for debugging and optimization.
Clausal Tableaux for Multimodal Logics of Belief
Authors: Rajeev Goré, Linh Anh Nguyen
Venue: Fundamenta Informaticae (2009)

We develop clausal tableau calculi for six multimodal logics variously designed for reasoning about multi-degree belief, reasoning about distributed systems of belief and for reasoning about epistemic states of agents in multi-agent systems. Our tableau calculi are sound, complete, cut-free and have the analytic superformula property, thereby giving decision procedures for all of these logics. We also use our calculi to obtain complexity results for five of these logics. The complexity of the remaining logic was known.
ν-Types for Effects and Freshness Analysis
Authors: Massimo Bartoletti, Pierpaolo Degano, Gian Luigi Ferrari, Roberto Zunino
Venue: Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing (2009)

We define a type and effect system for a λ-calculus extended with side effects, in the form of primitives for creating and accessing resources. The analysis correctly over-approximates the sequences of resource accesses performed by a program at run-time. To accurately analyse the binding between the creation of a resource and its accesses, our system exploits a new class of types. Our &nu;-types have the form &nu;N. τ H, where the names in N are bound both in the type τ and in the effect H, that represents the sequences of resource accesses.
Straight-Line Rectangular Drawings of Clustered Graphs
Authors: Patrizio Angelini, Fabrizio Frati, Michael Kaufmann
Venue: Proceedings of the 11th International Symposium on Algorithms and Data Structures (2009)

We show that every c-planar clustered graph admits a straight-line c-planar drawing in which each cluster is represented by an axis-parallel rectangle, thus solving a problem posed by Eades, Feng, Lin, and Nagamochi [Algorithmica, 2006].
Simplify Test Requirement Suite Automatically by Adjacency List
Authors: Jianyuan Su, Yun Han, Lingling Wamg, Jianyuan Hao, Xiaojin Kuang, Xin Zhao, Hongyan Liang
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 01 (2009)

Simplifying test requirement suite is helpful for optimizing test case suite, as is proposed in this paper, it bases on adjacency list. Primarily, confirmed the test requirements and generated the initial test case suite according to program flow diagram, then drew the directed graph of relationships of test requirements and its corresponding adjacency list, analyzed its relationships between head-node and linked-list-node, finally simplified the requirements. It is indicated by the example that this algorithm could eliminate the relationships of equivalence and inclusion in test requirements automatically and reserve the mutually exclusive relationships and so on. Correctness and validity are demonstrated by the result of calculation corresponding to the one of manual analysis.
TCP over Multi-Hop Wireless Networks: The Impact of MAC Level Interactions
Authors: Adnan Majeed, Saquib Razak, Nael B. Abu-Ghazaleh, Khaled A. Harras
Venue: Proceedings of the 8th International Conference on Ad-Hoc, Mobile and Wireless Networks (2009)

In Multi Hop Wireless Networks (MHWNs), nodes act both as end-hosts as well as intermediate routers. When communication occurs, these nodes form chains between different sources and destinations. Researchers have studied how these chains behave, discovering that MAC level interactions play a major role in determining their performance. In this paper, we extend this analysis to study how TCP connections, which involve bidirectional flows, behave over wireless chains. First, we break down and examine the types of chains that occur most frequently in TCP configurations and classify them by the nature of the MAC level interactions that arise in each. We then show that the throughput of TCP over a wireless chain is greatly affected by the type of interactions within the chain. Finally, we show the implications of the MAC level interactions on network performance: specifically, route instability and number of retransmissions.
Indefinite-horizon POMDPs with action-based termination
Authors: Eric A. Hansen
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 2 (2007)

For decision-theoretic planning problems with an indefinite horizon, plan execution terminates after a finite number of steps with probability one, but the number of steps until termination (i.e., the horizon) is uncertain and unbounded. In the traditional approach to modeling such problems, called a stochastic shortest-path problem, plan execution terminates when a particular state is reached, typically a goal state. We consider a model in which plan execution terminates when a stopping action is taken. We show that an action-based model of termination has several advantages for partially observable planning problems. It does not require a goal state to be fully observable; it does not require achievement of a goal state to be guaranteed; and it allows a proper policy to be found more easily. This framework allows many partially observable planning problems to be modeled in a more realistic way that does not require an artificial discount factor.
VC-GTS: Virtual Cut-Through GTS Allocation Scheme for Voice Traffic in Multihop IEEE 802.15.4 Systems
Authors: Junwoo Jung, Hoki Baek, Jaesung Lim
Venue: Proceedings of the International Conference on Computational Science and Its Applications: Part II (2009)

Supporting multimedia traffic is one of the major challenges for the next generation of wireless personal area networks (WPANs). Especially, the IEEE 802.15.4 WPAN standards specify how to guarantee real-time traffic with a type of time division multiple access (TDMA), called the guaranteed time slots (GTS). The GTS mechanism has led many researchers to design techniques aiming to support various real-time applications within the delay jitter. Since the IEEE 802.15.4 standards can operate at low data rate up to 250Kbps, it is limited to guarantee real-time multimedia traffic except voice. The voice traffic has bidirectional characteristics and may go through the multihop in WPAN which can support short-range communications among electronic devices. In this paper, we introduce a virtual cut-through GTS allocation mechanism, namely VC-GTS allocation, for voice traffic in multihop IEEE 802.15.4 systems. The proposed scheme can support bidirectional voice traffic and delivery the traffic to the destination through multihop paths with the minimum end-to-end delay time. The most important thing is that our proposed scheme achieves low delay time and packet error rate without a complex allocation algorithm in multihop IEEE 802.15.4 networks. Our simulation results show that our new scheme outperforms the basic IEEE 802.15.4 GTS mechanism.
Identification of Proteins from Tuberculin Purified Protein Derivative (PPD) with Potential for TB Diagnosis Using Bioinformatics Analysis
Authors: Sibele Borsuk, Fabiana Kommling Seixas, Daniela Fernandes Ramos, Caroline Rizzi, Odir Antonio Dellagostin
Venue: Proceedings of the 4th Brazilian Symposium on Bioinformatics: Advances in Bioinformatics and Computational Biology (2009)

The PPD is widely used for diagnosis of bovine tuberculosis, however it lacks specificity and sensitivity, generally attributed the cross-reactions with antigens shared by other Mycobacterium species. These highlight the necessity of better diagnostic tools to detect tuberculosis in cattle. We have identified proteins present in PPD preparations (avium and bovine PPD) by LC-MS/MS (Liquid Chromatography/Mass Spectrometry/Mass Spectrometry). A total of 169 proteins were identified. From these, four PPD proteins identified in bovine PPD and absent in avium PPD (Mb1961c, Mb2898, Mb2900 and Mb2965c) were select for bioinformatics analysis to identify an antigen with potential for TB diagnosis. We identified Mb1961c, a secreted protein, which has low identity proteins found in environmental mycobacteria. This protein could be used for the development of a diagnostic test or a synthetic PPD for bovine tuberculosis.
Enhancing linguistically oriented automatic keyword extraction
Authors: Anette Hulth
Venue: Proceedings of HLT-NAACL 2004: Short Papers on XX (2004)

This paper presents experiments on how the performance of automatic keyword extraction can be improved, as measured by keywords previously assigned by professional indexers. The keyword extraction algorithm consists of three prediction models that are combined to decide what words or sequences of words in the documents are suitable as keywords. The models, in turn, are built using different definitions of what constitutes a term in a written document.
The Lawyer's Guide to Microsoft Excel 2007
Authors: John C. Tredennick
Venue:  (2009)

Designed as a hands-on manual for beginners as well as longtime spreadsheet users, the reader will learn how to build spreadsheets from scratch, use them to analyze issues, and to create graphics presentation. Key lessons include Spreadsheets 101: how to get started for beginners; Advanced Spreadsheets: how to use formulas to calculate values for settlement offers, and damages, business deals; Simple Graphics and Charts: how to make sophisticated charts for the court or to impress your clients; and sorting and filtering data and more. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player