ppxscal/embedding_network huggingface dataset:
From datalog rules to efficient programs with time and space guarantees
Authors: Yanhong A. Liu, Scott D. Stoller
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (2009)

This article describes a method for transforming any given set of Datalog rules into an efficient specialized implementation with guaranteed worst-case time and space complexities, and for computing the complexities from the rules. The running time is optimal in the sense that only useful combinations of facts that lead to all hypotheses of a rule being simultaneously true are considered, and each such combination is considered exactly once in constant time. The associated space usage may sometimes be reduced using scheduling optimizations to eliminate some summands in the space usage formula. The transformation is based on a general method for algorithm design that exploits fixed-point computation, incremental maintenance of invariants, and combinations of indexed and linked data structures. We apply the method to a number of analysis problems, some with improved algorithm complexities and all with greatly improved algorithm understanding and greatly simplified complexity analysis.
Division of Labor in Medical Office Practices
Authors: Gregory Dobson, Edieal Pinker, R. Lawrence Van Horn
Venue: Manufacturing Service Operations Management (2009)

This paper examines the staffing, division of labor, and resulting profitability of primary care physician practices. Division of labor is viewed as a mechanism to increase the efficiency of production processes through specialization. At the same time, division of labor also introduces coordination cost as handoffs and communication needs increase. We attempt to empirically assess the net effect in primary care physician offices. We collected data from a sample of these practices and tested two hypotheses: (H1) controlling for staff size, greater delegation through the use of more staff types will decrease the throughput of visits, and (H2) controlling for staff size, income per unit time generated by the practice is decreasing in the number of staff types. We find evidence supporting both hypotheses. We conclude that many physicians are gaining little financial benefit from delegating work to support staff. This suggests that small practices with few staff may be viable alternatives to traditional practice designs.
Energy minimization for heterogeneous wireless sensor networks
Authors: Meikang Qiu, Chun Xue, Zili Shao, Meilin Liu, Edwin H.-M. Sha
Venue: Journal of Embedded Computing (2009)

Lifetime is very important to wireless sensor networks since most sensors are equipped with non-rechargeable batteries. Therefore, energy and delay are critical issues for the research of sensor networks that have limited lifetime. Due to the uncertainties in execution time of some tasks, this paper models each varied execution time as a probabilistic random variable with the consideration of applications' performance requirements to solve the MAP (Mode Assignment with Probability) problem. Using probabilistic design, we propose an optimal algorithm to minimize the total energy consumption while satisfying the timing constraint with a guaranteed confidence probability. The experimental results show that our approach achieves significant energy saving than previous work. For example, our algorithm achieves an average improvement of 32.6% on total energy consumption.
Mobile Broadband - Including WiMAX and LTE, 1st edition
Authors: Mustafa Ergen
Venue:  (2009)

Mobile Broadband: Including WiMAX and LTE provides an overview of IP-OFDMA technology, commencing with cellular and IP technology for the uninitiated while providing a foundation for OFDMA theory and emerging technologies, such as WiMAX, LTE, and beyond. Features include: A coherent and systematic discussion of all aspects of Mobile Broadband Wireless, Thorough information on OFDMA and All-IP Networking with its present technology in 4G, Information to assist industry professionals in understanding the convergence of core access networks, device convergence and service convergence. Throughout the book the author also discusses several wireless standards based on OFDMA such as UMB, IEEE 802.16j (Mobile Multihop Relay) and 802.16m (Gigabit WiMAX), IEEE 802.20 (MBWA), and IEEE 802.22 (Cognitive Radio). The book brings a good balance of theory, technology and practice of mobile broadband.
Demo: HistoryViz --- Visualizing Events and Relations Extracted from Wikipedia
Authors: Ruben Sipoš, Abhijit Bhole, Blaž Fortuna, Marko Grobelnik, Dunja Mladenić
Venue: Proceedings of the 6th European Semantic Web Conference on The Semantic Web: Research and Applications (2009)

