ppxscal/embedding_network huggingface dataset:
Challenges of Establishing a Software Product Line for an Aerospace Engine Monitoring System
Authors: Ibrahim Habli, Tim Kelly
Venue: Proceedings of the 11th International Software Product Line Conference (2007)

The introduction of a software product line may pose a great organizational challenge in the domain of highintegrity systems. Project and technical managers within an organization need to be assured that the reusable assets of a product line are reliable and trustworthy, particularly when project teams do not have full control over the development of these assets. In this paper we report on our experience with the establishment of a software product line for an aerospace Engine Monitoring Unit (EMU). Specifically, we report on challenges encountered with the configuration management and certification of EMU products derived from the product line. These two areas are still to be addressed adequately by the product line community as they are central for the management of product line assets across different projects within an organization.
Comparative Performance Analysis of Single Bus Multiprocessor Architectures
Authors: M. A. Marsan
Venue: IEEE Transactions on Computers (1982)

Markovian models are developed for the performance analysis and comparison of several single bus multiprocessor architectures. Processors are assumed to cooperate in a message passing fashion, and messages are exchanged through common memory areas. Four architectures are considered in this paper which differ in the location of the common memory modules. Contention for shared resources is modeled and the corresponding efficiency loss is studied. Numerical results are obtained for the processing power of each architecture, introducing simplifying assumptions that allow a compact Markovian system description.
Performance analysis and comparison of interrupt-handling schemes in gigabit networks
Authors: K. Salah, K. El-Badawi, F. Haidari
Venue: Computer Communications (2007)

Interrupt processing can be a major bottleneck in the end-to-end performance of Gigabit networks. The performance of Gigabit network end hosts or servers can be severely degraded due to interrupt overhead caused by heavy incoming traffic. In particular, excessive latency and significant degradation in system throughput can be encountered. Also, user applications may livelock as the CPU power gets mostly consumed by interrupt handling and protocol processing. A number of interrupt-handling schemes has been proposed and employed to mitigate the interrupt overhead and improve OS performance. Among the most popular interrupt-handling schemes are normal interruption, polling, interrupt coalescing, and disabling and enabling of interrupts. In previous work, we presented a preliminary analytical study and models of normal interruption and interrupt coalescing. In this article, we extend our analysis and modeling to include polling and the scheme of interrupt disabling and enabling. For polling, we study both pure (or FreeBSD-style) polling and Linux NAPI polling. The performances for all these schemes are compared using both mathematical analysis and discrete-event simulation. The performance is studied in terms of three key performance indicators: throughput, system latency, and the residual CPU bandwidth available for user applications. As opposed to our previous work, we consider not only Poisson traffic, but also bursty traffic with empirical packet size distribution. Our analysis and simulation work gives insight into predicting the system performance and behavior when employing a certain interrupt-handling scheme. It is concluded that no single interrupt-handling scheme outperforms all other schemes under all traffic conditions. Based on obtained results, we propose and discuss a novel hybrid scheme of interrupt disabling-enabling and pure polling in order to attain peak performance under low and heavy traffic loads.
Security Enhancement of a Remote User Authentication Scheme Using Bilinear Pairings and ECC
Authors: Duc-Liem Vo, Kwangjo Kim
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

Remote authentication is an important mechanism to control user access to remote systems and a passwordbased authentication is a preferable method. With advances in elliptic curve cryptography, Jia et al. [10] proposed a remote user authentication scheme with a smart card. Their scheme utilized bilinear pairings and an elliptic curve El- Gamal encryption scheme to provide a secure authentication mechanism. However, we show that their scheme is vulnerable to our impersonation attack which any adversary can be authenticated successfully with probability 1 at no extra cost. We also suggest our provably secure improvement scheme which is verified to be more efficient from the point of computational complexity than the original scheme.
k-Strongly Connected m-Dominating and Absorbing Set in Wireless Ad Hoc Networks with Unidirectional Links
Authors: Ravi Tiwari, Tania Mishra, Yingshu Li, My T. Thai
Venue: Proceedings of the International Conference on Wireless Algorithms,Systems and Applications (2007)

