ppxscal/embedding_network huggingface dataset:
An Analysis of Competing Software Reliability Models
Authors: G. J. Schick
Venue: IEEE Transactions on Software Engineering (1978)

This paper examines the most widely used reliability models. The models discussed fall into two categories, the data domain and the time domain. Besides tracing the historical development of the various models their advantages and disadvantages are analyzed. This includes models based on discrete as weil as continuous probability distributions. How well a given model performs its purpose in a specific economic environment will determine the usefulness of the model. Each of the models is examined with actual data as to the applicability of the error fmding process.
Learning Selective Averaged One-Dependence Estimators for Probability Estimation
Authors: Qing Wang, Chuan-hua Zhou, Jian-kui Guo
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

Naïve Bayes is a well-known effective and efficient classification algorithm, but its probability estimation performance is poor. Averaged One-Dependence Estima- tors, simply AODE, is a recently proposed semi-naïve Bayes algorithm and demonstrates significantly high classification accuracy at a modest cost. In many data mining applications, however, accurate probability estimation is more desirable when making optimal decisions. Usually, probability estimation performance is measured by conditional log likelihood (CLL). In this paper, we first study the probability estimation perform- ance of AODE and compare it to naïve Bayes, Tree- Augumented naïve Bayes, CLLTree, C4.4 (the improved version of C4.5 for better probability estimation) and Support Vector Machines. From our experiments, we find that AODE performs significantly better than the algorithms used to compare except C4.4, and performs slightly better than C4.4 although its classification accuracy is significantly better than C4.5. We then pro- pose an efficient forward greedy feature selection algorithm for AODE and use the CLL score for attribute selection. The experimental results show that our algori- thm achieves substantially improvement over AODE and significantly outperforms C4.4. Our experiments are conducted on the basis of 36 UCI data sets that cover a wide range of domains and data characteristics and we run all the algorithms within the Weka platform.
Trusted Code Remote Execution through Trusted Computing and Virtualization
Authors: Liqiang Zhang, Lu Chen, Huanguo Zhang, Fei Yan
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

Given two machines A and B, A has to commit job codes to be executed on B and get the results back. How can A believe that the job codes are executed correctly on B and related privacy information is not revealed? We propose the attack model and the security goals during the remote execution process. To address this research problem, we propose a new method based on Trusted Computing and Virtualization. We extend trusted computing by providing property-based attestation, job keys generating and migrating securely in TPM. We extend virtualization by using TPM and MAC in hypervisor to isolate job VM. We examine the method to the security goals and it shows that this method can solve the problem effectively.
Turning Over a New Leaf
Authors: Michael Dennin, Steven Barrett
Venue: Computing in Science and Engineering (2007)

CiSE Education's new department editors present plans for the future along with a brief overview of two aspects of computation and education to whet your appetite for future columns.
Higher Order Software A Methodology for Defining Software
Authors: M. Hamilton
Venue: IEEE Transactions on Software Engineering (1976)

The key to software reliability is to design, develop, and manage software with a formalized methodology which can be used by computer scientists and applications engineers to describe and communicate interfaces between systems. These interfaces include: software to software; software to other systems; software to management; as well as discipline to discipline within the complete software development process. The formal methodology of Higher Order Software (HOS), specifically aimed toward large-scale multiprogrammed/multiprocessor systems, is dedicated to systems reliability. With six axioms as the basis, a given system and all of its interfaces is defined as if it were one complete and consistent computable system. Some of the derived theorems provide for: reconfiguration of real-time multiprogrammed processes, communication between functions, and prevention of data and timing conflicts.
Study on Government Information Resources Exchange Based on Directory Service
Authors: Xing-kai Yang, Cheng-shu Lv, Yan-zhang Wang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

In view of the process of integration of E-Government information resources across heterogeneous platforms chief departments of information sharing and information exchange, this paper proposed a method of E-Government information resources integration based on the directory service. It presents a technical framework of the directory service system which includes resource layer and directory layer and service layer and application layer. It gives the role model of the process of realizing the directory service based on UDDI technology, and discussed the technology plan and exchange model of E-Government information exchange system. It analyzes the features of the exchange patterns which are centralism exchange pattern and distribution exchange pattern and mixture pattern.
Efficient use of the query optimizer for automated physical design
Authors: Stratos Papadomanolakis, Debabrata Dash, Anastasia Ailamaki
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

