ppxscal/embedding_network huggingface dataset:
A Data Dissemination Method for Information Sharing Based on Inter-Vehicle Communication
Authors: Hiroyuki Sago, Masako Shinohara, Takahiro Hara, Shojiro Nishio
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

In an Intelligent Transport System (ITS), information sharing based on inter-vehicle communication is effective for improving data availability. In this paper, we propose a data dissemination method for sharing data items among vehicles, which increases the opportunity for vehicles to acquire more fresh data items that users request. In our proposed method, vehicles are grouped according to their locations, and movement directions are estimated from their route information. Then, data items that are more likely to be accessed in the near future are disseminated between two groups. We also present simulation results to evaluate the performance of our proposed method.
Node-Oriented Modeling and Simulation of IP Networks
Authors: Nanjun Li
Venue: Proceedings of the 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems (2007)

IP networks consist of autonomous nodes that perform routers' and hosts' functionalities. Based on this fact, this paper proposes a node-oriented IP network model and a new packet-level and stochastic discrete event-driven simulator -- Visualized IP Network Simulator. The XML is used to encode node and network topology for scenario. Each individual node is completely autonomous and has its own built-in routing table, queue and service routines. They are distributed in different domains. With respect to the real network addressing and subnetting schemes, VINS enables large-scaled network simulation with complex topology, big node population and crossed IP packet flows. New evaluation methodology emerges in its runtime system report, calculating the performance on node, flow and network levels, providing a better insight into the IP networks.
A study of the performance potential of DHT-based overlays
Authors: Sushant Jain, Ratul Mahajan, David Wetherall
Venue: Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4 (2003)

We use simulation to study whether overlays based on the recent distributed hash tables (DHTs) have the potential to deliver performance comparable to that of overlays based on measurements. Our work is motivated by the use of DHTs for services such as multicast, which is already targeted by measurement-based overlays; there is currently little understanding of how the two approaches compare at scales where both are viable. We compare three DHT-based overlays (CAN, Chord and Pastry) with two measurement-based overlays (Narada and NICE), as well as power-law random graphs (PLRGs) that represent Gnutella. To enable comparisons, we configure the overlays with the same average out-degree and focus on moderate scale. To gauge potential, we look at current and idealized DHT algorithms. We find that basic versions of DHTs have a latency stretch that is at least twice that of NICE and Narada, but similar performance in terms of bandwidth hotspots. However, DHT performance can be improved considerably with routing heuristics and topology-aware overlay construction, which have the potential to bring DHT performance at par with NICE. We also report on performance of overlays with power-law structure and the impact of hierarchy on performance.
Markov Models to Classify M. tuberculosis Spoligotypes
Authors: Georges Valetudie, Jacky Desachy, Christophe Sola
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 01 (2007)

In this paper we use Markov Models to classify automatically spoligotypes. A spoligotype is a sequence of 43 binary values provided by a DNA analysis technique. These methods, robust and well adapted to sequential data, allow us to generate a model on the basis of probabilities, calculated directly on the observations. We use these techniques to create one classifier for each searched class.
From judgment to calculation
Authors: Mike Cooley
Venue: AI Society (2007)

We only regard a system or a process as being &#x201c;scientific&#x201d; if it displays the three predominant characteristics of the natural sciences: predictability, repeatability and quantifiability. This by definition precludes intuition, subjective judgement, tacit knowledge, heuristics, dreams, etc. in other words, those attributes which are peculiarly human. Furthermore, this is resulting in a shift from judgment to calculation giving rise, in some cases, to an abject dependency on the machine and an inability to disagree with the outcome or even question it. To tolerate such a situation could be seen as an abdication of professional responsibility. In complex technological and scientific environments, it is sometimes said that those who make best use of computers already know what the answer is (in ball park terms) before the calculation.
Mining CVS Repositories to Understand Open-Source Project Developer Roles
Authors: Liguo Yu, Srini Ramaswamy
Venue: Proceedings of the Fourth International Workshop on Mining Software Repositories (2007)

This paper presents a model to represent the interactions of distributed open-source software developers and utilizes data mining techniques to derive developer roles. The model is then applied on case studies of two open-source projects, ORAC-DR and Mediawiki with encouraging results.
Building Pervasive Services Using Flock Sensor Network and Flock Container Middleware
Authors: Arne Munch-Ellingsen, Bjorn Thorstensen, Dan Peder Eriksen, Anders Andersen
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

