ppxscal/embedding_network huggingface dataset:
Performance Evaluation of Commodity iSCSI-Based Storage Systems
Authors: Dimitrios Xinidis, Angelos Bilas, Michail D. Flouris
Venue: Proceedings of the 22nd IEEE / 13th NASA Goddard Conference on Mass Storage Systems and Technologies (2005)

iSCSI is proposed as a possible solution to building future storage systems. However, using iSCSI raises numerous questions about its implications on system performance. This lack of understanding of system I/O behavior in modern and future systems inhibits providing solutions at the architectural and system levels. Our main goals in this work are to understand the behavior of the application server (iSCSI initiator), to evaluate the overhead introduced by iSCSI compared to systems with directly-attached storage, and to provide insight about how future storage systems may be improved. We examine these questions in the context of commodity iSCSI systems that can benefit most from using iSCSI. We use commodity PCs with several disks as storage nodes and a Gigabit Ethernet network as the storage network. On the application server side we use a broad range of benchmarks and applications to evaluate the impact of iSCSI on application and server performance. We instrument the Linux kernel to provide detailed information about I/O activity and the various overheads of kernel I/O layers. Our analysis reveals how iSCSI affects application performance and shows that building next generation, network-based I/O architectures, requires optimizing I/O latency, reducing network and buffer cache related processing in the host CPU, and increasing the sheer network bandwidth to account for consolidation of different types of traffic.
Alternative venues for computer music: SoundGallery_Living Room_ARTSHIP
Authors: Margaret Anne Schedel
Venue: Organised Sound (2004)

The audience for contemporary classical music is small &ndash; the audience for computer music is even smaller. Traditional concert halls are failing to generate interest in new instrumental music, much less computer music, while museums are having much more success with new art, including art with a technological component. By marketing our music to art galleries and museums, we can reach an audience predisposed to accept the new and unusual in artistic expression. Presenting the works of music outside a traditional proscenium setting also helps shatter any a priori definitions of &lsquo;music&rsquo; audiences may hold. Using the term &lsquo;Sound Art&rsquo; instead of &lsquo;music&rsquo; may also help to free people struggling to appreciate unfamiliar sounds.
The AxML program family for maximum likelihood-based phylogenetic tree inference: Research Articles
Authors: Alexandros P. Stamatakis, Thomas Ludwig, Harald Meier
Venue: Concurrency and Computation: Practice Experience (2004)

Inference of phylogenetic (evolutionary) trees comprising hundreds or thousands of organisms based on the maximum likelihood criterion is a computationally extremely intensive task. This paper describes the evolution of the AxML program family which provides novel algorithmic as well as technical solutions for the maximum likelihood-based inference of huge phylogenetic trees. Algorithmic optimizations and a new tree building algorithm yield runtime improvements of a factor greater than 4 compared with fastDNAml and parallel fastDNAml, returning equally good trees at the same time. Various parallel, distributed, and Grid-based implementations of AxML give the program the capability to acquire the large amount of required computational resources for the inference of huge high-quality trees. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Software for computers with parallel or pipeline architecture (abstract)
Authors: H. Lomax, K. Stevens
Venue: ACM SIGNUM Newsletter (1975)

This paper is addressed to those computer users who have the following interests in common. First, they are engaged in the numerical study of a discipline at a level where they wish to write or to understand critical portions of a computer code written in some high-level or scientific language. Second, the amount of numerical manipulations required in their study is large enough to require highly efficient use of the hardware of a major computer facility in order to prevent a calculation from becoming prohibitively costly. Finally, they are willing to accept the responsibility for making the code efficient, but they wish to minimize the amount of their time spent in doing so. At present it is usually difficult to realize the third of these interests in light of the first two. Big problems point to computers with special architectures, and these are usually difficult to program efficiently without devoting a sizable effort to data storage and data management. This paper explores some strategies that can be useful in reducing this difficulty. All of our examples will involve the solution of partial differential equations in three-dimensions by means of numerical algorithms requiring meshes with rectangular topologies. In all cases these "big problems" are defined to have data bases that are too large to fit in core.
An experimental system for exploring applications of hypertext in workstation environments
Authors: Mary Gawor, Michael Bauer
Venue: ACM SIGSMALL/PC Notes (1990)

