Soft-computing-based emotional expression mechanism for game of computer Go The game of Go is considered one of the most complicated games in the world. One Go game is divided into three stages: the opening, the middle, and the ending stages. Millions of people regularly play Go in countries around the world. The game is played by two players. One is White and another is Black. The players alternate placing one of their stones on an empty intersection of a square grid-patterned game board. The player with more territory wins the game. This paper proposes a soft-computing-based emotional expression mechanism and applies it to the game of computer Go to make Go beginners enjoy watching Go game and keep their tension on the game. First, the knowledge base and rule base of the proposed mechanism are defined by following the standards of the fuzzy markup language. The soft-computing mechanism for Go regional alarm level is responsible for showing the inferred regional alarm level to Go beginners. Based on the inferred board situation, the fuzzy inference mechanisms for emotional pleasure and arousal are responsible for inferring the pleasure degree and arousal degree, respectively. An emotional expression mapping mechanism maps the inferred degree of pleasure and degree of arousal into the emotional expression of the eye robot. The protocol transmission mechanism finally sends the pre-defined protocol to the eye robot via universal serial bus interface to make the eye robot express its emotional motion. From the experimental results, it shows that the eye robot can support Go beginners to have fun and retain their tension while watching or playing a game of Go.

O B I O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

fuzzy markup language
computer go
emotional expression

soft-computing
ontology
fuzzy inference mechanism


Business performance forecasting of convenience store based on enhanced fuzzy neural network Reliable business performance forecasting of convenience store (CVS) can not only help in making the correct local selection decision but also in decreasing the store cost and thereby enlarging the profit significantly. Therefore, the main aim of this paper is to design an enhanced fuzzy neural network (EFNN)-based predictor to forecast the business performance of CVS. Without considering relevant domain knowledge, traditional fuzzy neural networks suffer from the problem of low accuracy of forecasting unseen examples. Moreover, traditional fuzzy neural networks have to turn weights with a kind of time-consuming gradient steepest descent training algorithm. Considering the relationship between the evaluation factors globally, we devise the EFNN which assigns connection weights based on the expert domain knowledge without painstakingly and repeatedly turning them. Furthermore, by generating and refining the activation function based on genetic algorithm, our EFNN can provide comprehensive and accurate activation functions and fit a wider range of nonlinear models. By experimenting our methods with several benchmark methods, the proposed methods are found to have an optimal accuracy in forecasting the business performance of CVS with a permanent good performance.

O O O O B I O O O B I I O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

fuzzy neural network
forecast
convenience store
genetic algorithm


Advanced copy propagation for arrays The focus of this paper is on a data flow-transformation called advanced copy propagation. After an array is assigned, we can, under certain conditions, replace a read from this array by-the righthand side of the assignment. If so, the intermediate assignment can be skipped. In case it becomes dead code, it can be eliminated. Where necessary we distinguish between the different elements of arrays as well as the different runtime instances of statements, allowing us to do propagation over global loop and condition scopes. We have formalized two basic operations: non-recursive propagation that operates on two statements and recursive propagation that operates on one statement. A global algorithm uses these two operations to do propagation on code involving any number of statements. Running our prototype implementation on some multimedia kernels shows that we can get a decrease in memory acesses between 22% and 43%.

O B I O B O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

algorithms
languages
optimization
single assignment


DETERMINATES OF EIS ACCEPTANCE The large number of organizations developing executive information systems (EISs) highlights the importance of understanding why executives use these systems. This survey investigated how ease of use, the number of features, and support staff characteristics are related to EIS acceptance. Acceptance was measured by the percentage of the targeted users who incorporate the EIS into their daily routine. High usage was not associated with ease of use, a large number of features, or the staff being physically close to the users. However, rapid development time was positively correlated with acceptance. Higher numbers of available features were associated with larger support staffs and larger user groups. The number of users was positively correlated with both staff size and EIS age. Existing EISs place a stronger emphasis on reporting internal rather than external data.

O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

information systems features
information systems support


A model of smooth pursuit in primates based on learning the target dynamics While the predictive nature of the primate smooth pursuit system has been evident through several behavioural and neurophysiological experiments, few models have attempted to explain these results comprehensively. The model we propose in this paper in line with previous models employing optimal control theory; however, we hypothesize two new issues: (1) the medical superior temporal (MST) area in the cerebral cortex implements a recurrent neural network (RNN) in order to predict the current or future target velocity, and (2) a forward model of the target motion is acquired by on-line learning. We use stimulation studies to demonstrate how our new model supports these hypotheses.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O

oculomotor control
medial superior temporal (mst) area
predictive visual tracking
on-line fast learning


Forecasting Internet Traffic by Using Seasonal GARCH Models With the rapid growth of internet traffic, accurate and reliable prediction of internet traffic has been a key issue in network management and planning. This paper proposes an autoregressive-generalized autoregressive conditional heteroscedasticity (AR-GARCH) error model for forecasting internet traffic and evaluates its performance by comparing it with seasonal autoregressive integrated moving average (ARIMA) models in terms of root mean square error (RMSE) criterion. The results indicated that the seasonal AR-GARCH models outperformed the seasonal ARIMA models in terms of forecasting accuracy with respect to the RMSE criterion.

O B I O O O O O O O O O O B I O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

seasonal autoregressive-generalized autoregressive conditional heteroscedasticity (ar-garch)

seasonal autoregressive integrated moving average (arima)


incremental processing applied to steinberg's placement procedure In this paper we indicate how the concept of incremental processing was applied to Steinberg's procedure for the placement of modules on aboard. In this procedure Munkres' algorithm is repeatedly used to solve linear assignment problems. We consider each assignment problem (matrix) to represent an incremental change with respect to the previous one, and present new techniques for solving a new assignment problem given the results of the previous one. We refer to this new algorithm as the Incremental Steinberg Algorithm. Experimental results indicate that this new algorithm produces equally good results as the classical technique but at a substantial reduction in CPU time.

B O O O O B O O O B O O O O B O B O O O O O O O O B O O O O O O O O B O O O O O O B O O O O B O O O O O B B O O O O O O O O O O O O O O B O O O O O O O O O O O O O B O O B O B O O O O O O B O O O O O O O O O O O O B O O O

reduction concept placement algorithm paper change assignment incremental


Turn-taking cues in task-oriented dialogue As interactive voice response systems become more prevalent and provide increasingly more complex functionality, it becomes clear that the challenges facing such systems are not solely in their synthesis and recognition capabilities. Issues such as the coordination of turn exchanges between system and user also play an important role in system usability. In particular, both systems and users have difficulty determining when the other is taking or relinquishing the turn. In this paper, we seek to identify turn-taking cues correlated with human-human turn exchanges which are automatically computable. We compare the presence of potential prosodic, acoustic, and lexico-syntactic turn-yielding cues in prosodic phrases preceding turn changes (SMOOTH SWITCHES) vs. turn retentions (flows) vs. BACKCHANNELS in the Columbia Games Corpus, a large corpus of task-oriented dialogues, to determine which features reliably distinguish between these three. We identify seven turn-yielding cues, all of which can be extracted automatically, for future use in turn generation and recognition in interactive voice response (IVR) systems. Testing Duncan's (1972) hypothesis that these turn-yielding cues are linearly correlated with the occurrence of turn-taking attempts, we further demonstrate that, the greater the number of turn-yielding cues that are present, the greater the likelihood that a turn change will occur. We also identify six cues that precede backchannels, which will also be useful for IVR backchannel generation and recognition; these cues correlate with backchannel occurrence in a quadratic manner. We find similar results for overlapping and for non-overlapping speech. (C) 2010 Elsevier Ltd. All rights reserved.

