ppxscal/embedding_network huggingface dataset:
Development and Structure of an X.25 Implementation
Authors: G. V. Bochmann
Venue: IEEE Transactions on Software Engineering (1979)

This paper describes experience with an implementation of the X25 communication protocols for accessing public data networks. Ihe implementation effort is characterized by: 1) the development of a formalized protocol specification on which all further implementation work is based, and 2) the use of Concurrent Pascal as the implementation language. The main features of the formalized protocol specification are given, and a method for deriving a protocol implementation based on parallel processes, monitors, and classes is explained. The overall structure of the system and the step-wise refinements leading to the complete implementation are discussed. Some comments on the possible implementation on multiple microprocessors are also given.
Visual Modelling of Complex Business Processes with Trees, Overlays and Distortion-based Displays
Authors: Lei Li, John Hosking, John Grundy
Venue: Proceedings of the IEEE Symposium on Visual Languages and Human-Centric Computing (2007)

Current approaches to modelling complex business processes fail to scale to large organizations. Key issues are cobweb and labyrinth problems exhibited by conventional box and line metaphors and large numbers of hidden dependencies introduced by compartment-based modularity. We have been developing a new approach, Enterprise Modelling Language, based on trees, overlays and fish-eye viewers to overcome these shortcomings of existing workflow notations. EML utilizes several visual metaphors to enhance the representation, navigation and management of large organizational hierarchies and process flows. We describe a prototype support tool, MaramaEML, that provides support for multiple visual notations including the Business Process Modelling Notation (BPMN), the EML tree-based, multi-layer hierarchical representation, fisheye zooming capabilities, automatic BPEL code generation, and inter-notation mapping. We describe our experiences using EML to model large business processes and initial evaluation results.
Regular expression transformations to extend regular languages (with application to a Datalog XML schema validator)
Authors: Robson da Luz, Mírian Halfeld Ferrari, Martin A. Musicante
Venue: Journal of Algorithms (2007)

An XML schema is a set of rules for defining the allowed sub-elements of any element in an XML document. These rules use regular expressions to define the language of the element's children. Updates to an XML schema are updates to the regular expressions defined by the schema rules. We consider an interactive, data administration tool for XML databases. In this tool, changes on an XML schema are activated by updates that violate the validity of an XML document. Our schema validator is a Datalog program, resulting from the translation of a given XML schema. Changing the schema implies changing the validator. The main contribution of this paper is an algorithm allowing the evolution of XML schemas. This algorithm is based on the computation of new regular expressions to extend a given regular language in a conservative way, trying to foresee the needs of an application. A translation function from schema constraints to Datalog programs is introduced. The validation of an XML tree corresponds to the evaluation of the Datalog program over the tree. Our method allows the maintenance of the Datalog program in an incremental way, i.e., without redoing the entire translation.
411 on scalable password service
Authors: F. D. Sacerdoti, M. J. Katz, P. M. Papadopoulos
Venue: Proceedings of the High Performance Distributed Computing, 2005. HPDC-14. Proceedings. 14th IEEE International Symposium (2005)

In this paper we present 411, a password distribution system for high performance environments that provides security and scalability. We show that existing solutions such as NIS and Kerberos do not provide sufficient performance in large, tightly coupled systems such as computational clusters. Unlike existing single-signon services, the 411 design removes the need for communication during password lookup by using aggressive replication techniques. We demonstrate the use of shared keys to efficiently protect user information, and the careful management of system wide consistency and fault tolerance. A theoretical analysis of the behavior of 411 is matched with quantitative evidence of its performance and suitability to a clustered environment. We further show the system effectively responds to stress by simulating 50% message loss on a 60-node cluster. This protocol is currently used worldwide in hundreds of Rocks-based production systems to provide password and login information service.
Computer Assisted Transcription of Handwritten Text Images
Authors: A. Toselli, V. Romero, L. Rodriguez, E. Vidal
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

To date, automatic handwriting recognition systems are far from being perfect and often they need a post editing where a human intervention is required to check and correct the results of such systems. We propose to have a new inter- active, on-line framework which, rather than full automa- tion, aims at assisting the human in the proper recognition- transcription process; that is, facilitate and speed up their transcription task of handwritten texts. This framework combines the efficiency of automatic handwriting recogni- tion systems with the accuracy of the human transcriptor. The best result is a cost-effective perfect transcription of the handwriting text images.
Optimal Guaranteed Cost Control of a Class of Fuzzy Systems via Piecewise Fuzzy Lyapunov Function Approach
Authors: Zhicheng Ji, Yinghuan Zhou
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

