ppxscal/embedding_network huggingface dataset:
Algorithmic Problems in Scheduling Jobs on Variable-Speed Processors
Authors: Frances F. Yao
Venue: Proceedings of the 18th annual symposium on Combinatorial Pattern Matching (2007)

Power and heat have become two of the major concerns for the computer industry, which struggles to cope with the energy and cooling costs for servers, as well as the short battery life of portable devices. Dynamic Voltage Scaling (DVS) has emerged as a useful technique: e.g. Intel's newest Foxton technology enables a chip to run at 64 different speed levels. Equipped with DVS technology, the operating system can then save CPU's energy consumption by scheduling tasks wisely. A schedule that finishes the given tasks within their timing constraints while using minimum total energy (among all feasible schedules) is called an optimal DVS schedule. A theoretical model for DVS scheduling was proposed in a paper by Yao, Demers and Shenker in 1995, along with a well-formed characterization of the optimum and an algorithm for computing it. This algorithm has remained as the most efficient known despite many investigations of this model. In this talk, we will first give an overview of the DVS scheduling problem, and then present the latest improved results for computing the optimal schedule in both the finite and the continuous (infinite speed levels) models. Related results on efficient on-line scheduling heuristics will also be discussed.
A Metadatabase-supported shell for distributed processing and systems integration
Authors: Gilbert Babin, Waiman Cheung
Venue: Knowledge-Based Systems (2008)

Advances in computer networking and the globalization of economy have forced enterprises to adopt a distributed structure, particularly for their information systems. It is important to provide enterprises with integration tools which consolidate the information available in these distributed systems. We refer to such systems as Distributed Enterprise Information Systems (DEIS). A number of integration approaches can be found in the literature which achieve interoperability at the application level via an integrated schema or a common manipulation language. Other systems, such as ERPs, realize integration by imposing a central data model and uniform business processes. All these approaches are imposing certain logical data structure or even physical database to the local systems, which demand changes at the local level. In this paper, we describe the detailed architecture of a Metadatabase-supported shell enabling DEIS. Taking advantage of metadata, the approach presented guaranties flexibility, scalability, while preserving local autonomy.
Automata, Probability, and Recursion
Authors: Mihalis Yannakakis
Venue: Proceedings of the 13th international conference on Implementation and Applications of Automata (2008)

We discuss work on the modeling and analysis of systems with probabilistic and recursive features. Recursive Markov chains extend ordinary finite state Markov chains with the ability to invoke other Markov chains in a potentially recursive manner. The equivalent model of Probabilistic Pushdown Automata extends ordinary pushdown automata with probabilistic actions. Both of these are natural abstract models for probabilistic programs with procedures, and related systems. They generalize other classical well-studied stochastic models, e.g. Stochastic Context-free Grammars and (Multi-type) Branching Processes, that arise in a variety of areas. More generally, Recursive Markov Decision Processes and Recursive Stochastic Games can be used to model recursive systems that have both probabilistic and nonprobabilistic, controllable actions. In recent years there has been substantial work on the algorithmic analysis of these models, regarding basic questions of termination, reachability, and analysis of the properties of their executions. In this talk we will present some of the basic theory, algorithmic methods, results, and challenges.
The Role of Ontologies in Reusing Domain and Enterprise Engineering Assets
Authors: Albertas Čaplinskas, Audronė Lupeikienė, Olegas Vasilecas
Venue: Informatica (2003)

The main purpose of the paper is to compare ontology-based reuse techniques in domain engineering and enterprise engineering. It discusses attempts to combine classical domain engineering techniques with ontology-based techniques as well as the attempts to incorporate ontologies in enterprise engineering process and demonstrates that, on the one hand, both approaches still are not mature enough to solve practical reuse problems and, on the other hand, both propose ideas that can be used to develop more mature approach. The main contribution of the paper is the detail description of the problems of ontology-based reuse of enterprise engineering assets.
Comparison of Turbidity Measurement by MODIS and AVHRR Images
Authors: H. G. Ng, M. Z. MatJafri, K. Abdullah, A. N. Alias
Venue: Proceedings of the 2008 Fifth International Conference on Computer Graphics, Imaging and Visualisation (2008)

