ppxscal/embedding_network huggingface dataset:
Explicit polynomial expansions of regular real functions by means of even order Bernoulli polynomials and boundary values
Authors: F. A. Costabile, F. Dell'Accio, R. Luceri
Venue: Journal of Computational and Applied Mathematics (2005)

For a function f ∈ C2n+1 ([a,b]) an explicit polynomial interpolant in a and in the even derivatives up to the order 2n - 1 at the end-points of the interval is derived. Explicit Cauchy and Peano representations and bounds for the error are given and the analysis of the remainder term allows to find sufficient conditions on f so that the polynomial approximant converges to f. These results are applied to derive a new summation formula with application to rectangular quadrature rule. The polynomial interpolant is related to a fairly interesting boundary value problem for ODEs. We will exhibit solutions for this problem in some special situations.
Coupled Kernel-Based Subspace Learning
Authors: Shuicheng Yan, Dong Xu, Lei Zhang, Benyu Zhang, HongJiang Zhang
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

It was prescriptive that an image matrix was transformed into a vector before the kernel-based subspace learning. In this paper, we take the Kernel Discriminant Analysis (KDA) algorithm as an example to perform kernel analysis on 2D image matrices directly. First, each image matrix is decomposed as the product of two orthogonal matrices and a diagonal one by using Singular Value Decomposition; then an image matrix is expanded to be of higher or even infinite dimensions by applying the kernel trick on the column vectors of the two orthogonal matrices; finally, two coupled discriminative kernel subspaces are iteratively learned for dimensionality reduction by optimizing the Fisher criterion measured by Frobenius norm. The derived algorithm, called Coupled Kernel Discriminant Analysis (CKDA), effectively utilizes the underlying spatial structure of objects and the discriminating information is encoded in two coupled kernel subspaces respectively. The experiments on real face databases compared with KDA and Fisherface validate the effectiveness of CKDA.
Streaming video delivery over internet with adaptive end-to-end QoS
Authors: Ewa Kusmierek, David H. C. Du
Venue: Journal of Systems and Software (2005)

Many multimedia applications rely on video streaming techniques. However, video delivery over a Best Effort network such as today's Internet is a challenge. Traffic load in the network changes dynamically and in an unpredictable way causing the resource availability to vary. Providing an application level end-to-end quality of service in such an environment requires network-awareness and ability to adapt. We address the issue of mapping between application-level quality of service for streaming video and network-level quality of service. We show that continuous playback requires a limit on the delay jitter. We tackle the problem of providing end-to-end video quality given that the network does not guarantee limited delay variability. Our approach is unique in a way we do not model network as a black box but investigate what information about the network status is necessary for an application to make adaptation decisions. We rely on simple multi-level ECN-based mechanism to obtain a feedback from the network as well as on end-point observations to determine available bandwidth. Such an approach allows to obtain better user-perceived video quality by providing additional information to properly interpret the arrival rate observed at the end-point. We propose a 3-rate adaptation mechanism for video streaming to illustrate the philosophy of adaptivity based on network awareness, where the network awareness is not limited to observing network reaction to a set of stimuli.
The Kalman filter in the context of adaptive filter theory: Research Articles
Authors: Dani Lippuner, George S. Moschytz
Venue: International Journal of Circuit Theory and Applications (2004)

Model-based adaptive algorithms are usually derived with the help of the Wiener-Hopf equation based on empirical statistics. They are often interpreted as an extension to their model-independent counterparts, i.e. the stochastic-gradient based adaptive filters. As a consequence, it is generally not considered worthwhile to show the analogy between Kalman filters and adaptive filters. This article pursues just these two goals. First, it tries to remove the notion that the Kalman filter is a complicated and unnecessary detour from the subject of adaptive filtering. Second, the advantage of a deeper insight into adaptive algorithms from Kalman's viewpoint emerges from our treatment. Based on a time-varying FIR filter model, the Kalman filter is completely derived and serves as a general framework for the special case of model-based adaptive filters. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Dynamic Polyethism and Competition for Tasks in Threshold Reinforcement Models of Social Insects
Authors: Daniel Merkle, Martin Middendorf
Venue: Adaptive Behavior - Animals, Animats, Software Agents, Robots, Adaptive Systems (2004)

