ppxscal/embedding_network huggingface dataset:
Result Verification and Trust-Based Scheduling in Peer-to-Peer Grids
Authors: Shanyu Zhao, Virginia Lo, Chris GauthierDickey
Venue: Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing (2005)

Peer-to-peer Grids that seek to harvest idle cycles available throughout the Internet are vulnerable to hosts that fraudulently accept computational tasks and then maliciously return arbitrary results. Current strategies employed by popular cooperative computing Grids, such as SETI@Home, rely heavily on task replication to check results. However, result verification through replication suffers from two potential shortcomings: (1) susceptibility to collusion in which a group of malicious hosts conspire to return the same bad results and (2) high fixed overhead incurred by running redundant copies of the task. In this paper, we first propose a scheme called Quiz to combat collusion. The basic idea of Quiz is to insert indistinguishable quiz tasks with verifiable results known to the client within a package containing several normal tasks. The client can then accept or reject the normal task results based on the correctness of quiz results. Our second contribution is the promotion of trust-based task scheduling in peer-to-peer Grids. By coupling a reputation system with the basic verification schemes - Replication and Quiz - a client can potentially avoid malicious hosts and also reduce the overhead of verification for trusted hosts.
Web data extraction based on structural similarity
Authors: Zhao Li, Wee Keong Ng, Aixin Sun
Venue: Knowledge and Information Systems (2005)

Web data-extraction systems in use today mainly focus on the generation of extraction rules, i.e., wrapper induction. Thus, they appear ad hoc and are difficult to integrate when a holistic view is taken. Each phase in the data-extraction process is disconnected and does not share a common foundation to make the building of a complete system straightforward. In this paper, we demonstrate a holistic approach to Web data extraction. The principal component of our proposal is the notion of a document schema. Document schemata are patterns of structures embedded in documents. Once the document schemata are obtained, the various phases (e.g. training set preparation, wrapper induction and document classification) can be easily integrated. The implication of this is improved efficiency and better control over the extraction procedure. Our experimental results confirmed this. More importantly, because a document can be represented as avector of schema, it can be easily incorporated into existing systems as the fabric for integration.
Intelligent Distributed Autonomous Power Systems (IDAPS) and their Impact on Critical Electrical Loads
Authors: Manisa Pipattanasomporn, Saifur Rahman
Venue: Proceedings of the First IEEE International Workshop on Critical Infrastructure Protection (2005)

The transition toward deregulation and profitdriven operation of power systems has led to a decrease of reserves and reliability levels in various parts of the electric power network which is the backbone of the nationwide critical infrastructure. In order to improve the adequacy and security of power systems, we propose the concept of Intelligent Distributed Autonomous Power Systems (IDAPS). IDAPS is a network of several interconnected subnetworks that are cellular in structure and can operate autonomously in the event of a system fault. Each subnetwork (cell) is given enough generating capacity to secure critical loads, as well as the ability to communicate internally among generation, loads and electronic control devices. The IDAPS concept, therefore, ensures an uninterrupted supply of electricity to the high priority loads, thus maintaining the integrity of the critical infrastructure. This paper defines the concept, components and architecture of IDAPS, and demonstrates how the electronic control concept can be applied.
Lambda scheduling algorithm for file transfers on high-speed optical circuits
Authors: H. Lee, M. Veeraraghavan, H. Li, E. K. P. Chong
Venue: Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid (2004)

Scheduling resources on Grids is a well-known problem. The extension of Grids, to LambdaGrids requires scheduling of lambdas, i.e., end-to-end high-speed circuits. In this paper we propose an heuristic for the scheduling of lambdas specifically for file transfers, given that many eScience applications require high-throughput transfers of large files. We call this heuristic varying-bandwidth list scheduling (VBLS) because the scheduler returns a time-range-capacity (TRC) allocation vector with varying banchwidth levels assigned for different time ranges within the duration of a transfer. The advantage of VBLS over a fixed-bandwidth allocation scheme is that it allows the scheduler to backfill any holes left in resource allocations. Such a scheme is enabled by end host applications specifying the file size in their transfer requests. To characterize VBLS, we used analytical models and ran simulations. Our results show that VBLS performance is close to packet-switching performance, which means that file transfers can take advantage of bandwidth that becomes available subsequent to the start of transfers, a critical drawback of typical fixed-bandwidth allocation schemes in circuit-switched networks.
Defending against path-based DoS attacks in wireless sensor networks
Authors: Jing Deng, Richard Han, Shivakant Mishra
Venue: Proceedings of the 3rd ACM workshop on Security of ad hoc and sensor networks (2005)

