ppxscal/embedding_network huggingface dataset:
B74-8 Design of Man-Computer Dialogues
Authors: R. Elschlager
Venue: IEEE Transactions on Computers (1974)

It might be said that this book points in the direction of our society's current renewed emphasis on the human. In order to make dialogues that people will use, the systems designer should become aware of the user, who is not a machine but a human being, and become aware, too, of the user's particular needs, sensitivities, and psychological reactions to conversing with a computer. For as Martin states in his introduction, "the future growth of the computer industry and the acceptance of computer methods will depend largely on the successful establishment of effective man-machine communications." 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
On conditional diagnosability of the folded hypercubes
Authors: Qiang Zhu, San-Yang Liu, Min Xu
Venue: Information Sciences: an International Journal (2008)

The n-dimensional folded hypercube FQ"n, a variation of the hypercube proposed by Ahmed et al. [A. El-Amawy, S. Latifi, Properties and performance of folded hypercubes, IEEE Transactions on Parallel and Distributed Systems 2(3) (1991) 31-42], is an (n+1)-regular (n+1)-connected graph. Conditional diagnosability, a new measure of diagnosability introduced by Lai et al. [Pao-Lien Lai, Jimmy J.M. Tan, Chien-Ping Chuang, Lih-Hsing Hsu, Conditional diagnosability measures for large multiprocessor systems, IEEE Transactions on Computers 54(2) (2005) 165-175] can better measure the diagnosability of regular interconnection networks. This paper determines that under PMC-model the conditional diagnosability of FQ"n (t"c(FQ"n)) is 4n-3 when n=5 or n>=8; t"c(FQ"3)=3, t"c(FQ"4)=7.
An efficient algorithm for time separation of events in concurrent systems
Authors: Peggy B. McGee, Steven M. Nowick
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

The time separation of events (TSE) problem is that of finding the maximum and minimum separation between the times of occurrence of two events in a concurrent system. It has applications in the performance analysis, optimization and verification of concurrent digital systems. This paper introduces an efficient polynomial-time algorithm to give exact bounds on TSE's for choice-free concurrent systems, whose operational semantics obey the max-causality rule. A choice-free concurrent system is modeled as a strongly-connected marked graph, where delays on operations are modeled as bounded intervals with unspecified distributions. While previous approaches handle acyclic systems only, or else require graph unfolding until a steady-state behavior is reached, the proposed approach directly identifies and evaluates the asymptotic steady-state behavior of a cyclic system via a graph-theoretical approach. As a result, the method has significantly lower computational complexity than previously-proposed solutions. A prototype CAD tool has been developed to demonstrate the feasibility and efficacy of our method. A set of experiments have been performed on the tool as well as two existing tools, with noticeable improvement on runtime and accuracy for several examples.
Replica Placement and Location using Distributed Hash Tables
Authors: Daniel Bauer, Paul Hurley, Marcel Waldvogel
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

Interest in distributed storage is fueled by demand for reliability and resilience combined with decreasing hardware costs. Peer-to-peer storage networks based on distributed hash tables are attractive for their efficient use of resources and resulting performance. The placement and subsequent efficient location of replicas in such systems remain open problems, especially (1) the requirement to update replicated content, (2) working in the absence of global information, and (3) determination of the locations in a dynamic system without introducing single points of failure. We present and evaluate a novel and versatile technique, replica enumeration, which allows for controlled replication and replica access. The possibility of enumerating and addressing individual replicas allows dynamic updates as well as superior performance without burdening the network with state information, yet taking advantage of locality information when available. We simulate, analyze, and prove properties of the system, and discuss some applications.
Privacy-preserving indexing of documents on the network
Authors: Mayank Bawa, Roberto J. Bayardo,  Jr., Rakesh Agrawal
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

We address the problem of providing privacy-preserving search over distributed access-controlled content. Indexed documents can be easily reconstructed from conventional (inverted) indexes used in search. The need to avoid breaches of access-control through the index requires the index hosting site to be fully secured and trusted by by all participating content providers. This level of trust is impractical in the increasingly common case where multiple competing organizations or individuals wish to selectively share content. We propose a solution that eliminates the need of such a trusted authority. The solution builds a centralized privacy-preserving index in conjunction with a distributed access-control enforcing search protocol. The new index provides strong and quantifiable privacy guarantees that hold even if the entire index is made public. Experiments on a real-life dataset validate performance of the scheme. The appeal of our solution is two-fold: (a) Content providers maintain complete control in defining access groups and ensuring its compliance, and (b) System implementors retain tunable knobs to balance privacy and efficiency concerns for their particular domains.
A Comprehensive Framework for Enhancing Security in InfiniBand Architecture
Authors: Manhee Lee, Eun Jung Kim
Venue: IEEE Transactions on Parallel and Distributed Systems (2007)