HistoryViz provides a new perspective on a certain kind of textual data, in particular the data available in the Wikipedia, where different entities are described and put in historical perspective. Instead of browsing through pages each describing a certain topic, we can look at the relations between entities and events connected with the selected entities. The presented solution implemented in HistoryViz provides user with a graphical interface allowing viewing events concerning the selected person on a timeline and viewing relations to other entities as a graph that can be dynamically expanded.
Scalable directory architecture for distributed shared memory chip multiprocessors
Authors: Huan Fang, Mats Brorsson
Venue: ACM SIGARCH Computer Architecture News (2009)

Traditional Directory-based cache coherence protocol is far from optimal for large-scale cache coherent shared memory multiprocessors due to the increasing latency to access directories stored in DRAM memory. Instead of keeping directories in main memory, we consider distributing the directory together with L2 cache across all nodes on a Chip Multiprocessor. Each node contains a processing unit, a private L1 cache, a slice of L2 cache, memory controller and a router. Both L2 cache and memories are distributed shared and interleaved by a subset of memory address bits. All nodes are interconnected through a low latency two dimensional Mesh network. Directory, being a split component to L2 cache, only stores sharing information for blocks while L2 cache stores only data blocks exclusive with L1 cache. Shared L2 cache can increase total effective cache capacity on chip, but also increase the miss latency when data is on a remote node. Being different from Directory Cache structure, our proposal totally removes the directory from memory, which saves memory space and reduces access latency. Compared to L2 cache that combines directory information internally, our L2 cache structure saves up to 88% cache space and achieves similar performance.
Inference Mechanisms for Knowledge Management System in E-health Environment
Authors: Krzysztof Goczyła, Teresa Grabowska, Wojciech Waloszek, Michał Zawadzki
Venue: Proceeding of the 2005 conference on Software Engineering: Evolution and Emerging Technologies (2005)

The paper presents research and development accomplishments achieved so far during work on a Knowledge Management Subsystem (KMS) for a e-health system called PIPS. The paper presents the Semantic Tools layer of KMS, and concentrates particularly on the PIPS Knowledge Inference Engine (KIE). The following issues are discussed: an analysis of freely available knowledge processors, conformance to existing Semantic Web standards, basics of an algorithm called Cartographer applied in KIE, results of application of KIE based on Cartographer in the PIPS Knowledge Base and perspectives for next stages of the project.
A practical algorithm for finding maximal exact matches in large sequence datasets using sparse suffix arrays
Authors: Zia Khan, Joshua S. Bloom, Leonid Kruglyak, Mona Singh
Venue: Bioinformatics (2009)

Motivation: High-throughput sequencing technologies place ever increasing demands on existing algorithms for sequence analysis. Algorithms for computing maximal exact matches (MEMs) between sequences appear in two contexts where high-throughput sequencing will vastly increase the volume of sequence data: (i) seeding alignments of high-throughput reads for genome assembly and (ii) designating anchor points for genome–genome comparisons. Results: We introduce a new algorithm for finding MEMs. The algorithm leverages a sparse suffix array (SA), a text index that stores every K-th position of the text. In contrast to a full text index that stores every position of the text, a sparse SA occupies much less memory. Even though we use a sparse index, the output of our algorithm is the same as a full text index algorithm as long as the space between the indexed suffixes is not greater than a minimum length of a MEM. By relying on partial matches and additional text scanning between indexed positions, the algorithm trades memory for extra computation. The reduced memory usage makes it possible to determine MEMs between significantly longer sequences. Availability: Source code for the algorithm is available under a BSD open source license at http://compbio.cs.princeton.edu/mems. The implementation can serve as a drop-in replacement for the MEMs algorithm in MUMmer 3. Contact:zkhan@cs.princeton.edu;mona@cs.princeton.edu Supplementary information:Supplementary data are available at Bioinformatics online.
Wifi-reports: improving wireless network selection with collaboration
Authors: Jeffrey Pang, Ben Greenstein, Michael Kaminsky, Damon McCoy, Srinivasan Seshan
Venue: Proceedings of the 7th international conference on Mobile systems, applications, and services (2009)

