ppxscal/embedding_network huggingface dataset:
The Network Game: Analyzing Network-Formation and Interaction Strategies in Tandem
Authors: Björn-Oliver Hartmann, Klemens Böhm, Bodo Vogt
Venue: Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 02 (2008)

In networks, autonomous nodes have action choices along two dimensions: They can forward/process incoming service requests – or not, and they can establish new links and maintain or terminate existing ones. In other words, a node can choose both an action-selection and a link-selection strategy. Nodes in networks are either humans (as in social networks) or agents controlled by humans, so the question how humans forming networks behave is important. Humans behave boundedly rational at times, e.g., game-theoretic predictions do not always hold. This paper investigates the questions whether individuals being nodes in a network find and actually use strategies leading to efficiency (in the economic sense), how exogenous parameters influence behavior, and what are characteristics of the resulting network. We do so by carrying out laboratory experiments with human subjects (120 altogether) who form a network and have those action choices. Our work is different from previous work on P2P systems which lets nodes choose their actions or their links, but not both. Main findings are that link selection increases cooperation and results in optimal payoffs in relative terms. Thus, link selection fosters efficiency.
Evaluating the Motivational Value of an Augmented Reality System for Learning Chemistry
Authors: Costin Pribeanu, Dragoş Daniel Iordache
Venue: Proceedings of the 4th Symposium of the Workgroup Human-Computer Interaction and Usability Engineering of the Austrian Computer Society on HCI and Usability for Education and Work (2008)

The development of Augmented Reality (AR) technologies is creating new opportunities and challenges for the designers of e-learning systems. More recently, AR based educational systems have been developed that are implementing new learning scenarios for primary and secondary schools. An important goal of these novel teaching platforms is to enhance the students' motivation to learn. This paper reports on a user-centered formative usability evaluation of an AR-based learning scenario for Chemistry with a focus on the motivational value. After user testing, quantitative and qualitative data were collected that are measuring the educational and motivational values of the learning scenario. While the comparison between the two types of measure is increasing the confidence in the evaluation results, the qualitative measures are also providing with a detailed description of the user learning experience. In this respect, not only the students found the Chemistry scenario interesting, captivating and enjoyable but they were also delighted to feel in control of the learning process.
Logical analysis of survival data
Authors: Louis-Philippe Kronek, Anupama Reddy
Venue: Bioinformatics (2008)

Motivation: Survival analysis involves predicting the time to event for patients in a dataset, based on a set of recorded attributes. In this study we focus on right-censored survival problems. Detecting high-degree interactions for the estimation of survival probability is a challenging problem in survival analysis from the statistical perspective. Results: We propose a new methodology, Logical Analysis of Survival Data (LASD), to identify interactions between variables (survival patterns) without any prior hypotheses. Using these set of patterns, we predict survival distributions for each observation. To evaluate LASD we select two publicly available datasets: a lung adenocarcinoma dataset (gene-expression pro.les) and the other a breast cancer dataset (clinical pro.les). The performance of LASD when compared with survival decision trees improves the cross-validation accuracy by 18% for the gene-expression dataset, and by 2% for the clinical dataset. Availability: Executable codes will be provided upon request. Contact:louis-philippe.kronek@g-scop.fr; areddy@rutcor.rutgers.edu
Energy cost, the key challenge of today's data centers: a power consumption analysis of TPC-C results
Authors: Meikel Poess, Raghunath Othayoth Nambiar
Venue: Proceedings of the VLDB Endowment (2008)

