ppxscal/embedding_network huggingface dataset:
Semantic remote attestation: a virtual machine directed approach to trusted computing
Authors: Vivek Haldar, Deepak Chandra, Michael Franz
Venue: Proceedings of the 3rd conference on Virtual Machine Research And Technology Symposium - Volume 3 (2004)

Remote attestation is one of the core functionalities provided by trusted computing platforms. It holds the promise of enabling a variety of novel applications. However, current techniques for remote attestation are static, inexpressive and fundamentally incompatible with today's heterogeneous distributed computing environments and commodity open systems. Using language-based virtual machines enables the remote attestation of complex, dynamic, and high-level program properties - in a platform-independent way. We call this semantic remote attestation. This enables a number of novel applications that distribute trust dynamically. We have implemented a prototype framework for semantic remote attestation, and present two example applications built on it - a peer-to-peer network protocol, and a distributed computing application.
Visualizing Quantitative Proteomics Datasets using Treemaps
Authors: Brian D. Halligan, Shama P. Mirza, Molly C. Pellitteri-Hahn, Michael Olivier, Andrew S. Greene
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

One of the major challenges of large scale mass spectrometry based proteomics experiments is organizing and visualizing the data in such a way so that meaningful biological conclusions can be drawn from the data. Our tool, ZoomQuant, is capable of quantitating relative protein abundance between two samples in stable isotope labeled quantitative proteomics experiments. The resulting protein ratios are then annotated and categorized using the GO ontology terms. Sets of data representing different biological states can then be compared quantitatively and the results formatted for dynamic visualization. Using TreeMap, the user can visualize the quantitative differences between the biological states in a single view. The peptide or scan count and ratio for individual proteins are displayed and organized by the GO ontologies so that the user can easily see the global differences in protein expression between the two samples.
SigFree: a signature-free buffer overflow attack blocker
Authors: Xinran Wang, Chi-Chun Pan, Peng Liu, Sencun Zhu
Venue: Proceedings of the 15th conference on USENIX Security Symposium - Volume 15 (2006)

We propose SigFree, a realtime, signature-free, out-of-the-box, application layer blocker for preventing buffer overflow attacks, one of the most serious cyber security threats. SigFree can filter out code-injection buffer overflow attack messages targeting at various Internet services such as web service. Motivated by the observation that buffer overflow attacks typically contain executables whereas legitimate client requests never contain executables in most Internet services, SigFree blocks attacks by detecting the presence of code. SigFree first blindly dissembles and extracts instruction sequences from a request. It then applies a novel technique called code abstraction, which uses data flow anomaly to prune useless instructions in an instruction sequence. Finally it compares the number of useful instructions to a threshold to determine if this instruction sequence contains code. SigFree is signature free, thus it can block new and unknown buffer overflow attacks; SigFree is also immunized from most attack-side code obfuscation methods. Since SigFree is transparent to the servers being protected, it is good for economical Internet wide deployment with very low deployment and maintenance cost. We implemented and tested SigFree; our experimental study showed that SigFree could block all types of codeinjection attack packets (above 250) tested in our experiments. Moreover, SigFree causes negligible throughput degradation to normal client requests.
Co-evolutionary particle swarm optimization to solve min-max problems
Authors: Yuhui Shi, R. A. Krohling
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

A co-evolutionary particle swarm optimization (PSO) to solve constrained optimization problems is proposed. First, we introduce the augmented Lagrangian to transform a constrained optimization to a min-max problem with the saddle-point solution. Next, a co-evolutionary PSO algorithm is developed with one PSO focusing on the minimum part of the min-max problem with the other PSO focusing on the maximum part of the min-max problem. The two PSOs are connected through the fitness function. In the fitness calculation of one PSO, the other PSO serves as the environment to that PSO. The new algorithm is tested on three benchmark functions. The simulation results illustrate the efficiency and effectiveness of the new co-evolutionary particle swarm algorithm.
Test cost reduction for SoC using a combined approach to test data compression and test scheduling
Authors: Quming Zhou, Kedarnath J. Balakrishnan
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

A combined approach for implementing system level test compression and core test scheduling to reduce SoC test costs is proposed in this paper. A broadcast scan based test compression algorithm for parallel testing of cores with multiple scan chains is used to reduce the test data of the SoC. Unlike other test compression schemes, the proposed algorithm doesn't require specialized test generation or fault simulation and is applicable with intellectual property (IP) cores. The core testing schedule with compression enabled is decided using a generalized strip packing algorithm. The hardware architecture to implement the proposed scheme is very simple. By using the combined approach, the total test data volume and test application time of the SoC is reduced to a level comparable with the test data volume and test application time of the largest core in the SoC.
Effective Radio Resource Management for MBMS in UMTS Networks
Authors: Armando Soares, Nuno Souto, João C. Silva, Patrícia Eusébio, Américo Correia
Venue: Wireless Personal Communications: An International Journal (2007)

