ppxscal/embedding_network huggingface dataset:
Using Lambda Networks to Enhance Performance of Interactive Large Simulations
Authors: Matt Harvey, Shantenu Jha, Mary-Ann Thyveetil, Peter Coveney
Venue: Proceedings of the Second IEEE International Conference on e-Science and Grid Computing (2006)

The ability to use a visualisation tool to steer large simulations provides innovative and novel usage scenarios, e.g. the ability to use new algorithms for the computation of free energy profiles along a nanopore [1]. However, we find that the performance of interactive simulations is sensitive to the quality of service of the network with variable latency and packet loss in particular having a detrimental effect. The use of dedicated networks (provisioned in this case as a circuit-switched, point-to-point optical lightpath or lambda) can lead to significant (50% or more) performance enhancement. When running on say 128 or 256 processors of a high-end supercomputer this saving has a significant value. We perform experiments to understand the impact of network characteristics on the performance of a large parallel classical molecular dynamics simulation when coupled interactively to a remote visualisation tool. This paper discusses the experiments performed and presents the results from the systematic studies.
A High Level Teleoperation Platform for Space Robotic Mission
Authors: Marco Chacin, Eric Rohmer, Andres Mora, Kazuya Yoshida
Venue: Proceedings of the 2nd IEEE International Conference on Space Mission Challenges for Information Technology (2006)

This paper describes the ongoing development of a teleoperation platform for space robotic missions. The proposed platform consists of a ground control station, an offline simulation environment, a full-scale working model of the robot and the actual robot on the mission. From the simulation environment a path strategy is obtained and a set of commands is generated and sent to the ground control station using standardized files (XML) to describe how commands and data move between functional units, this way it is no longer needed to create custom software, and/or distributed objects to communicate with new systems. Instead, only providing an XML description of how the communication takes place will be required. Then the systems can parse and interpret the XML to generate the required commands to control the unit, interface with it, construct messages and display the data that is returned. A software prototype is developed for an asteroid exploration mission to evaluate the proposed platform.
Visualization of Areas of Interest in Component-Based System Architectures
Authors: Heorhiy Byelas, Egor Bondarev, Alexandru Telea
Venue: Proceedings of the 32nd EUROMICRO Conference on Software Engineering and Advanced Applications (2006)

Understanding complex component-based systems often requires getting insight in how certain system properties, such as performance, trust, reliability, or structural attributes, correspond to the actual system architecture. Such properties can be seen as defining several 'areas of interest' over the system architecture. We present an interactive tool that efficiently and effectively combines visual presentation of component-based architectures with that of areas of interest. Our tool helps users investigate how various system properties correlate with each other and correspond to the actual architecture, while preserving the visual architecture layout familiar to designers. We validate our tool and the proposed techniques on a component framework used in the industry.
The role of time in multi-component efficiency analysis: an application
Authors: Alireza Amirteimoori, Reza A. Nashtaei
Venue: Applied Mathematics and Computation (2006)

This paper extends data envelopment analysis (DEA) to measure the progress and regress of a production unit and its sub-units in two periods of time. Frontier shifts outward and inward interpreted as progress and regress are measured here. The proposed approach is applied to a real data set consisting 28 bank branches in Iran.
5th Intl. Workshop on Scenarios and State Machines: Models - Algorithms - and Tools (SCESM)
Authors: Jon Whittle, Leif Geiger, Michael Meisinger
Venue: ACM SIGSOFT Software Engineering Notes (2006)

SCESM'06 was the 5th International Workshop on Scenarios and State Machines: Models, Algorithms and Tools. It was a one day ICSE'06 workshop taking place on May 27, 2006. Details about SCESM'06 may be found at http://ise.gmu.edu/scesm06/.
RTR-Trees for Space Robotics Behavior Simulation and Visualization
Authors: Valery Afanasiev, Dmitry Baigozin, Ilia Kazanski, Sergey Fomin, Stanislav Klimenko
Venue: Proceedings of the 2006 International Conference on Cyberworlds (2006)

New types of trees of structure and linked lists with variable order relations (RTR-trees and RTRlists) are discussed. Using them enables application of the direct kinematic scheme for simulation of 3Dobjects with reorderable structure, making the logic of behavior simulation more natural.
An Intrusion Surveillance System to Detect IRC-based DDoS Attacks
Authors: Yang Xiang, Wanlei Zhou
Venue: Proceedings of the International Multi-Conference on Computing in the Global Information Technology (2006)

