ppxscal/embedding_network huggingface dataset:
A Lower Bound on the Redundancy of Arithmetic-Type Delay Constrained Coding
Authors: Eado Meron, Ofer Shayevitz, Meir Feder, Ram Zamir
Venue: Proceedings of the Data Compression Conference (2008)

In a previous paper we derived an upper bound on the redundancy of an arithmetic-type encoder for a memoryless source, designed to meet a finite end-to-end strict delay constraint. It was shown that the redundancy decays exponentially with the delay constraint and that the redundancy-delay exponent is lower bounded by log(1/α) where α is the probability of the most likely source symbol. In this work, we prove a corresponding upper bound for the redundancy-delay exponent, C · log 1/β where β is the probability of the least likely source symbol. This bound is valid for almost all memoryless sources and for all arithmetic-type (possibly time-varying, memory dependent) lossless delay-constrained encoders. We also shed some light on the difference between our exponential bounds and the polynomial O(d−5/3) upper bound on the redundancy with an average delay constraint d, derived in an elegant paper by Bugeaud, Drmota and Szpankowski for another class of variable-to-variable encoders, and show that the difference is due to the precision needed to memorize the encoder's state.
Mesostructure from specularity using gradient illumination
Authors: Yannick Francken, Tom Cuypers, Philippe Bekaert
Venue: Proceedings of the 5th ACM/IEEE International Workshop on Projector camera systems (2008)

We present a method to efficiently acquire specular mesostructure normal maps, only making use of off-the-shelf components, such as a digital still camera, an LCD screen and a linear polarizing filter. Where current methods require a specialized setup, or a considerable number of input images, we only need a cheap setup to maintain a similar level of quality. We verify the presented theory on real world examples, and provide a ground truth evaluation on photorealistic synthetic data.
IDRS: Combining File-level Intrusion Detection with Block-level Data Recovery based on iSCSI
Authors: Youhui Zhang, Hongyi Wang, Yu Gu, Dongsheng Wang
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

Over the past years, researches on the intrusion detection have been parallelized with those on data recovery. Most of them scarcely try to combine the two issues together to propose an integrated solution, which is employed to defend the pivotal data and to recover the data when the intrusion has taken place. In this paper, we propose a framework of intrusion detection/recovery system (IDRS). This system is capable of detecting the intrusion on the file-level and recovering data on the block-level. Its advantages include that the file-level detection simplifies the implementation and the recovery based on the block-level can decrease the recovery time and raise the utilization ratio of storage devices. Again,considering that iSCSI has increasingly played an important role in network storage systems, we implement the IDRS prototype based on this promising protocol. The result of tests shows the extra storage overheads, arising from IDRS, are small (less than 10%). Therefore, we believe it is feasible to deploy IRDS on iSCSI systems to protect key files from damage.
Rigidity of a simple extended lower triangular matrix
Authors: Meena Mahajan, Jayalal Sarma M.N.
Venue: Information Processing Letters (2008)

For the all-ones lower triangular matrices, the upper and lower bounds on rigidity are known to match [P. Pudlak, Z. Vavrin, Computation of rigidity of order n^2/r for one simple matrix, Comment Math. Univ. Carolin. 32 (2) (1991) 213-218]. In this short note, we apply these techniques to the all-ones extended lower triangular matrices, to obtain upper and lower bounds with a small gap between the two; we show that the rigidity is @q(n^2r).
DJIA stock selection assisted by neural network
Authors: Tong-Seng Quah
Venue: Expert Systems with Applications: An International Journal (2008)

This paper presents methodologies to select equities based on soft-computing models which focus on applying fundamental analysis for equities screening. This paper compares the performance of three soft-computing models, namely multi-layer perceptrons (MLP), adaptive neuro-fuzzy inference systems (ANFIS) and general growing and pruning radial basis function (GGAP-RBF). It studies their computational time complexity; applies several benchmark matrices to compare their performance, such as generalize rate, recall rate, confusion matrices, and correlation to appreciation. This paper also suggests how equities can be picked systematically by using relative operating characteristics (ROC) curve.
Northbridge Architecture of AMD's Griffin Microprocessor Family
Authors: Jonathan Owen, Maurice Steinman
Venue: IEEE Micro (2008)

Demands for mobility and portability have driven microprocessor and system manufacturers to innovate in the areas of power and thermal management and efficiency. Cost and space, meanwhile, have driven manufacturers toward unified memory architectures for CPU and graphics, further complicating power management. AMD's Griffin microprocessor, optimized for mobile computing platforms, introduces several northbridge innovations to manage power without diminishing performance.
Running greenstone on an ipod
Authors: David Bainbridge, Steve Jones, Sam McIntosh, Matt Jones, Ian H. Witten
Venue: Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries (2008)