Wi-Fi clients can obtain much better performance at some commercial hotspots than at others. Unfortunately, there is currently no way for users to determine which hotspot access points (APs) will be sufficient to run their applications before purchasing access. To address this problem, this paper presents Wifi-Reports, a collaborative service that provides Wi-Fi clients with historical information about AP performance and application support. The key research challenge in Wifi-Reports is to obtain accurate user-submitted reports. This is challenging because two conflicting goals must be addressed in a practical system: preserving the privacy of users' reports and limiting fraudulent reports. We introduce a practical cryptographic protocol that achieves both goals, and we address the important engineering challenges in building Wifi-Reports. Using a measurement study of commercial APs in Seattle, we show that Wifi-Reports would improve performance over previous AP selection approaches in 30%-60% of locations.
Physical interaction in pervasive computing: formal modeling, analysis and verification
Authors: Fuyuki Ishikawa, Basem Suleiman, Kayoko Yamamoto, Shinichi Honiden
Venue: Proceedings of the 2009 international conference on Pervasive services (2009)

Application software in pervasive computing is required to control devices embedded in the environment by being aware of the contexts on which effectiveness of the devices depend. Developers face difficulties to enumerate involved physical prerequisites for effective use of devices and undesirable situations to be avoided, as well as define consistent behaviors of the application software. This study provides a theoretical framework for formal modeling of requirements, assumptions and behaviors for application software in pervasive computing. This study specifically focuses on prerequisites for physical (visual, audio, etc.) interactions, which are defined and examined in terms of scopes and their relationships not limited to tree structures. This study also explores analysis and verification based on the formal modeling, using of an existing reasoner.
Formal aspects of classifying and selecting business services
Authors: Yathiraj B. Udupi, Munindar P. Singh
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

This paper uses the term "service" for a service instance, and the term "agent" for an agent who provides or consumes a service. We consider real-life or business services (e.g., business process out-sourcing, software development service involving human experts). We distinguish business from computational (e.g., Web or grid) services based on the fact that business services lack the typical input-output structure of computational services. For example, one can model a temperature service as one that takes a zipcode as input and produces the current temperature as output. By contrast, it would not help to model a software development service as one that takes a "business problem" as input and produces a suite of "software modules" as output. First, it is clearly beyond the scope of current practice to create formal classes or a type system of business problems and software modules. Second, business services are not invoked but are engaged, and would rarely take single-shot inputs and produce single-shot outputs. Third, business service providers would offer a continuum of expertise along which they can provide effective services. For example, a provider who is good at payroll management may also be able to provide retirement plan management, in contrast with the temperature service example above, which has no other function. Fourth, the selection of business services relies on the agents' evaluation of previous engagements.
Interactivity of Exercises in ActiveMath
Authors: Giorgi Goguadze, Alberto Gonzalez Palomo, Erica Melis
Venue: Proceeding of the 2005 conference on Towards Sustainable and Scalable Educational Innovations Informed by the Learning Sciences: Sharing Good Practices of Research, Experimentation and Innovation (2005)

Interactive exercising is one of the major ingredients of technology-enhanced learning. It reaches its full potential only, when appropriate feedback is given to the learner. This paper describes a principled approach for representing and processing interactive exercises in ActiveMath. This approach relies (1) on a modular architecture of the exercise player, (2) on a separation of different types of knowledge that have to be handled to generate feedback, and (3) on a generic representation of interactive exercises.
Collaboration in BitTorrent Systems
Authors: Rafit Izhak-Ratzin
Venue: Proceedings of the 8th International IFIP-TC 6 Networking Conference (2009)