State-of-the-art database design tools rely on the query optimizer for comparing between physical design alternatives. Although it provides an appropriate cost model for physical design, query optimization is a computationally expensive process. The significant time consumed by optimizer invocations poses serious performance limitations for physical design tools, causing long running times, especially for large problem instances. So far it has been impossible to remove query optimization overhead without sacrificing cost estimation precision. Inaccuracies in query cost estimation are detrimental to the quality of physical design algorithms, as they increase the chances of "missing" good designs and consequently selecting sub-optimal ones. Precision loss and the resulting reduction in solution quality is particularly undesirable and it is the reason the query optimizer is used in the first place. In this paper we eliminate the tradeoff between query cost estimation accuracy and performance. We introduce the INdex Usage Model (INUM), a cost estimation technique that returns the same values that would have been returned by the optimizer, while being three orders of magnitude faster. Integrating INUM with existing index selection algorithms dramatically improves their running times without precision compromises.
Organizing domain-specific information on the Web: An experiment on the Spanish business Web directory
Authors: Wingyan Chung, Guanpi Lai, Alfonso Bonillas, Wei Xi, Hsinchun Chen
Venue: International Journal of Human-Computer Studies (2008)

Web directories organize voluminous information into hierarchical structures, helping users to quickly locate relevant information and to support decision-making. The development of existing ontologies and Web directories either relies on expert participation that may not be available or uses automatic approaches that lack precision. As more users access the Web in their native languages, better approaches to organizing and developing non-English Web directories are needed. In this paper, we have proposed a semi-automatic framework, which consists of anchor directory boosting, meta-searching, and heuristic filtering, to construct domain-specific Web directories. Using the framework, we have built a Web directory in the Spanish business (SBiz) domain. Experimental results show that the SBiz Web directory achieved significantly better recall, F-value, efficiency, and satisfaction rating than the benchmark directory. Subjects provided favorable comments on the SBiz Web directory. This research thus contributes to developing a useful framework for organizing domain-specific information on the Web and to providing empirical findings and useful insights for end-users, system developers, and researchers of Web information seeking and knowledge management.
On the futility of blind search: An algorithmic view of “no free lunch”
Authors: Joseph C. Culberson
Venue: Evolutionary Computation (1998)

The paper is in three parts. First, we use simple adversary arguments to redevelop and explore some of the no-free-lunch (NFL) theorems and perhaps extend them a little. Second, we clarify the relationship of NFL theorems to algorithm theory and complexity classes such as NP. We claim that NFL is weaker in the sense that the constraints implied by the conjectures of traditional algorithm theory on what an evolutionary algorithm may be expected to accomplish are far more severe than those implied by NFL. Third, we take a brief look at how natural evolution relates to computation and optimization. We suggest that the evolution of complex systems exhibiting high degrees of orderliness is not equivalent in difficulty to optimizing hard (in the complexity sense) problems, and that the optimism in genetic algorithms (GAs) as universal optimizers is not justified by natural evolution. This is an informal tutorial paper---most of the information presented is not formally proven, and is either “common knowledge” or formally proven elsewhere. Some of the claims are intuitions based on experience with algorithms, and in a more formal setting should be classified as conjectures.
A Language Extension for Controlling Access to Shared Data
Authors: A. K. Jones
Venue: IEEE Transactions on Software Engineering (1976)

Controlled sharing of information is needed for many applications. Access-control mechanisms exist in operating systems to provide such controlled sharing. However, programming languages currently do not support such a facility. This paper illustrates how an access-control facility could be incorporated in a programming language. The mechanism described is suitable for incorporation in object-oriented languages that permit the definition of abstract data types, and is defmed in a way that enables compile-time checking of access control.
An On-Line BIST Technique for Stuck-Open Fault Detection in CMOS Circuits
Authors: Elham K. Moghaddam, Shaahin Hessabi
Venue: Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (2007)

This paper presents a simulation-based study of the stuck-open fault testing in CMOS logic circuits. A novel built-in self-test (BIST) technique is presented for detecting stuck-open faults in these logic families. This scheme does not need test-pattern generation, and thus can be used for robust on-line testing. Simulation results for area, delay, and power overheads are presented.
Improving causality logging in mobile computing networks
Authors: Carlos Baquero, Francisco Moura
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (1998)

Vector clocks, or their compressed representations, have played a central role in the detection of causal dependencies between events in a distributed system. When adapting these techniques to a mobile network, bounding the vector clock size to the number of mobile nodes does not provide a satisfactory approach. This paper builds on previous techniques for efficient causality logging in mobile networks and presents a lighter logging mechanism. The technique is based on a particular partial order that is generated by the interleaving of events on mobile hosts that are mediated by the same support station.
Arithmetic Algorithms in a Negative Base
Authors: P. V. Sankar
Venue: IEEE Transactions on Computers (1973)

