ppxscal/embedding_network huggingface dataset:
Lower Bounds On Communication Complexity In Distributed Computer Networks
Authors: P. Tiwari
Venue: Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984 (1984)

We prove that for almost all boolean functions f , the conmunication complexity of f on a linear array with p+1 processors is approximately p times its commuication complexity on a system with two processors. We use this result to develop a technique for establishing lower bounds on communication complexity on general networks by simulating them on linear arrays. Using this technique, we derive optimal lower bounds for ranking, distinctness, uniqueness and triangle-detection problems on the ring. The application of this technique to meshes and trees yields nontrivial near optimal lower bounds on the communicaton complexity of ranking and distinctness problems on these networks. 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
Quasi-plus sampling edge correction for spatial point patterns
Authors: André Tscheschel, Sung Nok Chiu
Venue: Computational Statistics Data Analysis (2008)

A widely applicable edge correction method for estimating summary statistics of a spatial point pattern is proposed. We reconstruct point patterns in a larger region containing the sampling window by matching sampled and simulated kth nearest neighbour distance distributions of the given pattern and then apply plus sampling. Simulation studies show that this approach, called quasi-plus sampling, gives estimates with smaller root mean squared errors than estimates obtained by using other popular edge corrections. We apply the proposed approach to real data and yield an estimate of a summary statistic that is more plausible than that obtained by a popular edge correction.
A New Rapid System and Method for CV
Authors: Zhang Ning
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

In this article, we give a new method "mirror method" which has not been used in Camera Calibration and computer vision. The method is easy to implement and has very good result. The essence in the method is to utilize mirror. So in the article, we use the method to implement camera calibration rapidly, and use it to implement 3-D reconstructed.
Geodesic pancyclicity of crossed cubes
Authors: Pao-Lien Lai, Hong-Chun Hsu, Chang-Hsiung Tsai
Venue: Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS (2006)

For a pair of vertices u, v ∈ V (G), a cycle is called a geodesic cycle with u and v if a shortest path of G joining u and v lies on the cycle. A graph G is pancyclic [12] if it contains a cycle of every length from 3 to |V (G)| inclusive. Furthermore, a graph G is called geodesic k-pancyclic [3] if for each pair of vertices u, v ∈ V (G), it contains a geodesic cycle of every integer length of l satisfying 2dG(u, v) + k ≤ l ≤ |V(G)|. Chang et al. [4] proved that CQn is pancyclic in the sense that a cycle of length l exists, 4 ≤ l ≤ |V(CQn)|. In this paper, we study a new pancyclic property and show that Crossed cubes is geodesic 4-pancyclic.
An approach to adapt service requests to actual service interfaces
Authors: Luca Cavallaro, Elisabetta Di Nitto
Venue: Proceedings of the 2008 international workshop on Software engineering for adaptive and self-managing systems (2008)

Research about service oriented architectures produced, in the last years, some frameworks that enable the development of self-adaptive service compositions supporting dynamic binding. A developer can specify, at design time, an abstract service. At run time a concrete implementation of the abstract service is dynamically selected. In this scenario service selection is usually performed assuming that all the implementations of an abstract service have the same interface or protocol. This assumption is not necessarily true in an open world setting, where services built by different organizations are made available. In this paper we address the problem of invoking services having an interface or protocol different from those originally expected by the service requester. We have identified a number of possible mismatches between services and some basic mapping functions that can be used to solve simple mismatches. Such mapping functions can be combined in a script to solve complex mismatches. Scripts can be executed by a mediator that receives an operation request, parses it, and eventually performs the needed adaptations. The definition of the scripts can be partially automated.
Monte Carlo Simulations of Diffusely Backscattered Polarization Patterns for Turbid Media with Birefringence
Authors: Yinqi Feng
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

It will be very important of polarization as contrast mechanism and a characterization of the optical polarization properties of a turbid medium, such as a biological tissue. Because birefringence is one of the relative phenomena of polarization, we analyzed the propagation of polarized light in a linearly birefringent turbid medium and simulated all two-dimensional elements of diffusely backscattered Muller matrix of the medium using the Stocks Mueller formalism and Monte Carlo algorithm. Some of the elements present unusual spatial patterns compared with those for a non-birefringent isotropic turbid medium. Statistical distributions of the changes of polarization in the turbid medium with different birefringent parameters are demonstrated.
Randomized competitive algorithms for generalized caching
Authors: Nikhil Bansal, Niv Buchbinder, Joseph (Seffi) Naor
Venue: Proceedings of the 40th annual ACM symposium on Theory of computing (2008)