Sensor networks, ad-hoc networking and supporting infrastructure (e.g. middleware) are major building blocks for pervasive computing and pervasive services. Our experience has made it clear that sensor networks, and in particular our flock sensor network, have scarce support for application development needs. To provide for rapid development of pervasive services based on ingested sensor data from sensor networks we have developed both a sensor network and an accompanying infrastructure support (e.g. middleware). The sensor network protocols have been designed to meet the disconnection and power consumption requirements often found as a result of intrinsic properties of mobile sensor networks. Existing (enterprise) middleware platforms have severe limitations for the creation of services that need access to for example the local file system or external/local sensors. The component based programming model imposed by such middleware systems has however proven itself useful for the production of service oriented applications. We have created a container based middleware platform, similar to enterprise middleware systems but without their limitations. This platform makes it easier to create pervasive, service oriented, applications possibly based on data from sensor networks.
Differentiated Quality of Service for e-Commerce Applications through Connection Scheduling based on System-Level Thread Priorities
Authors: Javier Alonso, Jordi Guitart, Jordi Torres
Venue: Proceedings of the 15th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (2007)

The e-commerce web sites receive a great and varied number of visitors every day. These visitors share the application server's limited resources and when there are too many clients connecting to the web site, it is possible that they hinder between them, even to overload the application server. These visitors can be divided in different categories, depending on their importance from site viewpoint. Considering the importance that in these web sites some client connections (e.g. buyers' connections) finish successfully before other connections, in this paper we propose a mechanism to provide different quality of service to the different client categories by assigning different priorities to the threads attending the connections. After observing that Java Thread Priorities are only applied within the JVM, and moreover, these priorities do not reach the O.S. threads, we propose to schedule threads using the Linux Real Time priorities. Our results demonstrate that different quality of service classes can be supported using this mechanism.
It's All News to Me: The Effect of Instruments on Ratings Provision
Authors: Cliff Lampe, R. Kelly Garrett
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

In this paper, we address an issue of design in online rating systems: how many items should be elicited from the ratings provider. Recommender and reputation systems have traditionally relied on single-dimension ratings to reduce user burden, but for some types of information this amount of feedback may be insufficient. We presented users of an online news rating service with different numbers of items in a news rating exercise. We find that users show the highest satisfaction and greatest rating accuracy with a multi-item reviewing instrument.
Inferring Original Traffic Pattern from Sampled Flow Statistics
Authors: Tatsuya Mori, Ryoichi Kawahara, Noriaki Kamiyama, Shigeaki Harada
Venue: Proceedings of the 2007 International Symposium on Applications and the Internet Workshops (2007)

Packet sampling has become a practical and indispensable means to measure flow statistics. Recent studies have demonstrated that analyzing traffic patterns is crucial in detecting network anomalies. We may not be able to infer the original traffic patterns correctly from the sampled flow statistics because sampling process wipes out a lot of information about small flows, which play a vital role in determining the characteristics of traffic patterns. In this paper, we first show an example of how the sampling process wipes out the original statistics using measured data. Then, we show empirical examples indicating that the original traffic pattern cannot be inferred correctly even if we use a statistical inference method for incomplete data, i.e., the EM algorithm, for sampled flow statistics. Finally, we show that additional information about the original flow statistics, the number of unsampled flows, is helpful in tracking the change in original traffic patterns using sampled flow statistics.
A new digital human environment and assessment of vehicle interior design
Authors: Jingzhou Yang, Joo H. Kim, Karim Abdel-Malek, Timothy Marler, Steven Beck, Gregory R. Kopp
Venue: Computer-Aided Design (2007)

Vehicle interior design directly relates to driver performance measures such as comfort, efficiency, risk of injury, and vehicle safety. A digital human is a convenient tool for satisfying the need to reduce the design cycle in order to save time and money. This paper presents a digital human environment, Santos(TM), developed at The University of Iowa, and its assessment as applied to the interior design of a Caterpillar vehicle. The digital human environment involves male models and accommodates a large percentage of the operator population (from the 5th percentile to the 95th percentile). It has a user-friendly interface and includes various tools such as posture prediction, reachability check, zone differentiation, and biomechanics assessment for the upper body and hand. The key difference from a traditional digital human environment is that Santos's environment is optimization-based. This can answer design questions regarding whether the operator can reach relevant controls, what the comfort level is if one can reach the control, and what strength is required of the operator to pull a shift, etc. The illustrative example of a Caterpillar cab is demonstrated using this digital human environment.
Optimizing Parallel Programs Using Affinity Regions
Authors: Bill Appelbe, Batakrishnan Lakshmanan
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 02 (1993)