The InfiniBand™ Architecture (IBA) is a promising communication standard for building clusters and system area networks. However, the IBA specification has left out security aspects, resulting in potential security vulnerabilities which could be exploited with moderate effort. In this paper, we view these vulnerabilities from three classical security aspects: confidentiality, authentication, and availability and investigate the following security issues. First, as groundwork for secure services in IBA, we present partition-level and queue pair-level key management schemes, both of which can be easily integrated into IBA. Second, for confidentiality and authentication, we present a method to incorporate a scalable encryption and authentication algorithm into IBA with little performance overhead. Third, for better availability, we propose a stateful ingress filtering mechanism to block denial of service (DoS) attacks. Finally, to further improve the availability, we provide a scalable packet marking method tracing back DoS attacks. Simulation results of an IBA network show that the security performance overhead due to encryption/authentication on network latency ranges from 0.7% to 12.4%. Since the stateful ingress filtering is enabled only when a DoS attack is active, there is no performance overhead in a normal situation.
An information-theoretic model for adaptive side-channel attacks
Authors: Boris Köpf, David Basin
Venue: Proceedings of the 14th ACM conference on Computer and communications security (2007)

We present a model of adaptive side-channel attacks which we combine with information-theoretic metrics to quantify the information revealed to an attacker. This allows us to express an attacker's remaining uncertainty about a secret as a function of the number of side-channel measurements made. We present algorithms and approximation techniques for computing this measure. We also give examples of how they can be used to analyze the resistance of hardware implementations of cryptographic functions to both timing and power attacks.
Offline execution in workflow-enabled Web applications
Authors: Edgar Goncalves, Antonio Menezes Leitao
Venue: Proceedings of the 6th International Conference on Quality of Information and Communications Technology (2007)

Today, more and more organizations prefer Web applications to perform their business processes, because these allow collaborative work between several users. However, many tasks must be done while being offline. This goes against today's Web architecture, where a remote server must be contacted for each performed operation. We propose a methodology to develop functionalities that can be executed offline within workflow-enabled Web applications. With these functionalities a user will be able to retrieve his pending work from the server, go offline, perform his activities in the browser and, when he gets back online, synchronize his work with the server, continuing the workflow. The development of such functionalities will take advantage of the organization-specific workflow definitions to manage the application state.
Top-k query evaluation with probabilistic guarantees
Authors: Martin Theobald, Gerhard Weikum, Ralf Schenkel
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

Top-k queries based on ranking elements of multidimensional datasets are a fundamental building block for many kinds of information discovery. The best known general-purpose algorithm for evaluating top-k queries is Fagin's threshold algorithm (TA). Since the user's goal behind top-k queries is to identify one or a few relevant and novel data items, it is intriguing to use approximate variants of TA to reduce run-time costs. This paper introduces a family of approximate top-k algorithms based on probabilistic arguments. When scanning index lists of the underlying multidimensional data space in descending order of local scores, various forms of convolution and derived bounds are employed to predict when it is safe, with high probability, to drop candidate items and to prune the index scans. The precision and the efficiency of the developed methods are experimentally evaluated based on a large Web corpus and a structured data collection.
Kernel-Based Cellular Automata for Urban Simulation
Authors: Xiaoping Liu, Xia Li, Bing Ai, Shaokun Wu, Tao Liu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

Cellular automata (CA) can be used to simulate complex urban systems. Calibration of CA is essential for producing realistic urban patterns. A common calibration procedure is based on linear regression methods, such as multicriteria evaluation. This paper proposes a new method to acquire nonlinear transition rules of CA by using the techniques of kernel-based learning machines. The kernel-based approach transforms complex nonlinear problems to simple linear problems through the mapping on an implicit high-dimensional feature space for extracting transition rules. This method has been applied to the simulation of urban expansion in the fast growing city, Guangzhou. Comparisons indicate that more reliable simulation results can be generated by using this kernel-based method.
Robust defocus blur identification in the context of blind image quality assessment
Authors: Izak van Zyl Marais, Willem Herman Steyn
Venue: Image Communication (2007)

A defocus blur metric for use in blind image quality assessment is proposed. Blind image deconvolution methods are used to determine the metric. Existing direct deconvolution methods based on the cepstrum, bicepstrum and on a spectral subtraction technique are compared across 210 images. A variation of the spectral subtraction method, based on a power spectrum surface of revolution, is proposed and is found to compare favourably with existing direct deconvolution methods for defocus blur identification. The method is found to be especially useful when distinguishing between in-focus and out-of-focus images.
RAM Grid Middleware for Autonomic Cooperative Caching
Authors: Rui Chu, Jiancong Xie, Nong Xiao, Xicheng Lu
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

