ppxscal/embedding_network huggingface dataset:
Investigating Reinspection Decision Accuracy Regarding Product-Quality and Cost-Benefit Estimates
Authors: Stefan Biffl, Michael Halling
Venue: Proceedings of the 25th International Computer Software and Applications Conference on Invigorating Software Development (2001)

After a software inspection the project manager has to decide whether a product has sufficient quality to pass on to the next software development stage or whether a sec-ond inspection cycle, a reinspection, is likely to suffi-ciently improve its quality. The reinspection decision of recent research focused on the estimation of product quality after inspection, which does not take in to account the effect of a reinspection. Thus we propose to use esti-mation models for the quality improvement during rein-spection and the cost and benefit of a reinspection as ba-sis for the reinspection decision.We evaluate the reinspection decision correctness of these models with time-stamped defect data from a large-scale controlled experiment on the inspection and reinspection of a software requirements document. The main finding of the investigation is that the product-quality criterion is likely to force products to be rein-spected, if a large number of defects were detected in the first inspection. Further the product-quality criterion is especially sensitive to an underestimation of the number of defects in the product and will let bad products pass as good. The cost-benefit criterion is less sensitive to estima-tion error than the product-quality criterion and should in practice be used as second opinion, if a product-quality criterion is applied.
On-line handwriting character recognition method with directional features and direction-change features
Authors: Masayoshi Okamoto, Kazuhiko Yamamoto
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

We propose a new on-line recognition method to recognize handwritten cursive-style characters correctly. Our method simultaneously uses both directional features, otherwise known as off-line features, and direction-change features, which we designed as on-line features. These features are expressed in the divided meshes of the character area. The directional features express the directions between character's coordinates within the meshes. The direction-change features express where in the mesh and in which direction each direction of the character's coordinates change, and express where the circular parts of the character are in the mesh. These features express both written strokes in the pen-down state and unwritten imaginary strokes in the pen-up state. Our method recognizes an inputted character by comparing the inputted character's features and the features of standard characters. The recognition rate was improved by our method with directional features and direction-change features as opposed to the traditional method with only directional features. Moreover, the recognition rate was also improved by considering imaginary strokes in the pen-up state.
A Memory Efficient Array Architecture for Real-Time Motion Estimation
Authors: Vasilz G. Moshnyaga, Keikichi Tamaru
Venue: Proceedings of the 11th International Symposium on Parallel Processing (1997)

A new 2-D array architecture for real-time video picture motion estimation is presented. Due to incorporated concepts of video memory distribution and sharing, the architecture ensures feasible solutions for the HDTV picture format with lower memory requirements. It features minimal I/O pin count, 100% processor utilization and is quite suitable for VLSI implementation.
Structural information as a quality metric in software systems organization
Authors: Giuseppe Visaggio
Venue: Proceedings of the International Conference on Software Maintenance (1997)

Proposes a metric for expressing the entropy of a software system and for assessing the quality of its organization from the perspective of impact analysis. The metric is called "structural information" and is based on a model dependency descriptor. The metric is characterized by its independence from the method of building the system and the architectural styles which represent it at the various levels of abstraction. It takes into account both the structure of the components at all levels of abstraction and the structure derived from the links between the different levels of abstraction. The use of this metric makes it possible to monitor changes in the quality levels of the system during its life-cycle and to determine which level of documentation is causing the degradation of the system. This enables adopting timely measures to counter any drop in the quality of a system due to poorly-performed maintenance. In addition, the metric can serve to check that perfective maintenance objectives are attained.
Fuzzy Data Recognition by Polynomial Bidirectional Heteroassociator
Authors: Cheng-Fa Tsai
Venue: 24th International Computer Software and Applications Conference (2000)

This investigation presents a novel method of pattern recognition using the polynomial bidirectional heteroassociator (PBH). This network can be used for the industrial application of optical character recognition. According to detailed simulations, the PBH has a higher capacity for pattern pair storage than that of the conventional bidirectional associative memories and fuzzy memories. Meanwhile, the practical capacity of a PBH considering fault tolerance is discussed. The fault tolerance requirement leads to the discovery of the attraction radius of the basin for each stored pattern pair. The PBH takes advantage of fuzzy characteristics in evolution equations such that the signal-noise-ratio is significantly increased. In this work, we apply the result of this research to pattern recognition problems. The practical capacity of the fuzzy data recognition using the PBH considering fault tolerance in the worst case is also estimated. Simulation results are presented to verify the derived theory.
Putting the World Wide Web into a Data Warehouse: A DWH-Based Approach to Web Analysis
Authors: Andreas Rauber, Oliver Witvoet, Andreas Aschenbrenner, Robert M. Bruckner
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

