Matrix games with interval data

The conventional game theory is concerned with how rational individuals make decisions when they are faced with known payoffs. In the real world, sometimes the payoffs are not known and have to be estimated, and sometimes the payoffs are only approximately known. This paper develops a solution method for the two-person zero-sum game where the payoffs are imprecise and are represented by interval data. Since the payoffs are imprecise, the value of the game should be imprecise as well. A pair of two-level mathematical programs is formulated to obtain the upper bound and lower bound of the value of the game. Based on the duality theorem and by applying a variable substitution technique, the pair of two-level mathematical programs is transformed to a pair of ordinary one-level linear programs. Solving the pair of linear programs produces the interval of the value of the game. It is shown that the two players in the game have the same upper bound and lower bound for the value of the imprecise game. An example illustrates the whole idea and sheds some light on imprecise game.     

A knowledge-based decision support system to analyze the debris-flow problems at Chen-Yu-Lan River, Taiwan

Decision-making for the debris-flow management involves multiple decision-makers often with concerning geomorphological and hydraulic conditions. Spatial decision support systems (SDSS) can be developed to improve our understanding of the relations among the natural and socio-economic variables to the occurrence/non-occurrence samples of debris-flow. Accordingly, the goal of this study is to development a debris-flow decision support system to manage and monitor the debris-flows in Nan-Tou County, Taiwan. The present study, more specifically, combines a spatial information system with an advanced Data Mining technique to investigate the debris-flow problem. In the first stage, our spatial information system integrates remote sensing, DEM, and aerial photos as three different resources to generate our spatial database. Each of the geomorphological and hydraulic attributes are obtained automatically through our spatial database. Then, a Data Mining classifier (hybrid model of decision tree (D.T.) + support vector machine (S.V.M.)) will be used to analyze and resolve the classification of occurrence of debris-flow. The contribution of this study has found that watershed area and NDVI (Normalized Difference Vegetation Index) are the crucial factors governing debris-flow by means of decision tree analysis. Further, the performance of prediction accuracy on testing samples through support vector machine is 73% which could be helpful for us to have better understanding of debris-flow problem.     

Effects of auditory,haptic and visual feedback on performing gestures by gaze or by hand

Modern interaction techniques like non-intrusive gestures provide means for interacting with distant displays and smart objects without touching them. We were interested in the effects of feedback modality (auditory, haptic or visual) and its combined effect with input modality on user performance and experience in such interactions. Therefore, we conducted two exploratory experiments where numbers were entered, either by gaze or hand, using gestures composed of four stroke elements (up, down, left and right). In Experiment 1, a simple feedback was given on each stroke during the motor action of gesturing: an audible click, a haptic tap or a visual flash. In Experiment 2, a semantic feedback was given on the final gesture: the executed number was spoken, coded by haptic taps or shown as text. With simultaneous simple feedback in Experiment 1, performance with hand input was slower but more accurate than with gaze input. With semantic feedback in Experiment 2, however, hand input was only slower. Effects of feedback modality were of minor importance; nevertheless, semantic haptic feedback in Experiment 2 showed to be useless at least without extensive training. Error patterns differed between both input modes, but again not dependent on feedback modality. Taken together, the results show that in designing gestural systems, choosing a feedback modality can be given a low priority; it can be chosen according to the task, context and user preferences.     

Effect of plasma chemistry on the simulation of helium atmospheric-pressure plasmas

The effect on the selection of different plasma chemistries for simulating a typical dielectric barrier discharge (DBD) driven by quasi-pulsed power source (20 kHz) is investigated. The numerical simulation was performed by using the one-dimensional self-consistent fluid modeling solver. Our simulation result indicates that the computed temporal current density can be significantly improved by using a complex version of plasma chemistry module rather than the simple one and demonstrates an excellent agreement with the experimental data. The result suggests the metastable, excited and ionic helium related reaction channels, which are important in simulating a DBD, should be taken into account. Furthermore, it also reveals that the power absorption of ions is considerably higher than that of the electron.     

A time-efficient pattern reduction algorithm for k-means clustering