Broadcast and multicast offer a significant improvement of spectrum utilization, and becomes particularly important where information channels are shared among several users. Mobile cellular environments are expected to evolve with the technological approaches necessary to facilitate the deployment of multimedia services, such as streaming, file download and carousel services. The perspective that video streaming in wireless networks services is an attractive service to end-users has spurred the research in this area. To provide for a video delivery platform in UMTS, the Third Generation Partnership Project (3GPP) addressed this problem with the introduction of the Multimedia Broadcast and Multicast Services (MBMS) in 3GPP Release 6. In this document we analyse several effective radio resource management techniques to provide MBMS, namely, use of non-uniform QAM constellations, multi-code and macro-diversity to guarantee the optimal distribution of QoS depending on the location of mobiles.
Learning and exploiting knowledge in multi-agent task allocation problems
Authors: Adam Campbell, Annie S. Wu
Venue: Proceedings of the 2007 GECCO conference companion on Genetic and evolutionary computation (2007)

Imagine a group of cooperating agents attempting to allocate tasks amongst themselves without knowledge of their own capabilities. Over time, they develop a belief of their own skill levels through failed attempts at completing the tasks they are assigned. How will various task allocation approaches perform when there exists this added level of complexity? In particular, we compare two task allocation strategies: a greedy, first-come-first-serve approach, and a more intelligent, best-fit method. By varying the number of tasks along with the amount of time it takes to complete those tasks, we find that the different task allocation methods work better in different situations. Because of the way the tasks are allocated by the two methods, the greedy approach does a better job of giving agents opportunities to learn their capabilities. Thus, the greedy approach allows for quicker learning and performs better on problems where the task durations are short, whereas the best-fit method performs better on problems where the task quantity and durations are large. What is needed is a hybrid method that balances between the exploration of the greedy approach and the exploitation of the best-fit method.
RODMRP: Resilient On-Demand Multicast Routing Protocol
Authors: Dhammika Pathirana, Minseok Kwon
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

ODMRP (On-Demand Multicast Routing Protocol) [5] [7] [1] is a popular multicast protocol for wireless ad hoc networks. The strengths of ODMRP are simplicity, high packet delivery ratio, and non-dependency on a specific unicast protocol. ODMRP floods a route request over the entire network to select a set of forwarding nodes for packet delivery. However, a single forwarding path is vulnerable to node failures, which are common due to the dynamic nature of mobile ad hoc networks. Furthermore, a set of misbehaving or malicious nodes can create network partitions and mount Denial-of-Service (DoS) attacks. We propose a ODMRP-based wireless multicast protocol named RODMRP that offers more reliable forwarding paths in face of node and network failures. A subset of the nodes that are not on forwarding paths rebroadcast received packets to nodes in their neighborhoods to overcome perceived node failures. This rebroadcasting creates redundant forwarding paths to circumvent failed areas in the network. Each node makes this forwarding decision probabilistically. Our simulation results indicate that RODMRP improves packet delivery ratio with minimal overheads, while retaining the original strengths of ODMRP.
A novel method for adaptive enhancement and unsupervised segmentation of MRI brain image
Authors: Jing-Hao Xue
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

This paper describes a novel global-to-local method for the adaptive enhancement and unsupervised segmentation of brain tissues in MRI (magnetic resonance imaging) images. Three brain tissues are of interest: CSF (cerebrospinal fluid), GM (gray matter), WM (white matter). Firstly, we de-noise the image using wavelet thresholding, and segment the image with minimum error thresholding. Both the thresholdings are global-wise. Subsequently, we combine locally adaptive weighted median and weighted average filters with FCM (fuzzy C-means) clustering to achieve a local-wise segmentation. The performance of the proposed method is quantitatively validated by four indices with respect to a MRI brain phantom.
High Order Voronoi Sculpture
Authors: James Dean Palmer
Venue: Proceedings of the 4th International Symposium on Voronoi Diagrams in Science and Engineering (2007)

While techniques exist to compute three dimensional Voronoi diagrams and their higher-order and generalized cousins, visualizing Voronoi diagrams and their underlying distance functions remains challenging. In this paper we specifically consider visual representations that take the form of shapes or sculptures formed from three dimensional iso-surfaces.
Identification of Objects-of-Interest in X-Ray Images
Authors: Carsten Oertel, Peter Bock
Venue: Proceedings of the 35th Applied Imagery and Pattern Recognition Workshop (2006)