O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


The complexity of planarity testing We clarify the computational complexity of planarity testing, by showing that planarity testing is hard for L, and lies in SL. This nearly settles the question, since it is widely conjectured that L = SL. The upper bound of SL matches the lower bound of L in the context of (non-uniform) circuit complexity, since L/poly is equal to SL/poly. Similarly, we show that a planar embedding, when one exists, can be found in FLSL. Previously, these problems were known to reside in the complexity class AC(1), via the O(log n) time CRCW-PRAM algorithm of Ramachandran and Reif, although planarity checking for degree-three graphs had been shown to be in SL. (C) 2003 Elsevier Inc. All rights reserved.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Dynamic transitions in pure Ising magnets under pulsed and oscillating fields Responses of pure Ising systems to time-dependent external magnetic fields, like pulsed and oscillating fields, are discussed and compared here. Because of the two time scales involved, namely the thermodynamic relaxation time of the system and the pulse width or the time period of the external field, dynamically broken symmetric phases appear spontaneously when both become comparable. A particularly simple case is that of an Ising ferromagnet below its static critical temperature, when it is perturbed for a short duration by a pulsed magnetic field competing with the existing order in the system. If the field strength and duration is more than the threshold (dependent on the temperature), the system, and consequently the magnetization, switches from one minimum to the other of the static free energy. This magnetization reversal transition here shows intriguing dynamic transition behaviour, similar to that for oscillating fields. Monte Carlo studies for such dynamic transitions are discussed and compared with the mean field results for the same and the Monte Carlo results for the oscillating field case. In particular, we discuss the Monte Carlo results for the fluctuations and their growth behaviour near this magnetization reversal (dynamic) transition point. (C) 2002 Elsevier Science B.V. All rights reserved.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

ising model
ferromagnets
dynamic phase transitions
glauber dynamics
monte carlo simulations
critical fluctuations


Reconfiguration, of impulse-voltage generator for conducting standard lightning tests - A comparative investigation Purpose - Loading the impulse-voltage generator by test object can affect the generated voltage waveform. It is well known that reconfiguring these generators by changing the high-voltage resistors and capacitors, and even the connecting leads in the laboratory is too bulky and time consuming, especially for large test objects. The objective of this paper is to introduce a new computerized method to reconfigure the impulse-voltage generator in order to conduct the standard tests on any type of objects. Design/methodology/approach - A modified algorithm is introduced for solving the generalized equivalent circuit of impulse-voltage generators under any loading condition. Findings - The high efficiency of this algorithm has been verified by experimental investigations on different reduced- and full-scale loads, namely, resistive, inductive, capacitive or mixed. For reduced-scale loads up to a few kV, a single-stage impulse-voltage generator is used. While for full-scale loads, a multi-stage impulse-voltage generator is reconfigured to test a 33 kV neutral earthing reactor. The experimental responses are compared with the numerical results of the proposed program and checked out by the PSCAD simulation. Good agreement has been found between all of them. Practical implications - Knowing the exact value of the test object, some of the generator components and the connecting lead inductances is a must to apply this method. Originality/value - Reconfiguring of impulse-voltage generators by changing the high-voltage resistors and capacitors, and even the connecting leads in the laboratory is too bulky and time consuming, especially for large test objects. This work will certainly save time and efforts if it is applied correctly in high-voltage laboratories.

O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


A Robust Speech Communication into Smart Info-Media System This paper introduces our developed noise robust speech communication techniques and describes its implementation to a smart info-media system, i.e., a small robot. Our designed speech communication system consists of automatic speech detection, recognition, and rejection. By using automatic speech detection and recognition, an observed speech waveform can be recognized without a manual trigger. In addition, using speech rejection, this system only accepts registered speech phrases and rejects any other words. In other words, although an arbitrary input speech waveform can be fed into this system and recognized, the system responds only to the registered speech phrases. The developed noise robust speech processing can reduce various noises in many environments. In addition to the design of noise robust speech recognition, the LSI design of this system has been introduced. By using the design of speech recognition application specific IC (ASIC), we can simultaneously realize low power consumption and real-time processing. This paper describes the LSI architecture of this system and its performances in some field experiments. In terms of current speech recognition accuracy, the system can realize 85-99% under 0-20 dB SNR and echo environments.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

robust speech recognition
speech rejection
asic

smart info-media system
voice activity detection
low power consumption design


Do too many cooks spoil the broth? Using the number of developers to enhance defect prediction models Fault prediction by negative binomial regression models is shown to be effective for four large production software systems from industry. A model developed originally with data from systems with regularly scheduled releases was successfully adapted to a system without releases to identify 20% of that systems files that contained 75% of the faults. A model with a pre-specified set of variables derived from earlier research was applied to three additional systems, and proved capable of identifying averages of 81, 94 and 76% of the faults in those systems. A primary focus of this paper is to investigate the impact on predictive accuracy of using data about the number of developers who access individual code units. For each system, including the cumulative number of developers who had previously modified a file yielded no more than a modest improvement in predictive accuracy. We conclude that while many factors can spoil the broth (lead to the release of software with too many defects), the number of developers is not a major influence.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

software faults
negative binomial model
empirical study
developer counts


From cognition to docition: The teaching radio paradigm for distributed & autonomous deployments We advocate for a novel communication paradigm of docition which facilitates distributed and autonomous networking at minimal control overhead and maximal performance. We consider that the nodes in foreseen networks are intelligent radios able to learn and thus self-adapt to prior set performance targets within a given surrounding environment. We briefly review the state-of-the-art of purely distributed learning algorithms, and we identify the most appropriate approaches allowing for self-adaptation to particular system dynamics. In such distributed settings, however, the learning is typically complex. imprecise and slow due to mutually-impacting decisions resulting in non-stationarities. The docitive paradigm proposes a timely solution which encourages more knowledgeable nodes to teach surrounding nodes to speed up the development of their cognitive state. We advocate for different degrees of docition, such as teaching at start-up or run-time, and demonstrate that this improves the convergence speed and precision of known cognitive algorithms. We evaluate the docitive paradigm in the context of a femtocell network modeled as a multi-agent system, where the agents are the femto access points, implementing a realtime multi-agent reinforcement learning technique known as decentralized Q-learning. We propose different docitive algorithms and we show their superiority to the well know paradigm of independent learning (C) 2010 Elsevier B.V. All rights reserved

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

cognitive radio
aggregated interference
multi-agent system
decentralized q-learning
docitive learning


Graph-based analysis of human transfer learning using a game testbed The ability to transfer knowledge learned in one environment in order to improve performance in a different environment is one of the hallmarks of human intelligence. Insights into human transfer learning help us to design computer-based agents that can better adapt to new environments without the need for substantial reprogramming. In this paper, we study the transfer of knowledge by humans playing various scenarios in a graphically realistic urban setting that are specifically designed to test various levels of transfer. We determine the amount and type of transfer that is being performed based on the performance of trained and untrained human players. In addition, we use a graph-based relational learning algorithm to extract patterns from player graphs. These analyses reveal that indeed humans are transferring knowledge from one set of games to another and the amount and type of transfer varies according to player experience and scenario complexity. The results of this analysis help us understand the nature of human transfer in such environments and shed light on how we might endow computer-based agents with similar capabilities. The game simulator and human data collection also represent a significant testbed in which other AI capabilities can be tested and compared to human performance.

O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


