ppxscal/embedding_network huggingface dataset:
Eliminating Mismatching Connections between Components by Adopting an Agent-Based Approach
Authors: Wenpin Jiao, Hong Mei
Venue: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (2003)

During component composition, mismatches may occur on different aspects, such as interaction behaviors between components and features imposed by architectural styles. In this paper, we studied architectural mismatches related to connecting components using a specified architectural style, which implies that the connections supported by components may be incompatible with the connection supposed by the architectural style. First, we formalized components involved in different architectural styles in the pi-calculus. Next, we studied the formal foundation of the interconnectivity between components to exploit under what situation two heterogeneous components are possible to interconnect together properly. Then, we described an adaptor-based solution for composing components supporting different architectural styles by introducing the notation of negative component. In the end of this paper, we presented an agent-based implementation for the solution, in which agents are used to wrap components and can automatically transform messages specific to one architectural style into messages specific to another style by using architectural style-specificknowledge that agents possess.
The practice of IS/IT benefits management in large Australian organizations
Authors: Chad Lin, Graham Pervan
Venue: Information and Management (2003)

Information systems and technology investments in organizations are substantial and growing. While formal methodologies and techniques for computing investments are generally used, relatively less formality is applied to managing and realizing their benefits. Part of an ongoing research programme, this paper examines a number of aspects of information systems/information technology (IS/IT) benefits realization in large Australian organizations and reveals issues of identifying and structuring benefits, planning benefits realization, delivering, evaluating and reviewing these benefits, with some success and some failure. The results show some value in the use of formal methodologies, benefits measurement, formal reviews, and allocation of specific responsibilities, but a lack of uniformity in their formality. These results, however, are generally consistent with findings in related studies outside Australia.
Process Management in Supply Chains -- A New Petri-Net Based Approach
Authors: Marco von Mevius, Richard Pibernik
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 3 - Volume 3 (2004)

Supply chain process management (SCPM) refers to the design and control of interrelated production, logistics and information processes on an operational level. In this paper, we present an innovative approach to SCPM, based on a new type of high-level Petri-nets, so-called XML-nets. With the proposed XML-nets, the capabilities of SCPM can be significantly enhanced in comparison to existing methods. By employing XML-nets, not only single phases, i.e. modelling, analysis and control, but SCPM as a whole can be improved. XML-nets facilitate an integral approach to SCPM by using a consistent and comprehensiblemethodology throughout all relevant phases. A further application potential results from applying the widely used XML standard: A SCPM software application can be directly linked to different transactional systems, in order to exchange relevant (intra- and inter-organisational)process data. After a detailed introduction to supply chain process modelling with XML-nets, the advantages of the proposed methodology will be clearly outlined on the basis of a practical modelling example. Thereupon we demonstrate the architecture and functions of an XML-net based prototype software tool supporting SCPM.
Discovering interesting information in XML data with association rules
Authors: Daniele Braga, Alessandro Campi, Stefano Ceri, Mika Klemettinen, PierLuca Lanzi
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

Data mining algorithms are designed to extract interesting information from large amounts of data. They usually assume that source data are in relational (tabular) from. However, the recent success of XML as a standard to represent semi-structured data and the increasing amount of data available in XML pose new challenges to the data mining community. In this paper we introduce association rules for XML data. To accomplish this, we propose a new operator, based on XPath and inspired by the syntax of XQuery, which allows us to express complex mining tasks, compactly and intuitively. The operator can indifferently (and simultaneously) target both the content and the structure of the data, since the distinction in XML is slight.
The translation of boolean: expressions into optimal transfer logic code for the OLIVER data base management system compiler
Authors: John C. Burda
Venue: ACM SIGPLAN Notices (1978)

The algorithms described in this document were designed for the OLIVER Data Base Management System Compiler. They are superior to previously published results in that they require a single left-to-right scan over the input string while maintaining the generation of optimal transfer logic code for NOT, AND, OR, IMPLIES and the looping of a repeating group operand. Exclusive OR and Equivalence are also recognized and translated by the algorithms.
Back-propagation learning of infinite-dimensional dynamical systems
Authors: Isao Tokuda, Ryuji Tokunaga, Kazuyuki Aihara
Venue: Neural Networks (2003)

