ppxscal/embedding_network huggingface dataset:
AAPP: An Anycast Based AODV Routing Protocol for Peer to Peer Services in MANET
Authors: Meng Qi, Ji Hong
Venue: International Journal of Distributed Sensor Networks (2009)

The study of Peer-to-Peer (P2P) network and Mobile Ad hoc Network (MANET) are currently two hotspots in distributed domain. We propose a novel anycast based AODV routing protocol which is a simple and efficient routing protocol designed especially for MANET for P2P applications called AAPP (an Anycast based AODV routing protocol for Peer to Peer services in MANET). AAPP integrate DHT protocol operating in a logical namespace and MANET routing protocol operating in a physical namespace. The key idea of the integration is to bring the Chord protocol to the network layer of MANETs via a one-to-one mapping between the service keys of the mobile nodes providing services and their anycast groupIDs in the namespace. The object of our design is to construct a new type of anycast based AODV model for P2P services, especially for discovery service, information administration service, file sharing service, and communication security. It is assumed that the number of anycast groups is steady in a MANET, so we consider the instance that a node joins or leaves an anycast group. When a mobile node attains a service, such as a file and a particular data, it can share its resource to other nodes and becomes a mobile peer. Whenever a mobile node joins or leaves an anycast group, it originates a request packet and sends it to the network layer. The anycast groupID is updated correspondingly, and broadcasts the information about updating information. In this paper, we have designed an anycast based protocol for P2P application in mobile wireless ad hoc networks based on on-demand routing protocols AODV. We have tested the packets' delivery fraction, average end-to end delay of data packets, and normalized the routing protocol performance of anycast protocols by simulation with OPNET on different traffic models, node mobility models, and connection models. With our novel anycast protocol AAPP, the traffic load can be balanced thus, reducing the transmission delay and increase the route utilization which is better for P2P application. That all the members in one anycast group share one anycast address enables them to take the same priority in the routing searching process. Therefore, this approach can provide the transmission path with the shortest length. With scattering of the anycast server in the geographical area, the traffic load is obviously distributed in the network. All these properties can help to improve the performance of the network.
Computer aided heat penetration tests for the food canning industry
Authors: Paul Sagues
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

If food is to be preserved without refrigeration, drying, or curing of some form, then it must be thermally "processed." The result of processing is a commercially sterile product usually in a hermetically sealed container. Although food may be rendered sterile before it is packaged (the aseptic process), we will focus on the more common practice in which the product is sterilized after it is packaged. We will use the word "can" to represent both the container and the operation of sealing the container even though the words "glass jar" or "composite pouch" may be substituted for the container in most cases.
Social tools and social capital: reading mobile phone usage in rural indigenous communities
Authors: Jolynna Sinanan
Venue: Proceedings of the 20th Australasian Conference on Computer-Human Interaction: Designing for Habitus and Habitat (2008)

This paper will investigate the user behaviour of mobile phones within rural Victorian indigenous communities and will question the extent that theories on exchange and reciprocity as understood in Aboriginal culture resonate in application to the use of communication technologies as well as highlighting the potential value of mobile phones in aiding social and financial communications within the Goulburn Valley region's indigenous peoples (Victoria, Australia). The findings presented are drawn from preliminary research, involving an evaluation study of 'My Moola: Opening Financial Pathways', a non-governmentally funded financial empowerment program involving the indigenous community. While the engagement with communications technologies was minimal in the overall implementation of the program, the everyday use of mobile phones and SMS in the recruitment and retention strategy, as well as the everyday use by the participants of the program, suggest some insightful points that highlight the particular importance of communication technologies to the maintaining and reaffirming bonds of social and community relations within the indigenous context. These theoretically based readings of certain aspects of user behaviour, suggests the need for further, extensive research to gauge a better understanding of how these factors can ultimately be incorporated into technological design and service delivery.
Isomorphic Implication
Authors: Michael Bauland, Edith Hemaspaandra
Venue: Theory of Computing Systems (2008)

We study the isomorphic implication problem for Boolean constraints. We show that this is a natural analog of the subgraph isomorphism problem. We prove that, depending on the set of constraints, this problem is in P, or is NP-complete, or is NP-hard, coNP-hard, and in P&#x2016;NP. We show how to extend the NP-hardness and coNP-hardness to P&#x2016;NP-hardness for some cases, and conjecture that this can be done in all cases.
A note on equitable colorings of forests
Authors: Gerard J. Chang
Venue: European Journal of Combinatorics (2009)

This note gives a short proof on characterizations for a forest to be equitably k-colorable.
Vertical and outboard migration: a progress report
Authors: Andrew Heller, Andries Van Dam
Venue: Proceedings of the May 4-7, 1981, national computer conference (1981)