A transpose-free quasi-minimal residual variant of the CORS method for solving non-Hermitian linear systems Recently, the conjugate A-orthogonal residual squared (CORS) method is often competitive and superior to other Krylov subspace methods for solving complex non-Hermitian linear systems from many realistic problems. However, like the conjugate gradient squared (CGS) method, the CORS method often exhibits irregular convergence behavior with wild oscillations in the residual norm. To try and remedy this problem, we develop a transpose-free quasi-minimal residual (TFQMR) variant of the CORS method, which leads to smooth convergence curves with a convergence rate similar to the CORS method. We also give convergence results for this new method. Finally, numerical examples are reported to illustrate the effectiveness of the proposed method.

O O O O O O O B I O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O

krylov subspace method
tfqmr method
complex non-hermitian linear systems


Control complexity in Bucklin and fallback voting: An experimental analysis ? Electoral control models ways of changing the outcome of an election via adding, deleting, or partitioning candidates or voters. We tackle NP-hard control problems for Bucklin and fallback elections in an experimental setting. While NP-hard manipulation problems have been challenged experimentally, this is the first such study for electoral control. Our experiments allow a more fine-grained analysis and comparison of the computational hardness of control problems.

B I O O O B I O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

control complexity
fallback voting
experimental analysis

computational social choice
bucklin voting
election systems


Empirical-Statistics Analysis for Zero-Failure GaAs MMICs Life Testing Data GaAs MMICs (Monolithic Microwave Integrated Circuits) reliability is a critical part of the overall reliability of the thermal solution in semiconductor devices. With MMICs reliability improved, GaAs MMICs failure rates will reach levels which are impractical to measure with conventional methods in the near future. This letter proposes a methodology to predict the GaAs MMICs reliability by combining empirical and statistical methods based on zero-failure GaAs MMICs life testing data. Besides, we investigate the effect of accelerated factors on MMICs degradation and make a comparison between the Weibull and lognormal distributions. The method has been used in the reliability evaluation of GaAs MMICs successfully.

O O O O O B O O O O B O O O O B O O O O O O O B O O O O O O O O B B O O B B O O O O O O O O O O O O O O O O O O O O O O O O O B B O O O O O O O O O O B O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O B O O O B O

accelerated testing
weibull distribution
lognormal distribution


On the Role of Interferon Regulatory Factors in HIV-1 Replication Interferons (IFNs) are pleiotropic cytokines that possess several biological activities and play a central role in basic and applied research as mediators of antiviral and antigrowth responses, modulators of the immune system, and therapeutic agents against viral diseases and cancer. Interferon regulatory factors (IRFs) have been identified together with signal transducers and activators of transcription (STAT) from studies on the type I IFN as well as IFN-stimulated (ISG) gene regulation and signaling. IRFs constitute a family of transcriptional activators and repressors implicated in multiple biological processes including regulation of immune responses and host defence, cytokine signaling, cell growth regulation, and hematopoietic development. All members share a well-conserved DNA binding domain at the NH2-terminal region that recognizes similar DNA sequences, termed IRF element (IRF-E)/interferon-stimulated response element (ISRE), present on the promoter of target genes. Recently, a sequence homologous to the ISRE has been identified downstream from the 5? human immunodeficiency virus type 1 (HIV-1) long terminal repeat (LTR). This sequence is a binding site for IRF-1 and IRF-2. Here we briefly summarize the role of IRFs in the regulation of HIV-1 LTR transcriptional activity and virus replication. The overall effect of IRFs on HIV-1 replication will also be discussed in the context of strategies carried out by the virus to counteract the IFN-mediated host defences both in active replication and during the establishment of viral latency.

O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O B I O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

transcription factors
gene expression
tat
apoptosis
viral escape


Extending SD-Core for Ontology-based Data Integration This paper describes the main elements of a functional platform for building Semantic Web Applications, the Semantic Directory (additional information can be found at http://khaos.uma.es/SD-Core). A Semantic Directory provides a resource directory, in which web resources are registered and their semantics published. Using the Semantic Directories we provide a solution for publishing the semantics of resources, and interoperating them with some other applications in the same or different domains. The main idea behind this proposal is to help developers build Semantic Web applications by providing them with functional components for this task. This paper also describes some applications that have been developed using an SD-Core extension: SD-Data. Then, we describe the instantiation of the Khaos Ontology-based Mediation Framework (KOMF) in the Systems Biology domain. This framework provides an architecture that enables the research on the development of ontology-based mediators. Thus, an ontology-based mediator has been produced that has demonstrated its utility in two applications developed in the Amine System Project using the SD-Data for registering semantics: AMMO-Prot and SBMM Assistant. The use of ontologies is limited in the current version of the mediator, but its development as a framework enables the implementation of improvements based on the use of reasoning.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


geographic human-computer interaction Geography is playing an increasingly important role in areas of HCI ranging from social computing to natural user interfaces. At the same time, research in geography has focused more and more on technology-mediated interaction with spatiotemporal phenomena. Despite the growing popularity of this geographic human-computer interaction (GeoHCI) in both fields, there have been few opportunities for GeoHCI knowledge sharing, knowledge creation or community building in either discipline, let alone between them. The goal of this workshop is thus two-fold. First, we will seek to sum up the state of GeoHCI knowledge and address GeoHCI core issues by inviting prominent researchers in the space to share and discuss the most important high-level findings from their work. Second, through our interdisciplinary organizing committee, we will recruit participants from both fields, with the goal of laying the groundwork for a community that works across intra- and interdisciplinary boundaries.

O O O B O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

distance
gps
geo
location-based systems (lbs)
spatio-temporal
maps
location


Test Data Compression Using Efficient Bitmask and Dictionary Selection Methods Higher circuit densities in system-on-chip (SOC) designs have led to drastic increase in test data volume. Larger test data size demands not only higher memory requirements, but also an increase in testing time. Test data compression addresses this problem by reducing the test data volume without affecting the overall system performance. This paper proposes a novel test data compression technique using bitmasks which provides a substantial improvement in the compression efficiency without introducing any additional decompression penalty. The major contributions of this paper are as follows: 1) it develops an efficient bitmask selection technique for test data in order to create maximum matching patterns; 2) it develops an efficient dictionary selection method which takes into account the bitmask based compression; and 3) it proposes a test compression technique using efficient dictionary and bitmask selection to significantly reduce the testing time and memory requirements. We have applied our method on various test data sets and compared our results with other existing test compression techniques. Our algorithm outperforms existing dictionary-based approaches by up to 30%, giving a best possible test compression of 92%.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O B I O O


Functional answer set programming In this paper we propose an extension of Answer Set Programming (ASP) to deal with (possibly partial) evaluable functions. To this aim, we start from the most general logical counterpart of ASP, Quantified Equilibrium Logic (QEL), and propose a variant QEL(F)(=) where the set of functions is partitioned into Herbrand functions (or constructors) and evaluable functions (or operations). We show how this extension has a direct connection to Scott's Logic of Existence, and introduce several useful derived operators, some of them directly borrowed from Scott's formalisation. Using this general framework for arbitrary theories, we proceed to focus on a syntactic subclass that corresponds to normal logic programs with evaluable functions and equality. We provide a translation of this class into function-free normal programs and consider a safety condition so that the resulting program is also safe, under the usual meaning in ASP. Finally, we also establish a formal comparison to Lin and Wang's approach (FASP) dealing with evaluable total functions.

O B I I O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

answer set programming
equilibrium logic

partial functions
functional logic programming


A New Method of Matrix Spectral Factorization A new algorithm of matrix spectral factorization is proposed which can be applied to compute an approximate spectral factor of any positive definite matrix function which satisfies the Paley-Wiener condition. (1)

O O O O O B I O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O


