ppxscal/embedding_network huggingface dataset:
Assistance for the Design of a Diagnosable Component-Based System
Authors: Yannick Pencole
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

Diagnosability of component-based systems is a property that characterises the ability to diagnose fault events given a flow of observations. In this paper, we use model-based reasoning techniques and we propose a theoretical framework to analyse diagnosability in a decentralised way. We then introduce an algorithm that performs diagnosability analyses and provides useful information for the design of a diagnosable component-based system.
Implementation of Concurrent Checking Circuits by Independent Sub-circuits
Authors: Vladimir Ostrovsky, Ilya Levin
Venue: Proceedings of the 20th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2005)

The present paper proposes a new method for detecting arbitrary faults in a functional circuit when the set of codewords is limited and known in advance. The method is based on implementation of the functional circuit by a plurality of separate independent sub-circuits. Each of such sub-circuits generates its own subset of output signals. Since the sub-circuits do not have common elements, any single fault may result in errors only in one of the subsets. The paper presents a solution of the problem of optimal partition of the set of output variables into independent subsets. A number of properties of partitions are proven. The proposed algorithms of the optimal partition are based on these properties. A scheme of the checker for the proposed self-checking approach is presented. Benchmarks¿ results indicate efficiency of the described technique.
The strong conical hull intersection property for convex programming
Authors: V. Jeyakumar
Venue: Mathematical Programming: Series A and B (2006)

The strong conical hull intersection property (CHIP) is a geometric property of a collection of finitely many closed convex intersecting sets. This basic property, which was introduced by Deutsch et al. in 1997, is one of the central ingredients in the study of constrained interpolation and best approximation. In this paper we establish that the strong CHIP of intersecting sets of constraints is the key characterizing property for optimality and strong duality of convex programming problems. We first show that a sharpened strong CHIP is necessary and sufficient for a complete Lagrange multiplier characterization of optimality for the convex programming model problem **where C is a closed convex subset of a Banach space X, S is a closed convex cone which does not necessarily have non-empty interior, Y is a Banach space, ** is a continuous convex function and g:X&#x2192;Y is a continuous S-convex function. We also show that the strong CHIP completely characterizes the strong duality for partially finite convex programs, where Y is finite dimensional and g(x)=&#x2212;Ax+b and S is a polyhedral convex cone. Global sufficient conditions which are strictly weaker than the Slater type conditions are given for the strong CHIP and for the sharpened strong CHIP.
IDEAS: Intrusion Detection based on Emotional Ants for Sensors
Authors: Soumya Banerjee, Crina Grosan, Ajith Abraham
Venue: Proceedings of the 5th International Conference on Intelligent Systems Design and Applications (2005)

Due to the wide deployment of sensor networks recently security in sensor networks has become a hot research topic. Popular ways to secure a sensor network are by including cryptographic techniques or by safeguarding sensitive information from unauthorized access/manipulation and by implementing efficient intrusion detection mechanisms. This paper proposes a novel ant colony based intrusion detection mechanism which could also keep track of the intruder trials. The IDEAS technique could work in conjunction with the conventional machine learning based intrusion detection techniques to secure the sensor networks. The algorithm is presented and illustrated by simulating a sensor network.
Speculative Markov Blanket Discovery for Optimal Feature Selection
Authors: Sandeep Yaramakala, Dimitris Margaritis
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

In this paper we address the problem of learning the Markov blanket of a quantity from data in an efficient manner. Markov blanket discovery can be used in the feature selection problem to find an optimal set of features for classificationtasks, and is a frequently-used preprocessing phase in data mining, especially for high-dimensional domains. Our contribution is a novel algorithm for the induction of Markov blankets from data, called Fast-IAMB, that employs a heuristic to quickly recover the Markov blanket. Empirical results show that Fast-IAMB performs in many cases faster and more reliably than existing algorithms without adversely affecting the accuracy of the recovered Markov blankets.
A Fuzzy Hierarchical Attributed Graph Approach for Handwritten Egyptian Hieroglyphs description and matching.
Authors: Denis Arrivault, Noel Richard, Philippe Bouyer
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

For a complex writting as egyptian hieroglyphs, combining the works done in hierarchical modelizations and fuzzy grammar definitions seems natural. This paper introduce the hierarchical-fuzzy-attributed graph (FHAG), extended from fuzzy-attributed graph, which modelize attributes by fuzzy-tree grammar. We give a formal definition of FHAGs and introduce adapted measurements for matching them. FHAG is then integrated in a recognition system based on single models comparisons for handwritten egyptian hieroglyphs.
Fighting Spam with Reputation Systems
Authors: Vipul Ved Prakash, Adam O'Donnell
Venue: Queue (2005)

