ppxscal/embedding_network huggingface dataset:
Automatic synthesis of fault-tolerance
Authors: Sandeep S. Kulkarni
Venue:  (2005)

Fault-tolerance is an important property of today's software systems as we rely on computers in our daily affairs (e.g., medical equipments, transportation systems, etc). Since it is difficult (if not impossible) to anticipate all classes of faults that perturb a program while designing that program, it is desirable to incrementally add fault-tolerance concerns to an existing program as we encounter new classes of faults. Hence, in this dissertation, we concentrate on automatic addition of fault-tolerance to (distributed) programs; i.e., synthesizing fault-tolerant programs from their fault-intolerant version. The main contributions of the dissertation regarding theoretical aspects are as follows: (1) We identify the effect of safety specification modeling on the complexity of synthesizing fault-tolerant programs from their fault-intolerant version. (2) We show the NP-completeness of synthesizing failsafe fault-tolerant distributed programs from their fault-intolerant version. (3) We identify the sufficient conditions for polynomial-time synthesis of failsafe fault-tolerant distributed programs. (4) We design a sound and complete synthesis algorithm for enhancing the fault-tolerance of high atomicity programs&mdash;where program processes can atomically read/write all program variables&mdash;from nonmasking to masking. (5) We present a sound algorithm for enhancing the fault-tolerance of distributed programs&mdash;where program processes have read/write restriction with respect to program variables. (6) We present a synthesis method for providing reuse in the synthesis of different programs where we automatically specify and add pre-synthesized fault-tolerance components to programs. (7) We define and address the problem of synthesizing multitolerant programs that are subject to multiple classes of faults and provide (possibly) different levels of fault-tolerance corresponding to each fault-class. To validate our theoretical results, we develop an extensible software framework, called Fault-Tolerance Synthesizer (FTSyn), where developers of fault-tolerance can interactively synthesize fault-tolerant programs. Also. FTSyn provides a platform for developers of heuristics to extend FTSyn by integrating their heuristics for the addition of fault-tolerance in FTSyn. Using FTSyn, we have synthesized several fault-tolerant distributed programs that demonstrate the applicability of FTSyn for the cases where we have different types of faults, and for the cases where a program is subject to multiple simultaneous faults. (Abstract shortened by UMI.)
Packet Error Rate Distribution Between Random Bluetooth Piconet Pairs
Authors: Brian S. Peterson, Rusty O. Baldwin, Richard A. Raines
Venue: Wireless Personal Communications: An International Journal (2005)

The packet error rate between two piconets depends on the temporal alignment of their packets and the spectral alignment of the intervals from which the frequencies in their hop sequence are chosen. The relationship between two randomly paired piconets is one of over 828 billion possible relationships. We define these relationships and derive an expression for determining the packet error rate for a specific pair of piconets using single-slot packets. We derive the probability mass function for the packet error rate and extend it to provide the possible packet error rates for an arbitrary number of neighboring piconets. We also derive a probability mass function for the goodput of a piconet with a neighboring piconet. The probability mass functions for the packet error rate is bimodal, meaning the expected value of the goodput or packet error rate is not a good choice for piconet performance analysis.
Comparison of Effiective Target Width Calculation Methods for Pointing Task
Authors: Jing Kong, Xiangshi Ren
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

Using effective target width in Fitts' law has been a widespread applied method for one dimensional pointing task evaluation especially when different speed or accuracy inclination exists. However, the concrete calculation methods of effective target width have not been offcially united. This paper concentrates on resolving this problem. Two special designed and controled experiments were described in this paper. The experiment and data analysis results show that after comparing the two existing methods of calculating effective target width, the method of mapping all the abscissa data into one united relative coordinate system to do the calculation is tested as better for human computer interface modeling than dividing data into two groups according to the corresponding target sides and mapping them into two separate coordinate systems.
Student learning outcomes in a computer applications module: online vs. face-to-face instruction
Authors: Kathleen A. Harting
Venue:  (2005)

