ppxscal/embedding_network huggingface dataset:
Analysing the Impact of Topology Update Strategies on the Performance of a Proactive MANET Routing Protocol
Authors: Yangcheng Huang, Saleem Bhatti, Soren-Aksel Sorensen
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems Workshops (2007)

This paper presents an analysis of several topology update strategies for proactive MANET routing protocols. Although there have been a number of performance studies of proactive MANET routing protocols, little attention has been paid to the impacts of topology update strategies on routing performance. The goal of this paper is to better understand how topology update strategies can contribute to topology maintenance in proactive mobile ad hoc networks and thus impact the overall performance. Our contribution includes (1) a quantitative analysis on the impacts of proactive update intervals on the routing performance; (2) evaluating the performance of reactive topology updates and proactive updates for proactive routing protocols.
GIS model for geothermal resource exploration in Akita and Iwate prefectures, northern Japan
Authors: Younes Noorollahi, Ryuichi Itoi, Hikari Fujii, Toshiaki Tanaka
Venue: Computers Geosciences (2007)

In this study, a Geographic Information System (GIS) is used as a decision-making tool to target potential regional-scale geothermal resources in the Akita and Iwate prefectures of northern Japan. The aims of the study are to determine the relationships between geothermal wells and geological, geochemical, and thermal data layers within the GIS and to use these relationships to identify promising areas for geothermal exploration. We calculated the distances from existing productive geothermal wells to Quaternary volcanic rocks, calderas and craters, faults, hot springs, fumaroles, and hydrothermal alteration zones. The dominant distances were then defined for each evidence layer. We used ArcMap to develop a GIS Model for Geothermal Resource Exploration (GM-GRE) consisting of geoprocessing tools and a modelbuilder. Areas of geothermal potential were defined and prioritized by assigning a weighted overlying selection query for geological, geochemical, and thermal data layers. The result shows that 97% of currently productive geothermal wells in Akita and Iwate prefectures are located within the first priority zone selected by the GM-GRE.
Detecting data races using dynamic escape analysis based on read barrier
Authors: Hiroyasu Nishiyama
Venue: Proceedings of the 3rd conference on Virtual Machine Research And Technology Symposium - Volume 3 (2004)

In multi-threaded programs, a data race results in extremely hard to locate bugs because of its nondeterministic behavior. This paper describes a novel dynamic data race detection method for object-oriented programming languages. The proposed method is based on the lockset algorithm. It uses read-barrier-based dynamic escape analysis for reducing number of memory locations that must be checked at runtime for detecting data races. We implemented the proposed data race detection method in HotSpot Java1 VM. The results of an experimental evaluation show a significant performance improvement over the previous write-barrier-based method and also that the proposed method can perform data race detection with a relatively small runtime overhead.
A Distributed Service Manager for Seamless Service Continuity
Authors: Vincent Verdot, Noel Crespi, Yann Gaste
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

The IT domain has considerably evolved, users are now surrounded with cheaper and more powerful terminals than ever. Mobile and fixed devices connected to high-speed network technologies can bring out for the owners almost any services. But if the technology advances allow the user to enjoy his services more freely and conveniently, are the mobility mechanisms ready to offer a real seamless experience? In this article, we answer this question by analyzing the service management issues and the strength and defaults of existing solutions. From these analysis, we propose a new distributed system that assures the continuity of services by controlling the applications and their resources over the user's devices. This solution brings out new user experiences by considering his devices as a single and coherent system providing services regardless of the device actually hosting them.
Fault-Tolerant Semi-Passive Coordination Protocol for a Multi-Actuator/Multi-Sensor (MAMS) Model
Authors: Keiji Ozaki, Naohiro Hayashibara, Tomoya Enokido, Makoto Takizawa
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

In a wireless sensor and actuator network (WSAN), a group of sensor nodes, actuators, and actuation devices are geographically distributed and linked by wireless networks. Sensor nodes gather information for an event occurring in the physical world and send them to actuators. Actuators perform appropriate actions on actuation devices by making a decision on receipt of sensed values from sensor nodes. Sensor nodes are low cost, low powered devices with limited energy, computation, and wireless communication capabilities. Messages may be lost due to collision and noise and sensor nodes may be faulty. Here, nodes are required to reliably communicate with each other in realtime manner. In order to achieve the reliability, we discuss the multi-actuator/multi-sensor (MAMS) model where each sensor node sends sensed values to multiple actuators and each actuator receives sensed values from multiple sensor nodes in an event area. Even if messages are lost and sensor nodes are faulty, actuators can surely receive sensed values. An actuator makes a decision on what actions to be performed in what order. We discuss a semi-passive coordination (SPC) protocol for multiple actuators to communicate with multiple sensor nodes and perform actions. We evaluate the SPC protocol in terms of the number of messages exchanged among actuators.
Automatic prediction of frustration
Authors: Ashish Kapoor, Winslow Burleson, Rosalind W. Picard
Venue: International Journal of Human-Computer Studies (2007)

