ppxscal/embedding_network huggingface dataset:
Issues in Developing Ubicomp Applications on Symbian Phones
Authors: Markus Huebscher, Nat Pryce, Naranker Dulay, Peter Thompson
Venue: Proceedings of the International Workshop on System Support for Future Mobile Computing Applications (2006)

Mobile phones have become a truly ubiquitous computer. As such, it makes sense to target the mobile phone as a computing platform on which to deploy ubicomp applications. Yet, mobile phone operating systems were not originally designed for the vision of ubicomp. As a result, it currently takes a great deal of effort to create prototypes of the seemingly simplest ubicomp applications on mobile phones. In this paper, we describe some of the key issues in current Symbian phones that are restraining the development of ubicomp applications. Any developer planning to write ubicomp applications on Symbian phones should keep these issues in mind.
Performance modelling and measurements of TCP transfer throughput in 802.11-based WLAN
Authors: Raffaele Bruno, Marco Conti, Enrico Gregori
Venue: Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems (2006)

The growing popularity of the 802.11 standard for building local wireless networks has generated an extensive literature on the performance modelling of its MAC protocol. However, most of the available studies focus on the throughput analysis in saturation conditions, while very little has been done on investigating the interactions between the 802.11 MAC protocol and closed-loop transport protocols such as TCP. This paper addresses this issue by developing an analytical model to compute the stationary probability distribution of the number of backlogged nodes in a WLAN in the presence of persistent TCP-controlled download and upload data transfers, and embedding the network backlog distribution in the MAC protocol modelling. A large set of experiments conducted in a real network validates the model correctness for a wide range of configurations. A particular emphasis is devoted to investigate and explain the TCP fairness characteristics. Our analytical model and the supporting experimental outcomes demonstrate that using default settings for the capacity of devices' output queues provides a fair allocation of channel bandwidth to the TCP connections, independently of the number of downstream and upstream flows. Furthermore, we show that the TCP total throughput does not degrade by increasing the number of wireless stations.
Rotation of 3D volumes by Fourier-interpolated shears
Authors: Joel S. Welling, William F. Eddy, Terence K. Young
Venue: Graphical Models (2006)

Algorithms for rotation of 2D images by multiple shearing transformations are well known; algorithms which use as few as four shears to perform an arbitrary 3D rotation on a 3D volume have also been described. By using Fourier transform methods to implement these shears, rotations can be performed completely reversibly and without loss of information. This is of great utility when the rotated data are used as input to statistical calculations, for example in human brain imaging. In general, six different patterns of four shears can be used to implement a given 3D rotation. We examine the mathematical and implementation details of these rotation algorithms. This paper provides a classification of these patterns, demonstrates that a consistent scheme must be used to select shear patterns for various rotations, and presents several such consistent schemes.
Using Gaussian distribution to construct fitness functions in genetic programming for multiclass object classification
Authors: Mengjie Zhang, Will Smart
Venue: Pattern Recognition Letters (2006)

This paper describes a new approach to the use of Gaussian distribution in genetic programming (GP) for multiclass object classification problems. Instead of using predefined multiple thresholds to form different regions in the program output space for different classes, this approach uses probabilities of different classes, derived from Gaussian distributions, to construct the fitness function for classification. Two fitness measures, overlap area and weighted distribution distance, have been developed. Rather than using the best evolved program in a population, this approach uses multiple programs and a voting strategy to perform classification. The approach is examined on three multiclass object classification problems of increasing difficulty and compared with a basic GP approach. The results suggest that the new approach is more effective and more efficient than the basic GP approach. Although developed for object classification, this approach is expected to be able to be applied to other classification problems.
Dependability through Assured Reconfiguration in Embedded System Software
Authors: Elisabeth A. Strunk, John C. Knight
Venue: IEEE Transactions on Dependable and Secure Computing (2006)

In many software systems, properties necessary for dependable operation are only a small subset of all desirable system properties. Assuring properties over the simpler subset can provide assurance of critical properties over the entire system. This work provides a method for constructing systems to be dependably reconfigurable. A system's primary function can have less demanding dependability requirements than the overall system because the system can reconfigure to some simpler function. Reconfiguration thus controls the effective complexity of the system without forcing that system to sacrifice desired, but unassurable, capabilities. Focusing a system's dependability argument on reconfiguration means that reconfiguration must proceed correctly with very high assurance. The system construction approach in this work also provides a method through which system dependability properties can be shown. To illustrate the ideas in this work, we have built part of a hypothetical avionics system that is typical of what might be found on an unmanned aerial vehicle.
A Modified Sub-optimal Algorithm for Reducing PAPR of Multicarrier Communication Systems
Authors: Le Hu, Chisheng Li, Guojin Wan
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