Historically, performance and price-performance of computer systems have been the key purchasing arguments for customers. With rising energy costs and increasing power use due to the ever-growing demand for computing power (servers, storage, networks), electricity bills have become a significant expense for today's data centers. In the very near future, energy efficiency is expected to be one of the key purchasing arguments. Some performance organizations, such as SPEC, have developed power benchmarks for single servers (SPECpower_ssj2008), but so far, no benchmark exists that measures the power consumption of transaction processing systems. In this paper, we develop a power consumption model based on data readily available in the TPC-C full disclosure report of published benchmarks. We verify our model with measurements taken from three fully scaled and optimized TPC-C configurations including client (middle-tier) systems, database server, and storage subsystem. By applying this model to a subset of 7 years of TPC-C results, we identify the most power-intensive components and demonstrate the existing power consumption trends over time. Assuming similar trends in the future, the hardware enhancements alone will not be able to satisfy the demand for energy efficiency. In its outlook, this paper looks at potential hardware and software enhancements to meet the energy efficiency demands of future systems. Realizing the importance of energy efficiency, the Transaction Processing Performance Council (TPC) has formed a working group to look into adding energy efficiency metrics to all its benchmarks. This paper is expected to complement this initiative.
Gauss-Lobatto to Bernstein polynomials transformation
Authors: Loredana Coluccio, Alfredo Eisinberg, Giuseppe Fedele
Venue: Journal of Computational and Applied Mathematics (2008)

The aim of this paper is to transform a polynomial expressed as a weighted sum of discrete orthogonal polynomials on Gauss-Lobatto nodes into Bernstein form and vice versa. Explicit formulas and recursion expressions are derived. Moreover, an efficient algorithm for the transformation from Gauss-Lobatto to Bernstein is proposed. Finally, in order to show the robustness of the proposed algorithm, experimental results are reported.
Parallel force measurement with a polymeric microbeam array using an optical microscope and micromanipulator
Authors: F. Mert Sasoglu, Andrew J. Bohl, Kathleen B. Allen, Bradley E. Layton
Venue: Computer Methods and Programs in Biomedicine (2009)

An image analysis method and its validation are presented for tracking the displacements of parallel mechanical force sensors. Force is measured using a combination of beam theory, optical microscopy, and image analysis. The primary instrument is a calibrated polymeric microbeam array mounted on a micromanipulator with the intended purpose of measuring traction forces on cell cultures or cell arrays. One application is the testing of hypotheses involving cellular mechanotransduction mechanisms. An Otsu-based image analysis code calculates displacement and force on cellular or other soft structures by using edge detection and image subtraction on digitally captured optical microscopy images. Forces as small as 250+/-50nN and as great as 25+/-2.5@mN may be applied and measured upon as few as one or as many as hundreds of structures in parallel. A validation of the method is provided by comparing results from a rigid glass surface and a compliant polymeric surface.
Assessment of remotely sensed and statistical inventories of African agricultural fields
Authors: F. Hannerz, A. Lotsch
Venue: International Journal of Remote Sensing (2008)

This paper critically examines different sources of remotely sensed and statistical inventories of African agricultural fields. Substantial discrepancies are found across alternative sources of information in both the extent and location of agricultural fields. In one-third of the countries, the difference between lowest and highest field extent estimate exceeds 25% of the total country area, and the maximum difference at the continental level is 2.6 million km2. Much of the disagreement between land-cover maps arises from areas of low cropping density. These inconsistencies have important implications when using these data directly, e.g. for the assessment of land cover changes, or indirectly in economic or physical models, and indicate a need to explicitly quantify uncertainties arising from the limitations in land-cover data. They also highlight the need for development of regional land information systems for baseline development and informed policy decisions.
Solving linear-quadratic optimal control problems on parallel computers
Authors: Peter Benner, Enrique S. Quintana-Orti, Gregorio Quintana-Orti
Venue: Optimization Methods Software (2008)

We discuss a parallel library of efficient algorithms for the solution of linear-quadratic optimal control problems involving large-scale systems with state-space dimension up to O(104). We survey the numerical algorithms underlying the implementation of the chosen optimal control methods. The approaches considered here are based on invariant and deflating subspace techniques, and avoid the explicit solution of the associated algebraic Riccati equations in case of possible ill-conditioning. Still, our algorithms can also optionally compute the Riccati solution. The major computational task of finding spectral projectors onto the required invariant or deflating subspaces is implemented using iterative schemes for the sign and disk functions. Experimental results report the numerical accuracy and the parallel performance of our approach on a cluster of Intel Itanium-2 processors.
Combinatorial optimization under uncertainty
Authors: O. A. Yemets, A. A. Roskladka
Venue: Cybernetics and Systems Analysis (2008)