The open source digital library software Greenstone is demonstrated running on an iPod. The standalone configuration supports browsing, searching and displaying documents in a range of media formats. Plugged in to a host computer (Mac, Linux, or Windows), the exact same facilities are made available to the world through a built-in web server.
Fast and Accurate Waveform Analysis with Current Source Models
Authors: Vineeth Veetil, Dennis Sylvester, David Blaauw
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

Recently current source models (CSMs) have become popular for use in standard cell characterization and static timing analysis. However, there has not been any detailed study of what aspects of the gate behavior should be modeled for sufficient accuracy, and there have been no results reported incorporating a CSM into a timing analysis flow with reasonable runtime. This paper addresses these limitations by investigating complexity/accuracy tradeoffs in CSMs. We then present a novel technique to perform fast, accurate waveform analysis using CSMs. STA results on benchmark circuits show significantly reduced errors compared to a traditional Thevenin-based flow. In terms of µ+σ percentile, we gain by 20-150% in slew through this approach.
Communication Performance of Mesh- and Ring-Based NoCs
Authors: Vaclav Dvorak
Venue: Proceedings of the Seventh International Conference on Networking (2008)

As multi-core systems begin to appear, their possible applications, parallel performance and on-chip interconnection networks have to be clarified, analyzed and optimized. The paper investigates an impact of collective communication (CC) overhead that may be critical for performance of parallel applications. Two potential topologies of networks on chip (NoC) are investigated, a ring-based network and 2D-mesh, due to their easy manufacturability on a chip. The wormhole switching, full duplex links and 1-port non-combining as well as combining nodes are considered. The lower bounds on the number of communication steps and upper bounds of CC times based on real CC algorithms are given. They can be evaluated for any given start-up time and link bandwidth. This enables performance prediction of applications with CCs among computing nodes.
Diffusion of Innovation in a Social Environment: A Multi Agent Based Model
Authors: Marco Remondino
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

The spreading of certain innovations can’t be modelled just by taking into accounts pure technical issues; sometimes the forecasts made with a statistical or process based model, which considers just the engineering or financial aspects (i.e.: production process, activity decomposition, scale economies, product life cycle and so on), prove to be inaccurate or even wrong. This is commonly the case of cellular telephones, air-cooling systems, personal computers and so on, fields in which some external influences have led to diffusion results which are very different from the initial previsions obtained with classical prevision tools. The purpose of this work is to examine the diffusion of an emerging technical innovation: the district heating. The spreading of this technology shouldn’t be affected by phenomena like fashion – as happened with cellular phones - and its adoption can’t be considered a status symbol. Although, there are some other influences which can’t be taken into account by a traditional process based or statistical simulator, i.e.: the effects of individual perception about savings, ecological impacts and so on.
Orthonormal polynomials with exponential-type weights
Authors: H. S. Jung, R. Sakai
Venue: Journal of Approximation Theory (2008)

Let R=(-~,~) and let w"@r(x)@?|x|^@rexp(-Q(x)), where @r>-12 and Q(x)@?C^2:R->R^+=[0,~) is an even function. In this paper we consider the properties of the orthonormal polynomials with respect to the weight w"@r^2(x), obtaining bounds on the orthonormal polynomials and spacing on their zeros. Moreover, we estimate A"n(x) and B"n(x) defined in Section 4, which are used in representing the derivative of the orthonormal polynomials with respect to the weight w"@r^2(x).
Internet nuggets
Authors: Mark Thorson
Venue: ACM SIGARCH Computer Architecture News (2008)

This column consists of selected traffic from the comp.arch newsgroup, a forum for discussion of computer architecture on the Internet---an international computer network.
Unavoidable cycle lengths in graphs
Authors: Jacques Verstraete
Venue: Journal of Graph Theory (2005)

An old conjecture of Erd&otilde;s states that there exists an absolute constant c and a set S of density zero such that every graph of average degree at least c contains a cycle of length in S. In this paper, we prove this conjecture by showing that every graph of average degree at least ten contains a cycle of length in a prescribed set S satisfying $|S \cap \{ 1,2,\ldots ,n\} | = O(n^{0.99})$. &copy; 2005 Wiley Periodicals, Inc. J Graph Theory
Simulation Reduction Models Approach Using Neural Network
Authors: Philippe Thomas, Denise Choffel, André Thomas
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

Simulation is often used for the evaluation of a Master Production Schedule (MPS). Also, the goal of this paper is the study of the design of a simulation model by reducing its complexity. According to theory of constraints, we want to build reduced models composed exclusively by bottleneck and, in order to do that, a neural network, particularly a multilayer perceptron, is used. Moreover, the structure of the network is determined by using a pruning procedure. This approach is applied to a sawmill flow shop case.
Design, implementation and run-time evolution of a mission-based multiagent system
Authors: G. T. Jayaputera, S. W. Loke, A. Zaslavsky
Venue: Web Intelligence and Agent Systems (2007)

