ppxscal/embedding_network huggingface dataset:
Formal modelling and analysis of mission-critical software in military avionics systems
Authors: Zahid H. Qureshi
Venue: Proceedings of the eleventh Australian workshop on Safety critical systems and software - Volume 69 (2007)

A typical avionics mission system of a military aircraft is a complex real-time system consisting of a mission control computer, different kinds of sensors, navigation and communication subsystems, and various displays and stores; all interconnected by a number of serial data buses. The mission capability is increasingly implemented in the mission-critical software and the robustness of this software is vital for mission success. The complexity and real-time requirements of mission systems represent major challenges to the Australian Defence Force during new acquisitions, upgrades and maintenance. This paper describes the experiences on a joint research project between the University of South Australia and Australia's Defence Science and Technology Organisation into the modelling and analysis of avionics mission systems. The paper provides a summary of the key aspects of our previous research work on the modelling of a generic mission system using Coloured Petri Nets and the analysis of task scheduling on the mission computer. Finally, the paper briefly discusses the extension of the generic model to obtain a formal model of the mission system of the AP-3C Orion maritime surveillance aircraft.
Design and Psychophysical Study of Volume Compression for Haptic Rendering
Authors: Nils Jensen, Gabriel Gaus, Gabriele von Voigt, Stephan Olbrich
Venue: Proceedings of the Second Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2007)

The paper specifies a novel coder/decoder that compresses sequences of 3D texture data to support the haptic rendering of animated volumes. Lossy compression gives 25% of the original size. Lossy compression and clipping gives 3% but requires the renderer to query for new data when the point of contact moves. We evaluated the codec by means of rendering volumes on a 3-DOF Phantom 1.5A that simulated viscosity for each texture element. In this setting, we studied the impact of information loss in controlled experiments. We validated that our codec preserves haptic perception. An area of application is the development of network-distributed virtual environments that generate visual and haptic feedback.
Towards Self-Managing Web Sites: The Link Integrity Problem
Authors: David Bustard, Adrian Moore, Declan Higgins, David Ayre
Venue: Proceedings of the Fourth IEEE International Workshop on Engineering of Autonomic and Autonomous Systems (2007)

Most web sites contain faulty links. These affect the perceived quality of the information on the site and the reliability of any associated services. Despite such motivation, and a wide discussion of the issue over many years, achieving a reasonable level of link integrity across the web remains an open challenge. This paper describes some work towards clarifying and resolving that challenge. The approach taken in this paper involves the embedding of automatic checks for link integrity in each site. The problem is examined using Soft Systems Methodology, in the general context of creating and maintaining a web site to provide user information and associated services. Some experimental work towards implementing such a system is described, discussing opportunities for autonomic behaviour.
Bandwidth Adjustable DVTS on the Heterogeneous Internet Environments for Distance Learning
Authors: Yasuo Tsuchimoto, Mohammad Abdul Awal, Poompat Saengudomlert, Teerapat Sanguankotchakorn, Kanchana Kanchanasut
Venue: Proceedings of the 2007 International Symposium on Applications and the Internet Workshops (2007)

We propose a new schematic design for sending and receiving a digital video stream on the heterogeneous Internet environment such as a Gigabit Ethernet and a narrow bandwidth satellite link. On such network, a sender can send the full 30fps digital video stream, but not all sites can receive a full quality video. In our proposed scheme, a DVTS repeater named Dvrelay is introduced to reduce frame rate of a DVTS stream going through it. To receive site-aware quality of DVTS stream, Dvrelay can be set up at the nearest point to the receiver site and it can thin out frames to adjust the transmission rate for the narrow bandwidth environment. With this scheme, it is not necessary to modify DVTS sender and receiver. Therefore, it can apply to any DVTS environments and adjust traffic according to capacity of the network links available to recipients. Consequently, all sites in the Internet can receive the site-aware best quality of digital video stream. Then all sites in the Internet can receive the lecture with the quality of the Digital Video.
Iterative algorithms for optimal state estimation of jump Markov linear systems
Authors: A. Doucet
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

Jump Markov linear systems (JMLS) are linear systems whose parameters evolve with time according to a finite state Markov chain. We present three original deterministic and stochastic iterative algorithms for optimal state estimation of JMLS whose computational complexity at each iteration is linear in the data length. The first algorithm yields conditional mean estimates. The second algorithm is an algorithm that yields the marginal maximum a posteriori (MMAP) sequence estimate of the finite state Markov chain. The third algorithm is an algorithm that yields the MMAP sequence estimate of the continuous state of the JMLS. Convergence results for these three algorithms are obtained. Computer simulations are carried out to evaluate their performance.
An Adaptable Energy-Efficient Medium Access Control Protocol for Wireless Sensor Networks
Authors: Justin T. Kautz, Barry E. Mullins, Rusty O. Baldwin, Scott R. Graham
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

