Design of a replenishment system for a stochastic dynamic production/forecast lot-sizing problem under bullwhip effect Inventory has the function of balancing production and demand. To shorten lead time, businesses adopt the make-to-stock approach that satisfies customers demand by inventory through forecast. This approach highlights the two contradictory objectives: to lower stock cost and to satisfy customers demand. Moreover, forecasting is one of the main causes of the bullwhip effect. Therefore, it is the policymakers concern to have good production planning and replenishment control through effective inventory management under such a circumstance. This paper studies a stochastic dynamic lost-sizing problem under the bullwhip effect. To solve this problem, this paper proposes a solution of two-stage ant colony optimization (TACO) and adds a mutation operation in the second-stage ACO. The experiment is mainly composed of two parts, with the first part analyzing the solution quality of the TACO, and the second part discussing the relationships between the bullwhip effect, replenishment (forecast) cycle, and the cost.

O O O B I O O B 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 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 B I 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 B I O O O O O O

ant colony optimization
bullwhip effect
stochastic
replenishment system


prediction intelligence in context-aware applications Mobile applications are required to operate in ubiquitous environments of dynamic nature. Specifically, the availability of resources and services may vary significantly during a typical session of system operation. As a consequence, mobile applications need to be capable of adapting to these changes to ensure the best possible level of service to the user. Therefore, such adaptive applications may have pre-evaluated the appropriate knowledge of their environment to act efficiently. Such knowledge is not known a priori, so information prediction and proactivity should enhance and extend the functionality of such applications in order to be adaptable to the future changes of their underlying computational environment. In this paper, we discuss and evaluate such a context prediction algorithm.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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

context model
spatial prediction
context proactivity
context awareness


Mining Multidimensional and Multilevel Sequential Patterns Multidimensional databases have been designed to provide decision makers with the necessary tools to help them understand their data. This framework is different from transactional data as the datasets contain huge volumes of historicized and aggregated data defined over a set of dimensions that can be arranged through multiple levels of granularities. Many tools have been proposed to query the data and navigate through the levels of granularity. However, automatic tools are still missing to mine this type of data in order to discover regular specific patterns. In this article, we present a method for mining sequential patterns from multidimensional databases, at the same time taking advantage of the different dimensions and levels of granularity, which is original compared to existing work. The necessary definitions and algorithms are extended from regular sequential patterns to this particular case. Experiments are reported, showing the significance of this approach.

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 O O O 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 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

sequential patterns
multidimensional databases

frequent patterns
hierarchy
multilevel patterns


a migration mechanism to manage network troubles while interacting within collaborative virtual environments Real time collaborative interactions within CVEs rely on the low latency offered by high speed networks. When low level network troubles occur during a collaborative session, participants of networked collaborative virtual environments can suffer from misunderstanding weird behavior of some objects of the virtual universe. We want to make such a virtual world easier to understand by using some graphic visualizations in such a way that the users become aware of these problems. It is a kind of augmentation of the Virtual Environment thanks to dedicated 3D metaphors associated to some objects of the virtual environment. We also want to allow users to work while these troubles occur, maybe with only restricted interaction possibilities, by making some interactive objects migrate onto the same site than the user who wants to interact with them. This is why we present then how two independent mechanisms may be coupled together for a better management and awareness of network troubles while interacting within a networked collaborative virtual environment: an awareness system that visualizes, through special metaphors, the existence of a network trouble as strong delay or disconnection; and a virtual object migration system that allows the migration of an object from one site to another to ensure a non interrupted manipulation in case of network troubles.

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 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 O O O O O O O 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

object migration
collaborative virtual environments

computer-supported cooperative work
awareness of network problems
virtual reality
augmented virtuality


Providing e-Transaction Guarantees in Asynchronous Systems with No Assumptions on the Accuracy of Failure Detection In this paper, we address reliability issues in three-tier systems with stateless application servers. For these systems, a framework called e-Transaction has been recently proposed, which specifies a set of desirable end-to-end reliability guarantees. In this article, we propose an innovative distributed protocol providing e-Transaction guarantees in the general case of multiple, autonomous back-end databases (typical of scenarios with multiple parties involved within a same business process). Differently from existing proposals coping with the e-Transaction framework, our protocol does not rely on any assumption on the accuracy of failure detection. Hence, it reveals suited for a wider class of distributed systems. To achieve such a target, our protocol exploits an innovative scheme for distributed transaction management (based on ad hoc demarcation and concurrency control mechanisms), which we introduce in this paper. Beyond providing the proof of protocol correctness, we also discuss hints on the protocol integration with conventional systems (e.g., database systems) and show the minimal overhead imposed by the protocol.

O O O O O O O O O O O O O B I 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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

three-tier systems
distributed transactions


A Quantum Lovasz Local Lemma The Lovasz Local Lemma (LLL) is a powerful tool in probability theory to show the existence of combinatorial objects meeting a prescribed collection of "weakly dependent" criteria. We show that the LLL extends to a much more general geometric setting, where events are replaced with subspaces and probability is replaced with relative dimension, which allows to lower bound the dimension of the intersection of vector spaces under certain independence conditions. Our result immediately applies to the k-QSAT problem (quantum analog of k-SAT): For instance we show that any collection of rank-1 projectors, with the property that each qubit appears in at most 2k/(e . k) of them, has a joint satisfiable state. We then apply our results to the recently studied model of random k-QSAT. Recent works have shown that the satisfiable region extends up to a density of 1 in the large k limit, where the density is the ratio of projectors to qubits. Using a hybrid approach building on work by Laumann et al. [2009, 2010] we greatly extend the known satisfiable region for random k-QSAT to a density of Omega(2(k)/k(2)). Since our tool allows us to show the existence of joint satisfying states without the need to construct them, we are able to penetrate into regions where the satisfying states are conjectured to be entangled, avoiding the need to construct them, which has limited previous approaches to product states.

O O O B I O O B I 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

probabilistic method
quantum computation
quanum sat
random quantum sat


Person recognition using facial video information: A state of the art In this article we propose a detailed state of the art on person recognition using facial video information. We classify the existing approaches present in the scientific literature between those that neglect the temporal information, and those that exploit it even partially. Concerning the first category, we detail the extensions to video data of: eigenfaces, fisherfaces, active appearance models (AAMs), radial basis function neural networks (RBFNNs), elastic graph matching (EGM), hierarchical discriminative regression trees (HDRTs) and pairwise clustering methods. After that, we focus on the strategies exploiting the temporal information, in particular those analysing: the facial motion with optical flow, the evolution of facial appearance over time with hidden Markov models (HMMs) or with various probabilistic tracking and recognition approaches, and the head motion with Gaussian mixture models.

B I O O B O O B I I I O O O O O O O B I I I O B I 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 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

person recognition
video
state of the art

person identification
person authentication
person verification
facial information
survey


Automatic Reconfiguration for Large-Scale Reliable Storage Systems Byzantine-fault-tolerant replication enhances the availability and reliability of Internet services that store critical state and preserve it despite attacks or software errors. However, existing Byzantine-fault-tolerant storage systems either assume a static set of replicas, or have limitations in how they handle reconfigurations (e. g., in terms of the scalability of the solutions or the consistency levels they provide). This can be problematic in long-lived, large-scale systems where system membership is likely to change during the system lifetime. In this paper, we present a complete solution for dynamically changing system membership in a large-scale Byzantine-fault-tolerant system. We present a service that tracks system membership and periodically notifies other system nodes of membership changes. The membership service runs mostly automatically, to avoid human configuration errors; is itself Byzantine-fault-tolerant and reconfigurable; and provides applications with a sequence of consistent views of the system membership. We demonstrate the utility of this membership service by using it in a novel distributed hash table called dBQS that provides atomic semantics even across changes in replica sets. dBQS is interesting in its own right because its storage algorithms extend existing Byzantine quorum protocols to handle changes in the replica set, and because it differs from previous DHTs by providing Byzantine fault tolerance and offering strong semantics. We implemented the membership service and dBQS. Our results show that the approach works well, in practice: the membership service is able to manage a large system and the cost to change the system membership is low.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 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 B I I 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