Predicting when a person might be frustrated can provide an intelligent system with important information about when to initiate interaction. For example, an automated Learning Companion or Intelligent Tutoring System might use this information to intervene, providing support to the learner who is likely to otherwise quit, while leaving engaged learners free to discover things without interruption. This paper presents the first automated method that assesses, using multiple channels of affect-related information, whether a learner is about to click on a button saying ''I'm frustrated.'' The new method was tested on data gathered from 24 participants using an automated Learning Companion. Their indication of frustration was automatically predicted from the collected data with 79% accuracy (chance=58%). The new assessment method is based on Gaussian process classification and Bayesian inference. Its performance suggests that non-verbal channels carrying affective cues can help provide important information to a system for formulating a more intelligent response.
Modeling Churn in P2P Networks
Authors: Octavio Herrera, Taieb Znati
Venue: Proceedings of the 40th Annual Simulation Symposium (2007)

The objective of this paper is to introduce a model to guide the analysis of the impact of churn in P2P networks. Using this model, a variety of node membership scenarios is created. These scenarios are used to capture and analyze the performance trends of Chord, a distributed hash table (DHT) based resource lookup protocol for Peer-to-peer overlay networks. The performance study focuses both on the performance of routing and content retrieval. This study also identifies the limitations of various churn-alleviating mechanisms, frequently proposed in the literature. The study highlights the importance of the content nature and access pattern on the performance of P2P, DHT-based overlay networks. The results show that the type of content being accessed and the way the content is accessed has a significant impact on the performance of P2P networks.
Analytical modeling methodology for ultrawideband low noise amplifiers with generalized filter-based impedance matching
Authors: Hamid Nejati, Tamer Ragheb, Arthur Nieuwoudt, Yehia Massoud
Venue: Analog Integrated Circuits and Signal Processing (2007)

In this paper, we present a modeling methodology for fully integrated inductively degenerated cascode ultrawideband low noise amplifiers (LNA) with generalized filter-based impedance matching networks. Our accurate analytical models capture the impact of device and passive component parasitics and transistor short channel effects to generate accurate designs. Utilizing our methodology, we are able to accurately generate an ultrawideband LNA in the 3.1---10.6 GHz frequency band using third and fifth order Chebyshev filters as input impedance matching networks. The speed and accuracy of the proposed analytical model will facilitate rapid design space exploration for ultrawideband LNAs.
Perspectives on professionalism in computing
Authors: J. Impagliazzo
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 02 (2000)

Many computing people call themselves professionals without the necessary validation or credentials that other professional groups possess. Perhaps computing needs greater maturity to develop standards of best practices. Even defining the meaning of a computing profession may be difficult. The article explores perspectives on these and related issues.
ULE: a modern scheduler for FreeBSD
Authors: Jeff Roberson
Venue: Proceedings of the BSD Conference 2003 on BSD Conference (2003)

The existing thread scheduler in FreeBSD was well suited towards the computing environment that it was developed in. As the priorities and hardware targets of the project have changed, new features and scheduling properties were required. This paper presents ULE, a scheduler that is designed with modern hardware and requirements in mind. Prior to discussing ULE, the designs of several other schedulers are presented to provide some context for comparison. A simple scheduler profiling tool is also discussed, the results of which provide a basis for making simple comparisons between important aspects of several schedulers.
Resilient connections for SSH and TLS
Authors: Teemu Koponen, Pasi Eronen, Mikko Särelä
Venue: Proceedings of the annual conference on USENIX '06 Annual Technical Conference (2006)

Disconnection of an SSH shell or a secure application session due to network outages or travel is a familiar problem to many Internet users today. In this paper, we extend the SSH and TLS protocols to support resilient connections that can span several sequential TCP connections. The extensions allow sessions to survive both changes in IP addresses and long periods of disconnection. Our design emphasizes deployability in real-world environments, and addresses many of the challenges identified in previous work, including assumptions made about network middleboxes such as firewalls and NATs. We have also implemented the extensions in the OpenSSH and PureTLS software packages and tested them in practice.
Table of Contents HOT Interconnects 12
Venue: Proceedings of the High Performance Interconnects, 2004. on Proceedings. 12th Annual IEEE Symposium (2004)

