ppxscal/embedding_network huggingface dataset:
Conservative Scheduling: Using Predicted Variance to Improve Scheduling Decisions in Dynamic Environments
Authors: Lingyun Yang, Jennifer M. Schopf, Ian Foster
Venue: Proceedings of the 2003 ACM/IEEE conference on Supercomputing (2003)

In heterogeneous and dynamic environments, efficient execution of parallel computations can require mappings of tasks to processors whose performance is both irregular (because of heterogeneity) and time-varying (because of dynamicity). While adaptive domain decomposition techniques have been used to address heterogeneous resource capabilities, temporal variations in those capabilities have seldom been considered. We propose a conservative scheduling policy that uses information about expected future variance in resource capabilities to produce more efficient data mapping decisions. We first present techniques, based on time series predictors that we developed in previous work, for predicting CPU load at some future time point, average CPU load for some future time interval, and variation of CPU load over some future time interval. We then present a family of stochastic scheduling algorithms that exploit such predictions of future availability and variability when making data mapping decisions. Finally, we describe experiments in which we apply our techniques to an astrophysics application. The results of these experiments demonstrate that conservative scheduling can produce execution times that are both significantly faster and less variable than other techniques.
Reviews of "Artificial Intelligence, A New Tool for Industry and Business by Richard K. Miller", SEAI Institute, ISBN 0-89671-051-3.
Authors: Keith Price
Venue: Issue 90 (October 1984) (1984)

A measure of the business interest in AI is the number of sources of information geared for management. This report is a review of the capabilities of current AI systems especially in how they an be used for industrail automation and management. Most of the information is readily available elsewhere, but not in a single source. The discussion of varous AI research projects concentrates on what the system did rather than on how the system did it. Actual products are discussedd, with some details, and sources for more information are given. Since the report is meant for managers rather than researchers, systems which produce tangible results and those in actual sue (e.g., DELTA at GE, XCON at DEC, DENDRAL) are given more discussion than pure research efforts.
Step control criteria for stiff equations
Authors: Byron L. Ehle
Venue: ACM SIGNUM Newsletter (1974)

In a recent note [1], J. C. Butcher showed using a simple 2 stage first order Runge-Kutta method that an error per unit step criterion gave consistent results on a nonstiff problem while an error per step criterion did not. This note considers the effect of employing error per unit step when stiff equations are involved.
An improved intial basis for the simplex algorithm
Authors: Hélcio Vieira Junior, Marcos Pereira Estellita Lins
Venue: Computers and Operations Research (2005)

A lot of research has been done to find a faster (polynomial) algorithm that can solve linear programming (LP) problems. The main branch of this research has been devoted to interior point methods (IPM). The IPM outperforms the Simplex method in large LPs. However, there is still much research being done in order to improve pivoting algorithms. In this paper, we present a new approach to the problem of improving the pivoting algorithms: instead of starting the Simplex with the canonical basis, we suggest as initial basis a vertex of the feasible region that is much closer to the optimal vertex than the initial solution adopted by the Simplex. By supplying the Simplex with a better initial basis, we were able to improve the iteration number efficiency of the Simplex algorithm in about 33%.
A Concise Guide to the Major Internet Bodies
Authors: Alex Simonelis
Venue: Ubiquity (2005)

The bodies responsible for the Internet's protocols and parameters can be said to steer the Internet in a significant sense. This document, by Alex Simonelis of Dawson College in Montreal, is a summary of those bodies and their most important characteristics.
Multi-View Stereo via Volumetric Graph-Cuts
Authors: G. Vogiatzis, P. H. S. Torr, R. Cipolla
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

This paper presents a novel formulation for the multiview scene reconstruction problem. While this formulation benefits from a volumetric scene representation, it is amenable to a computationally tractable global optimisation using Graph-cuts. The algorithm proposed uses the visual hull of the scene to infer occlusions and as a constraint on the topology of the scene. A photo consistency-based surface cost functional is defined and discretised with a weighted graph. The optimal surface under this discretised functional is obtained as the minimum cut solution of the weighted graph. Our method provides a viewpoint independent surface regularisation, approximate handling of occlusions and a tractable optimisation scheme. Promising experimental results on real scenes as well as a quantitative evaluation on a synthetic scene are presented.
Efficient routing and wavelength assignment for reconfigurable WDM ring networks with wavelength converters
Authors: Li-Wei Chen, Eytan Modiano
Venue: IEEE/ACM Transactions on Networking (TON) (2005)