Algorithms are described for the basic arithmetic operations and square rooting in a negative base. A new operation called polarization that reverses the sign of a number facilitates subtraction, using addition. Some special features of the negative-base arithmetic are also mentioned.
Value tensions in design: the value sensitive design, development, and appropriation of a corporation's groupware system
Authors: Jessica K. Miller, Batya Friedman, Gavin Jancke
Venue: Proceedings of the 2007 international ACM conference on Supporting group work (2007)

We report on the value sensitive design, development, and appropriation of a groupware system to support software engineering knowledge sharing. Usage data (5,965 visitors) and semi-structured interviews (18 individuals) suggest the methods employed were successful in addressing value tensions, particularly with respect to privacy, awareness, and reputation. Key contributions include: (1) "proof-of-concept" that established Value Sensitive Design principles and methods can be used to good effect for the design of groupware in an industry setting, (2) a new design method for addressing value tensions, Value Dams and Flows, and (3) demonstration of the co-evolution of technology and organizational policy.
DFprot
Authors: José Ignacio Garzón, Julio Kovacs, Ruben Abagyan, Pablo Chacón
Venue: Bioinformatics (2007)

Summary: DFprot is a web-based server for predicting main-chain deformability from a single protein conformation. The server automatically performs a normal-mode analysis (NMA) of the uploaded structure and calculates its capability to deform at each of its residues. Non-specialists can easily and rapidly obtain a quantitative first approximation of the flexibility of their structures with a simple and efficient interface. Availability: http://sbg.cib.csic.es/Software/DFprot Contact: pablo@cib.csic.es
Design of an Early Minicomputer
Authors: Herbert Freeman
Venue: IEEE Annals of the History of Computing (2007)

This article describes the design of an early 1950s attempt to build a relatively low-cost computer, using a mechanical desktop calculator to perform the arithmetic operations. The resulting computer--one of the earliest attempts at building a "minicomputer"--could perform stored-program addition, subtraction, multiplication, and division, as well as carry out a simple decision operation based on a number comparison. To solve a problem, the operator would type in a program sequence based on the use of nine basic instructions. Total memory capacity was 400 words.
The Rio symposium
Authors: Robert S. McLean
Venue: ACM SIGCUE Outlook (1973)

The Rio Symposium on Computer Education for Developing Countries, held in Rio de Janeiro early in August, 1972, drew 280 computing specialists. They came from 40 countries at virtually all stages of economic development. The majority of the attendance was from the host country, Brazil, with 155 members. The second largest group, and the most vocal in terms of presentations and comments, was from the USA with 29 members. All of the other countries had fewer than ten persons present.
An Improved Algorithm of Contour Initialization in Active Contour Model
Authors: Fan Yanbin, Liu Caixia, Zhang Bingsen, Pan Zhenkuan
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

An improved algorithm of Contour Initialization in GVF Snake Model is proposed in this paper based on detailed analysis of the problems in current active contour models: poor performance under interference, large computational cost, inability to converge to complex or rough contours and difficulty for setting initial contour, etc. Our method efficiently solved the problems in complex or rough contours initialization by connecting the initial points of different resolutions obtained by multi-scale edge detection methods based on wavelet transform and suitably controlling the number of GVF force field iterations. Experiments show that the initial contour can be accurately set close to the objective contour and successfully extract the objective contours with interferential edges and points. The new contour initialization algorithm has further reduced computational cost, improved the anti-jamming ability and extended the application range of GVF Snake model.
Analysis and simulation of a model of multiprocessor networks
Authors: Yelena Rykalova, Lev B. Levitin, Richard Brower
Venue: Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology (2007)

A multiprocessor networks modeled as a ring and as a 2- dimensional toroidal square lattice of nodes are considered. Each node has 2 or, respectively, 4 output buffers of infinite capacity and a local processor that generates messages with probability λ per clock cycle per output port. Once a buffer is not empty, the corresponding output port sends out exactly one message every clock cycle. We derive explicit analytical expressions for the queue length distribution, the average number of messages in buffers, and the latency (average delay). It is shown that the network experiences a phase transition from equilibrium to the saturation regime, and the critical exponent is equal to 1. The critical network load is found and shown to be inversely proportional to the distance between the source and destination. Empirical results obtained by extensive simulations demonstrate an excellent agreement with theoretical predictions and validate the assumption of independent queues.
"Talking tests": a Preliminary Experimental Study on Fit User Acceptance Tests
Authors: Marco Torchiano, Filippo Ricca, Massimiliano Di Penta
Venue: Proceedings of the First International Symposium on Empirical Software Engineering and Measurement (2007)