Spam is everywhere, clogging the inboxes of e-mail users worldwide. Not only is it an annoyance, it erodes the productivity gains afforded by the advent of information technology. Workers plowing through hours of legitimate e-mail every day also must contend with removing a significant amount of illegitimate e-mail. Automated spam filters have dramatically reduced the amount of spam seen by the end users who employ them, but the amount of training required rivals the amount of time needed simply to delete the spam without the assistance of a filter.
Computational studies on evolution and functionality of genomic repeats
Authors: S. Cenk Sahinalp
Venue:  (2005)

Human DNA consists of a large number of repeat sequences. The repeat sequences can be in the form of tandem repeats and interspersed repeats and cover more than 60% of the human genome sequence. Segmental repeats are a result of duplication events that have occurred during the evolution of human genome. This dissertation presents an algorithmic and computational study of the repeat sequences with emphasis on the identification of the location and order of duplication events as well as the identification of the responsible cellular mechanisms. A complementary goal of this work is to study the effect of the repeat sequences to gene regulation. Thus it provides a comprehensive study of the evolution and function of repeat sequences in the human genome. The primary example of tandem repeat sequences in the human genome are the centromeric alpha-satellite DNA that consists of arbitrary monomer pairs of size approximately 171bp. Although it is possible that alpha-satellite sequences developed as a result of subsequent unequal crossovers only, no formal computational framework had been developed to verify this possibility. This thesis includes such a framework and reports on experiments which imply that pericentromeric alpha-satellite segments are evolutionarily distinct from the higher-order repeat segments. Certain repeat sequences are not only interesting for evolutionary studies but also have essential functional properties. Recent studies demonstrate the existence of special antisense RNAs used in post-transcriptional gene regulation through binding with duplicate target sequences in the mRNA. These RNAs are known to be synthesized naturally to control gene expression in C. elegans, Drosophila and other organisms, or regulate plasmid copy numbers in E. coli; they have also been artificially constructed to knock-out genes of interest in humans and other organisms in order to find out their functions as well as for other purposes. Several computational methods can be used to predict the secondary structure of a single RNA molecule, but no such algorithm exists for reliably predicting the joint secondary structure of two interacting RNA molecules, or measuring the stability of such a joint structure. This dissertation presents a combinatorial approach for solving the RNA-RNA interaction prediction problem between an antisense RNA and its target mRNA. Three main models for joint structure prediction are introduced, and the proposed methods are applied to discover targets for any given antisense RNA in whole genomic and plasmid sequences.
A Rate-Efficient Peer-to-Peer Architecture for Video Multicasting over the Internet
Authors: B. Akbari, H. R. Rabiee, M. Ghanbari
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

In this paper we propose a rate-efficient peer-topeer architecture for video multicasting over the Internet. The limited capacity of the Internet hosts and the heterogeneous property of their access links are the main challenges of the peer-to-peer video multicasting over the Internet. Although, the rateoptimized overlay tree construction is a NP-hard problem, we propose a number of distributed and efficient protocols for rate-efficient overlay tree construction. Our proposed protocols include efficient join, improvement, overlay tree refinement and an optimum rate allocation protocol. The simulation results show the efficiency of the proposed protocols in rate-efficient overlay tree construction. We show that through combination of the efficient join protocol, tree refinement operations and an optimum rate allocation algorithm we can achieve a suboptimum overlay tree.
Phoenics: partitioning hardware/software embedded systems via non-intrusive interactive constraint satisfaction
Authors: Mave Talibra Houston
Venue:  (2005)

In the design of mixed hardware/software systems, it becomes necessary to decide which functions in the system specification will be implemented in hardware, and which functions will be implemented in software. This process of determination is called hardware/software partitioning. Formally, hw/sw partitioning is defined as taking a specification for an embedded system and then assigning the functions in that specification to hardware or software. The functions can range in granularity from lines of source code to full functions/procedures or circuit schematics. Additionally, the hardware/software partitioning problem belongs to a class of open research problems characterized by a problem solving process where users must integrate large amounts of data, as well as make sense of the interplay between complex constraints, in order to arrive at a solution. Humans have typically done this partitioning task by hand, using a number of effective rules of thumb, for many years. However, human designs are generally not optimal, and automated optimization algorithms can do better in some, but not all cases. The automated designs typically make no sense to a human designer, since the semantics of the system were not understandable by the algorithm. Further, the human's rules of thumb can also lead to more efficient designs in some cases, for reasons not well understood. In order to make the most of the user's knowledge and the optimization algorithms available, the PHOENICS tool combines these approaches by letting the algorithm provide its computational power to assist the human designer, and by employing a combination of clustering and inductive generalization techniques to simultaneously and unobtrusively acquire constraints from the user. This produces a better and a more understandable design.
Moset: An anonymous remote mobile cluster computing paradigm
Authors: M.A. Maluk Mohamed, A. Vijay Srinivas, D. Janakiram
Venue: Journal of Parallel and Distributed Computing (2005)