Hypertext is a tool which allows machine supported references between pieces of text in a single underlying database. This article outlines the implementation of xhype, a prototype hypertext system developed as a vehicle for exploring different aspects of hypertext systems and for examining different uses for hypertext in workstation environments. The system has been implemented for Sun workstations using the X11 windowing system.
Generation of location-aware services for mobile applications
Authors: Gustavo Rossi, Silvia Gordillo, Robert Laurini
Venue: Proceedings of the 1st French-speaking conference on Mobility and ubiquity computing (2004)

This paper deals with the problem of generating context-aware services for mobile applications. First, we present a discussion about designing problems during the development of software product based on location, by means of a simple scenario, namely a campus. Then a set of design structure is presented, based on the object-oriented model, allowing the adaptation of the behaviour of geographic objects for mobile users. Finally, some final remarks are given. Finalement, quelques remarques finales sont donn&eacute;es.
Investigation of viscous fluid enforced flow within the annulue between coaxial revolving cylinders
Authors: A. U. Sultangazin, K. N. Umbetov
Venue: Mathematics and Computers in Simulation (2004)

The exact solution of Navies-Stock's equations for the case when the investigated flow is of complex structure as a result of overlay of two longitudinal movement flows due to differential pressure along the canal and circular motion of viscous fluid owing to cylinders circulation with some constant angular velocity is developed.
WEB-Based Environment for Programming and Distance Learning
Authors: Dmitry Vazhenin, Alexander Vazhenin, Ying-Hong Wang
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

The paper presents the main elements of the WWW-based Environment supporting development and execution of a big variety of user's applications. The system has universal interface allowing comfortable and unified manipulations with different project data. The system supports different types of the user's projects distinguished according to programming platforms and languages, type of a target machine, user's specialization, etc. We show also Distance Learning Projects considering as teacher/student programming workplaces as well as supporting non-programming courses.
Group management for mobile Ad Hoc networks: design, implementation and experiment
Authors: Jinshan Liu, Daniele Sacchetti, Françoise Sailhan, Valérie Issarny
Venue: Proceedings of the 6th international conference on Mobile data management (2005)

Mobile ad hoc networks (MANET) offer a convenient basis toward realization of pervasive computing, due to its ease of deployment and inherent support for anytime, anywhere network access for mobile users. However, the development of applications over such networks is faced by the challenge of network dynamics attributed to node mobility and the scalability issue. Group management poses as a promising paradigm to ease the development of distributed applications for dynamic, mobile networks. Specifically, group management makes transparent the failures due to node mobility and assembles mobile nodes to meet target functional and non-functional properties. Various network-level grouping schemes over MANET have been investigated over the last couple of years. In this paper, we introduce the design and implementation of a generic group service for MANET, defined with respect to the various attributes of relevance. Generic group management is further demonstrated with its support of scalable service discovery in MANET.
Preliminary Design and Feasibility Study of a 6-Degree of Freedom Robot for Excavation of Unexploded Landmine
Authors: K. Nonami, R. Yuasa, D. Waterman, S. Amano, H. Ono
Venue: Autonomous Robots (2005)

At present, the Sensing and Access Control R D for Humanitarian Mine Action project has been carrying out by the Japan Science and Technology Agency (JST). Chiba University's group join to this project. Our effort is to develop a small vehicle for mine detection and clearance. Specifically we are concerned with the development of a 6 degree-of-freedom robot arm for exposing buried anti-personnel mines, with plans of field-testing in Afghanistan in 2005. This paper describes the current state of development in the anti-personnel mine exposure and clearance system, focusing on the robot arm.
Radio frequency channel modeling for proximity networks on the Martian surface
Authors: Vishwanath Chukkala, Phillip DeLeon, Stephen Horan, Vijayakumar Velusamy
Venue: Computer Networks and ISDN Systems (2005)