byzantine fault tolerance
membership service

dynamic system membership
distributed hash tables


An Empirical Interference Modeling for Link Reliability Assessment in Wireless Networks In recent years, it has been widely believed in the community that the link reliability is strongly related to received signal strength indicator (RSSI) [or signal-to-interference-plus-noise ratio (SINR)] and external interference makes it unpredictable, which is different from the previous understanding that there is no tight relationship between the link reliability and RSSI (or SINR), but multipath fading causes the unpredictability. However, both cannot fully explain why the unpredictability appears in the link state. In this paper, we unravel the following questions: 1) What causes frame losses that are directly related to intermediate link states? 2) Is RSSI or SINR a right criterion to represent the link reliability? 3) Is there a better measure to assess the link reliability? We first configured a testbed for performing a real measurement study to identify the causes of frame losses, and observed that link reliability depends on an intraframe SINR distribution, not a single value of RSSI (or SINR). We also learned that an RSSI value is not always a good indicator to estimate the link state. We then conducted a further investigation on the intraframe SINR distribution and the relationship between the SINR and link reliability with the ns-2 simulator. Based on these results, we finally propose an interference modeling framework for estimating link states in the presence of wireless interferences. We envision that the framework can be used for developing link-aware protocols to achieve their optimal performance in a hostile wireless environment.

O O O O O O O O O O O O O O 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 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 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 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 B I O O O O O O O O O B 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

intraframe signal-to-interference-plus-noise ratio (sinr) distribution

received signal strength indicator (rssi)


a new approach to cross-modal multimedia retrieval The problem of joint modeling the text and image components of multimedia documents is studied. The text component is represented as a sample from a hidden topic model, learned with latent Dirichlet allocation, and images are represented as bags of visual (SIFT) features. Two hypotheses are investigated: that 1) there is a benefit to explicitly modeling correlations between the two components, and 2) this modeling is more effective in feature spaces with higher levels of abstraction. Correlations between the two components are learned with canonical correlation analysis. Abstraction is achieved by representing text and images at a more general, semantic level. The two hypotheses are studied in the context of the task of cross-modal document retrieval. This includes retrieving the text that most closely matches a query image, or retrieving the images that most closely match a query text. It is shown that accounting for cross-modal correlations and semantic abstraction both improve retrieval accuracy. The cross-modal model is also shown to outperform state-of-the-art image retrieval systems on a unimodal retrieval task.

O O O O O B 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 B O O O O O O O O O O O B O O O O B O

image and text
cross-media
cross-modal
document processing


On Lyapunov Exponents for Cellular Automata We give a review of quantities describing the speed of propagation of perturbations with respect to a cellular automaton (CA) and an invariant measure. We consider, as these quantities, the Lyapunov exponents of Shereshevsky [13], the average Lyapunov exponents of Tisseur [14] and the directional Lyapunov exponents defined and investigated by us in [6]. The directional Lyapunov exponents describe the propagation of a perturbation as observed in moving reference with a constant velocity to the right or to the left, as a function of the velocity. The directional entropy describes the randomness of the dynamics as observed in moving reference with constant velocity to the right or to the left as a function of the velocity. The main property discussed in the paper is the connection between all the above Lyapunov exponents and the entropies of a given CA.

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 B I O O O O O B I O O O O O O 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 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 B I O O O O O O O

cellular automata
entropy
lyapunov exponents

space-time directional lyapunov exponents


Deferred locking with shadow transaction for client-server DBMSs Data-shipping systems that allow inter-transaction caching raise the need of a transactional cache consistency maintenance (CCM) protocol because each client is able to cache a portion of the database dynamically. Deferred locking (DL) is a new CCM scheme that is capable of reducing the communication overhead required for cache consistency checking. Due to its low communication overhead, DL could show a superior performance, but it tends to exhibit a high ratio of transaction abort. To cope with this drawback, we develop a new notion of shadow transaction, which is a backup-purpose one that is kept ready to replace an aborted transaction. This notion and the locking mechanism of DL have been incorporated into deferred locking with shadow transaction. Using a distributed database simulation model, we evaluate the performance of the proposed schemes under a wide range of workloads. (C) 2005 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 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

concurrency control
transaction processing
performance evaluation


RECOGNITION OF HANDWRITTEN DEVANAGARI SCRIPT Segmentation of handwritten text into lines, words and characters is one of the important steps in the handwritten text recognition process. In this paper, we propose a float fill algorithm for segmentation of unconstrained Devanagari text into words. Here, a text image is directly segmented into individual words. Rectangular boundaries are drawn around the words and horizontal lines are detected with template matching. A mask is designed for detecting the horizontal line and is applied to each word from left to right and top to bottom of the document. Header lines are removed for character separation. A new segment code features are extracted for each character. In this paper, we present the results of multiple classifier combination for offline handwritten Devanagari characters. The use of regular expressions in handwritten characters is a novel concept and they are defined in a manner so that they can become more robust to noise. We have achieved an accuracy of 94% for word level segmentation, 95% for coarse classification and 85% for fine classification of character recognition. On experimentation with a dataset of 5000 samples of characters, the overall recognition rate observed is 95% as we considered top five choice results. The proposed combined classifier can be applied to handwritten character recognition of any other language like English, Chinese, Arabic, etc. and can recognize the characters with same accuracy. 18 For printed characters we have achieved accuracy of 100%, only by applying the regular expression classifier.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 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