We consider online algorithms for the generalized caching problem. Here we are given a cache of size k and pages with arbitrary sizes and fetching costs. Given a request sequence of pages, the goal is to minimize the total cost of fetching the pages into the cache. We give an online algorithm with competitive ratio O(log2k), which is the first algorithm for the problem with competitive ratio sublinear in k. We also give improved O(log k)-competitive algorithms for the special cases of the Bit Model and Fault model. In the Bit Model, the fetching cost is proportional to the size of the page and in the Fault model all fetching costs are uniform. Previously, an O(log2 k)-competitive algorithm due to Irani [14] was known for both of these models. Our algorithms are based on an extension of the primal-dual framework for online algorithms which was developed by Buchbinder and Naor [7]. We first generate an O(log k)-competitive fractional algorithm for the problem. This is done by using a strengthened LP formulation with knapsack-cover constraints, where exponentially many constraints are added upon arrival of a new request. Second, we round online the fractional solution and obtain a randomized online algorithm. Our techniques provide a unified framework for caching algorithms and are substantially simpler than those previously used.
Target selection on mobile devices using display segmentation
Authors: David Dearman, Kori M. Inkpen, Khai N. Truong
Venue: Proceedings of the 9th international conference on Human computer interaction with mobile devices and services (2007)

In this paper, we explore the use of an interaction technique called sequential segmentation to support target selection for mobile devices. Sequential segmentation iteratively partitions an information space into selectable regions and subsequent sub-regions where each region/sub-region is labeled (1--9) and is mapped to the corresponding key on the mobile device's numeric keypad. We conducted a study comparing the sequential technique to the directional pad for target selection. The results show that the directional pad is significantly faster than sequential for selecting targets that require three or less interactions with the directional pad. However, sequential is significantly faster than the directional pad for targets that require five or more interactions with the directional pad. User feedback shows a preference for sequential and that it is perceived easier to use than the directional pad.
Table Compression by Record Intersections
Authors: Alberto Apostolico, Fabio Cunial, Vineith Kaul
Venue: Proceedings of the Data Compression Conference (2008)

Saturated patterns with don’t care like those emerged in biosequence motif discovery haveproven a valuable notion also in the design of lossless and lossy compression of sequence data. In independent endeavors, the peculiarities inherent to the compression of tables have been examined, leading to compression schemata advantageously hinged on a prudent rearrangement of columns. The present paper introduces off-line table compression by textual substitution in which the patterns used in compression are chosen among models or templates that capture recurrent record subfields. A model record is to be interpreted here as a sequence of intermixed solid and don’t care characters that obeys, in addition, some conditions of saturation: most notably, it must be not possible to replace a don’t care in the model by a solid character without having to forfeit some of its occurrences in the table. Saturation is expected to save on the size of the codebook at the outset, and hence to improve compression. It also induces some clustering of the records in the table, which may present independent interest. Results from preliminary experiments show the savings and potential for classification brought about by this method in connection with a table of specimens collected in a context of biodiversity studies.
Analysis of correlated mutations in HIV-1 protease using spectral clustering
Authors: Ying Liu, Eran Eyal, Ivet Bahar
Venue: Bioinformatics (2008)

Motivation: The ability of human immunodeficiency virus-1 (HIV-1) protease to develop mutations that confer multi-drug resistance (MDR) has been a major obstacle in designing rational therapies against HIV. Resistance is usually imparted by a cooperative mechanism that can be elucidated by a covariance analysis of sequence data. Identification of such correlated substitutions of amino acids may be obscured by evolutionary noise. Results: HIV-1 protease sequences from patients subjected to different specific treatments (set 1), and from untreated patients (set 2) were subjected to sequence covariance analysis by evaluating the mutual information (MI) between all residue pairs. Spectral clustering of the resulting covariance matrices disclosed two distinctive clusters of correlated residues: the first, observed in set 1 but absent in set 2, contained residues involved in MDR acquisition; and the second, included those residues differentiated in the various HIV-1 protease subtypes, shortly referred to as the phylogenetic cluster. The MDR cluster occupies sites close to the central symmetry axis of the enzyme, which overlap with the global hinge region identified from coarse-grained normal-mode analysis of the enzyme structure. The phylogenetic cluster, on the other hand, occupies solvent-exposed and highly mobile regions. This study demonstrates (i) the possibility of distinguishing between the correlated substitutions resulting from neutral mutations and those induced by MDR upon appropriate clustering analysis of sequence covariance data and (ii) a connection between global dynamics and functional substitution of amino acids. Contact: bahar@ccbb.pitt.edu Supplementary information: Supplementary data are available at Bioinformatics online.
The union of convex polyhedra in three dimensions
Authors: B. Aronov
Venue: Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science (1993)