In this paper, the general problem of Euclidean combinatorial optimization under uncertainty is formulated for the first time and the concepts of a stochastic multiset, a multiset of fuzzy numbers, a stochastic Euclidean combinatorial set, and general Euclidean combinatorial set of fuzzy stochastic numbers that combines the properties of both types of uncertainty are introduced.
Data Mining of Specific-Domain Ontology Components
Authors: J. R. Pulido, M. A. Aréchiga, M. E. Espinosa
Venue: Proceedings of the OTM Confederated International Workshops and Posters on On the Move to Meaningful Internet Systems: 2008 Workshops: ADI, AWeSoMe, COMBEK, EI2N, IWSSA, MONET, OnToContent + QSI, ORM, PerSys, RDDS, SEMELS, and SWWS (2008)

This paper describes an approach for eliciting ontology components by using knowledge maps. The knowledge contained in a particular domain, any kind of text digital archive, is portrayed by assembling and displaying its ontology components.
Explorative studies on multimodal interaction in a PDA- and desktop-based scenario
Authors: Andreas Ratzka
Venue: Proceedings of the 10th international conference on Multimodal interfaces (2008)

This paper presents two explorative case studies on multimodal interaction. Goal of this work is to find and underpin design recommendations to provide well proven decision support across all phases of the usability engineering lifecycle [1]. During this work, user interface patterns for multimodal interaction were identified [2, 3]. These patterns are closely related to other user interface patterns [4, 5, 6]. Two empirical case studies, one using a Wizard of Oz setting and another one using a stand-alone prototype linked to a speech recognition engine [7] were conducted to assess the acceptance of resulting interaction styles. Although the prototypes applied as well those interface patterns that increase usability by means of traditional interaction techniques and thus compete with multimodal interaction styles, multimodal interaction was preferred by most of the users.
Non-Invasive Intracranial Pulse Wave Monitoring
Authors: Arminas Ragauskas, Gediminas Daubaris, Vytautas Petkus, Romanas Chomskis, Renaldas Raisutis, Vytautas Deksnys, Jonas Guzaitis, Gintautas Lengvinas, Vaidas Matijosaitis
Venue: Informatica (2008)

Non-invasive physiological monitors are important subsystems of intensive care informatic systems. New innovative information methods and technology are presented for non-invasive human brain volumetric pulse wave physiological monitoring. Experimental study of a new, non-invasive ultrasonic intracranial pulse wave monitoring technology show the reactions of non-invasively recorded intracranial blood volume pulse waves (IBVPW) on healthy volunteers in different human body positions. A group of 13 healthy volunteers was studied. Body posture caused IBVPW, subwaves changes, &Delta;P2 = 18% and &Delta;P3 = 11%. The value of the IBVPW amplitude's ratio in supine and upright positions was 1.55&thinsp;&plusmn;&thinsp;0.61.
Winner Price Monotonicity for Approximated Combinatorial Auctions
Authors: Naoki Fukuta, Takayuki Ito
Venue: Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 03 (2008)

Combinatorial auctions are suitable mechanisms for efficient allocation of set of items for self-interested attendees such as software agents. Since optimal winner determination problem of combinatorial auctions is NP-hard, much work focuses on tackling the computational costs for winner determination. Since it is an important issue to guarantee the quality of approximated results, we have proposed desirable properties for such approximation algorithms. In this paper, we analyze the advantages and side-effects of preserving winner price monotonicity, one of our proposed desirable properties for approximation algorithms of combinatorial auctions.
A framework for GPU-based application-independent 3D interactions
Authors: Harlen Costa Batagelo, Shin-Ting Wu
Venue: The Visual Computer: International Journal of Computer Graphics (2008)

