ppxscal/embedding_network huggingface dataset:
Effect of interleaving on a Markov channel
Authors: T. Rancurel
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

Many models based on hidden Markov models were developed to model error bursts in communication channels. In this paper, we evaluate the effect of interleaving for the widely used Gilbert-Elliot model. An expression of the transition probability matrix is then derived. This allows, when having an identified error model, to simulate in an easy way the effects of any interleaving depth. Therefore, the choice of an interleaving degree and a forward error correction code (FEC) can be done easily.
Using developmental principles to plan design experiences for beginning engineering students
Authors: W. C. Duncan-Hewitt
Venue: Proceedings of the Frontiers in Education Conference, 2001. on 31st Annual - Volume 01 (2001)

Experiments with a variety of teaching techniques to improve meaningful learning often are often only partially successful, leaving many students struggling with the abstract and complex knowledge of the engineering disciplines. The authors hypothesize that decisions about appropriate teaching methods are best made by considering the development of students' intellectual complexity using the "crux developmental model" (CDM) synthesized from a number of disparate theories in the educational, developmental and complexity literatures. The CDM and its application were assessed and improved over a three-year cycle in the context of a science and engineering camp for teenagers. Their results supported the hypothesis that the CDM: (1) provides a rational method of selecting developmentally appropriate activities to teach specific skills and content; and (2) provides a tool for customizing learning activities to maximize growth. According to the developmental model, the teenage participants in camp are working at the beginning of the same developmental transition that undergraduates are completing. Thus, they conclude this paper by proposing how the results of this study can be generalized to the undergraduate experience.
ASX: an object-oriented framework for developing distributed applications
Authors: Douglas C. Schmidt
Venue: Proceedings of the 6th conference on USENIX Sixth C++ Technical Conference - Volume 6 (1994)

The ADAPTIVE Service eXecutive (ASX) is a highly modular and extensible object-oriented framework that simplifies the development and configuration of distributed applications on shared memory multi-processor platforms. This paper describes the structure and functionality of the ASX framework's object-oriented architecture. In addition, the paper presents the results of performance experiments conducted using ASX-based implementations of connection-oriented and connectionless protocols from the TCP/IP protocol family. These experiments measure the performance impact of alternative methods for parallelizing communication protocol stacks. Throughout the paper, examples are presented to indicate how the use of object-oriented techniques facilitate application extensibility, component reuse, and performance enhancement.
A Middleware Architecture for Mobile and Pervasive Large-Scale Augmented Reality Games
Authors: Pedro Ferreira, Joao Orvalho, Fernando Boavida
Venue: Proceedings of the Fifth Annual Conference on Communication Networks and Services Research (2007)

Ubiquitous or pervasive computing is a new kind of computing, where specialized elements of hardware and software will have such a high level of deployment that their use will be fully integrated with the environment. Augmented reality extends reality with virtual elements but tries to place the computer in a relatively unobtrusive, assistive role. Specialized network middleware solutions for large scale mobile and pervasive augmented reality games are, to our knowledge, inexistent. The work presented in this paper focuses on the creation of such type of network middleware for mobile and pervasive entertainment, applied to the area of large scale augmented reality games. In this paper we describe the architecture of the system, which works over a 3GPP network. The paper presents architectural and implementation aspects, along with evaluation results. The results show that the proposed solution is able to cope with the stringiest requirements of augmented reality systems.
Stimulus generation for interface protocol verification using the nondeterministic extended finite state machine model
Authors: Che-Hua Shih, Juinn-Dar Huang, Jing-Yang Jou
Venue: Proceedings of the High-Level Design Validation and Test Workshop, 2005. on Tenth IEEE International (2005)

Verifying if an integrated component is compliant with certain interface protocol is a big issue in component-based SOC designs. Massive constrained random simulation stimuli are becoming crucial to achieve a high verification quality. To further improve the quality, the stimulus biasing technique should be used to guide the simulation to hit design corners. In this paper, we model the interface protocol with the nondeterministic extended finite state machine (NEFSM), and then propose an automatic stimulus generation approach based on the NEFSM. This approach is capable of providing numerous biasing options. Experiment results demonstrate the high controllability and efficiency of our stimulus generation scheme.
IDEA:: an infrastructure for detection-based adaptive consistency control in replicated services
Authors: Yijun Lu, Ying Lu, Hong Jiang
Venue: Proceedings of the 16th international symposium on High performance distributed computing (2007)