The turbidity is commonly measured by turbidity meter. However, it is only accurate for single point measurement but ineffective for wide spatial and temporal coverage. The objective of this study was to calibrate the turbidity algorithm for AVHRR and MODIS images. We also want to compare the effectiveness of MODIS and AVHRR in turbidity retrieval. Some studies had been performed to correlate the relationship between turbidity and reflectance. The reflectance at the Top of Atmosphere (TOA) was different with the reflectance from the target (water surface). Therefore an algorithm for atmospheric corrected reflectance had to be performed before a regression analysis was done to correlate the turbidity measurement with reflectance. Some pre-processing steps had to be performed to retrieve the atmospheric corrected reflectance and perform the geometric correction. The classification of land, cloud and water pixels was done based on the ratio of reflectance for near-infrared channel and red visible channel. The cloud masking techniques were also applied to filter the cloud contaminated pixels. The good pixels were only chosen for regression analysis. The multiple regressions were done on turbidity data and atmospheric corrected reflectance. The turbidity data was turbidity in-situ data obtained from Department of Environment (DOE). The atmospheric corrected reflectance was calculated with method of Hu. The square of correlation coefficient, R2 and root mean square error, RMSE were calculated. The same procedure was done on both MODIS and AVHRR images. The scatter plot was generated to observe the correlation between turbidity estimated from the algorithm for MODIS and AVHRR images. The turbidity estimated from algorithm by MODIS image gave a higher correlation compared with AVHRR image. Besides of that, the turbidity estimated from algorithm by both images show only the moderate relationship.
Is precision livestock farming an engineer's daydream or nightmare, an animal's friend or foe, and a farmer's panacea or pitfall?
Authors: C. M. Wathes, H. H. Kristensen, J. -M. Aerts, D. Berckmans
Venue: Computers and Electronics in Agriculture (2008)

This paper reviews the development of precision livestock farming (PLF), from the view point of the engineer, the farm animal and the farmer; PLF is the principal means by which 'smart' sensors will be used in livestock farming. It considers the technological principles upon which PLF is based, gives several examples of PLF, considers which livestock processes are suitable for the PLF approach, addresses whether PLF constitutes technology push or market pull, and stresses the need for a prospective bioethical analysis of PLF. We conclude that PLF is an embryonic technology with great promise but one that requires considerable research and development before uptake.
A comparison of conservative upwind difference schemes for the euler equations
Authors: P. Glaister
Venue: Computers Mathematics with Applications (2006)

Numerical results are presented and compared for three conservative upwind difference schemes for the Euler equations when applied to two standard test problems. This includes consideration of the effect of treating part of the flux balance as a source, and a comparison of different averaging of the flow variables. Two of the schemes are also shown to be equivalent in their implementation, while being different in construction and having different approximate Jacobians.
Teaching multi-robot coordination using demonstration of communication and state sharing
Authors: Sonia Chernova, Manuela Veloso
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3 (2008)

Solutions to complex tasks often require the cooperation of multiple robots, however, developing multi-robot policies can present many challenges. In this work, we introduce teaching by demonstration in the context of multi-robot tasks, enabling a single teacher to instruct multiple robots to work together through a demonstration of the desired behavior. Within this framework, we contribute two approaches for teaching coordination based on different communication and information sharing strategies. To enable the teacher to divide attention between multiple robots, each robot uses a confidence-based algorithm that allows it to regulate its autonomy and determine the need for demonstration. Evaluation is performed using two Sony QRIO robots learning a real-world collaborative ball sorting task.
Stability of continuous systems by Routh-Hurwitz and mathematica
Authors: Jose C. Valverde, Fernando L. Pelayo, Juan A. Martinez, Juan J. Miralles
Venue: Journal of Computational Methods in Sciences and Engineering (2004)