Structural Hidden Markov Models Using a Relation of Equivalence: Application to Automotive Designs Standard hidden Markov models (HMM's) have been studied extensively in the last two decades. It is well known that these models assume state conditional independence of the observations. Therefore, they are inadequate for classification of complex and highly structured patterns. Nowadays, the need for new statistical models that are capable to cope with structural time series data is increasing. We propose in this paper a novel paradigm that we named structural hidden Markov model (SHMM). It extends traditional HMM's by partitioning the set of observation sequences into classes of equivalences. These observation sequences are related in the sense they all contribute to produce a particular local structure. We describe four basic problems that are assigned to a structural hidden Markov model: (1) probability evaluation, (2) statistical decoding, (3) local structure decoding, and (4) parameter estimation. We have applied SHMM in order to mine customers' preferences for automotive designs. The results reported in this application show that SHMM's outperform the traditional hidden Markov model with a 9% of increase in accuracy.

O B I I O O B I I 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 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

hidden markov models
relation of equivalence
statistical decoding


Point estimates for variance-structure parameters in Bayesian analysis of hierarchical models Markov chain Monte Carlo (MCMC) made Bayesian analysis feasible for hierarchical models, but the literature about their variance parameters is sparse. This is particularly so for point estimators of variance-structure parameters, which are useful for simplifying tables and sample-size calculations, and as plug-in estimators in complex calculations. This paper uses simulation experiments to compare three such point estimators, the posterior mode, median, and mean, for three parameterizations of the variance structure, as precisions, standard deviations, and variances. We first consider simple linear regression, where fairly explicit expressions are possible, and then three more complex models: crossed random effects, smoothed analysis of variance (SANOVA), and the conditional autoregressive (CAR) model with two classes of neighbor relations. We illustrate the latter results using periodontal data. The posterior mean often performs poorly in terms of bias and mean-squared error, and should be avoided. The posterior median never performs worse than the mean and often performs far better. The surprise is that, on the whole, the posterior mode performs best regardless of the variance structure's parameterization, although the potential for multi-modality may make it unattractive for general use.

O O O O 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 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 B O O O O O O O O O O O O O O

hierarchical model
point estimate
posterior distribution
precision
standard deviation


a risk-driven method for extreme programming release planning XP (eXtreme Programming) has become popular for IID (Iteration and Increment Development). It is suitable for small teams, lightweight projects and vague/volatile requirements. However, some challenges are left to developers when they desire to practise XP. A critical one of them is constructing the release plan and negotiating it with customers. In this paper, we propose a risk-driven method for XP release planning. It has been applied in a case study and the results show the method is feasible and effective. XP practicers can follow it to decide a suitable release plan and control the development process.

O O O O O O B I 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 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 B I 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


differences in listener responses between procedural and narrative task In the long tradition of corpus based research on listener behavior, whether it entails linguistic analysis or social signal processing, many different tasks have been used during the recording of the corpus. So far in no study the task which has been given to the participants has been an independent variable and no studies have looked into the effect of this variable on listener responses. In this paper we present the results of our comparison between listening behavior elicited by procedural and narrative tasks which were used during the recording of our MultiLis corpus. We will show that listeners in the procedural tasks show more agreement in their responses than listeners in the narrative tasks. Furthermore we will show that the long procedural task elicits more responses per minute than the short procedural task. We will reflect on these results in light of cognitive load and grounding theory.

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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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


BLDC motor speed control system fault diagnosis based on LRGF neural network and adaptive lifting scheme An LRGF neural network with pole assignment technique is proposed to model the dynamic system. An adaptive lifting scheme is used for the improvement of the mechanical fault detection. An adaptive threshold scheme is proposed for the detection of several kinds of faults.

O O O O O B I O O B I I O B I I O B I I 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

fault diagnosis
lrgf neural network
adaptive lifting scheme


An improved augmented reality system based on AndAR ? We present an adaptive Augmented Reality (AR) architecture. The improved AndAR can augment reality based on natural features. The solution can augment the reality anywhere. The presented approach improves system speed and extends tracking range.

O O O O O O O B 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 O O O O

mobile augmented reality
android platform
registration
inliers tracking
feature extraction and matching
low-level visual features


On-line learning networks: Framework and scenarios The idea of using the internet as a platform to mediate social interactions and learning at different levels has progressively affirming itself, and this has given rise to a huge number of spontaneous and planned collectives, which are often described as on-line learning networks. On-line learning networks create value through the combination of content and peoples knowledge. They can vary widely in the strength and permanence of their connections and the resources necessary to maintain them. Aspects of both a pragmatic and social nature need to be carefully considered in the process of initiation of on-line learning communities. This paper considers learning networks from the perspective of the potential they offer to the strengthening of relationships among institutions, groups, and people sharing a common interest in computer-enhanced learning. Some case studies are analysed and an analytical framework is sketched out to guide observations and to provide a lens through which case studies can be interpreted. The final goal is to delineate a reference for identifying strong and weak elements in virtual networks and to examine under what conditions they are succeeding. In addition, some possible scenarios for on-line networks are delineated along two main lines: the organisation and structure of the network and its level of establishment.

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 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 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

on-line networks
technology enhanced learning
networking process


Implementation of the local reference node concept for spatially distributed circuits Large spatially distributed microwave and millimeter-wave systems involve the interaction of linear and nonlinear circuits with their electromagnetic environment. Were a circuit-level approach to the modeling of circuit-field interactions is developed, (C) 1999 John Wiley & Sons, Inc.

O O O B I I 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

spatially distributed circuits
local reference node

modified nodal analysis
circuit simulation
quasi-optical systems


Virtual grid-based front tracking method Purpose - The paper aims to clarify the advantages of the virtual grid-based (VGB) front tracking method developed for two-phase bubble flows in comparison with currently used grid-based and grid-free methods. Design/methodology/approach - The paper opted for using two test cases to demonstrate the advantages of this VGB approach for front tracking. Findings - The results from the test runs show a ten times higher calculation accuracy. Research limitations/implications - Due to the limited test runs, the VGB approach may not fit some other applications. Researchers are encouraged to further develop and test this new approach. Practical implications The paper includes implications for further development of a comprehensive approach for front tracking and data communications between the front and computational grid. Originality/value - This paper fulfills an identified need to study how the front tracking can be made more accurate and reliable.

O O O B 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 B O O O O O O O


Explanation in dynamical cognitive science In this paper, I outline two strands of evidence for the conclusion that the dynamical approach to cognitive science both seeks and provides covering law explanations. Two of the most successful dynamical models-Kelso's model of rhythmic finger movement and Thelen et al.'s model of infant perseverative reaching-can be seen to provide explanations which conform to the famous explanatory scheme first put forward by Hempel and Oppenheim. In addition, many prominent advocates of the dynamical approach also express the provision of this kind of explanation as a goal of dynamical cognitive science. I conclude by briefly outlining two consequences. First, dynamical cognitive science's explanatory style may strengthen its links to the so-called "situated" approach to cognition, but, secondly, it may also undermine the widespread intuition that dynamics is related to emergentism in the philosophy of mind.

B 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 B 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


Hardware Transactional Memory with Software-Defined Conflicts In this paper we investigate the benefits of turning the concept of transactional conflict from its traditionally fixed definition into a variable one that can be dynamically controlled in software. We propose the extension of the atomic language construct with an attribute that specifies the definition of conflict, so that programmers can write code which adjusts what kinds of conflicts are to be detected, relaxing or tightening the conditions according to the forms of interference that can be tolerated by a particular algorithm. Using this performance-motivated construct, specific conflict information can be associated with portions of code, as each transaction is provided with a local definition that applies while it executes. We find that defining conflicts in software makes possible the removal of dependencies which arise as a result of the coarse synchronization style encouraged by the TM programming model. We illustrate the use of the proposed construct in a variety of use cases with real applications, showing how programmers can take advantage of their knowledge about the problem and other global information not available at rim-time. We describe how to implement a hardware TM design that utilizes this software construct. Our experiments reveal that leveraging software-defined conflicts, the programmer is able to achieve significant reductions in the number of aborts -over 50% for most applications. At 16 threads, our system with software-defined conflicts outperforms LogTM-SE in nearly all benchmarks, reaching an average reduction in execution time of 18%.

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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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

performance
conflict detection
atomic block


A 3-D model of tumor progression based on complex automata driven by particle dynamics The dynamics of a growing tumor involving mechanical remodeling of healthy tissue and vasculature is neglected in most of the existing tumor models. This is due to the lack of efficient computational framework allowing for simulation of mechanical interactions. Meanwhile, just these interactions trigger critical changes in tumor growth dynamics and are responsible for its volumetric and directional progression. We describe here a novel 3-D model of tumor growth, which combines particle dynamics with cellular automata concept. The particles represent both tissue cells and fragments of the vascular network. They interact with their closest neighbors via semi-harmonic central forces simulating mechanical resistance of the cell walls. The particle dynamics is governed by both the Newtonian laws of motion and the cellular automata rules. These rules can represent cell life-cycle and other biological interactions involving smaller spatio-temporal scales. We show that our complex automata, particle based model can reproduce realistic 3-D dynamics of the entire system consisting of the tumor, normal tissue cells, blood vessels and blood flow. It can explain phenomena such as the inward cell motion in avascular tumor, stabilization of tumor growth by the external pressure, tumor vascularization due to the process of angiogenesis, trapping of healthy cells by invading tumor, and influence of external (boundary) conditions on the direction of tumor progression. We conclude that the particle model can serve as a general framework for designing advanced multiscale models of tumor dynamics and it is very competitive to the modeling approaches presented before.

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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 B 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

angiogenesis
complex automata
tumor progression

computer simulation
discrete particle model


Definitions of Instantaneous Frequency under physical constraints Ville's definition of Instantaneous Frequency (IF), even though widely used and accepted, fails in most cases of practical interest. This failure has been often reported, namely in the multicomponent case. In this paper, we will analyze the advantages and shortcomings of that definition, and determine when and why it fails, integrating all previously reported cases of failure in a simple unified theory. We will also be able to extrapolate and predict the behavior of the traditional definition for any type of multicomponent signal. Alternative definitions of IF are discussed.

O O B I 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

timefrequency signal analysis
mean frequency
multicomponent signals
time-varying signals


A 5.8-GHz quadrature cross-coupled oscillator This paper describes the implementation of a quadrature cross-coupled relaxation oscillator to be used in an OFDM RF front-end transceiver. A prototype of the oscillator was realized in a SiGe BiCMOS technology, and an oscillation frequency of 5.8 GHz was obtained which is 1/6 of the maximum f(T) of the bipolar transistors. The circuit performance is evaluated by simulation and by experiment.

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

cross-coupled oscillators
quadrature oscillators
relaxation oscillators


A study on semi-supervised FCM algorithm Most variants of fuzzy c-means (FCM) clustering algorithms involving prior knowledge are generally based on the modification of the objective function or the clustering process. This paper proposes a new weighted semi-supervised FCM algorithm (SSFCM-HPR) that transforms the prior knowledge in the labeled samples into constraint conditions in terms of fuzzy membership degrees, assigns different weights according to the representativeness of the samples, and then uses the HPR multiplier to solve the clustering problem. The "representativeness" of the labeled samples is decided by their distances to the cluster centers they belong to. In this paper, we take the ratio of the largest to the second largest fuzzy membership degree from a labeled sample as its weight. This algorithm not only retains the fuzzy partition of the labeled samples, which guarantees the effective guidance on the clustering process, but also can detect whether a sample is an outlier or not. Moreover, when part of the supervised information of the labeled samples is wrong, this algorithm can reduce the influence of the incorrectly labeled samples on the final clustering results. The experimental evaluation on synthetic and real data sets demonstrates the efficiency and effectiveness of our approach.

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 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 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

fcm algorithm
hpr multiplier
incorrectly labeled samples


Organization of a geophysical information space by using an event-bush-based collaborative tool Development of knowledge engineering makes it possible to bring an information space relating to an entire domain of knowledge within the field of geoscience into a strict form, which is both computer-tractable and convenient for collaborative research work. Nevertheless, there are issues that seriously hamper this process the problem of defining key terms, which is often not shared by the colleagueship, and interrelation of concepts developed by different schools within the colleagueship focused on different aspects of this domain. Another issue is the export of results to a wider community unfamiliar with the specificity of local studies. All these issues can be successfully addressed by a novel technique of knowledge engineering, the event bush, brought into the COLLA environment for geoscientific collaborative studies. This paper demonstrates how the said issues can be resolved by the example of one of the most important information domains in the field of seismology, the site effects. Text, graphics, tabular data and a physical model coming from different sources and different contexts are united in one context keeping all the specificity of original understanding and allowing the researchers keep on following their own context and terminology.

O 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 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 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

collaborative tool
knowledge engineering
colla
event bush
model


Median statistics in polling In 2004, we used a very simple, but surprisingly effective, method to successfully predict the outcome of the U. S. Presidential election. Using the median poll in the last month for each state, we correctly predicted the results in all states but one (Hawaii). Just as we had originally hoped, the method made it possible to predict successfully the results in the large close states (Ohio, Pennsylvania, and Florida) where there were a great many polls taken. States with only a few polls were generally not close, and so the median poll also predicted these states successfully. The method appears particularly well adapted to U. S. Presidential elections where the candidates are chosen well in advance, and where outcomes in individual states determine the winner. (C) 2008 Elsevier Ltd. All rights reserved.

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 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


The analysis of marked point patterns evolving through space and time A maximum pseudo-likelihood approach has previously been developed for fitting pairwise interaction models to patterns generated by growthinteraction processes that are sampled at fixed time points. This approach is now extended, not only by estimating the parameters of the process through time, but also by employing least squares estimation since likelihood based approaches are much more computationally demanding. First, simple stochastic models are used to demonstrate that least squares methods are as powerful as likelihood-based approaches, as well as being mathematically and computationally simpler. The algorithm generates simulations of the deterministic growthinteraction and stochastic immigrationdeath process, and through these the parameter estimates are determined. Logistic and linear growth are then combined with (symmetric) disc-interaction and (asymmetric) area-interaction processes, and between them these generate a variety of markpoint spatial structures. A robustness study shows that the procedure works well in that the presence, structure and strength of a growthinteraction process can be determined even when an incorrectly presumed model is employed. Thus, the technique is likely to prove to be very useful in general practical applications where the underlying process generating mechanism is almost certain to be unknown. Finally, the procedure is applied to the analysis of a new Swedish pine forest data set for which tree location and diameter at breast height were recorded in 1985, 1990 and 1996.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 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 B 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

growthinteraction process
least squares estimation
linear growth
robustness

area interaction
disc interaction
logistic growth
spacetime processes
swedish pine data


performance evaluation of a framework to support path changes in ip-based access networks The increasing use of wireless networks and the popularity of multimedia applications, leads to the need of Quality of Service support in a mobile IP-based environment. In [1], we investigated the reasons for path changes in the access network and we presented a framework to support these path changes regardless their cause and to avoid router inconsistencies. In this paper, the performance of this framework is thoroughly evaluated. To this end, we added the functionality of the framework to our Q-MEHROM handoff scheme [2]. However, the ideas and results presented in this paper are not restricted to this micromobility protocol. The performance with and without the defined functionalities is compared and tested under different network topologies, in terms of received service, packet loss and end-to-end delay.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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

resource reservations
ip mobility
ip qos
link failure support


Stochastic optimal competitive Hopfield network for partitional clustering This paper presents it stochastic optimal competitive Hopfield network to solve NP-hard partitional clustering problem. Cluster analysis has played a central role in different fields and is often adopted its all approach for preliminary and descriptive data analysis and classification. The objective of the partitional clustering problem is to partition a data set into a specified number of clusters according to certain criteria, e.g. a square error function, and therefore can be treated as all optimization problem. The proposed stochastic optimal competitive Hopfield network introduces a hill-climbing dynamics which helps the network escape from local minima, and therefore can find better cluster partition. The performance is evaluated through several benchmark data sets. The simulation results show that the stochastic optimal competitive Hopfield network Outperforms previous approaches, such as optimal competitive Hopfield model, k-means, genetic algorithm, particle swarm optimization, differential evolution and combinatorial particle swarm optimization for partitional clustering problem. (C) 2007 Elsevier Ltd. All rights reserved.

O B I O O O B I 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 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 O O O O O O O O O O O O O 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 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

partitional clustering
optimal competitive

hopfield models
hill-climbing dynamistics


Digital Processing of Fractographic Images for Welded Joints on Microalloy Steel API5L-X52 Aged Digital processing on fractographic images of fracture surfaces was performed, for the weld metal aged at 250 degrees C for 500 and 900 hours. The digital analysis on fractographs was carried out using mathematical morphology and morphological transformation in order to gain specific structures of the images. The results showed that the mechanism of growth and coalescence of microcavities can be observed during the fractographic image segmentation.

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 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 B I

fracture surfaces
microcavities
mathematical morphology
image segmentation


Efficient IP Routing Lookups for High-Performance Routers The forwarding performance of a router is a critical issue in the Internet. With the ever increasing number of computers in the Internet, the size of the routing table is becoming extremely large. Hence, the IP lookup process becomes a performance bottleneck in a router. In this paper, we propose the multi-level table access and compression schemes for fast IP table lookups in the forwarding engine of a router. With our design, the size of the forwarding table is significantly reduced, and it is possible to fit the entire table in a 256 KB cache memory. Hence, we can speed up route lookups with low memory access latency. In order to avoid excessive complexity, we also try to reduce the operations of table lookups. Our operation of the table lookup takes only a few memory references for each route lookup, and therefore millions of lookups per second can be easily achieved. The simulation results show that our high-performance design is efficient.

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 B 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 O O O O O O O O O O O O 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 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

router
routing
table lookup
access latency


Size Distributions of Cadmium Sulfide Nanoparticles Obtained from Templating Methods Cadmium sulfide (CdS) nanoparticles were obtained by soft templating methods using either an already established revered micelle route or a new procedure based on gel electrophoresis. The UV-Vis absorption or the photoluminescence excitation spectra were fitted using the CdS electronic structure available in the literature together with a size distribution. The obtained results indicate that the amount of sodium dodecyl sulphate as a component of the agarose gel formulation has a profound effect on the resulting nanoparticle population.

O O O O O O O O B 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 B 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

cds nanoparticles
templating
size distribution
photoluminescence


Redundant design for Wallace multiplier To increase the yield of data processing circuits such as adders and logic operation circuits, the bit-slice reconfiguration design has been proposed as an efficient redundant technology for defect-tolerance. Wallace multipliers are a well-known class of high-speed parallel multipliers. Unfortunately, the bit-slice reconfiguration design is not applicable to Wallace multipliers because Wallace multipliers do not have regular bit-slice structure. Therefore, redundant designs for Wallace multipliers have been regarded impossible. This paper proposes a redundant design for Wallace multipliers. In order to design redundant Wallace multipliers, first, 2n heterogeneous slices are considered in a non-redundant n x n Wallace multiplier. The proposed redundant Wallace multipliers contain reconfigurable slices which can play the role of both i-th and (i + 1)-th slices. Since the i-th slice has a similar structure to the (i + 1)-th slice, the reconfigurable slice is not much larger than the i-th slice. This paper also shows a repair procedure for the proposed design. This paper evaluates the proposed design from the viewpoint of the yield, area, effective yield and delay time. For example, the yield of a 32 x 32 Wallace multiplier increases from 0.30 to 0.41 by applying the proposed design while the area increases by a factor of 1.21.

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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 B O O B O O O O O O B 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

bit-slice reconfiguration redundant design


filtering the shadows from poorly illuminated photos This paper presents a new algorithm for filtering shadowy photos degraded by uneven light condition. The dark photos are harder to use for face recognition or even an analysis of the scene. Corrections can be made using commercial tools as Photoshop but this is done manually and it requires a specialized user. We propose an automatic method which inproves the visibility of the scenes. This method is based on wavelet analysis but it uses different filters.

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 O O O O O O O O O O O O B I O O O O O


Image Search-From Thousands to Billions in 20 Years This article presents a comprehensive review and analysis on image search in the past 20 years, emphasizing the challenges and opportunities brought by the astonishing increase of dataset scales from thousands to billions in the same time period, which was witnessed first-hand by the authors as active participants in this research area. Starting with a retrospective review of three stages of image search in the history, the article highlights major breakthroughs around the year 2000 in image search features, indexing methods, and commercial systems, which marked the transition from stage two to stage three. Subsequent sections describe the image search research from four important aspects: system framework, feature extraction and image representation, indexing, and big data's potential. Based on the review, the concluding section discusses open research challenges and suggests future research directions in effective visual representation, image knowledge base construction, implicit user feedback and crowdsourcing, mobile image search, and creative multimedia interfaces.

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 B 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 B O O O O O O O B O O O O O O O O O O O O O O B I B I I O O O O O O O O O O O O O

review
visual representation
indexing
image knowledge base

algorithms
documentation
performance
image retrieval
web image search
content-based
image feature
global feature
local feature
big data


Quantitative analysis of investment allocation over various resources of health care systems by using views of product lines Hospitals can be viewed as service enterprises, of which the primary function is to provide specific sets of diagnostic and therapeutic medical services to individual patients. Each patient has certain diagnosis and therapeutic attributes in common with some other patients. Thus, patients with similar medical attributes could be processed' in one product line' of medical services, and individual treatments for patients within one product line' can be regarded as incurring identical consumption of health care resources. This article presents a theoretical framing for resource planning and investment allocation of various resources from a macro perspective of costs that demonstrates the need to plan capacity at the disaggregated resource level. The result of a balanced line (optimal') is compared with an alternative scheme of the same ratio composing of resources' under the same monetary constraints. Thus, it is demonstrated that planning at the disaggregated level affords much better use of resources than achieved in common practice of budget control by simple percentage increase/decrease in distributing a financial vote.

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 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 O O O O O O O O O O O O O O O O O O