Recent research efforts have shown that the popular BitTorrent protocol does not strictly enforce fairness and allows free-riding, mainly via optimistic unchokes.This paper proposes a BitTorrent-like protocol, that encourages peers of similar upload bandwidth to be buddies-- peers collaborating for mutual benefit. Buddy peers mostly satisfy their download needs through their buddies and perform optimistic unchokes only when absolutely necessary. As a result, the buddy protocol improves fairness via explicit cooperation between buddies, and limits bandwidth spent on random optimistic unchokes, leading to a system more robust against free-riders.We implemented the buddy protocol on top of an existing BitTorrent implementation and ran experiments on a controlled PlanetLab testbed to evaluate its impact. Our results show that the buddy protocol promotes fairness, discourages free-riding, and improves the robustness of the system as compared to regular BitTorrent. It also provides incentives to be adopted by all the peers in the system.
Comirit: Commonsense Reasoning by Integrating Simulation and Logic
Authors: Benjamin Johnston, Mary-Anne Williams
Venue: Proceeding of the 2008 conference on Artificial General Intelligence 2008: Proceedings of the First AGI Conference (2008)

Rich computer simulations or quantitative models can enable an agent to realistically predict real-world behavior with precision and performance that is difficult to emulate in logical formalisms. Unfortunately, such simulations lack the deductive flexibility of techniques such as formal logics and so do not find natural application in the deductive machinery of commonsense or general purpose reasoning systems. This dilemma can, however, be resolved via a hybrid architecture that combines tableaux-based reasoning with a framework for generic simulation based on the concept of 'molecular' models. This combination exploits the complementary strengths of logic and simulation, allowing an agent to build and reason with automatically constructed simulations in a problem-sensitive manner.
Cardiopulmonary exercise testing during body weight supported treadmill exercise in incomplete spinal cord injury: A feasibility study
Authors: Lindsay P. Jack, David B. Allan, Kenneth J. Hunt
Venue: Technology and Health Care (2009)

Body weight supported (BWS) treadmill exercise could potentially improve the cardiopulmonary fitness of those with an incomplete spinal cord injury (SCI). Despite this, methods for estimating key cardiopulmonary performance parameters have not been investigated. We investigated whether new exercise test protocols for BWS treadmill exercise in incomplete SCI enable accurate determination of key cardiopulmonary performance parameters and examined how these parameters change with training. Two subjects with incomplete SCI carried out 20 weeks of BWS treadmill training (BWSTT). They performed an incremental exercise test (IET) and constant load step exercise test (SET) at baseline and 4-week intervals. After training, peak work rate had increased from 1.41 to 9.37 W in subject A and from 6.22 to 43.99 W in subject B. Peak oxygen uptake changed in subject A from 8.23 to 10.19 ml.kg$^{-1}$.min$^{-1}$ and from 13.84 to 13.91 ml.kg$^{-1}$.min$^{-1}$ in subject B. Dynamic O$_{2}$ cost decreased from 115 to 29.03 ml.min$^{-1}$.W$^{-1}$ (subject A) and from 66.57 to 4.52 ml.min$^{-1}$.W$^{-1}$ (subject B). Gas exchange thresholds could not be identified from the IETs. &Vdot;O$_{2}$ kinetics could be identified during only 2 of subject B's SETs. Accurate estimation of key cardiopulmonary performance parameters was limited. The new protocols have the potential to characterise cardiopulmonary status and monitor adaptations to training interventions, but require testing with a larger subject cohort.
Fine-grained subjectivity and sentiment analysis: recognizing the intensity, polarity, and attitudes of private states
Authors: Theresa Ann Wilson
Venue:  (2008)