The World Wide Web, due to its sheer size and dynamics, has turned into one of the most fascinating and important data sources for large-scale analysis and investigation, ranging from content-based information location, dynamics of change, to community analysis. Yet, most projects so far rely on special-purpose tools optimized for a given task, providing only limited flexibility.In this paper we propose a Data Warehouse based approach to analyze the World Wide Web. Information contained in the web pages, meta data on the documents, as well as information acquired from additional sources such as the WHOIS database, are integrated into a multidimensional view of the Web. The resulting system allows for flexible analysis of the various characteristics of the Web. Results from a prototypical study of the Austrian national Web space as part of the AOLA project demonstrate the potential of the presented approach.
On the Informatics Laws of Software
Authors: Yingxu Wang
Venue: Proceedings of the 1st IEEE International Conference on Cognitive Informatics (2002)

A fundamental finding in computer science is that software, as an artifact of human creativity, is not constrained by the laws and principles discovered in the physical world. Thus, a natural question we have to ask is: What are the constraints that software obeys?This paper attempts to demonstrate that software obeys the laws of informatics, because software is a mathematical entity, a coded solution, and a special type of information at a certain abstract level.Based on the above argument, another fundamental question is introduced that asks: What are the laws and principles of informatics that constrain software in software engineering? This paper explores a set of informatics, cognitive, psychological, and linguisticproperties and laws, which are developed to answer the above profound question.
A Rule Engine for Query Transformation in Starburst and IBM DB2 C/S DBMS
Authors: Hamid Pirahesh, T. Y. Cliff Leung, Waqar Hasan
Venue: Proceedings of the Thirteenth International Conference on Data Engineering (1997)

The complexity of queries in relational DBMSs is increasing, particularly in the decision support area and interactive client sewer environments. This calls for a more powerful and flexible optimization of complex queries. H. Pirahesh et al. (1992) introduced query rewrite as a distinct query optimization phase mainly targeted to responding to this requirement. This approach has enabled us to extensively enrich the optimization rules in our system. Further, it has made it easier to incrementally enrich and adapt the system as need arises. Examples of such query optimizations are predicate pushdown, subquery and magic sets transformations, and decorrelating subquery. We describe the design and implementation of a rule engine for query rewrite optimization. Each transformation is implemented as a rule which consists of a pair of rule condition and action. Rules can be grouped into rule classes for higher efficiency, better understandability and more extensibility. The rule engine has a number of novelties in that it supports a full spectrum of control-from totally data driven to totally procedural. Furthermore, it incorporates a budget control scheme for controlling the resources taken for query optimization as well as guaranteeing the termination of rule execution. The rule engine and a suite of query rewrite rules have been implemented in Starburst relational DBMS prototype and a significant portion of this technology has been integrated into IBM DB2 Common Server relational DBMS.
A Color-Based Retrieval System for Images Collected on the World Wide Web
Authors: Camillo J. S. Oliveira, Arnaldo de Albuquerque Araújo, Daniel Ribeiro Gomes, Carlos A. Severiano,  Jr.
Venue: Proceedings of the 15th Brazilian Symposium on Computer Graphics and Image Processing (2002)

This work presents the prototype system for a color-based retrieval of images collected on the Web. The images collected are classified in two semantic classes (photographs and graphics) but only photographs are indexed. It basically stores information about regions with the same color in the image (chromatic regions), such as size, position and boundaries with another regions. This data representation is made using histogram variations of the image as graphs: the Modified Color Adjacency Graph (MCAG) and the Variance Graph (SVG). Image retrieval is done by applying a similar metric based on the comparison of the graphs mentioned here.
Using Modechart Modules for Testing Formal Specifications
Authors: Monica Brockmeyer
Venue: The 4th IEEE International Symposium on High-Assurance Systems Engineering (1999)

Automated model-checking of formal specifications for real-time systems has remained an elusive goal due to the {\em state-space} explosion problem. This paper describes an approach to testing formal specifications using automatically generated testing modules. This technique preserves many of the advantages of using formal specifications while mitigating the state-space explosion problem by focusing state-space exploration to a subset determined by the test. Because the testing modules are defined in the same formalism as the specification, the semantics of the test are precisely defined. Moreover, existing model-checking tools can be leveraged to perform the testing. Finally, this approach reduces evaluation of a potential complex assertion to a simple reachability condition in the tested specification's state space.
The EQ Framework for Learning Equivalence Classes of Bayesian Networks
Authors: Paul Munteanu, Mohamed Bendou
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