Structural lines, TINs, and DEMs The standard method of building compact triangulated surface approximations to terrain surfaces (TINs) from dense digital elevation models (DEMs) adds points to an initial sparse triangulation or removes points from a dense initial mesh. Instead, we find structural lines to act as the initial skeleton of the triangulation. These lines are based on local curvature of the surface, not on the Row of water. We build TINs from DEMs with points and structural lines. These experiments show that initializing the TIN with structural lines at the correct scale creates a TIN with fewer points given a particular approximation error. Structural lines are especially effective for small numbers of points and correspondingly rougher approximations.

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 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 B I O O O O O O B O B I O O O O O O B O O O O O O O O B I O O O O O O O O O O O O


ON THE DUAL OF (NON)-WEAKLY REGULAR BENT FUNCTIONS AND SELF-DUAL BENT FUNCTIONS For weakly regular bent functions in odd characteristic the dual function is also bent. We analyse a recently introduced construction of non-weakly regular bent functions and show conditions under which their dual is bent as well. This leads to the definition of the class of dual-bent functions containing the class of weakly regular bent functions as a proper subclass. We analyse self-duality for bent functions in odd characteristic, and characterize quadratic self-dual bent functions. We construct non-weakly regular bent functions with and without a bent dual, and bent functions with a dual bent function of a different algebraic degree.

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