The objective of this research is to automatically detect and locate Devices-of-Interest (DOI) in x-ray images, even if partially obscured by devices of no interest, using a new ALISA Component Module. This preliminary study was performed using a single DOI, a 9mm Colt Beretta, but the solution method can easily accommodate other DOIs. Results obtained in real-time (a few seconds) revealed a robust and accurate classifier that could easily assist security personnel at the defined venue: carry-on luggage x-ray machines in airports. This research project was funded by the Defense Threat Reduction Agency (DTRA).
Teaching reliability engineering to working engineers
Authors: A. W. Mayers
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 02 (2000)

The paper presents the components and design philosophy used to develop a graduate-level reliability engineering course, EE 497, that is currently being delivered to students at a distance. CD based lectures with Mathematica(R) interactive tutorials and online discussions are interwoven to provide students with a rich environment for learning the complex concepts and procedures common to reliability engineering. Material relevance is reinforced with Web links and Internet search activities. Statistical properties and distributions are demonstrated and made tractable through a set of Mathematica(R) tutorials. In these activities, students interactively vary statistical parameters to see their effect, thus developing a thorough understanding of the concepts. Finally, a FirstClass(R) environment is used as an asynchronous classroom and information exchange center where students may interact with their professor and peers.
Differentiating assessment from evaluation as continuous improvement tools [for engineering education]
Authors: P. E. Parker
Venue: Proceedings of the Frontiers in Education Conference, 2001. on 31st Annual - Volume 01 (2001)

Unleashing the potential of continuous improvement in teaching/learning requires an appreciation of the difference in spirit between assessment and evaluation. Assessment is frequently confused and confounded with evaluation. The purpose of an evaluation is to judge the quality of a performance or work product against a standard. The fundamental nature of assessment is that a mentor values helping a mentee and is willing to expend the effort to provide quality feedback that will enhance the mentee's future performance. While both processes involve collecting data about a performance or work product, what is done with these data in each process is substantially different and invokes a very different mindset. This paper reviews the,principles and mindset underlying quality assessment and then illustrates how feedback can be enhanced within the framework of structured assessment reports.
Simulation of an adaptive system based in the 802.16 standard
Authors: D. A. Sanchez-Salas, J. L. Cuevas-Ruiz
Venue: Proceedings of the 17th International Conference on Electronics, Communications and Computers (2007)

A common practice to avoid the attenuation presented in a wireless communication system is using fading mitigation techniques. Examples of those techniques are the adaptive systems. The proposal of this article is about a system that can switch its transmission and reception characteristics according the bit error rate (BER) between the sent and received data. The system (simulated in Matlab) will commute in a certain value that will be established by the user. The characteristics of the system (modulation and coding) are the same of that shown in the 802.16 standard. In this way, an adaptive system was created with two modes: one with only modulation (16QAM) and the other with modulation (16QAM) and coding (Reed Solomon (64,48)). The BER value is established by the user, getting a more efficient system according to the necessities.
On the Quality of Service of Crash-Recovery Failure Detectors
Authors: Tiejun Ma, Jane Hillston, Stuart Anderson
Venue: Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (2007)

In this paper, we study and model a crash-recovery target and its failure detector's probabilistic behavior. We extend Quality of Service (QoS) metrics to measure the recovery detection speed and the proportion of the detected failures of a crash-recovery failure detector. Then the impact of the dependability of the crash-recovery target on the QoS bounds for such a crash-recovery failure detector is analysed by adopting general dependability metrics such as MTTF and MTTR. In addition, we analyse how to estimate the failure detector's parameters to achieve the QoS from a requirement based on Chen's NFD-S algorithm. We also demonstrate how to execute the configuration procedure of this crash-recovery failure detector. The simulations are based on the revised NFD-S algorithm with various MTTF and MTTR. The simulation results show that the dependability of a recoverable monitored target could have significant impact on the QoS of such a failure detector and match our analysis results.
Multi-disciplinary simulation and analysis of complex product in service oriented environment
Authors: Hongwei Wang, Shih-wei Liao, Heming Zhang
Venue: Proceedings of the IEEE International Conference on Service-Oriented Computing and Applications (2007)