In Internet-scale distributed and replicated services, poor consistency results in poor QoS or even monetary loss. Recent research focuses on enforcing a certain consistency level, instead of perfect consistency, to strike a balance between consistency guarantee and system's scalability. In this paper, we argue that it is equally, if not more, important to achieve adaptability. I.e., the system adjusts its consistency level on the fly to suit applications. ongoing need. This paper presents IDEA (an Infrastructure for DEtection-based Adaptive consistency control), a protocol that adaptively controls consistency in replicated services by detecting inconsistency among nodes in a timely manner via an inconsistency detection framework and resolving the detected inconsistencies efficiently when necessary. Through experimentation on Planet-Lab, IDEA is evaluated from two aspects: its adaptive interface and its performance of inconsistency resolution. Results show that IDEA achieves adaptability by adjusting the consistency level according to users. preference on-demand, and it achieves low inconsistency resolution delay and incurs minimal communication cost.
Model Predictive Analysis for AutonomicWorkflow Management in Large-scale Scientific Computing Environments
Authors: Steve Nordstrom, Abhishek Dubey, Turker Keskinpala, Rahul Datta, Sandeep Neema, Ted Bapty
Venue: Proceedings of the Fourth IEEE International Workshop on Engineering of Autonomic and Autonomous Systems (2007)

In large scale scientific computing, proper planning and management of computational resources lead to higher system utilizations and increased scientific productivity. Scientists are increasingly leveraging the use of business process management techniques and workflow management tools to balance the needs of the scientific analyses with the availability of computational resources. However, the advancements in productivity from execution of workflows in a large scale computing environments are often thwarted by runtime resource failures. This paper presents our initial work toward autonomic model based fault analysis in workflow based environments.
A Traceability Method for Crosscutting Concerns with Transformation Rules
Authors: Marta S. Tabares, Ana Moreira, Raquel Anaya, Fernando Arango, Joao Araujo
Venue: Proceedings of the Early Aspects at ICSE: Workshops in Aspect-Oriented Requirements Engineering and Architecture Design (2007)

This paper proposes a traceability approach for crosscutting concerns. This approach provides a tracing semantics that allows us to identify the tracing links between the source and target elements as well as their transformation rules. These rules are verified for completeness and consistency in order to control and support the evolution of crosscutting concerns. The Health Watcher [3] case study is used to illustrate our approach.
Ants and Multiple Knapsack Problem
Authors: Urszula Boryczka
Venue: Proceedings of the 6th International Conference on Computer Information Systems and Industrial Management Applications (2007)

In this paper a new optimization algorithm based on ant colony metaphor (ACO)and a new approach for the Multiple Knapsack Problem is presented. TheMKP is the problem of assigning a subset of n items to m distinct knapsacks, such that the total profit sum of the selected items is maximized, without exceeding the capacity of each of the knapsacks. The problem has several difficulties in adaptation as well as the trail representation of the solutions of MKP or a dynamically changed heuristic function applied in this approach. Presented results show the power of the ACO approach for solving this type of subset problems.
Coordinated Multiple Views: a Critical View
Authors: Gennady Andrienko, Natalia Andrienko
Venue: Proceedings of the Fifth International Conference on Coordinated and Multiple Views in Exploratory Visualization (2007)

Hundreds of papers have been presented at the five conferences on Coordinated and Multiple Views (CMV) in Exploratory Visualization and related conferences on information visualization and visual analytics [R07]. However, CMV are still rarely implemented in commercial systems and many users are even not aware that multiple views are useful and coordination can help them to solve their problems. Even toolkits especially designed for information visualization often do not offer any coordination mechanisms for multiple views. One of possible reasons for this may be that existing CMV tools and approaches are insufficiently suited to real-life problems.
A fundamental discussion of 3-dimensional pattern matching using canonical angles between subspaces for the purpose of differentiating a face and its photograph
Authors: Ken-ichi Maeda, Osamu Yamaguchi, Kazuhiro Fukui
Venue: Systems and Computers in Japan (2007)

Three-dimensional pattern recognition requires the definition of a similarity measure between 3-dimensional patterns. We discuss how to match 3-dimensional patterns, which are represented by a set of images taken from multiple directions and approximately represented by subspaces. The proposed method is to calculate the canonical angles between two subspaces. In order to differentiate an object and its photograph, at least a canonical angle other than the smallest one is required. We discuss the usage of the canonical angle both used by itself and combination, sum and product. We also demonstrate the effectiveness of the proposed method by experiments. &copy; 2007 Wiley Periodicals, Inc. Syst Comp Jpn, 38(9): 11&ndash;20, 2007; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.20786
Integrating multiple information resources to analyze intrusion alerts
Authors: Peng Ning
Venue:  (2006)

