ppxscal/embedding_network huggingface dataset:
A Distributed Control Algorithm for Reliably and Consistently Updating Replicated Databases
Authors: G. Gardarin
Venue: IEEE Transactions on Computers (1980)

This paper presents a deadlock-free and distributed control algorithm for robustly and consistently updating replicated databases. This algorithm is based on local locking and time stamps on lock tables which permit detection of conflicts among transactions executed at different sites. Messages are exchanged in the network whenever a transaction commitment occurs, that is, at the end of every consistent step of local processing. Conflicts among remote transactions are resolved by a roll back procedure. Local restart is based on a journal of locks which provides backup facilities. Performance in terms of the number of messages and volume of control messages of the proposed algorithm is compared with that of the voting and centralized locking algorithms. These results reveal that the proposed distributed control algorithm performs, in most cases, comparably to the centralized locking algorithm and better than the voting algorithm.
An objective comparison of languages for teaching introductory programming
Authors: Linda Mannila, Michael de Raadt
Venue: Proceedings of the 6th Baltic Sea conference on Computing education research: Koli Calling 2006 (2006)

The question of which language to use in introductory programming has been cause for protracted debate, often based on emotive opinions. Several studies on the benefits of individual languages or comparisons between two languages have been conducted, but there is still a lack of objective data used to inform these comparisons. This paper presents a list of criteria based on design decisions used by prominent teaching-language creators. The criteria, once justified, are then used to compare eleven languages which are currently used in introductory programming courses. Recommendations are made on how these criteria can be used or adapted for different situations.
Secure Multipath Routing Scheme for Mobile Ad Hoc Network
Authors: Binod Vaidya, JaeYoung Pyun, JongAn Park, SeungJo Han
Venue: Proceedings of the Third IEEE International Symposium on Dependable, Autonomic and Secure Computing (2007)

Mobile ad hoc networks (MANETs) are collections of autonomous mobile nodes with links that are made or broken in an arbitrary way. Due to frequent node and link failures, multipath MANET is preferred than single-path MANET in many applications. Multipath routing schemes are used for achieving various goals such as robustness, reliability, and load balancing. However, before they can be successfully deployed several security threats must be addressed. Due to lack of fixed infrastructure, security in ad-hoc routing is challenging task, especially in multipath MANET. In this paper, we propose a robust multipath routing scheme for MANET and also security mechanism for such a routing scheme. We discuss security analysis for our scheme. And we conduct simulation to evaluate the cost of the proposed secure multipath routing scheme and present some preliminary results.
Planning and Executing IT Strategy
Authors: Rupert A. Hayles Jr.
Venue: IT Professional (2007)

Dividing IT functions into its many operational components and deciphering where the components fit in is fundamental to the ultimate goal of business-to-technology alignment. Such alignment can lead to significant business improvements.
General store placement for response time minimization in parallel disks
Authors: Akshat Verma, Ashok Anand
Venue: Journal of Parallel and Distributed Computing (2007)

We investigate the placement of N enterprise data-stores (e.g., database tables, application data) across an array of disks with the aim of minimizing the response time averaged over all served requests, while balancing the load evenly across all the disks in the parallel disk array. Incorporating the non-FCFS serving discipline and non-work-conserving nature of disk drives in formulation of the placement problem is difficult and current placement strategies do not take them into account. We present a novel formulation of the placement problem to incorporate these crucial features and identify the runlength of requests accessing a store as the most important criterion for placing the stores. We use these insights to design a fast (running time of NlogN) placement algorithm that is optimal under the assumption that transfer times are small. Further, we develop polynomial-time extensions of the algorithm that minimize response time even if transfer times are large, while balancing the loads across the disks. Comprehensive experimental studies establish the efficacy of the proposed algorithm under a wide variety of workloads with the proposed algorithm reducing the response time for real storage traces by more than a factor of 2 under heterogeneous workload scenarios.
Condensed Nearest Neighbor Data Domain Description
Authors: Fabrizio Angiulli
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2007)

A simple yet effective unsupervised classification rule to discriminate between normal and abnormal data is based on accepting test objects whose nearest neighbors distances in a reference data set, assumed to model normal behavior, lie within a certain threshold. This work investigates the effect of using a subset of the original data set as the reference set of the classifier. With this aim, the concept of a reference consistent subset is introduced and it is shown that finding the minimum cardinality reference consistent subset is intractable. Then, the CNNDD algorithm is described, which computes a reference consistent subset with only two reference set passes. Experimental results revealed the advantages of condensing the data set and confirmed the effectiveness of the proposed approach. A thorough comparison with related methods was accomplished, pointing out the strengths and weaknesses of one-class nearest-neighbor-based training set consistent condensation.
Routing complexity of faulty networks
Authors: Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder
Venue: Random Structures Algorithms (2008)