SeisPrho: An interactive computer program for processing and interpretation of high-resolution seismic reflection profiles ? SeisPrho is an interactive computer program for processing and interpreting high-resolution seismic reflection profiles developed using the Delphi/Kylix multiplatform programming environment. For this reason, it is available under Windows and Linux operating systems. The program allows the users to handle SEG-Y data files (and other non-standard formats) carrying out a processing sequence over the data to obtain, as a final result, bitmap images of seismic sections. Some basic algorithms are implemented, including filtering and deconvolution. However, the main feature of SeisPrho is its interactive graphic interface, which provides the user with several tools for interpreting the data, such as reflector picking and map digitizing. Moreover, the program allows importing and geo-referencing maps and seismic profiles in the form of digital images. Trace-by-trace analysis of seismic signal and sea-bottom reflectivity is also implemented, as well as other special functions such as compilation of time-slice maps from close-spaced grids of seismic lines. SeisPrho is distributed as public domain software for non-commercial purposes by the Marine Geology division of the Istituto di Scienze Marine (ISMAR-CNR). This paper is an introduction to the program and a preliminary guide to the users.

O O O O O O O O O O O B I O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O

seisprho seisprho
seismic processing
seismic interpretation
interactive mapping


Semantic Web support for the business-to-business e-commerce pre-contractual lifecycle If an e-services approach to electronic commerce is to become widespread, standardisation of ontologies, message content and message protocols will be necessary. In this paper, we present a lifecycle of a business-to-business (B2B) e-commerce interaction, and show how the Semantic Web can support a service description language that can be used throughout this lifecycle. DAML+OIL is a sufficiently expressive and flexible service description language to be used not only in advertisements, but also in matchmaking queries, negotiation proposals and agreements. We also identify which operations must be carried out on this description language if the B2B lifecycle is to be fully supported. We do not propose specific standard protocols, but instead argue that our operators are able to support a wide variety of interaction protocols, and so will be fundamental irrespective of which protocols are finally adopted.

B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O B I O O O O O O O O O O O O O O O B I O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

semantic web
matchmaking
service description

e-commerce
automated negotiation
daml+oil


The Instruction-Set Extension Problem: A Survey The extension of a given instruction-set with specialized instructions has become a common technique used to speed up the execution of applications. By identifying computationally intensive portions of an application to be partitioned in segments of code to execute in software and segments of code to execute in hardware, the execution of an application can be considerably speeded up. Each segment of code implemented in hardware can then be seen as a specialized application-specific instruction extending a given instruction-set. Although a number of approaches exist in literature proposing different methodologies to customize an instruction-set, the description of the problem consists only of sporadic comparisons limited to isolated problems. This survey presents a unique detailed description of the problem and provides an exhaustive overview of the research in the past years in instruction-set extension. This article presents a thorough analysis of the issues involved during the customization of an instruction-set by means of a set of specialized application-specific instructions. The investigation of the problem covers both instruction generation and instruction selection and different kinds of customizations are analyzed in a great detail.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O B I O B I O O O O O O O O O O O

customization
instruction generation
instruction selection

design
instruction-set
instruction-set extension
hw/sw codesign
reconfigurable architecture


Automatic extraction of relevant video shots of specific actions exploiting Web data A novel method to automatically extract action video shots from the Web videos. Large-scale experiments with 100 human actions and 12 non-human actions. Exploiting action images helps enhance significantly performance. Employing human pose matching improves results of human actions.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

web video
web image
tag relevance
visualrank
spatio-temporal feature
pose estimation


Widening the scope of human factors safety assessment for decommissioning In the nuclear industry, throughout the lifecycle of a nuclear plant or facility, operations vary in the degree of their tractability. Commissioned facilities should be relatively predictable in their operations, whereas decommissioning operations by their nature tend to be less predictable because they are a transition from one state to another, where safety systems, structures, components, and people serving safety may all change. Of course, different operations or states will have different characteristics and varying safety requirements. In this paper, we argue that by accounting for operations according to their relative tractability for their given phase in the lifecycle of a facility, a more targeted approach to managing safety is possibleone that recognises that the less tractable operation relies on human adaptation and resilience to a greater degree than the more tractable operation. From the outset, the safety of a decommissioning operation may therefore require a thorough account of the human and organisational factors that will support or impair human adaptation and resilience. High Reliability Organisation theory may provide a useful framework to consider how to engineer resilience in decommissioning and other operations of a less tractable nature.

O O O O B I O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O


solution of algebraic riccati equations using the sum of roots This paper constructs an algebraic solution approach to the algebraic Riccati equation, an important equation in signal processing and control system design. Key features of the proposed approach are the exploitation of useful structures inherent in the problem and the avoidance of Grbner basis computation by generic algorithms. The approach extends the algebraic approach to polynomial spectral factorization by means of the Sum of Roots. The approach further finds an effective symbolic expression of the eigenvector of the associated Hamiltonian matrix in a simple way. An example is presented to demonstrate the proposed algorithm.

O O O O O O O B I I O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

polynomial spectral factorization
sum of roots
algebraic riccati equation


frame-layer rate control algorithm for multi-view video coding Rate control has not been well studied for multi-view video coding (MVC). We propose a rate control algorithm for MVC based on the quadratic rate-distortion model. We remodel the quadratic rate-distortion model for multi-view videos based on the type of each frame. In the frame level, the quantization parameters are set according to the parameters of the various kinds of image model which is set up through the analysis of the coded information. The experimental results show that the proposed scheme can allocate the bits and control the rate efficiently.

O B I O O O O O B I O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

rate-distortion model
bit-allocation
multi-view video coding


designing semantics-preserving cluster representatives for scientific input conditions In scientific domains, knowledge is often discovered from experiments by grouping or clustering them based on the similarity of their output. The causes of similarity are analyzed based on the input conditions characterizing a given type of output, i.e., a given cluster. This analysis helps in applications such as decision support in industry. Cluster representatives form at-a-glance depictions for such applications. Randomly selecting a set of conditions in a cluster as its representative is not sufficient since distinct combinations of inputs could lead to the same cluster. In this paper, an approach called DesCond is proposed to design semantics-preserving cluster representatives for scientific input conditions. We define a notion of distance for conditions to capture semantics based on the types of their attributes and their relative importance. Using this distance, methods of building candidate cluster representatives with different levels of detail are proposed. Candidates are compared using the DesCond Encoding proposed in this paper that assesses their complexity and information loss, given user interests. The candidate with the lowest encoding for each cluster is returned as its designed representative. DesCond is evaluated with real data from Materials Science. Evaluation with domain expert interviews and formal user surveys shows that designed representatives consistently outperform randomly selected ones and different candidates suit different users.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

visual displays
domain knowledge
decision trees
distance metrics
post-processing
minimum description length


development of a container handling port simulation for demonstrating port related careers In a world where next day delivery is a small price to pay for tardy gift selection and names of delivery companies have become verbs, we tend to forget that the relatively slow, ship-based transportation of goods enclosed in 40 by 8 by 8.6 feet boxes accounts for 95 percent of all world cargo movement. In the Hampton Roads region ports alone, approximately 1.2 million containers were handled in 2008. The ability of the region's ports to operate efficiently and safely while managing this load depends largely on the availability of trained personnel. However, availability of a skilled workforce to satisfy current and future needs of the port industry is of concern. This concern stems from the fact that students lack awareness about port-related careers something that limits the number of students that pursue education and training that could lead to port-related employment. This need motivated the development of an interactive, multimedia software tool whose purpose is to showcase careers involved in the daily operation of a port, while simultaneously providing a detailed understanding of the breadth and complexity of modern port activities. This paper describes the simulation and various design decisions that were made in order to achieve the goals of educating students about port operations while also motivating them to pursue such careers.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