In this paper, we present our approach to developing a multiagent system based on the proposed concept of the mission. The mission is a high-level abstraction that combines the overall goal of a system, the means and the process of achieving that goal, and is the basis from which agents can be automatically generated. We propose a mechanism to generate agents on-demand and at run-time based on a given mission. Run-time mission evolution is systematically captured and maintained, allowing the mission to be suspended and resumed at a later stage at the same or different locations. We report on the theory, algorithm, implementation and experimental results of our research.
Shakespeare, god, and lonely hearts: transforming data access with many eyes
Authors: Fernanda Viégas, Martin Wattenberg
Venue: Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries (2008)

Data visualization has historically been accessible only to the technological elite. It is, after all, "serious" technology done by experts for experts. But recent web-based visualizations - ranging from political art projects to news stories - have reached millions. Unfortunately, while lay users can view sophisticated visualizations, they have few ways to create them. In order to "democratize" visualization, we have built Many Eyes, a web site where people may upload their own data, create interactive visualizations, and carry on conversations. By making these tools available to anyone on the web, the site fosters a social style of data analysis that empowers users to engage with public data through discussion and collaboration. Political discussions, citizen activism, religious conversations, game playing, and educational exchanges are all happening on Many Eyes. The public nature of these visualizations provides users with a transformative path to information literacy.
Teaching template classes with all the advantages
Authors: Daniel Spiegel
Venue: Journal of Computing Sciences in Colleges (2008)

Template classes in C++ raise issues for instructors, as there are several ways to represent and instantiate them and compilation and linking issues. Some integrated development environments mandate a certain methodology, but none is universally recognized and employed. For non-integrated compilers, there have been several methods suggested in literature. This paper will suggest a method for representing and instantiating template classes under the gnu g++ compiler that eliminates the disadvantages of the others and promotes the most efficient compilation and linking.
An Analytical Model for Priority-Based AQM in the Presence of Heterogeneous Network Traffic
Authors: Lan Wang, Geyong Min, Irfan Awan
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

Active Queue Management (AQM) coupled with differentiated scheduling mechanism is an important and promising scheme for congestion control and Quality-of-Service (QoS) guarantee in communication networks. This paper develops a new analytical performance model for priority-based AQM subject to heterogeneous bursty traffic modelled by Markov-Modulated Poisson Processes (MMPP) and non-bursty traffic modelled by Poisson processes. Individual thresholds for each traffic class and Pre-emptive Resume (PR) priority scheduling mechanism are adopted to control traffic injection rate and support differential QoS. The model derives the expression of the aggregate and marginal performance metrics of the priority-based AQM system. The credibility of the model is demonstrated by comparing the analytic results with those obtained through extensive simulation experiments. The proposed model is used to investigate the impact of the squared coefficient of variation (SCV) of bursty traffic on the performance of AQM.
Probabilistic checking of proofs; a new characterization of NP
Authors: S. Arora
Venue: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (1992)

The authors give a new characterization of NP: the class NP contains exactly those languages L for which membership proofs (a proof that an input x is in L) can be verified probabilistically in polynomial time using logarithmic number of random bits and sub-logarithmic number of queries to the proof. This is a non-relativizing characterization of NP. They discuss implications of this characterization; specifically, they show that approximating clique (or independent set) is NP-hard.
Collaborative process management and virtual teams
Authors: Hilko Donker, Malte Blumberg
Venue: Proceedings of the 2008 international workshop on Cooperative and human aspects of software engineering (2008)

This position paper describes the requirements for facing essential problems of virtual teams. Further, the current deficits of project management tools and collaborative tools are focused. We will describe our opinions on how to solve these problems. In general, we see an essential necessity in creating a symbiosis between project management tools and collaborative tools, as these two areas are both crucial for virtual project management. Currently, the lack of connection between them significantly decreases the quality of virtual work. Our ideas show new ways of managing virtual work in order to increase the effectiveness of virtual teams and help companies to get their work done over the distance of time and space.
Segregating and extracting overlapping data points in two-dimensional plots
Authors: William Browuer, Saurabh Kataria, Sujatha Das, Prasenjit Mitra, C. Lee Giles
Venue: Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries (2008)

