ppxscal/embedding_network huggingface dataset:
Modified Algorithms for Multilevel GRSB Protocol
Authors: Mohammad Asadul Hoque, S. M. Iftekharul Amin, Md. Shohrab Hossain
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

GRSB - Guaranteed, Reliable, Secure Broadcast - is a protocol that provides reliable and secure broadcast / multicast communications [1,2]. It can be implemented in many types of networks - local area networks, wide area networks, as well as satellite communications. The methodology used in this protocol is surprisingly simple. Three logical nodes are enforced in the network - a Central Retransmiter, a Designated Acknowledger, and a Playback Recorder(s). Through the coordinated service of the three nodes, every user node can be guaranteed to receive all broadcast messages in the correct temporal order. A fourth logical node, the Security Controller, can be added to the protocol to provide security-related services such as user authentication, message encryption, etc. In this paper, we have proposed a multilevel broadcast model of GRSB (Guaranteed, Reliable and Secure Broadcast) protocol , where 1st level broadcast mostly maintains the traditional GRSB model. 2nd level broadcast has two types of nodes where nodes of 1st kind i.e. nodes that are directly connected with the attachment nodes, can be temporarily in "not alive' condition and hence follow the traditional GRSB model as well. On the other hand, nodes of 2nd kind i.e. nodes that are not directly connected with the attachment nodes, must be "alive' all the time and have to follow two phases to finish the broadcast. (Abstract)
A-Diagnosis: A Complement to Z-Diagnosis
Authors: Irith Pomeranz, Sudhakar M. Reddy
Venue: Proceedings of the 22nd IEEE International Symposium on Defect and Fault-Tolerance in VLSI Systems (2007)

Z -diagnosis was proposed for speeding up diagnostic fault simulation by identifying in an efficient manner fault pairs that are guaranteed to be distinguished by a fault detection test set. Z -diagnosis is based on z -sets, which capture information about the outputs to which fault effects may be propagated. We introduce a dual concept of a -diagnosis that is based on a -sets, which capture fault activation conditions. More generally, a -sets include necessary assignments for the detection of target faults. We use a -sets to speed up diagnostic fault simulation in two ways, as part of a test set independent process and as part of a test set dependent process. The test set dependent process uses only logic simulation of the test set to identify fault pairs that are guaranteed to be distinguished by the test set. We present experimental results to demonstrate the speed up in diagnostic fault simulation obtained by using a -sets in addition to z -sets.
Redundancy in Data Structures: Some Theoretical Results
Authors: D. J. Taylor
Venue: IEEE Transactions on Software Engineering (1980)

A companion paper, "Redundancy in Data Structures: Improving Software Fault Tolerance," provides an infonnal introduction to robust data structures. Here, we present the underlying theory for them, and use it to discuss the synthesis and cost effectiveness of robust data structures.
A new service infrastructure architecture
Authors: P. Crane
Venue: BT Technology Journal (2007)

BT's planned new architecture defines the technological direction and structure of its future service infrastructure. It provides the template for all service developments and is the key enabler to BT meeting its service vision. This paper summarises the architecture, exploring the key features which will drive the development of BT's future networks, intelligence and systems.
Aspect-Oriented Modeling for Embedded Software Design
Authors: Natsuko Noda, Tomoji Kishi
Venue: Proceedings of the 14th Asia-Pacific Software Engineering Conference (2007)

In software design, it is important to encapsulate cross-cutting concerns, and the application of aspectoriented technologies to design modeling is a significant challenge. We examined the design of software for embedded systems that exhibit complicated behavior and observed that aspect orientation is useful for designing such systems. In this paper, we propose aspect-oriented modeling for embedded software design. For this modeling, we introduce an aspect-oriented modeling mechanism based on state diagrams. We also demonstrate how the proposed modeling can be effectively applied to embedded software design based on an example.
Towards a context model driven german geo-tagging system
Authors: Andre Blessing, Reinhard Kuntz, Hinrich Schütze
Venue: Proceedings of the 4th ACM workshop on Geographical information retrieval (2007)

In this paper, we present a new approach for recognition and grounding of geographic proper names for German. Named Entity Recognition (NER) in German is more difficult than in English because not only proper names, but all nouns start with capital letters, which results in a large pool of potential ambiguous entities. Our approach makes critical use of a geographic knowledge base that is more detailed (down to the level of streets) and more structured than most knowledge bases used before. We have designed a three-stepmodel (spotting, typing, referencing) that specifies the sources of information that are necessary for geo-tagging and their dependency relationships. Basic aspects of the model were implemented and evaluated in a proof of concept. The model can be applied to other NER tasks by simply substituting the appropriate knowledge base for the one used here and retraining the model.
Automated Theorem Proving in Euler Diagram Systems
Authors: Gem Stapleton, Judith Masthoff, Jean Flower, Andrew Fish, Jane Southern
Venue: Journal of Automated Reasoning (2007)