One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This article investigates how big the failure probability can be, before the capability to efficiently find a path in the network is lost. Our main results show tight upper and lower bounds for the failure probability, which permits routing both for the hypercube and for the d-dimensional mesh. We use tools from percolation theory to show that in the d-dimensional mesh, once a giant component appears&mdash;efficient routing is possible. A different behavior is observed when the hypercube is considered. In the hypercube there is a range of failure probabilities in which short paths exist with high probability, yet finding them must involve querying essentially the entire network. Thus the routing complexity of the hypercube shows an asymptotic phase transition. The critical probability with respect to routing complexity lies in a different location than that of the critical probability with respect to connectivity. Finally we show that an oracle access to links (as opposed to local routing) may reduce significantly the complexity of the routing problem. We demonstrate this fact by providing tight upper and lower bounds for the complexity of routing in the random graph Gn,p. &copy; 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2008
Usage of eigenvector methods in implementation of automated diagnostic systems for ECG beats
Authors: Elif Derya Übeyli
Venue: Digital Signal Processing (2008)

In this paper, implementation of automated diagnostic systems with diverse and composite features for electrocardiogram (ECG) beats was presented and their accuracies were determined. In practical applications of pattern recognition, there are often diverse features extracted from raw data which needs recognizing. Methods of combining multiple classifiers with diverse features are viewed as a general problem in various application areas of pattern recognition. Because of the importance of making the right decision, better classification procedures were searched for ECG beats. Four types of ECG beats (normal beat, congestive heart failure beat, ventricular tachyarrhythmia beat, atrial fibrillation beat) obtained from the Physiobank database were analyzed. The classification accuracies of six different classifiers, namely multilayer perceptron neural network (MLPNN), combined neural network (CNN), mixture of experts (ME), modified mixture of experts (MME), probabilistic neural network (PNN), and support vector machine (SVM), which were trained on diverse or composite features were compared. Decision making was performed in two stages: feature extraction by eigenvector methods and classification using the classifiers trained on the extracted features. The research demonstrated that the SVM trained on composite feature and the MME trained on diverse features achieved accuracy rates which were higher than that of the other automated diagnostic systems.
On-Chip Verification of NoCs Using Assertion Processors
Authors: Mohammad Reza Kakoee, M. H. Neishaburi, Masoud Daneshtalab, Saeed Safari, Zainalabedin Navabi
Venue: Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (2007)

NoC verification has become an increasingly difficult task due to the growing complexity of these systems. In this paper, we propose a methodology based on assertions for on-chip verification of NoCs. We have a Local Assertion Processor (LAP) in each core to manage the outputs of assertions inside it. To route assertions' outputs toward this processor, we offer a boundary scan chain mechanism. Moreover, after detecting error, each LAP dispatches a packet called error packet to a Global Assertion Processor (GAP) which receives error packets from all cores and performs necessary actions regarding to errors and their severities. Finally, in order to evaluate our method, we apply it on an NoC structure and show the experimental results.
Curing regular expressions matching algorithms from insomnia, amnesia, and acalculia
Authors: Sailesh Kumar, Balakrishnan Chandrasekaran, Jonathan Turner, George Varghese
Venue: Proceedings of the 3rd ACM/IEEE Symposium on Architecture for networking and communications systems (2007)

The importance of network security has grown tremendously and a collection of devices have been introduced, which can improve the security of a network. Network intrusion detection systems (NIDS) are among the most widely deployed such system; popular NIDS use a collection of signatures of known security threats and viruses, which are used to scan each packet's payload. Today, signatures are often specified as regular expressions; thus the core of the NIDS comprises of a regular expressions parser; such parsers are traditionally implemented as finite automata. Deterministic Finite Automata (DFA) are fast, therefore they are often desirable at high network link rates. DFA for the signatures, which are used in the current security devices, however require prohibitive amounts of memory, which limits their practical use. In this paper, we argue that the traditional DFA based NIDS has three main limitations: first they fail to exploit the fact that normal data streams rarely match any virus signature; second, DFAs are extremely inefficient in following multiple partially matching signatures and explodes in size, and third, finite automaton are incapable of efficiently keeping track of counts. We propose mechanisms to solve each of these drawbacks and demonstrate that our solutions can implement a NIDS much more securely and economically, and at the same time substantially improve the packet throughput.
A Formal Framework for Description of Semantic Web Services
Authors: Jiang Zhixiong, Qian Leqiu, Pen Xin
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