This paper proposes a theoretical and an algorithmic framework for the analysis and the design of efficient learning algorithms which explore the space of equivalence classes of Bayesian network structures.This framework is composed of a generic learning model which uses essential graphs and more general partially directed graphs i order to represent the equivalence classes evaluated during search, operational characterizations of these graphs, processing procedures and formulas for directly calculating their score.The experimental results of the algorithms designed within this framework show that the space of equivalence classes may be explored efficiently and with better results than the classical search in the space of Bayesian network structures.
Centre for Development of Advanced Computing: DS-Link over Fiber: A High-Speed Interconnect for Cluster Computing
Authors: Yogindra Abhyankar, Anil Degwekar, Abhay Karandikar
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

Recently, there has been a considerable upsurge in cluster based computing. Centre for Development of Advanced Computing, at Pune, India is also offering a cluster computing solution based on its proprietary network (More information is available on request from Business Division, C-DAC, Pune 411 007, India.). This network is built around a high speed interconnect which uses DS-link protocol, a part of IEEE 1355 standard. One of the disadvantages that prevents DS links to operate in a geographically distributed computing environment is its distance limitation. In this paper, we have sought to remove this limitation by suggesting a scheme for implementing DS links over optical fibers. This scheme has been designed and implemented by us. Here, we discuss the salient features of our scheme. Our preliminary studies indicate that a cluster computing solution using this extended link will be an attractive solution.
Implicit state minimization of non-deterministic FSMs
Authors: T. Kam, T. Villa, R. Brayton, A. Sangiovanni-Vincentelli
Venue: Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors (1995)

This paper addresses state minimization problems of different classes of non-deterministic finite state machines (NDFSMs). We present a theoretical solution to the problem of exact state minimization of general NDFSMs, based on the proposal of generalized compatibles. This gives an algorithmic frame to explore behaviors contained in a general NDFSM. Then we describe a fully implicit algorithm for state minimization of pseudo non-deterministic FSMs (PNDFSMs). The results of our implementation are reported and shown to be superior to a previous explicit formulation. We could solve exactly all but one problem of a published benchmark, while an explicit program could complete approximately one half of the examples, and in those cases with longer run times.
Self-organizing Algorithm of Robust PCA Based on Single-layer NN
Authors: Wang Song, Xia Shaowei
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

One way to improve the robustness of principal component analysis (PCA) is studied in order to increase the accuracy of feature-extraction in bank-check recognition. The typical two kinds of aspects to analyze the robustness of PCA algorithm are proposed and compared: one is based on the independent among the acquired principal components and the other is based on reducing the effects of the outliers in the training sample set. A new self-organizing algorithm of robust PCA is presented based on the structure of single-layer neural network (NN) with the modification of the cost function which stands for the reconstruction error of the input signal. The new nonlinear robust PCA algorithm can recognize the outliers in the training sample set automatically and exterminate their effects to the accuracy and convergence of the PCA algorithm through proper processing to the recognized outliers.
Toward Efficient Algorithms for Generating Compact Petri Nets from Labeled Transition Systems
Authors: Ugo A. Buy, Gaurav Singal
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

Compositional methods for Petri-net-based verification of concurrent systems are appealing because they allow the analysis of a complex system to be carried out in a piece-by-piecemanner. An issue in compositional Petri-net analysis is the generation of a compact net from a Labeled Transition System (LTS) isomorphic to the reachability graph of the net. Several existing approaches for Petri-net generation use the concept of region, a subset of the original LTS; however, the computation of the regions in an LTS appears to be quite expensive. We report preliminary results on the generation of a Petri net from an LTS isomorphic to the net's reachability graph without requiring the computation of regions. We specifically introduce two algorithms for generating the place set and flow relation of a safe and live ordinary Petri net. The most complex of the two algorithms is nearly linear in the size of the input LTS.
Extraction of finite state machines from transistor netlists by symbolic simulation
Authors: Manish Pandey, Alok Jain, Randal E. Bryant, Derek Beatty, Gary York, Samir Jain
Venue: Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors (1995)

The paper describes a new technique for extracting clock level finite state machines (FSMs) from transistor netlists using symbolic simulation. The transistor netlist is preprocessed to produce a gate level representation of the netlist. Given specifications of the circuit clocking and input and output timing, simulation patterns are derived for a symbolic simulator. The result of the symbolic simulation and extraction process is the next state and output function of the equivalent FSM, represented as Ordered Binary Decision Diagrams. Compared to previous techniques, our extraction process yields an order of magnitude improvement in both space and time, is fully automated and can handle static storage structures and time multiplexed inputs and outputs.
Skew and Slant Correction for Document Images Using Gradient Direction
Authors: Changming Sun, Deyi Si
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