As an innovative grid computing technique for sharing the distributed memory resources in a widearea network, RAM Grid exploits the free nodes to provide remote memory for others. The data intensive applications with massive random disk IO, such as the web server or database systems, have potential benefits from RAM Grid. We analyzed the trace collected from real servers, and proposed the key issues and solution of the caching RAM Grid system for such applications, to reduce the IO overhead. Furthermore, we proposed an autonomic cooperation mechanism to improve the performance through time correlation and content redundancy detection and elimination. We have verified the effectiveness of the proposed method through comprehensive trace-driven simulations.
A new versatile database created for geneticists and breeders to link molecular and phenotypic data in perennial crops
Authors: A. Antofie, M. Lateur, R. Oger, A. Patocchi, C. E. Durel, W. E. Van de Weg
Venue: Bioinformatics (2007)

Objective:AppleBreed DataBase (DB) aims to store genotypic and phenotypic data from multiple pedigree verified plant populations (crosses, breeding selections and commercial cultivars) so that they are easily accessible for geneticists and breeders. It will help in elucidating the genetics of economically important traits, in identifying molecular markers associated with agronomic traits, in allele mining and in choosing the best parental cultivars for breeding. It also provides high traceability of data over generations, years and localities. AppleBreed DB could serve as a generic database design for other perennial crops with long economic lifespans, long juvenile periods and clonal propagation. Results:AppleBreed DB is organized as a relational database. The core element is the GENOTYPE entity, which has two sub-classes at the physical level: TREE and DNA-SAMPLE. This approach facilitates all links between plant material, phenotypic and molecular data. The entities TREE, DNA-SAMPLE, PHENOTYPE and MOLECULAR DATA allow multi-annual observations to be stored as individual samples of individual trees, even if the nature of these observations differs greatly (e.g. molecular data on parts of the apple genome, physico-chemical measurements of fruit quality traits, and evaluation of disease resistance). AppleBreed DB also includes synonyms for cultivars and pedigrees. Finally, it can be loaded and explored through the web, and comes with tools to present basic statistical overviews and with validation procedures for phenotypic and marker data to certify data quality. AppleBreed DB was developed initially as a tool for scientists involved in apple genetics within the framework of the European project, ‘High-quality Disease Resistance in Apples for Sustainable Agriculture’ (HiDRAS), but it is also applicable to many other perennial crops. Contact: oger@cra.wallonie.be
An Effective Method To Improve kNN Text Classifier
Authors: Xiulan Hao, Xiaopeng Tao, Chenghong Zhang, Yunfa Hu
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

Many of standard classification algorithms usually assume that the training examples are evenly distributed among different classes. However, unbalanced data sets often appear in many applications. As a simple, effective categorization method, kNN is widely used, but it suffers from biased data sets, too. In developing the Prototype of Internet Information Security for Shanghai Council of Information and Security, we detect that when training data set is biased, almost all test documents of some rare categories are classified into common ones. To alleviate such a misfortune, we propose a novel concept, critical point (CP), and adapt traditional kNN by integrating CP's approximate value, LB or UB, training number with decision rules. Exhaustive experiments illustrate that the adapted kNN achieves significant classification performance improvement on biased corpora.
A conceptual overview of the virtual networking laboratory
Authors: John Gerdes, Scott Tilley
Venue: Proceedings of the 8th ACM SIGITE conference on Information technology education (2007)

A state-of-the-art networking lab is expensive to create and operate. This paper provides a conceptual overview of the Virtual Networking Laboratory (VNL). The VNL offers educational materials that provide networking technicians hands-on training beyond that received in a traditional, physical laboratory setting. Using the VNL, technicians can install, configure and maintain emulated networks of arbitrary size within a single computer. Students would verify the proper configuration of the network, and troubleshoot systems to identify and correct improperly configured components. Built-in assessment tools automatically track and report skill mastery. Breaking the dependency on the physical networking laboratory means that this training could be delivered using distance learning technology, further expanding access. The VNL system provides a cost effective means of supporting the national need to provide hands-on training to network technicians.
An Greedy-type Algorithm in m-term Approximation For Besov Class with Mixed Smoothness
Authors: Peixin Ye, Qing He
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