Intrusion detection systems (IDSs) are important components of network security. However, it is well known that current IDSs generate large amount of alerts, including both true and false alerts. Other than proposing new techniques to detect intrusions without such problems, this thesis presents some work we have done in improving the study of IDS alerts by incorporating other sources of relevant information. In particular, the work covers four issues. The first issue is to integrate and reason about IDS alerts as well as reports by system monitoring or vulnerability scanning tools (discussed in Chapter 3). To facilitate the modeling of intrusion evidence, this approach classifies intrusion evidence into either event-based evidence or state-based evidence. Event-based evidence refers to observations (or detections) of intrusive actions (e.g., IDS alerts), while state-based evidence refers to observations of the effects of intrusions on system states. Based on the interdependency between event-based and state-based evidence, we developed techniques to automatically integrate complementary evidence into Bayesian networks, and reason about uncertain or unknown intrusion evidence based on verified evidence. The second issue is the study of the robustness of the Bayesian analysis framework toward inaccuracies in the assignments of prior confidence with sensitivity analysis and qualitative analysis (discussed in Chapter 4). By performing sensitivity analysis and qualitative analysis on the Bayesian networks used to reason about intrusion evidence, we can measure or approximate individual evidence&rsquo;s influence on the reasoning results. Such study on the framework's robustness properties can provide guide line for evidence collection and analyses. The third issue is to improve alert correlation by integrating alert correlation techniques with OS-level object dependency tracking (discussed in Chapter 5). With the support of more detailed and precise information from OS-level event logs, higher accuracy in alert correlation can be achieved. The chapter also discusses the application of such integration in making hypotheses about possibly missed attacks. The fourth issue is to correlate intrusion alert and other security event information from multiple heterogeneous sources while protecting the privacy for each participating parties (discussed in Chapter 6). Based on a sanitization scheme utilizing both generalization and randomization, we proposed several techniques to flexibly balance between the privacy protection and the analysis capability of the sanitized data. We also studied the various analyses supported by the sharing framework and its security against some different types of attacks. Finally, the conclusion of my dissertation is provided and future work is pointed out.
Investigation of Basic Services Interoperability Problems in Next Generation Networks
Authors: Abbas Iravani Tabrizipoor, Payam Gooran Oreimi, Mahmoud Pirhadi, Mansour Mirzabaghi, Yazdan Nasr Harandi, Mojtaba Yaghoubi Waskasi
Venue: Proceedings of the Fourth European Conference on Universal Multiservice Networks (2007)

In this paper we introduce a next generation network (NGN) pilot which was designed and implemented in Iran Telecom Research Center (ITRC). Four vendors have participated in Pilot competition. Pilot has been directed using a predefined test strategy and its main goal is evaluation of NGN services to be implemented in Iran. One of the major services to be delivered in NGN is basic call. The prime focus of this paper is explanation of different basic call test scenarios and evaluating its related issues using different test cases. Especially, the problems of a basic call set up in a multi-vendor environment which are the key problems of this line are elaborated. These all leaded us to interesting results which can be considered as future works of this field.
Non-random generator for IPv6 tables
Authors: Mei Wang, S. Deering, T. Hain, L. Dunn
Venue: Proceedings of the High Performance Interconnects, 2004. on Proceedings. 12th Annual IEEE Symposium (2004)

The next generation Internet Protocol, IPv6, has attracted growing attention. The characteristics of future IPv6 routing tables play a key role in router architecture and network design. In order to design and analyze efficient and scalable IP lookup algorithms for IPv6, IPv6 routing tables are needed. Analysis of existing IPv4 tables shows that there is an underlying structure that differs greatly from random distributions. Since there are few users on IPv6 at present, current IPv6 table sizes are small and unlikely to reflect future IPv6 network growth. Thus, neither randomly generated tables nor current IPv6 tables are good benchmarks for analysis. More representative IPv6 lookup tables are needed for the development of IPv6 routers. From an analysis of current IPv4 tables, algorithms are proposed for generating IPv6 lookup tables. Tables generated by the suggested methods exhibit certain features characteristic of real lookup tables, reflecting not only new IPv6 address allocation schemes but also patterns common to IPv4 tables. These tables provide useful research tools by a better representation of future lookup tables as IPv6 becomes more widely deployed.
A Framework for Studying Voting in Group Support Systems
Authors: Kung-E Cheng, Fadi P. Deek
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Group decision making is essential in organizations. Group Support Systems (GSS) can aide groups in making decisions by providing tools and process support. Voting tools have been considered valuable assets in groups' decision processes. However, there is an insufficiency of theory and experiments in research of voting in GSS. This paper presents a framework by identifying factors related to voting in GSS. These factors were scrutinized for their potential effects on processes and outcomes. Several ways of classifying voting methods are discussed. The framework can be used as a guiding basis for future research and usage of voting in GSS.
Lower Bound on Bandwidth for Channel Assignment in Multimedia Cellular Networks with 2-Band Buffering
Authors: Goutam K. Audhya, Bhabani P. Sinha
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