duals of bent functions
self-dual bent functions
fourier transform


On the static and dynamic extents of delimited continuations We show that breadth-first traversal exploits the difference between the static delimited-control operator shift (alias S) and the dynamic delimited-control operator control (alias F). For the last 15 years, this difference has been repeatedly mentioned in the literature but it has only been illustrated with one-line toy examples. Breadth-first traversal fills this vacuum. We also point out where static delimited continuations naturally give rise to the notion of control stack whereas dynamic delimited continuations can be made to account for a notion of 'control queue'. (c) 2006 Elsevier B.V. All rights reserved.

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 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

direct style
continuation-passing style (cps)
cps transformation
defunctionalization
control operators
shift and reset
control and prompt


Update on incretin hormones The incretin hormones glucagon-like-peptide-1 (GLP-1) and glucose-dependent insulinotropic polypeptide (GIP) are released from the intestine following oral ingestion of nutrients. Incretins promote insulin secretion, while GLP-1 also inhibits glucagon release and gastric emptying, minimizing postprandial glucose excursions. The incretins share similar effects on the pancreatic ? cell; however, there are a number of differences in extrapancreatic actions. Type 2 diabetes (T2DM) is associated with abnormal incretin physiology, and although treatment with GIP is ineffective, GLP-1 effects are preserved. The current incretin-based approaches to T2DM include the GLP-1 agonists that are resistant to the serine protease dipeptidylpeptidase-4 (DPP4), which normally rapidly degrades the incretins, and DPP4 inhibitors (DPP4i). Incretin-based treatments have provoked much interest due to use-associated weight loss (GLP-1 agonists), minimal hypoglycemia, and potential for positive effects on pancreatic ? cell biology and the cardiovascular system. However, the long-term safety of these agents has yet to be established. This review outlines the current understanding of incretin biology, available data pertaining to incretin-based treatment in T2DM, and differences between GLP-1 and DPP4i therapy.