The advance of technology in terms of cellular communications and the increasing computing power of the mobile systems have made it convenient for people to use more of mobile systems rather than static systems. This has seen more of mobile devices in personal and distributed computing, thus making the computing power ubiquitous. The combination of wireless communication and cluster computing in many applications has led to the integration of these two technologies to emerge as Mobile Cluster Computing (MCC) paradigm. This has made parallel computing feasible on mobile clusters, by making use of the idle processing power of the static and mobile nodes that form the cluster. To realize such a system for parallel computing, various issues such as connectivity, architecture and operating system heterogeneities, timeliness issues, load fluctuations on machines, machine availability variations and failures in workstations and network connectivities need to be handled. Moset, an Anonymous Remote Mobile Cluster Computing (ARMCC) paradigm is being proposed to handle these issues. Moset provides transparency to mobility of nodes, distribution of computing resources and heterogeneity of wired and wireless networks. The model has been verified and validated by implementing a distributed image-rendering algorithm over a simulated mobile cluster model.
WildCAT: a generic framework for context-aware applications
Authors: Pierre-Charles David, Thomas Ledoux
Venue: Proceedings of the 3rd international workshop on Middleware for pervasive and ad-hoc computing (2005)

We present WildCAT, an extensible Java framework to ease the creation of context-aware applications. WildCAT provides a simple yet powerful dynamic model to represent an application's execution context. The context information can be accessed by application programmers through two complimentary interfaces: synchronous requests (pull mode) and asynchronous notifications (push mode). Internally, WildCAT is designed as a framework supporting different levels of extensions, from the simple configuration of the default generic implementation to completely new implementations tailored to specific needs. A given application can mix different implementations for different aspects of its context while only depending on WildCAT's simple and unified API.
[hid] toolkit: a unified framework for instrument design
Authors: Hans-Christoph Steiner
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

The [hid] toolkit is a set of software objects for designing gestural instruments. All too frequently, computer performers are tied to the keyboard/mouse/monitor model, narrowly constraining the range of possible gestures. A multitude of off-the-shelf input devices are readily available, making it easy to utilize a broader range of gestures. Human Interface Devices (HIDs) such as joysticks, tablets, and gamepads are cheap and can be good musical controllers, with some even provide haptic feedback. The [hid] toolkit provides a unified, consistent framework for getting gestural data from these devices, controlling the feedback, and mapping this data to the desired output. The [hid] toolkit is built in Pd, which provides an ideal platform for this work, combining the ability to synthesize and control audio, video, and other media. The addition of easy access to gestural data allows for rapid prototypes. A usable environment also makes computer music instrument design accessible to novices.
Modeling insider attacks on group key-exchange protocols
Authors: Jonathan Katz, Ji Sun Shin
Venue: Proceedings of the 12th ACM conference on Computer and communications security (2005)

Protocols for authenticated key exchange (AKE) allow parties within an insecure network to establish a common session key which can then be used to secure their future communication. It is fair to say that group AKE is currently less well understood than the case of two-party AKE; in particular, attacks by malicious insiders --- a concern specific to the group setting --- have so far been considered only in a relatively "ad-hoc" fashion. The main contribution of this work is to address this deficiency by providing a formal, comprehensive model and definition of security for group AKE which automatically encompasses insider attacks. We do so by defining an appropriate ideal functionality for group AKE within the universal composability (UC) framework. As a side benefit, any protocol secure with respect to our definition is secure even when run concurrently with other protocols, and the key generated by any such protocol may be used securely in any subsequent application.In addition to proposing this definition, we show that the resulting notion of security is strictly stronger than the one proposed by Bresson, et al. (termed "AKE-security"), and that our definition implies all previously-suggested notions of security against insider attacks. We also show a simple technique for converting any AKE-secure protocol into one secure with respect to our definition.
Simulation of operating systems: a functional flowchart
Authors: N. D. Francis
Venue: ACM SIGSIM Simulation Digest (1981)