Denial of service (DoS) attacks can cause serious damage in resource-constrained, wireless sensor networks (WSNs). This paper addresses an especially damaging form of DoS attack, called PDoS (Path-based Denial of Service). In a PDoS attack, an adversary overwhelms sensor nodes a long distance away by flooding a multi-hop end-to-end communication path with either replayed packets or injected spurious packets. This paper proposes a solution using one-way hash chains to protect end-to-end communications in WSNs against PDoS attacks. The proposed solution is lightweight, tolerates bursty packet losses, and can easily be implemented in modern WSNs. The paper reports on performance measured from a prototype implementation.
An Introduction to Network Programming the Python Way
Authors: Minor Gordon
Venue: IEEE Distributed Systems Online (2005)

A review of Foundations of Python Network Programming by John Goerzen.
Multimodal error correction for continuous handwriting recognition in pen-based user interfaces
Authors: Xugang Wang, Junfeng Li, Xiang Ao, Gang Wang, Guozhong Dai
Venue: Proceedings of the 11th international conference on Intelligent user interfaces (2006)

In this paper, we describe a multimodal error correction mechanism. It allows the user to correct errors in continuous handwriting recognition naturally by simultaneously using pen gesture and speech. A multimodal fusion algorithm is designed to enhance recognition accuracies of handwriting and speech through cross-modal influence. We have performed preliminary evaluation experiments and the results show that this multimodal mechanism can efficiently correct the errors in continuous handwriting recognition.
Codes of central Sturmian words
Authors: Arturo Carpi, Aldo de Luca
Venue: Theoretical Computer Science (2005)

A central Sturmian word, or simply central word, is a word having two coprime periods p and q and length equal to p + q - 2. We consider sets of central words which are codes. Some general properties of central codes are shown. In particular, we prove that a non-trivial maximal central code is infinite. Moreover, it is not maximal as a code. A central code is called prefix central code if it is a prefix code. We prove that a central code is a prefix (resp., maximal prefix) central code if and only if the set of its 'generating words' is a prefix (resp., maximal prefix) code. A suitable arithmetization of the theory is obtained by considering the bijection θ, called ratio of periods, from the set of all central words to the set of all positive irreducible fractions defined as: θ(ε) = 1/1 and θ(w) = p/q (resp., θ(w) = q/p) if w begins with the letter a (resp., letter b), p is the minimal period of w, and q = |w| - p + 2. We prove that a central code X is prefix (resp., maximal prefix) if and only if θ(X) is an independent (resp., independent and full) set of fractions. Finally, two interesting classes of prefix central codes are considered. One is the class of Farey codes which are naturally associated with the Farey series; we prove that Farey codes are maximal prefix central codes. The other is given by uniform central codes. A noteworthy property related to the number of occurrences of the letter a in the words of a maximal uniform central code is proved.
Automated and Safe Vulnerability Assessment
Authors: Fanglu Guo, Yang Yu, Tzi-cker Chiueh
Venue: Proceedings of the 21st Annual Computer Security Applications Conference (2005)

As the number of system vulnerabilities multiplies in recent years, vulnerability assessment has emerged as a powerful system security administration tool that can identify vulnerabilities in existing systems before they are exploited. Although there are many commercial vulnerability assessment tools in the market, none of them can formally guarantee that the assessment process never compromises the computer systems being tested. This paper proposes a featherweight virtual machine (FVM) technology to address the safety issue associated with vulnerability testing. Compared with other virtual machine technologies, FVM is designed to facilitate sharing between virtual machines but still provides strong protection between them. The FVM technology allows a vulnerability assessment tool to test an exact replica of a production-mode network service, including both hardware and system software components, while guaranteeing that the production-mode network service is fully isolated from the testing process. In addition to safety, the vulnerability assessment support system described in this paper can also automate the entire process of vulnerability testing and thus for the frst time makes it feasible to run vulnerability testing autonomously and frequently. Experiments on a Windows-based prototype show that Nessus assessment results against an FVM virtual machine are identical to those against a real machine. Furthermore, modifications to the file system and registry state made by vulnerability assessment runs are completely isolated from the host machine. Finally, the performance impact of vulnerability assessment runs on production network services is as low as 3%.
Towards a New Digital Library Infrastructure with RFID for Mobile ELearning
Authors: Raul Morales Salcedo, Hiroaki Ogata, Yoneo Yano
Venue: Proceedings of the IEEE International Workshop on Wireless and Mobile Technologies in Education (2005)

In order to provide digital library services to those users whose location is constantly changing, whose network connections are through a wireless medium, and whose computing power includes RFID technology we introduce some aspects that need to be considerate in the development of a RFID-based DL infrastructure for e-learning. In this paper, we identify issues that arise when users are mobile, classify queries that are specific to mobile users and introduce an architecture that supports flexible and transparent access to digital libraries for mobile users with the usage of RFID tags.
Consistent Modelling of Users, Devices and Sensors in a Ubiquitous Computing Environment
Authors: David J. Carmichael, Judy Kay, Bob Kummerfeld
Venue: User Modeling and User-Adapted Interaction (2005)