NASA's long-term goals for the exploration of Mars include the use of rovers and sensors which communicate through proximity wireless networks. The performance of any such wireless network depends fundamentally on the radio frequency (RF) environment. In order to evaluate and optimize the performance of such a wireless network, a basic understanding or model of the channel is important. In this paper, we present our results concerning the RF environment at selected sites on the surface of Mars with a focus on the link budget and RF coverage patterns. These results take into account the local topography using data from the Mars Global Surveyor, surface reflections, clutter, atmospheric absorption, etc., and contribute to a more accurate RF channel model. We consider a basic wireless network model and demonstrate the possibility for good site coverage and long links despite low antenna heights and radiated power. With such a channel model, mission operators can update elements of the wireless network after deployment with more accurate RF propagation information. Such updates could be used to extend the reach of the network or protect network elements from communication outages due to unforeseen features of the local topography.
Spam, spim, and spit
Authors: Vinton G. Cerf
Venue: Communications of the ACM (2005)

Abolishing spam, and its morphing forms, will take more than public protest and current filtering and legislative quick fixes.
Towards Constant Bandwidth Overhead Integrity Checking of Untrusted Data
Authors: Dwaine Clarke, G. Edward Suh, Blaise Gassend, Ajay Sudan, Marten van Dijk, Srinivas Devadas
Venue: Proceedings of the 2005 IEEE Symposium on Security and Privacy (2005)

We present an adaptive tree-log scheme to improve the performance of checking the integrity of arbitrarily-large untrusted data, when using only a small fixed-sized trusted state. Currently, hash trees are used to check the data. In many systems that use hash trees, programsperform many data operations before performing a critical operation that exports a resultoutside of the program's execution environment. The adaptive tree-log scheme we present uses this observation to harness the power of the constant runtime bandwidth overhead of a log-based scheme. For all programs, the adaptive tree-log scheme's bandwidth overhead is guaranteed to never be worse than a parameterizable worst case bound. Furthermore, for all programs, as the average number of times the program accesses data between critical operations increases, the adaptive tree-log scheme's bandwidth overhead moves from a logarithmic to a constant bandwidth overhead.
Performance analysis of a greedy algorithm for inferring boolean functions
Authors: Daiji Fukagawa, Tatsuya Akutsu
Venue: Information Processing Letters (2005)

We analyzed average case performance of a known greedy algorithm for inference of a Boolean function from positive and negative examples, and gave a proof to an experimental conjecture that the greedy algorithm works optimally with high probability if both input data and the underlying function are generated uniformly at random.
Graph minor hierarchies
Authors: Reinhard Diestel, Daniela Kühn
Venue: Discrete Applied Mathematics (2005)

We generalize tree-decompositions to decompositions modelled on graphs other than trees, and study how such more general decompositions might be used to establish structural complexity hierarchies of graph properties.
Random Subwindows for Robust Image Classification
Authors: Raphael Maree, Pierre Geurts, Justus Piater, Louis Wehenkel
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

We present a novel, generic image classification method based on a recent machine learning algorithm (ensembles of extremely randomized decision trees). Images are classified using randomly extracted subwindows that are suitably normalized to yield robustness to certain image transformations. Our method is evaluated on four very different, publicly available datasets (COIL-100, ZuBuD,ETH-80, WANG). Our results show that our automatic approach is generic and robust to illumination, scale, and viewpoint changes. An extension of the method is proposed to improve its robustness with respect to rotation changes.
Exploring the Energy-Latency Trade-Off for Broadcasts in Energy-Saving Sensor Networks
Authors: Matthew J. Miller, Cigdem Sengul, Indranil Gupta
Venue: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (2005)