In this paper we study the dynamics of task division in threshold reinforcement models of social insect societies. Our work extends other models in order to include several factors that influence the behavior of real insect colonies. Main extensions of our model are variable demands for work, age-dependent thresholds and finite life span of the individuals. It is shown how these factors influence the degree of task specialization of the individuals in a colony. Moreover, we show that the introduction of a threshold-dependent competition process between the individuals during task selection leads to the occurrence of specialists and differentiation between individuals as an emergent phenomenon that depends on the colony size. This result can help to explain the proximate mechanisms that lead to specialization in large insect colonies. Our results have implications for the fields of multi-agent systems, robotics, and nature inspired scheduling where threshold response models are used for control and regulation tasks.
About the nature of regional thermal anomaly in semipalatinsk test site region
Authors: A. E. Velikanov
Venue: Mathematics and Computers in Simulation (2004)

Thermal anomaly with area more than 20,000 km2 was revealed using space pictures in Semipalatinsk Test Site. It is observed every year in certain days, mainly at winter-spring period. Mostly, it appears in days of intensive precipitations, possible thawing of snow blanket and is accompanied by decreasing of ozone concentration in the atmosphere. Such behaviour of thermal anomaly is explained in the article by nuclear reactions caused by the energy of radioactive decay of radionuclides, which have been deposited in soil after surface and air explosions, and by radiolysis in soil solutions.
Clustering Time Series with Clipped Data
Authors: Anthony Bagnall, Gareth Janacek
Venue: Machine Learning (2005)

Clustering time series is a problem that has applications in a wide variety of fields, and has recently attracted a large amount of research. Time series data are often large and may contain outliers. We show that the simple procedure of clipping the time series (discretising to above or below the median) reduces memory requirements and significantly speeds up clustering without decreasing clustering accuracy. We also demonstrate that clipping increases clustering accuracy when there are outliers in the data, thus serving as a means of outlier detection and a method of identifying model misspecification. We consider simulated data from polynomial, autoregressive moving average and hidden Markov models and show that the estimated parameters of the clipped data used in clustering tend, asymptotically, to those of the unclipped data. We also demonstrate experimentally that, if the series are long enough, the accuracy on clipped data is not significantly less than the accuracy on unclipped data, and if the series contain outliers then clipping results in significantly better clusterings. We then illustrate how using clipped series can be of practical benefit in detecting model misspecification and outliers on two real world data sets: an electricity generation bid data set and an ECG data set.
Simultaneous Modeling and Tracking (SMAT) of Feature Sets
Authors: N. D. H. Dowson, R. Bowden
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

A novel method for the simultaneous modeling and tracking (SMAT) of a feature set during motion sequence is proposed. The method requires no prior information. Instead the a posteriori distribution of appearance and shape is built up incrementally using an exemplar based approach. The resulting model is less optimal than when a priori data is used, but can be built in real-time. Data in any form may be used, provided a distance measure and a means to classify outliers exists. Here, a two tier implementation of SMAT is used: at the feature level, mutual information is used to track image patches; and at the object level, a structure model is built from the feature positions. As experiments demonstrate, the tracker is robust and operates in real-time without requiring prelearned data.
GENIE: Developing and Assessing State-of-the-Art Integrated Programming Environments
Authors: Dennis R. Goldenson, Ravinder P. Chandhok, David H. Garlan, Glenn Meter, Philip L. Miller, John Pane, Jacobo Carrasquel, James A. Roberts, Edward J. Skwarecki
Venue: ACM SIGCHI Bulletin (1992)

This videotape demonstrates the functionality of Carnegie Mellon's GENIE programming environments. GENIE environment are publicly available on the Macintosh for Pascal and Richard Pattis' Karel the Robot teaching language. They are appropriate for use in introductory and intermediate computer programming methods courses at both the collegiate and secondary school levels. The Karel environment has been used successfully in group settings as early as the fourth grade.GENIE environments are built around syntax directed structure editors. [1, 2] Rather than edit only individual ASCII characters, the editors manipulate elements designated by a specific language grammar. Syntax errors are either prevented altogether or corrected immediately in context.Earlier structure editors often traded their syntax error prevention functionality for highly constrained and clumsy user interfaces. GENIE environments gracefully integrate text and structure editing, such that they have the "look and feel" of a good text editor, with the "intelligence" of a syntax directed structure editor.Through access to a common structure editor data base, GENIE environments combine many advanced tools for program design, comprehension and testing, all integrated in a single, uniform Macintosh user interface. Student program structures are maintained in "unparse" trees which can be mapped to and from text and graphics in many novel ways not constrained by a language's concrete syntax.[3] Different views of a common program database can be displayed and modified concurrently, emphasizing structure and design as well as implementation detail. [4] Similarly, arbitrary pieces of program structure can be hidden from view or displayed at will.At run time GENIE program can be traced at the level of expressions. Graphical data visualizations displaying arbitrary combinations of structured types are updated dynamically during run time and displayed in a representation of the program call stack. [5] Other notable GENIE features include an extensive contextual help system and a "notes" feature useful for project management, course assignments and "on-line" grading.User studies have been conducted at several universities and secondary schools throughout the United States. [6, 7, 8, 9] GENIE students in demanding courses have performed strikingly better than have students using other commercially available Macintosh software configurations.
An efficient wakeup design for energy reduction in high-performance superscalar processors
Authors: Kuo-Su Hsiao, Chung-Ho Chen
Venue: Proceedings of the 2nd conference on Computing frontiers (2005)

