ppxscal/embedding_network huggingface dataset:
Program Comprehension and Software Migration Strategies
Authors: Hausi A. Müller
Venue: Proceedings of the 8th International Workshop on Program Comprehension (2000)

Information systems have been in successful operation for many years. During this time, they have met hanging organizational demands, business requirements, or computing platforms; have been the backbone of many organizations' information flow; or have been mission critical for the organizations that own and operate them. Managing such systems is difficult because of spiraling maintenance costs and shortages of qualified personnel who are willing to work with obsolete programming languages and operating systems. Eventually, information technology managers are confronted with the challenging decision of whether to redevelop the legacy application from scratch, to wrap selected components, or to reengineer it. Regardless of which option is chosen from this spectrum it will be costly and entail significant risks. Program comprehension methods and tools are important prerequisites for making informed decisions about migration strategies and for assessing the costs and risks of the selected migration paths. For many years, the International Workshop on Program Comprehension (IWPC) has been a forum to present and discuss program comprehension research, practice and experience needed for software migration. In this talk, we show how program comprehension and migration strategies have evolved and influenced each other over the past decade. We also argue that these strategies are suited for the next legacy challenge: the evolution and migration of Web sites. 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
Concrete bridge rating expert system with neuro-fuzzy hybrid system and its application
Authors: K. Kawamura, A. Miyamoto
Venue: Proceedings of the sixth international conference on Application of artificial intelligence to civil & structural engineering (2001)

This article presents a new approach for developing a concrete bridge rating expert system for deteriorated concrete bridges, constructed from multi-layer neural networks with fuzzy logic in order to carry out fuzzy inference and machine learning. The system evaluates the performance of concrete bridges such as durability and load-carrying capability on the basis of a simple visual inspection and technical specifications. The main reason of applying the neural network is that it performs fuzzy inference in the network, facilitates refinement of the knowledge base by use of the Back-Propagation method, and prevents not only the inference mechanism of the expert system but also knowledge base after machine learning from becoming a black box. In this paper, comparisons between the diagnostic results of bridge experts and those of the proposed system are presented so as to demonstrate the validity of the system's learning capability. The training set for machine learning is obtained from inspection of actual in-service bridges and questionnaire surveys of bridge experts.
A Comparison of Functional and Structural Partitioning
Authors: Vahid, Le, Hsu
Venue: Proceedings of the 9th international symposium on System synthesis (1996)

Incorporating functional partitioning into a synthesis methodology leads to several important advantages. In functional partitioning, we first partition a functional specification into smaller sub-specifications and then synthesize structure for each, in contrast to the current approach of first synthesizing structure for the entire specification and then partitioning that structure. One advantage is that of greatly improved partitioning among a given set of packages with size and I/O constraints, such as FPGA's or ASIC blocks, resulting in better performance and far fewer required packages. A second advantage is that of greatly reduced synthesis runtimes. We present results of experiments demonstrating these important advantages, leading to the conclusion that further research focus on functional partitioning can lead to improved quality and practicality of synthesis environments.
Network Design and Network Cut Dualities: Approximation Algorithms and Applications
Authors: Ajit K Agrawal
Venue:  (1991)

We give approximation algorithms for two network design problems. These problems arise in designing communication networks where a prespecified set of sites needs to be connected through a network. Different applications judge the merit of the networks using different cost criteria. We consider two such cost criteria. Under the first criterion, a network of minimum total edge-cost is to be designed. This problem is known as the {\em Steiner-tree problem.} Under the second criterion, the network''s maximum degree is to be minimized; this is referred to as the {\em min-degree problem.} Both these problems are known to be NP-complete. Our algorithms output a network in polynomial time whose cost is within a small multiplicative factor of the minimum network cost. Our algorithm for the Steiner-tree problem extends to a more general setting of the connectivity requirements of the network known as the {\em generalized Steiner problem.} No approximation algorithms were previously known for either the generalized Steiner problem or the min-degree problem. Underlying the proofs of performance for the above algorithms are approximate min-max equality relations, which we establish, between the network design problems and some combinatorial problems in finding network cuts. In turn, we also provide approximation algorithms for these combinatorial problems related to network cuts, and describe their applications. We also apply a previously known approximation algorithm for yet another combinatorial quantity related to network cuts to a problem that arises in the solution of sparse linear systems. We present the first polynomial-time algorithm that finds an elimination ordering that guarantees approximately optimal fill in solving certain symmetric sparse linear systems. Our algorithm is a variant of the well-known nested dissection algorithm and uses a result of Leighton and Rao for finding a balanced node separator in a graph. We also give some experimental results showing the quality of the elimination orderings produced by our algorithm.
Executive's Guide to the Wireless Workforce
Authors: Russ D. Lambert
Venue:  (2003)