We consider the problem of wavelength assignment in reconfigurable WDM networks with wavelength converters. We show that for N-node P-port bidirectional rings, a minimum number of ⌈PN/4⌉ wavelengths are required to support all possible connected virtual topologies in a rearrangeably nonblocking fashion, and provide an algorithm that meets this bound using no more than ⌈PN/2⌉ wavelength converters. This improves over the tight lower bound of ⌈PN/3⌉ wavelengths required for such rings given in [1] if no wavelength conversion is available. We extend this to the general P-port case where each node i may have a different number of ports, Pi and show that no more than ⌈Σi Pi/4⌉ + 1 wavelengths are required. We then provide a second algorithm that uses more wavelengths yet requires significantly fewer converters. We also develop a method that allows the wavelength converters to be arbitrarily located at any node in the ring. This gives significant flexibility in the design of the networks. For example, all ⌈PN/2⌉ converters can be collocated at a single hub node, or distributed evenly among the N nodes with min {⌈P/2⌉ + 1, P} converters at each node.
Machine translation of natural languages
Authors: Sergei Nirenburg
Venue: Issue 92 (April 1985) (1985)

The field of machine translation has recently entered a new, third period in its evolution. In its early period, for roughly fifteen years from 1950 MT was an expanding field of study in which both research and development efforts were undertaken. It is well-known and well documented (Bar Hillel, 1960; ALPAC, 1966) that this early MT paradigm could not and did not produce fully automated high quality translation systems. In fact, the practical results were quite negligible for such a high-scale effort. This period also witnessed an engineering-oriented trend which considered MT primarily an engineering problem. In the positive sense, it helped promote the idea of nonnumerical computation. As another consequence, the engineering, nontheoretical attitude to MT has been inherited by the next period in MT history. A more significant and lasting influence was exerted by the less "practical" aspect of early MT research: it helped achieve advances in theoretical and computational linguistics as well as artificial intelligence.
Evolutionary Rule Mining in Time Series Databases
Authors: Magnus Lie Hetland, Pål Sætrom
Venue: Machine Learning (2005)

Data mining in the form of rule discovery is a growing field of investigation. A recent addition to this field is the use of evolutionary algorithms in the mining process. While this has been used extensively in the traditional mining of relational databases, it has hardly, if at all, been used in mining sequences and time series. In this paper we describe our method for evolutionary sequence mining, using a specialized piece of hardware for rule evaluation, and show how the method can be applied to several different mining tasks, such as supervised sequence prediction, unsupervised mining of interesting rules, discovering connections between separate time series, and investigating tradeoffs between contradictory objectives by using multiobjective evolution.
Evolving Dynamic Multi-Objective Optimization Problems with Objective Replacement
Authors: Sheng-Uei Guan, Qian Chen, Wenting Mo
Venue: Artificial Intelligence Review (2005)

This paper studies the strategies for multi-objective optimization in a dynamic environment. In particular, we focus on problems with objective replacement, where some objectives may be replaced with new objectives during evolution. It is shown that the Pareto-optimal sets before and after the objective replacement share some common members. Based on this observation, we suggest the inheritance strategy. When objective replacement occurs, this strategy selects good chromosomes according to the new objective set from the solutions found before objective replacement, and then continues to optimize them via evolution for the new objective set. The experiment results showed that this strategy can help MOGAs achieve better performance than MOGAs without using the inheritance strategy, where the evolution is restarted when objective replacement occurs. More solutions with better quality are found during the same time span.
Frequency and dependence of long range temporal correlations in human hippocampal energy fluctuations: Research Articles
Authors: M. Stead, G. A. Worrell, B. Litt
Venue: Complexity (2005)