Since there is no fixed infrastructure or centralized management in wireless ad hoc networks (WANs), virtual backbone has been proposed as the routing infrastructure to alleviate the broadcasting storm problem [6]. Because the virtual backbone nodes need to carry other node's traffic and subject to failure, it is desirable to construct a fault tolerant virtual backbone. Most recent research has studied this problem in homogeneous networks. In this paper, we propose solutions for efficient construction of a fault-tolerant virtual backbone where the wireless nodes have different transmission ranges. Such a network can be modeled as a disk graph where any link between two nodes is either unidirectional or bidirectional. Since the graph is directed, we formulate the fault tolerant virtual backbone problem as a k- Strongly Connected m-Dominating and Absorbing Set problem (k-m-SCDAS). We first propose two heuristics, one to construct a 1-m-SCDAS and the other one to obtain a k-1-SCDAS in a directed graph. We next combine these two approaches to develop a general construction of k-m-SCDAS. Through extensive simulations, we compare the performance of these proposed algorithms.
Analysis of BPEL Data Dependencies
Authors: Yongyan Zheng, Jiong Zhou, Paul Krause
Venue: Proceedings of the 33rd EUROMICRO Conference on Software Engineering and Advanced Applications (2007)

BPEL is a de-facto standard language for web service orchestration. It is a challenge to test BPEL processes automatically because of the complex features of the language. The current formal semantics proposed for BPEL can be categorized under three branches: Process Algebra, Petrinets, and Automata. Our goal is to automate the generation and execution of test cases for composed web services. Model checking is an effective technique for automated test generation, and most mature model checkers such as SPIN and NuSMV use automata as the underlying formal model. Hence, we follow the automata branch. Unfortunately, the current automata based approaches omit the BPEL data dependencies. In order to address this shortcoming, we demonstrate how to model BPEL data dependencies in our proposed web service automata.
Testing Comparison Faults of Ternary Content Addressable Memories with Asymmetric Cells
Authors: Jin-Fu Li
Venue: Proceedings of the 16th Asian Test Symposium (2007)

Ternary content addressable memory (TCAM) is one key component in the dedicated hardware modulars for high-performance networking applications. Symmetric and asymmetric cells are two widely used cell structures in TCAMs. An asymmetric cell consists of a binary content addressable memory (BCAM) bit and a mask bit. This paper proposes two march-like test algorithms, ... and to cover the comparison faults of the BCAM cell and the comparison logic faults of the masking cell. .... requires 7 Write operations and (3+2) Compare operations to cover the comparison faults of an -bit TCAM with Hit output only. .. requires 4 Write operations and (3+2) Compare operations to cover the comparison faults of an ..-bit TCAM with priority address encoder (PAE) output.
Lower Bounds on Lifetime of Three Dimensional UWB Sensor Networks
Authors: Juan Xu, Yongfa Hong, Changjun Jiang
Venue: Proceedings of the International Conference on Wireless Algorithms,Systems and Applications (2007)