In modern superscalar processors, the complex instruction scheduler could form the critical path of the pipeline stages and limit the clock cycle time. In addition, complex scheduling logic results in the formation of a hot spot on the processor chip. Consequently, the latency and power consumption of the dynamic scheduler are two of the most crucial design issues when developing a high-performance microprocessor. We propose an instruction wakeup scheme that remedies the speed and power issues faced with conventional designs. This is achieved by a new design that separates RAM cells from the match circuits. This separated design is such that the advantages of the CAM and bit-map RAM schemes are retained, while their respective disadvantages are eliminated. Specifically, the proposed design retains the moderate area advantage of the CAM scheme and the low power and low latency advantages of the bit-map RAM schemeThe experimental results show that the proposed design saves power consumption by 80% compared to the traditional CAM-based design and 18% to the bit-map RAM design, respectively. In speed, the proposed design reduces an average of 77% in the wakeup latency compared to the conventional CAM-based design and an average of 33% reduction of the latency of the bit-map RAM design. For an 8-issue superscalar processor, the proposed design reduces the power consumption of the conventional wakeup logic by 80%, while simultaneously increasing the Instruction Count per nano-second (IPns) by a factor of approximately 2.5 times with a moderate area cost
Balanced boolean functions that can be evaluated so that every input bit is unlikely to be read
Authors: Itai Benjamini, Oded Schramm, David B. Wilson
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

A Boolean function of n bits is balanced if it takes the value 1 with probability 1⁄2. We exhibit a balanced Boolean function with a randomized evaluation procedure (with probability 0 of making a mistake) so that on uniformly random inputs, no input bit is read with probability more than Θ(n-1/2√ log n). We construct a balanced monotone Boolean function and a randomized algorithm computing it for which each bit is read with probability Θ(n-1⁄3 log n). We then show that for any randomized algorithm for evaluating a balanced Boolean function, when the input bits are uniformly random, there is some input bit that is read with probability at least Θ(n-1䊪). For balanced monotone Boolean functions, there is some input bit that is read with probability at least Θ(n-1䊫).
GLP--The application of a chart-parser to speech understanding: U. of Erlangen-Nuernberg, FRG
Authors: Guenther Goerz
Venue: Issue 79 (January 1982) (1982)

GLP is a general linguistic processor for the analysis and generation of natural language. It will be integrated into a speech understanding system for continuously spoken German language which is currently under development at the Computer Science Department, University of Erlangen-Nuernberg (Hein (1980) and this issue).
What's hot and what's not: tracking most frequent items dynamically
Authors: Graham Cormode, S. Muthukrishnan
Venue: ACM Transactions on Database Systems (TODS) (2005)

Most database management systems maintain statistics on the underlying relation. One of the important statistics is that of the &ldquo;hot items&rdquo; in the relation: those that appear many times (most frequently, or more than some threshold). For example, end-biased histograms keep the hot items as part of the histogram and are used in selectivity estimation. Hot items are used as simple outliers in data mining, and in anomaly detection in many applications.We present new methods for dynamically determining the hot items at any time in a relation which is undergoing deletion operations as well as inserts. Our methods maintain small space data structures that monitor the transactions on the relation, and, when required, quickly output all hot items without rescanning the relation in the database. With user-specified probability, all hot items are correctly reported. Our methods rely on ideas from &ldquo;group testing.&rdquo; They are simple to implement, and have provable quality, space, and time guarantees. Previously known algorithms for this problem that make similar quality and performance guarantees cannot handle deletions, and those that handle deletions cannot make similar guarantees without rescanning the database. Our experiments with real and synthetic data show that our algorithms are accurate in dynamically tracking the hot items independent of the rate of insertions and deletions.
Is probabilistic congestion estimation worthwhile?
Authors: Jurjen Westra, Patrick Groeneveld
Venue: Proceedings of the 2005 international workshop on System level interconnect prediction (2005)