The purpose of the study was to contribute to a better understanding of student learning outcomes in a web-based instructional environment. In addition, the study sought to determine if there was a significant difference between the characteristics of students who chose the entirely online web-based instruction to complete a spreadsheet software application module and those who chose the traditional lecture/demonstration instruction. The problem of the study was to determine if student achievement in a university computer applications course module is influenced by the instructional delivery method selected by the student and to discover if there is a relationship between instructional delivery method and student demographics. A quasi-experimental research design was used to conduct the study using students enrolled in six intact sections of a beginning computer applications course at a Midwestern state university. The study took place during the Microsoft Excel module of the course. There were 95 students who chose to complete this module using strictly online web-based instruction, while 106 students chose a traditional lecture/demonstration classroom setting. Both groups had the same instructional materials, and completed the same assessments. At the conclusion of the module, both groups took two assessments in the classroom: a web-based Excel concepts exam using WebCT and a hands-on Excel application exam. The instrument used to measure student achievement was a spreadsheet concept exam and a spreadsheet application exam. The majority of subjects who participated in this study were female; freshmen; in the 18&ndash;19 age group; enrolled for 15 semester hours at the time the study occurred; and had a cumulative GPA between 2.01 and 3.0 using a 4.0 system. Using an independent samples t-test, no statistically significant difference was found between exam scores and instructional delivery method. The only statistically significant difference found related to instructional delivery was the variance of a student's ACT score, which did show a positive correlation based on student's choice of the instructional delivery method. Recommendations included further investigation using an entire course to determine if instructional delivery impacts student achievement within the individual modules and the entire course.
gm-Extraction for rail-to-rail input stage linearization: Research Articles
Authors: F. Palma, S. Durante
Venue: International Journal of Circuit Theory and Applications (2005)

Transconductance of rail-to-rail input stages in low-voltage operational amplifiers depends on the presence of a large common mode input signal. Corrections must be implemented in order to correct it. Nevertheless, techniques actually used, based on switching or feedforward, still give relevant deviation from the constant transconductance condition.In this paper we present a new architecture based on extraction and feedback to the gain control, directly of the value of the transconductance of the amplifier to be controlled. This quantity does not contain the signal to be amplified, and thus once fed back, it does not affect the overall stage gain. A &lsquo;reciprocal&rsquo; circuit, which performs the 1&#x002F;x mathematical function, is introduced in order to achieve this extraction. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Stability Analysis of Stochastic Dynamic Systems under Poisson Perturbations. I. General Analysis of Stability of Solutions of Stochastic Differential Equations under Poisson Perturbations
Authors: I. V. Darijtchuk, V. K. Jasynsky, E. V. Jasynsky
Venue: Cybernetics and Systems Analysis (2005)

Using the second Lyapunov method, the exponential p-stability, mean square stability, p-stability, and stability with probability 1 are established for nonlinear stochastic differential equations under Poisson perturbations.
MultiPRE: a novel framework with multiple parallel retrieval engines for content-based image retrieval
Authors: Wei Xiong, Bo Qiu, Qi Tian, Changsheng Xu, S. H. Ong, Kelvin Foong, Jean-Pierre Chevallet
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

We propose a novel framework for content-based image retrieval with multiple parallel retrieval engines (MultiPRE) to achieve higher retrieval performance. Visual features, including both low-level features, such as color, texture and region features, and middle-level structure features, such as blob representation of objects are used to capture geometrical and statistical characteristics of images. Both clustering analysis and discrimination analysis are used as similarity measures in multiple retrieval engines, which are based on~principal component analysis (PCA) and support vector machines (SVM), respectively. Finally outputs of these engines are fused to determine ranking lists of retrieved images for given retrieval topics. The proposed framework has been evaluated based on the 26 image query topics over the CasImage database~with over 9000 medical images~used in ImageCLEF 2004, an international research effort for content-based image retrieval performance benchmark. Experiments show that the proposed framework achieved significantly better performance in terms of both the mean and the variance of average precision than the best run reported in ImageCLEF2004.
Apriori Formal Coverage Analysis for Protocol Properties
Authors: Praveen Tiwari, Saptarshi Biswas, Raj S. Mitra
Venue: Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (2006)

Protocol compliance verification is a key component of the overall SOC verification process. Formal techniques have been applied to achieve high confidence in such verification, but the quality of the protocol properties themselves is not subjected to this rigor of verification. Determining the formal coverage of the protocol properties with respect to an implementation is not sufficient, because it may not have captured the full scope of the protocol. We propose a technique to solve this important problem, by formally covering a protocol's properties independent of the implementation. The coverage is determined with respect to the protocol specification (i.e. its semantics), which is captured as a State Transition Graph (STG). Developing an STG for a complex protocol is a non-trivial task; in this paper we also propose techniques to efficiently model complex protocol features like pipelining and threading. Results for OCP and AHB are shown to illustrate our approach.
A category based concept for rapid development of ink-aware systems for computer-assisted education
Authors: Georg Turban, Max Muhlhauser
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