This short paper reports a pilot experiment conducted with master students, in which we investigated whether Fit test cases were helpful to clarify change requirements in a maintenance task.
CCD Charge-Coupled Device Memories: A Perspective
Authors: D. P. Bhandarkar
Venue: Computer (1979)

CCD memories can fill the gap between RAMs and disks. If cost-effective, they will tend to be used in high-end, high-performance computers.
Optimization Framework for Distributed Clustering Scheme in Wireless Sensor Networks
Authors: Yongxuan Lai, Xiaobo Fan, Hong Chen, Tingting Xie
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

Recently there have been growing interests in the applications of wireless sensor networks. Innovative techniques that improve energy efficiency to prolong the network lifetime are highly required. Clustering is an effective topology control approach and data gathering protocol in wireless sensor networks. In this paper, we propose a novel optimization framework called MICA (MICa Adjustments) for clustering scheme in wireless sensor networks. MICA takes the cluster as a whole, and dynamically adjusts the clusters according to the real-time workload of the local clusters to balance energy consumption among clusters. The adjustments can also deal with link failures. Simulation results show that MICA can be easily embedded into existing clustering schemes to balance the energy consumptions among the clusters, and to prolong the lifetime of wireless sensor networks.
Relevance: A review of the literature and a framework for thinking on the notion in information science. Part III: Behavior and effects of relevance
Authors: Tefko Saracevic
Venue: Journal of the American Society for Information Science and Technology (2007)

All is flux. &mdash;Plato on Knowledge in the Theaetetus (about 369 BC) Relevance is a, if not even the, key notion in information science in general and information retrieval in particular. This two-part critical review traces and synthesizes the scholarship on relevance over the past 30 years or so and provides an updated framework within which the still widely dissonant ideas and works about relevance might be interpreted and related. It is a continuation and update of a similar review that appeared in 1975 under the same title, considered here as being Part I. The present review is organized in two parts: Part II addresses the questions related to nature and manifestations of relevance, and Part III addresses questions related to relevance behavior and effects. In Part II, the nature of relevance is discussed in terms of meaning ascribed to relevance, theories used or proposed, and models that have been developed. The manifestations of relevance are classified as to several kinds of relevance that form an interdependent system of relevancies. In Part III, relevance behavior and effects are synthesized using experimental and observational works that incorporated data. In both parts, each section concludes with a summary that in effect provides an interpretation and synthesis of contemporary thinking on the topic treated or suggests hypotheses for future research. Analyses of some of the major trends that shape relevance work are offered in conclusions. &copy; 2007 Wiley Periodicals, Inc.
A study on the correlation between electrochemical corrosion and chemical mechanical polishing performance of W and Ti film
Authors: Yong-Jin Seo
Venue: Microelectronic Engineering (2007)

In this paper, in order to investigate the electrochemical polishing behavior of the tungsten (W) and titanium (Ti) film, the chemical mechanical polishing (CMP) performances of W and Ti film according to the oxidizer contents were studied through electrochemical corrosion analysis. The alumina (Al"2O"3)-based tungsten slurry with H"2O"2 oxidizer was used for CMP test. As an experimental result, for the case of 5vol% oxidizer added, the removal rates were improved and a good polishing selectivity of 1.4 : 1 was obtained. It means that the oxidizer with the highest removal rate (RR) has a high dissolution rate due to the predominant electrochemical corrosion effects. Therefore we conclude that the W and Ti-CMP characteristics are strongly dependent on the amounts of H"2O"2 oxidizer additive.
On the cost of multilingualism in database systems
Authors: A. Kumaran, Jayant R. Haritsa
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

Database engines are well-designed for storing and processing text data based on Latin scripts. But in today's global village, databases should ideally support multilingual text data equally efficiently. While current database systems do support management of multilingual data, we are not aware of any prior studies that compare and quantify their performance in this regard. In this paper, we first compare the multilingual functionality provided by a suite of popular database systems. We find that while the systems support most SQL-defined multilingual functionality, some needed features are not yet implemented. We then profile their performance in handling text data in IS0:8859, the standard database character set, and in Unicode, the multilingual character set. Our experimental results indicate significant performance degradation while handling multilingual data in these database systems. Worse, we find that the query optimizer's accuracy is different between standard and multilingual data types. As a first step towards alleviating the above problems, we propose Cuniform, a compressed format that is trivially convertible to Unicode. Our initial experimental results with Cuniform indicate that it largely eliminates the performance degradation for multilingual scripts with small repertoires. Further, the Cuniform format can elegantly support extensions to SQL for multilexical text processing.