This paper presents numerical studies of applying back-propagation learning to a delayed recurrent neural network (DRNN). The DRNN is a continuous-time recurrent neural network having time delayed feedbacks and the back-propagation learning is to teach spatio-temporal dynamics to the DRNN. Since the time-delays make the dynamics of the DRNN infinite-dimensional, the learning algorithm and the learning capability of the DRNN are different from those of the ordinary recurrent neural network (ORNN) having no time-delays. First, two types of learning algorithms are developed for a class of DRNNs. Then, using chaotic signals generated from the Mackey-Glass equation and the Rössler equations, learning capability of the DRNN is examined. Comparing the learning algorithms, learning capability, and robustness against noise of the DRNN with those of the ORNN and time delay neural network, advantages as well as disadvantages of the DRNN are investigated.
Analysis of Software Maintenance Data Using Multi-Technique Approach
Authors: Marek Reformat, Vanda Wu
Venue: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (2003)

Amount of software engineering data that is accumulated by software companies grows with enormous speed. This data is a source of knowledge about different activities related to software development and maintenance. Many different techniques and tools have been developed and proposed for extracting knowledge and representing it in forms understandable by people. These techniques are based on different principles and they process data differently.This paper illustrates a multi-technique approach to analysis of data. A detailed case study of analyzing software maintenance data is presented. Different models are built, analyzed and evaluated. The first model is a Bayesian network. The second is a set of IF-THEN rules extracted from the data, and the third one is built using a decision tree. The emphasis of the analysis is put on two aspects ¿ how the models support understanding of a process represented by the data, and how good prediction capabilities these models have.
A new concept in fabricating building blocks for nanoelectronic and nanomechanic devices
Authors: V. Ya Prinz
Venue: Microelectronic Engineering (2003)

This review outlines a new fabrication concept for three-dimensional (3D) nanoshells that can be obtained, in a self-formed manner, from several-monolayer (ML) thick semiconductor or metal thin-film planar structures. Fabrication of InGaAs/GaAs, SiGe/Si cylindrical micro- and nanoshells (tubes, spirals, and rings) is described. New results on the formation of periodic structures, open and closed single-crystal 3D nanoshells of various shapes with a minimum radius of curvature of ∼1 nm, and also on assembling these shells in more complex architectures are reported. Possible applications of structures obtained by the new technology are considered.
Probabilistic discovery of time series motifs
Authors: Bill Chiu, Eamonn Keogh, Stefano Lonardi
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

Several important time series data mining problems reduce to the core task of finding approximately repeated subsequences in a longer time series. In an earlier work, we formalized the idea of approximately repeated subsequences by introducing the notion of time series motifs. Two limitations of this work were the poor scalability of the motif discovery algorithm, and the inability to discover motifs in the presence of noise.Here we address these limitations by introducing a novel algorithm inspired by recent advances in the problem of pattern discovery in biosequences. Our algorithm is probabilistic in nature, but as we show empirically and theoretically, it can find time series motifs with very high probability even in the presence of noise or "don't care" symbols. Not only is the algorithm fast, but it is an anytime algorithm, producing likely candidate motifs almost immediately, and gradually improving the quality of results over time.
Optimal Design of Reliable Computer Networks: A Comparison of Metaheuristics
Authors: Fulya Altiparmak, Berna Dengiz, Alice E. Smith
Venue: Journal of Heuristics (2003)

In many computer communications network design problems, such as those faced by hospitals, universities, research centers, and water distribution systems, the topology is fixed because of geographical and physical constraints or the existence of an existing system. When the topology is known, a reasonable approach to design is to select components among discrete alternatives for links and nodes to maximize reliability subject to cost. This problem is NP-hard with the added complication of a very computationally intensive objective function. This paper compares the performance of three classic metaheuristic procedures for solving large and realistic versions of the problem: hillclimbing, simulated annealing and genetic algorithms. Three alterations that use local search to seed the search or improve solutions during each iteration are also compared. It is shown that employing local search during evolution of the genetic algorithm, a memetic algorithm, yields the best network designs and does so at a reasonable computational cost. Hillclimbing performs well as a quick search for good designs, but cannot identify the most superior designs even when computational effort is equal to the metaheuristics.
Requirements by Contracts allow Automated System Testing
Authors: Clémentine Nebut, Franck Fleurey, Yves Le Traon, Jean-Marc Jézéquel
Venue: Proceedings of the 14th International Symposium on Software Reliability Engineering (2003)

Use-cases and scenarios have been identified as good inputsto generate test cases and oracles at requirement level.Yet to have an automated generation, information is missingfrom use cases and sequence diagrams, such as the exactinputs of the system, and the ordering constraints betweenthe use case. The contribution of this paper is then two-fold.First we propose a contract language for functionalrequirements expressed as parameterized use cases. Thenwe provide a method, a formal model and a prototype toolto automatically derive both functional and robustness testcases from the requirements enhanced with contracts. Westudy the efficiency of the generated test cases on a casestudy.
Scan Power Minimization through Stimulus and Response Transformations
Authors: Ozgur Sinanoglu, Alex Orailoglu
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