:The wireless web is the use of the Internet without any wires. It allows sales people, service technicians, and customers to connect with companies without being at their personal computers. This book provides nontechnical senior managers with a succinct step-by-step methodology for understanding, analyzing, and developing a wireless strategy. 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
Dynamic QoS-Aware Multimedia Service Configuration in Ubiquitous Computing Environments
Authors: Xiaohui Gu, Klara Nahrstedt
Venue: Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02) (2002)

Ubiquitous computing promotes the proliferation of various stationary, embedded and mobile devices interconnected by heterogeneous networks. It leads to a highly dynamic distributed system with many devices and services coming and going frequently. Many emerging distributed multimedia applications are being deployed in such a computing environment. In order to make the experience for a user truly seamless and to provide soft performanceguarantees, we must meet the following challenges: (1) users should be able to perform tasks continuously, despite changes of resources, devices and locations; (2) users should be able to efficiently utilize all accessible resources within runtime environments to receive the best possible Quality-of-Service (QoS). In this paper, we propose an integrated QoS-aware service configuration model to address the above problems. The configuration model includes twotiers: (1) service composition tier, which is responsible for choosing and composing current available service components appropriately and coordinating arbitrary interactions between them to achieve the user's objectives; and (2) service distribution tier, which is responsible for dividing an application into several partitions and distributing them to different available devices appropriately. Our initial ex-perimental results based on both prototype and simulationsshow the soundness of our model and algorithms.
Procedures for Detecting and Correcting Errors
Authors: P. A. D. DeMaine
Venue:  (1990)

This series of papers is devoted to demonstrating selected members of a family of thirteen general expert systems that can be used as educational and research aids by chemists and engineers with minimal computer skills. As the key systems do not use the state-of-the-art and therefore do not mimic human reasoning, they can predict unprecedented events. Here the family of general expert systems are described briefly and the CURFIT system is demonstrated. In CURFIT, whose basis is the least squares curve-fitting method, the raw data and their user stipulated Maximum Tolerances or Uncertainties are used to reject erroneous data-points, detect curvature, and determine the equation(s) that describes the data to within the stipulated maximum tolerances. Within the available computer resources there is no limit on the number of variables in the fitting equation, and different equations can be unambiguously compared. 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
Teaching the evaluation of object-oriented designs
Authors: Robert Biddle, James Noble, Ewan Tempero
Venue: Proceedings of the fifth Australasian conference on Computing education - Volume 20 (2003)

This paper describes an approach to teaching evaluation of object-oriented designs, using well known design heuristics along with a process for heuristic evaluation. This is based on work introducing object-orientation to industry groups, and is motivated by our observations about the needs for design evaluation in industry, but we have applied the same approach in our university teaching. We have found the approach useful in explicitly addressing an undervalued step in software development, and one that deals with object-oriented design explicitly, while not involving any unproven radical elements.
Question classification using support vector machines
Authors: Dell Zhang, Wee Sun Lee
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

Question classification is very important for question answering. This paper presents our research work on automatic question classification through machine learning approaches. We have experimented with five machine learning algorithms: Nearest Neighbors (NN), Naive Bayes (NB), Decision Tree (DT), Sparse Network of Winnows (SNoW), and Support Vector Machines (SVM) using two kinds of features: bag-of-words and bag-of-ngrams. The experiment results show that with only surface text features the SVM outperforms the other four methods for this task. Further, we propose to use a special kernel function called the tree kernel to enable the SVM to take advantage of the syntactic structures of questions. We describe how the tree kernel can be computed efficiently by dynamic programming. The performance of our approach is promising, when tested on the questions from the TREC QA track.
The MIDAS Data-Mining Project at Stanford
Authors: Jeffrey D. Ullman
Venue: Proceedings of the 1999 International Symposium on Database Engineering & Applications (1999)