Diagrammatic reasoning has the potential to be important in numerous application areas. This paper focuses on the simple, but widely used, Euler diagrams that form the basis of many more expressive logics. We have implemented a diagrammatic theorem prover, called Edith, which has access to four sound and complete sets of reasoning rules for Euler diagrams. Furthermore, for each rule set we develop a sophisticated heuristic to guide the search for a proof. This paper is about understanding how the choice of reasoning rule set affects the time taken to find proofs. Such an understanding will influence reasoning rule design in other logics. Moreover, this work specific to Euler diagrams directly benefits the many logics based on Euler diagrams. We investigate how the time taken to find a proof depends not only on the proof task but also on the reasoning system used. Our evaluation allows us to predict the best choice of reasoning system, given a proof task, in terms of time taken, and we extract a guide for defining reasoning rules for other logics in order to minimize time requirements.
Towards a taxonomy of perceived agency in narrative game-play
Authors: Bride Mallon
Venue: Computers in Entertainment (CIE) (2008)

Notions of agency, authorship, and interaction tend to be broadly defined. Operational specifications exemplifying their empirical existence are needed to understand where and how players affect content, structures, process or outcomes during interaction. This article presents a taxonomy of parameters influencing interaction. In it are identified (a) game aspects in which the player feels agency, and (b) game mechanisms that encourage that feeling. Such a taxonomy is useful for (i) game designers considering where and how to incorporate user input and input triggers, and (ii) evaluating the quality of interaction, given that players judge game quality partly on the extent to which their agency is enabled or inhibited. The taxonomy builds on the results of a series of focus-group studies analyzing selected commercial narrative role-play and adventure games
Brief paper: Estimating ink density from colour camera RGB values by the local kernel ridge regression
Authors: A. Verikas, M. Bacauskiene
Venue: Engineering Applications of Artificial Intelligence (2008)

We present an option for CCD colour camera based ink density measurements in newspaper printing. To solve the task, first, a reflectance spectrum is reconstructed from the CCD colour camera RGB values and then a well-known relation between ink density and the reflectance spectrum of a sample being measured is used to compute the density. To achieve an acceptable spectral reconstruction accuracy, the local kernel ridge regression is employed. The superiority of the local kernel ridge regression over the global regression and the popular ordinary polynomial regression is demonstrated by experimental comparisons. For a database consisting of 250 colour patches printed on newsprint by an ordinary offset printing press, the average spectrum reconstruction error of @DE@?=0.733 and the maximum error @DE"m"a"x=3.29 was obtained. Such an error proved to be low enough for achieving the average ink density measuring error lower than 0.01D.
Design of Agile Infrastructure for Manufacturing System with FNN Based Web-Enabled Technology Solutions
Authors: J. L. Su, Zhonghui Ouyang, Yimin Chen
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

The Agile Manufacturing and Agile Supply Chain Management can input the vigor into Manufacturing Industry, i.e. Garments Industry, and help to increase its ability for the good return, can promote the level of technology and management of the industry from a labor intensive industry, and can move it toward the accurate and agile management. But before that, you have to be an Agile Manufacturing Enterprise. So it's very necessary to construct an Agile Infrastructure for Manufacturing System (AIMS), which can help its members changing to be an Agile Enterprise, a platform that named Comprehensive Information Platform by our research team. In this paper, we discuss some of the details of Comprehensive Information Platform (CIP) including relationship of its Main Functions, structure of CIP, and Some Key Enabled Technology of Agile Infrastructure, such as, Load Balance Scheduling Model and Intrusion Detection System (IDS) Model. All technical details touched upon obtained satisfying performance in practically.
New Products
Venue: IEEE Computer Graphics and Applications (1982)

Hewlett-Packard's Engineering Graphics System, the EGS/45, is a software package designed for use with HP 9845 desktop computers and various HP peripherals. Created for electronic circuit and printed-circuit board design, the company says the system can save up to 50 percent of the time required by manual methods. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
A Self-Organizing Particle Swarm Optimization Algorithm and Application
Authors: Yuanxia Shen, Chuanhua Zeng
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

A self-organizing particle swarm optimization algorithm is developed for solving premature convergence of particle swarm optimization. According to adaptively adjusting acceleration coefficients and inertia weight, the particles are organized to track the domain of attraction of local optimum and the domain of attraction global optimum respectively during the search. Meanwhile the corresponding strategies with mutation are adopted in different stages of this algorithm to further enhance diversity of population. Experimental results for complex function optimization and nonlinear system identification show that this algorithm improves the global convergence ability and efficiently prevents the algorithm from the local optimization and early maturation.
Reconfiguration for Repair in a Class of Universal Logic Modules
Authors: F. G. Gray
Venue: IEEE Transactions on Computers (1974)