Direct manipulation using pointing devices commonly relies on basic interaction tasks such as selection and precise cursor positioning. Traditionally, such tasks use geometric attributes computed on the basis of application-dependent intersection algorithms on the CPU. However, with the recent ability of using GPUs to perform geometry modeling tasks and even to create new primitives on-the-fly, geometric attributes computed on the CPU are often invalid. We analyze a new paradigm for correctly computing such attributes based on providing, for each pixel of the rendered models, application-defined data and elements of discrete differential geometry computed solely on the GPU. We validate this by showing how many direct manipulation tasks presented in the literature require only these data, and present an interaction framework that exploits such paradigm. Implementation results are presented.
Feel-good touch: finding the most pleasant tactile feedback for a mobile touch screen button
Authors: Emilia Koskinen, Topi Kaaresoja, Pauli Laitinen
Venue: Proceedings of the 10th international conference on Multimodal interfaces (2008)

Earlier research has shown the benefits of tactile feedback for touch screen widgets in all metrics: performance, usability and user experience. In our current research the goal was to go deeper in understanding the characteristics of a tactile click for virtual buttons. More specifically we wanted to find a tactile click which is the most pleasant to use with a finger. We used two actuator solutions in a small mobile touch screen: piezo actuators or a standard vibration motor. We conducted three experiments: The first and second experiments aimed to find the most pleasant tactile feedback done with the piezo actuators or a vibration motor, respectively, and the third one combined and compared the results from the first two experiments. The results from the first two experiments showed significant differences for the perceived pleasantness of the tactile clicks, and we used these most pleasant clicks in the comparison experiment in addition to the condition with no tactile feedback. Our findings confirmed results from earlier studies showing that tactile feedback is superior to a nontactile condition when virtual buttons are used with the finger regardless of the technology behind the tactile feedback. Another finding suggests that the users perceived the feedback done with piezo actuators slightly more pleasant than the vibration motor based feedback, although not statistically significantly. These results indicate that it is possible to modify the characteristics of the virtual button tactile clicks towards the most pleasant ones, and on the other hand this knowledge can help designers to create better touch screen virtual buttons and keyboards.
Multi-sensor data fusion and comparison of total column ozone
Authors: Mohan Nirala
Venue: International Journal of Remote Sensing (2008)

With many remote-sensing instruments onboard satellites exploring the Earth's atmosphere, most data are processed to gridded daily maps. However, differences in the original spatial, temporal, and spectral resolution—as well as format, structure, and temporal and spatial coverage—make the data merging, or fusion, difficult. NASA Goddard Earth Sciences Data and Information Services Center (GES-DISC) has archived several data products for various sensors in different formats, structures, and multi-temporal and spatial scales for ocean, land, and atmosphere. In this investigation using Earth science data sets from multiple sources, an attempt was made to develop an optimal technique to merge the atmospheric products and provide interactive, online analysis tools for the user community. The merged/fused measurements provide a more comprehensive view of the atmosphere and improve coverage and accuracy, compared with a single instrument dataset. This paper describes ways of merging/fusing several NASA Earth Observing Systems (EOS) remote-sensing datasets available at GES-DISC. The applicability of various methods was investigated for merging total column ozone to implement these methods into Giovanni, the online interactive analysis tool developed by GES-DISC. Ozone data fusion of MODerate resolution Imaging Spectrometer (MODIS) Terra and Aqua Level-3 daily data sets was conducted, and the results were found to provide better coverage. Weighted averaging of Terra and Aqua data sets, with the consequent interpolation through the remaining gaps using Optimal Interpolation (OI), also was conducted and found to produce better results. Ozone Monitoring Instrument (OMI) total column ozone is reliable and provides better results than Atmospheric Infrared Sounder (AIRS) and MODIS. However, the agreement among these instruments is reasonable. The correlation is high (0.88) between OMI and AIRS total column ozone, while the correlation between OMI and MODIS Terra/Aqua fused total column ozone is 0.79.
Confidence interval approach to feature re-weighting
Authors: Robert S. Lee, Chin-Wan Chung, Seok-Lyong Lee, Sang-Hee Kim
Venue: Multimedia Tools and Applications (2008)