O O B O O B 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 B 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 B O O O O O O O O O O O O O O O O


Monitoring the mean of autocorrelated observations with one generally weighted moving average control chart Traditionally, using a control chart to monitor a process assumes that process observations are normally and independently distributed. In fact, for many processes, products are either connected or autocorrelated and, consequently, obtained observations are autocorrelative rather than independent. In this scenario, applying an independence assumption instead of autocorrelation for process monitoring is unsuitable. This study examines a generally weighted moving average (GWMA) with a time-varying control chart for monitoring the mean of a process based on autocorrelated observations from a first-order autoregressive process (AR(1)) with random error. Simulation is utilized to evaluate the average run length (ARL) of exponentially weighted moving average (EWMA) and GWMA control charts. Numerous comparisons of ARLs indicate that the GWMA control chart requires less time to detect various shifts at low levels of autocorrelation than those at high levels of autocorrelation. The GWMA control chart is more sensitive than the EWMA control chart for detecting small shifts in a process mean.

O O O O O O O O B I I I B I 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 B O O O O O O O O O B I I 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 B I I 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 B O O O O O O B O O B I O O O O O O B I O O O O O O O O

control chart
exponentially weighted moving average
generally weighted moving average
autocorrelation


Correspondence analysis of microarray time-course data in casecontrol design Although different statistical approaches have been proposed for analyzing microarray time-course data, method for analyzing such data collected using the popular casecontrol design in clinical investigations has not been proposed perhaps due to the increased complexity for the existing parametric or non-parametric approaches. In this paper, we introduce a new multivariate data analyzing technique, the correspondence analysis, to analyze the high dimensional microarray time-course data in casecontrol design. We show, through an example on type 2 diabetes, how the nice features of the correspondence analysis can be use to explore the various time-course gene expression profiles that exist in the data. By coordinating and examining the projections on the reduced dimensions by both the genes and the time-course experiments, we are able to identify important genes and time-course patterns and make inferences on their biological relevance. Using the sample replicates, we propose a bootstrap procedure for inferring the significance of contributions on the leading dimensions by both the time-course experiments and the genes. Striking differences in the time-course patterns in the normal controls and diabetes patients have been revealed. In addition, the method also identifies genes that display similar or comparable time-course expression patterns shared by both the cases and the controls. We conclude that our correspondence analysis based approach can be a useful tool for analyzing high dimensional microarray data collected in clinical investigations.

B I O B O O O B I O O O O O O O O O B 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 B I 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 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 B O O O O O

correspondence analysis
bootstrap
microarray
casecontrol design


evolutionary computation-based kernel optimal component analysis for pattern recognition Kernel methods are mathematical tools that provide higher dimensional representation of given data set in feature space for pattern recognition and data analysis problems. Optimal Component Analysis (OCA) [4] poses the problem of finding an optimal linear representation. In this paper we present the results of six kernel functions and their respective performance for Evolutionary Computation-based kernel OCA on the Pima Indian Diabetes database. Empirical results show that we outperform existing techniques on this database.

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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


In silico study of the inhibition of DNA polymerase by a novel catalpol derivative In this work, a novel catalpol derivative (6,10,2',6'-tetraacetyl-O-catalpol), which was previously obtained by our group and shown experimentally to inhibit a type of Taq DNA polymerase, was studied in silico. Studies of the interaction of 6,10,2',6'-tetraacetyl-O-catalpol with the Klentaq fragment of the Taq DNA polymerase I from Thermus aquaticus helped to elucidate the mechanism of inhibition of the enzyme, and offered valuable information that can be used to propose substrate structural modifications aimed at increasing the binding affinity. Classical and semi-empirical methods were used to characterize the conformational preferences of this organic compound in solution. Using docking simulations, the most probable binding mode was found, and the stabilities of the docked solutions were tested in a series of molecular dynamics experiments. Results indicated that the mechanism of inhibition may be competitive, which agrees with previous binding experiments done with 6,10,2',6'-tetraacetyl-O-catalpol.

O O O O O O O O O O O O B 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 I I 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 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 B I O O O O O O O O O O O O O O O O O O O O

taq dna polymerase
catalpol
docking
molecular dynamics


Algorithm 791: TSHEP2D: Cosine series shepard method for bivariate interpolation of scattered data We describe a new algorithm for scattered data interpolation. It is based on a modified Shepard method similar to that of Algorithm 660 but uses 10-parameter cosine series nodal functions in place of quadratic polynomials. Also, the interpolant has continuous second partial derivatives. An accompanying survey article presents test results that show the method to be more accurate than polynomial-based methods in terms of reproducing test functions with large variations and steep gradients.

O O O O O B I O O B O B I O O O O O O B I B 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

interpolation
scattered data
shepard method


Kernelization of matrix updates, when and how? ? We define what it means for a learning algorithm to be kernelizable in the case when the instances are vectors, asymmetric matrices and symmetric matrices, respectively. We can characterize kernelizability in terms of an invariance of the algorithm to certain orthogonal transformations. If we assume that the algorithm's action relies on a linear prediction, then we can show that in each case, the linear parameter vector must be a certain linear combination of the instances. We give a number of examples of how to apply our methods. In particular we show how to kernelize multiplicative updates for symmetric instance matrices.

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 I O O O O

rotational invariance
exponentiated gradient algorithm
gradient descent algorithm


Incentive Compatible Mulit-Unit Combinatorial Auctions: A Primal Dual Approach We study multi-unit combinatorial auctions with multi-minded buyers. We provide two deterministic, efficient maximizing, incentive compatible mechanisms that improve upon the known algorithms for the problem (Bartal et al., Proceedings of the 9th Conference on Theoretical Aspects of Rationality and Knowledge TARK IX, pp.7287, 2003). The first mechanism is an online mechanism for a setting in which buyers arrive one-by-one in an online fashion. We then design an offline mechanism with better performance guarantees based on the online mechanism. We complement the results by lower bounds that show that the performance of our mechanisms is close to optimal. The results are based on an online primal-dual approach that was used extensively recently and reveals the underlying structure of the problem.

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

competitive analysis
primal-dual analysis
multi-unit combinatorial auctions
incentive compatible mechanism


Probe trajectory interpolation for 3D reconstruction of freehand ultrasound Three-dimensional (3D) freehand ultrasound uses the acquisition of non-parallel B-scans localized in 3D by a tracking system (optic, mechanical or magnetic). Using the positions of the irregularly spaced B-scans, a regular 3D lattice volume can be reconstructed, to which conventional 3D computer vision algorithms (registration and segmentation) can be applied. This paper presents a new 3D reconstruction method which explicitly accounts for the probe trajectory. Experiments were conducted on phantom and intra-operative datasets using various probe motion types and varied slice-to-slice B-scan distances. Results suggest that this technique improves on classical methods at the expense of computational time.

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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

free-hand ultrasound
brain imaging
neurosurgery