This paper deals with the minimum bandwidth requirement for channel assignment in a hexagonal cellular network with 2-band buffering, where channel interference does not extend beyond two cells. For simplicity, we consider here only two different types of multimedia signals, requiring different bandwidths. For a cellular network with single demand for each type of signal, we derive lower bounds on the minimum bandwidth, satisfying all possible frequency separation constraints for avoiding interference. The results obtained will be useful in comparing the performance of any multimedia channel assignment algorithm in regard to optimality of the bandwidth used.
Visual object concept discovery: Observations in congenitally blind children, and a computational approach
Authors: Jake V. Bouvrie, Pawan Sinha
Venue: Neurocomputing (2007)

Over the course of the first few months of life, our brains accomplish a remarkable feat. They are able to interpret complex visual images so that instead of being just disconnected collections of colors and textures, they become meaningful sets of distinct objects. Exactly how this is accomplished is poorly understood. We approach this problem from both experimental and computational perspectives. On the experimental side, we have launched a new humanitarian and scientific initiative in India, called 'Project Prakash'. This project involves a systematic study of the development of object-perception skills in children following recovery from congenital blindness. Here, we provide an overview of Project Prakash and also describe a specific study related to the development of face-perception skills following sight recovery. Based in part on the results of these experiments, we then develop a computational framework for addressing the problem of object concept discovery. Our model seeks to find repeated instances of a pattern in multiple training images. The source of complexity lies in the non-normalized nature of the inputs: the pattern is unconstrained in terms of where it can appear in the images, the background is complex and constitutes the overwhelming majority of the image, and the pattern can change significantly from one training instance to another. For the purpose of demonstration, we focus on human faces as the pattern of interest, and describe the sequence of steps through which the model is able to extract a face concept from non-normalized example images. Additionally, we test the model's robustness to degradations in the inputs. This is important to assess the model's congruence with developmental processes in human infancy, or following treatment for extended congenital blindness, when visual acuity is significantly compromised.
Enabling rapid development of parallel tree search applications
Authors: Jeffrey P. Gardner, Andrew Connolly, Cameron McBride
Venue: Proceedings of the 5th IEEE workshop on Challenges of large applications in distributed environments (2007)

Virtual observatories will give astronomers easy access to anunprecedented amount of data. Extracting scientific knowledge from these data will increasingly demand both efficient algorithms as well as the power of parallel computers. Nearly all efficient analyses of large astronomical datasets use trees as their fundamental data structure. Writing efficient tree-based techniques, a task that is time-consuming even on single-processor computers, is exceedingly cumbersome on massively parallel platforms (MPPs). Most applications that run on MPPs are simulation codes, since the expense of developing them is offset by the fact that they will be used for many years by many researchers. In contrast, data analysis codes change far more rapidly, are often unique to individual researchers, and therefore accommodate little reuse. Consequently, the economics of the current high-performance computing development paradigm for MPPs does not favor data analysis applications. We have therefore built a library, called Ntropy, that provides a flexible, extensible, and easy-to-use way of developing tree-based data analysis algorithms for both serial and parallel platforms. Our experience has shown that not only does our library save development time, it can also deliver excellent serial performance and parallel scalability. Furthermore, Ntropy makes it easy for an astronomer with little or noparallel programming experience to quickly scale their application to a distributed multiprocessor environment. By minimizing development time for efficient and scalable data analysis, we enable wide-scale knowledge discovery on massive datasets.
The Dual Ownership Model: Using Organizational Relationships for Access Control in Safety Supply Chains
Authors: Alexander Ilic, Florian Michahelles, Elgar Fleisch
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

Counterfeits and contaminated drugs are recognized as a threat to consumer safety. To fight counterfeiting and protect consumers, public health institutions such as the US FDA demand organizations to electronically document the pedigrees of prescription drugs [3]. As the documentation process involves joint collaborations of multiple organizations along the supply chain on electronic pedigrees for billions of individual goods, new and scalable access control models are needed. Therefore, this paper presents a novel concept, which leverages existing organizational relationships to manage access control based on physical possession. The concept is evaluated against other existing models and discussed.