A fast algorithm is presented in this paper for skew and slant correction in printed document images. The algorithm employs only the gradient information. The skew angle is obtained by searching for a peak in the histogram of the gradient orientation of the input grey-level image. The skewness of the document is corrected by a rotation at such an angle. The slant of characters can also be detected using the same technique, and can be corrected by a shear operation. A second method for character slant correction by fitting parallelograms to the connected components is also described. Document images with different contents (tables, figures, and photos) have been tested for skew correction and the algorithm gives accurate results on all the test images, and the algorithm is very easy to implement.
Meta-Modeling for Distributed Object Environments
Authors: Colin Atkinson
Venue: Proceedings of the 1st International Conference on Enterprise Distributed Object Computing (1997)

Meta-modeling is critical to the success of distributed object environments such as CORBA and ActiveX/ DCOM. However, there is a surprisingly large variation in the nature of the meta-models (and meta-meta-models) that have been proposed for such environments. This paper investigates this phenomenon by examining the basic tenets of meta-modeling in the context of distributed object environments, and by defining the basic properties required of a suitable meta-modeling framework. The paper is not concerned with the content of the meta-models, per se, but rather with the form that this content should take, and the rules that it should adhere to. The ramifications of these rules on the notations and languages for distributed object environments are then considered.
Scalability of SCI Workstation Clusters: A Preliminary Study
Authors: Knut Omang, Bodo Parady
Venue: Proceedings of the 11th International Symposium on Parallel Processing (1997)

SCI is based on unidirectional point-to-point links connected in rings. Separate rings can be connected using switches to allow for larger configurations than are feasible with a single ring. The SCI standard is implemented in the LinkController (LC-1) chip from Dolphin Interconnect Solutions. Experiments are conducted on a set of Sun UltraSparc workstations connected by the new Sbus/SCI adapters based on the LC-1. The practical limit on the number of nodes on a ring depends on the host interface and the link capacity and tuning, as well as the expected interconnect load. Single ring configurations of up to 10 nodes on a ring and 4 and 8 node systems using multiple smaller rings connected through a 4-way switch are analyzed with respect to latency and network throughput. Results demonstrate a peak aggregate ring bandwidth of 187 Mbytes/s in a 10 node ring configuration, and a peak bandwidth of 153 Mbytes/s for the 4-way switched 8 node system. Results also show that the interconnect is sensitive to certain traffic patterns, and that different topologies have different weak spots in this sense.
Data-rich Section Extraction from HTML pages
Authors: Jiying Wang, Frederick H. Lochovsky
Venue: Proceedings of the 3rd International Conference on Web Information Systems Engineering (2002)

In this paper, we propose a novel algorithm, DSE (Data-richSubtree Extraction) to recognize and extract the data-richsection of an HTML page. We apply the DSEalgorithm as a pre-processing "clean-up" step for twotypical web information retrieval problems: topicdistillation and web information extraction. Ourexperiments show that, for the test data sets we used, theDSE algorithm can correctly identify the data-rich sectionsof HTML pages with 100% accuracy. Therefore, it caneffectively reduce the root set size for the topic distillationproblem thereby improving the precision and accuracy ofthe HITS algorithm. Furthermore, when applied to the webinformation extraction problem using the IEPADalgorithm, it can decrease the number of patternsdiscovered by this algorithm, thus shortening its time costto generalize a wrapper for HTML pages.
Data Sharing on the Web
Authors: Boualem Benatallah, Athman Bouguettaya
Venue: Proceedings of the 1st International Conference on Enterprise Distributed Object Computing (1997)

The Internet and the World Wide Web (WWW) have elicited the explosion of accessible data repositories. Because high connectivity is now a reality, the challenge has been to take advantage of it to enable data sharing in a cost-effective way. Any proposed architecture would have to allow dynamic couplings of heterogeneous databases based on their content and interest. We propose an implementation using CORBA and Web technologies as a distributed infrastruture and platform to support the dynamic interconnection of heterogeneous and autonomous databases on the Web.
Closing the Loop: An Agenda- and Justification-Based Framework for Selecting the Next Discovery Task to Perform
Authors: Gary Livingston, John M. Rosenberg, Bruce G. Buchanan
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

We propose and evaluate an agenda-and justification-basedarchitecture for discovery systems that selects the next tasks to perform. This framework has manydesirable properties: (1) it facilitates the encoding of general discovery strategies using a variety of backgroundknowledge, (2) t reasons about the appropriateness of the tasks being considered, and (3) it tailors its behavior toward a user 's interests. A prototype discovery program called HAMB demonstrates that both reasons andestimates of interestingness contribute to performance in the domains of protein crystallization and patient rehabilitation.