The primary method for gaining performance improvement on a fixed-hardware architecture is to tailor the soft components, i.e. the application program, the operating system, or the firmware, to the performance requirements. This paper deals with two specific forms of performance tuning called vertical and outboard migration. These terms refer respectively to migrating (pieces of) functions from higher levels to lower levels in a software/firmware/hardware hierarchy and to migrating such functionality to auxiliary processors such as I/O processors which can run in parallel with the CPU to offload it. The performance gains in vertical migration result from the elimination of CPU overhead, while those in outboard migration result from the ability to offload the CPU and have separate (special-purpose) processors execute the migrated code asynchronously and in parallel with CPU execution.
Automatic Bug Detection in Microcontroller Software by Static Program Analysis
Authors: Ansgar Fehnker, Ralf Huuck, Bastian Schlich, Michael Tapp
Venue: Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science (2009)

Microcontroller software typically consists of a few hundred lines of code only, but it is rather different from standard application code. The software is highly hardware and platform specific, and bugs are often a consequence of neglecting subtle specifications of the microcontroller architecture. Currently, there are hardly any tools for analyzing such software automatically. In this paper, we outline specifics of microcontroller software that explain why those programs are different to standard C/C++ code. We develop a static program analysis for a specific microcontroller, in our case the ATmega16, to spot code deficiencies, and integrate it into our generic static analyzer Goanna. Finally, we illustrate the results by a case study of an automotive application. The case study highlights that --- even without formal proof --- the proposed static techniques can be valuable in pinpointing software bugs that are otherwise hard to find.
Haptic ventriculostomy simulation in a grid environment
Authors: H. Çakmak
Venue: Computer Animation and Virtual Worlds (2009)

We present a full featured surgery simulator for endoscopic third ventriculostomy (ETV) in an interactive grid environment. The basic ventriculostomy simulator introduced previously has been extended with new 3D models and animation methods for raising the simulation realism. It enables full haptic interaction with textured deformable models of a hydrocephalic configured human ventricular system derived from MR-data. Visual effects like bleeding in the cerebrospinal fluid (CSF) have been implemented for faulty interactions during training sessions which are recorded in a database for further evaluation. Based on the training data comparative studies were carried out whereas the benefits of virtual reality (VR)-based training have been demonstrated. Furthermore, KisGrid is presented as an interactive grid environment for real-time surgical simulators. It enables collaborative and supervised haptic training over networks with access to remote surgical models and hardware. The grid applet ViCoM is introduced as a tool for audio-visual communication, monitoring, and training session archiving. Long distance tests have been successfully carried out for multicast video conferencing, training session monitoring, and haptic surgical collaboration with deformable models. Copyright &copy; 2009 John Wiley & Sons, Ltd.
Excess false positive rate caused by population stratification and disease rate heterogeneity in case-control association studies
Authors: Zhaohai Li, Hong Zhang, Gang Zheng, Joseph L. Gastwirth, Mitchell H. Gail
Venue: Computational Statistics Data Analysis (2009)

Case-control association studies using unrelated cases and controls may suffer from potential confounding due to population stratification. Bias and variance distortion caused by population stratification in the commonly used allele-based tests can considerably inflate the Type I error rate. It is shown that the bias vanishes in the absence of disease rate heterogeneity. If only population stratification exists, a proper estimate of the variance of the allele-based test statistic is developed. Using this estimated variance yields a valid Type I error. However, when the frequencies of the allele under study and the disease rates differ among the subpopulations, it is difficult to correct for this bias. Explicit expressions for the excess false positive rate (EFPR) of the test due to bias and variance distortion are derived. It turns out that the bias created when both population stratification and disease rate heterogeneity are present usually has a greater effect on the EFPR than variance distortion. Comprehensive simulation studies strongly support these results.
A theory of attrition in computer science education which explores the effect of learning theory, gender, and context
Authors: Tim DeClue
Venue: Journal of Computing Sciences in Colleges (2009)

This paper explores the relationship between how computer science is taught as those methods relate to the use of context, and how the use of context affects learning with regard to gender, motivation, and the retention of undergraduate majors. The idea of contextual learning, called "situated cognition" by learning theorists, is defined and a taxonomy of computer science contexts is presented for the purpose of helping computer science educators increase the quality course instruction. One particular context in the taxonomy, titled "life context," is discussed as an innovative approach to computer science instruction.
Decentralized, Adaptive Coverage Control for Networked Robots
Authors: Mac Schwager, Daniela Rus, Jean-Jacques Slotine
Venue: International Journal of Robotics Research (2009)