In this paper, we present a novel algorithm based on Partial Transmit Sequence (PTS) to reduce the Peak-to-Average Power Ratio (PAPR) of multicarrier communication systems. A sub-optimal phase factor is presented to reduce the PAPR. The proposed scheme the proposed algorithm shows similar PAR reduction performance and low computational complexity as compared to the original exhaustive search approach.
Towards Semantic Query Optimization for XML Databases
Authors: Pongtawat Chippimolchai, Vilas Wuwongse, Chutiporn Anutariya
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

The proposed semantic query optimization framework employs XML Equivalent Transformation Rules (XET rules) as a primary mechanism to transform given queries into semantically equivalent forms that are more efficient. XET rules are prepared from semantic knowledge of databases represented by XML Integrity Constraints. Their applications in the query transformation process are effectively guided by a two-phase heuristic-based optimization strategy and a condition-part-based control strategy.
A two-phase rule generation and optimization approach for wrapper generation
Authors: Yanan Hao, Yanchun Zhang
Venue: Proceedings of the 17th Australasian Database Conference - Volume 49 (2006)

Web information extraction is a fundamental issue for web information management and integrations. A common approach is to use wrappers to extract data from web pages or documents. However, a critical issue for wrapper development is how to generate extraction rules. In this paper, we propose a novel two-phase rule generation and optimization (2P-RULE) approach for wrapper generation. 2P-RULE consists of internal rule optimization (IRO) process and external rule optimization (ERO) process. In IRO, a user, through a GUI interface, firstly creates a mapping from useful values in web page to a schema specified by the users according to target web information. Based on the mapping, the system automatically generates a rule list for the schema. Whereas in ERO, the user can create multiple mappings to generate further rule lists. All the acquired rule lists are merged and refined into one optimized rule list, which is expressed with XQuery as the final extraction rules. Experiments show that our 2P-RULE approach is suitable for extracting information from web pages with complex nested structure, and can also achieve better precision and recall ratio.
Interview with George A. Ojemann
Authors: Staff
Venue: Journal of Cognitive Neuroscience (1999)

George A. Ojemann was born in Iowa City, and received undergraduate and medical degrees from the University of Iowa, and his neurosurgical training at the University of Washington in Seattle. He has been on the faculty of that school ever since, except for a brief period at the National Institutes of Health in Bethesda, MD. He is presently Professor of Neurological Surgery. His clinical interest is in the surgical treatment of epilepsy. In addition to the research interests that are the subject of this interview, he is past chairman of the neurosurgical certifying board, a present member of the neurosurgical training program accrediting body, a member of the NIH Neurological Institute Advisory Council, and the President-Elect of the American Academy of Neurological Surgery. He is also a recipient of an NIH Javitts Award, a Distinguished Alumni citation from the University of Iowa, and an honorary Doctor of Sciences degree from the Medical College of Ohio. His wife is a neurologist with interests in epilepsy, and his two sons are in neurosurgical training programs, while his daughter is in medical school. 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
Component based channel assignment in single radio, multi-channel ad hoc networks
Authors: Ramanuja Vedantham, Sandeep Kakumanu, Sriram Lakshmanan, Raghupathy Sivakumar
Venue: Proceedings of the 12th annual international conference on Mobile computing and networking (2006)

In this paper, we consider the channel assignment problem in single radio multi-channel mobile ad-hoc networks. Specifically, we investigate the granularity of channel assignment decisions that gives the best trade-off in terms of performance and complexity. We present a new granularity for channel assignment that we refer to as component level channel assignment. The strategy is relatively simple, and is characterized by several impressive practical advantages. We also show that the theoretical performance of the component based channel assignment strategy does not lag significantly behind the optimal possible performance, and perhaps more importantly we show that when coupled with its several practical advantages, it significantly outperforms other strategies under most network conditions.
Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Venue: ACM International Conference Proceeding Series; Vol. 180 (2006)