Web services may produce the effect change of the world. To describe web services faithfully, not only static information but also dynamic information such as state change should be represented. In this paper we propose service dynamic description logic (SDDL) to represent and model the dynamic aspect of web services. Three basic reasoning services are introduced in our formal framework to support the discovery and composition of web services
Energy Aware Proactive MANET Routing with Prediction on Energy Consumption
Authors: Zhihao Guo, Behnam Malakooti
Venue: Proceedings of the International Conference on Wireless Algorithms,Systems and Applications (2007)

Energy-aware routing in mobile wireless ad hoc networks has been investigated extensively in the framework of reactive routing. In this paper we present an energy preserving mechanism suitable to be integrated with a proactive MANET routing scheme. We use a compositive energy cost, which considers both transmission power consumption and residual energy of the nodes, as the routing metric. Our energy cost calculation is based on prediction of node energy consumption using ARIMA model. The formulation of our energy cost is tailored to heterogeneous MANET in terms of power consumptions. We extended OLSR with our energy preserving mechanism. Our power-aware version of OLSR is proven by simulation to be able to prolong network lifetime significantly in both homogeneous and heterogeneous scenarios in terms of power consumptions.
A Mixed Fast Particle Filter
Authors: Fasheng Wang, Qingjie Zhao, Hongbin Deng
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

Particle filtering algorithm has been widely used in solving nonlinear/non-Gaussian filtering problems. In this paper, a new particle filter is proposed, which is based on the unscented Kalman filter (UKF) and the extended Kalman filter (EKF), and takes a divide-and-conquer sampling strategy. It first uses a mixed Kalman filter, which combines UKF and EKF, as proposal distribution to generate part of the particles, and then uses the transition prior for another part. The experiment results show that this new particle filter can reduce time cost in addition to giving higher accuracy compared to other particle filters.
The Code Delusion
Authors: Stan Kelly-Bootle
Venue: Queue (2007)

No, I&rsquo;m not cashing in on that titular domino effect that exploits best sellers. The temptations are great, given the rich rewards from a gullible readership, but offset, in the minds of decent writers, by the shame of literary hitchhiking. Thus, guides to the Louvre become The Da Vinci Code Walkthrough for Dummies, milching, as it were, several hot cows on one cover. Similarly, conventional books of recipes are boosted with titles such as The Da Vinci Cookbook&mdash;Opus Dei Eating for the Faithful. Dan Brown&rsquo;s pseudofiction sales stats continue to amaze, cleverly stimulated by accusations of plagiarism and subsequent litigation (Dan found not guilty). One strange side effect of his book&rsquo;s popularity and ubiquity is to hear the title shortened in conversations such as this overheard at a Microsoft cafeteria:
Security-by-contract for web services
Authors: Nicola Dragoni, Fabio Massacci
Venue: Proceedings of the 2007 ACM workshop on Secure web services (2007)

The classical approach to access control of Web Services is to present a number of credentials for the access to a service and possibly negotiate their disclosure using a suitable negotiation protocol and a policy to protect them. In practice the "Web Service" is not really a single service but rather a set of services that can be accessed only through a suitable conversation. Further, in real-life we are often willing to trade the disclosure of personal attributes (frequent flyer number, car plate or AAA membership etc.) in change of additional services and only in a particular order. In this paper we propose a novel negotiation framework where services, needed credentials, and behavioral constraints on the disclosure of privileges are bundled together and that clients and servers have a hierarchy of preferences among the different bundles. While the protocol supports arbitrary negotiation strategies we sketch two concrete strategies (one for the clientand one for the service provider) that make it possible to successfully complete a negotiation when dealing with a co-operative partner and to resist attacks by malicious agentto "vacuum-clean" the preference policy of the honest participant.
Decompose Document Image Using Integer Linear Programming
Authors: D. Gao, Y. Wang, H. Hindi, M. Do
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01 (2007)

Document decomposition is a basic but crucial step for many document related applications. This paper proposes a novel approach to decompose document images into zones. It first generates overlapping zone hypotheses based on generic visual features. Then, each candidate zone is eval- uated quantitatively by a learned generative zone model. We formulate the zone inference problem into a constrained optimization problem, so as to select an optimal set of non- overlapping zones that cover a given document image. The experimental results demonstrate that the proposed method is very robust to document structure variation and noise.
Scope Management of Non-Functional Requirements
Authors: M. Kassab, M. Daneva, O. Ormandjieva
Venue: Proceedings of the 33rd EUROMICRO Conference on Software Engineering and Advanced Applications (2007)