Scan-based cores impose considerable test power challenges due to excessive switching activity during shift cycles. The consequent test power constraints force SOC designers to sacrifice parallelism among core tests, as exceeding power thresholds may damage the chip being tested. Reduction of test power for SOC cores can thus increase the number of cores that can be tested in parallel, improving significantly SOC test application time. In this paper, we propose a scan chain modification technique that inserts logic gates on the scan path. The consequent beneficial test data transformations are utilized to reduce the scan chain transitions during shift cycles and hence test power. We introduce a matrix band algebra that models the impact of logic gate insertion between scan cells on the test stimulus and response transformations realized. As we have successfully modeled the response transformations as well, the methodology we propose is capable of truly minimizing the overall test power. The test vectors and responses are analyzed in an intertwined manner, identifying the best possible scan chain modification, which is realized at minimal area cost. Experimental results justify the efficacy of the proposed methodology as well.
Super logic programs
Authors: Stefan Brass, Jürgen Dix, Teodor C. Przymusinski
Venue: ACM Transactions on Computational Logic (TOCL) (2004)

The Autoepistemic Logic of Knowledge and Belief (AELB) is a powerful nonmonotonic formalism introduced by Teodor Przymusinski in 1994. In this paper, we specialize it to a class of theories called "super logic programs". We argue that these programs form a natural generalization of standard logic programs. In particular, they allow disjunctions and default negation of arbitrary positive objective formulas.Our main results are two new and important characterizations of the static semantics of these programs, one syntactic, and one model-theoretic. The syntactic fixed point characterization is much simpler than the fixed point construction of the static semantics for arbitrary AELB theories. The model-theoretic characterization via Kripke models allows one to construct finite representations of the inherently infinite static expansions.Both characterizations can be used as the basis of algorithms for query answering under the static semantics. We describe a query-answering interpreter for super programs that we developed based on the model-theoretic characterization and which is available on the web.
Data Dissemination with Ring-Based Index for Wireless Sensor Networks
Authors: Wensheng Zhang, Guohong Cao, Tom La Porta
Venue: Proceedings of the 11th IEEE International Conference on Network Protocols (2003)

In current sensor networks, sensor nodes are capable of not only measuring real world phenomena, but also storing, processing and transferring these measurements. Many data dissemination techniques have been proposed for sensor networks. However, these techniques may not work well in a large scale sensor network where a huge amount of sensing data are generated, but only a small portion of them are queried. In this paper, we propose an index-based data dissemination scheme to address the problem. This scheme is based on the idea that sensing data are collected, processed and stored at the nodes close to the detecting nodes, and the location information of these storing nodes is pushed to some index nodes, which act as the rendezvous points for sinks and sources. We further extend the scheme with an adaptive ring-based index (ARI) technique, in which the index nodes for one event type form a ring surrounding the location which is determined by the event type, and the ring can be dynamically reconfigured for fault tolerance and load balance. Analysis and simulations are conducted to evaluate the performance of the proposed index-based scheme. The results show that the index-based scheme outperforms the external storage-based scheme, the DCS scheme, and the local storage-based schemes with flood-response style. The results also show that using ARI can tolerate clustering failures and achieve load balance.
A practical access to the theory of parallel algorithms
Authors: Christoph Kessler
Venue: Proceedings of the 35th SIGCSE technical symposium on Computer science education (2004)

We describe a parallel programming environment that implements the PRAM (Parallel Random Access Machine) model. The programming environment consists of a C-based PRAM programming language called FORK with a compiler, libraries and tools, and a fast PRAM simulator. The software is freely available for Unix workstations. The programming environment and a systematic way of writing structured parallel programs for the PRAM model are described in a recent textbook.Even though the programming environment was originally developed for a hardware research project, we show that the system is also especially suited for complementing classical theory courses on PRAM algorithms by programming exercises that allow students to experiment with PRAM-style parallelism and actually implement the algorithms as they appear in the theory textbooks.We describe how the environment was used in a recent graduate-level course on parallel algorithms, and report on feedback that we got from the participants.
IEEE-CS/ACM computing curricula: software engineering volume
Authors: Ann E. K. Sobel, Tim Lethbridge
Venue: ACM SIGCSE Bulletin (2003)

One of the problems in advancing the state of the software engineering discipline is the inadequate preparation of students entering the profession from undergraduate computing programs. This panel reports on the IEEE-CS/ACM Computing Curricula project and the guidance it will provide for developing undergraduate software engineering programs. In particular, the panel will address the development process used to construct the Software Engineering Volume, the contents of the first draft of the Volume, and the application of the software engineering curriculum guidelines to international curriculum models.
Knowledge Transfer Among Face-to-Face Information Systems Development Team Members: Examining the Role of Knowledge, Source, and Relational Context
Authors: K. D. Joshi, Saonee Sarker, Superateek Sarker
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 8 - Volume 8 (2004)