port careers
port visualization
agent based modeling
stem


influence of social setting on player experience of digital games Recent studies have indicated that playing games against other people is more fun and more exciting than playing alone. The current study aims to further explore the influence of social setting on player experience in digital games; in particular, it sets out to test the level of social presence of the co-player as a determinant of player experience. Dependent variables include a comprehensive self-report measure of player experience (the GEQ) and state aggression. The first results demonstrate significant differences in playing against a computer, a mediated other, or a co-located other on player experience in terms of positive affect, competence, tension and hostility.

O O B I O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O B I O O O O O O O O O O O O O B I O O O O O O O B I O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O

social setting
social presence
player experience

computer mediated communication
digital gaming
game experience


Geometrical regularization of displacement fields for histological image registration This article tackles the registration of 2-D biomedical images (histological sections, autoradiographs, cryosections, etc.). Our goal is to adequately match anatomical features of interest without inducing biologically improbable tissue distortions. We observe that the large variety of registration applications 3-D volume reconstruction, multimodal molecular mapping, etc. induce a no less diverse set of requirements in terms of accuracy and robustness. In turn, these directly translate into regularization constraints on the deformation model, which should ideally be specifiable by the user. We propose an adaptive regularization approach where the rigidity constraints are informed by the registration application at hand and whose support is controlled by the geometry of the images to be registered. For each site of a sparse lattice over which a displacement field has been computed, our algorithm estimates, in a robust fashion, a rigid or affine transformation within a circular neighbourhood cut to fit the local geometry around the site. We investigate the behaviour of this technique and discuss its sensitivity to the rigidity parameter.

O B O O O O O O B O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O B O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O B O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Building signature trees into OODBs Although object-oriented database systems offer more powerful modeling capability than relational database systems, their performance suffers from the increased complexity in the data model. Recently, a lot of research has focused on mitigating this problem by building indexes over single classes, class hierarchies, or nested object hierarchies. In this paper, we propose a new indexing method. It is based on the technique that employs signature files, but differs from the existing methods in two aspects: (1) all the signature files are organized into a hierarchy to filter irrelevant data as early as possible; (2) a signature file itself is stored as a tree structure (called a signature tree) to speed up signature scanning. Together with the concept of query signature hierarchies, this technique reduces the search space dramatically and, therefore, improves significantly the time complexity of query evaluation.

O B I O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I

oodbs
indexes
signature files
signature trees
query evaluation


Adapting user interfaces for gestural interaction with the flexible action and articulated skeleton toolkit We present the Flexible Action and Articulated Skeleton Toolkit (FAAST), a middleware software framework for integrating full-body interaction with virtual environments, video games, and other user interfaces. This toolkit provides a complete end-to-end solution that includes a graphical user interface for custom gesture creation, sensor configuration, skeletal tracking, action recognition, and a variety of output mechanisms to control third party applications, allowing virtually any PC application to be repurposed for gestural control even if it does not explicit support input from motion sensors. To facilitate intuitive and transparent gesture design, we define a syntax for representing human gestures using rule sets that correspond to the basic spatial and temporal components of an action. These individual rules form primitives that, although conceptually simple on their own, can be combined both simultaneously and in sequence to form sophisticated gestural interactions. In addition to presenting the system architecture and our approach for representing and designing gestural interactions, we also describe two case studies that evaluated the use of FAAST for controlling first-person video games and improving the accessibility of computing interfaces for individuals with motor impairments. Thus, this work represents an important step toward making gestural interaction more accessible for practitioners, researchers, and hobbyists alike.

O B I O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O B I O O B I O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

gesture
user interfaces
video games
middleware


Object extraction from a moving background using velocity estimation and optimal filter in the MixeD This paper addresses the problem to extract moving object from the moving background in the mixed domain (MixeD), which makes it possible to carry the filtering in one dimension, Since the velocities of moving object and background are necessary for moving object extraction, we first estimate the velocities based on the appropriate spatial frequency point selection method in the MixeD. Then an optimal filter used for 1-D signal filtering is designed. By filtering 1-D signals over all spatial frequencies, signals with certain velocity vector are extracted, while the extracted image is obtained by applying the 2-D IDFT to the filtered signals. The simulation results,;how that the method can extract moving object based both on the correctly estimated velocity and the proposed optimal 1-D filter.

B I O O O O O B I O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

velocity estimation
object extraction
optimal filter

linear trajectory signal
dynamic image processing


Robust static allocation of resources for independent tasks under makespan and dollar cost constraints Heterogeneous computing (HC) systems composed of interconnected machines with varied computational capabilities often operate in environments where there may be inaccuracies in the estimation of task execution times. Makespan (defined as the completion time for an entire set of tasks) is often the performance feature that needs to be optimized in such systems. Resource allocation is typically performed based on estimates of the computation time of each task on each class of machines. Hence, it is important that makespan be robust against errors in computation time estimates. In this research, the problem of finding a static mapping of tasks to maximize the robustness of makespan against the errors in task execution time estimates given an overall makespan constraint is studied. Two variations of this basic problem are considered: (1) where there is a given, fixed set of machines, (2) where an HC system is to be constructed from a set of machines within a dollar cost constraint. Six heuristic techniques for each of these variations of the problem are presented and evaluated.

O O O O O O O O O B O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O B O B O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O

heterogeneous computing
robustness
resource allocation
makespan
cost constraint


Visual Fatigue Reduction Based on Depth Adjustment for DIBR System A depth adjustment method for visual fatigue reduction for depth-image-based rendering (DIBR) system is proposed. One important aspect of the method is that no calibration parameters are needed for adjustment. By analyzing 3D image warping, the perceived depth is expressed as a function of three adjustable parameters: virtual view number, scale factor and depth value of zero parallax setting (ZPS) plane. Adjusting these three parameters according to the proposed parameter modification algorithm when performing 3D image warping can effectively change the perceived depth of stereo pairs generated in DIBR system. As the depth adjustment is performed in simple 3D image warping equations, the proposed method is facilitative for hardware implementation. Experimental results show that the proposed depth adjustment method provides an improvement in visual comfort of stereo pairs as well as generating comfortable stereoscopic images with different perceived depths that people desire.

B I O O O B I O O O O B I O O B I O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O B I O O O O B I I O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O

depth adjustment
3d image warping
visual fatigue


Techniques for leakage energy reduction in deep submicrometer cache memories The techniques known in literature for the design of SRAM structures with low standby leakage typically exploit an additional operation mode, named the sleep mode or the standby mode. In this paper, existing low leakage SRAM structures are analyzed by several SPEC2000 benchmarks. As expected, the examined SRAM architectures have static power consumption lower than the conventional 6-T SRAM cell. However, the additional activities performed to enter and to exit the sleep mode also lead to higher dynamic energy. Our study demonstrates that, due to this, the overall energy consumption achieved by the known low-leakage techniques is greater than the conventional approach. In the second part of this paper, a novel low-leakage SRAM cell is presented. The proposed structure establishes when to enter and to exit the sleep mode, on the basis of the data stored in it, without introducing time and energy penalties with respect to the conventional 6-T cell. The new SRAM structure was realized using the UMC 0.18-mu m, 1.8-V, and the ST 90-nm 1-V CMOS technologies. Tests performed with a set of SPEC2000 benchmarks have shown that the proposed approach is actually energy efficient.

O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

cmos memory integrated circuits
low-power memories