This paper describes the use of an accretion-resolution user modelling representation to model people, places and objects. We explain the motivation for the key properties of the representation, especially those of particular importance for ubiquitous computing: firstly, for flexibility in interpreting the typically noisy and potentially conflicting evidence about users' locations; secondly, to support users in scrutinising their user model, the processes that determine its contents and the way that it is used in the ubiquitous computing environment.A novel and important aspect of this work is our extension of the representation beyond modelling just users, using it also to represent the other elements such as devices, sensors, rooms and buildings. We illustrate our approach in terms of models we have been building for a system which enables users to gain personalised information about the sensors and services in a ubiquitous computing environment. We report experiments on the scalability and the management of inconsistency in modelling of location, based on accretion-resolution
QoS Mechanisms for the MAC Protocol of IEEE 802.11 WLANs
Authors: Jose R. Gallardo, Paul Medina, Weihua Zhuang
Venue: Proceedings of the Second International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (2005)

There are two essential ingredients for any telecommunications system to be able to provide qualityof- service (QoS) guarantees: admission control (CAC) and service differentiation. In wireless local area networks (WLANs), it is essential to carry out these functions at the MAC level. The original version of IEEE 802.11 medium access control (MAC) protocol for WLANs does not include either function. The IEEE 802.11e draft standard includes new features to facilitate the provision of QoS, but no specific mechanisms are identified in it to make them possible. This paper introduces specific mechanisms into the relevant MAC protocol to avoid over saturating the medium (via CAC) and to decide how to assign the available resources (via service differentiation through scheduling). The main contributions of this work are a novel CAC algorithm for leaky-bucket constrained traffic streams, an original packet scheduling mechanism called DM-SCFQ, and a performance study of a WLAN including these features.
Software vulnerability mitigation as a proper subset of software maintenance: Research Articles
Authors: Nadine Hanebutte, Paul W. Oman
Venue: Journal of Software Maintenance and Evolution: Research and Practice (2005)

Through the rise of the Internet and Web-based software our computing environment has evolved from well-defined topologies into loosely organized, unbounded topologies where user profiles and intentions are largely unknown. With less than 20 years experience in this chaotic computing environment, software developers and maintenance professionals are still learning efficient and systematic means of locating faults and code vulnerabilities that can be exploited by malicious users. Exponential growth in software intrusions, attacks, and security incidents has been observed worldwide. The question that arises, however, is whether software security considerations are genuinely new issues, or can they be addressed using existing definitions, technologies, and tools. That is, can we portray software vulnerabilities, especially specific instances of exploitable code, as software faults so that systematic software maintenance practices can be applied&quest; In this paper we present a longitudinal analysis of software vulnerabilities in a widely used file-transfer program, by examining 12 years of maintenance records documenting perfective, corrective, and adaptive changes to the software suite. Our analysis of the program's software faults and vulnerabilities indicate that they are not distinct categories, but rather two overlapping sets that should not be addressed separately. An in-depth analysis of two dominant security flaws shows that they are canonical software faults that can lead to failure even in the absence of malicious user behavior. Our longitudinal analysis demonstrates that every security vulnerability in the program suite could have been eliminated prior to release via proactive software maintenance engineering. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Evaluation of a Robust Middleware for Numerous Distributed Task-Handling
Authors: Masayuki Iwai, Hideyuki Tokuda
Venue: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2005)

A ubiquitous computing environment entails numerous embedded devices with enough computational power. Such distributed computing resources can cooperate to create applications which support users¿ everyday lives. Such an environment requires robust middleware that can handle a large quantity of messages, such as event data or sensor data are occurred between devices. However, the lack of middleware technologies with such functionalities has been making it difficult to create ubiquitous computing applications that we can depend on in their everyday life. In this paper, we propose a novel middleware, named RT-Dragon, which can handle numerous messages with robustness. RT-Dragon can work effectively on systems both real-time and non-realtime runtime because of the mechanism of two level priority-based task processing. In this paper additionally, we evaluate the effectiveness of RT-Dragon on non-RT runtime.
A Software/Hardware Platform for Rapid Prototyping of Video and Multimedia Designs
Authors: Paul Schumacher, Marco Mattavelli, Adrian Chirila-Rus, Robert Turney
Venue: Proceedings of the Fifth International Workshop on System-on-Chip for Real-Time Applications (2005)

Traditional design and test of complex multimedia systems involves a large number of test vectors and is a difficult and time-consuming task. The simulation times are prohibitively long on current desktop computers. Driving actual design scenarios and timing burst behavior which produce real-time effects is difficult to do with current simulation environments. This paper describes a rapid emulation framework for accessing multiple hardware IP blocks on an FPGA. This solution involves an abstraction of the FPGA platform by having a virtual socket layer that resides between the design and the test vehicles. A rapid prototyping platform is thus created, and its use with complex video and multimedia systems is described.
Web application development by nonprogrammers: user-centered design of an end-user web development tool
Authors: Jochen Rode
Venue:  (2005)