Relevance feedback is commonly incorporated into content-based image retrieval systems with the objective of improving retrieval accuracy via user feedback. One effective method for improving retrieval performance is to perform feature re-weighting based on the obtained feedback. Previous approaches to feature re-weighting via relevance feedback assume the feature data for images can be represented in fixed-length vectors. However, many approaches are invalidated with the recent development of features that cannot be represented in fixed-length vectors. In addition, previous approaches use only the information from the set of images returned in the latest query result for feature re-weighting. In this paper, we propose a feature re-weighting approach that places no restriction on the representation of feature data and utilizes the aggregate set of images returned over the iterations of retrieval to obtain feature re-weighting information. The approach analyzes the feature distances calculated between the query image and the resulting set of images to approximate the feature distances for the entire set of images in the database. Two-sided confidence intervals are used with the distances to obtain the information for feature re-weighting. There is no restriction on how the distances are calculated for each feature. This provides freedom for how the feature representations are structured. The experimental results show the effectiveness of the proposed approach and in comparisons with other work, it is shown that our approach outperforms previous work.
Finding rectilinear least cost paths in the presence of convex polygonal congested regions
Authors: Avijit Sarkar, Rajan Batta, Rakesh Nagi
Venue: Computers and Operations Research (2009)

This paper considers the problem of finding the least cost rectilinear distance path in the presence of convex polygonal congested regions. We demonstrate that there are a finite, though exponential number of potential staircase least cost paths between a specified pair of origin-destination points. An upper bound for the number of entry/exit points of a rectilinear path between two points specified a priori in the presence of a congested region is obtained. Based on this key finding, a ''memory-based probing algorithm'' is proposed for the problem and computational experience for various problem instances is reported. A special case where polynomial time solutions can be obtained has also been outlined.
Algebro-algorithmic aspects of completeness: Abstractions, biology, and ecology
Authors: G. E. Tseitlin
Venue: Cybernetics and Systems Analysis (2008)

Using means of the algebra of algorithmics, the relation between the well-known Godel and Post theorems is established. An approach to the description of actual subject domains is analyzed as applied to the following triad: abstraction, biology, and programming ecology. This approach is also actively developed in the West.
On the lower bound for a quadratic problem on the Stiefel manifold
Authors: O. A. Berezovskyi
Venue: Cybernetics and Systems Analysis (2008)

We study the problem of finding the global minimum of a homogeneous quadratic function of special kind over the Stiefel manifold. For two variants of this problem, a low bound is proposed that is the dual Lagrange bound in the quadratic statement obtained using a family of redundant restrictions. The dual bound is proved to be exact in the case where the problem is considered over Boolean variables.
Scalable parallel multiple recursive generators of large order
Authors: Lih-Yuan Deng, Huajiang Li, Jyh-Jen Horng Shiau
Venue: Parallel Computing (2009)

To speed up the process of performing a large statistical simulation study, it is natural and common to divide the large-scale simulation task into several relatively independent sub-tasks in a way that these sub-tasks can be handled by individual processors in parallel. To obtain a good overall simulation result by synthesizing results from these sub-tasks, it is crucial that good parallel random number generators are used. Thus, designing suitable and independent uniform random number generators for the sub-tasks has become a very important issue in large-scale parallel simulations. Two commonly used uniform random number generators, linear congruential generator (LCG) and multiple recursive generator (MRG), have served as backbone generators for some parallel random number generators constructed in the past. We will discuss some general construction methods. A systematic leapfrog method to automatically choose different multipliers for LCGs to have the maximum-period and a method to construct many maximum-period MRGs from a single MRG are available in the literature. In this paper, we propose to combine both approaches to generate different MRGs ''randomly'', quickly and automatically, while retaining the maximum-period property.