Considering three dimensional time hopping ultra wide band (TH-UWB) sensor networks with n sensor nodes uniformly and independently distributed in a cube of unit volume, the asymptotic lower bounds on the lifetime of non-cluster-based and cluster-based three dimensional TH-UWB sensor networks are derived irrespectively. For static three dimensional TH-UWB sensor networks, our finding is that the lower bound on the lifetime of cluster-based network is ()3/)log/(ánnÙand that the lower bound on the lifetime of non-cluster-based network is ()3/)3()log/(.Ùánn, thus clustering can significantly improve the lower bound on network lifetime. The results also indicate that for non-cluster-based three dimensional TH-UWB sensor network the lower bound on the lifetime in idea case is longer than that of static network by a factor of , thus sensor nodes or sink moving randomly in the sensor field can improve the lower bound on lifetime of network.
A Method for Solving Arbitrary-Wall Mazes by Computer
Authors: I. E. Sutherland
Venue: IEEE Transactions on Computers (1969)

A method for solving mazes with extended open areas and arbitrarily placed walls is described. This method reduces large open areas containing many possible paths to a small set of shortest paths. It is then possible to use Moore's algorithm of which the paper includes a summary. A computer simulation of a vehicle exploring an unknown maze is discussed. Crude navigation and measurement are sufficient for maze solving with the techniques described.
An Approximation Algorithm for Data Storage Placement in Sensor Networks
Authors: Bo Sheng, Chiu C. Tan, Qun Li, Weizhen Mao
Venue: Proceedings of the International Conference on Wireless Algorithms,Systems and Applications (2007)

Data storage has become an important issue in sensor networks as a large amount of collected data needs to be archived for future information retrieval. This paper proposes to introduce storage nodes that can store data collected from the sensors in their proximities. The storage nodes alleviate the heavy load of transmitting all the data to a central place for archiving and reduce the communication cost induced by the network query. This paper considers the storage node placement problem to minimize the total power consumption for data funneling to the storage nodes and data query. We formulate it as an integer linear programming problem and present an approximation algorithm based on a rounding technique. Our simulation shows that our approximation algorithm performs well in practice.
Direction detection method using active RFID
Authors: Kazunori Hashizume, Shigeo Kaneda, Hirohide Haga
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

Recently, communication between participants about children's development has become more necessary in kindergartens and nurseries. Thus, we have been developing an Interactive Communication System through which participants communicate about childhood education using motion pictures recorded in kindergartens and nurseries. This system requires ex-post selection of motion pictures. However, since teachers shouldn't be burdened, we propose a direction detection method using an Active RFID system that features automatic selection based on direction and individual information from estimation by the RFID system. In this paper, we show the direction detection method and evaluate it. In general, radio waves sent by tags are not spatially uniform, and such directivity decreases accuracy in conventional positioning methods. We observed such directivity of the tag, and the tag's direction on the horizontal plane is derived from radio field intensity measured by two or more RFID Readers. A detection area (3.6 m × 3.6 m) was set up indoors room, and the evaluation experiment was conducted using four readers. Accuracy specified within 90° of the error was 84%.
The estimation of cortical activity for brain-computer interface: applications in a domotic context
Authors: F. Babiloni, F. Cincotti, M. Marciani, S. Salinari, L. Astolfi, A. Tocci, F. Aloise, F. De Vico Fallani, S. Bufalari, D. Mattia
Venue: Computational Intelligence and Neuroscience (2007)

In order to analyze whether the use of the cortical activity, estimated from noninvasive EEG recordings, could be useful to detect mental states related to the imagination of limb movements, we estimate cortical activity from high-resolution EEG recordings in a group of healthy subjects by using realistic head models. Such cortical activity was estimated in region of interest associated with the subject's Brodmann areas by using a depth-weighted minimum norm technique. Results showed that the use of the cortical-estimated activity instead of the unprocessed EEG improves the recognition of the mental states associated to the limb movement imagination in the group of normal subjects. The BCI methodology presented here has been used in a group of disabled patients in order to give them a suitable control of several electronic devices disposed in a three-room environment devoted to the neurorehabilitation. Four of six patients were able to control several electronic devices in this domotic context with the BCI system.
A Methodical Approach to Analyzing and Synthesizing a Self-Repairing Computer
Authors: D. C. Dorrough
Venue: IEEE Transactions on Computers (1969)

The literature on computer reliability is replete with very convincing arguments for the need and the use of self-repair techniques, as a viable approach to significantly enhancing the reliability of both maintainable and nonmaintainable computers. However, it would seem that no comprehensive and coherent program for the development and optimal employment of such techniques exists. This means that no method exists in the open literature for deciding the following: 1) what self-repair techniques, taken singularly or in combination, provide the greatest improvement in reliability; 2) what methods are optimum for initiating fault diagnosis and self-repair by redundancy and replacement; 3) what constitutes a closed set of self-repair techniques and what theory can be formulated to demonstrate the set's completeness; and 4) what is the effect of self-repair on the total system relative to design, maintenance, availability, and so forth.
Multi-document Summarization Based on Cohesion with Disambiguation
Authors: Yanmin Chen, Xizhong Lou
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