Private states (mental and emotional states) are part of the information that is conveyed in many forms of discourse. News articles often report emotional responses to news stories; editorials, reviews, and weblogs convey opinions and beliefs. This dissertation investigates the manual and automatic identification of linguistic expressions of private states in a corpus of news documents from the world press. A term for the linguistic expression of private states is subjectivity. The conceptual representation of private states used in this dissertation is that of (Wiebe, Wilson, and Cardie, 2005). As part of this research, annotators are trained to identify expressions of private states and their properties, such as the source and the intensity of the private state. This dissertation then extends the conceptual representation of private states to better model the attitudes and targets of private states. The inter-annotator agreement studies conducted for this dissertation show that the various concepts in the original and extended representation of private states can be reliably annotated. Exploring the automatic recognition of various types of private states is also a large part of this dissertation. Experiments are conducted that focus on three types of fine-grained subjectivity analysis: recognizing the intensity of clauses and sentences, recognizing the contextual polarity of words and phrases, and recognizing the attribution levels where sentiment and arguing attitudes are expressed. Various supervised machine learning algorithms are used to train automatic systems to perform each of these tasks. These experiments result in automatic systems for performing fine-grained subjectivity analysis that significantly outperform baseline systems. Keywords: Subjectivity, Private States, Opinions, Sentiment, Attitudes.
Scheduling Additional Trains on Dense Corridors
Authors: Holger Flier, Thomas Graffagnino, Marc Nunkesser
Venue: Proceedings of the 8th International Symposium on Experimental Algorithms (2009)

Every train schedule entails a certain risk of delay. When adding a new train to an existing timetable, planners have to take the expected risk of delay of the trains into account. Typically, this can be a very laborious task involving detailed simulations. We propose to predict the risk of a planned train using a series of linear regression models on the basis of extensive real world delay data of trains. We show how to integrate these models into a combinatorial shortest path model to compute a set of Pareto optimal train schedules with respect to risk and travel time. We discuss the consequences of different model choices and notions of risk with respect to the algorithmic complexity of the resulting combinatorial problems. Finally, we demonstrate the quality of our models on real world data of Swiss Federal Railways.
VLSI-efficient scheme and FPGA realization for robotic mapping in a dynamic environment
Authors: P. Rajesh Kumar, K. Sridharan
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

This paper presents a new VLSI-efficient algorithm for robotic exploration in a dynamic environment where the geometry of the objects or their motion trajectories are not known a priori. The input to the proposed algorithm is a list of G nodes obtained using the robot's step size and the dimensions of the environment. P nodes accessible to the robot are identified. The time complexity of the proposed algorithm is O(G). Special features of the algorithm include parallel processing of data from multiple ultrasonic sensors and the use of associative memory to efficiently keep track of the visited terrain nodes. A novel architecture based on selective shutdown of hardware modules for reducing energy consumption is proposed. Detailed experiments with a mobile robot fabricated locally with a Xilinx XC2S200E field programmable gate array and eight ultrasonic sensors on-board validate the efficacy of the proposed approach.
Instant InDesign: Designing Templates for Fast and Efficient Page Layout, 1st edition
Authors: Gabriel Powell
Venue:  (2007)

Instant InDesign is the first comprehensive guide to Adobe InDesign that focuses exclusively on the art of template design and production. Youll learn everything you need to knowfrom key design principles and basic template architecture to advanced automation techniques. With practical tips and real-world examples, youll discover how to translate your great ideas into industrial-strength templates. Magazine, newspaper, book, and catalog publishers, as well as ad agencies, graphic design firms, and independent designers can all use this guide to boost productivity and enhance their creative process. Instant InDesign is the best single resource for fast and efficient page layout and production. This comprehensive guide shows you step by step how to: Use the powerful new features in InDesign CS3text variables, frame fitting options, and table stylesto create templates for ads, brochures, books, magazines,catalogs, and more. Make the most of master pages, paragraph and character styles, nested styles, object styles, and table styles to automate formatting. Optimize the use of typography, graphics and images, color, object libraries, and layers in your templates. Work with the new transparency options and nondestructive effects in InDesign CS3. Set up Data Merge and XML-based templates to automate page production. Utilize and modify the templates that ship with InDesign CS3. Use Adobe Bridge to manage your text, image assets, and templates. 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