This paper deals with the optimal guaranteed cost con- trol of a class of Takagi-Sugeno (T-S) fuzzy systems via the piecewise fuzzy Lyapunov function (PFLF) approach. The PFLF is proposed by utilizing the structure information of the rule premise. Based on this approach, an optimal guar- anteed control law for stabilization of the closed-loop fuzzy systems is derived in the form of linear matrix inequality (LMI). It is shown that the controller designed by the PFLF approach has better performance than those of the com- mon quadratic Lyapunov function (CQLF) and the piece- wise quadratic Lyapunov function (PQLF). A numerical ex- ample illustrates the efficiency of the PFLF approach.
The Effect of Camera Calibration Space on Visual Pose's Precision
Authors: Jing Zhou, Yingming Hao, Feng Zhu, Lei He
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

In this paper, the relationship between the camera calibration space and measurement error is analyzed in order to enhance the precision of a model based monocular vision pose estimation system. We proved that the calibration error of camera intrinsic parameters can be reduced when the calibration space is designed in a full field of view no matter how small the imaging range of the measuring area is, thus obtaining better precision of pose estimation. This conclusion provides important guidance for engineering application of the visual pose measurement system.
Modeling a Sensor Network by means of Clustering
Authors: Elena Baralis, Tania Cerquitelli, Vincenzo D'Elia
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

Querying a sensor network requires the acquisition from sensors of measurements describing the state of the monitored environment. To transmit the required information, sensors consume energy. Since sensors are batterypowered, reduced energy consumption allows the extension of a sensor's lifetime. Hence, an important issue in this context is the reduction of energy consumption during data collection. We propose a framework that performs the analysis of historical sensor readings to provide better quality models for sensor networks under realistic assumptions (e.g., presence of outliers) without restrictive hypotheses on sensor variables. The framework exploits clustering techniques to select a subset of representative sensors, which will be queried instead of the whole network to reduce communication and computation costs and balance energy consumption among sensors. Preliminary experimental results, performed on data collected from 54 sensors deployed in the Intel Berkeley Research lab show the adaptability and the effectiveness of the proposed approach.
Digital ecosystems: evolving service-orientated architectures
Authors: Gerard Briscoe, Philippe De Wilde
Venue: Proceedings of the 1st international conference on Bio inspired models of network, information and computing systems (2006)

A novel optimisation technique inspired by natural ecosystems is presented, where the optimisation works at two levels: a first optimisation, migration of services which are distributed in a decentralised peer-to-peer network, operating continuously in time; this process feeds a second optimisation based on evolutionary computing that operates locally on single peers and is aimed at finding solutions to satisfy locally relevant constraints. Through this twofold process, the local search is accelerated and will yield better local optima, because the distributed optimisation already provides a good sampling of the search space by making use of computations already performed in other peers with similar constraints. We call this new distributed optimisation architecture a Digital Ecosystem, an Ecosystem-Orientated Architecture (EOA) created by extending a Service-Oriented Architecture (SOA) with Distributed Evolutionary Computing (DEC). The Digital Ecosystem will allow services to recombine and evolve over time, constantly seeking to improve their effectiveness for the user base. Individuals within our Digital Ecosystem will be applications (groups of services), created in response to user requests by using evolutionary optimisation to aggregate the services. These individuals will migrate through the Digital Ecosystem and adapt to find niches where they are useful in fulfilling other user requests.
Numerical Solution of A Type of Nonlinear Parabolic Equations
Authors: Lili Wang, Wei Gu
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

In this paper, a layer method of solving the Cauchy problem for a second-order quasilinear parabolic equation is proposed, which is derived by using probabilistic representation of the solution. The method exploits the ideas of weak sense numerical integration of stochastic differential equations. We prove an error estimate for the method and discuss the multidimensional case.
Assembling genomes on large-scale parallel computers
Authors: A. Kalyanaraman, S. J. Emrich, P. S. Schnable, S. Aluru
Venue: Journal of Parallel and Distributed Computing (2007)

Assembly of large genomes from tens of millions of short genomic fragments is computationally demanding requiring hundreds of gigabytes of memory and tens of thousands of CPU hours. The advent of high throughput sequencing technologies, new gene-enrichment sequencing strategies, and collective sequencing of environmental samples further exacerbate this situation. In this paper, we present the first massively parallel genome assembly framework. The unique features of our approach include space-efficient and on-demand algorithms that consume only linear space, and strategies to reduce the number of expensive pairwise sequence alignments while maintaining assembly quality. Developed as part of the ongoing efforts in maize genome sequencing, we applied our assembly framework to genomic data containing a mixture of gene enriched and random shotgun sequences. We report the partitioning of more than 1.6 million fragments of over 1.25 billion nucleotides total size into genomic islands in under 2h on 1024 processors of an IBM BlueGene/L supercomputer. We also demonstrate the effectiveness of the proposed approach for traditional whole genome shotgun sequencing and assembly of environmental sequences.
Distritrack: Automated Average-Case Analysis
Authors: David Hickey
Venue: Proceedings of the Fourth International Conference on Quantitative Evaluation of Systems (2007)

