ppxscal/embedding_network huggingface dataset:
Specifying code analysis tools
Authors: Gerardo Canfora, Aniello Cimitile, Andrea De Lucia
Venue: Proceedings of the 1996 International Conference on Software Maintenance (1996)

Customized code analysis tools for the maintenance and evolution of existing software systems can be created by storing program information into a database, and using an application generator to translate the high level specifications of the analyses the tools are intended to perform. We present a high level domain specific language for the specification of program analysis tools that exploit an algebraic program representation called F(p). The algebraic representation is a compact program view which describes the static composition of the control structures and the set of the resulting potential executions. Operands of the algebraic expression (that represent the program's constructs) are used as indexes to access information stored into a database. The specification language provides facilities for the traversal of the program representation and access to the associated information into the database. The program model and the analyses' results are integrated into a unique conceptual model, thus simplifying the reuse of the results of an analysis and the integration of tools.
An Agent Based Mobile Phone Groupware System Using Location Information
Authors: Akio Koyama, Leonard Barolli, Shinjirou Takami, Noriyuki Kamibayashi, Norio Shiratori
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

Many groupware systems have been used for communication between Personal Computers (PCs) in companies. However, recently, the demands for groupware systems are growing. Especially, by the spread of mobile phone users and systems, new mobile phone groupware systems are needed. In the groupware systems, the location information function which is used to know the location of the group members is a very important function for smoothing thegroup activities. In this paper, we propose a mobile phone groupware system using the location information function. By resolving some problems of location information function of Devora system, we improve the performance of the proposed mobile phone groupware system. The evaluation results show the our system has a smooth operation and thecommunication cost is decreased.
A Formal Method for Software Maintenance
Authors: William C. Chu, Hongji Yang, Paul Luker
Venue: Proceedings of the 1996 International Conference on Software Maintenance (1996)

Petri net theory allows a system to be modeled by a Petri net, an abstract formal model of information flow characterised by controls and constraints. Analysis of the Petri net can then reveal important information about the structure and dynamic behaviour of the modeled system, which can be used to evaluate the modeled system and suggest improvements or changes. This feature can be used in software maintenance. In this paper, we propose a method for developing a Predicate/Transition net(PrT net) for software maintenance, whereby, software components are reverse engineered and annotated with formal predicates, transformed into a PrT net, and analysed on the PrT net. The advantage of the method is that inconsistencies of a program can be detected and revealed precisely.
Optimal Resource Allocation and Reliability Analysis for Component-Based Software Applications
Authors: Jung-Hua Lo, Sy-Yen Kuo, Michael R. Lyu, Chin-Yu Huang
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

In this paper we propose an analytical approach for estimating the reliability of a component-based software. This methodology assumes that the software components are heterogeneous and the transfers of control between components follow a discrete time Markov process. Besides, we also formulate and solve two resource allocation problems. Finally, we demonstrate how these analytical approaches can be employed to measure the reliability of a software system including multiple-input/multiple-output systems and distributed software systems. Experimental results show that the proposed methods can solve the testing-effort allocation problems and improve the quality and reliability of a software system.
A Parallel Phoneme Recognition Algorithm Based on Continuous Hidden Markov Model
Authors: Sang-Hwa Chung, Min-Uk Park, Hyung-Soon Kim
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

This paper presents a parallel phoneme recognition algorithm based on the continuous Hidden Markov Model (HMM). The parallel phoneme recognition algorithm distributes 3-state HMMs of context dependent phonemes to the multiprocessors, computes output probabilities in parallel, and enhances the Viterbi beam search with a message passing mechanism. The algorithm is implemented in a multi-transputer system using distributed-memory MIMD multiprocessors. Experimental results show the feasibility of the parallel phoneme recognition algorithm in constructing a real-time parallel speech recognition system based on time-consuming continuous HMM.
Suitability of Evolutionary Algorithms for Evolutionary Testing
Authors: Joachim Wegener, André Baresel, Harmen Sthamer
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

A great number of today's products is based on the deployment of embedded systems. There are examples of this in nearly all industrial areas, for example in aerospace technology, railway and motor vehicle technology, process and automation technology, communicationtechnology, process and power engineering, as well as in defense electronics. Nearly 90% of all electronic components produced today are used in embedded systems [I]. Embedded systems are also frequently used in applications relevant to safety. Therefore, the occurrence of errors may endanger human lives or result in costly recalls for products produced in high quantities, for example in the automotive industry. Accordingly, the development of embedded systems must comply with the highest quality standards.In order to achieve high quality in the development of embedded systems central importance is attributed to analytical quality assurance. In practice, the most important analytical quality assurance measure is dynamic testing. The thorough testing of systems developed is essential to product quality. The aim of the test is to detect errors in the system to be tested, and to convey confidence in the correct functioning of the system if no errors arefound during comprehensive testing. Testing often takes up more than 50% of the total development costs for embedded systems [4, 5].The most significant weakness of testing is that the postulated functioning of the tested system can, in principle, only be verified for those input situations selected as test data. According to Dijkstra [6], testing can only show the existence but not the non-existence oferrors. The correctness proof can only be produced by a complete test, i.e. a test with all possible input values, input value sequences, and input value combinations under all practically possible constraints. A complete test is usually practically impossible because of the vast amount of possible input situations. Testing is therefore a sampling procedure. Accordingly, an essential testing task is the selection of an appropriate sample containing themost error-sensitive test data. If test data relevant to the practical deployment of the system are omitted, the defined for the test aim and evolutionary computation is applied as a search technique, then the evolutionary test probability of detecting errors within the software declines.
A Case Study on Formal Design of Hybrid Control Systems
Authors: Hong Ki Thae, Dang Van Hung
Venue: Proceedings of the 25th International Computer Software and Applications Conference on Invigorating Software Development (2001)

In this paper, we present an approach to the design of hybrid systems by combination of several comprehensive formalization techniques. We use Duration Calculus (DC) to specify the requirement and design at abstract level of system development. Then the high level designs are further refined in control theory. A formal verification may be done either in DC if it is possible, or in predicate calculus using the semantics of DC or theorems from control theory. We show our techniques through a double water tank case study which is one of the bench mark problem for modern process control engineering.
A Synchronous Paradigm for Modeling Stable Reactive Systems
Authors: Victor L. Winter
Venue: The 4th IEEE International Symposium on High-Assurance Systems Engineering (1999)

This paper describes a modeling technique for single-agent reactive systems, that is influenced by the modeling paradigm of Parnas [5] as well as by the synchronous paradigms of LUSTRE [4] and ESTEREL [1].In this paradigm, single-agent reactive systems are modeled in a universe having a discrete clock. This discretization of time greatly reduces the temporal complexity of the model. We believe that the advantage of this reduction in the temporal complexity is that the resulting model is in many ways better suited to automated software construction and analysis techniques (e.g., deductive synthesis, transformation, and verification) than models that are based on continuous representations of time.
PAC = PAExact and Other Equivalent Models in Learning
Authors: Nader H. Bshouty, Dmitry Gavinsky
Venue: Proceedings of the 43rd Symposium on Foundations of Computer Science (2002)

The Probably Almost Exact model (PAExact) [BJT02] can be viewed as the Exact model relaxed so that:1. The counterexamples to equivalence queries are distributionally drawn rather than adversarially chosen.2. The output hypothesis is equal to the target with negligible error (1/w (poly) for any poly)This model allows studying (Almost) Exact learnability of infinite classes and is in some sense analogous to the Exact-learning model for finite classes.It is known that PAExact-learnable \RightarrowPAC-learnable [BJT02]. In this paper we show that if a class is PAC-learnable (in polynomial time) then it is PAExact-learnable (in polynomial time). Therefore, PAExact-learnable = PAC-learnable.It follows from this result that if a class is PAC-learnable then it is learnable in the Probabilistic Prediction model from examples with an algorithm that runs in polynomial time for each prediction (polynomial in log (the number of trials)) and that after polynomial number of mistakes achieves a hypothesis that predicts the target with probability 1 - 1/2poly.We also show that if a class is PAC-learnable in parallel then it is PAExact-learnable in parallel.Those and other results mentioned in theintroduction answer the open problems posed in [B97, BJT02].
Recognizing on-line handwritten Chinese character via FARG matching
Authors: Jing Zheng, Xiaoqing Ding, Youshou Wu
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

The paper presents a novel method for online handwritten Chinese character recognition. In our method, each category of character is described by a fuzzy attributed relational graph (FARG). A relaxation algorithm is developed to match the input pattern with every FARG. For decision making, a similarity measure is established via statistical technique to calculate the matching degree between the input pattern and referenced FARG, according to which the recognition result is determined. The principle of our method makes it very robust against stroke connection and stroke order variation as well as stroke shape deformation. A database of 22530 samples collected from 6 subjects is used to test our recognition system which can recognize 3755 categories of Chinese characters. The result shows that our method is very effective: a top 1 recognition rate of 98.8% and a top 10 of 99.7% are reached.
Performance monitoring on the PowerPC 604 microprocessor
Authors: Charles P. Roth, Frank Levine, Edward H. Welbon
Venue: Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors (1995)

Performance monitors (PM) have been traditionally viewed as hardware luxuries only available to large/multichip processors. This perception is quickly changing thanks to the incorporation of monitoring instrumentation in most of the current high-volume microprocessors used in PCs and workstations. The PowerPC 604 uP has raised the standard of excellence in this area. It provides a wealth of very advanced features for analyzing system hardware, software, and symmetric multiprocessor systems. These capabilities are becoming indispensable as more function is moved from the system boards to the microprocessors. Furthermore, the PowerPC 604 is enhancing the effort of porting software between various architectures. Software vendors to system architects are currently taking advantage of these PowerPC 604 performance monitor capabilities with great success. Some of these companies include IBM, Apple, Motorola, Groupe Bull, and Microsoft among others.
Testing Extensible Design Patterns in Object-Oriented Frameworks through Scenario Templates
Authors: Wei-Tek Tsai, Yongzhong Tu, Weiguang Shao, Ezra Ebner
Venue: 23rd International Computer Software and Applications Conference (1999)

Design patterns have been used in object-oriented frameworks. This paper first discusses the issues in testing applications developed with design patterns using an object-oriented framework. Two kinds of design patterns are available, extensible and static patterns, and this paper focuses on testing applications using later one. Applications developed using extensible design patterns are difficult to test due to dynamic typing, dynamic binding, extensibility, and communication complexity. This paper then presents a technique, Message Framework Sequence Specifications (MfSS), for generating scenario templates that can be used to generate various kinds of test scenarios to test applications developed using extensible design patterns and an object-oriented framework. Finally, this paper uses the MfSS technique to test a small bank framework. The test scenarios generated successfully detected numerous faults that were seeded in the program.
Distributed Submesh Determination in Faulty Tori and Meshes
Authors: Hsing-Lung Chen, Shu-Hua Hu
Venue: Proceedings of the 11th International Symposium on Parallel Processing (1997)

Torus/mesh-based machines have received increasing attention. It is natural to identify the maximum healthy submeshes in a faulty torus/mesh so as to lower potential performance degradation, because the time for executing a parallel algorithm tends to depend on the size of the assigned submesh. This paper proposes an efficient approach for identifying all the maximum healthy submeshes present in a faulty torus/mesh. The proposed approach is based on manipulating set expressions, with the search space reduced considerably by taking advantage of the interesting properties of a faulty torus/mesh.
Timestamp consistency and trace-driven analysis for distributed parallel systems
Authors: Ching-Farn Eric Wu, Yew-Huey Liu, Yarsun Hsu
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

A continuous stream of event data describing the progress of parallel program execution is realized for trace-driven analysis. Unfortunately, it is often the case that separate streams are produced independently by multiple processors in the system, and the logical order of events cannot be guaranteed due to discrepancy among local clocks. We present an integrated approach for timestamp consistency and performance analysis techniques for IBM SPn systems. The trace facility requires no source code modification, and can generate message passing and system events with minimal trace overhead. Trace-driven analysis tools are developed to extract useful information. Analysis results for NAS kernel benchmarks are reported.
A Uniform Framework for Integrating Knowledge in Heterogeneous Knowledge Systems
Authors: Sibel Adali, Ross Emery
Venue: Proceedings of the Eleventh International Conference on Data Engineering (1995)

Integrating knowledge from multiple sources is an important aspect of automated reasoning systems. Wiederhold and his colleagues (1993) have proposed the concept of a mediator-a device that will express how such an integration is to be achieved. In (1994) Subrahmanian et al. presented a uniform declarative and operational framework for mediators for amalgamating multiple knowledge bases and data structures (e.g. relational, object-oriented, spatial, and temporal structures) when these knowledge bases (possibly) contain inconsistencies, uncertainties, and nonmonotonic modes of negation. We specify the programming environment for this framework and show that it can be used to extract and integrate information obtained from different sources of data and resolve conflicts. We also show that it can be extended easily to integrate new knowledge bases.
Impact of Adaptivity on the Behaviour of Networks of Workstations under Bursty Traffic
Authors: Federico Silla, Manuel P. Malumbres, José Duato, Donglai Dai, Dhabaleswar K. Panda
Venue: Proceedings of the 1998 International Conference on Parallel Processing (1998)

Networks of workstations (NOWs) are becoming increasingly popular as an alternative to parallel computers. Typically, these networks present irregular topologies, providing the wiring flexibility, scalability, and incremental expansion capability required in this environment. Similar to the evolution of parallel computers, NOWs are also evolving from distributed memory to shared memory. However, distances between processors are longer in NOWs, leading to higher message latency and lower network bandwidth. Therefore, we can expect the network to be a bottleneck when executing some parallel applications on a NOW supporting a shared-memory programming paradigm.In this paper we analyze whether the interconnection network in a NOW is able to efficiently handle the traffic generated in a DSM with the same number of processors. We evaluate the behavior of a NOW using application traces captured during the execution of several SPLASH2 applications on a DSM simulator. We show through simulation that the adaptive routing algorithm previously proposed by us almost eliminates network saturation due to its ability to support a higher sustained throughput. Therefore, adaptive routing becomes a key design issue to achieve similar performance in NOWs and tightly-coupled DSMs.
Exploiting Pseudo-Schedules to Guide Data Dependence Graph Partitioning
Authors: Alex Aletà, Josep M. Codina, F. Jesús Sánchez, Antonio González, David R. Kaeli
Venue: Proceedings of the 2002 International Conference on Parallel Architectures and Compilation Techniques (2002)

This paper presents a new modulo scheduling algorithm for clustered microarchitectures. The main feature of the proposed scheme is that the assignment of instructions to clusters is done by means of graph partitioning algorithms that are guided by a pseudo-scheduler. Thispseudo-scheduler is a simplified version of the full instruction scheduler and estimates key constraints that would be encountered in the final schedule.The final scheduling process is bi-directional and includes on-the-fly spill code generation. The proposed scheme is evaluated against previous scheduling approaches using the SPECfp95 benchmark suite. Our modeling results show that better schedules are obtained for most programs across a range of different architectures. For a 4-cluster VLIW architecture with 32 registers and a 2-cycle inter-cluster communication delay we obtain an average speedup of 38.5%.
Database Support for Spatial Generalisation for WWW and Mobile Applications
Authors: Xiaofang Zhou, Sham Prasher, Masaru Kitsuregawa
Venue: Proceedings of the 3rd International Conference on Web Information Systems Engineering (2002)

The need of using spatial vector data for web-based andmobile applications has been increasing rapidly. Vectorspatial data is difficult to generalise (that is, to derive asuitable Level of Detail, or LoD, of the data for a givenapplication). In a client-server environment, excessivedetails of spatial data cannot always be appreciated onthe client side, but could consume a significant amount ofresources on both the server and the client side, not tomention the extra cost of data transfer. Spatial datageneralisation has been investigated extensively in thearea of cartography. Most cartographical generalisationalgorithms, however, are post-query operations where allthe data, including unneeded data, is retrieved from thedatabase for simplification. In this paper, we incorporatespatial data simplification algorithms into queryprocessing within DBMS. This novel approach targetsprimarily web-based and mobile spatial applications thatstand to benefit from early data reduction. Experimentson real data reveal significant performance improvementsfor our approach.
The Holonic Enterprise: Modeling Holarchies as MAS to Enable Global Collaboration
Authors: Mihaela Ulieru
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

We propose an e-business model, the Holonic Enterprise (HE) which integrates several paradigms (Holonics, MAS, Virtual Enterprise, Web-Centric and Co-opetition) that have emerged as a result of the tremendous shift in the business dynamics on the global market enabled by the Internet and communication network technologies. The fundamental differences between holons and agents are addressed and the main challenges of the HE model implementation briefly stated, as they are commonly addressed by several collaborative research consortia. An innovative solution to automatic clustering of MAS into holarchies by fuzzy entropy minimization and our efforts to integrate it with an evolutionary search for the best partners concludes the paper.
The Cooperative Web: A Complement to the Semantic Web
Authors: Daniel Gayo Avello, Darío Álvarez Gutiérrez
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

The Web is a colossal document repository that is nowadays processed by humans only. The machines' role is just to transmit and display the contents, barely being able to do something else. The Semantic Web tries to change this status so that software agents can manipulatethe semantic contents of the Web. There are some technologies proposed for this task that facilitate the definition of ontologies and the semantic markup of documents based on that ontologies. However, although the Semantic Web can be very useful in fields such ase-business, digital libraries or knowledge management inside corporate intranets, it is difficult to apply to the global Web. We propose a different, although complementary, approach: The Cooperative Web. With this approach, it would be possible to extract semantics from the Web without the need of ontological artifacts. Besides, the experience of the users would also beleveraged.
Stick-Ons Revisited
Authors: Edgard Pineda, José A. Pino
Venue: Proceedings of the Seventh International Workshop on Groupware (2001)

Abstract: The Stick-Ons concept as a tool for local versioning in collaborative writing is re-examined. A logical consistency case concerning its use is presented. Then, the design of a system including Stick-Ons is discussed. One of the main objectives of this system is to be of practical use. Therefore, it is built on top of Microsoft Word, a popular word processing application. Details of the current prototype are given. The prototype is briefly compared with other writing tools concerning collaborative features.