The mass information of Internet boosts the requirement for quick and accurate methods of information acquisition. To fulfill the requirement for high quality multi-document system, this paper investigates using lexical cohesion as a model of multiple-documents written in Chinese to generate an indicative, moderately fluent summary. The method constructs lexical chains with polysemant disambiguation and identifies strong chains first. An unique disambiguation method that combined the sense definitions in the dictionary with the expanded context of the words is presented. Then significant sentences that extracted from each document are merged, and redundant information are recognized and removed. Finally, the summary is generated in chronological order. Evaluation results show that the performance of the presented system is obviously better than that of the baseline system.
Dereverberation by using time-variant nature of speech production system
Authors: Takuya Yoshioka, Takafumi Hikichi, Masato Miyoshi
Venue: EURASIP Journal on Advances in Signal Processing (2007)

This paper addresses the problem of blind speech dereverberation by inverse filtering of a room acoustic system. Since a speech signal can be modeled as being generated by a speech production system driven by an innovations process, a reverberant signal is the output of a composite system consisting of the speech production and room acoustic systems. Therefore, we need to extract only the part corresponding to the room acoustic system (or its inverse filter) from the composite system (or its inverse filter). The time-variant nature of the speech production system can be exploited for this purpose. In order to realize the time-variance-based inverse filter estimation, we introduce a joint estimation of the inverse filters of both the time-invariant room acoustic and the time-variant speech production systems, and present two estimation algorithms with distinct properties.
Interference-Free TDMA Slot Allocation in Wireless Sensor Networks
Authors: Mario Nunes, Antonio Grilo, Mario Macedo
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

This paper presents a distributed algorithm for efficient Time Division Multiple Access (TDMA) slot allocation in Wireless Sensor Networks. Unlike most of the existent proposals, which try to guarantee interference-free allocation based on the n-hop criterion (which can only work with regular topologies), the presented algorithm bases its decisions on the received signal strength, allowing it to operate independently of the WSN topology. The performance of the proposed slot allocation algorithm was compared with centralized depth-first slot allocation using computer simulation. The results show that the proposed scheme is significantly faster, only paying the price of extra energy consumption during the initial network setup phase.
SASSI: the sliverware architecture for sensor system integration
Authors: Seth Holloway, Alexander Griffith, Angela Dalton, Drew Stovall, Christine Julien
Venue: Proceedings of the 5th international conference on Embedded networked sensor systems (2007)

Recently, embedded sensor usage has increased thanks to the proliferation of hardware and software addressing resource constraints. While the increased usage is a good start, it is important to adopt good software engineering principles early for many reasons: simplified programming and deployment, improved reuse, and added efficiency. This poster presents SASSI, the Sliverware Architecture for Sensor System Integration, which provides a unique embedded sensor application architecture.
Test Generation Techniques
Authors: S. B. Akers
Venue: Computer (1980)

Existing test generation procedures are rooted in the SSI/MSI era. New techniques will cope with today's vastly more complicated LSI/VLSI systems.
A Look at the Future
Authors: L. C. Hobbs
Venue: Computer (1976)