Nowadays, one of the main topics in Engineering is, undoubtedly, the Automatic Control of Systems. Probably, the most important problem in this area is how to guarantee the stability of a closed loop control system. The Routh-Hurwith Criterion, RHC, provides one of the most powerful algorithm for analyzing the mentioned stability, even when it depends on an adjustable parameter. It has been developed a computational system in Mathematica, which, applying this Criterion, is able to analyze the stability of every Continuous System which can be modelled by transfer functions in the way of quotient of real coefficients polynomials.
An Experimental Platform Based on MCE for Interactive TV
Authors: Ping-Yi Liu, Hung-Wei Lee, Tsai-Yen Li, Shwu-Lih Huang, Shu-Wei Hsu
Venue: Proceedings of the 6th European conference on Changing Television Environments (2008)

In this paper, we propose an experimental platform for the design of interactive TV. On this platform, designers are allowed to emulate broadcasting programs, define control functions, collect user interaction data, and incorporate external application systems. We also use several examples to demonstrate that through this platform one can easily add new functions and set up psychological experiments for evaluating these new functions. Two experiments have been conducted and their preliminary results are reported.
Probabilistic Tensor Analysis with Akaike and Bayesian Information Criteria
Authors: Dacheng Tao, Jimeng Sun, Xindong Wu, Xuelong Li, Jialie Shen, Stephen J. Maybank, Christos Faloutsos
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part I (2007)

From data mining to computer vision, from visual surveillance to biometrics research, from biomedical imaging to bioinformatics, and from multimedia retrieval to information management, a large amount of data are naturally represented by multidimensional arrays, i.e., tensors. However, conventional probabilistic graphical models with probabilistic inference only model data in vector format, although they are very important in many statistical problems, e.g., model selection. Is it possible to construct multilinear probabilistic graphical models for tensor format data to conduct probabilistic inference, e.g., model selection? This paper provides a positive answer based on the proposed decoupled probabilistic model by developing the probabilistic tensor analysis (PTA), which selects suitable model for tensor format data modeling based on Akaike information criterion (AIC) and Bayesian information criterion (BIC). Empirical studies demonstrate that PTA associated with AIC and BIC selects correct number of models.
IT education in a cultural context: a comparison of three approaches in afghanistan
Authors: Curtis A. Carver,  Jr., M. Hadi Hedyati, Omer Khan Shaheen
Venue: Proceedings of the 9th ACM SIGITE conference on Information technology education (2008)

This paper examines the approaches to information technology (IT) education at three universities in Afghanistan. If the world truly is flat, the approaches to IT education at the National Military Academy of Afghanistan, American University in Kabul, and Kabul University would be similar to what you might find in the United States and other developed nations. Connectivity would allow rapid access to a shared repository of information. Students could access that shared repository and become sufficiently informed to contribute in the fields of information technology. While cultural differences would exist, the underlying universal truths embodied in IT education would remain the same and likewise be shared. The best in the world would compete and prosper in information technology. Unfortunately, this utopian view does not exist in developing nations posing the question of what are effective pedagogical approaches to IT education in developing nations. This paper provides an Afghan perspective.
Scientific Computing in the $C^H$ Programming Language
Authors: Harry H. Cheng
Venue: Scientific Programming (1993)