We propose a medium access control protocol for wireless sensor networks (WSN) called Adaptive sensor Medium Access Control (AMAC), which is based on the Sensor Medium Access Control (S-MAC) protocol [1]. Since WSNs are energy constrained, the lifetime of the network must be increased by making it as energy efficient as possible. Whereas S-MAC uses a fixed duty cycle for sleeping, AMAC adapts to traffic conditions by incorporating multiple duty cycles. Under a high traffic load, AMAC has a short duty cycle and awakes more often. Under a low traffic load, AMAC has a longer duty cycle and awakes infrequently. The AMAC protocol is simulated in OPNET Modeler. Analysis indicates that AMAC uses 15% less power and 22% less energy cost per byte than S-MAC with a tradeoff in twice the latency. For an application insensitive to latency, the AMAC protocol offers an extended lifetime.
Coherent detection of radar signals in G-distributed clutter
Authors: G. Mamic
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

The G distribution has been proposed as a new model for extremely heterogeneous clutter in SAR returns. We develop a technique for estimating the parameters of the G distribution, show that the G distribution represents an amplitude distribution of a spherically invariant random process for certain values of its parameters, and design coherent detectors for known and unknown signals embedded in G-distributed clutter. The performance of the detectors under specific conditions is then provided.
Fuzzy-granular based data mining for effective decision support in biomedical applications
Authors: Raj Sunderraman, Yan-Qing Zhang
Venue:  (2006)

Due to complexity of biomedical problems, adaptive and intelligent knowledge discovery and data mining systems are highly needed to help humans to understand the inherent mechanism of diseases. For biomedical classification problems, typically it is impossible to build a perfect classifier with 100% prediction accuracy. Hence a more realistic target is to build an effective Decision Support System (DSS). In this dissertation, a novel adaptive Fuzzy Association Rules (FARs) mining algorithm, named FARM-DS, is proposed to build such a DSS for binary classification problems in the biomedical domain. Empirical studies show that FARM-DS is competitive to state-of-the-art classifiers in terms of prediction accuracy. More importantly, FARs can provide strong decision support on disease diagnoses due to their easy interpretability. This dissertation also proposes a fuzzy-granular method to select informative and discriminative genes from huge microarray gene expression data. With fuzzy granulation, information loss in the process of gene selection is decreased. As a result, more informative genes for cancer classification are selected and more accurate classifiers can be modeled. Empirical studies show that the proposed method is more accurate than traditional algorithms for cancer classification. And hence we expect that genes being selected can be more helpful for further biological studies.
Choosing a backup environment
Authors: Jody Schivley Leber
Venue: Proceedings of the 1997 Workshop on Large Scale System Administration of Windows NT (1997)

Backups are the most important task you can do to protect the vital data on your computer. The basic hardware, operating system, and application software can be replaced at a relatively small price. However, the data and programs you or your co-workers have generated cannot be reproduced easily. Hours, weeks, months, and years are embodied in this data. There is no possible price someone can put on that kind of time and effort. Proper backups are the only way you can guarantee restoration of your data subsequent to system failures. Some people may consider it a mundane task. However, at many sites there are technical issues, political concerns, and integration challenges that make the assignment of implementing the corporate backup and recovery system(s) interesting and fun. This paper provides a summary of the process involved with choosing a backup environment for Windows NT. The details are fully covered in the book, Windows NT Backup and Recovery that will be published by O'Reilly and Associates in the fall of 1997. Due to the scope of planning and implementing a successful backup system, not all the information necessary can be provided in this short paper. Where the information is too great to fit in this paper, you will be referred to the book.
Dynamic Cross-Realm Authentication for Multi-Party Service Interactions
Authors: Dacheng Zhang, Jie Xu, Xianxian Li
Venue: Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (2007)