If predictions about the future were as easy to come by as judgments about the past, the set of papers I organized for this 25th Anniversary issue might well have focused on the next 25 years particularly since other papers in this issue deal with the corresponding past quartercentury. But predicting the future is always a chancey business, and trying to look 25 years into the future of our fast-moving industry is a long shot indeed. So, sacrificing symmetry for caution, we have focused most of our attention on the nearer term.
GWB: A Solid Modeler with Euler Operators
Authors: M. Mantyla
Venue: IEEE Computer Graphics and Applications (1982)

In Helsinki, a Small but General Set of Manipulative Operations for Boundary Models of Solid Objects Has Been Used to Construct a Comprehensive Solid Modeling System.
On Integrating Radio, Computing, and Application Resource Management in Cognitive Radio Systems
Authors: Vuk Marojevic, Jose Salazar, Xavier Reves, Antoni Gelonch
Venue: Proceedings of the Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (2007)

Cognitive radio is an emerging concept that facilitates the intelligent usage of radio resources in heterogeneous radio environments. It automates the reconfiguration of software-defined radio (SDR) platforms, which stand for reconfigurable mobile terminals and network elements. This paper introduces a novel approach to resource management in cognitive radio. We call it integrated resource management (IRM) because it integrates the radio resource or spectrum management, the computing resource management of SDR platforms, and the application resource management of SDR applications, which define a platform's radio functionality. Our cognitive radio system thus executes three cognitive cycles: the radio, the computing, and the application cycles. We present a general framework that facilitates the
Attribute-based Overlay Network for Non-DHT Structured Peer-to-peer Lookup
Authors: Ming-Tsung Sun, Chung-Ta King, Wen-Hung Sun, Chiu-Ping Chang
Venue: Proceedings of the 2007 International Conference on Parallel Processing (2007)

Most DHT-based P2P search systems assume implicitly that the participating peers contain multiple objects. The distributed hash table (DHT) is used as a directory to store the keys of these objects for efficient lookup. However, maintaining the DHT and keeping its contents fresh require substantial message and storage overhead. In this paper, we study whether it is possible to do without a directory. We consider a special case of the search problem in which each peer is characterized by a single set of attributes and the peers satisfying a given range or k-nearest-neighbor (KNN) query are looked up. The attribute values may change constantly. For this special search problem, we study the feasibility of interconnecting the peers directly using their attribute values instead of using hash keys. The resultant attribute-based overlay network (AON) thus preserves the attribute semantics in the interconnection. Such a distributed structure can easily support range and KNN queries and accommodate dynamically changing attribute values.
Processing the v-KNN Queries inWireless Sensor Networks
Authors: Yongxuan Lai, Hong Chen, Cuiping Li
Venue: Proceedings of the 2007 International Conference on Parallel Processing (2007)

Recently there have been growing interests in the applications of wireless sensor networks. Given a query point, which is a value, find a set of K nodes whose values are nearest to this point. We call this query the value-based KNN (v-KNN) query. v-KNN is a challenging query in wireless sensor networks because the network is highly distributed and global knowledge of the values are needed before the result set could be constructed. In this paper, we propose a new algorithm called KVC (v-KNN queries based on value clustering ) to process the v-KNN queries in wireless sensor networks in an energy efficient way. KVC takes advantage of the rich resources in the base station to do some optimizations to filter the irrelevant nodes and push down the v-KNN query into the network. The aim of KVC is to reduce the total communication cost as much as possible while processing the v-KNN queries correctly and efficiently. Simulation results on both realistic and synthetical data sets show that KVC outperforms the central processing in both average and hotspot energy consumption in wireless sensor networks.
Bitonic Sort on a Mesh-Connected Parallel Computer
Authors: D. Nassimi
Venue: IEEE Transactions on Computers (1979)

An O(n) algorithm to sort n2elements on an Illiac IV-like n × n mesh-connected processor array is presented. This algorithm sorts the n2elements into row-major order and is an adaptation of Batcher's bitonic sort. A slight modification of our algorithm yields an O(n) algorithm to sort n2elements into snake-like row-major order. Extensions to the case of a j-dimensi