Knowledge transfer has been proclaimed as one of the most critical knowledge management activities in the current information age where organizations have to continually learn and continually innovate to remain competitive. Research in the area of knowledge transfer has been conducted in many settings and for various objectives. However, limited attention has been directed towards examining the role of knowledge transfer in information systems development projects (ISD). In this study we empirically examine the impact of source context, knowledge context, and relation context on the process of knowledge transfer among ISD face-to-face team members. Specifically, we test the impact of ISD team member's capability,credibility, and extent of communication on the process of knowledge transfer. Our findings suggest that in face-to-face ISD teams, an individual is perceived to transfer a significant amount of knowledge to his/her team members if an individual extensively interacts with other team members and is perceived as reasonably credible. Interestingly, an individual's task related capability did not affect knowledge transfer.
An area-saving decoder structure for ROMs
Authors: Chua-Chin Wang, Ya-Hsin Hsueh, Ying-Pei Chen
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2003)

Read-only memories (ROMs) are widely used in both digital communication systems and daily consumer electronics. The major functions of ROMs are storage of data, programs, firmwares, etc. In this paper, a three-dimensional decoding structure for ROMs is proposed. The number of address decoding stages is drastically shortened. Hence, the delay is reduced, as well as the power consumption and area. The analysis of overall transistor count and delay is thoroughly derived. A real 256 × 8 ROM possessing the proposed decoder is physically fabricated by 0.5-µm two-poly two-metal (2P2M) CMOS technology.
A peer-to-peer approach to content-based publish/subscribe
Authors: Wesley W. Terpstra, Stefan Behnel, Ludger Fiege, Andreas Zeidler, Alejandro P. Buchmann
Venue: Proceedings of the 2nd international workshop on Distributed event-based systems (2003)

Publish/subscribe systems are successfully used to decouple distributed applications. However, their efficiency is closely tied to the topology of the underlying network, the design of which has been neglected. Peer-to-peer network topologies can offer inherently bounded delivery depth, load sharing, and self-organisation. In this paper, we present a content-based publish/subscribe system routed over a peer-to-peer topology graph. The implications of combining these approaches are explored and a particular implementation using elements from Rebeca and Chord is proven correct.
Little red: storytelling in mixed reality
Authors: Tomoki "Issac" Saso, Kenji Iguchi, Masa Inakage
Venue: ACM SIGGRAPH 2003 Sketches Applications (2003)

This proposal discusses utilizing Mixed Reality (MR) systems as an interface for storytelling, using a picture book as a metaphor. "Little Red" implements methods of re-creating literary work in 3D using MR techniques and a head-mounted display (HMD).
Image data compression in wavelet transform domain using modified LBG algorithm
Authors: Othman Omran Khalifa
Venue: Proceedings of the 1st international symposium on Information and communication technologies (2003)

The recent growth of data intensive digital audio, image, and video applications, have not only sustained the need for more efficient ways to compress images but have made compression of such signals central to image-storage technology and digital communications. Data transfer of uncompressed video over digital networks requires very high bandwidth. The state-of-the-art image compression techniques may exploit the dependencies between the subbands in a wavelet transformed image. In this paper, a modified version of LBG algorithm using Partial Search Partial Distortion is presented for coding the wavelet coefficients to speed up the codebook generation. The proposed scheme can save 70 - 80 % of the Vector Quantization encoding time compared to fully search and reduced arithmetic complexity with out sacrificing performance.
Extended Internet caching protocol: a foundation for building ubiquitous Web caching
Authors: Wenzheng Gu, Abdelsalam (Sumi) Helal
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

Internet access by nomadic users roaming on a mobile network presents a scenario of access that is substantially different from the wired network. With current web caching technology, accessing the web while mobile is slow not only because of bandwidth limitations, but also due to moving away from the home web caching proxy. Furthermore, current web caching strategies ignore web access patterns during periods of mobility. Studies of such scenarios are scarce. In this paper, we propose an Extended Internet Caching Protocol (x-ICP), in which the proxy server of the nomadic user's newly visited network can retrieve web objects from its home network proxy server. Such a scheme decreases the response time for the requests by fetching an object from a usually nearby home network rather than from the origin site. We use trace-based analysis and analytic modeling methods to evaluate x-ICP. We draw several conclusions, all suggesting that x-ICP would be an effective web caching approach for nomadic users, especially in wireless LAN environments.