A functional flowchart for simulating 0.S/360 under HASP is presented. The flow chart which uses some of the GPSS concepts is simple and easy to understand and the methodology can be easily adapted for simulating other operating systems in any high level language.
Weak $$(\mathfrak{m},\;\mathfrak{n})$$-distributivity of lattice ordered groups and of generalized MV-algebras
Authors: J&#x00e1;n Jakub&#x00ed;k
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2006)

Let $$\mathfrak{m}\;{\text{and}}\;\mathfrak{n}$$ be cardinals. The concept of weak $$(\mathfrak{m},\;\mathfrak{n})$$-distributivity of Boolean algebras was intoduced by Sikorski. In the present paper we investigate this concept for lattice ordered groups and for generalized MV-algebras. We prove that the collection of all lattice ordered groups which are weakly $$(\mathfrak{m},\;\mathfrak{n})$$-distributive is a radical class. An analogous result is valid for generalized MV-algebras. A Sikorski&#x2019;s result concerning Boolean algebras is extended for the case of generalized MV-algebras.
A Novel Tuneable Low-Intensity Adversarial Attack
Authors: Salil S. Kanhere, Anjum Naveed
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

Currently, Denial of Service (DoS) attacks remain amongst the most critical threats to Internet applications. The goal of the attacker in a DoS attack is to overwhelm a shared resource by sending a large amount of traffic thus, rendering the resource unavailable to other legitimate users. In this paper, we expose a novel contrasting category of attacks that is aimed at exploiting the adaptive behavior exhibited by several network and system protocols such as TCP. The goal of the attacker in this case is not to entirely disable the service but to inflict sufficient degradation to the service quality experienced by legitimate users. An important property of these attacks is the fact that the desired adversarial impact can be achieved by using an non-suspicious low-rate attack stream, which can easily evade detection. Further by tuning various parameters of the attack traffic stream, the attacker can inflict varying degrees of service degradation and at the same time making it extremely difficult for the victim to detect attacker presence. Our simulation based experiments validate our observations and demonstrate that an attacker can significantly degrade the performance of the TCP flows by inducing lowrate attack traffic which is co-ordinated to exploit the congestion control behavior of TCP.
Exploring Mesh and Tree-Based Multicast Routing Protocols for MANETs
Authors: Kumar Viswanath Katia Obraczka
Venue: IEEE Transactions on Mobile Computing (2006)

Recently, it became apparent that group-oriented services are one of the primary application classes targeted by MANETs. As a result, several MANET-specific multicast routing protocols have been proposed. Although these protocols perform well under specific mobility scenarios, traffic loads, and network conditions, no single protocol has been shown to be optimal in all scenarios. The goal of this paper is to characterize the performance of multicast protocols over a wide range of MANET scenarios. To this end, we evaluate the performance of mesh and tree-based multicast routing schemes relative to flooding and recommend protocols most suitable for specific MANET scenarios. Based on the analysis and simulation results, we also propose two variations of flooding, scoped flooding and hyper flooding, as a means to reduce overhead and increase reliability, respectively. Another contribution of the paper is a simulation-based comparative study of the proposed flooding variations against plain flooding, mesh, and tree-based MANET routing. In our simulations, in addition to "synthetic” scenarios, we also used more realistic MANET settings, such as conferencing and emergency response.
Human Contour Extraction Using Level Set
Authors: Lin Liu, Sanyuan Zhang, Yin Zhang, Xiuzi Ye
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

Human contour information is important for human activity understanding and human motion capture. Traditional human contour extraction methods are based on image morphological operation, but they will fail when the contour information is dim and discontinuous. In this paper, a novel method using level set technique for human contour extraction in video frames with still background is proposed. Firstly the human profile is detected via image difference with background. After appropriate thresholding and morphological operation, the possible human profile region is then found out according to the image projection using the detected region boundary as the initial evolving curve, the accurate human contour is extracted using a modified level set method, experiments show that this method is faster and more efficient than traditional level set methods.
Agent-based Mobile Service Discovery in Grid Computing
Authors: Yanxiang He, Weidong Wen, Hui Jin, Haowen Liu
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

This paper proposes a MA-MSMA (Mobile Service Management Architecture based on Mobile Agent) for grid computing and detailedly describes its service discovery. At the meta-level, a hierarchy of identical agents is used to provide an abstraction of the system architecture. Each agent is able to provide grid services and request grid services. When an agent moves with its grid services, some registration and unregistration processes are invoked, and mobile service discovery should be timely and efficient. MA-MSMA provides an efficient way to support highly dynamic and mobile grid services. Its mobile service discovery takes an efficient way for grid mobile services.