In order to meet commitments in software projects, a realistic assessment must be made of project scope. Such an assessment relies on the availability of knowledge on the user-defined project requirements and their effort estimates and priorities, as well as their risk. This knowledge enables analysts, managers and software engineers to identify the most significant requirements from the list of requirements initially defined by the user. In practice, this scope assessment is applied to the Functional Requirements (FRs) provided by users who are unaware of, or ignore, the Non-Functional Requirements (NFRs). This paper presents ongoing research which aims at managing NFRs during the software development process. Establishing the relative priority of each NFR, and obtaining a rough estimate of the effort and risk associated with it, is integral to the software development process and to resource management. Our work extends the taxonomy of the NFR framework by integrating the concept of the "hardgoal". A functional size measure of NFRs is applied to facilitate the effort estimation process. The functional size measurement method we have chosen is COSMICFFP, which is theoretically sound and the de facto standard in the software industry.
On the Equivalence Between One-Dimensional Discrete Walsh-Hadamard and Multidimensional Discrete Fourier Transforms
Authors: H. O. Kunz
Venue: IEEE Transactions on Computers (1979)

It is shown that the discrete Walsh-Hadamard transform applied to 2none-dimensional data is equivalent to the discrete n-dimensional Fourier transform applied to the same 2ndata arranged on the binary n-cube. A similar relationship is valid for the generalized discrete Walsh transform suggested by Andrews and Caspari. This relationship explains the theorem concerning the shif
Stuctured Programming at McAuto
Authors: C. E. Holmes
Venue: Computer (1975)

The history of structured programming at McDonnell Douglas Automation could be divided into two ages or eras: BC and AD. BC represents Before Clarity and AD represents After Discernment. 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
Learning Microarray Gene Expression Data by Hybrid Discriminant Analysis
Authors: Yijuan Lu, Qi Tian, Maribel Sanchez, Jennifer Neary, Feng Liu, Yufeng Wang
Venue: IEEE MultiMedia (2007)

A proposed hybrid dimension reduction scheme—hybrid discriminant analysis—merges principal component and linear discriminant analysis in a unified framework for studying gene expression data. This flexible technique also reduces computational complexity. We conducted a set of 80 microarray experiments to test this technique as well as a boosted hybrid analysis technique.
Bargaining strategy formulation with CRM for an e-commerce agent
Authors: C.-C. Henry Chan, Chi-Bin Cheng, Chih-Hsiung Hsu
Venue: Electronic Commerce Research and Applications (2007)

The growth of electronic commerce has created the need of automated bargaining agents for improving the efficiency of online transactions. From the perspective of customer relationship marketing (CRM), establishing and maintaining the best possible relationship with valuable customers is a good way to survive in the competitive global market. In order to retain valuable customers, high share customers ought to be treated differently from the low share customers in the bargaining process. In our research, we formulate strategies for a bargaining agent based on the CRM principle. Bargaining tactics are expressed as fuzzy rules that mimic a human bargainer's knowledge and judgment in making decisions. Actions of the bargaining agent are determined by using approximate reasoning from the set of fuzzy rules. Our bargaining agent and three other bargaining agents found in the literature are employed in an experimental online store. Experimental results indicate that our bargaining agent is more efficient and creates greater customer satisfaction and customer loyalty than do the bargaining agents from the literature.
GloMo, July 1998: workshop report
Authors: Ram Ramanathan
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (1998)

The Global Mobile Information Systems (GloMo) is a a multi-organization program funded by the U.S Defense Advanced Research Projects Agency (DARPA). The most recent GloMo Principal Investigators (PI) meeting was held in Washington D.C between July 28--30, 1998. As part of this meeting, a number of technologies developed within this program were demonstrated to a wide variety of audiences. In this article, we present a brief overview of the GloMo program and report on the July PI meeting, focusing on the demonstrations, and the technologies they represent.
Live data center migration across WANs: a robust cooperative context aware approach
Authors: K. K. Ramakrishnan, Prashant Shenoy, Jacobus Van der Merwe
Venue: Proceedings of the 2007 SIGCOMM workshop on Internet network management (2007)

A significant concern for Internet-based service providers is the continued operation and availability of services in the face of outages, whether planned or unplanned. In this paper we advocate a cooperative, context-aware approach to data center migration across WANs to deal with outages in a non-disruptive manner. We specifically seek to achieve high availability of data center services in the face of both planned and unanticipated outages of data center facilities. We make use of server virtualization technologies to enable the replication and migration of server functions. We propose new network functions to enable server migration and replication across wide area networks (e.g., the Internet), and finally show the utility of intelligent and dynamic storage replication technology to ensure applications have access to data in the face of outages with very tight recovery point objectives.