Using a mobile phone Short Messaging Service (SMS) for irrigation scheduling in Australia - Farmers' participation and utility evaluation Irrigation scheduling Decision Support Systems (DSS) have seen poor uptake despite proved usage benefits. The failures of some previous systems with proven model accuracy and water savings ability have been attributed to interface difficulties and inappropriate information for end users. Use of the mobile phone Short Messaging Service (SMS) text messages was trialed as an interface to overcome these difficulties. Irrigation system dripper run time scheduling advice was sent daily to 72 Australian irrigators' mobile phones from a water balance system called IrriSatSMS. Irrigators sent back information on irrigations and rainfall, also via SMS, to update the water balance. This trial showed that a complex, water balance-based, DSS could rely on SMS as the sole interface. All 72 irrigators involved were content to receive messages daily for the entire growing season (200 days). A measure of engagement and utility of the system was determined by those who returned their irrigation and rainfall data; 45 sent in their data all season, 13 for half the season and 14 never sent in any data. Thus we infer that 45 users (63%) found the SMS system of enough utility to use for the whole season. Also, at end of season, 6 of the 13 who had stopped half way through said that in retrospect they wished they had not. Thus overall 80% of irrigators found the system useful. User interview data showed the simplicity of use, advice and the prompting effects of intrusive delivery (phone ringing) were key features in the resultant strong engagement of irrigators. Success also relied on appreciating that irrigators will only use objective decision support advice as one element in a set of decision making tools that include subjective and unquantifiable elements, such as plant appearance. This strong uptake reverses the trend in irrigation decision support which has seen poor uptake of sophisticated systems that produce comprehensive scheduling support but which are, or are perceived to be, complex and time consuming to use. Additionally, high participation rates show that much model input data may be collected from irrigators via SMS so it can be used as a very cheap bi-directional communication channel. Crown Copyright (C) 2012 Published by Elsevier B.V. All rights reserved.

O O O O B I I O O B O O B O O O O B 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 B I I 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 B 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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

irrigation
utility
short messaging service
australia


Sentiment analysis of online news text: a case study of appraisal theory Purpose - Sentiment analysis and emotion processing are attracting increasing interest in many fields. Computer and information scientists are developing automated methods for sentiment analysis of online text. Most of the studies have focused on identifying sentiment polarity or orientation whether a document, usually a product or movie review, carries a positive or negative sentiment. It is time for researchers to address more sophisticated kinds of sentiment analysis. This paper aims to evaluate a particular linguistic framework called appraisal theory for adoption in manual as well as automatic sentiment analysis of news text. Design/methodology/approach - The appraisal theory is applied to the analysis of a sample of political news articles reporting on Iraq and the economic policies of George W. Bush and Mahmoud Ahmadinejad to assess its utility and to identify challenges in adopting this framework. Findings - The framework was useful in uncovering various aspects of sentiment that should be useful for researchers, such as the appraisers and object of appraisal, bias of the appraisers and the author, type of attitude and manner of expressing the sentiment. Problems encountered include difficulty in identifying appraisal phrases and attitude categories because of the subtlety of expression in political news articles, lack of treatment of tense and timeframe, lack of a typology of emotions, and need to identify different types of behaviours (political, verbal and material actions) that reflect sentiment. Originality/value - The study has identified future directions for research in automated sentiment analysis as well as sentiment analysis of online news text. It has also demonstrated how sentiment analysis of news text can be carried out.

B I 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 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 B I 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 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 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 B I O O O B I O O O O O O O O O B I O O O O O O O

sentiment analysis
appraisal theory
political news


WinNet - a network tool Building Internet-like network topologies and performing simulations and/or emulations on them is a task that all network-related topic researchers came across during their study. We propose here a new tool which incorporates network topology generation, visualization, simulation and an analyzing mobile agent based tool. This application can be used for research purposes as well as an educational instrument. Even if it is mainly aimed for computer networks, this application can be also used to solve non-computer network related problems such as logical tasks or database searches.

O O O O O O O O O O O O O O O O O O O O O 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

network simulator
topology generator
wave


The research for protecting location privacy based on V-W algorithm With the development of mobile internet, protecting location privacy has already been an important issue. Based on previous studies and the drawback of traditional algorithms, the paper proposes a novel algorithm for protecting location privacy. The algorithm is based on the voronoi map of a road network, considers the problem of side-weight inference, and utilizes the information entropy as metrics. Meanwhile, the algorithm can defense the attack of side-weight inference and replay. Lastly, we verified the algorithm based on the real data of the road network. Results of experiences show that the improved algorithm has the better performance on some key performance metrics.

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 B I O O O O O O B I O O 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 B I O O O O O O O O O O O O O O O O O

location privacy
voronoi map
road network
information entropy


The role of spreadsheet knowledge in user-developed application success Spreadsheets are the most commonly used tool for end user development of applications, and organizations depend heavily upon them for decision making. This paper reports on a study to investigate the role of spreadsheet knowledge in the successful use of spreadsheet applications. It considers both the spreadsheet knowledge of the user developer and the spreadsheet knowledge of the user and tests a model of the effect of spreadsheet knowledge on the success of a user-developed spreadsheet application. Spreadsheet knowledge was shown to be important in two ways. It influences the quality of the system being developed, but it also acts directly upon the individual impact of the application. Successful use appears to require sufficient knowledge to understand and, if necessary, alter the application.

O O O B I 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 B I O O O O O O O O O O O B I 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 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

end user development
spreadsheet knowledge

end user computing
user-developed application success


In silico approaches for the identification of virulence candidates amongst hypothetical proteins of Mycoplasma pneumoniae 309 Genome sequence of Mycoplasma pneumoniae was extensively analyzed. Functions of 83HPs were successfully predicted with high accuracy. We found 23 enzymes, 12 transporter, 27 lipoproteins and 10 binding proteins among HPs. Many new virulent factors and adhesions were identified and characterized.

O O O O O O O O O O B I 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

hypothetical proteins
mycoplasma pneumoniae

function predictions
sequence analyses
virulence factors
molecular dynamics simulations


Prediction of reservoir sensitivity using RBF neural network with trainable radial basis function Reservoir sensitivity prediction is an important basis for designing reservoir protection program scientifically and exploiting oil and gas resources efficiently. Researchers have long endeavored to establish a method to predict reservoir sensitivity, but all of the methods have some limitations. Radial basis function (RBF) neural network, which provided a powerful technique to model non-linear mapping and the learning algorithm for RBF neural networks, corresponds to the solution of a linear problem, therefore it is unnecessary to establish an accurate model or organize rules in large number, and it enjoys the advantages such as simple network structure, fast convergence rate, and strong approximation ability, etc. However, different radial basis function has different non-linear mapping ability, and different data require different radial basis functions. Nowadays, the choice of radial basis function in the network is based on experience or test result only, which exerts a great adverse impact on the network performance. In this study, a new RBF neural network with trainable radial basis function was proposed by the linear combination of common radial basis functions. The input parameters of the network were the influence factors of reservoir sensitivity such as porosity and permeability, etc. The output parameter was the corresponding sensitivity index. The network was trained and tested with the data collected from our own experiments. The results showed that the new RBF neural network is effective and improved, of which the accuracy is obviously higher than the network with single radial basis function for the prediction of reservoir sensitivity.

B O B I O B I I O O B I I B I B 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 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 B I I 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 B I I 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 B I I O O O O O O O O O O O O O O O O B I I O O B O B I

rbf neural network
radial basis function
reservoir sensitivity
prediction
reservoir protection


OMAR: Utilizing multiuser diversity in wireless ad hoc networks One of the most promising approaches to improving communication efficiency in wireless communication systems is the use of multiuser diversity. Although it has been widely investigated and shown feasible and efficient in cellular networks, there is little work for the ad hoc networks, especially in real protocol and algorithm design. In this paper, we propose a novel scheme, namely, the Opportunistic Medium Access and Auto Rate (OMAR), to efficiently utilize the shared medium in IEEE 802.11-based ad hoc networks by taking advantage of diversity, distributed scheduling, and adaptivity. In an ad hoc network, especially in a heterogeneous ad hoc network or a mesh network, some nodes may need to communicate with multiple one-hop nodes. We allow such a node with a certain number of links to function as a clusterhead to locally coordinate multiuser communications. We introduce a CDF-based ( Cumulative Distribution Function) K-ary opportunistic splitting algorithm and a distributed stochastic scheduling algorithm to resolve intra and intercluster collisions, respectively. Fairness is formulated and solved in terms of social optimality within and across clusters. Analytical and simulation results show that our scheme can significantly improve communication efficiency while providing social fairness.