MOQA is a language specifically designed to facilitate average-case execution time analysis. It incorporates some innovative techniques to make this possible. Following on from this, a tool called Distritrack has been built to perform the analysis of MOQA programs, adhering strictly to the language specification.
Exploiting Clustering and Cross-Layer Design Approaches for Data Caching in MANETs
Authors: Jun Tian, Mieso K. Denko
Venue: Proceedings of the Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (2007)

caching scheme for Mobile Ad Hoc Networks (MANETs). We also adopt a prefetching scheme to complement the caching scheme. A cross-layer design approach is employed to further improve the performance of cooperative caching and prefetching schemes. Cross-layer information is shared among network protocol layers. The effect of network size and the Time-To-Live value on network performance was investigated using simulation. Experimental results demonstrate that the proposed scheme improves caching performance in terms of data accessibility, query delay and query distance compared to the caching scheme that does not adopt the cooperative caching strategy. Index Terms--Cross-Layer design, cooperative caching, clustering, cache management, prefetching.
A Discussion of "A Measure of Computational Work"2
Authors: L. Hellerman
Venue: IEEE Transactions on Computers (1974)

This note presents a discussion of some issues that have been raised about my paper1"A Measure of Computational Work."
An IDE for software development using tabular expressions
Authors: Dennis K. Peters, Mark Lawford, Baltasar Trancón y Widemann
Venue: Proceedings of the 2007 conference of the center for advanced studies on Collaborative research (2007)

We present preliminary work on an IDE for formal software development using tabular expressions as the basis for precise specifications and descriptions of software behaviour.
A Resource Scheduling Design Method with Model Checking for Distributed Embedded Software
Authors: Masahiko Watanabe, Akira Fukuda, Michihiro Matsumoto, Hirokazu Yatsu, Ichiro Hosotani, Shigeyuki Kido
Venue: Proceedings of the Seventh International Conference on Quality Software (2007)

Distributed embedded software is constructedfrom tasks that are connected through networks orbuses. These tasks may communicate with eachother by sending and receiving multicast messages,for example, by using CAN protocol. In this paper,we deal with this kind of distributed embeddedsoftware. These tasks must share resources. So, it isimportant to schedule a timetable describing whenthe tasks occupy the resources so that there is noresource competition and the tasks occupy theresources within pre-specified periods. We call thisscheduling process resource scheduling. Becausetasks must satisfy many constraints and there aremessage delays in the communication of the tasks,resource scheduling is a difficult task. So, resourcescheduling design methods are necessary.
Controlled Delegation in e-cheques Using Proxy Signatures
Authors: N. R. Sunitha, B. B. Amberker, Prashant Koulgi
Venue: Proceedings of the 11th IEEE International Enterprise Distributed Object Computing Conference (2007)

A proxy signature scheme allows one user to delegate his/her signing capability to another user called a proxy signer in such a way that the latter can sign messages on behalf of the the former. After verification the ver- ifier is convinced of the original signer's agreement on the signed message. We have come up with a scheme to control delegation of financial power to a proxy signer. The scheme satisfies the basic requirements of a secure proxy signature scheme. Using our scheme the proxy signer will be able to submit an e-cheque for only the amount he is entitled to by the original signer. Any cheating by the original signer or the proxy signer is identified by the verifier i.e. the bank. We have con- sidered Forgery by the original signer, Impersonating and framing attack to prove the security of our scheme. Any discrete log based signature scheme can be used to sign the messages. Here we use the Digital Signature Algorithm(DSA). Keywords : Digital Signature, Proxy Signature, Se- curity, DSA.
A Fail-Safe Asynchronous Sequential Machine
Authors: W. W. Patterson
Venue: IEEE Transactions on Computers (1974)

This paper examines the dynamic fault behavior of asynchronous sequential machines, specifically identifying the faults which cause critical races and hazards, and presents a state assignment technique leading to a machine that enters one of a small set of error states whenever a fault occurs. Entry into an error state can be checked by very simple check circuits; a self-testing check circuit and one requiring only two tests for fault detection are discussed. An extension of the state assignment technique to produce a machine that is fail-safe is also presented. The fail-safe design has the property that once a fault has caused the machine to malfunction and enter an error state, the machine never leaves the error state and therefore does not produce erroneous outputs. This machine detects all but a small class of multiple faults.
Arbitration and Control Acquisition in the Proposed IEEE 896 Futurebus
Authors: D. Taub
Venue: IEEE Micro (1984)