Spontaneous energy fluctuations in human hippocampal EEG show prominent amplitude and temporal variability. Here we show hippocampal energy fluctuations often exhibit long-range temporal correlations with power-law scaling. In most cases this scaling behavior persisted on time scales in excess of 10 minutes, the maximum duration we could detect with our recording durations. During these epochs we find that the energy fluctuations exhibit long-range correlations over a broad frequency range (0.5&ndash;100 Hz) with greater persistence of the correlations in the lower frequency bands (0.5&ndash;30 Hz) than the higher (30&ndash;100 Hz). The correlation in hippocampal energy fluctuations is characterized by a bias for energy fluctuations to be followed by similar magnitude fluctuations over all energy scales, i.e. large fluctuations begets large fluctuations and small begets small. &copy; 2005 Wiley Periodicals, Inc. Complexity 10: 35&ndash;45, 2005This paper was submitted as part of the Special Issue: Understanding Complex Systems (Complexity, Vol. 10&#x002F;No. 3 and No. 4)
Bi-Layer Segmentation of Binocular Stereo Video
Authors: V. Kolmogorov, A. Criminisi, A. Blake, G. Cross, C. Rother
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

This paper describes two algorithms capable of real-time segmentation of foreground from background layers in stereo video sequences. Automatic separation of layers from colour/contrast or from stereo alone is known to be error-prone. Here, colour, contrast and stereo matching information are fused to infer layers accurately andefficiently. The first algorithm, Layered Dynamic Programming (LDP), solves stereo in an extended 6-state space that represents both foreground/background layers and occluded regions. The stereo-match likelihood is then fused with a contrast-sensitive colour model that is learned on the fly, and stereo disparities are obtained by dynamic programming. The second algorithm, Layered Graph Cut (LGC), does not directly solve stereo. Instead the stereo match likelihood is marginalised over foreground and background hypotheses, and fused with a contrast-sensitive colour model like the one used in LDP. Segmentation is solved efficiently by ternary graph cut. Both algorithms are evaluated with respect to ground truth data and found to have similar perfomance, substantially better than stereo or colour/contrast alone. However, their characteristics with respect to computational efficiency are rather different. The algorithms are demonstrated in the application of background substitution and shown to give good quality composite video output.
A scatter search approach for the minimum sum-of-squares clustering problem
Authors: Joaquín A. Pacheco
Venue: Computers and Operations Research (2005)

A metaheuristic procedure based on the scatter search approach is proposed for the non-hierarchical clustering problem under the criterion of minimum sum-of-squares clustering. This algorithm incorporates procedures based on different strategies, such as local search, GRASP, tabu search or path relinking. The aim is to obtain quality solutions with short computation times. A series of computational experiments has been performed. The proposed algorithm obtains better results than previously reported methods, especially with small numbers of clusters.
A framework to support collaboration in heterogeneous environments
Authors: Vijayanand Bharadwaj, Y. V. Ramana Reddy
Venue: ACM SIGGROUP Bulletin (2003)

We recognize that a variety of tools and groupware used by distributed teams can strongly influence the manner in which team members can obtain awareness of the project. Considering that is often a necessity and even advantageous to use a variety of applications as well as the fact that project awareness is most essential, we propose an "Awareness Framework" that seeks to bind heterogeneous tools and groupware. This research discusses the architecture of the framework as well as a process that is necessary to manage it and project awareness.
Speaker adaptation of pitch and spectrum for HMM-based speech synthesis
Authors: Masatsune Tamura, Takashi Masuko, Keiichi Tokuda, Takao Kobayashi
Venue: Systems and Computers in Japan (2004)

This paper describes a technique for synthesizing speech with an arbitrary speaker's voice using speaker-independent speech units, which we call &ldquo;average voice&rdquo;models. The proposed method is based on an HMM-based text-to-speech synthesis system. In the HMM-based speech synthesis system, the spectrum and the pitch parameter are modeled simultaneously using an HMM based on the multi-space probability distribution (MSD). By appropriately transforming the HMM parameters, the voice characteristics and the prosodic features of synthesized speech can be transformed. In this paper, we derive an extension of the MLLR algorithm to apply it to MSD-HMMs. It is shown that by speaker adaptation for the pitch and applying the spectrum model, not only the voice characteristics, but also the prosodic features, can be adapted by using a small number of sentences uttered by a target speaker. Through the subjective evaluation, it is shown that by applying simultaneous adaptation of pitch and spectrum, synthetic speech generated from adapted models from the average voice model using a small number of sentences is very close to that from speaker-dependent models. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(11): 59&ndash;68, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10332
An information extraction engine for web discussion forums
Authors: Hanny Yulius Limanto, Nguyen Ngoc Giang, Vo Tan Trung, Jun Zhang, Qi He, Nguyen Quang Huy
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

In this poster, we present an information extraction engine for web-based forums. The engine analyzes the HTML files crawled from web forums, deduces the wrapper (template) of the pages and extracts the information about posts (e.g., author, title, content, number of replies and views, etc.). Extraction is an important module for forum search engine, since it helps to understand the content of a forum HTML page and facilitates ranking during retrieval. We discuss the system architecture of the extraction engine in the context of a forum search engine and present various components in the extraction engine. We also introduce briefly the extraction process and discuss some implementation issues.
Application of finite element methods to solving immiscible displacement problems with sharp fronts (abstract)
Authors: Harvey S. Price
Venue: ACM SIGNUM Newsletter (1975)

Many reservoir engineering problems involve solving fluid flow equations, whose solutions are characterized by sharp fronts and low dispersion levels. This is particularly important in tracking small slugs which are characteristic of chemical floods, polymer floods, first and multiple contact hydrocarbon miscible displacements and most thermal processes. The use of finite difference approximations to solve these problems when low dispersion levels and small slugs need to be accurately modeled is prohibitively expensive. In two dimensions, as many as 500 grid blocks on a side would be required in order to obtain the necessary accuracy. However, the use of high order finite element schemes are shown to be a very effective means of economically solving this problem. This paper presents some numerical results of a research project recently completed which has demonstrated that high order finite element methods can be used to solve difficult reservoir engineering problems where finite difference approximations would be prohibitively expensive.
Profile-driven code unloading for resource-constrained JVMs
Authors: Lingli Zhang, Chandra Krintz
Venue: Proceedings of the 3rd international symposium on Principles and practice of programming in Java (2004)

Java virtual machines (JVMs) have become increasingly popular for execution of a wide range of applications on mobile and embedded devices. Most JVMs for such devices execute programs using interpretation. However, JVMs that use dynamic compilation have been shown to enable significant performance improvements. A disadvantage of a compile-only approach in resource-constrained environments is that it uses more memory than interpretation to store compiled code for reuse.In this paper, we address this limitation with techniques that attempt to automatically unload dead or infrequently used native code to reduce the memory footprint of a compile-only JVM. We describe a number of profile-based strategies that identify unloading candidates. Our empirical evaluation, using a number of common benchmarks, indicates that dynamic code unloading can reduce code size significantly with negligible overhead. When memory is highly constrained, this reduction translates into significant execution time benefits for the benchmarks, JVM, and JVM configuration that we investigated.
Fuzzy relation equations for coding/decoding processes of images and videos
Authors: Vincenzo Loia, Salvatore Sessa
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2005)