Presentation centric lectures that draw on integration of multimedia content and new input devices gain increasing importance in the context of eLearning. The paper emphasizes the addition of digital ink, which is of increasing importance for public (schools, universities) and corporate (trainings, Webinars) teaching. We present a concept for flexibly developing custom ink-aware systems that support augmented presentations for a broad range of use cases and cover not only the core event but also pre- and postevent phases, addressing the needs of both lecturers and students. Our concept for ink-aware multimedia architectures is based on three main system components, which are in turn assisted by small signal processing units. The concept fosters development of clearly and consistently designed ink-aware applications. The paper emphasizes examples where digital ink is visualized atop image-based slides, but potential applications comprise a much broader range of underpinning application. To illustrate our concept and implementation, we present sample customizations i.e. realizations of all relevant component categories. We discuss evaluation results obtained from both interviews with lecturers as well as our experience with using and supporting customizations made by ourselves.
Two Levels SPF-Based System to Interconnect Partially Decentralized P2P File Sharing Networks
Authors: J. Lloret, F. Boronat, C. Palau, M. Esteve
Venue: Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (2005)

Partially decentralized P2P (PDP2P) networks are a subset of P2P networks. Roles of nodes are different according to their functionality in the network. Nowadays, there are many PDP2P networks, with different characteristics. It is necessary to find a way to join those autonomous networks. We have not found any interconnection system, so in this article we present a new hierarchical system for interconnecting peers from different PDP2P networks. It will allow sharing data, content and resources between networks. It can be employed between sensor networks, P2P networks, and generally, overlay networks. Oldest superpeers or brokers with higher bandwidth in the PDP2P network will belong to higher layers. The topology will change as a function of the available processing capacity and the available number of connections with neighbor nodes. We also describe the interconnection system and its management. Simulations results for some topologies are shown.
A Novel Quartet-Based Method for Phylogenetic Inference
Authors: B. B. Zhou, M. Tarawneh, C. Wang, A. Y. Zomaya, R. P. Brent
Venue: Proceedings of the Fifth IEEE Symposium on Bioinformatics and Bioengineering (2005)

In this paper we introduce a new quartet-based method. This method makes use of the Bayes (or quartet) weights of quartets as those used in the quartet puzzling. However, all the weights from the related quartets are accumulated to form a global quartet weight matrix. This matrix provides integrated information and can lead us to recursively merge small sub-trees to larger ones until the final single tree is obtained. The experimental results show that the probability for the correct tree to be among a very small number of trees constructed using our method is very high. These significant results open a new research direction to further investigate more efficient algorithms for phylogenetic inference.
Documenting Motion Sequences with a Personalized Annotation System
Authors: Kanav Kahol, Priyamvada Tripathi, Sethuraman Panchanathan
Venue: IEEE MultiMedia (2006)

We present a novel technique for motion annotation that adapts to a person's style and vocabulary of basic movements (gestures). The system segments continuous motion sequences into gestures, which it then documents in a personalized annotation with an intuitive hierarchical representation. Initial testing suggests that software based on this technique could be an effective teaching aid for dance and sports.
Economically Complex Cyberattacks
Authors: Scott Borg
Venue: IEEE Security and Privacy (2005)

Most people working in cybersecurity recognize that the interconnections and complexities of our economy can have a huge effect on the destructiveness of cyberattacks. They refer casually to "network effects," "spillover effects," or "knock-on effects." Yet there is little understanding of how such effects actually work, what conditions are necessary to create them, or how to quantify their consequences.
Scalable on-line automated performance diagnosis
Authors: Philip Charles Roth
Venue:  (2005)

Performance tools are critical for the effective use of large-scale computing resources, but existing tools have failed to address three problems that limit their scalability: managing a large volume of performance data, communicating between a large number of distributed components, and presenting performance data and analysis results for a large number of application components. We present a four-part approach enabling tools to overcome these scalability barriers. First, we introduce Multicast/Reduction Overlay Networks (MRONs) and MRNet, our MRON implementation. An MRNet-based tool interposes a hierarchy of processes between the tool's front-end and its back-ends that can be used to distribute and parallelize tool activities. Using MRNet in simple tests and in the Paradyn performance tool, average message latency and throughput, start-up latency, and performance data processing throughput scaled linearly with no sign of resource saturation for up to 512 tool back-ends. Next, we present the Distributed Performance Consultant, an approach for finding performance problems in applications with a large number of processes, and the Sub-Graph Folding Algorithm, a technique for producing scalable graph-based displays of bottleneck search results. The Distributed Performance Consultant includes a distributed bottleneck search strategy and a way to monitor and control the cost of a search's instrumentation. The Sub-Graph Folding Algorithm combines sub-graphs of a search results graph that show similar qualitative behavior into a composite sub-graph. Using an approach that combines these two synergistic parts, we performed bottleneck searches on up to 1024 application processes with no sign of resource saturation. For 1024 application processes, the Sub-Graph Folding Algorithm converted a 30309-node search results graph into a 44-node graph with a single composite sub-graph. Finally, we introduce Deep Start, an approach for finding performance problems in applications with a large number of functions. Deep Start uses sampling to augment an instrumentation-based bottleneck search strategy. Deep Start finished finding bottlenecks 10% to 61% faster than a search strategy guided only by the application's call graph. Also, Deep Start often found bottlenecks hidden from the call graph search strategy.
A Security Model Design in Web Service Environment
Authors: Zhang Mi, Cheng Zunping, Ma Ziji, Zang Binyu
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