A class of universal finite-state machine structures employing arrays of identical modules is shown to be capable of dynamic repair by the process of reconfiguration. Coverage on the order of 98 percent of all stuck-at faults is demonstrated with no redesign of the array being necessary. After specifying a formal model for the array structure, a complete theory is developed capable of determining the minimal number of configurations necessary to obtain maximal coverage of stuck-at faults without redesigning the network. Inherent redundancy in the array structure results in this unusual capability. Many faults are also tolerated in each system configuration.
A Mesh-Based QoS Aware Multicast Routing Protocol
Authors: Dayin Promkotwong, Ohm Sornil
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

Due to the rising popularity of multimedia applications and potential commercial usages of mobile ad hoc networks (MANETs), quality of service (QoS) in MANET has become necessary to support those needs. In this paper, we propose a QoS aware multicast routing protocol (QMRP) based on mesh architecture which offers bandwidth guarantees for applications in MANETs. Experimental evaluations are carried out in a simulated environment. The results show that the proposed protocol outperforms ODMRP, a mesh-based multicast routing protocol in a variety of environments.
Source Code Composition with the Reuseware Composition Framework
Authors: Jendrik Johannes
Venue: Proceedings of the Seventh IEEE International Working Conference on Source Code Analysis and Manipulation (2007)

The Reuseware Composition Framework is a toolsupported framework that aids developers of new composition techniques with integrating them into programming languages. In this tool-demo proposal we explain the usage and benefits of the framework by defining an extension of the Java language.
Inter-autonomous system provisioning for end-to-end bandwidth guarantees
Authors: Kin-Hon Ho, Michael Howarth, Ning Wang, George Pavlou, Stylianos Georgoulas
Venue: Computer Communications (2007)

This paper addresses the issue of provisioning end-to-end bandwidth guarantees across multiple Autonomous Systems (ASes). We first review a cascaded model for negotiating and establishing service level agreements for end-to-end bandwidth guarantees between ASes. We then present a network dimensioning system that uses traffic engineering mechanisms for the provisioning of end-to-end bandwidth guarantees. The network dimensioning system solves two problems: (1) the economic problem of how to determine the optimum amount of bandwidth that needs to be purchased from adjacent downstream ASes at a minimum total cost; (2) given the available bandwidth resources within and beyond the AS as a result of (1), the engineering problem of how to assign bandwidth guaranteed routes to the predicted traffic while optimizing the network resource utilization. We formulate both as integer-programming problems and prove them to be NP-hard. An efficient genetic algorithm and an efficient greedy-penalty heuristic are, respectively, used to solve the two problems and we show that these perform significantly better than simple heuristic and random approaches.
Uplink Capacity/Coverage Analysis of WCDMA with Switched Beam Smart Antennae
Authors: Ismat A. Aldmour, Khalid Al-Begain, Aymen I. Zreikat
Venue: Wireless Personal Communications: An International Journal (2007)

Capacity and coverage represent, in addition to QoS, the three main requirements for W-CDMA based 3G mobile communication systems. These are conflicting requirements; i.e., optimizing one will be on the account of the other two. All three, however, depend largely on the interference levels in the system. Improvements on interference are thought to have a decisive effect on the performance of the 3G system and one important interference reduction technique is the utilization of smart antennae. In this paper, we analyze capacity/coverage on the uplink in W-CDMA system utilizing switched beam smart antennae, SBSA, using a simple model of the antenna, while satisfying a certain minimum level of QoS. Limits imposed by both interference from others and the limited uplink power available to any user in the cell are considered. Results of this paper are analytical formulae for capacity/coverage that take into consideration many of the important parameters of either the antennae or the WCDMA system. A sectional view of improvement gains, if any, of either capacity or coverage upon antenna upgrading/downgrading is provided. It is shown that improvements by the directional SBSA of either capacity or coverage, are only attained at high interference conditions; i.e., higher number of users when considering coverage improvement or smaller coverage areas when considering capacity. The higher the interference conditions are the higher gain over side lobes or more beams SBSA are needed to attain improvement.
Password-based Dynamic Group Key Agreement
Authors: Chunbo Ma, Jun Ao, Jianhua Li
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

A password-based dynamic group key agreement protocol from tripartite Diffie-Hellman using pairing on elliptic curve is presented in this paper. In this scheme, due to all users share a common pre-distributed password, the setup of the key agreement is simplified and the performance is improved. In addition, each user establishes a relation between his left and right neighbors respectively in order to implement the fast joining and leaving operations. Under the DDH assumption, proofs are given to show that the proposed key agreement protocol is secure against passive attack.
A Context-Aware Multi-Agent System for Building Intelligent Services by the Classification of Rule and Ontology in a Smart Home
Authors: Yoonsik Uhm, Zion Hwang, Minsoo Lee, Yong Kim, Gwanyeon Kim, Sehyun Park
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