We have developed a general-purpose block-structured interpretive programming Ianguage. The syntax and semantics of this language called $C^H$ are similar to C. $C^H$ retains most features of C from the scientific computing point of view. In this paper, the extension of C to $C^H$ for numerical computation of real numbers will be described. Metanumbers of &minus;0.0, 0.0, Inf, &minus;Inf, and NaN are introduced in $C^H$. Through these metanumbers, the power of the IEEE 754 arithmetic standard is easily available to the programmer. These metanumbers are extended to commonly used mathematical functions in the spirit of the IEEE 754 standard and ANSI C. The definitions for manipulation of these metanumbers in I/O; arithmetic, relational, and logic operations; and built-in polymorphic mathematical functions are defined. The capabilities of bitwise, assignment, address and indirection, increment and decrement, as well as type conversion operations in ANSI C are extended in $C^H$. In this paper, mainly new linguistic features of $C^H$ in comparison to C will be described. Example programs programmed in $C^H$ with metanumbers and polymorphic mathematical functions will demonstrate capabilities of CH in scientific computing.
Hierarchical and Modular Reasoning in Complex Theories: The Case of Local Theory Extensions
Authors: Viorica Sofronie-Stokkermans
Venue: Proceedings of the 6th international symposium on Frontiers of Combining Systems (2007)

We present an overview of results on hierarchical and modular reasoning in complex theories. We show that for a special type of extensions of a base theory, which we call local, hierarchic reasoning is possible (i.e. proof tasks in the extension can be hierarchically reduced to proof tasks w.r.t. the base theory). Many theories important for computer science or mathematics fall into this class (typical examples are theories of data structures, theories of free or monotone functions, but also functions occurring in mathematical analysis). In fact, it is often necessary to consider complex extensions, in which various types of functions or data structures need to be taken into account at the same time. We show how such local theory extensions can be identified and under which conditions locality is preserved when combining theories, and we investigate possibilities of efficient modular reasoning in such theory combinations.We present several examples of application domains where local theories and local theory extensions occur in a natural way. We show, in particular, that various phenomena analyzed in the verification literature can be explained in a unified way using the notion of locality.
A 3-PRS Parallel Manipulator Control Based on Neural Network
Authors: Qingsong Xu, Yangmin Li
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks (2007)

Due to the time-consuming calculation for the forward kinematics of a 3-PRS (prismatic-revolute-spherical) parallel manipulator, neither the kinematic nor dynamic control algorithm can be implemented on real time. To deal with such problem, the forward kinematics is solved by means of artificial neural network (NN) approach in this paper. Based on the trained NN, the kinematic control of the manipulator is carried out by resorting to an ordinary control algorithm. Simulation results illustrate that the NN can approximate the forward kinematics perfectly, which leads to ideal control results of the parallel manipulator.
Live @ Dublin --- Mobile Phone Live Video Group Communication Experiment
Authors: Erika Reponen
Venue: Proceedings of the 6th European conference on Changing Television Environments (2008)

Live video has gone mobile. In this paper we present an experiment on mobile phone live video group communication, conducted in Dublin, Ireland. We observed 24 people who self- organized into groups for sending and watching real time internet videos on mobile phones over two days. A total of 49 first person view live videos were sent during the experiment. This paper reports observations on attitudes, opinions, communication and context, as well as technical issues regarding the experiment. Findings include varying preferences between live vs. delayed video as well as between following vs. sending live videos. We describe some of the positive and negative feelings that the experiment caused. Finally, we also discuss implications of this technology for wider user populations.
Towards Agent-Based Evolutionary Planning in Transportation Systems
Authors: Jarosław Koźlak, Marek Kisiel-Dorohinicki, Edward Nawarecki
Venue: Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms (2007)

In this paper problems of planning in transportation systems based on Pickup and Delivery Problem with Time Windows (PDPTW) are discussed. The results of two variants of evolutionary algorithms illustrate the pros and cons of using different approaches, and their cooperation in hybrid island model indicates how they can help each other in achieving better solutions. This leads to the general idea of an agent-based cooperative system, in which many different techniques may be used simultaneously, exchanging the obtained solutions. Experimental study of such a system that uses evolutionary algorithms and tabu search concludes the work.
Stability Criteria with Less Variables for Neural Networks with Time-Varying Delay
Authors: Tao Li, Xiaoling Ye, Yingchao Zhang
Venue: Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks (2008)