We adopt fuzzy relation equations with continuous triangular norms for compression/decompression processes of grey images, colour images in the RGB space and frames of videos, by comparing the results of the reconstructed images with standard methods like JPEG and MPEG-4. Any image is subdivided in blocks and each block is coded/decoded using arbitrary fuzzy sets as coders in the fuzzy equations. We evaluate the peak signal to noise ratio (PSNR) on the decompressed images for several values of the compression rates as measure of the quality of images and frames reconstructed. The original frames of a video are classified in Intra-frames and Predictive frames by using a similarity measure based on the well known Lukasiewicz t-norm.
Global talent and innovation
Authors: Richard Florida
Venue: Proceedings of the 27th international conference on Software engineering (2005)

In his groundbreaking 2002 bestseller The Rise of the Creative Class, economist Richard Florida identified the 3 Ts of economic development: Technology, Talent, and Tolerance. Now, with The Flight of the Creative Class, Florida is back - and he's gone global. How does the movement of talented people across borders affect regional growth? What do tighter immigration, faltering education systems, and strong international competition mean for U.S. growth? Who are the up-and-comers in the global creative economy? Florida takes on these questions and more as he charts a course for creativity in the 21st century - and explains what the impact will be for countries, cities, and companies the world over.
Improving software security with a C pointer analysis
Authors: Dzintars Avots, Michael Dalton, V. Benjamin Livshits, Monica S. Lam
Venue: Proceedings of the 27th international conference on Software engineering (2005)

This paper presents a context-sensitive, inclusion-based, field-sensitive points-to analysis for C and uses the analysis to detect and prevent security vulnerabilities in programs. In addition to a conservative analysis, we propose an optimistic analysis that assumes a more restricted C semantics that reflects common C usage to increase the precision of the analysis.This paper uses the proposed pointer alias analyses to infer the types of variables in C programs and shows that most C variables are used in a manner consistent with their declared types. We show that pointer analysis can be used to reduce the overhead of a dynamic string-buffer overflow detector by 30% to 100% among applications with significant overheads. Finally, using pointer analysis, we statically found six format string vulnerabilities in two of the 12 programs we analyzed.
Improving revisitation in fisheye views with visit wear
Authors: Amy Skopik, Carl Gutwin
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

The distortion caused by an interactive fisheye lens can make it difficult for people to remember items and locations in the data space. In this paper we introduce the idea of visit wear - a visual representation of the places that the user has previously visited - as a way to improve navigation in spaces affected by distortion. We outline the design dimensions of visit wear, and report on two studies. The first shows that increasing the distortion of a fisheye view does significantly reduce people's ability to remember object locations. The second study looks at the effects of visit wear on performance in revisitation tasks, and shows that both completion time and error rates are significantly improved when visit wear is present. Visit wear works by changing the revisitation problem from one of memory to one of visual search. Although there are limitations to the technique, visit wear has the potential to substantially improve the usability both of fisheye views and of graphical information spaces more generally.