Most search engines index the textual content of documents in digital libraries. However, scholarly articles frequently report important findings in figures for visual impact and the contents of these figures are not indexed. These contents are often invaluable to the researcher in various fields, for the purposes of direct comparison with their own work. Therefore, searching for figures and extracting figure data are important problems. To the best of our knowledge, there exists no tool to automatically extract data from figures in digital documents. If we can extract data from these images automatically and store them in a database, an end-user can query and combine data from multiple digital documents simultaneously and efficiently. We propose a framework based on image analysis and machine learning to extract information from 2-D plot images and store them in a database. The proposed algorithm identifies a 2-D plot and extracts the axis labels, legend and the data points from the 2-D plot. We also segregate overlapping shapes that correspond to different data points. We demonstrate performance of individual algorithms, using a combination of generated and real-life images.
A stateless approach to connection-oriented protocols
Authors: Alan Shieh, Andrew C. Myers, Emin Gün Sirer
Venue: ACM Transactions on Computer Systems (TOCS) (2008)

Traditional operating system interfaces and network protocol implementations force some system state to be kept on both sides of a connection. This state ties the connection to its endpoints, impedes transparent failover, permits denial-of-service attacks, and limits scalability. This article introduces a novel TCP-like transport protocol and a new interface to replace sockets that together enable all state to be kept on one endpoint, allowing the other endpoint, typically the server, to operate without any per-connection state. Called Trickles, this approach enables servers to scale well with increasing numbers of clients, consume fewer resources, and better resist denial-of-service attacks. Measurements on a full implementation in Linux indicate that Trickles achieves performance comparable to TCP/IP, interacts well with other flows, and scales well. Trickles also enables qualitatively different kinds of networked services. Services can be geographically replicated and contacted through an anycast primitive for improved availability and performance. Widely-deployed practices that currently have client-observable side effects, such as periodic server reboots, connection redirection, and failover, can be made transparent, and perform well, under Trickles. The protocol is secure against tampering and replay attacks, and the client interface is backward-compatible, requiring no changes to sockets-based client applications.
Relay sensor placement in wireless sensor networks
Authors: Xiuzhen Cheng, Ding-Zhu Du, Lusheng Wang, Baogang Xu
Venue: Wireless Networks (2008)

This paper addresses the following relay sensor placement problem: given the set of duty sensors in the plane and the upper bound of the transmission range, compute the minimum number of relay sensors such that the induced topology by all sensors is globally connected. This problem is motivated by practically considering the tradeoff among performance, lifetime, and cost when designing sensor networks. In our study, this problem is modelled by a NP-hard network optimization problem named Steiner Minimum Tree with Minimum number of Steiner Points and bounded edge length (SMT-MSP). In this paper, we propose two approximate algorithms, and conduct detailed performance analysis. The first algorithm has a performance ratio of 3 and the second has a performance ratio of 2.5.
Speeded-Up Robust Features (SURF)
Authors: Herbert Bay, Andreas Ess, Tinne Tuytelaars, Luc Van Gool
Venue: Computer Vision and Image Understanding (2008)

This article presents a novel scale- and rotation-invariant detector and descriptor, coined SURF (Speeded-Up Robust Features). SURF approximates or even outperforms previously proposed schemes with respect to repeatability, distinctiveness, and robustness, yet can be computed and compared much faster. This is achieved by relying on integral images for image convolutions; by building on the strengths of the leading existing detectors and descriptors (specifically, using a Hessian matrix-based measure for the detector, and a distribution-based descriptor); and by simplifying these methods to the essential. This leads to a combination of novel detection, description, and matching steps. The paper encompasses a detailed description of the detector and descriptor and then explores the effects of the most important parameters. We conclude the article with SURF's application to two challenging, yet converse goals: camera calibration as a special case of image registration, and object recognition. Our experiments underline SURF's usefulness in a broad range of topics in computer vision.
Bayesian inference of the sites of perturbations in metabolic pathways via Markov chain Monte Carlo
Authors: Bayu Jayawardhana, Douglas B. Kell, Magnus Rattray
Venue: Bioinformatics (2008)

Motivation: Genetic modifications or pharmaceutical interventions can influence multiple sites in metabolic pathways, and often these are ‘distant’ from the primary effect. In this regard, the ability to identify target and off-target effects of a specific compound or gene therapy is both a major challenge and critical in drug discovery. Results: We applied Markov Chain Monte Carlo (MCMC) for parameter estimation and perturbation identification in the kinetic modeling of metabolic pathways. Variability in the steady-state measurements in cells taken from a population can be caused by differences in initial conditions within the population, by variation of parameters among individuals and by possible measurement noise. MCMC-based parameter estimation is proposed as a method to help in inferring parameter distributions, taking into account uncertainties in the initial conditions and in the measurement data. The inferred parameter distributions are then used to predict changes in the network via a simple classification method. The proposed technique is applied to analyze changes in the pathways of pyruvate metabolism of mutants of Lactococcus lactis, based on previously published experimental data. Availability: MATLAB code used in the simulations is available from ftp://anonymous@dbkweb.mib.man.ac.uk/pub/Bioinformatics_BJ.zip Contact: bayujw@ieee.org Supplementary information: Supplementary data are available at Bioinformatics online.