The following notes summarize recent research into data-mining techniques that are in progress at Stanford: 1. The Google search engine: beating Yahoo et al. At their own game. 2. Query Flocks: Generalizing association rules/market baskets in a query precompiler that uses a relational DBMS effectively. 3. Synthesizing Knowledge from the Web: exploiting the Web's redundancy to extract data automatically. 4. Detecting Low-Frequency Events: Unlike marketing, where you only care about items that lots of people buy, extracting intelligence from text usually requires looking for a small number of unexpected juxtapositions of terms.
Using Aspects to Design a Secure System
Authors: Geri Georg, Indrakshi Ray, Robert France
Venue: Proceedings of the Eighth International Conference on Engineering of Complex Computer Systems (2002)

Developers of complex systems have to addressconcerns such as security, availability of services, andtimeliness that often are non-orthogonal to traditionaldesign structures, that is, the concerns cross-cuttraditional design units. In this paper we illustrate how anaspect-oriented approach to modeling allows developersto encapsulate such design concerns so that they can bewoven into a design in a systematic and consistentmanner. The paper focuses on the use of aspects formodeling and weaving in security concerns.
Modelling and Specifying Name Visibility and Binding Semantics
Authors: Scott A. Vorthmann
Venue:  (1993)

This paper describes visibility networks, a graphical model of static name visibility and binding. A visibility network is a visual representation of the search algorithm performed when binding a name reference to a declaration. In conjunction with an extended attribute grammar mechanism, visibility networks allow clear and precise specification of the naming semantics of programming languages. The power of the model is demonstrated through its description of several examples of complex visibility constraints in Ada. As a specification technique, the model has several advantages for the language designer, including support for prototyping, analysis, formal description, and documentation of naming semantics. Similar advantages make the visibility network model pedagogically attractive. Finally, it has been demonstrated that the specifications can be used to automatically generate naming semantics modules for compilers and language-based editors, reducing the burden of the language implementor. 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
Representing and Reformulating Diagonalization Methods
Authors: Erica Melis
Venue:  (1994)

Finding an appropriate representation of planning operators is crucial for theorem provers that work with proof planning. We show a new representation of operators and demonstrate how diagonalization can be represented by operators. We explain how a diagonalization operator used in one proof-plan can be analogically transferred to an operator used in another proof-plan. Finally, we find an operator that is common to all the proof-plans and thus might be considered as the Diagonal Method.
Protein Secondary Structure Prediction with Bayesian Learning Method
Authors: Peng-Liang Wang, Du Zhang
Venue: Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence (2002)

This paper describes a Bayesian learning based approach to protein secondary structure prediction. Four secondary structure types are considered, including a-helix, β-strand, β-turn and coil. A six-letter exchange group is utilized to represent a protein sequence. Training cases are expressed as sequence quaternion. A tool called Predictor is developed in Java that implements the proposed approach. To evaluate the tool, we select, from the Protein Data Bank and based on the principle of one-protein-per-family according to the structure family of SCOP, six hundred and twenty-three known proteins without pair wise sequence homology. Several training/test data splits have been tried. The results show that our proposed approach can produce prediction accuracy comparable to those of the traditional prediction methods. Predictor has user-friendly and easy-to-use GUIs, and is of practical value to the molecular biology researchers.
Revisiting the Classical Fault Models through a Detailed Analysis of Realistic Defects
Venue: Proceedings of the 2nd International Symposium on Quality Electronic Design (2001)

This paper analyzes the behavior of a realistic defect taking into account the unpredictable parameters of the defect. Using a simple example of short defect in the context of Boolean testing, it is first demonstrated that a given defect has a 'size' that depends on unpredictable parameters. It is then shown that a defect may be detected by a vector but for a given domain of the unpredictable parameter called the Detection Domain. Then different types of redundancy are analyzed taking into account the defect Detection Domains. And finally, it is shown that defect detection can be improved by using 'Improved fault models'. 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
The grazing collisions asymptotics of the non cut-off Kac equation
Authors: Giuseppe Toscani
Venue:  (1997)

We investigate the non cut-off Kac equation when the cross-section is concentrating on grazing collisions. We prove that this process leads to the one-dimensional Fokker-Planck equation, and that, at least under suitable regularity of the initial data, the convergence is uniform in time. EMAIL:: ian@microian
Hybrid Verification by Exploiting the Environment
Authors: Limor Fix, Fred B. Schneider
Venue:  (1994)