Afinity regions ensure that a shared processor scheduling, mapping iterations to processors, is used in consecutive parallel loop nests. Using affinity regions can significantly improve locality of reference and hence the performance. This paper discusses the useand effectiveness of affinity regions.
An embedded sinusoidal transform codec with measured phases and sampling rate scalability
Authors: G. Aguilar
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

This paper describes an embedded sinusoidal transform codec that is scalable not only in bit-rate, but also in sampling rate. In a representative implementation, the system produces an embedded bit-stream at 3.2 and 6.4 kbit/s for telephone-bandwidth speech, and scales up to 9.6 kbit/s for 16 kHz sampled wideband speech. The 3.2 kbit/s codec is a sinusoidal transform codec with synthetic phases. The 6.4 kbit/s codec adds resolution to the spectral envelope and transmits measured phases of the eight lowest harmonics. The 9.6 kbit/s codec adds information in the 4 to 8 kHz band to provide higher quality wideband speech.
A constrained minimisation approach to optimise Gabor filters for detecting flaws in woven textiles
Authors: A. Bodnarova
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

Gabor filters have proved to be an effective segmentation and flaw detection tool. This study addresses the issue of an optimal 2-D Gabor filter design for automatically detecting defects in homogeneously textured woven fabrics. The parameters of these filters are derived through an optimisation process performing the minimisation of a Fisher cost function. By constraining some of the Gabor filter parameters to specific values the aim is to optimise the filter to detect a certain type of flaw as it appears in a particular textile background. To account for the potentially large variety of flaw types, the optimal parameters for multiple sets of constraints are computed. The detection outcomes from each set of optimal filters are combined to produce a final classification result. Successful detection results (with low false alarm rates) suggest that this optimal Gabor filter approach is a promising method for automated detection of flaws in homogenous textiles.
Average quantizer adaptation rates for stable ADPCM
Authors: S. Dasgupta
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

This paper gives a sufficient condition on the average rate of quantizer step size adaptation rate that preserves adaptive differential pulse code modulated (ADPCM) stability under the assumption that the predictor is nonadaptive. The result appeals to some new developments in the passivity analysis of linear time varying systems.
Strong accountability for network storage
Authors: Aydan R. Yumerefendi, Jeffrey S. Chase
Venue: Proceedings of the 5th USENIX conference on File and Storage Technologies (2007)

This paper presents the design, implementation, and evaluation of CATS, a network storage service with strong accountability properties. A CATS server annotates read and write responses with evidence of correct execution, and offers audit and challenge interfaces that enable clients to verify that the server is faithful. A faulty server cannot conceal its misbehavior, and evidence of misbehavior is independently verifiable by any participant. CATS clients are also accountable for their actions on the service. A client cannot deny its actions, and the server can prove the impact of those actions on the state views it presented to other clients. Experiments with a CATS prototype evaluate the cost of accountability under a range of conditions and expose the primary factors influencing the level of assurance and the performance of a strongly accountable storage server. The results show that strong accountability is practical for network storage systems in settings with strong identity andmodest degrees of write-sharing. The accountability concepts and techniques used in CATS generalize to a broader class of network services.
An Evolution Model for Software Modularity Assessment
Authors: Yuanfang Cai, Sunny Huynh
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

The value of software design modularity largely lies in the ability to accommodate potential changes. Each modularization technique, such as aspect-oriented programming and object-oriented design patterns, provides one way to let some part of a system change independently of all other parts. A modularization technique benefits a design if the potential changes to the design can be well encapsulated by the technique. In general, questions in software evolution, such as which modularization technique is better and whether it is worthwhile to refactor, should be evaluated against potential changes. In this paper, we present a decision-tree-based framework to generally assess design modularization in terms of its changeability. In this framework, we formalize design evolution questions as decision problems, model software designs and potential changes using augmented constraint networks (ACNs), and represent design modular structure before and after envisioned changes using design structure matrices (DSMs) derived from ACNs. We formalize change impacts using an evolution vector to precisely capture well-known informal design principles. As a preliminary evaluation, we use this model to compare the aspect-oriented and object-oriented observer pattern in terms of their ability to accommodate envisioned changes. The results confirm previous published results, but in formal and quantitative ways.
A customisable memory management framework
Authors: Giuseppe Attardi, Tito Flagella
Venue: Proceedings of the 6th conference on USENIX Sixth C++ Technical Conference - Volume 6 (1994)