Modern distributed applications are embedding an increasing degree of dynamism, from dynamic supply-chain management, enterprise federations, and virtual collaborations to dynamic service interactions across organisations. Such dynamism leads to new security challenges. Collaborating services may belong to different security realms but often have to be engaged dynamically at run time. If their security realms do not have in place a direct cross-realm authentication relationship, it is technically difficult to enable any secure collaboration between the services. A typical solution to this is to locate at run time intermediate realms that serve as an authentication-path between the two separate realms. However, the process of generating an authentication path for two distributed services can be very complex. It could involve a large number of extra operations for credential conversion and require a long chain of invocations to intermediate services. In this paper, we address this problem by presenting a new cross-realm authentication protocol for dynamic service interactions, based on the notion of multi-party business sessions. Our protocol requires neither credential conversion nor establishment of any authentication path between session members. The correctness of the protocol is analysed, and a comprehensive empirical study is performed using two production quality Grid systems, Globus 4 and CROWN. The experimental results indicate that our protocol and its implementation have a sound level of scalability and impose only a limited degree of performance overhead, which is comparable with those security-related overheads in Globus 4.
Towards Aspect-Oriented Programming for Context-Aware Systems: A Comparative Study
Authors: Francisco Dantas, Thais Batista, Nelio Cacho, Alessandro Garcia
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

Development of modular context-aware applications has been a deep challenge to software engineers. One of the main reasons is the crosscutting nature of certain context-awareness concerns. Specific distributed aspect-oriented programming (AOP) techniques have recently emerged as a promising candidate to address these shortcomings. This paper reports our ongoing effort on the definition of relevant criteria to perform a comparative analysis of five emerging AOP approaches for context-aware systems. We evaluate to what extent their specialized linguistic mechanisms scale to distributed systems, in particular context-aware mobile systems.
Speculative Computation: Overcoming Communication Delays
Authors: Vasudha Govindan, Mark A. Franklin
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 03 (1994)

Communication latencies and delays are a major source of performance degradation in parallel computing systems. It is important to "mask" these communication delays by overlapping them with useful computation in order to obtain good parallel performance. This paper proposes speculative computation as a technique to mask communication latencies in synchronous iterative algorithms. Processors speculate the contents of messages that are not yet received and perform computation based on the speculated values. When the messages are received, they are compared with the speculated values and, if the error is unacceptable, the resulting computation is corrected or recomputed. If the error is small, the speculated value is accepted and the processor has masked the communication delay. The technique, applied to N-body simulations yielded a performance improvement of up to 34%.
Aspect oriented DSLs for business process implementation
Authors: Arno Schmidmeier
Venue: Proceedings of the 2nd workshop on Domain specific aspect languages (2007)

Domain specific languages (DSLs) are a very important approach to raise abstraction and enable an efficient communication between business experts and application software developers. Some DSLs could benefit from the application of ideas from the AOSD world. Therefore, it is a natural idea to enhance an existing DSL with AOP based programming ideas. This paper describes such an attempt. The approach has been successfully applied in several commercial projects. Commercially available DSLs in the domain of application integration, service orchestration and business process management have been enhanced with composition filters.
Using the Right Amount of Monitoring in Adaptive Load Sharing
Authors: David Breitgand, Rami Cohen, Amir Nahir, Danny Raz
Venue: Proceedings of the Fourth International Conference on Autonomic Computing (2007)

Consider a service that is being provided by a set of servers over the network. The goal of the service provider is to provide the best service (say, to minimize the service time) given the amount of available resources (e.g., the number of servers). To achieve this goal the provider may introduce a load sharing capability into the system. In order to cope with dynamic environments, where the actual availability of each server changes over time, the load sharing mechanism needs to adapt to the current global state of the system. This implies that updated load information needs to be collected from the servers. Handling such load information requests requires small but nonzero resources (e.g., CPU) from each server. This may reduce the actual service rate of the server, and thus, it is not easy to predict the actual amount of improvement expected from preferring a specific configuration of a dynamic load sharing scheme. For this reason it is important to identify just the right amount of resources that should be allocated for the monitoring of the servers' load in order tomaximize the overall system performance. Moreover, since the optimal amount of monitoring depends on external parameters (such as the arrival rate of the service requests stream), the system should self-adjust the amount of monitoring according to the current conditions.
A Pose Recovery Algorithm to Minimize the Effects of Pose Variation on the Matching Performance of Elastic Bunch Graph Based Multiview Face Recognition System
Authors: D. Mazumdar, K. Chanda, M. Bhattacharya, S. Mitra
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

Multiview face recognition is a challenging task of deformable pattern recognition. Machine recognition of human from his/her facial images available at any pose, intensity and expression is the ultimate goal of multiview face recognition system. In the present work the effect of variation of poses on the overall performance of face recognition engine based on elastic bunch graph matching technique is studied using K-means clustering algorithm. A geometry-based pose recovery algorithm is proposed to improve the performance of the system.
A Novel Shape Indexing Method for Automatic Classification of Lepidoptera
Authors: Oleg Starostenko, Carlos K. Cruz, Alberto Chavez-Aragon, Renan Contreras
Venue: Proceedings of the 17th International Conference on Electronics, Communications and Computers (2007)