This paper presents an efficient algorithm, called pattern reduction (PR), for reducing the computation time of k-means and k-means-based clustering algorithms. The proposed algorithm works by compressing and removing at each iteration patterns that are unlikely to change their membership thereafter. Not only is the proposed algorithm simple and easy to implement, but it can also be applied to many other iterative clustering algorithms such as kernel-based and population-based clustering algorithms. Our experiments—from 2 to 1000 dimensions and 150 to 10,000,000 patterns—indicate that with a small loss of quality, the proposed algorithm can significantly reduce the computation time of all state-of-the-art clustering algorithms evaluated in this paper, especially for large and high-dimensional data sets.     

Static worksharing strategies for heterogeneous computers with unrecoverable interruptions

One has a large computational workload that is “divisible” (its constituent tasks’ granularity can be adjusted arbitrarily) and one has access to p remote computers that can assist in computing the workload. How can one best utilize the computers? Two features complicate this question. First, the remote computers may differ from one another in speed. Second, each remote computer is subject to interruptions of known likelihood that kill all work in progress on it. One wishes to orchestrate sharing the workload with the remote computers in a way that maximizes the expected amount of work completed. We deal with three versions of this problem. The simplest version ignores communication costs but allows computers to differ in speed (a heterogeneous set of computers). The other two versions account for communication costs, first with identical remote computers (a homogeneous set of computers), and then with computers that may differ in speed. We provide exact expressions for the optimal work expectation for all three versions of the problem - via explicit closed-form expressions for the first two versions, and via a recurrence that computes this optimal value for the last, most general version.     

A graph-theoretic model for optimizing queries involving methods

Traditional algorithms for optimizing the execution order of joins are no more valid when selections and projections involve methods and become very expensive operations. Selections and projections could be even more costly than joins such that they are pulled above joins, rather than pushed down in a query tree. In this paper, we take a fundamental look at how to approach query optimization from a top-down design perspective, rather than trying to force one model to fit into another. We present a graph model which is designed to characterize execution plans. Each edge and each vertex of the graph is assigned a weight to model execution plans. We also design algorithms that use these weights to optimize the execution order of operations. A cost model of these algorithms is developed. Experiments are conducted on the basis of this cost model. The results show that our algorithms are superior to similar work proposed in the literature. Received 20 April 1999 / Accepted 9 August 2000 Published online 20 April 2001     

Modeling and Retrieval of Moving Objects

This paper presents a symbolic formalism for modeling and retrieving video data via the moving objects contained in the video images. The model integrates the representations of individual moving objects in a scene with the time-varying relationships between them by incorporating both the notions of object tracks and temporal sequences of PIRs (projection interval relationships). The model is supported by a set of operations which form the basis of a moving object algebra. This algebra allows one to retrieve scenes and information from scenes by specifying both spatial and temporal properties of the objects involved. It also provides operations to create new scenes from existing ones. A prototype implementation is described which allows queries to be specified either via an animation sketch or using the moving object algebra.     

Classification of dissimilarity data with a new flexible Mahalanobis-like metric

Statistical pattern recognition traditionally relies on feature-based representation. For many applications, such vector representation is not available and we only possess proximity data (distance, dissimilarity, similarity, ranks, etc.). In this paper, we consider a particular point of view on discriminant analysis from dissimilarity data. Our approach is inspired by the Gaussian classifier and we defined decision rules to mimic the behavior of a linear or a quadratic classifier. The number of parameters is limited (two per class). Numerical experiments on artificial and real data show interesting behavior compared to Support Vector Machines and to kNN classifier: (a) lower or equivalent error rate, (b) equivalent CPU time, (c) more robustness with sparse dissimilarity data.     

Identification of the female-produced sex pheromone of the scarab beetle,Hoplia equina

Hoplia equina LeConte (Coleoptera: Scarabaeidae: Melolonthinae) is a beetle pest of cranberry beds in Massachusetts. Larvae feed on the roots of the cranberry plant, reducing yield as well as vine density. The female sex pheromone was identified as 2-tetradecanone. There were eight compounds found in the airborne volatiles collected from females that elicited antennal responses from males. Of the eight compounds tested (nonanal, decanal, dodecanal, 2-dodecanone, 2-tridecanone, 2-tetradecanone, 2-pentadecanone, and 2-hexadecanone), 2-tetradecanone was the only one that attracted male beetles in the field. Combining any of the other seven antennally active compounds with 2-tetradecanone did not increase male capture.