Networking protocols for multi-hop wireless sensor networks (WSNs) are required to simultaneously minimize resource usage as well as optimize performance metrics such as latency and reliability. This paper explores the energy-latency-reliability trade-off for broadcast in multi-hop WSNs, by presenting a new protocol called PBBF (Probability-Based Broadcast Forwarding). PBBF works at the MAC layer and can be integrated into any sleep scheduling protocol. For a given application-defined level of reliability for broadcasts, the energy required and latency obtained are found to be inversely related to each other. Our analysis and simulation study quantify this relationship at the reliability boundary, as well as performance numbers to be expected from a deployment. PBBF essentially offers a WSN application designer considerable flexibility in choice of desired operation points.
Control of trajectory for flying round obstacles by the methods of analytical mechanics
Authors: V. N. Anisimov, S. A. Kabanov
Venue: Automation and Remote Control (2005)

Control of trajectory for flying round an obstacle is determined through optimization by the generalized work and a hierarchy of criteria. The methods of analytical mechanics are applied to form real-time controls under given constraints.
Human-centered design of a distributed knowledge management system
Authors: Susan Rinkus, Muhammad Walji, Kathy A. Johnson-Throop, Jane T. Malin, James P. Turley, Jack W. Smith, Jiajie Zhang
Venue: Journal of Biomedical Informatics (2005)

Many healthcare technology projects fail due to the lack of consideration of human issues, such as workflow, organizational change, and usability, during the design and implementation stages of a project's development process. Even when human issues are considered, the consideration is typically on designing better user interfaces. We argue that human-centered computing goes beyond a better user interface: it should include considerations of users, functions and tasks that are fundamental to human-centered computing. From this perspective, we integrated a previously developed human-centered methodology with a Project Design Life-cycle, and we applied this integration in the design of a complex distributed knowledge management system for the Biomedical Engineer (BME) domain in the Mission Control Center at NASA Johnson Space Center. We analyzed this complex system, identified its problems, generated systems requirements, and provided specifications of a replacement prototype for effective organizational memory and knowledge management. We demonstrated the value provided by our human-centered approach and described the unique properties, structures, and processes discovered using this methodology and how they contributed in the design of the prototype.
Information extraction with automatic knowledge expansion
Authors: Hanmin Jung, Eunji Yi, Dongseok Kim, Gary Geunbae Lee
Venue: Information Processing and Management: an International Journal (2005)

POSIE (POSTECH Information Extraction System) is an information extraction system which uses multiple learning strategies, i.e., SmL, user-oriented learning, and separate-context learning, in a question answering framework. POSIE replaces laborious annotation with automatic instance extraction by the SmL from structured Web documents, and places the user at the end of the user-oriented learning cycle. Information extraction as question answering simplifies the extraction procedures for a set of slots. We introduce the techniques verified on the question answering framework, such as domain knowledge and instance rules, into an information extraction problem. To incrementally improve extraction performance, a sequence of the user-oriented learning and the separate-context learning produces context rules and generalizes them in both the learning and extraction phases. Experiments on the "continuing education" domain initially show that the F1-measure becomes 0.477 and recall 0.748 with no user training. However, as the size of the training documents grows, the F1-measure reaches beyond 0.75 with recall 0.772. We also obtain F-measure of about 0.9 for five out of seven slots on "job offering" domain.
Delivering mobile enterprise applications on iMMS framework
Authors: Jun Shen, Pei Sun, Changjie Guo, Ying Yin, Song Song
Venue: Proceedings of the 6th international conference on Mobile data management (2005)