A decentralized, adaptive control law is presented to drive a network of mobile robots to an optimal sensing configuration. The control law is adaptive in that it uses sensor measurements to learn the distribution of sensory information in the environment. It is decentralized in that it requires only information local to each robot. The controller is then improved by introducing a consensus algorithm to propagate sensory information from every robot throughout the network. Convergence and consensus of parameters is proven with a Lyapunovtype proof. The controller with and without consensus is demonstrated in numerical simulations. These techniques are suggestive of broader applications of adaptive control methodologies to decentralized control problems in unknown dynamic environments.
The Multiobjective H2/H8/Impulse-to-peak Output-Feedback Control via LMI Optimization
Authors: Mehdi Ghasem Moghadam, Fatemeh Jamshidi, Mohammad. T. H. Beheshti
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

In this paper we formulate a problem of multiobjective dynamic output feedback synthesis for LTI systems which incorporate nominal H2, H∞ and Impulse-to-peak performances. There is as yet no exact solution to this problem. We present a method based on that proposed by Scherer (Scherer et al. 1997). The problem is formulated as a convex semi definite program (SDP) using the LMI formulation of these specifications.
Syntactic Cut-elimination for Common Knowledge
Authors: Kai Brünnler, Thomas Studer
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

We see a cut-free infinitary sequent system for common knowledge. Its sequents are essentially trees and the inference rules apply deeply inside of these trees. This allows to give a syntactic cut-elimination procedure which yields an upper bound of @f"20 on the depth of proofs, where @f is the Veblen function.
Bin Packing of Selfish Items
Authors: Guosong Yu, Guochuan Zhang
Venue: Proceedings of the 4th International Workshop on Internet and Network Economics (2008)

We study a bin packing game in which any item to be packed is handled by a selfish agent. Each agent aims at minimizing his sharing cost with the other items staying in the same bin, where the social cost is the number of bins used. We first show that computing a pure Nash equilibrium can be done in polynomial time. We then prove that the price of anarchy for the game is in between 1.6416 and 1.6575, improving the previous bounds.
Scaling of impervious surface area and vegetation as indicators to urban land surface temperature using satellite data
Authors: X. Zhang, T. Zhong, K. Wang, Z. Cheng
Venue: International Journal of Remote Sensing (2009)

Vegetation and impervious surface as indicators of urban land surface temperature (LST) across a spatial resolution from 30 to 960 m were investigated in this study. Enhanced thematic mapper plus (ETM+) data were used to retrieve LST in Nanjing, China. A land cover map was generated using a decision tree method from IKONOS imagery. Taking the normalized difference vegetation index (NDVI) and percent vegetation area (V) to present vegetated cover, and the normalized difference building index (NDBI) and percent impervious surface area (I) to present impervious surface, the correlation coefficients and linear regression models between the LST and the indicators were simulated. Comparison results indicated that vegetation had stronger correlation with the LST than the impervious surface at 30 and 60 m, a similar magnitude of correlation at 120 and 240 m, and a much lower correlation at 480 and 960 m. In total, the impervious surface area was a slightly better indicator to the LST than the vegetation because all of the correlation coefficients were relatively high (>0.5000) across the spatial resolution from 30 to 960 m. The indicators of LST, V and I are slightly better than the NDVI and NDBI, respectively, based on the correlation coefficients between the LST and the four indices. The strongest correlation of the LST and vegetation at the resolution of 120 m, and the strongest correlation between the LST and impervious surface at 120, 480 and 960 m, denoted the operational scales of LST variations.
A Direct ATM Multicast Service with Quality-of-Service Guarantees
Venue: Proceedings of the 1996 International Conference on Multimedia Computing and Systems (1996)

Multicast has been well tested on non-ATM networks and proven to be a highly effective mode of network service especially in the area of real-time distributed multimedia applications. Although multicast is also supported in ATM, so far the signalling facilities pro vided have been rudimentary at best. This has prevented multicasting to be exploited effectively in ATM network. In this paper, a new scheme in providing ATM based multicast service is described. The proposed scheme does not only provide many-to-many ATM virtual-circuit-level multicast, it also supports dynamic Quality-of-Service (QOS) guarantees with heterogeneous receivers similar to those being proposed by the Internet Protocol (IP). One of the major emphases of the design is to provide a transparent set of common network services for applications to operate across both the proposed VC-based and IP multicast services on the same ATM networks. This is achieved in part by adopting the same Internet resource reservation protocol for the proposed ATM multicast service.In this paper, the various components of the multicast service such as multicast routing, QOS negotiation and connection man agement are presented in detail. Initial experience with a prototype implementation is also discussed. 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
Making Them Remember—Emotional Virtual Characters with Memory
Authors: Zerrin Kasap, Maher Ben Moussa, Parag Chaudhuri, Nadia Magnenat-Thalmann
Venue: IEEE Computer Graphics and Applications (2009)