This work investigates entry barriers and approaches for facilitating end-user web application development with the particular focus on shaping web programming technology and tools according to end-users' expectations and natural mental models. My underlying assumption and motivation is that given the right tools and techniques even nonprogrammers may become successful web application developers. The main target audience for this research are &ldquo;casual&rdquo; webmasters without programming experience&mdash;a group likely to be interested in building web applications. As an important subset of web applications I focus on supporting the development of basic data collection, storage and retrieval applications such as online registrations forms, staff databases, or report tools. First I analyze the factors contributing to the complexity of web application development through surveys and interviews of experienced programmers; then I explore the &ldquo;natural mental models&rdquo; of potential end-user web developers, and finally discuss my particular design solutions for lowering entry barriers, as embodied by a proof-of-concept development tool, called Click. Furthermore, I introduce and evaluate the concept of &ldquo;Design-at-Runtime&rdquo;&mdash;a new technique for facilitating and accelerating the development-test cycle when building web-based applications.
A taxonomy of models
Authors: Harold Joseph Highland
Venue: ACM SIGSIM Simulation Digest (1973)

For years now in teaching a course in modeling and simulation, I have had the uncomfotable feeling that it is not really possible to teach <u>both</u> modeling and simulation techniques concurrently. The universality of models - an expected value model, a timelag series model for forecasting, an inventory control model, a transportation model, an educational model with projected enrollment by curriculums, to indicate but a few - has promted me to consider the developing of one course in modeling and a separate course to be taken afterwards in simulation methods.
Some Existence Results for Vector Quasivariational Inequalities Involving Multifunctions and Applications to Traffic Equilibrium Problems
Authors: Phan Quoc Khanh, Le Minh Luu
Venue: Journal of Global Optimization (2005)

Some existence results for vector quasivariational inequalities with multifunctions in Banach spaces are derived by employing the KKM-Fan theorem. In particular, we generalize a result by Lin, Yang and Yao, and avoid monotonicity assumptions. We also consider a new quasivariational inequality problem and propose notions of weak and strong equilibria while applying the results to traffic network problems.
Fast Frequent String Mining Using Suffix Arrays
Authors: Johannes Fischer, Volker Heun, Stefan Kramer
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

We present a method to mine strings that are frequent in one database and infrequent in another. The method uses suffix- and lcp-arrays that can be computed extremely fast and space efficiently, and further exhibit a good locality behavior. Experiments with several biologically relevant data sets show that our approach outperforms existing methods in terms of time and space.
Anonymous yet accountable access control
Authors: Michael Backes, Jan Camenisch, Dieter Sommer
Venue: Proceedings of the 2005 ACM workshop on Privacy in the electronic society (2005)

This paper introduces a novel approach for augmenting attribute-based access control systems in a way that allows them to offer fully anonymous access to resources while at the same time achieving strong accountability guarantees. We assume that users hold attribute certificates and we show how to exploit cryptographic zero-knowledge proofs to allow requesting users to prove that they hold suitable certificates for accessing a resource. In contrast to the commonly taken approach of sending all possibly relevant certificates to the access control system, our approach hence does not release any information to the access control system except for the presence of a set of certificates satisfying the access condition. This constitutes the minimal amount of information that has to be released for coming up with a correct access decision, and our approach is the first to achieve this. Additionally given a trusted third party for identity escrow, we furthermore show that a concise application of zero-knowledge proofs offers the access control system the capability to hold a requesting user accountable for her actions under specific, well-defined conditions. All the employed cryptographic techniques are highly efficient, and an architecture for exploiting our approach in practical scenarios is already in place.
A neurofuzzy scheme to on-line identification in an adaptive&#x2013;predictive control
Authors: J. Ibarrola, M. Pinzolas, M. Cano
Venue: Neural Computing and Applications (2006)

A neurofuzzy scheme has been designed to carry out on-line identification, with the aim of being used in an adaptive&#x2013;predictive dynamic matrix control (DMC) of unconstrained nonlinear systems represented by a transfer function with varying parameters. This scheme supplies to the DMC controller the linear model and the nonlinear output predictions at each sample instant, and is composed of two blocks. The first one makes use of a fuzzy partition of the external variable universe of discourse, which smoothly commutes between several linear models. In the second block, a recurrent linear neuron with interpretable weights performs the identification of the models by means of supervised learning. The resulting identifier has several main advantages: interpretability, learning speed, and robustness against catastrophic forgetting. The proposed controller has been tested both on simulation and on a real laboratory plant, showing a good performance.