We are very pleased to welcome you all to ValueTools 2006 in the beautiful town of Pisa. Since this is the first edition of ValueTools, we believe it is important to explain its origins.Our goal is to bring together colleagues to discuss innovative performance evaluation methodologies and associated tools. The conference is targeted at methodologies and tools rather than at specific solved problems, the latter being the focus of existing conferences.A rich collection of methodologies and tools have been developed and enhanced by various communities (mainly in computer science, communications and control, operations research, statisticians and mathematics), who publish their ideas and findings in different specialized journals and attend different conferences. A goal of this conference is to build bridges between these communities that often operate in closed groups, with little opportunity for interaction and cross-fertilization.More than a year ago we began to organize the ValueTools conference to meet the following goals:1. Debate emerging performance evaluation methodologies, and promote cross fertilization among the designers of analytic and simulation methodologies.2. Harness proposals for new performance evaluation methodologies and associated tools to enable practitioners in various fields3. Establish a cooperative connection between industry and academia aimed at reducing the time from conception to implementation of new methodologies.The ValuteTools conference and five workshops are organized with these goals in mind. The keynote speech will be presented by Professor Peter Glynn, a distinguished researcher on simulation and stochastic models. A range of invited sessions are organized with talks by leading experts from a range of backgrounds. The contributed talks contain an equally impressive range of methodologies. A panel will facilitate debate on these topics.Although this is the first edition, over 120 papers from 33 different countries were submitted, and approximately 60 were selected for presentation at ValueTools. Of these sixty papers, a small number of particular merit were selected for Performance Evaluation and J.DEDS.The high number and quality of submitted papers has confirmed our conviction that ValueTools and its workshops have responded to a real need in the scientific community. In response, we have already begun organizing ValueTools 2007 to be held in France next year. We envisage a long and productive life for ValueTools.
Managing ontologies for grid computing
Authors: M. Cannataro, P. H. Guzzi, T. Mazza, G. Tradigo, P. Veltri
Venue: Multiagent and Grid Systems (2006)

Semantic Grid applications based on the cooperation of Grid Services need semantic modeling tools and functions to access and manage ontologies stored on the Grid. Although many tools and methodologies exist for ontology editing and management, they often work in a centralized way and are not available on the Grid. The paper proposes a distributed ontology management framework where ontology schema is replicated and instances are distributed among nodes of the Grid. A distributed ontology kernel that offers querying and updating APIs and a graphical query interface for ontology browsing have been fully designed. The kernel leverages distributed data management functions offered by the Grid middleware to store and access ontology fragments. It has been embedded into an ontology-based workflow editor allowing distributed users to design and execute bioinformatics applications. Domain ontologies, partitioned and managed by the ontology kernel, are accessed by the editor enhancing workflow composition. The ontology distribution allows to design a complete application whatever availability of Grid nodes.
Tractable negotiation in tree-structured domains
Authors: Yann Chevaleyre, Ulle Endriss, Nicolas Maudet
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

Multiagent resource allocation is a timely and exciting area of research at the interface of Computer Science and Economics. One of the main challenges in this area is the high complexity of negotiation. In particular, the complexity of the task of identifying rational deals, i.e. deals that are beneficial for all participants, often hinders the successful transfer of theoretical results to practical applications. To address this issue, we propose several protocols designed to tame the complexity of negotiation by exploiting structural properties of the utility functions used by agents to model their preferences over alternative bundles of resources. In particular, we consider domains where utility functions are k-additive (that is, synergies between different resources are restricted to bundles of at most k items) and tree-structured in the sense that the bundles for which there are synergies do not overlap. We show how protocols exploiting these properties can allow for drastically simplified negotiation processes.
Proceedings of the 2007 ACM SIGPLAN international workshop on Types in languages design and implementation
Venue: Types In Languages Design And Implementation (2007)

It is our great pleasure to welcome you to the third ACM SIGPLAN Workshop on Types in Language Design and Implementation -- TLDI'07. The TLDI workshops are a continuation of the Types in Compilation -- TIC workshops, the first of which was held in 1997. This series of workshops brings together researchers from the many areas influenced by types and proofs. The role of types and proofs in all aspects of language design, compiler construction, and software development has expanded greatly in recent years. Type systems, type analyses, and formal deduction have led to new concepts in compilation techniques for modern programming languages, verification of safety and security properties of programs, program transformation and optimization, and many other areas. The mission of these workshops is to bring together researchers in all these areas to share novel ideas and stimulate interaction and discussion on the ever expanding use of types.The call for papers attracted 12 submissions from Asia, Europe, and the United States. The program committee accepted 6 papers that cover a variety of topics, such as type inference, types for intermediate and low-level languages, and program analysis.
Learning Gene Network Using Conditional Dependence
Authors: Tie-Fei Liu, Wing-Kin Sung
Venue: Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence (2006)