The search for the perfect virtual character is on, but the moment users interact with characters, any illusion that we've found it is broken. Adding memory capabilities to models of human emotions, personality, and behavior traits is a step toward a more natural interaction style.
Note: Efficient computation of the iteration of functions
Authors: Tsung-Hsi Tsai
Venue: Theoretical Computer Science (2009)

Given a function f from {0,1,...,N-1} to {0,1,...,N-1}, we prove that f^m(x), the mth iterate of f at x, can be computed in time O(logN) for each natural number m and each x by using O(N) information that is generated in a preprocessing procedure. Two types of optimal orbit decompositions of functional graphs are proposed for the preprocess. Both preprocesses require only linear time and linear space. Our decompositions minimize the number of recursions in the computation of f^m(x) and solve some open problems in Tsaban (Discrete Applied Mathematics 155 (2007) 386-393).
Probing the potential of non-verbal group communication
Authors: Petra Sundström, Tove Jaensson, Kristina Höök, Alina Pommeranz
Venue: Proceedings of the ACM 2009 international conference on Supporting group work (2009)

Designing for non-verbal communication using e.g. gestures and other bodily expressions is difficult. Hardware and software need to be co-designed and harmonize in order to not throw users out of their embodied experience. We aim to design for kinaesthetic expressions of emotion in communication between friends - in this case, colleagues at work. A probe was built using sensor node technology designed to let users express themselves and their emotional state to a public and shared display where the expressions together formed a collective art piece expressing the individuals but also the group as a whole. Two groups of colleagues used the probe during two weeks. It came to serve as a channel in which some conflicts and expressions of social relations were acted out which were not openly discussed in the office. It exposed different roles and balances in relationships in the group. Finally, the probe taught us the importance of balancing the design for joint group expression and individual, personal expressions. The study also allowed the participants to experience the sensor node-'material' - enabling a participatory design process.
Architecture-based refinements for secure computer systems design
Authors: Jie Zhou, Jim Alves-Foss
Venue: Proceedings of the 2006 International Conference on Privacy, Security and Trust: Bridge the Gap Between PST Technologies and Business Services (2006)

The successful design and implementation of secure systems must occur from the beginning. A component that must process data at multiple security levels is very critical and must go through additional evaluation to ensure the processing is secure. It is common practice to isolate and separate the processing of data at different levels into different components. In this paper we present architecture-based refinement techniques for the design of multilevel secure systems. We discuss what security requirements must be satisfied through the refinement process, including when separation works and when it does not. The process oriented approach will lead to verified engineering techniques for secure systems, which should greatly reduce the cost of certification of those systems.
Formal Languages and Compilation, 1 edition
Authors: Stefano Crespi Reghizzi
Venue: Texts In Computer Science (2009)

Whereas many textbooks on formal languages and compilation focus on technological aspects, it is the elegance and simplicity of the underlying *theory* that allows students to acquire the fundamental paradigms of language structures, to avoid pitfalls such as ambiguity, and to adequately map structure to meaning. Formal Languages and Compilation covers the fundamental concepts of formal languages and compilation, which are central to computer science and based on well-consolidated principles. It presents a comprehensive selection of topics and is based on rigorous definitions and algorithms, illustrated by many motivating examples, with a focus on the importance of combining theoretical concepts with practical applications. In a clear, reader-friendly and simple minimalist way, this uniquely versatile textbook provides the essential principles and methods used for defining the syntax of artificial languages and implementing simple translators, as well as in designing syntax-directed translators. Readers require some background in programming, although detailed knowledge of a specific programming language is not necessary; they should also be somewhat familiar with basic set theory, algebra and logic. Features and topics: Provides many pedagogical tools, such as slides and solutions for lecturers via the authors website Unifies the concepts and notations used in the various approaches of parsing algorithms Concepts are illustrated with many realistic examples, to ease the understanding of the theory and the transfer to application Theoretical models of automata, transducers and formal grammars are used extensively Algorithms are described in a pseudo-code to avoid the disturbing details of a programming language, yet they are straightforward to convert to executable procedures Coverage of the algorithms for processing regular expressions and finite automata is concise and complete Systematically discusses ambiguous forms allowing readers to avoid pitfalls when designing grammars Unifies the concepts and notations used in different approaches, thus extending methods coverage with a reduced definitional apparatus Introduces static program analysis, moving from the baseline reached with finite automata and local languages This comprehensive and clearly written text, based on many years of course instruction, will be welcomed as the ideal guide to the fundamentals of this field by advanced undergraduate and graduate students in computer science and computer engineering. Stefano Crespi Reghizzi is a full professor of computer science at the Politecnico di Milano, Milan, Italy, where he has numerous years of experience teaching formal languages and compiler technology. In addition, he leads the departments compiler research group.