The following topics are dealt with: high-performance interconnects; buffers; network innovation; parallel computers; network processor security; system level interconnects; PCI Express; distributed shared memory architecture; packet classification and lookup; routers and switches; high-speed optical interconnects; wireless enterprise backbone network architecture; global grid computing; high-bandwidth low-latency communication; Internet infrastructure security. 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
Information flow analysis and enforcement in java bytecode
Authors: Michael Franz
Venue:  (2006)

Information flow analysis policies are more flexible and powerful than currently prevalent discretionary access control(DAC) policies. Current information flow systems are either purely dynamic or static. Pure dynamic systems are overly conservative, as they suffer from label creep due to lack of information about other paths. On the other hand, pure static systems are conservative about runtime values, require source code, and programmer annotations. We propose hybrid information flow analysis, which is more flexible and precise than either pure static or dynamic techniques individually. It leverages the strengths of the two approaches, while mitigating their weaknesses. It statically gathers information and makes it available to the runtime, so that the runtime mechanism can safely contain the label creep while precisely tacking information in current path of execution. The proposed analysis works on Java bytecode, does not require source code or programmer annotations.
Automated response using system-call delays
Authors: Anil Somayaji, Stephanie Forrest
Venue: Proceedings of the 9th conference on USENIX Security Symposium - Volume 9 (2000)

Automated intrusion response is an important unsolved problem in computer security. A system called pH (for process homeostasis) is described which can successfully detect and stop intrusions before the target system is compromised. In its current form, pH monitors every executing process on a computer at the system-call level, and responds to anomalies by either delaying or aborting system calls. The paper presents the rationale for pH, its design and implementation, and a set of initial experimental results.
When not losing is better than winning: Abstraction and refinement for the full μ-calculus
Authors: Orna Grumberg, Martin Lange, Martin Leucker, Sharon Shoham
Venue: Information and Computation (2007)