Distributed Denial of Service (DDoS) attacks has been a serious threat on security of the current Internet. Recently there is a trend that many DDoS attacks utilize Internet Relay Chat (IRC) infrastructures as the communication channels. In this paper we propose an Intrusion Surveillance System (ISS) to detect IRC-based DDoS attacks. The main functions of ISS are to observe network conditions, gather intelligence from distributed sources, and determine what potential attacks will likely happen. We give the detailed design of ISS in this paper. We also implement this system by using a new approach of textbased decision making - Distributed Preference-Based Surveillance (DPBS) algorithm. By experiments we demonstrate that this distributed algorithm can effectively identify potential IRC-based DDoS attacks based on the information from different locations.
Scaffolding causal, diagnostic reasoning in a case-based learning environment in medicine
Authors: David Jonassen
Venue: Proceedings of the 1996 international conference on Learning sciences (1996)

Medical diagnosis is a critical skill that is usually developed with experience in interacting with, diagnosing, and managing patients. Computerdelivered, case-based learning environments can be developed to provide students with valuable diagnostic experiences prior to dealing with real patients. Diagnostic skill requires physicians to understand and use causal reasoning in order to make predictions. That causal reasoning may be scaffolded in the design of those environments. This paper describes the scaffolding of causal reasoning in making initial diagnoses, determining etiology, and making differential diagnoses in plateletrelated problems.
Simultaneous well-balanced orientations of graphs
Authors: Zoltán Király, Zoltán Szigeti
Venue: Journal of Combinatorial Theory Series B (2006)

Nash-Williams' well-balanced orientation theorem [C.St.J.A. Nash-Williams, On orientations, connectivity and odd-vertex-pairings in finite graphs, Canad. J. Math. 12 (1960) 555-567] is extended for orienting several graphs simultaneously.We prove that if G1,...,Gk are pairwise edge-disjoint subgraphs of a graph G, then G has a well-balanced orientation G→ such that the inherited orientations Gi→ of Gi are well-balanced for all 1 ≤ i ≤ k. We also have new results about simultaneous well-balanced orientations of non-disjoint subgraphs of an Eulerian graph as well as those of different contractions of a graph.
Learning to identify video shots with people based on face detection
Authors: Rong Jin, A. G. Hauptmann
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

We examine how to identify video shots with at least two humans using only detected face information. While face detection is much more reliable than shape based people classification in broadcast video, one particular difficulty is that, when there are several humans in an image, the accuracy of face detection is usually significantly degraded, which leads to poor performance in identifying shots of 'people'. Furthermore, while our standard face detector works from individual still images, we propose using the statistics of face information of images within a whole shot as additional evidence in deciding whether or not a video shot belongs to the 'people' category. Empirically, we studied which statistics of face information are more informative than others and how to combine different statistics together in order to achieve better prediction.
Secrobat: Secure and Robust Component-based Architectures
Authors: Artem Vorobiev, Jun Han
Venue: Proceedings of the XIII Asia Pacific Software Engineering Conference (2006)

Software systems, component-based systems (CBS) in particular, have a lot of vulnerabilities that may be exploited by intruders. Companies spend much time and money to "patch" them up. It is partly due to the fact that a system's security features are often added to the system after its functional requirements have been addressed. As such, system security features are not systematically designed into the system, and consequently the system has inherent security "holes". Therefore, there is a strong need for a systematic engineering approach to developing secure and robust systems, especially distributed systems, by considering functional and security requirements at the same time. In particular, these systems should be highly adaptive and reconfigurable in order to resist different types of attacks and failures. This paper introduces a reference architecture, called Secrobat, for creating secure and robust CBS. It has several key features including defensive components and the adaptive and reconfigurable architecture with the hybrid peer/super-peer structure. The reference architecture is illustrated with an example gaming system.
Predicting component failures at design time
Authors: Adrian Schröter, Thomas Zimmermann, Andreas Zeller
Venue: Proceedings of the 2006 ACM/IEEE international symposium on Empirical software engineering (2006)

How do design decisions impact the quality of the resulting software? In an empirical study of 52 ECLIPSE plug-ins, we found that the software design as well as past failure history, can be used to build models which accurately predict failure-prone components in new programs. Our prediction only requires usage relationships between components, which are typically defined in the design phase; thus, designers can easily explore and assess design alternatives in terms of predicted quality. In the ECLIPSE study, 90% of the 5% most failure-prone components, as predicted by our model from design data, turned out to actually produce failures later; a random guess would have predicted only 33%.
Support Vector Machines Based Active Learning for the Relevance Feedback Document Retrieval
Authors: Takashi Onoda, Hiroshi Murata, Seiji Yamada
Venue: Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology (2006)