This paper presents a novel approach for images retrieval form digital collection based on analysis of their low level characteristics such as color and shape that has been applied for classification of the rare specimens of the Lepidoptera (butterflies) in Mexico. The similarity with user's queries which are the images, manual sketches or textual descriptions is computed by comparison of the feature vectors representing a shape by proposed two segments turning functions that is invariant to translation, rotation, and scale. In order to speed up preprocessing of shapes the proposed convex regions algorithm and discrete curve evolution approach are applied. Another goal of the proposed method is integration of two signatures of shape used in hashing tables for data base of images such as compactness and elongatedness which provide fast and satisfactory image retrieval by accelerating the convergence to expected result. The proposed method has been tested and evaluated using designed search engine for classification of the butterfly's families.
Synchronous distance education via the Internet
Authors: J. M. Pullen
Venue: Proceedings of the 26th Annual Frontiers in Education - Volume 01 (1996)

Describes a vision for networked distance education and ongoing experiments intended to increase our understanding of how distance education can be conducted most successfully at the university level. Our vision includes the relationship between delivery media and modes in the future learning environment, the role of information technologies in scholarship, and the benefits of unlimited access to global information resources. A special concern is the effective use of various media in distance education. For example, the traditional role of video delivery is analyzed and seen to be, in many cases, more a matter of past necessity than effective future delivery. In support of our conclusions a series of experiments conducted at the author's university are described. These have involved teaching real, for-credit courses to remote students using the Internet. While many universities are experimenting with asynchronous delivery via e-mail, Web and related technologies, our work is unusual in that it involves synchronous delivery. The most enlightening of our experiments involved use of the Internet multicast backbone (Mbone) and its associated suite of multimedia tools. Ongoing experiments involve use of commercial off-the-shelf multimedia with low-cost workstations and a commercial Internet service.
Speaker identification in mismatch training and testing conditions
Authors: C. Alonso-Martinez
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

This paper presents an exhaustive study about the robustness of several parameterizations, with a new database specially acquired for the purpose of this study. This database includes the following variations: different recording sessions (including telephonic and microphonic recordings), recording rooms, and languages (it has been obtained from a bilingual set of speakers). This study has been performed with two identification algorithms (vector quantization and covariance matrices) and reveals that the combination of several parameterizations can improve the robustness in all the scenarios.
Towards web security using PLASMA
Authors: Annette Krannig
Venue: Proceedings of the 7th conference on USENIX Security Symposium - Volume 7 (1998)

The World Wide Web is one of the most significant multi-media applications ever developed-and therefore securing the web is one of the most pressing problems. There exist a number of approaches for securing the World Wide Web which, however, usually pursue what one might call a low level approach without being able to give adequate consideration to the specific requirements of this multi-media (or hypertext) system. The subject of this paper is the realization of an adequate security system, which is capable of detecting the different media and structures within hypertext systems and therefore apply different cryptographic mechanisms to them; this resulted in the development of the system PLASMA (Platform for Secure Multimedia Applications). PLASMA is a security platform designed within the frame of the Berkom R&D-programme at the Fraunhofer-IGD in Darmstadt whose prototype was developed to provide a means for secure multimedia telecommunications. In order to demonstrate the capabilities of PLASMA, it was integrated into a W3 scenario. The advantages of PLASMA when used in the World Wide Web as well as the architecture created for the integration process are described in the following section.
RIPP-FS: An RFID Identification, Privacy Preserving Protocol with Forward Secrecy.
Authors: Mauro Conti, Roberto Di Pietro, Luigi Vincenzo Mancini, Angelo Spognardi
Venue: Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops (2007)

This paper presents a new RFID identification protocol: RIPP-FS. The proposed protocol is based on hash chains and it enforces privacy and forward secrecy. Further, unlike other protocols based on hash chains, our proposal is resilient to a specific DoS attack, in which the attacker attempts to exhaust the hash chain the tag is programmed to spend. The computations required on the tag side are very limited, just three hash functions; on the reader side RIPPFS allows to leverage pre-computations, in such a way that tag identification resolves to a lookup in pre-computed tables, speeding up the identification process. To the best of our knowledge this is the first protocol providing all these features at once.