Performance evaluation of mobile processes via abstract machines We use a structural operational semantics which drives us in inferring quantitative measures on system evolution. The transitions of the system are labeled and we assign rates to them by only looking at these labels. The rates reflect the possibly distributed architecture on which applications run. We then map transition systems to Markov chains, and performance evaluation is carried out using standard tools. As a working example, we compare the performance of a conventional uniprocessor with a prefetch pipeline machine. We also consider two case studies from the literature involving mobile computation to show that our framework is feasible.

B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

calculi for mobility
enhanced operational semantics
formal methodology
stochastic models


A change management framework for macroergonomic field research With the proliferation of macroergonomic field research, it is time to carefully examine how such research should be managed and implemented. We argue that the importance of attending to high-quality implementation of field research is equal to that of methodological rigor. One way to systematically manage the implementation process is to adopt a change management framework, wherein the research project is conceptualized as an instance of organization-level change. Consequently, principles for successful organization-level change from the literature on change management can be used to guide successful field research implementation. This paper briefly reviews that literature, deriving 30 principles of successful change management, covering topics such as political awareness, assembling the change team, generating buy-in, and management support. For each principle, corresponding suggestions for macroergonomic field research practice are presented. We urge other researchers to further develop and adopt frameworks that guide the implementation of field research.

O B I O O B I I O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O B I O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O

macroergonomic field research
research implementation
change management


GPS Estimation for Places of Interest From Social Users' Uploaded Photos Social media has become a very popular way for people to share their photos with friends. Because most of the social images are attached with GPS (geo-tags), a photo's GPS information can be estimated with the help of the large geo-tagged image set while using a visual searching based approach. This paper proposes an unsupervised image GPS location estimation approach with hierarchical global feature clustering and local feature refinement. It consists of two parts: an offline system and an online system. In the offline system, a hierarchical structure is constructed for a large-scale offline social image set with GPS information. Representative images are selected for each GPS location refined cluster, and an inverted file structure is proposed. In the online system, when given an input image, its GPS information can be estimated by hierarchical global clusters selection and local feature refinement in the online system. Both the computational cost and GPS estimation performance demonstrates the effectiveness of the proposed hierarchical structure and inverted file structure in our approach.

B I O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O B I O B I I O O O

gps estimation
hierarchical structure
inverted file structure
social media


A high order spectral algorithm for elastic obstacle scattering in three dimensions In this paper we describe a high order spectral algorithm for solving the time-harmonic Navier equations in the exterior of a bounded obstacle in three space dimensions, with Dirichlet or Neumann boundary conditions. Our approach is based on combined-field boundary integral equation (CFIE) reformulations of the Navier equations. We extend the spectral method developed by Ganesh and Hawkins [20] for solving second kind boundary integral equations in electromagnetism to linear elasticity for solving CFIEs that commonly involve integral operators with a strongly singular or hypersingular kernel. The numerical scheme applies to boundaries which are globally parametrised by spherical coordinates. The algorithm has the interesting feature that it leads to solve linear systems with substantially fewer unknowns than with other existing fast methods. The computational performances of the proposed spectral algorithm are demonstrated using numerical examples for a variety of three-dimensional convex and non-convex smooth obstacles.

O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O B I O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

navier equations
boundary integral equations
spectral method


S&T publications output of Nepal: a quantitative analysis, 200110 This study analyses the research output of Nepal in S&T during 200110 on several parameters including its growth and country publications share in the worlds research output, country publications share in various subjects in the national and global context, pattern of research communication in core domestic and international journals, geographical distribution of publications, share of international collaborative publications at the national level as well as across subjects and characteristics of high productivity institutions, authors and cited papers. The Scopus Citation Database has been used to retrieve the publication data for 10years.

O O O O B O B I O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


sequenced event set pattern matching Event pattern matching is a query technique where a sequence of input events is matched against a complex pattern that specifies constraints on extent, order, values, and quantification of matching events. The increasing importance of such query techniques is underpinned by a significant amount of research work, the availability of commercial products, and by a recent proposal to extend SQL for event pattern matching. The proposed SQL extension includes an operator PERMUTE, which allows to express patterns that match any permutation of a set of events. No implementation of this operator is known to the authors. In this paper, we study the sequenced event set pattern matching problem, which is the problem of matching a sequence of input events against a complex pattern that specifies a sequence of sets of events rather than a sequence of single events. Similar to the PERMUTE operator, events that match with a set specified in the pattern can occur in any permutation, whereas events that match with different sets have to be strictly consecutive, following the order of the sets in the pattern specification. We formally define the problem of sequenced event set pattern matching, propose an automaton-based evaluation algorithm, and provide a detailed analysis of its runtime complexity. An empirical evaluation with real-world data shows that our algorithm outperforms a brute force approach that uses existing techniques to solve the sequenced event set pattern matching problem, and it validates the results from our complexity analysis.

O O B O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O B O O B O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O


A multi-mode resource-constrained scheduling problem in the context of port operations We discuss a problem of attending ships within agreed time limits at a port under the condition of the first come first served order. In addition, we indicate the use of the developed tool to support decisions at a strategic level with the objective of improving the attendance of the ships. The tool is based on a mathematical model of a multi-mode resource-constrained scheduling problem and on an extension of a differential evolution algorithm. We illustrate the implementation by computational tests with data generated on the basis of the characteristics of a real port environment. (c) 2006 Elsevier Ltd. All rights reserved.

O O O O O O O O O B I O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O

port operations
attending ships
differential evolution algorithm


Interactive live-wire boundary extraction Live-wire segmentation is a new interactive tool for efficient, accurate and reproducible boundary extraction which requires minimal user input with a mouse. Optimal boundaries are computed and selected at interactive rates as the user moves the mouse starting from a manually specified seed point. When the mouse position comes into the proximity of an object edge, a live-wire boundary snaps to, and wraps around the object of interest. The input of a new seed point freezes the selected boundary segment and the process is repeated until the boundary is complete. Two novel enhancements to the basic live-wire methodology include boundary cooling and on-the-fly training. Data-driven boundary cooling generates seed points automatically and further reduces user input. On-the-fly training adapts the dynamic boundary to edges of current interest. Using the live-wire technique, boundaries are extracted in one-fifth of the time required for manual tracing, but with 4.4 times greater accuracy and 4.8 times greater reproducibility. In particular, interobserver reproducibility using the live-wire tool is 3.8 times greater than intraobserver reproducibility using manual tracing.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

boundary cooling and training
speed
accuracy and reproducibility
graph searching
interactive segmentation
live-wire boundary extraction


The application of spreadsheets to the analysis and optimization of systems and processes in the teaching of hydraulic and thermal engineering This article shows the capability of current spreadsheets to define, analyze and optimize models of systems and processes. Specifically, the Microsoft spreadsheet Excel is used, with its built-in solver, to analyze and to optimize systems and processes of medium complexity, whose mathematical models are expressed by means of nonlinear systems of equations. Two hydraulic and thermal engineering-based application examples are presented, respectively: the analysis and optimization of vapor power cycles, and the analysis and design of piping networks. The mathematical models of these examples have been implemented in Excel and have been solved with the solver. For the power cycles, the thermodynamic properties of water have been calculated by means of the add-in TPX (Thermodynamic Properties for Excel). Performance and optimum designs are presented in cases studies, according to the optimization criteria of maximum efficiency for the power cycle and minimum cost for the piping networks. (c) 2006 Wiley Periodicals, Inc.

O O O B O O B O B O B O B O O O O O O O O O O O O O O O B O O O O O O O B O B O O O O O O O O O O O O O O O O B O B O O O O O O O O O O O O B O O O O O O O O O O O O O B O B O O O O O O B O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O B I O O O O O

systems
processes
analysis
optimization
spreadsheets
piping networks