This paper describes an application of SVM(Support Vector Machines) to interactive document retrieval using active learning. Some works have been done to apply classification learning like SVM to relevance feedback and obtained successful results. However they did not fully utilize characteristic of example distribution in document retrieval. We propose heuristics to bias document showing according to distribution of examples in document retrieval. This heuristic is executed by selecting examples to show a user in neighbors of positive support vectors, and it improves learning efficiency. We implemented a SVM-based interactive document retrieval system using our proposed heuristic, and compare it with conventional systems like Rocchio-based system and a SVM-based system without the heuristic. We conducted systematic experiments using large data sets including over 500,000 paper articles and confirmed our system outperformed other ones.
Exploiting Locality for Irregular Scientific Codes
Authors: Hwansoo Han
Venue: IEEE Transactions on Parallel and Distributed Systems (2006)

Irregular scientific codes experience poor cache performance due to their irregular memory access patterns. In this paper, we present two new locality improving techniques for irregular scientific codes. Our techniques exploit geometric structures hidden in data access patterns and computation structures. Our new data reordering (Gpart) finds the graph structure within data accesses and applies hierarchical clustering. Quality partitions are constructed quickly by clustering multiple neighbor nodes with priority on nodes with high degree and repeating a few passes. Overhead is kept low by clustering multiple nodes in each pass and considering only edges between partitions. Our new computation reordering (Z-Sort) treats the values of index arrays as coordinates and reorders corresponding computations in Z-curve order. Applied to dense inputs, Z-Sort achieves performance close to data reordering combined with other computation reordering but without the overhead involved in data reordering. Experiments on irregular scientific codes for a variety of meshes show locality optimization techniques are effective for both sequential and parallelized codes, improving performance by 60-87 percent. Gpart achieved within 1-2 percent of the performance of more sophisticated partitioning algorithms, but with one third of the overhead. Z-Sort also yields the performance improvement of 64 percent for dense inputs, which is comparable with data reordering combined with computation reordering.
Better audio performance when video stream is monitored by TCP congestion control
Authors: L. J. Latecki, K. Kulkarni, J. Mulik
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

Conventional wisdom holds that the TCP like congestion control is unsuitable for real-time multimedia conferencing. However, our results clearly show that an audio and video conferencing system that transmits video over TCP (and audio over RTP/UDP) can provide significantly better audio quality to the end user than one built on RTP/UDP alone. We measured audio quality in terms of packet loss, packets arriving too late (for real time play out), average packet delay, and jitter. Our results also clearly indicate that sending video over TCP does not introduce any additional delay in the arrival time of video packets in comparison to RTP/UDP.
Hierarchical Control of Multiple Resources in Distributed Real-time and Embedded Systems
Authors: Nishanth Shankaran, Xenofon D. Koutsoukos, Douglas C. Schmidt, Yuan Xue, Chenyang Lu
Venue: Proceedings of the 18th Euromicro Conference on Real-Time Systems (2006)

There is an increasing demand to introduce adaptive capabilities in distributed real-time and embedded (DRE) systems that execute in open environments where system operational conditions, input workload, and resource availability cannot be characterized accurately a priori. To meet these needs, this paper presents the Hierarchical Distributed Resource-management Architecture (HiDRA), which provides adaptive resource management using control-theoretic techniques that adapt to workload fluctuations and resource availability. In contrast to adaptive control techniques that manage only one type of system resource, HiDRA features a hierarchical control scheme that manages both bandwidth and processor utilization simultaneously. This paper presents three contributions to research in adaptive resource management for DRE systems. First, we describe the structure and functionality of HiDRA. Second, we present an analytical model of HiDRA that formalizes its control theoretic behavior and present analytical performance guarantees. Third, we evaluate the performance of HiDRA via experiments on a representative DRE system that performs distributed target tracking in real-time. Our analytical and empirical results indicate that HiDRA yields predictable, stable, and high system performance, even in the face of changing workload.
A Conceptual Grid Architecture for Interactive Biomedical Applications
Authors: Alfredo Tirado-Ramos, Peter M. A. Sloot
Venue: Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems (2006)

The growing complexity of distributed biomedical application requirements present new challenges to the representation of software architectural analysis and design. This is the case in particular when using Grid infrastructures for supporting interactive biomedical applications. In this paper we present a generic Grid software architecture for biomedicine, where we focus on a conceptual level of architecture design. In this approach, we identify high-level components, their subcomponents and their relationships as required to allow for basic interactivity. We apply our approach to a biomedical application for the simulation of blood flow, within a production Grid framework, and present our conclusions.
Simulation-specific characteristics and software reuse
Authors: Joseph C. Carnahan, Paul F. Reynolds,  Jr., David C. Brogan
Venue: Proceedings of the 37th conference on Winter simulation (2005)

We argue that simulations possess interesting characteristics that facilitate adaptation. Simplifying assumptions, stochastic sampling, and event generation are common features which lend themselves to adaptation for reuse. In this paper, we explore simulation-specific characteristics amenable to adaptation and the ways they can be exploited in support of reuse. Our work is of particular relevance to research in component based simulations and dynamic data driven application systems, where adaptability and reuse are essential.
A Multicarrier CDMA System for Joint Time-Frequency Diversity Using Divided Spreading Sequence
Authors: Hyung-Kun Park
Venue: Wireless Personal Communications: An International Journal (2006)