This work presents a novel game-based approach to abstraction-refinement for the full @m-calculus, interpreted over 3-valued semantics. A novel notion of non-losing strategy is introduced and exploited for refinement. Previous works on refinement in the context of 3-valued semantics require a direct algorithm for solving a 3-valued model checking game. This was necessary in order to have the information needed for refinement available on one game board. In contrast, while still considering a 3-valued model checking game, here we reduce the problem of solving the game to solving two 2-valued model checking (parity) games. In case the result is indefinite (don't know), the corresponding non-losing strategies, when combined, hold all the information needed for refinement. This approach is beneficial since it can use any solver for 2-valued parity games. Thus, it can take advantage of newly developed such algorithms with improved complexity.
High Quality Uniform Random Number Generation Using LUT Optimised State-transition Matrices
Authors: David B. Thomas, Wayne Luk
Venue: Journal of VLSI Signal Processing Systems (2007)

This paper presents a family of uniform random number generators designed for efficient implementation in Lookup table (LUT) based FPGA architectures. A generator with a period of 2 k ¿¿¿1 can be implemented using k flip-flops and k LUTs, and provides k random output bits each cycle. Each generator is based on a binary linear recurrence, with a state-transition matrix designed to make best use of all available LUT inputs in a given FPGA architecture, and to ensure that the critical path between all registers is a single LUT. This class of generator provides a higher sample rate per area than LFSR and Combined Tausworthe generators, and operates at similar or higher clock-rates. The statistical quality of the generators increases with k, and can be used to pass all common empirical tests such as Diehard, Crush and the NIST cryptographic test suite. Theoretical properties such as global equidistribution can also be calculated, and best and average case statistics shown. Due to the large number of random bits generated per cycle these generators can be used as a basis for generators with even higher statistical quality, and an example involving combination through addition is demonstrated.
Evaluation of Optimization Methods for Network Bottleneck Diagnosis
Authors: Alina Beygelzimer, Jeff Kephart, Irina Rish
Venue: Proceedings of the Fourth International Conference on Autonomic Computing (2007)

We consider the problem of localizing network performance bottlenecks and evaluate how various optimization techniques developed for reconstructing link delays perform on this decision problem. We provide some practical suggestions on which approach to use in different scenarios.
H/sub /spl infin// smoothing
Authors: E. Blanco
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

The aim of this article is to build up an estimator robust to noise uncertain properties and unknown initial conditions in an H/sub /spl infin// setting. Hence, a new H/sub /spl infin// approach to state estimation, based on a double treatment of the measurement, is presented. An optimal control based technique is used giving rise to an H/sub /spl infin// smoother. In order to compare its performance to the H/sub 2/ smoother, two simple examples, applied to estimation and deconvolution, are developed. Simulation results show the ability of the presented tool to handle with biased noise properties.
Which security policy for multiplication smart cards?
Authors: Pierre Girard
Venue: Proceedings of the USENIX Workshop on Smartcard Technology on USENIX Workshop on Smartcard Technology (1999)

In this paper, we aim to clarify some issues regarding the deployment context of multiapplicative smart cards. We especially deal with the trust relationships between the involved parties and the resulting constraints from a security point of view. We highlight a new security threat in a multiapplicative context and propose a new multilevel security model which allows to control precisely the information flows inside the card, and to detect illegal data sharing. Finally we illustrate all the proposed concepts on an multiapplicative example involving three applications.
New approaches to audio-visual segmentation of TV news for automatic topic retrieval
Authors: U. Iurgel
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

This paper presents two new real-time approaches to segmentation of TV news shows into topics. The goal of this research work is the high precision retrieval of topics from TV news. For that purpose, the detection of correct topic boundaries is of great importance. We introduce a stochastic and a rule-based topic model based on HMM. The former combines features from the visual as well as from the audio channel of the news show, whereas the latter uses the video channel only. They are compared to the detection of topics using only the audio channel, which is common for many other approaches. The paper contains the following innovations: (1) the detected segment boundaries correspond directly to topics and not to video or audio cuts, as in most other segmentation methods; (2) an advanced stochastic topic model is introduced that uses audio as well as video features; (3) the introduced HMM-based approaches both outperform the audio-based approach. One algorithm has a very good topic boundary detection rate, whereas the other minimizes the number of wrongly inserted boundaries without missing too many real boundaries.
Space-frequency direction finding in wideband and multi-path contexts
Authors: A. Ferreol
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

Over the two last decades, a great number of narrow band direction finding methods have been developed in order to estimate the DOA (directions of arrival) of impinging sources received on an array of sensors. In a radiocommunication context, the signal of each emitter propagates through different multi-path channels. In this context, the emitted signals may have various spectrum characteristics, either narrow-band with normalized frequency channels or wideband such as PN (pseudo noise) spread spectrum signals. In order to take into account these frequency and wideband characteristics we can apply a space-frequency technique as presented by Grenier et al. (1989) and by Buckley (1986) for the DOA estimation. The first purpose of this paper is to adapt these algorithms for correlated sources such as in multi-path propagation channels and the second purpose is to decrease the high computation cost of this new method by simplifying the space-frequency criterion.
build.sh: cross-building NetBSD
Authors: Luke Mewburn, Matthew Green
Venue: Proceedings of the BSD Conference 2003 on BSD Conference (2003)

NetBSD has a cross build infrastructure which allows cross-building of an entire NetBSD release including bootable distribution media. The build process does not require root privileges or writable source directories. The build process works on many POSIX compatible operating systems. This paper explains the changes made to NetBSD to enable this build process, enumerates benefits of the work, and introduces future work enabling cross building of any software for NetBSD.
Segmentation of regions of interest and post-segmentation edge location improvement in computer-aided bone age assessment
Authors: Arkadiusz Gertych, Ewa Pi&#x0119;tka, Brent J. Liu
Venue: Pattern Analysis Applications (2007)

Segmentation of anatomical structures in radiological images is one of the important steps in the computerized approach to the bone age assessment. In this paper a method dealing with correct location of the borders in the epi-metaphyseal regions of interest is described. The well segmented bone structures are obtained utilizing the Gibbs random fields as the first segmentation step; however this method does not prove to be adequate in the correct outline of other tissues in the epi-metaphyseal area. In order to correct delineation of cartilage in this region, the second segmentation step utilizing the active contours serving as a post-segmentation edge location technique is applied. Controlling of tension and bending of the active contour requires a set of weights in the energy functional to be set. To adjust the weights and to initially test the methodology a model of region of interest containing three different anatomical structures corrupted with Gaussian noise has been designed. Combined methodology of Gibbs random fields and active contours with the final set of weights was applied to 200 regions of interest randomly selected from 1100 left hand radiographs. A meaningful improvement in terms of ultimate contour location and smoothing has been observed in regions with cartilage or bone convexity developed near the bottom region of the epiphysis.
Periodic solution for nonautonomous bidirectional associative memory neural networks with impulses
Authors: Zhanji Gui, Xiao-Song Yang, Weigao Ge
Venue: Neurocomputing (2007)

By using the continuation theorem of coincidence degree theory and constructing suitable Lyapunov functions, we study the existence, uniqueness and global exponential stability of periodic solution for nonautonomous bidirectional associative memory (BAM) neural networks with impulsive effect. The results extend earlier ones where impulses are absent. Further the numerical simulation shows that our system can occur in many forms of complexities including periodic oscillation and chaotic strange attractor.