Memory management is a critical issue for many large object-oriented applications, but in C++ only explicit memory reclamation through the delete operator is generally available. We analyse different possibilities for memory management in C++ and present a dynamic memory management framework which can be customised to the need of specific applications. The framework allows full integration and coexistence of different memory management techniques. The Customisable Memory Management (CMM) is based on a primary collector which exploits an evolution of Bartlett's mostly copying garbage collector. Specialised collectors can be built for separate memory heaps. A Heap class encapsulates the allocation strategy for each heap. We show how to emulate different garbage collection styles or user-specific memory management techniques. The CMM is implemented in C++ without any special support in the language or the compiler. The techniques used in the CMM are general enough to be applicable also to other languages.
Software Technology Track Introduction
Authors: Rick Kazman, Gul Agha
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

The Software Technology Track consists of thirteen minitracks and one symposium, grouped into six clusters: Human-Computer Interaction, Security, Software Engineering Application Areas, Software Engineering Practices, and Software Engineering Tools and Techniques.
Evaluation of a new assesment scheme for a third-year concurrency course
Authors: Paul Strooper, Larissa Meinicke
Venue: Proceedings of the ninth Australasian conference on Computing education - Volume 66 (2007)

In this paper, we describe and evaluate a change that was made to the assessment scheme for a third-year course on concurrent systems. The original assessment scheme consisted of tutorials, three assignments, and a final examination. The change was motivated by the fact that students often performed poorly, especially on the third assignment, and yet the average mark that they received for this and the other assignments contributed to what we felt were inflated course grades. In the changed scheme, the third assignment was made more complex and open-ended, but it was also made optional in that students can pass the course without having to do this third assignment We evaluated the new assessment scheme by comparing the performance of students on Assignment 3 and the course for the last two years and by analysing the results of a student questionnaire.
Trustworthy remote compiling services for grid-based scientific applications
Authors: Yaohang Li, Daniel Chen, Xiaohong Yuan
Venue: The Journal of Supercomputing (2007)

Grid computing, which is characterized by large-scale sharing and collaboration of dynamic resources, is becoming an emerging computing platform on a global scale for data-intensive and computation-intensive scientific application. However, the complications of large-scale scientific computations and simulations harnessing massive computing resources are compounded by extensive heterogeneity in environments arising from "the Grid." Scientists and engineers lack an intuitive grid-based compilation tool, which has contributed to the difficulty of exploiting these diverse resources and developing their applications on the grid. While manual configuration of various toolkits simplifying the end-to-end completion of a job is adequate for a computational grid with a limited number of nodes, the compilation procedure becomes inefficient for a computational grid with an increasing number of heterogeneous computational service providers. On the other hand, a global-scale computational grid is a potentially untrustworthy computing environment. How to take advantage of the potentially untrustworthy grid resources to provide trustworthy computational services for large-scale scientific applications is another critical issue. In this article, a remote compiling service for a heterogeneous computational grid is developed. In addition to running compilation tasks, the remote compiling service provides security enforcement and validation facilities, including intermediate value checking, secure source program submission, restricted compilation, and binary inspection, to support trustworthy compilation and execution of grid-based scientific applications. Overall, it is expected that our remote compiling services on the grid can tackle the heterogeneity problem of the grid and provide a secure, trustworthy, reliable, and state-of-the-art mechanism to develop grid-aware scientific applications.
Impact of process variations on multicore performance symmetry
Authors: Eric Humenay, David Tarjan, Kevin Skadron
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

Multi-core architectures introduce a new granularity at which process variations may occur, yielding asymmetry among cores that were designed---and that software expects---to be symmetric in performance. The chief source of this phenomenon are highly correlated, "systematic" within-die variations such as optical imperfections yielding variations across the exposure field. Per-core voltages can be used to bring all cores to the same performance level, but this compensation strategy also affects power, chiefly due to leakage power. Boosting a core's frequency may therefore boost its leakage sufficiently to engage thermal throttling. This sets up a tradeoff between static performance asymmetry due to frequency variation versus dynamic performance asymmetry due to thermal throttling. This paper explores the potential magnitude of these effects.