We show that the number of vertices, edges, and faces of the union of k convex polyhedra in 3-space, having a total of n faces, is O(k/sup 3/+knlog/sup 2/ k). This bound is almost tight in the worst case. We also describe a rather simple randomized incremental algorithm for computing the boundary of the union in O(k/sup 3/+knlog/sup 3/ k) expected time.
Code migration control in large scale loosely coupled distributed systems
Authors: Makoto Yoshida, Kenji Sakamoto
Venue: Proceedings of the 4th international conference on mobile technology, applications, and systems and the 1st international symposium on Computer human interaction in mobile technology (2007)

Large scale loosely coupled PCs can organize a cluster and form the grid computing on sharing each processing power; power of PCs, code migration and transaction distribution characterize the performance of distributed systems. This paper describes object code migration control mechanism in large scale loosely coupled distributed systems. The prototype of the middleware which migrates object code for computing is implemented, and the tradeoff of code migration was observed. Based on these experiments, several simulations for large scale loosely coupled PC clusters were performed, and the methodology to control code migration to have stable response time in the system is derived. The mechanism for object code migration is proposed based on the results of the simulations. The result will be applied to design the grid computing systems and mobile systems to maintain the proper performance.
RSCS: A parallel simplex algorithm for the Nimrod/O optimization toolset
Authors: Andrew Lewis, David Abramson, Tom Peachey
Venue: Scientific Programming (2006)

This paper describes a method of parallelisation of the popular Nelder-Mead simplex optimization algorithms that can lead to enhanced performance on parallel and distributed computing resources. A reducing set of simplex vertices are used to derive search directions generally closely aligned with the local gradient. When tested on a range of problems drawn from real-world applications in science and engineering, this reducing set concurrent simplex (RSCS) variant of the Nelder-Mead algorithm compared favourably with the original algorithm, and also with the inherently parallel multidirectional search algorithm (MDS). All algorithms were implemented and tested in a general-purpose, grid-enabled optimization toolset.
Multi-Agent Simulation of Circular Pedestrian Movements Using Cellular Automata
Authors: Siamak Sarmady, Fazilah Haron, Abdullah Zawawi Hj. Talib
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

This paper presents a basic multi-layer model of human movement process. A behavior model is used to simulate actions of individual pedestrians while a cellular automata model is used to simulate their smallscale movements. A modular platform, which implements the proposed model, is also presented. The platform is being used to simulate different sections of the Muslim holy mosque in Makkah. Preliminary results of the simulation of circular pedestrian movements in a section of the mosque along with the algorithm used are reported.
Torsional potentials of mono- and fluoro-halooxopropenolates
Authors: A. Vongachariya, S. Tantiwattanakul, V. Parasuk
Venue: Proceedings of the 1st WSEAS International Conference on Computational Chemistry (2007)

Torsional potentials of mono- and fluoro-halooxopropenolates were computed using accurate quantum chemical calculations. Effects of electron correlation and basis set were studied. Most MO-based methods give similar patterns for torsional potentials. The DFT-based methods, on the other hand, yield too high barrier height for all conformations. Except for cc-pVDZ, all basis sets studied yield the similar level of accuracy for the computed torsional barriers. Steric repulsion could be used to explain the torsional potential of mono- and fluoro-halopropenolates. Bond conjugation also plays important roles to the stability of conformers.
Beyond telecom: Bob Frankston on the future we make for ourselves
Authors: Doc Searls
Venue: Linux Journal (2008)

What if the last mile was the end of the road for telecom as we know it? We interview tech pioneer Bob Frankston, who sees the Internet as a demo, and a future where networking is something we do for ourselves.
Contribution of the GABA shift to the transition from structural initialization to working stage in biologically realistic networks
Authors: Andreas Herzog, Karsten Kube, Bernd Michaelis, Ana D. de Lima, Thomas Baltz, Thomas Voigt
Venue: Neurocomputing (2008)

Biological cortical neurons form functional networks through a complex set of developmental steps. A key process in early development is the transition of the spontaneous network dynamics from slow synchronous activity to a mature firing profile with complex high-order patterns of spikes and bursts. In the present modeling study we investigate the required properties of the network to initialize this transition by the shift of the chloride reversal potential, which switches the effect of the GABA synapses from depolarizing to hyperpolarizing. The simulated networks are generated by a statistical description of parameters for the neuron model and the network architecture.
Temperature management in multiprocessor SoCs using online learning
Authors: Ayse Kivilcim Coskun, Tajana Simunic Rosing, Kenny C. Gross
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

In deep submicron circuits, thermal hot spots and high temperature gradients increase the cooling costs, and degrade reliability and performance. In this paper, we propose a low-cost temperature management strategy for multicore systems to reduce the adverse effects of hot spots and temperature variations. Our technique utilizes online learning to select the best policy for the current workload characteristics among a given set of expert policies. We achieve 20% and 60% average decrease in the frequency of hot spots and thermal cycles respectively in comparison to the best performing expert, and reduce the spatial gradients to below 5%.
Socially relevant computing
Authors: Michael Buckley, John Nordlinger, Devika Subramanian
Venue: Proceedings of the 39th SIGCSE technical symposium on Computer science education (2008)