With the emerging applications based on Web Service, end-to-end security becomes more and more important. SSL and current XML security schemas cannot reach the demand of it. This paper proposes a novel security model -- ESM, which integrates some popular XML security schemas and constructs a layered model based on SOAP message transport mechanism. It's aiming at the end-to-end security issues in Web Service environment. Compared with other security models known to us, this model is more comprehensive and flexible.
Framework for Task Scheduling in Heterogeneous Distributed Computing Using Genetic Algorithms
Authors: Andrew J. Page, Thomas J. Naughton
Venue: Artificial Intelligence Review (2005)

An algorithm has been developed to dynamically schedule heterogeneous tasks on heterogeneous processors in a distributed system. The scheduler operates in an environment with dynamically changing resources and adapts to variable system resources. It operates in a batch fashion and utilises a genetic algorithm to minimise the total execution time. We have compared our scheduler to six other schedulers, three batch-mode and three immediate-mode schedulers. Experiments show that the algorithm outperforms each of the others and can achieve near optimal efficiency, with up to 100,000 tasks being scheduled
Two-Level Cache for Distributed System in RAID 5 Disk Controller
Authors: Jungho Huh
Venue: Proceedings of the 18th International Conference on Systems Engineering (2005)

We proposed a two-level disk cache model that to achieve higher hit ratios and relieve 'small write problem' in RAID 5 disk controller. And to enhance reliability of disk cache using non-volatile memory device for stable data. Especially this model improved utilization of first level cache. The proposed cache system consists of two-level caches with different associativities and different block sizes. The first level cache is a set-mapped cache with small block size that uses a set-associative mapping scheme. A set-mapped cache is reduces conflict miss ratios as compared with conventional direct-mapped cache. And the second level cache is a fully-mapped cache with large block size that uses a fully-associative mapping scheme. The large block sizes as a multiple of small blocks. The aim is to show, in terms of hit ratio and service time, that the two-level cache structure presented in this paper is in fact much improved.
Dynamic Adaptation and Subdivision in 3D-SOM: Application to Surface Reconstruction
Authors: Farid Boudjemai, Philippe Biela Enberg, Jack-Gerard Postaire
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

Surface reconstruction and structure representation from unorganized sample points are key problem in many applications for whose neural networks are recently starting a slight breakthrough. In this framework, we propose an original neural network architecture inspired from Kohonen's self-organizing maps, based on an adaptive learning process applied to a generalized mesh structure that will lead to a coherent topological definition of the surface, represented by a points cloud, given as input. This representation tool seems to be efficient in most cases but some weak adaptation drawbacks appear on certain examples. We propose local neighborhood propagation and subdivision process that solves those miss-adaptation problems.
CPOL: high-performance policy evaluation
Authors: Kevin Borders, Xin Zhao, Atul Prakash
Venue: Proceedings of the 12th ACM conference on Computer and communications security (2005)

Policy enforcement is an integral part of many applications. Policies are often used to control access to sensitive information. Current policy specification languages give users fine-grained control over when and how information can be accessed, and are flexible enough to be used in a variety of applications. Evaluation of these policies, however, is not optimized for performance. Emerging applications, such as real-time enforcement of privacy policies in a sensor network or location-aware computing environment, require high throughput. Our experiments indicate that current policy enforcement solutions are unable to deliver the level of performance needed for such systems, and limit their overall scalability. To deal with the need for high-throughput evaluation, we propose CPOL, a flexible C++ framework for policy evaluation. CPOL is designed to evaluate policies as efficiently as possible, and still maintain a level of expressiveness comparable to current policy languages. CPOL achieves its performance goals by efficiently evaluating policies and caching query results (while still preserving correctness). To evaluate CPOL, we ran a simulated workload of users making privacy queries in a location-sensing infrastructure. CPOL was able to handle policy evaluation requests two to six orders of magnitude faster than a MySql implementation and an existing policy evaluation system. We present the design and implementation of CPOL, a high-performance policy evaluation engine, along with our testing methodology and experimental results.