O O B I O B I I 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 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 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

wireless ad hoc networks
multiuser diversity
opportunistic medium access
auto rate


New algorithms for binary jumbled pattern matching Two new algorithms for binary jumbled pattern matching. We present the first solution for this problem based on word-level parallelism. A variant of the RLE based index with better query time at the price of extra space.

O O O O B I I 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

combinatorial problems
string algorithms
parikh vectors
run-length encoding
word-level parallelism


Decidability of code properties We explore the borderline between decidability and undecidability of the following question: " Let C be a class of codes. Given a machine M of type X, is it decidable whether the language L( M) lies in C or not?" for codes in general,omega codes, codes of finite and bounded deciphering delay, prefix, suffix and bi(pre)fix codes, and for finite automata equipped with different versions of push- down stores and counters.

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 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

partially blind counter machines
prefix code
infix code
bifix code


A boundary element method for transient piezoelectric analysis In this paper, a boundary element (BE) formulation is developed originally which treats three-dimensional problems of transient piezoelectricity. The approach at hand uses the fundamental solution of the static piezoelectric operator instead of the transient one. This results in a domain integral appearing in the representation formula, which contains the inertia term. This domain integral can be transformed to the boundary using the dual reciprocity method (DRM), which leads to a system of ordinary differential equations in time domain, similar to the systems obtained in standard finite element methods (FEM). The DRM has been chosen because of the difficulties and big computational effort involved in a BE implementation, which makes use of the anisotropic transient piezoelectric fundamental solution. It is an approach that appears to be much too time-consuming for use in a commercial BE code, in which computational costs is an important issue. The method presented in this paper is validated by a numerical example for transient piezoelectricy, which demonstrates excellent agreement with FE computations for the generalized displacements, and an improved accuracy for the flux quantities such as electric field and elastic stresses.

O B I I 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 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

boundary element method
transient piezoelectric analysis
dual reciprocity method


A trust-based consumer decision-making model in electronic commerce: The role of trust, perceived risk, and their antecedents Are trust and risk important in consumers' electronic commerce purchasing decisions? What are the antecedents of trust and risk in this context? How do trust and risk affect an Internet consumer's purchasing decision? To answer these questions, we i) develop a theoretical framework describing the trust-based decision-making process a consumer uses when making a purchase from a given site, ii) test the proposed model using a Structural Equation Modeling technique on Internet consumer purchasing behavior data collected via a Web survey, and iii) consider the implications of the model. The results of the study show that Internet consumers' trust and perceived risk have strong impacts on their purchasing decisions. Consumer disposition to trust, reputation, privacy concerns, security concerns, the information quality of the Website, and the company's reputation, have strong effects on Internet consumers' trust in the Website. Interestingly, the presence of a third-party seal did not strongly influence consumers' trust.

O O O O O O B I B I I I B I O O O O O O O O O O B I 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 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

the role of trust
electronic commerce
antecedents of trust
perceived risk

consumer trust
internet consumer behavior
trusted third-party seal
privacy and security


Optimal value range in interval linear programming We deal with the linear programming problem in which input data can vary in some given real compact intervals. The aim is to compute the exact range of the optimal value function. We present a general approach to the situation the feasible set is described by an arbitrary linear interval system. Moreover, certain dependencies between the constraint matrix coefficients can be involved. As long as we are able to characterize the primal and dual solution set (the set of all possible primal and dual feasible solutions, respectively), the bounds of the objective function result from two nonlinear programming problems. We demonstrate our approach on various cases of the interval linear programming problem (with and without dependencies).

B I I O 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 O O O O O O O O O O O O O O O O B I O O O O O

linear interval systems
interval matrix
dependence


Automatic extraction of biomolecular interactions: an empirical approach We describe a method for extracting data about how biomolecule pairs interact from texts. This method relies on empirically determined characteristics of sentences. The characteristics are efficient to compute, making this approach to extraction of biomolecular interactions scalable. The results of such interaction mining can support interaction network annotation, question answering, database construction, and other applications.

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 B I O O O O O O O O O O O O O O O O O O O

information extraction
text mining
networks


Voltage distribution along a long ceramic insulator string in a high-voltage tower window Purpose - The purpose of this paper is to introduce an efficient model for analysis of the voltage distribution along the long ceramic insulator strings in a high-voltage tower window, especially when the structure and parameters of the ceramic insulator are unknown. The effect of the grading ring on the voltage distribution is also investigated. Design/methodology/approach - A circuit model composed of capacitors is used to analyze the voltage distribution along the ceramic insulator strings in a transmission tower window. The capacitances of the disk insulators, line conductors, and tower are obtained by using the finite element method, charge simulation method, boundary element method, and measurement according to their characteristics. Findings - The model is very efficient. The voltage distribution along insulator strings can be optimized by adjusting the parameters of the grading ring. The maximum amount of voltage applied to a single insulator disk can be reduced effectively by increasing either the diameter of the grading ring or the distance from the upper surface of the grading ring to the high-voltage end of the insulator string. Originality/value - The model is very efficient for analysis of the voltage distribution along the long ceramic insulator strings, especially when the structure and parameters of the ceramic insulator are unknown.

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 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 O O O O O O O O O O O O O O O O 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 O O O O O O O O O O O O O O O O O O O O O O O O O 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

boundary-elements methods
circuit theory
electrical insulation devices
electric field effects


On computing the coefficients of bivariate holonomic formal series In this work, we study the problem of computing the coefficients of holonomic formal series in two commuting variables. Given a formal series phi(x, y) = Sigma(n,k) >= 0 c(nk)x(n) y(k) specified by a holonomic system Sigma(j=0)(d1) pj(x, y)phi(x)(j)phi = 0 and Sigma(j=0)(d2) qj(x,y)phi(y)(j)phi =0, with a suitable finite set of initial conditions {[x(a)y(b)]phi(x,y)}, we show that the coefficient [x(i)y(j)]phi(x,y) can be computed in time O(i + j) under the uniform cost criterion. (c) 2005 Elsevier B.V. All rights reserved.

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 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


On conditional diagnosability of the folded hypercubes The n-dimensional folded hypercube FQ(n), a variation of the hypercube proposed by Ahmed et al. [A. El-Amawy, S. Latifi, Properties and performance of folded hypercubes, IEEE Transactions on Parallel and Distributed Systems 2(3) (1991) 31-42], is an (n + 1)-regular (n + 1)-connected graph. Conditional diagnosability, a new measure of diagnosability introduced by Lai et al. [Pao-Lien Lai, Jimmy J.M. Tan, Chien-Ping Chuang, Lih-Hsing Hsu, Conditional diagnosability measures for large multiprocessor systems, IEEE Transactions on Computers 54(2) (2005) 165-175] can better measure the diagnosability of regular interconnection networks. This paper determines that under PMC-model the conditional diagnosability of FQ(n) (t(c)(FQ(n))) is 4n - 3 when n = 5 or n >= 8; t(c)(FQ(3)) = 3, t(c)(FQ(4)) = 7. (c) 2007 Elsevier Inc. All rights reserved.

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 O O O 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 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 O O O O O O O O O O


Universal Web Pages Content Parser This article describes the universal web pages content parser - cross-platform application enhancing the process of data extraction from the web pages. In this implementation user friendly interface, possibility of significant automation and reusability of already created patterns had been the key elements. Moreover, the original approach to the issue of parsing the not well-formed HTML, stating the application's core, is precisely presented. Universal web pages content parser shows that the simplified web scrapping utility may be available to masses and not well-formed HTML sources may feed useful tree-like data structures as well as the well-formed ones.

O B O B I O O O O O B 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 B O O O O O O O O B O B I O O O O B O O O O O O O O O O B O O O O O O O O O O O O O