We propose an greedy-type adaptive compression numerical algorithm in best m-term approximation. This algorithm provides the asymptotically optimal approximation by tensor product wavelet-type basis for functions from periodic Besov class with mixed smoothness in the L_q norm. Moreover it depends only on the expansion of function f by tensor product wavelet-type basis but neither on q nor on any special features of f.
Frame-aggregated concurrent matching switch
Authors: Bill Lin, Isaac Keslassy
Venue: Proceedings of the 3rd ACM/IEEE Symposium on Architecture for networking and communications systems (2007)

Network operators need high-capacity router architectures that can offer scalability, provide throughput and performance guarantees, and maintain packet ordering. However, previous router architectures based on centralized crossbar-based architectures cannot scale to fast line rates and high port counts. Recently, a new scalable router architecture called the Concurrent Matching Switch (CMS)[5]was introduced that offers scalability by utilizing a fully distributed architecture based on two identical stages of fixed configuration meshes. It has been shown that fixed configuration meshes can be scaled to very fast line rates and highport counts via optical implementations.It has also been shown that the CMS architecture can achieve 100% through-put and packet ordering with only sequential hardware and O (1) amortized time complexity operations at each linecard. However, no delay performance guarantees have been shown for CMS. In this paper, we demonstrate a general delay performance guarantee for CMS.Based on this guarantee, we propose a novel frame-based CMS architecture that can achieve a performance guarantee of O (N log N)average packet delay, where N is the number of switch ports, while retaining scalability,throughput guarantees, packet ordering, and O (1) time complexity. This architecture improves upon the best previously-known average delay bound of O (N 2)given these switch properties. We further introduce several alternative frame-based CMS architectures.
LEGClust—A Clustering Algorithm Based on Layered Entropic Subgraphs
Authors: Jorge M. Santos, Joaquim Marques de Sa, Luis A. Alexandre
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2008)

Hierarchical clustering is a stepwise clustering method usually based on proximity measures between objects or sets of objects from a given data set. The most common proximity measures are distance measures. The derived proximity matrices can be used to build graphs, which provide the basic structure for some clustering methods. We present here a new proximity matrix based on an entropic measure and also a clustering algorithm (LEGClust) that builds layers of subgraphs based on this matrix, and uses them and a hierarchical agglomerative clustering technique to form the clusters. Our approach capitalizes on both a graph structure and a hierarchical construction. Moreover, by using entropy as a proximity measure we are able, with no assumption about the cluster shapes, to capture the local structure of the data, forcing the clustering method to reflect this structure. We present several experiments on artificial and real data sets that provide evidence on the superior performance of this new algorithm when compared with competing ones.
Dynamic Policy Scheme for Resource Allocation in Mobile IP Handoff
Authors: Xue-jie Liu, Yan-heng Liu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

For the problem of multimedia applications not obtain assuring service immediately after mobile IP handoff, we propose dynamic policy and design the dynamic policy scheme of resource management in mobile IP. Based on the prediction information of the mobile node, the mechanism automatically produces dynamic policies to do admission control and to prepare resources before handoff occurs. And then it uses core policies existed as reference and applies product space conditional event algebra to trigger enforcement of dynamic policy. When the resources in access domain fell short of mobile nodes' requisition, it adopts "step back" arithmetic to update dynamic policies to further adjust resource possession according to the priority to assure the services credibility. By analysis, it is shown that this scheme can guarantee QoS of applications with higher priority and significantly improve the success rate of handoff. Also this management model is much more flexible than traditional methods.
Ranking fuzzy choice functions by their rationality indicators
Authors: Irina Georgescu
Venue: Fuzzy Optimization and Decision Making (2007)

In this paper we study two rationality indicators and two normality indicators of a fuzzy choice function. They express the degree of rationality or normality of this fuzzy choice function. This way we can establish a hierarchy in a given family of fuzzy choice functions with respect to their degree of rationality.
Accurate detection for process-hotspots with vias and incomplete specification
Authors: Jingyu Xu, Subarna Sinha, Charles C. Chiang
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

This paper introduces the concept of via range patterns and incompletely specified range patterns to represent new types of process-hotspots. Via range patterns can represent process-hotspots containing vias that are a major source of lithography issues. An incompletely specified range pattern can accurately and succinctly represent a process-hotspot where any configuration of objects (that is unknown to the user apriori) can exist in some of its peripheral regions. These new types of range patterns cannot be accurately represented and/or detected using the concept of range patterns introduced in [7]. A new detection algorithm that can accurately detect these new types of patterns is also proposed. This is necessitated since the range pattern matching algorithm proposed earlier causes mismatches: it either misses true matches or reports false matches for these new kinds of patterns. Theoretical results show that the proposed algorithm prevents the incorrect mis-match issues, while experimental results on fab provided process-hotspots show the algorithm is computationally efficient and practical for use on real industrial designs.