The proposed IEEE 896 backplane bus for multimicroprocessor systems synchronizes processes to arbitrate between devices seeking control of the bus simultaneously. 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
Early Software Quality Prediction Based on a Fuzzy Neural Network Model
Authors: Bo Yang, Lan Yao, Hong-Zhong Huang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

For the management of a software development project, a software quality prediction model is very helpful since it can provide the management with useful information needed for decision-makings. Many software quality prediction models and techniques have been proposed and studied in the literature. Nevertheless, the complicated situations of software development process call for a more flexible model that can cater for all factors that have impact on the quality of the target software, including the characteristics of the software product, the characteristics of the development process and the operation conditions. In this paper, a software quality prediction model based on a fuzzy neural network is presented. The proposed model is a hybrid model of Artificial Neural Network (ANN) and Fuzzy Logic (FL), which exploits the advantages of ANN and FL while eliminating their limitations. The model exhibits some favorable features such as being able to deal with objective data collected in the software development process as well as knowledge/experiences obtained from experts or from similar projects, which is the main information that is available in the early phases of a software development process. Using this model, early prediction of software quality becomes feasible and the management can have knowledge of the quality of target software product as early as possible, which helps to identify design errors and avoid expensive rework. Experimental results show that for problems of small-to-medium scale, the proposed model can be easily trained and thus can be of practical use.
Applying FLC-based dynamic buffer size tuning to shorten the information retrieval round trip time in mobile location-aware environments
Authors: Wilfred W. Lin, Tharam S. Dillon, Allan K. Wong
Venue: Personal and Ubiquitous Computing (2008)

This paper proposes to use the novel fuzzy logic controller (FLC), which is a dynamic buffer size tuning technique, to support more dependable location-aware information retrieval in a pervasive environment. Within a smart space of a mobile/pervasive environment a user may request service from the dedicated surrogate via a portable small-form-factor (SFF) device (e.g. PDA). In effect, the SFF is the client and the surrogate is the server, which may serve many clients at the same time. The one-surrogate-to-many-SFF relationship or asymmetric rendezvous easily makes the surrogate buffer overflow in the peak demand seasons. The request traffic to the surrogate is tied in with the transient traveler mass traffic through the smart space, for example, in an airport. The transit travelers may switch on their mobile SFF at will to demand service from the local surrogate. If the surrogate buffer overflows, the users do not benefit from the cyber foraging provided by the pervasive computing infrastructure in the background. The FLC adaptively tunes the surrogate buffer size so that it always covers the queue length by the given Δ safety margin. As a result the SFF-surrogate asymmetric rendezvous becomes dependable because the chance of buffer overflow is eliminated. The dependability leads to shorter information retrieval roundtrip time (RTT) and happier users.
Guest Editors' Introduction: Intelligent Educational Systems of the Present and Future
Authors: Lora Aroyo, Arthur Graesser, Lewis Johnson
Venue: IEEE Intelligent Systems (2007)

Education in the 21st century faces an increasing number of challenges that require intelligent systems. The learning environments of today and tomorrow must handle distributed and dynamically changing content, a geographical dispersion of students and teachers, and generations of learners who spend hours a day interacting with multimillion-dollar multimedia environments. The new learning environments are moving beyond kindergarten through college classrooms to distance learning, lifelong education, and on-the-job training; they're entering the multifaceted universe of virtual worlds and ambient spaces. The articles in this special issue report novel, cutting-edge, intelligent learning environments. The systems not only have intelligent computational architectures but also are empirically tested on humans. Empirical research is of course essential to test system fidelity in delivering the intended pedagogy and to assess learning gains, usability, and learner satisfaction. This article is part of a special issue on intelligent educational systems.
Scan Design Using Standard Flip-Flops
Authors: Sudhakar Reddy, R. Dandapani
Venue: IEEE Design Test (1987)

Classical scan designs require properly augmented flip-flops, often called scan flip-flops. Problems stem from the high areaoverhead implied by the need for these flip-flops or the inability to modify standard flip-flops. The authors outline a methodto design easily testable sequential circuits that achieve scan designs using standard (unmodified) flip-flops.
VRP Based on Improved Niche Isolation Genetic Algorithm
Authors: Zixia Chen, Youshi Xuan
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

With the problems that traditional genetic algorithm is easy to converge untimely, and its searching efficiency will be lower in later stage of evolution, the paper designs an improved niche isolation genetic algorithm. This algorithm is based on niche isolation genetic algorithm and adopts migrating operator and simulated annealing theory. It not only keeps the diversity of the group, but also avoids getting into partial optimization. Simulation experiments and validity analysis of the algorithm are also given. The results prove it has good performance in solving Vehicle Routing Problems (VRP).