This paper proposes a context model which separates the upper and lower layer according to characteristic of each class using the Web Ontology Language (OWL). We also present a Context-Aware Multi-Agent System (CAMAS) architecture which provides the solution of policy problem using the classification of rule and implementation of a rule-based engine. We enhance the response time for offering adaptive services. We solve the policy conflict problem among users by using reasoning and privilege delegation.
Automated Extraction of Accurate Delay/Timing Macromodels of Digital Gates and Latches using Trajectory Piecewise Methods
Authors: S. Dabas
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

We present a fundamentally new approach, ADME, for extracting highly accurate delay models of a wide variety of digital gates. The technique is based on trajectory-piecewise automated nonlinear macromodelling methods adapted from the mixed-signal/RF domain. Advantages over prior current-source models include rapid automated extraction from SPICE-level netlists, transparent retargetability to different design styles and technologies, and the ability to correctly and holistically account for complex input waveform shapes, nonlinear and linear loading, multiple input switching, effects of internal state, multiple I/Os, supply droop and substrate interference. We validate ADME on a variety of digital gates, including multi-input NAND, NOR, XOR gates, a full adder, a multilevel cascade of gates and a sequential latch. Our results confirm excellent model accuracy at the detailed waveform level and testify to the promise of ADME for sustainable gate delay modelling at nanoscale technologies.
Local velocity-adapted motion events for spatio-temporal recognition
Authors: Ivan Laptev, Barbara Caputo, Christian Schüldt, Tony Lindeberg
Venue: Computer Vision and Image Understanding (2007)

In this paper, we address the problem of motion recognition using event-based local motion representations. We assume that similar patterns of motion contain similar events with consistent motion across image sequences. Using this assumption, we formulate the problem of motion recognition as a matching of corresponding events in image sequences. To enable the matching, we present and evaluate a set of motion descriptors that exploit the spatial and the temporal coherence of motion measurements between corresponding events in image sequences. As the motion measurements may depend on the relative motion of the camera, we also present a mechanism for local velocity adaptation of events and evaluate its influence when recognizing image sequences subjected to different camera motions. When recognizing motion patterns, we compare the performance of a nearest neighbor (NN) classifier with the performance of a support vector machine (SVM). We also compare event-based motion representations to motion representations in terms of global histograms. A systematic experimental evaluation on a large video database with human actions demonstrates that (i) local spatio-temporal image descriptors can be defined to carry important information of space-time events for subsequent recognition, and that (ii) local velocity adaptation is an important mechanism in situations when the relative motion between the camera and the interesting events in the scene is unknown. The particular advantage of event-based representations and velocity adaptation is further emphasized when recognizing human actions in unconstrained scenes with complex and non-stationary backgrounds.
DPTree: A Balanced Tree Based Indexing Framework for Peer-to-Peer Systems
Authors: Mei Li, Wang-chien Lee, Anand Sivasubramaniam
Venue: Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols (2006)

Peer-to-peer (P2P) systems have been widely used for exchange of voluminous information and resources among thousands or evenmillions of users. Since shared data are normally identified by multiple attributes, a fundamental issue in P2P systems isto efficiently support complex queries on multi-dimensional data. Prior works suffer from some fundamental limitations, suchas being constrained to support certain types of queries, excessive maintenance overheads, and etc. In this study, we proposea framework, called distributed peer tree (DPTree), which efficiently supports various types of queries on multi-dimensionaldata in P2P systems based on balanced tree indexes. DPTree achieves the efficiency through the following designs: 1) distributingthe tree structure among peers in a way preserving the nice properties of balanced tree structures yet avoiding single pointsof failure and performance bottlenecks; 2) organizing peers into an overlay structure that enables efficient navigation yetis easy to maintain; 3) an efficient navigation algorithm; 4) an innovative wavelet-based load balancing mechanism. Throughextensive performance evaluation, we verify the superiority of DPTree over existing works.
Review: Applying the insight into superlattices and quantum wells for nanostructures: Low-dimensional structures and devices
Authors: Raphael Tsu
Venue: Microelectronics Journal (2007)

Semiconductor superlattices consisting of alternating layers of two semiconductors with different energy bands were conceived by Esaki and Tsu more than 37 years ago at the IBM Research. It was recognized that such structures would show negative differential conductance, the main device ingredient in amplifier and oscillator, called by us, the Bloch oscillator. Two patents were applied at the very beginning and issued. The concept, due to the availability of molecular beam epitaxy, MBE, particularly developed for GaAs injunction lasers, became reality in a few years, led to the wide spread of 2D systems, eventually led the way for the opening of nanoscience. I used this opportunity to tell the story how it all happened, as an example that progress in science and technology frequently depends on something quite obvious once became known.