A method of verifying hybrid systems is given. Such systems involve state components whose values are changed by continuous (physical) processes. The verification method is based on proving that only those executions that satisfy constraints imposed by an environment also satisfy the property of interest. A suitably expressive logic then allows the environment to model state components that are changed by physical processes.
ADIPS Framework and It's Application to Symbiotic Space on Network Environment
Authors: Shigeru Fujita, Kenji Sugawara, Tetsuo Kinoshita, Norio Shiratori
Venue: Proceedings of the 1998 International Conference on Parallel Processing Workshops (1998)

The aim of this research is to develop a flexible reasoningsupport environment (cyberspace) that can perceive, reasonand act to achieve multiple goals under dynamic, uncertainand complex conditions found in information systems.Current information system architectures are too rigid tocope with heterogeneity, inaccuracy and inflexibility of thereal world requirements. In order to overcome suchlimitations we propose a distributed multiagent softwarearchitecture for flexible intelligent information systems withthe following goals: a) Construct a framework for thedevelopment of agent-oriented systems in distributedenvironment called ADIPS, as an infrastructure and twoclasses of systems are built on it, and b) Develop a reasoningsupport environment called Cyber Office.
Complexity of Network Reliability and Optimal Database Placement Problems
Authors: Donald B. Johnson, Larry Raab
Venue:  (1991)

A fundamental problem of distributed database design in an existing network where components can fail is finding an optimal location at which to place the database in a centralized system or copies of each data item in a decentralized or replicated system. In this paper it is proved for the first time exactly how hard this placement problem is under the measure of data availability. Specifically, we show that the optimal placement problem for availability is #P- complete, a measure of intractability at least as severe as NP-completeness. Given the anticipated computational difficulty of finding an exact solution, we go on to describe an effective, practical method for approximating the optimal copy placement. To obtain these results, we model the environment in which a distributed database operates by a probabilistic graph, which is a set of fully-reliable vertices representing sites, and a set of edges representing communication links, each operational with a rational probability. We prove that finding the optimal copy placement in a probabilistic graph is #P-complete by giving a sequence of reductions from #Satisfiability. We generalize this result to networks in which each site and each link has an independent, rational operational probability and to networks in which all the sites or all the links have a fixed, uniform operational probabilities.
On the Use of Windows for Accurate Analysis of Package Interconnects
Venue: Proceedings of the 3rd International Symposium on Quality Electronic Design (2002)

An accurate transient analysis of a package interconnect requires the modeling and analysis of conductor and dielectric losses, as well as other high-frequency effects of 3D structures. The skin effect and dispersion of interconnects are more accurately modeled in frequency domain. Consequently, the complete time-domain simulation of such a system is only possible using convolution techniques. Although the convolution method is well understood, the application of windowing for interconnect analysis is less so. In this paper, we present the practical considerations of window selection and its application to improve the accuracy of convolution simulators. We introduce the Tukey window and study the tradeoff between how smoothly a data can be set to zero to avoid aliasing and suppress ripples and how much information tapering will discount at the edge of the window in order to obtain meaningful results. The bandlimiting effects of the Tukey window and other well-known windows are also compared. Finally, wirebond PBGA package and PCB-connector system are analyzed using the scattering parameters obtained from simulation and measurement, respectively, to verify the validity and accuracy of the method. 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
Developing an object-oriented framework for content-based image retrieval
Authors: Kent K. T. Cheung, Horace H. S. Ip
Venue: Software&mdash;Practice Experience (2003)

Content-based image retrieval (CBIR) is a process of retrieving images from an image database by exploiting the content of the images (typically the querying of an image). CBIR avoids many problems associated with traditional ways of retrieving images by keywords. Thus, a growing interest in the area of CBIR has been established in recent years. In this paper, a novel object-oriented framework (CBIRFrame) is built for CBIR applications development. We discuss the motivations for CBIRFrame before discussing its design in detail. Two applications of CBIRFrame are also briefly discussed to show the effectiveness of applying CBIRFrame to real applications. Finally, we outline the possible uses of the design of CBIRFrame for other types of domains, such as content-based retrieval of video clips.