In this paper, we introduce socially relevant computing as a new way to reinvigorate interest in computer science. Socially relevant computing centers on the use of computation to solve problems that students are most passionate about. It draws on both the solipsistic and altruistic side of the current generation of students. It presents computer science as a cutting-edge technological discipline that empowers them to solve problems of personal interest (socially relevant with a little s), as well as problems that are important to society at large (socially relevant with a capital s). We believe that socially relevant computing offers a vision of computer science that has the potential to improve the quantity, quality and diversity of students in our discipline. We describe preliminary results from two on-going curricular experiments at SUNY Buffalo and at Rice University that implement our vision of socially relevant computing.
Approximate Simulation Relations for Hybrid Systems
Authors: Antoine Girard, A. Agung Julius, George J. Pappas
Venue: Discrete Event Dynamic Systems (2008)

Approximate simulation relations have recently been introduced as a powerful tool for the approximation of discrete and continuous systems. In this paper, we extend this abstraction framework to hybrid systems. Using the notion of simulation functions, we develop a characterization of approximate simulation relations which can be used for hybrid systems approximation. For several classes of hybrid systems, this characterization leads to effective algorithms for the computation of approximate simulation relations. An application in the context of reachability analysis is shown.
Privileged users in zero-error transmission over a noisy channel
Authors: Noga Alon, Eyal Lubetzky
Venue: Combinatorica (2007)

The k-th power of a graph G is the graph whose vertex set is V(G) k , where two distinct k-tuples are adjacent iff they are equal or adjacent in G in each coordinate. The Shannon capacity of G, c(G), is lim k&#x2192;&#x221e; &#x03b1;(G k )1/k , where &#x03b1;(G) denotes the independence number of G. When G is the characteristic graph of a channel C, c(G) measures the effective alphabet size of C in a zero-error protocol. A sum of channels, C = &#x03a3; i C i , describes a setting when there are t &#x2265; 2 senders, each with his own channel C i , and each letter in a word can be selected from any of the channels. This corresponds to a disjoint union of the characteristic graphs, G = &#x03a3; i G i . It is well known that c(G) &#x2265; &#x03a3; i c(G i ), and in [1] it is shown that in fact c(G) can be larger than any fixed power of the above sum. We extend the ideas of [1] and show that for every F, a family of subsets of [t], it is possible to assign a channel C i to each sender i &#x2208; [t], such that the capacity of a group of senders X &#x2282; [t] is high iff X contains some F &#x2208; F. This corresponds to a case where only privileged subsets of senders are allowed to transmit in a high rate. For instance, as an analogue to secret sharing, it is possible to ensure that whenever at least k senders combine their channels, they obtain a high capacity, however every group of k &#x2212; 1 senders has a low capacity (and yet is not totally denied of service). In the process, we obtain an explicit Ramsey construction of an edge-coloring of the complete graph on n vertices by t colors, where every induced subgraph on exp $$(\Omega (\sqrt {\log n\log \log n} ))$$ vertices contains all t colors.
Scenario Based Evaluation
Authors: Nik Looker, David Webster, Duncan Russell, Jie Xu
Venue: Proceedings of the 2008 11th IEEE Symposium on Object Oriented Real-Time Distributed Computing (2008)

The concept of a scenario has long been utilized in military procurement as a means of evaluating capability in an operational context. With the advent of initiatives such as the USA Department of Defence’s Network-Centric Operations and the UK Ministry of Defence’s Network Enabled Capability, research into the application of Service-Oriented Architectures (SOA) as a means of delivering capability is being undertaken. A promising output of this research is the definition of scenario based evaluation models that can be applied to SOA. This paper examines the application of a military scenario framework to more conventional software evaluation situations by means of case studies. This demonstrates that similar techniques can be used in their construction and thus provides a basis for the application of scenario based evaluation models in future research.
Etching of sub-micrometer structures through Stencil
Authors: G. Villanueva, O. Vazquez-Mena, M. A. F. van den Boogaart, K. Sidler, K. Pataky, V. Savu, J. Brugger
Venue: Microelectronic Engineering (2008)

Resistless processes to realize the pattern transfer of your designs into the substrate present some advantages, as the reduction in fabrication steps. Stencil Lithography (SL) is one of the most used resistless processes and, up to now, it has mainly been used to perform local selective deposition of materials. Here, the local etching of different substrates through a stencil hard mask is presented. The compatibility with different etching conditions, the scalability of the technique and the main challenges are described. Minimum feature dimensions of 500nm in polysilicon and 200nm in LS-SiN is presented.