Mobile messaging services like SMS, MMS and wireless instant messaging services have become the major revenue source of the wireless data services. Compared with the online web access model, messaging access is more preferred in the wireless environment because messaging systems work in an asynchronous way and can tolerate intermittent connectivity. Current mobile messaging focuses on consumer applications, e.g., person-to-person communication. To leverage mobile message usage in mobile enterprise applications, iMMS (Interactive Multimedia Messaging Service) is proposed in this paper, which adds interactive features into MMS standard to provide rich and friendly user interface, local interaction and offline operation. In this paper, a message package based programming model is introduced to support interactive messaging application development. A design of an iMMS framework based on this programming model is presented. The architecture of the framework is also discussed. Finally a mobile workflow solution is given to show the implementation of a mobile enterprise application on the framework.
Modelling adaptive multi-agent manufacturing control with discrete event system formalism
Authors: G. Maione, D. Naso
Venue: International Journal of Systems Science (2004)

This paper introduces an approach for modelling and designing multi-agent control architectures for agile manufacturing using a generic formalism based on a system-theoretic discrete event approach. To describe the details of the modelling strategy, we apply the proposed approach to a multi-agent network for job flow control in a manufacturing plant. Two interacting types of autonomous controllers, Part Agents and Machine Agents, are in charge of controlling the part flow and the machine processing sequences. both type of agents are first modelled as atomic discrete event systems and subsequently integrated in the model of the entire network of autonomous controllers. To improve the performance of the network of agents, we introduce a mechanism based on evolutionary algorithms adapting thew agents' decision laws that are encapsulated in agents' states. Through network simulation, the algorithm continuously searches for effective decision laws, consequently adapting agent's behaviour to the current operational conditions of the manufacturing floor. Simulation results show the potentialities of the approach.
2nd international workshop on software engineering for automotive systems
Authors: Christian Salzmann, Thomas Stauner, Alexander Pretschner
Venue: Proceedings of the 27th international conference on Software engineering (2005)

No abstract available
Bayesian Image Segmentation Using Wavelet-Based Priors
Authors: Mario A. T. Figueiredo
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

This paper introduces a formulation which allows using wavelet-based priors for image segmentation. This formulation can be used in supervised, unsupervised, or semi-supervised modes, and with any probabilistic observation model (intensity, multispectral, texture). Our main goal is to exploit the well-known ability of wavelet-based priors to model piece-wise smoothness (which underlies state-of-the-art methods for denoising, coding, and restoration) and the availability of fast algorithms for wavelet-based processing. The main obstacle to using wavelet-based priors for segmentation is that theyýre aimed at representing real values, rather than discrete labels, as needed for segmentation. This difficulty is sidestepped by the introduction of real-valued hidden fields, to which the labels are probabilistically related. These hidden fields, being unconstrained and real-valued, can be given any type of spatial prior, such as one based on wavelets. Under this model, Bayesian MAP segmentation is carried out by a (generalized) EM algorithm. Experiments on synthetic and real data testify for the adequacy of the approach.
2D map-building and localization in outdoor environments
Authors: R. Madhavan, H. F. Durrant-Whyte
Venue: Journal of Robotic Systems (2005)

Determining the pose (position and orientation) of a vehicle at any time is termed localization and is of paramount importance in achieving reliable and robust autonomous navigation. Knowing the pose it is possible to achieve high level tasks such as path planning. A new map-based algorithm for the localization of vehicles operating in harsh outdoor environments is presented in this article. A map building algorithm using observations from a scanning laser rangefinder is developed for building a polyline map that adequately captures the geometry of the environment. Using this map, the Iterative Closest Point (ICP) algorithm is employed for matching laser range images from the rangefinder to the polyline map. Once correspondences are established, an Extended Kalman Filter (EKF) algorithm provides reliable vehicle state estimates using a nonlinear observation model based on the vertices of the polyline map. Data gathered during field trials in an outdoor environment is used to test the efficiency of the proposed ICP-EKF algorithm in achieving the localization of a four-wheel drive (4WD) vehicle. &copy; 2005 Wiley Periodicals, Inc.