mathematical modeling
thermodynamic cycles


On stability for switched linear positive systems This paper addresses the stability properties of switched linear positive systems in continuous-time as well as in discrete-time. In the discrete-time case, some sufficient and necessary conditions for asymptotic stability are derived for pairs of second order systems. Similar conditions are also established for a finite number of second order systems. Furthermore, for higher order systems, some results on stability are provided in a similar manner. In particular, in this case, a common linear Lyapunov function guaranteeing the stability of the switched positive systems can be easily located by means of geometry properties. In the continuous-time case, a finite number of second order systems are considered. Some equivalent conditions for stability of such systems are developed. (C) 2010 Elsevier Ltd. All rights reserved.

O B O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O

common linear copositive lyapunov functions


Efficient automatic simulation of parallel computation on networks of workstations Andrews et al. [Automatic method for hiding latency in high bandwidth networks, in: Proceedings of the ACM Symposium on Theory of Computing, 1996, pp. 257265; Improved methods for hiding latency in high bandwidth networks, in: Proceedings of the Eighth Annual ACM Symposium on Parallel Algorithms and Architectures, 1996, pp. 5261] introduced a number of techniques for automatically hiding latency when performing simulations of networks with unit delay links on networks with arbitrary unequal delay links. In their work, they assume that processors of the host network are identical in computational power to those of the guest network being simulated. They further assume that the links of the host are able to pipeline messages, i.e., they are able to deliver P packets in time O(P+d) O ( P + d ) where d is the delay on the link. In this paper we examine the effect of eliminating one or both of these assumptions. In particular, we provide an efficient simulation of a linear array of homogeneous processors connected by unit-delay links on a linear array of heterogeneous processors connected by links with arbitrary delay. We show that the slowdown achieved by our simulation is optimal. We then consider the case of simulating cliques by cliques; i.e., a clique of heterogeneous processors with arbitrary delay links is used to simulate a clique of homogeneous processors with unit delay links. We reduce the slowdown from the obvious bound of the maximum delay link to the average of the link delays. In the case of the linear array we consider both links with and without pipelining. For the clique simulation the links are not assumed to support pipelining. The main motivation of our results (as was the case with Andrews et al.) is to mitigate the degradation of performance when executing parallel programs designed for different architectures on a network of workstations (NOW). In such a setting it is unlikely that the links provided by the NOW will support pipelining and it is quite probable the processors will be heterogeneous. Combining our result on clique simulation with well-known techniques for simulating shared memory PRAMs on distributed memory machines provides an effective automatic compilation of a PRAM algorithm on a NOW.

O B I O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

parallel computation
automatic simulation


The R0 R 0 -type fuzzy logic metric space and an algorithm for solving fuzzy modus ponens Fuzzy modus ponens (briefly, FMP) is the most fundamental form of fuzzy reasoning and has been extensively discussed by diverse researchers. The aim of the present paper is to propose a formalized form of FMP, called generalized modus ponens, in the fuzzy logic system L ? and solve it in L ? , and then provide its numerical version as a new algorithm for solving FMP. As a preparation, some related questions such as what is a fuzzy logic metric space, why is R0 R 0 -implication operator selected, and what kind of merits does the fuzzy pseudo-metric logic space (F(S),?) ( F ( S ) , ? ) possess, etc. are analyzed.

O O O O O O O O O O O O O O B I I B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

fuzzy pseudo-metric space
r0 r 0 -operator r0 r 0 r0 r 0 r 0
system l ? l ? l ? l ?
continuity


Generalization of Ostrowski and Ostrowski-Gruss type inequalities on time scales In this paper, we obtain an Ostrowski and Ostrowski-Gruss type inequality on time scales, which not only provides a generalization of the known results on time scales, but also give some other interesting inequalities as special cases. (C) 2010 Elsevier Ltd. All rights reserved.

O O O O O O O O B I O O O O O O O O O O O O B I O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O

gruss inequality
ostrowski inequality
ostrowski-gruss inequality


Evaluation in industry of a draft code of practice for manual handling This paper reports findings from a study which evaluated the draft New Zealand Code of Practice for Manual Handling. The evaluation assessed the ease of use, applicability and validity of the Code and in particular the associated manual handling hazard assessment tools, within New Zealand industry. The Code was studied in a sample of eight companies from four sectors of industry. Subjective feedback and objective findings indicated that the Code was useful, applicable and informative. The manual handling hazard assessment tools incorporated in the Code could be adequately applied by most users, with risk assessment outcomes largely consistent with the findings of researchers using more specific ergonomics methodologies. However, some changes were recommended to the risk assessment tools to improve usability and validity. The evaluation concluded that both the Code and the tools within it would benefit from simplification, improved typography and layout, and industry-specific information on manual handling hazards.

O O O O O O B I I O B I O O O O O O O O O O O O O B I I O B I O O O O O O O O O O O O O O O O O O B I B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O

manual handling
code of practice
hazard assessment


A multidimensional positive definite remapping for Lagrangian solutions of the Noh problem A remapping based on the multidimensional positive definite advection transport algorithm (MPDATA), implemented for ALE methods, is used to model the Noh problem. Typical solutions in the Lagrangian reference frame contain heating errors which arise during the simulation of a shock reflection originating at a wall. The paper shows that the inherent properties of MPDATA can be exploited in the remapping to reduce wall heating errors. The resulting increase in accuracy and symmetry of solutions is demonstrated. (C) 2010 Elsevier Ltd. All rights reserved.

O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

ale remapping
mpdata gauge
conservative interpolation


Distance Relaying Algorithm for Double-Circuit Transmission Line with Compensation for Reactance Effect under Standard Availability of Measurements This paper deals with non-pilot distance protection of a double-circuit transmission line. Negative impact of the reactance effect, appearing in. measuring a fault loop impedance,, On Operation of the relay is discussed. An adaptive algorithm allowing one to prevent the relay from mis- or mal- operation caused by the reactance effect is introduced. The algorithm. is designed for a standard availability of measurements from one end of the double-circuit line, i.e. when three-phase voltage and current from the faulted line circuit., and additionally zero-sequence current from the healthy line circuit, are provided as the relay input signals. The algorithm is based on changing the position of the distance relay characteristic in such a. way that the reactance effect is effectively compensated for. For this purpose the shift vector is determined in on-line relatively simple calculations. The delivered adaptive algorithm has been tested using current and voltage signals obtained from simulation of varies faults using the ATP-EMTP software program. Selected results of the evaluation are presented.

O O O O O O O O O O B I O O O O O O O O O O B I O O O O O O O O O B I O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

distance protection
fault
reactance effect

double-circuit transmission line
fault loop impedance measurement
adaptive characteristic


Formal translation from fuzzy EER model to fuzzy XML model XML has been the de facto standard of data representation and exchange over the Web. In addition, fuzzy data are inherent in the real-world applications. Although fuzzy information has been extensively investigated in the context of relational database model, the classical relational database model and its fuzzy extension to date do not satisfy the need of modeling and processing complex objects with imprecision and uncertainty on the Web. Based on fuzzy sets, this paper concentrates on fuzzy information modeling in the EER (enhanced entity-relationship or extended entity-relationship) model and the fuzzy XML model. In particular, the formal approach to mapping the fuzzy EER model to the fuzzy DTD (document type definition) model is developed.

O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O B I O O O O O O B O O O O O O O O O O O O O O