Simulation and analysis are computational techniques evaluating dynamic features of the component in design. Multi-disciplinary simulation is advocated to guarantee high fidelity simulating of the real state of working. The interoperability and reusability of simulation models in distributed heterogeneous environment are the inherent requirement for the analysis of complex product which is designed by geographically distributed teams in a process of great complexity. The service oriented computing(SOC) is emerging as a new paradigm of software system for distributed application. We propose a multi-disciplinary simulation environment based SOC. The process of work and the computing resources are defined, registered, consumed and orchestrated services. We address several key issues in this analysis environment and study a typical case based on a prototype system. The new paradigm leverages available engineering resources embodied as loosely-coupled services. Service oriented computing has great potential in engineering application.
Enhancing Reliability throughout Knowledge Discovery Process
Authors: Yi Feng, Zhaohui Wu
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

Reliability is a key issue in knowledge discovery. However, this topic is not fully explored in data mining community. This paper takes a process perspective towards the reliability of knowledge discovery, and the reliability of extracted knowledge is evaluated by the reliability of whole knowledge discovery process. To describe the relationship between the final reliability and the reliability in each stage of process, a reliability model for generic knowledge process is proposed, and is further extended to the context of CRoss-Industry Standard Process for Data Mining (CRISP-DM). Moreover, eight factors contributing to knowledge discovery reliability are presented in the order of six phases in CRISP-DM. Based on these factors, ten suggestions on how to enhance reliability throughout knowledge discovery process are provided.
Outsourcing Resource Selection: A Rough Set Approach
Authors: Dan Zhu, Qiang Meng, J. Leon Zhao
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Today's economic reality is forcing firms to become increasingly more efficient in managing their resource functions. Outsourcing has moved to the mainstream of business development and promised to be one of the many enterprise strategies for cost-effective service delivery. Proper screening and automatic selection of outsource partners are critical to the business. Resource selection is one of the most important steps in outsourcing decision-making processes. This paper considers a data intensive selection problem in outsourcing software development projects. We analyze the properties of the resource selection problem and propose some criteria for an automatic resource selection model. A naive model, a traditional rough set model, and a generalized rough set (GRS) model are introduced and the advantages and disadvantages of each model are compared. Experimental results indicate that the GRS model is superior to other models.
Socio-technical environments supporting distributed cognition for persons with cognitive disabilities
Authors: Gerhard Fischer
Venue:  (2006)

In the United States, 4.64 million persons have cognitive disabilities, and of these a significant fraction is potentially able to live more independently save for a deficiency of mnemonic and executive capability. In many cases, these persons are supported by concerned caregivers who want them to live in a less dependent fashion. Persons with cognitive disabilities as well as caregivers could all benefit from a socio-technical environment designed to support their legitimate and reasonable aspirations. My research platform, MAPS (Memory Aiding Prompting System), aims to provide a simple effective prompting system for individuals with cognitive disabilities with an interface for designing prompting scripts by caregivers. MAPS provides a socio-technical environment that acknowledges the needs and abilities of members of the communities of caregivers and persons with cognitive disabilities. By using and extending human-computer interaction (HCI) frameworks and theory---such as distributed cognition, metadesign, and symmetry of ignorance---in a principled design environment, this research demonstrates, analyzes, and documents how to create systems that potentially could avoid the all-too-common fate of assistive technology, that of abandonment. MAPS comprises two technical components: the MAPS script-design-environment, a personal computer (PC)-based system that allows a caregiver to edit, store, and reuse scripts of multimedia prompts for task support; and the MAPS-prompter, a PDA-based mobile prompting environment for persons with cognitive disabilities. The process of adopting MAPS was observed and analyzed by using ethnographic methods to study dyads of persons with cognitive disabilities and caregivers doing real tasks in home, shopping, and employment environments. Based on these observations and analyses, this research delineated new ways to use traditional HCI perspectives and produced a set of heuristics to aid in the design and use of prompting systems and the more general design of assistive technology.
A segment-based C/sub 0/ adaptation scheme for PMC-based noisy Mandarin speech recognition
Authors: Wei-Tyng Hong
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

A segment-based C/sub 0/ (the zero-th order of cepstral coefficient) adaptation scheme for PMC-based Mandarin speech recognition is proposed in this paper. It incorporates a new C/sub 0/ model of speech signal into the PMC method to improve the gain matching between the clean-speech HMM models and the current noise model. The C/sub 0/ model is constructed in the training phase by jointly modeling the normalized C/sub 0/ with other MFCC recognition features to form C/sub 0/-normalized HMM models. In the testing phase, it pre-segments the input utterance into syllable-like segments, performs C/sub 0/-denormalization operations to expand the C/sub 0/-normalized HMM models, and uses them in the PMC method. Compared with the conventional PMC method, the proposed method can achieve a much better noise compensation effect due to the use of more precise gain matching in the PMC model combination. Experimental results showed that the base-syllable accuracy rate was significantly upgraded for continuous noisy Mandarin speech recognition.