Fast congestion prediction is essential for congestion reduction techniques at different stages of the flow. Probabilistic congestion estimation methods model congestion after placement by considering the probability a wire will be routed over different areas of the routing region. They are popular because they are much faster than traditional global routing.In this paper, two congestion estimation tools are presented. The first one is an implementation of a probabilistic method called pce and appears to be very fast in comparison with comparable methods. The second one called FaDGloR is new and based on global routing techniques. Surprisingly, FaDGloR is about as fast as pce. The reason is that it is tuned towards congestion estimation and speed contrary to global routers that are tuned towards wire length reduction and routing as many wires as possible. Special focus is on congested areas of the chip, the areas that may prevent a design to be routable, and FaDGloR more accurately predicts these areas than pce. Both tools are tested on designs varying from impossible to route to easily routable. Previous papers focussed on accurately modeling congestion of the final, routable design. In practice, also unroutable designs need to be evaluated. The results presented in this paper indicate that global routing based methods are probably more worthwhile than probabilistic methods.
Some open questions from PD86
Authors: Steven Jay Meyer
Venue: ACM SIGDA Newsletter (1986)

In my view this year's Physical Design Conference brought forth a number of interesting open questions. The questions involve the following three areas: active area utilization in semicustom circuits, comparison of standard cell and gate array area efficiency, and problems associated with multiple wiring layers.
Taxonomy for visualizing location-based information
Authors: Riku Suomela, Juha Lehikoinen
Venue: Virtual Reality (2004)

Location-based data is digital information that has a real-world location. Location-based data can be used for many purposes, such as providing additional information on real-world objects or helping a user in a specific task. Access to such data can be provided in many ways, for example, with augmented reality (AR) systems. AR techniques can help its user in various tasks and the AR data can be presented to the user in various ways, depending on the task at hand. The different visualizations that can be used are heavily dependent on the hardware platform and, thus, all technologies are not suitable for every situation. This paper studies two factors that affect the visualization of location-based data. The two factors are the environment model they use, ranging from three dimensions (3D) to no dimensions (0D) at all; and the viewpoint, whether it is a first-person or a third-person view. As a result, we define a taxonomy for visualizing location-based data, where each model&#x2013;view (MV) combination is referred to using its MV number. We also present numerous case studies with different MV values.
Swine Genome Sequencing Consortium (SGSC): a strategic roadmap for sequencing the pig genome: Conference Reviews
Authors: Lawrence B. Schook, Jonathan E. Beever, Jane Rogers, Sean Humphray, Alan Archibald, Patrick Chardon, Denis Milan, Gary Rohrer, Kellye Eversole
Venue: Comparative and Functional Genomics (2005)

The Swine Genome Sequencing Consortium (SGSC) was formed in September 2003 by academic, government and industry representatives to provide international coordination for sequencing the pig genome. The SGSC's mission is to advance biomedical research for animal production and health by the development of DNA-based tools and products resulting from the sequencing of the swine genome. During the past 2 years, the SGSC has met bi-annually to develop a strategic roadmap for creating the required scientific resources, to integrate existing physical maps, and to create a sequencing strategy that captured international participation and a broad funding base. During the past year, SGSC members have integrated their respective physical mapping data with the goal of creating a minimal tiling path (MTP) that will be used as the sequencing template. During the recent Plant and Animal Genome meeting (January 16, 2005 San Diego, CA), presentations demonstrated that a human&ndash;pig comparative map has been completed, BAC fingerprint contigs (FPC) for each of the autosomes and X chromosome have been constructed and that BAC end-sequencing has permitted, through BLAST analysis and RH-mapping, anchoring of the contigs. Thus, significant progress has been made towards the creation of a MTP. In addition, whole-genome (WG) shotgun libraries have been constructed and are currently being sequenced in various laboratories around the globe. Thus, a hybrid sequencing approach in which 3&times; coverage of BACs comprising the MTP and 3&times; of the WG-shotgun libraries will be used to develop a draft 6&times; coverage of the pig genome. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Content-Based Publish-Subscribe over Structured Overlay Networks
Authors: Roberto Baldoni, Carlo Marchetti, Antonino Virgillito, Roman Vitenberg
Venue: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (2005)

This paper introduces a novel architecture for implementing content-based pub/sub communications on top of structured overlay networks. This architecture overcomes some well-known limitations of existing infrastructures, i.e. lack of self-configuration and of adaptiveness to dynamic changes. This is achieved by devising a mediator stratum between the rich event subscription semantics of content-based pub/sub systems and the standard logical addressing scheme of overlays. The paper describes details of the design and provides considerations in selecting the subscription-to-node and event-to-node mappings suitable for the solution. We identify the lack of native support for one-to-many communication by overlay networks as the main impediment for efficient system operation. The paper introduces a novel primitive for one-to-many message delivery, showing through simulation how this can improve performance of the architecture. The simulation study also shows performance comparison between the different mappings proposed as well as evaluation of other optimizations discussed in the paper.