Fully implicit solution of large-scale non-equilibrium radiation diffusion with high order time integration We present a solution method for fully implicit radiation diffusion problems discretized on meshes having millions of spatial zones. This solution method makes use of high order in time integration techniques, inexact Newton-Krylov nonlinear solvers, and multigrid preconditioners. We explore the advantages and disadvantages of high order time integration methods for the fully implicit formulation on both two- and three-dimensional problems with tabulated opacities and highly nonlinear fusion source terms. (c) 2004 Elsevier Inc. All rights reserved.

O O O O O O B I O O O B I O O O O O O O O B I O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Cluster validation using legacy delineations Validation is an important aspect of clustering, but is often overlooked. The existing cluster validity measures are often inadequate for practical applications. Inability to incorporate existing domain knowledge is a primary deficiency. We have proposed a measure which models the domain knowledge in the form of existing delineations, often available from legacy. The effectiveness of the measure in a practical problem is demonstrated.

B I O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


A magnetic network appproach to the transient analysis of synchronous machines The technique for the simulation of the dynamic behaviour of rotating machines presented in the paper is based on an equivalent circuit representation of the magnetic configuration The circuit parameters are obtained by a preliminary automated sequence of magnetostatic FEM analyses and take into account the local magnetic saturations. The adopted solution technique is based on an invariant network topology approach: its application, presented for the operation analysis of a low-power synchronous generator, allows a great reduction of the calculation time in comparison with a commercial FEM code for the transient simulation.

O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B


Open-source MATLAB implementation of consistent discretisations on complex grids Accurate geological modelling of features such as faults, fractures or erosion requires grids that are flexible with respect to geometry. Such grids generally contain polyhedral cells and complex grid-cell connectivities. The grid representation for polyhedral grids in turn affects the efficient implementation of numerical methods for subsurface flow simulations. It is well known that conventional two-point flux-approximation methods are only consistent for K-orthogonal grids and will, therefore, not converge in the general case. In recent years, there has been significant research into consistent and convergent methods, including mixed, multipoint and mimetic discretisation methods. Likewise, the so-called multiscale methods based upon hierarchically coarsened grids have received a lot of attention. The paper does not propose novel mathematical methods but instead presents an open-source Matlab(R) toolkit that can be used as an efficient test platform for (new) discretisation and solution methods in reservoir simulation. The aim of the toolkit is to support reproducible research and simplify the development, verification and validation and testing and comparison of new discretisation and solution methods on general unstructured grids, including in particular corner point and 2.5D PEBI grids. The toolkit consists of a set of data structures and routines for creating, manipulating and visualising petrophysical data, fluid models and (unstructured) grids, including support for industry standard input formats, as well as routines for computing single and multiphase (incompressible) flow. We review key features of the toolkit and discuss a generic mimetic formulation that includes many known discretisation methods, including both the standard two-point method as well as consistent and convergent multipoint and mimetic methods. Apart from the core routines and data structures, the toolkit contains add-on modules that implement more advanced solvers and functionality. Herein, we show examples of multiscale methods and adjoint methods for use in optimisation of rates and placement of wells.

O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O

consistent discretisations
unstructured grids
multiscale methods

mimetic schemes
mpfa methods
open-source implementation
rate optimisation


PICPANTHER:

A

simple,

concise

implementation

of

the

relativistic

moment

implicit

particle-in-cell

method

A

three-dimensional,

parallelized

implementation

of

the

electromagnetic

relativistic

moment

implicit

particle-in-cell

method

in

Cartesian

geometry

(Noguchi

etal.,

is

presented.

Particular

care

was

taken

to

keep

the

codebase

simple,

concise,

and

approachable.

GMRES

is

used

as

a

field

solver

and

during

the

NewtonKrylov

iteration

of

the

particle

pusher.

Drifting

Maxwellian

problem

setups

are

available

while

more

complex

simulations

can

be

implemented

easily.

Several

test

runs

are

described

and

the

codes

numerical

and

computational

performance

is

examined.

Weak

scaling

on

the

SuperMUC

system

is

discussed

and

found

suitable

for

large-scale

production

runs.

Program

title:

PICPANTHER

Catalogue

identifier:

Program

summary

Program

obtainable

from:

CPC

Program

Library,

Queens

University,

Belfast,

N.

Ireland

Licensing

provisions:

Standard

CPC

licence,

No.

of

lines

in

distributed

program,

including

test

data,

etc.:

No.

of

bytes

in

distributed

program,

including

test

data,

etc.:

Distribution

format:

tar.gz

Programming

language:

Computer:

Program

should

work

on

any

system

with

a

modern

Compiler

(e.g.g++

in

GCC

and

later)

and

MPI,

implementations.

Operating

system:

Linux

Unix.

Has

the

code

been

vectorized

or

parallelized?:

Parallelized

using

the

Message

Passing

Interface,

successfully

tested

on

SuperMUC

with

good

scaling

behavior.

RAM:

Variable,

depending

on

simulation

size,

kiB

per

cell,

B

per

particle

Classification:

External

routines:

(header

files,

tested

with

versions

(e.g.OpenMPI,

tested

with

version

tested

with

version

Nature

of

problem:

Kinetic

simulations

of

collisionless

plasma

mostly

need

to

resolve

the

smallest

scales

in

a

plasma,

limiting

the

problem

domains

that

can

be

tackled.

The

CourantFriedrichsLewy

condition

poses

further

problems.

Explicit

algorithms

require

large

amounts

of

computational

power

to

cope

with

these

restrictions.

Implementations

of

implicit

algorithms,

on

the

other

hand,

are

very

complex.

Very

few

implicit

codes

are

openly

available

and

approachable.

Fully

relativistic,

three-dimensional

electromagnetic

implicit

PiC

codes

in

particular

are

rare

in

general.

Solution

method:

PICPANTHER

implements

the

relativistic

moment

implicit

particle-in-cell

method.

The

implicit

electric

field

equation

is

solved

using

the

GMRES

algorithm

with

operators

represented

as

sparse

matrices.

For

each

particle,

the

implicit

equation

of

motion

is

solved

via

a

robust

NewtonKrylov

scheme.

Parallelization

is

achieved

using

simple

domain

decomposition,

resulting

in

good

scalability.

Restrictions:

PICPANTHER

only

allows

for

Euclidean

geometries.

Currently,

only

periodic

boundary

conditions

are

provided.

Unusual

features:

PICPANTHER

makes

use

of

advanced

numerical

techniques

(GMRES,

NewtonKrylov)

to

implicitly

solve

relativistic

versions

of

the

movement

and

field

equations

of

a

PiC

code.

It

was

designed

to

be

simple

and

concise,

using

advanced

language

features.

Moreover,

it

is

parallelized

and

exhibits

good

scaling

behavior.

Running

time:

Minutes

to

days,

depending

on

problem

size

and

CPU

count.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

particle in cell
implicit moment
relativistic implicit moment
particle mesh


A framework for evolutionary optimization with approximate fitness functions It is not unusual that an approximate model is needed for fitness evaluation in evolutionary computation. In this case, the convergence properties of the evolutionary algorithm are unclear due to the approximation error of the model. In this paper, extensive empirical studies are carried out to investigate the convergence properties of an evolution strategy using an approximate fitness function on two benchmark problems. It is found that incorrect convergence will occur. if the approximate model has false optima. To address this problem, individual- and generation-based evolution control are introduced and the resulting effects on the convergence properties are presented. A framework for managing approximate models in generation-based evolution control is proposed. This framework is well suited for parallel evolutionary optimization, which is able to guarantee the correct convergence of the evolutionary algorithm, as well as to reduce the computation cost as much as possible. Control of the evolution and updating of the approximate models are based on the estimated fidelity of the approximate model. Numerical results are presented for three test problems and for a aerodynamic design example.

O O O O B O O B I O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

evolutionary computation
fitness functions
optimization