One of the principal disadvantages of multicarrier modulation technique is the sensitivity to the frequency offset introduced by Doppler shift. This frequency offset introduces inter-carrier interference (ICI) among the multiplicity of carriers in the multicarrier modulated signal. However, Doppler spread induced by temporal channel variations can provides another means for diversity. In this paper, we propose a modified multicarrier code division multiple access (CDMA) system to exploit Doppler diversity as well as multipath diversity. The key work of our framework is a canonical time-frequency-based decomposition of the mobile wireless channel into series of independent fading channel. The decomposition naturally leads to a time-frequency generalization of the Rake receiver that exploits both multipath and Doppler diversity.
The peculiarities of single-electron transport in granular Cr films
Authors: V. A. Krupenin, V. O. Zalunin, A. B. Zorin
Venue: Microelectronic Engineering (2005)

Miniature thin film granular structures had been fabricated by evaporation of chromium in oxygen atmosphere. The samples were 7-8-nm thick and 100-nm wide, while their length was 200, 500 and 1000nm. The specific resistance of these samples measured at room temperature was varied from 15 to 35k@W per square. At temperatures below 200mK, the current-voltage characteristics of the samples were hysteretic, exhibiting abrupt switching between the Coulomb blockade and a conducting state. The size of the current jump occurred near the blockade threshold was found to be from several pA up to about 1nA.
Resource Sharing in EDF-Scheduled Systems: A Closer Look
Authors: Sanjoy K. Baruah
Venue: Proceedings of the 27th IEEE International Real-Time Systems Symposium (2006)

Resource sharing in priority-based systems can give rise to priority-inversion and blocking, wherein a job's execution is delayed because a lower-priority job holds some resource that is needed for execution. The Stack Resource Policy (SRP) can be used to reduce such blocking in EDFscheduled systems. An efficient implementation of an algorithm is presented for determining whether systems scheduled in this manner are feasible. Some interesting properties of such systems are derived. The technique of reducing the duration of blocking by the replication of selected resources is explored: an algorithm is presented which determines the minimum amount of resource replication necessary to achieve specified blocking times.
Self-concept and self-efficacy in mathematics: relation with mathematics motivation and achievement
Authors: Einar M. Skaalvik, Sidsel Skaalvik
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

In two longitudinal studies we examined if mathematics self-perception (self-concept and self-efficacy) predicted subsequent achievement over and above the prediction that could be made by prior achievement. We also tested if the impact of self-perception on subsequent achievement could be explained by students' goal orientation, interest, or self-esteem. Participants were 246 middle school students and 484 high school students in study 1 and 2, respectively. Achievements were indicated by final grades in two successive school years, whereas self-perceptions, interest and goal orientation were measured at the beginning of the second school year. Data were analyzed by means of structural equation modelling. The analyses showed that students' self-perceptions strongly predicted subsequent achievement over and above the prediction that could be made from prior achievement. However, there was no evidence that the effect of self-perception on subsequent achievement was mediated through students' interest, goal orientation, or their self-esteem.
Test Strategies for Cost-Sensitive Decision Trees
Authors: Charles X. Ling Victor S. Sheng Qiang Yang
Venue: IEEE Transactions on Knowledge and Data Engineering (2006)

In medical diagnosis, doctors must often determine what medical tests (e.g., X-ray and blood tests) should be ordered for a patient to minimize the total cost of medical tests and misdiagnosis. In this paper, we design cost-sensitive machine learning algorithms to model this learning and diagnosis process. Medical tests are like attributes in machine learning whose values may be obtained at a cost (attribute cost), and misdiagnoses are like misclassifications which may also incur a cost (misclassification cost). We first propose a lazy decision tree learning algorithm that minimizes the sum of attribute costs and misclassification costs. Then, we design several novel "test strategies” that can request to obtain values of unknown attributes at a cost (similar to doctors' ordering of medical tests at a cost) in order to minimize the total cost for test examples (new patients). These test strategies correspond to different situations in real-world diagnoses. We empirically evaluate these test strategies, and show that they are effective and outperform previous methods. Our results can be readily applied to real-world diagnosis tasks. A case study on heart disease is given throughout the paper.
An initial characterization of engagement in informal social learning around MIT OCW
Authors: David Wiley, Shelley Henson
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

Open Learning Support is a social software system integrated with MIT OpenCourseWare that allows users to find each other in order to ask and answer each other's questions. This paper presents a snapshot of activity within the system eighteen months after launch, utilizing descriptive statistics, social network analysis, and discourse analysis to characterize learner engagement. Future directions for the software based on this analysis are discussed.