Gene network, conventionally, is learned by studying the pairwise correlation of the microarray expression profiles of different genes. This approach, however, is reported to be effective only for learning a small portion of the regulatory pairs due to the complexity of the gene regulatory system. In this paper, through studying the conditional dependence of the gene expression profiles, a new algorithm, Conditional Dependence Learning algorithm, is proposed which considers three additional factors: (1) the collaboration among regulators, (2) the formation of regulatory complex, and (3) the variable time delay to learn the gene network. Experiments on both artificial and real-life gene expression datasets validate the goodness of the algorithm.
Functional Anatomy of High-Resolution Visual Mental Imagery
Authors: E. Mellet, N. Tzourio-mazoyer, S. Bricogne, B. Mazoyer, S. M. Kosslyn, M. Denis
Venue: Journal of Cognitive Neuroscience (2000)

This study had two purposes. First, in order to address the controversy regarding activation of the primary visual area (PVA) during visual mental imagery, regional cerebral blood flow (rCBF) was recorded while subjects performed a task that required high-resolution visual mental imagery. Second, in order to discover whether verbal descriptions can engage visual mechanisms during imagery in the same way as visual stimuli, subjects memorized 3D scenes that were visually presented or were based on a verbal description. Comparison of the results from the imagery conditions to a non-imagery baseline condition revealed no activation in PVA for imagery based on a verbal description and a significant decrease of rCBF in this region for imagery based on visual learning. The pattern of activation in other regions was very similar in the two conditions, including parietal, midbrain, cerebellar, prefrontal, left insular, and right inferior temporal regions. These results provide strong evidence that imagery based on verbal descriptions can recruit regions known to be engaged in high-order visual processing.
Mobile Technologies and the Value Chain: Participants, Activities and Value Creation
Authors: Constantinos Coursaris, Khaled Hassanein, Milena Head
Venue: Proceedings of the International Conference on Mobile Business (2006)

Mobile business (m-Business) has the potential to provide value to the modern organization throughout its primary and support activities, by enhancing the many types of interactions that take place between employees, customers and systems. This paper presents a business-centric model of mobile interactions and further explores these interactions across organizational activities within the framework of Porter's value chain. Several illustrative real-world examples are outlined to demonstrate how mobile technologies are deployed within organizations. Finally, a discussion is provided for the expected benefits and relevant concerns of using mobile technologies within organizations.
Mobile and Ubiquitous Objects
Authors: Anthony D. Joseph, Almudena Diaz, Pedro Merino, F. Javier Rivas, Umakant P. Kulkarni, J. V. Vadavi, G. S. Thyagaraju, S. M. Joshi, A. R. Yardi
Venue: IEEE Pervasive Computing (2006)

This Works in Progress department discusses the University of Malaga's work in developing software tools to assist testing and debugging communication-intensive mobile applications. It also discusses two projects by a research group from the SDM College of Engineering and Technology and the Walchand College of Engineering and Technology. The group is researching creating a model to combat security risks and access-control problems associated with ubiquitous objects and developing a protocol to facilitate communication between various objects. This department is part of a special issue on Real-World Deployments.
Left Inferior Prefrontal Cortex Activity Reflects Inhibitory Rather Than Facilitatory Priming
Authors: Eileen R. Cardillo, Jennifer Aydelott, Paul M. Matthews, Joseph T. Devlin
Venue: Journal of Cognitive Neuroscience (2004)

Functional neuroimaging has demonstrated reduced activation correlated with behavioral priming effects, a finding generally interpreted in terms of facilitated retrieval of target items in the context of related primes. Without a neutral prime, however, one cannot separate facilitatory effects of related primes from inhibitory effects of unrelated primes. Here we report an auditory semantic priming paradigm with congruent (''The boy bounced the BALL''), neutral (''The next item is BALL''), and incongruent (''Pasta is my favorite kind of BALL'') sentence trials. As previously reported, reduced left inferior prefrontal cortex activation was observed for congruent relative to incongruent trials; however, the neutral condition allowed us to show that the effect arose from increased activation in the incongruent condition rather than reduced activation for congruent trials. Our results suggest that the left inferior prefrontal cortex inhibits interference from prepotent representations in order to select a task-appropriate target, and is consistent with its broader role in behavioral inhibition.