In this paper, new delay-dependent stability criterion for neural networks is derived by using a simple integral inequality. The result is in terms of linear matrix inequalities and turn out to be equivalent to the existing result but include the least number of variables. This implies that some redundant variables in the existing stability criterion can be removed while maintaining the efficiency of the stability conditions. With the present stability condition, the computational burden is largely reduced. A numerical example is given to verify the effectiveness of the proposed criterion.
Rapid Neighbour-Joining
Authors: Martin Simonsen, Thomas Mailund, Christian N. Pedersen
Venue: Proceedings of the 8th international workshop on Algorithms in Bioinformatics (2008)

The neighbour-joining method reconstructs phylogenies by iteratively joining pairs of nodes until a single node remains. The criterion for which pair of nodes to merge is based on both the distance between the pair and the average distance to the rest of the nodes. In this paper, we present a new search strategy for the optimisation criteria used for selecting the next pair to merge and we show empirically that the new search strategy is superior to other state-of-the-art neighbour-joining implementations.
Exploiting Multiple Features with MEMMs for Focused Web Crawling
Authors: Hongyu Liu, Evangelos Milios, Larry Korba
Venue: Proceedings of the 13th international conference on Natural Language and Information Systems: Applications of Natural Language to Information Systems (2008)

Focused web crawling traverses the Web to collect documents on a specific topic. This is not an easy task, since focused crawlers need to identify the next most promising link to follow based on the topic and the content and links of previously crawled pages. In this paper, we present a framework based on Maximum Entropy Markov Models(MEMMs) for an enhanced focused web crawler to take advantage of richer representations of multiple features extracted from Web pages, such as anchor text and the keywords embedded in the link URL, to represent useful context. The key idea of our approach is to treat the focused web crawling problem as a sequential task and use a combination of content analysis and link structure to capture sequential patterns leading to targets. The experimental results showed that focused crawling using MEMMs is a very competitive crawler in general over Best-First crawling on Web Data in terms of two metrics: Precision and Maximum Average Similarity.
Lip-Reading Technique Using Spatio-Temporal Templates and Support Vector Machines
Authors: Wai Chee Yau, Dinesh Kant Kumar, Tharangini Chinnadurai
Venue: Proceedings of the 13th Iberoamerican congress on Pattern Recognition: Progress in Pattern Recognition, Image Analysis and Applications (2008)

This paper presents a lip-reading technique to identify the unspoken phones using support vector machines. The proposed system is based on temporal integration of the video data to generate spatio-temporal templates (STT). 64 Zernike moments (ZM) are extracted from each STT. This work proposes a novel feature selection algorithm to reduce the dimensionality of the 64 ZM to 12 features. The proposed technique uses the shape of probability curve as a goodness measure for optimal feature selection. The feature vectors are classified using non-linear support vector machines.Such a system could be invaluable when it is important to communicate without making a sound, such as giving passwords when in public spaces.
Detection of Sample Differences from Dot Plot Displays
Authors: Lisa A. Best, Laurence D. Smith, D. Alan Stubbs
Venue: Proceedings of the 5th international conference on Diagrammatic Representation and Inference (2008)

Cleveland and McGill [10] concluded that dot plots are effective when one judges position along a common scale. We assessed the ability of graph readers to detect sample mean differences in multipanel dot plots. In Experiment 1, plots containing vertically arranged panels with different sample sizes and levels of variability were presented. Sensitivity was greater with large samples and low variability. In Experiment 2, sensitivity depended on the location of the comparison sample, with vertical and superimposed arrays yielding greater sensitivity than horizontal or diagonal arrays. Horizontal arrays also produced a bias to judge data in right-most panels as having higher means. Experiment 3 showed that ordering of data had little effect on sensitivity or bias. The results suggest that good graph design requires attention to how the specific features of a graphical format influence perceptual judgments of data