Bees algorithm for null synthesizing of linear antenna arrays by controlling only the element positions This paper presents bees algorithm (BA) for null steering of linear antenna arrays by controlling only the element positions. The BA is an optimization algorithm inspired by the natural foraging behavior of honey bees to find the optimal solution. To show the versatility and flexibility of the proposed BA, several examples of Chebyshev array pattern with the imposed single, multiple and broad nulls are given. It is found that the nulling technique based on BA is capable of steering the array nulls precisely to the undesired interference directions. For practical consideration, the sensitivity of the produced patterns due to small variations of the element positions is also examined by rounding the element position values to the second decimal position.

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

antenna array
pattern nulling
position-only control
pattern synthesis


Recovering Over-/Underexposed Regions in Photographs When taking pictures using a commodity camera in a scene with strong or harsh lighting, such as a sunny day outdoors, we often see a loss of highlight details (overexposure) in some bright regions and a loss of shadow details (underexposure) in some dark regions. In this paper, we develop a wavelet tight frame-based approach to reconstruct a well-exposed image with better visibility of details than that with over-/underexposed regions. There are two modules in the proposed approach: one in lightness channels that inpaints the clipped lightness and adjusts image contrast, and the other in chromatic channels that inpaints the saturated color regions. The experiments show that our method can effectively repair over-/underexposed regions, and it performs better than other existing methods on tested real photographs.

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

image inpainting
contrast enhancement
tight frame
sparse approximation


All-different polytopes We develop a parsimonious integer-programming model for all-different constraints.

polytope
facet
integer programming
all different
constraint programming
edge coloring


Multidimensional positive definite advection transport algorithm: An overview Multidimensional positive definite advection transport algorithm (MPDATA) was proposed in the early eighties as a simple positive-definite advection scheme with small implicit diffusion, for evaluating the advection of water-substance constituents in atmospheric cloud models. Over the two decades, MPDATA evolved from an advection scheme into a class of generalized transport algorithms that expand beyond advective transport to alternate PDEs and complete fluid models with a wide range of underlying governing equations. Recently, MPDATA has attracted attention in the context of several mutually-beneficial developments such as (i) quantification of MPDATA implicit turbulence modelling capability in the spirit of monotonically integrated large eddy simulations (MILES), (ii) extensions to flow solvers cast in generalized time-dependent curvilinear coordinates, and (iii) unstructured-grid formulations. The aim of this paper is to assist the special issue on MPDATA methods for fluids by providing an up to date comprehensive review of the approach, including the underlying concepts, principles of implementation, and guidance to the accumulated literature. Copyright (c) 2005 John Wiley & Sons, Ltd.

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

nonoscillatory advection schemes
finite volume methods


GOODNESS-OF-FIT TEST FOR THE ACCELERATED FAILURE TIME MODEL BASED ON MARTINGALE RESIDUALS The Accelerated Failure Time model presents a way to easily describe survival regression data. It is assumed that each observed unit ages internally faster or slower, depending on the covariate values. To use the model properly, we want to check if observed data fit the model assumptions. In present work we introduce a goodness-of-fit testing procedure based on modern martingale theory. On simulated data we study empirical properties of the test for various situations.

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


Calculating the minimal number of homogeneous objects to represent a plurality in a heterogeneous system of objects Formulae for calculating the minimal number of homogeneous objects to constitute a plurality of objects within a finite heterogeneous system are presented. Such a system is searched for among all systems that can be formed by groups of available types of homogeneous objects and consist of one and the same total number of objects grouped into one and the same number of groups of homogeneous objects. (C) 2004 Elsevier Ltd. All rights reserved.

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


An attractor network model of serial recall We present a neural network model of verbal working memory which attempts to illustrate how a few simple assumptions about neural computation can shed light on cognitive phenomena associated with the serial recall of verbal material. We assume that neural representations are distributed, that neural connectivity is massively recurrent, and that synaptic efficacy is modified based on the correlation between pre- and post-synaptic activity (Hebbian learning). Together these assumptions give rise to emergent computational properties that are relevant to working memory, including short-term maintenance of information, time-based decay, and similarity-based interference. We instantiate these principles in a specific model of serial recall and show how it can both simulate and explain a number of standard cognitive phenomena associated with the task, including the effects of serial position, word length, articulatory suppression (and its interaction with word length), and phonological similarity.

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

verbal working memory
serial recall
attractor network
phonological similarity
articulatory suppression
word length

learning & memory
recurrent neutral network
primacy
recency


Extended parametric meshless Galerkin method The parametric meshless Galerkin method (PMGM), which has recently emerged in the field of meshless methods, enhances the efficiency of meshless methods through the use of meshless shape functions which are mapped from a parametric space to the physical space. This property helps to save the running-time needed to calculate the meshless shape functions, which is a time consuming and complicated task. However, the meshless shape functions need to be regenerated in the vicinity of the boundaries as well as some other locations after mapping. In this paper, a new extension of the PMGM, called extended parametric meshless Galerkin method (X-PMGM) is presented. In this method, it is not necessary to regenerate the meshless shape functions near the boundaries, and instead, the approximation is enriched using discontinuous fields through a partition of unity method. Therefore the amount of shape functions regeneration is decreased which improves the efficiency of the method. Numerical examples show that very accurate results and computational time savings of about 80% are achieved comparing with the element-free Galerkin method results.

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

extended
parametric
meshless
partition of unity


Information security tools and practices: What works? Much effort has been expended characterizing the threats and vulnerabilities associated with information security. The next step, analyzing experiences using security practices and tools, provides insight into what works and what appears to be unused or ineffective. This paper presents a brief analysis of data gathered from small businesses in the US regarding their experiences and practices. While the use of security-related tools is limited, there are some clear indicators that emerge from the analysis. Two critical inferences are that restrictive access control practices work to reduce problems and that the use of tools is related to a higher incident rate of problems. This may mean that those who experience problems are more likely to invest in control mechanisms.

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

computer security
security technologies
best business practices
current business practices


image annotation based on recommendation model In this paper, a novel approach based on recommendation model is proposed for automatic image annotation. For any to-be-annotated image, we first select some related images with tags from training dataset according to their visual similarity. And then we estimate the initial ratings for tags of the training images based on tag ranking method and construct a rating matrix. We also construct a trust matrix based on visual similarity with a k-NN strategy. Then a recommendation model is built on both matrices to rank candidate tags for the target image. The proposed approach is evaluated using two benchmark image datasets, and experimental results have indicated its effectiveness.

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


enhancing web browsing security on public terminals using mobile composition This paper presents an architecture that affords mobile users greater trust and security when browsing the internet (e.g., when making personal/financial transactions) from public terminals at Internet Cafes or other unfamiliar locations. This is achieved by enabling web applications to split their client-side pages across a pair of browsers: one untrusted browser running on a public PC and one trusted browser running on the user's personal mobile device, composed into a single logical interface through a local connection, wired or wireless. Information entered via the personal device's keypad cannot be read by the PC, thwarting PC-based key-loggers. Similarly, information displayed on the personal device's screen is also hidden from the PC, preserving the confidentiality and integrity of security-critical data even in the presence of screen grabbing attacks and compromised PC browsers. We present a security policy model for split-trust web applications that defends against a range of crimeware-based attacks, including those based on active-injection (e.g. inserting malicious packets into the network or spoofing user-input events). Performance results of a prototype split-trust implementation are presented, using a commercially available cell phone as a trusted personal device.

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

split-trust
user interface design
crimeware
phishing


Adaptive kernel approach to the time series prediction This short article describes two kernel algorithms of the regression function estimation. One of them is called HASKE and has its own heuristic of the h parameter evaluation. The second is a hybrid algorithm that connects the SVM and HASKE in such a way that the definition of the local neighborhood is based on the definition of the h-neighborhood from HASKE. Both of them are used as predictors for time series.

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

support vector machine
kernel estimators
non-parametric regression


Interactive authoring of multimedia documents in a constraint-based authoring system As multimedia applications spread widely, it is crucial for programming and design support systems to handle "time" in multimedia documents effectively and flexibly. This paper presents a set of interactive system support tools for designing and maintaining the temporal behavior of multimedia documents. The tool set provides mechanisms for anomaly detection, temporal query processing, and interactive scheduling. It is based on a fast incremental constraint solver we have developed, which can be adapted by any constraint-based system. The incremental constraint solver provides immediate feedback to the user, supporting a highly Interactive design process. Combined with existing optimal layout generation mechanisms proposed in the literature, our tools effectively utilize the flexibility provided by constraint-based systems.

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

multimedia authoring
interactive systems
temporal constraint systems
incremental algorithms


Hybrid learning for interval type-2 fuzzy logic systems based on orthogonal least-squares and back-propagation methods This paper presents a novel learning methodology based on a hybrid algorithm for interval type-2 fuzzy logic systems. Since only the back-propagation method has been proposed in the literature for the tuning of both the antecedent and the consequent parameters of type-2 fuzzy logic systems, a hybrid learning algorithm has been developed. The hybrid method uses a recursive orthogonal least-squares method for tuning the consequent parameters and the back-propagation method for tuning the antecedent parameters. Systems were tested for three types of inputs: (a) interval singleton, (b) interval type-1 non-singleton, and (c) interval type-2 non-singleton. Experiments were carried out on the application of hybrid interval type-2 fuzzy logic systems for prediction of the scale breaker entry temperature in a real hot strip mill for three different types of coil. The results proved the feasibility of the systems developed here for scale breaker entry temperature prediction. Comparison with type-1 fuzzy logic systems shows that hybrid learning interval type-2 fuzzy logic systems provide improved performance under the conditions tested.

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

uncertain rule-based fuzzy logic systems


An unconditional study of computational zero knowledge We prove a number of general theorems about ZK, the class of problems possessing ( computational) zero-knowledge proofs. Our results are unconditional, in contrast to most previous works on ZK, which rely on the assumption that one-way functions exist. We establish several new characterizations of ZK and use these characterizations to prove results such as the following: 1. Honest-verifier ZK equals general ZK. 2. Public-coin ZK equals private-coin ZK. 3. ZK is closed under union. 4. ZK with imperfect completeness equals ZK with perfect completeness. 5. Any problem in ZK boolean AND NP can be proven in computational zero knowledge by a BPP(NP) prover. 6. ZK with black-box simulators equals ZK with general, non-black-box simulators. The above equalities refer to the resulting class of problems ( and do not necessarily preserve other efficiency measures such as round complexity). Our approach is to combine the conditional techniques previously used in the study of ZK with the unconditional techniques developed in the study of SZK, the class of problems possessing statistical zero-knowledge proofs. To enable this combination, we prove that every problem in ZK can be decomposed into a problem in SZK together with a set of instances from which a one-way function can be constructed.

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

cryptography
computational complexity
zero-knowledge proofs
pseudoentropy
language-dependent commitment schemes
auxiliary-input one-way functions


A physically based flux limiter for QUICK calculations of advective scalar transport Transient, advective transport of a contaminant into a clean domain will exhibit a moving sharp front that separates contaminated and clean regions. Due to 'numerical diffusion'-the combined effects of 'crosswind diffusion' and 'artificial dispersion'-a numerical solution based on a first-order (upwind) treatment will smear out the sharp front. The use of higher-order schemes, e.g. QUICK (quadratic upwinding) reduces the smearing but can introduce non-physical oscillations in the solution. A common approach to reduce numerical diffusion without oscillations is to use a scheme that blends low-order and high-order approximations of the advective transport. Typically, the blending is based on a parameter that measures the local monotonicity in the predicted scalar field. In this paper, an alternative approach is proposed for use in scalar transport problems where physical bounds C-Low <= C <= C-High on the scalar are known a priori. For this class of problems, the proposed scheme switches from a QUICK approximation to an upwind approximation whenever the predicted upwind nodal value falls outside of the physical range [C-Low, C-High]. On two-dimensional steady-state and one-dimensional transient test problems predictions obtained with the proposed scheme are essentially indistinguishable from those obtained with monotonic flux-limiter schemes. An analysis of the modified equation explains the observed performance of first- and second-order time-stepping schemes in predicting the advective transport of a step. In application to the transient two-dimensional problem of contaminate transport into a streambed, predictions obtained with the proposed flux-limiter scheme agree with those obtained with a scheme from the literature. Copyright (c) 2007 John Wiley & Sons, Ltd.

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

advection transport
dissipation error
cross-wind diffusion


A comparison of analytical-numerical models for nonlinear vibrations of cylindrical shells The nonlinear flexural vibration behaviour of cylindrical shells has received considerable attention to date. It is pointed out that, although in a well-known reference case there seems to be a reasonable agreement, there are unresolved discrepancies between the results obtained by different authors. In the present paper, the problem is studied using various analytical-numerical models with different levels of accuracy and complexity. The frequency-amplitude curves from the different analysis models developed are compared both for isotropic shells and for an orthotropic composite shell. Secondary modes can play an important role. In more complicated cases modal interactions may significantly influence the nonlinear vibration behaviour, and the results obtained strongly depend on the analysis model chosen. (C) 2004 Elsevier Ltd. All rights reserved.

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


an optimistic technique for transactions control using rest architectural style SOA is a service oriented architecture that allows development of software with interoperability and weak coupling. Nowadays WS-* is the most used SOAP-based specification set for constructing web services. REST is an architectural style that permits the development of services in a simpler way and obeys the SOA's paradigm, however, it does not provide standardized support to address some nonfunctional requirements of services, for instance, security, reliability, transaction control. This article proposes a technique, based on REST, to support the web services transactional control implementation. The technique uses the optimistic method to control distributed systems transactions. An example of application was implemented to show its feasibility.

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

rest
transaction
architectural style
web services


Growth optimal investment in discrete-time markets with proportional transaction costs Achieving optimal expected growth in i.i.d. discrete-time markets. Efficient recursive calculation via an irreducible Markov chain formulation. Successful application to Brownian markets and historical data.

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

growth optimal portfolio
threshold rebalancing
proportional transaction cost
discrete-time stock market


design of adaptive modulation and coding system using ideal performance codes A major issue in feedback systems is to use the feedback bits most efficiently. In this paper, we use information theory to get an upper limit on the value of feedback bits in an optimum AMC system. The AMC optimization problem is simplified by using ideal error performance (i. e. a step function like performance curve) characteristic of capacity-reaching codes. Given a strong enough code such as turbo code similar step function based approximation can be used. The results show nice match between the solution sets from the ideal error performance approximation and the real error performance.

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


On the error linear complexity spectrum of \(p^{n}\)-periodic binary sequences The error linear complexity spectrum of a periodic sequence is defined to be the ordered list of \(k\)-error linear complexities of the sequence. In this paper, we present an algorithm which computes the error linear complexity spectrum for binary sequences with period \(p^{n}\), where \(p\) is an odd prime and \(2\) is a primitive root modulo \(p^{2}\).

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

\(k\)-error linear complexity
error linear complexity spectrum
stream cipher


Using reordering technique for mobile transaction management in broadcast environments As computer hardware and wireless network technologies are developed to a high degree, there are many research efforts which intend to utilize data broadcasting to a large population of mobile clients through wireless channels. In recent years, different models of data delivery have been explored, particularly the periodic push model where the server repetitively disseminates information without any explicit request. In this paper, we devise new transaction processing algorithms, O-Post for update transactions and O-Pre for read-only transactions, in broadcast environments. Basically, each client executes its transactions in an optimistic manner and does some consistency checks based on periodic invalidation reports. When any kind of conflicts is found, the conflict order is determined according to the notion of reordering and the remaining operations are executed to hold the decision. We also develop a cache algorithm to cope with frequent restarts due to the optimistic execution. Experimental results are given to show the benefits of the proposed algorithms.

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

wireless mobile computing
data broadcast
local caching


Evolving spiking neural networks for personalised modelling, classification and prediction of spatio-temporal patterns with a case study on stroke The paper presents a novel method and system for personalised (individualised) modelling of spatio/spectro-temporal data (SSTD) and prediction of events. A novel evolving spiking neural network reservoir system (eSNNr) is proposed for the purpose. The system consists of spike-time encoding module of continuous value input information into spike trains; a recurrent 3D SNNr; eSNN as an evolving output classifier. Such system is generated for every new individual, using existing data of similar individuals. Subject to proper training and parameter optimisation, the system is capable of accurate spatio-temporal pattern recognition (STPR) and of early prediction of individual events. The method and the system are generic, applicable to various SSTD and classification and prediction problems. As a case study, the method is applied for early prediction of occurrence of stroke on an individual basis. Preliminary experiments demonstrated a significant improvement in accuracy and time of event prediction when using the proposed method when compared with standard machine learning methods, such as MLR, SVM, and MLP. Future development and applications are discussed.

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

personalised modelling
spiking neural networks

spatio-temporal pattern recognition
evolving connectionist systems
stroke occurrence prediction


Automatic highlights extraction for drama video using music emotion and human face features This paper describes a novel system that uses music emotion and human face as features for automatic highlights extraction for drama video. These high-level audiovisual features are used because music evokes emotion response from the viewer and characters express emotion on their faces. In addition, a novel scheme is developed to improve the accuracy of music emotion recognition in drama video. Specifically, emotion recognition is performed not on the input audio signal but on the noise-free music available from the album of the incidental music, with the presence of incidental music detected by an audio fingerprint technique. Besides the conventional subjective evaluation, we propose a new metric for quantitative performance evaluation of highlights extraction. Experiments conducted over four different types of drama videos demonstrate that the proposed system significantly outperforms baseline ones in terms of both subjective and objective measures.

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

affective content
video highlights extraction
music detection
video highlights evaluation


Ab initio calculations of molecular properties of low-lying electronic states of 2-cyclopenten-1-one - link with biological activity Geometries, vibrational frequencies, vertical and adiabatic excitation energies, dipole moments and dipole polarizabilities of the ground and the three lowest electronic excited states, S-1(n, pi (*)), T-1(n, pi (*)), and T-2(pi, pi (*)) of the 2-cyclopenten-1-one molecule (2CP) were calculated at the CCSD and CCSD(T) levels of approximation. Our results indicate that two triplets T-1(n, pi (*)) and T-2(pi, pi (*)) are lying very close each to other, while the singlet S-1(n, pi (*)) is well above them. There are dramatic changes in dipole moments for (n, pi (*)) excited states in respect to the ground state. On the other hand the T-2(pi, pi (*)) state has a similar dipole moment as the ground state. These changes can be interpreted within the MO picture using electrostatic potential maps and changes in model IR spectra. Our CCSD(T) dipole moment data for the ground state and almost isoenergetic triplets T-1(n, pi (*)) and T-2(pi, pi (*)) are 1.469 a.u., 0.551 a.u., and 1.124 a.u., respectively. Dipole polarizabilities of investigated excited states are much less affected by electron excitations than dipole moments. These are the first dipole moment and polarizability data of 2CP in the literature. The changes of molecular properties upon excitation to S-1(n, pi (*)) and T-1(n, pi (*)) correlate with the experimental data on the biological activity of 2CP related to the alpha, beta-unsaturated carbonyl group.

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

alpha,beta-unsaturated carbonyl group
dipole moments and polarizabilities
2-cyclopenten-1-one


Architecting J2EE based applications on multiple layers This paper presents a layered model that can be used to construct well designed enterprise applications. The proposed model describes how an enterprise application can be divided into 9 essential layers as follows: Persistence, Domain, Services, Facades, Factories, DTO, Delegates, Application and Presentation. This model encapsulates a clear separation of the roles of each layer. The main goal of the model is to provide all the necessary information that the enterprise application designers need in order to build an enterprise application backbone that will support the development of efficient; scalable and maintainable enterprise applications. Another goal is to isolate the end programmers from the complexity of enterprise design patterns.

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

enterprise application
design
multiple layers


Generational analysis of variety in data structures: impact on automatic data integration and on the semantic web We examine data definition languages (DDLs) from various computing era spanning almost 50 years to date. We prove that contemporary DDLs are indistinguishable from older ones using Zipf distribution of words, Zipf distributions of meanings, and information theory. None addresses the Law of Requisite Variety, which is necessary for enabling automatic data integration from autonomous heterogeneous data sources and for the realization of the Semantic Web. The growth of the entire computing industry is hampered by the lack of progress in the development of DDLs suitable for these two goals. Our findings set the stage for the future development of a mathematically sound DDL better suited for the aforementioned purposes.

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

data integration
semantic web
data definition languages
zipf distribution
law of requisite variety

information systems models and principles


Visualization of interfirm relations in a converging mobile ecosystem The mobile ecosystem is characterized by a large and complex network of companies interacting with each other, directly and indirectly, to provide a broad array of mobile products and services to end-customers. With the convergence of enabling technologies, the complexity of the mobile ecosystem is increasing multifold as new actors are emerging, new relations are formed, and the traditional distribution of power is shifted. Drawing on theories of network science, complex systems, interfirm relationships, and the creative art and science of visualization, this paper identifies key players and maps the complex structure and dynamics of nearly 7000 global companies and over 18,000 relationships in the converging mobile ecosystem. Our approach enables decision makers to (i) visually explore the complexity of interfirm relations in the mobile ecosystem, (ii) discover the relation between current and emerging segments, (iii) determine the impact of convergence on ecosystem structure, (iv) understand a firm's competitive position, and (v) identify interfirm relation patterns that may influence their choice of innovation strategy or business models. Journal of Information Technology (2009) 24,144-159. doi:10.1057/jit.2008.34; published online 24 February 2009

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

mobile ecosystem
innovation
convergence
visualization


On the Deterministic Code Capacity Region of an Arbitrarily Varying Multiple-Access Channel Under List Decoding We study the capacity region C-L of an arbitrarily varying multiple-access channel (AVMAC) for deterministic codes with decoding into a list of a fixed size L and for the average error probability criterion. Motivated by known results in the study of fixed size list decoding for a point-to-point arbitrarily varying channel, we define for every AVMAC whose capacity region for random codes has a nonempty interior, a nonnegative integer Omega called its symmetrizability. It is shown that for every L = (Omega + 1)(2), C-L equals the nondegenerate capacity region of the AVMAC for random codes with a known single-letter characterization. For a binary AVMAC with a nondegenerate random code capacity region, it is shown that the symmetrizability is always finite.

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

capacity region
deterministic code
list decoding
random code
symmetrizability

arbitrarily varying channel (avc)
multiple-access channel


hybrid test of web applications with webtest In this paper, we present hybrid testing , a method that combines replay-testing ( static testing ) with automata learning techniques that generate models of black box systems ( dynamic testing ). This combination helps bridging the gap towards model based testing also for legacy systems. Webtest is an implementation of hybrid testing that builds on top of preexisting technology such as the LearnLib , a framework for automata learning, and the jABC , a framework for model-driven and service-oriented design, that we use here for modelling, executing, and managing test suites for and models of the web applications under analysis. In particular we intend to move towards Rich Internet Applications (RIAs), that include e.g. advanced client side capabilities and access to heavy resources (e.g. database access) over the Web.

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

automata learning
web applications
testing


Natural convection in porous annular domains: Mimetic scheme and family of steady states Natural convection of the incompressible fluid in the porous media based on the Darcy hypothesis (Lapwood convection) gives an intriguing branching off of one-parameter family of steady patterns. This scenario may be suppressed in computations when governing equations are approximated by schemes which do not preserve the cosymmetry property. We consider the problem for the annular porous domain in polar coordinates and derive a mimetic finite-difference scheme. This scheme allows to compute the family of convective regimes accurately and to detect the instabilities on some parts of the family.

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

natural convection
mimetic scheme
family of steady states
cosymmetry

darcy law
porous medium
finite-difference method


Modular Composition Modulo Triangular Sets and Applications We generalize Kedlaya and Umans' modular composition algorithm to the multivariate case. As a main application, we give fast algorithms for many operations involving triangular sets (over a finite field), such as modular multiplication, inversion, or change of order. For the first time, we are able to exhibit running times for these operations that are almost linear, without any overhead exponential in the number of variables. As a further application, we show that, from the complexity viewpoint, Charlap, Coley, and Robbins' approach to elliptic curve point counting can be competitive with the better known approach due to Elkies.

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

triangular set
power projection
finite fields


Large-Scale Live Active Learning: Training Object Detectors with Crawled Data and Crowds Active learning and crowdsourcing are promising ways to efficiently build up training sets for object recognition, but thus far techniques are tested in artificially controlled settings. Typically the vision researcher has already determined the datasets scope, the labels actively obtained are in fact already known, and/or the crowd-sourced collection process is iteratively fine-tuned. We present an approach for live learning of object detectors, in which the system autonomously refines its models by actively requesting crowd-sourced annotations on images crawled from the Web. To address the technical issues such a large-scale system entails, we introduce a novel part-based detector amenable to linear classifiers, and show how to identify its most uncertain instances in sub-linear time with a hashing-based solution. We demonstrate the approach with experiments of unprecedented scale and autonomy, and show it successfully improves the state-of-the-art for the most challenging objects in the PASCAL VOC benchmark. In addition, we show our detector competes well with popular nonlinear classifiers that are much more expensive to train.

O O B I O O O O O O O O B I O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 detection
large-scale learning
hashing
image annotation


Acoustic calculations with the hybrid boundary element method in time domain The boundary element method (BEM) is an efficient tool for the calculation of acoustic wave propagation in fluids. Transient waves can be solved by either using a formulation in frequency domain along with an inverse Fourier transformation or a time domain formulation. To increase the efficiency for the solver and allow for an efficient coupling with finite element domains the symmetry of the system matrices is advantageous. If Hamilton's principle is used, a symmetric variational formulation can be established with the velocity potential as field variable. The single field principle is generalized as multifield principle as basis of a hybrid BEM for the calculation of acoustic fields in compressible fluids in time domain. The state variables are separated into boundary variables, which are approximated by piecewise polynomials and domain variables, which are approximated by a superposition of weighted fundamental solutions. In both approximations the time and space dependency is separated. This is why static fundamental solution can be used for the field approximation. The domain integrals are eliminated, respectively, transformed into boundary integrals and an equation of motion with symmetric mass and stiffness matrix is obtained, which can be solved by a direct time integration scheme or by mode superposition. The time derivative of the equation of motion leads to a formulation with pressure and acoustic flux on the boundary for an easier interpretation of the variables.

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

hybrid boundary element method
time domain


Openness and Technology Diffusion in Payment Systems: The Case of NAFTA We study the relationship between openness and payment system development. In particular, we analyze how the existence of technology diffusion from a more developed country fosters a transformation of payment choice in a less developed country. We apply our analysis to Mexico. Economic growth in Mexico was not high enough to cause a transformation of payment choice observed in the data after 2001. We argue that the switch towards electronic payments can be attributed to openness and related payment technology spillovers from the US in the context of NAFTA.

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


Robust identification and control of batch processes An approach is proposed for the robust identification and control of batch and semibatch processes. The batch experiments used for model identification are designed by minimizing the magnitude of the parameter uncertainties, and the effect of these uncertainties on the product quality achievable by optimal control is used as a stopping criterion for the identification procedure. The optimal control approach incorporates a quantification of the impact of both parameter and control implementation uncertainties on the performance of the optimal control policy. The approach is applied to the nucleation and growth of crystals with multiple characteristic dimensions, where the nominal parameters used in the simulation study are quantified from experimental data. (C) 2003 Elsevier Science Ltd. All rights reserved.

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

parameter estimation
batch optimization
crystallization
population balance equations
distributed parameter systems


VEGA: a versatile program to convert, handle and visualize molecular structure on Windows-based PCs We here propose the program VEGA, that was developed to create a bridge between the most popular molecular software packages. In this tool some features are implemented some features to analyze, display and manage the three dimensional (3D) structure of the molecules. The most important features are (1) file format conversion (with assignment of the atom types and atomic charges), (2) surface calculation and (3) trajectory analysis. The executable and the source code can be free downloaded from http://users.unimi.it/?ddl.

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

molecular graphics
molecular modelling
molecular surfaces
data interchange


Detection of foreground in dynamic scene via two-step background subtraction Various computer vision applications such as video surveillance and gait analysis have to perform human detection. This is usually done via background modeling and subtraction. It is a challenging problem when the image sequence captures the human activities in a dynamic scene. This paper presents a method for foreground detection via a two-step background subtraction. Background frame is first generated from the initial image frames of the image sequence and continuously updated based on the background subtraction results. The background is modeled as non-overlapping blocks of background frame pixel colors. In the first step of background subtraction, the current image frame is compared with the background model via a similarity measure. The potential foregrounds are separated from the static background and most of the dynamic background pixels. In the second step, if a potential foreground is sufficiently large, the enclosing region is compared with the background model again to obtain a refined shape of the foreground. We compare our method with various existing background subtraction methods using image sequences containing dynamic background elements such as trees and water. We show through the quantitative measures the superiority of our method.

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

video surveillance
background subtraction
dynamic scene
foreground detection


Bezier surfaces of minimal area: The Dirichlet approach The Plateau-Bezier problem consists in finding the Bezier surface with minimal area from among all Bezier surfaces with prescribed border. An approximation to the solution of the Plateau-Bezier problem is obtained by replacing the area functional with the Dirichlet functional. Some comparisons between Dirichlet extremals and Bezier surfaces obtained by the use of masks related with minimal surfaces are studied. (C) 2003 Elsevier B.V. All rights reserved.

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

minimal surfaces
bezier surfaces
dirichlet functional


Can traditional fault prediction models be used for vulnerability prediction? Finding security vulnerabilities requires a different mindset than finding general faults in softwarethinking like an attacker. Therefore, security engineers looking to prioritize security inspection and testing efforts may be better served by a prediction model that indicates security vulnerabilities rather than faults. At the same time, faults and vulnerabilities have commonalities that may allow development teams to use traditional fault prediction models and metrics for vulnerability prediction. The goal of our study is to determine whether fault prediction models can be used for vulnerability prediction or if specialized vulnerability prediction models should be developed when both models are built with traditional metrics of complexity, code churn, and fault history. We have performed an empirical study on a widely-used, large open source project, the Mozilla Firefox web browser, where 21% of the source code files have faults and only 3% of the files have vulnerabilities. Both the fault prediction model and the vulnerability prediction model provide similar ability in vulnerability prediction across a wide range of classification thresholds. For example, the fault prediction model provided recall of 83% and precision of 11% at classification threshold 0.6 and the vulnerability prediction model provided recall of 83% and precision of 12% at classification threshold 0.5. Our results suggest that fault prediction models based upon traditional metrics can substitute for specialized vulnerability prediction models. However, both fault prediction and vulnerability prediction models require significant improvement to reduce false positives while providing high recall.

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

fault prediction
vulnerability prediction
open source project

software metrics
complexity metrics
automated text classification


Triangular norm-based iterative compensatory operators Aggregation operators based on a fixed t-norm and on suitable transformations of processed data are introduced. A special attention is paid to the class of iterative compensatory operators containing also the classical arithmetic, geometric and harmonic means. Several properties of introduced operators are studied, e.g., the symmetry, the associativity, the idempotency, the anihilation, etc. Several examples are given, including continuous idempotent bisymmetric iterative compensatory operators with zero anihilator. (C) 1999 Elsevier Science B.V. All rights reserved.

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

aggregation operator
iterative aggregation operator
compensatory operator
iterative compensatory operator
triangular norm


A comparative study of SOAP and DCOM Simple Object Access Protocol (SOAP) is a recent technology, which aims at replacing traditional methods of remote Communications. such as RPC-based Distributed Component Object Model (DCOM). Being designed with a goal of increasing interoperability among wide range of programs and environment. SOAP allows applications written in different languages and deployed on different platforms to communicate with each other over the network. While SOAP offers obvious benefits in the world of in teroperability. it comes at a price of performance degradation and additional development efforts required for implementation of features missing from SOAP, Such as security and state management. This paper reports the outcome of a comparative study of SOAP and DCOM in terms of features, development effort, and application performance. The results indicate that SOAP performance on a homogeneous platform is consistently worse than that of DCOM. Depending on the operation and the amount Of data transferred. SOAP performance degradation can range from minor (e.g. two or three times slower than DCOM) to major (e.g, twenty or more times slower). (C) 2004 Elsevier Inc. All rights reserved.

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

distributed computing
performance analysis


Logical ontology for mediating between nursing intervention terminology systems Objectives. Several researchers have proposed the use of logical ontologies as 'reference terminologies'. However, there ate a number of unresolved issues. This article describes the development of a logical ontology for nursing interventions and presents the results of evaluation. Methods: Initially this study involved the development in GRAIL of two separate experimental ontologies: an ontology based on the textual content of informal definitions for nursing interventions drawn from the Nursing Interventions Classification; and an ontology based on labels for the same nursing interventions. Following initial bench-testing, the ontology based on labels was selected for extension (to accommodate also nursing intervention components of the Home Health Care Classification System and the Omaha System), for further testing and for external evaluation. Results: A hierarchy of nursing interventions generated automatically from the experimental ontology based on informal definitions contained only 3 hierarchical relationships, compared to 214 for the initial ontology based on labels. For the final extended ontology based on labels, the generated hierarchy contained the three source terminology systems in entirely - there were a total of 2861 hierarchical relationships. While the results of comparative bench testing of the final ontology were favourable, the results of external evaluation were mixed and showed little agreement between reviewers, Conclusion: This study suggests that while a logical ontology based on labels might be a useful tool for mediating between nursing intervention terminology systems. a formative consensus type,development to harmonise ideological differences that may exist across the nursing profession.

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


Methods and numerical aspects of nanoscopic contact area estimation in atomistic tribological simulations We show how data obtained from molecular dynamics (MD) simulations of nanoscale friction should be treated for producing constitutive system parameters with a proper error estimation. A visualisation scheme for discrete atomistic geometries based on the smooth particle method (SPM) was parametrised and validated to yield an accurate and computationally robust estimation of the contact area between two touching nanoscopic asperities. We present some thoughts on the error estimation of the contact forces occurring due to the load and the shearing motion. The variance in the friction force constitutes the main source of error for the fitting of the constitutive system parameters. The dependence of the constitutive system parameters on the number of available data points was also studied. It was shown that an equal spacing (by load) of the data points can result in better values for the system parameters than the convergence trend suggests.

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

molecular dynamics
smooth particle method

nanotribology
three-term kinetic friction law


Deriving neural network controllers from neuro-biological data: implementation of a single-leg stick insect controller This article presents modular recurrent neural network controllers for single legs of a biomimetic six-legged robot equipped with standard DC motors. Following arguments of Ekeberg et al. (Arthropod Struct Dev 33:287-300, 2004), completely decentralized and sensori-driven neuro-controllers were derived from neuro-biological data of stick-insects. Parameters of the controllers were either hand-tuned or optimized by an evolutionary algorithm. Employing identical controller structures, qualitatively similar behaviors were achieved for robot and for stick insect simulations. For a wide range of perturbing conditions, as for instance changing ground height or up- and downhill walking, swing as well as stance control were shown to be robust. Behavioral adaptations, like varying locomotion speeds, could be achieved by changes in neural parameters as well as by a mechanical coupling to the environment. To a large extent the simulated walking behavior matched biological data. For example, this was the case for body support force profiles and swing trajectories under varying ground heights. The results suggest that the single-leg controllers are suitable as modules for hexapod controllers, and they might therefore bridge morphological- and behavioral-based approaches to stick insect locomotion control.

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

walking control
robotics
sensori-motor loops


gospel spectrum "God is in the details."In the world of design, Ludwig Mies van der Rohe's famous dictum regarding the importance of details in one's work has been the mantra for designers in various professions from architecture to new media.But what if God is literally the detail?The Gospel Spectrum is an interactive application exploring the story of Jesus Christ, who many believe is the Son of God, based on the dissection of the Gospels, the four books in the Bible-- Matthew, Mark, Luke, and John--that recount the story of Jesus' life from four different viewpoints. The Gospel Spectrum creates new insights on the narrative by employing principles of computational media and data visualization to deconstruct and then visually reconstruct the story.

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

user interface design
interaction design
graphic design
art
information architecture


Computational methods for modeling facial aging: A survey ? Facial aging, a new dimension that has recently been added to the problem of face recognition, poses interesting theoretical and practical challenges to the research community. The problem which originally generated interest in the psychophysics and human perception community has recently found enhanced interest in the computer vision community. How do humans perceive age? What constitutes an age-invariant signature that can be derived from faces? How compactly can the facial growth event be described? How does facial aging impact recognition performance? In this paper, we give a thorough analysis on the problem of facial aging and further provide a complete account of the many interesting studies that have been performed on this topic from different fields. We offer a comparative analysis of various approaches that have been proposed for problems such as age estimation, appearance prediction, face verification, etc. and offer insights into future research on this topic.

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


Measuring firm performance at the network level: A nomology of the business impact of digital supply networks For decades, information technology has been posited to have a major impact on firm performance. Investigations into this line of inquiry have almost always used constructs related to individual firm performance as their dependent measures, an approach that made sense under historical economic conditions. In recent years, however, value chains are giving way to digital supply networks with electronic interactions between tiers in the flow of goods and services. Such an environment makes it imperative to develop sophisticated measures of the performance of entire networks of firms, as opposed to individual firm performance. Using game-theoretic concepts, this paper explores several dimensions of networked organizational performance as a construct, as a set of measures, and as a construct within a nomology. It describes a program of research in which some empirical validation has already been completed and other work is now underway. We first validate measures for a dyadic view of network performance, followed by an n-firm perspective.

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

business networks
e-business
e-commerce
supply chains


On the spectral formulation of Granger causality Spectral measures of causality are used to explore the role of different rhythms in the causal connectivity between brain regions. We study several spectral measures related to Granger causality, comprising the bivariate and conditional Geweke measures, the directed transfer function, and the partial directed coherence. We derive the formulation of dependence and causality in the spectral domain from the more general formulation in the information-theory framework. We argue that the transfer entropy, the most general measure derived from the concept of Granger causality, lacks a spectral representation in terms of only the processes associated with the recorded signals. For all the spectral measures we show how they are related to mutual information rates when explicitly considering the parametric autoregressive representation of the processes. In this way we express the conditional Geweke spectral measure in terms of a multiple coherence involving innovation variables inherent to the autoregressive representation. We also link partial directed coherence with Sims' criterion of causality. Given our results, we discuss the causal interpretation of the spectral measures related to Granger causality and stress the necessity to explicitly consider their specific formulation based on modeling the signals as linear Gaussian stationary autoregressive processes.

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

granger causality
partial directed coherence
directed transfer function
transfer entropy


Beam search algorithms for multilabel learning Multilabel learning is a machine learning task that is important for applications, but challenging. A recent method for multilabel learning called probabilistic classifier chains (PCCs) has several appealing properties. However, PCCs suffer from the computational issue that inference (i.e., predicting the label of an example) requires time exponential in the number of tags. Also, PCC accuracy is sensitive to the ordering of the tags while training. In this paper, we show how to use the classical technique of beam search to solve both these problems. Specifically, we show how to apply beam search to make inference tractable, and how to integrate beam search with training to determine a suitable tag ordering. Experimental results on a range of datasets show that the proposed improvements yield a state-of-the-art method for multilabel learning.

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

multilabel classification
probabilistic models
structured prediction


A

new

reengineering

methodology

for

the

product-driven

system

applied

to

the

medication-use

process

The

aim

of

the

medication-use

process

(MUP)

of

a

hospital

consists

in

preparing

the

medicines

for

each

patient

every

day.

The

reengineering

of

the

MUP

is

an

important

challenge

in

order

to

reduce

medication

errors

and

costs

for

the

pharmacy.

This

paper

deals

with

a

new

methodology

of

modeling

the

interactions

with

the

hospital

information

system

(HIS).

This

methodology

is

inspired

by

component-based

approach,

the

paradigm

of

system

of

systems

(SoS)

and

the

methodology

ASDI

(analysisspecificationdesignimplementation).

First,

the

paper

shows

how

the

MUP

can

be

compared

to

a

holonic

manufacturing

system

(HMS).

So

then,

the

goal

of

the

new

methodology

proposed

consists

of

designing

easily

a

library

of

components

for

an

HMS

and

more

specifically

for

a

MUP

in

a

hospital.

Finally,

an

example

of

the

application

of

this

modeling

to

the

hospital

of

Clermont-Ferrand

is

presented.

The

goal

is

to

help

the

pharmacists

to

make

up

their

decisions

in

order

to

reorganize

and

design

a

new

pharmacy

of

a

hospital.

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

holonic manufacturing system
hospital information system
system of systems

medication-use process
product-driven system


Adaptive neuro-fuzzy inference systems for epidemiological analysis of soybean rust The objective of this work was to develop and to evaluate adaptive neuro-fuzzy inference systems as methodology to describe the severity of soybean rust (Phakopsora pachyrhizi) monocyclic process in soybean [Glycine max (L.) Merr.], under effects of leaf wetness, temperature, and days after fungi inoculation. The experiment was conducted in growth chambers with mean air temperatures of 15, 20, 25 and 30C and leaf wetness periods of 6, 12, 18 and 24h. The plants were inoculated by spraying a suspension of P.pachyrhizi inoculum at concentration of 104 uredinosporemL?1. A disease assessment key was adopted for estimate amounts of soybean rust at 0, 6, 9, 12 and 15 days after fungi inoculation. A hybrid neural network training with 3 and 3000 epochs was applied to disease severity data for optimization of fuzzy system parameters used to describe the severity of soybean rust based on leaf wetness, temperature and days after fungi inoculation. Higher accuracy and precision of the neuro-fuzzy systems estimates were obtained after training with 3000 epochs. Nevertheless, training with 3 epochs produced smoother estimates. The neuro-fuzzy systems enabled to describe the severity of soybean rust monocyclic process under effects of leaf wetness, mean air temperature and days after fungi inoculation and was better applied for Conquista cultivar, followed by Savana and Suprema cultivars. Higher soybean rust severity was verified under temperatures among 20C and 25C, leaf wetness above 6h, with higher values above 10h, and 15 days after fungi inoculation. Temperatures near 15C increased the latent period of the disease but not inhibited its development after 10 days of fungi inoculation.

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

epidemiology
modeling
neuro-fuzzy
anfis
artificial intelligence
fuzzy logic
neural networks


A simple correction method of inner filter effects affecting FEEM and its application to the PARAFAC decomposition In this paper we introduce a new inner filters correction method for standard fluorometer. The Controlled Dilution Approach (CDA) deals with highly absorbing solutions using the Fluorescent Excitation-Emission Matrix of a controlled weak dilution. Along with the nonlinear FEEM of the original solution, these information allow to estimate the linearized FEEM. The method relies on inner filter effects modelization. Beyond its numerical simplicity, the main interest is that CDA only requires fluorescence measurements. The method was validated using a set of known mixtures and a set of dissolved organic matter samples. In addition we show that the corrected FEEM can be used efficiently for advanced multilinear analysis. Therefore CDA is presented here as a relevant pretreatment to the PARAFAC decomposition of highly absorbing mixtures. (c) 2009 Elsevier B.V. All rights reserved.

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


Camel: collective-aware message logging The continuous progress in the performance of supercomputers has made possible the understanding of many fundamental problems in science. Simulation, the third scientific pillar, constantly demands more powerful machines to use algorithms that would otherwise be unviable. That will inevitably lead to the deployment of an exascale machine during the next decade. However, fault tolerance is a major challenge that has to be overcome to make such a machine usable. With an unprecedented number of parts, machines at extreme scale will have a small mean-time-between-failures. The popular checkpoint/restart mechanism used in todays machines may not be effective at that scale. One promising way to revamp checkpoint/restart is to use message-logging techniques. By storing messages during execution and replaying them in case of a failure, message logging is able to shorten recovery time and save a substantial amount of energy. The downside of message logging is that memory footprint may grow to unsustainable levels. This paper presents a technique that decreases the memory pressure in message-logging protocols by only storing the necessary messages in collective-communication operations. We introduce Camel, a protocol that has a low memory overhead for multicast and reduction operations. Our results show that Camel can reduce memory footprint in a molecular dynamics benchmark for more than 95% on 16,384 cores.

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


Classification of countries progress toward a knowledge economy based on machine learning classification techniques The paper is focused on the progress toward knowledge economy (KE) of countries. Behaviour patterns on KE of the countries (clusters) are identified. Three ordinal classifiers are compared to identify the best model. The best ordinal model according its accuracy is chosen. The model can predict the classification toward KE of countries.

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

decision support systems
hierarchical clustering
ordinal classification


An analysis of the factors influencing differences in survey-reported and GPS-recorded trips Recent advances in global positioning systems (GPS) technology have resulted in a transition in household travel survey methods to test the use of GPS units to record travel details, followed by the application of an algorithm to both identify trips and impute trip purpose, typically supplemented with some level of respondent confirmation via prompted-recall surveys. As the research community evaluates this new approach to potentially replace the traditional survey-reported collection method, it is important to consider how well the GPS-recorded and algorithm-imputed details capture trip details and whether the traditional survey-reported collection method may be preferred with regards to some types of travel. This paper considers two measures of travel intensity (survey-reported and GPS-recorded) for two trip purposes (work and non-work) as dependent variables in a joint ordered response model. The empirical analysis uses a sample from the full-study of the 2009 Indianapolis regional household travel survey. Individuals in this sample provided diary details about their travel survey day as well as carried wearable GPS units for the same 24-h period. The empirical results provide important insights regarding differences in measures of travel intensities related to the two different data collection modes (diary and GPS). The results suggest that more research is needed in the development of workplace identification algorithms, that GPS should continue to be used alongside rather than in lieu of the traditional diary approach, and that assignment of individuals to the GPS or diary survey approach should consider demographics and other characteristics.

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

travel survey data collection techniques


Whitney estimates for convex domains with applications to multivariate piecewise polynomial approximation We prove the following Whitney estimate. Given 0 < p less than or equal to infinity, r epsilon N, and d greater than or equal to 1, thereexists aconstant C(d, r, p), depending only on the three parameters, Such that for every bounded convex domain Omega subset of R-d, and each function f epsilon L-p (Omega), Er-1 (f, Omega), less than or equal to C(d r. P)omega(r)(f, diam(Omega))(p), where Er-1(f, Omega)(p) is the degree of approximation by polynomials of total degree, r - 1, and omega(r)(f, )(p) is the modulus of smoothness of order r. Estimates like this can be found in the literature but with constants that depend in an essential way on the geometry of the domain, in particular, the domain is assumed to be a Lipschitz domain and the above constant C depends on the minimal head-angle of the cones associated with the boundary. The estimates we obtain allow LIS to extend to the multivariate case, the results on bivariate Skinny B-spaces of Karaivanov and Petrushev on characterizing nonlinear approximation from nested triangulations. In a sense, our results were anticipated by Karaivanov and Petrushev.

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

piecewise polynomial approximation
nonlinear approximation
whitney estimates


cross channel optimized marketing by reinforcement learning The issues of cross channel integration and customer life time value modeling are two of the most important topics surrounding customer relationship management (CRM) today. In the present paper, we describe and evaluate a novel solution that treats these two important issues in a unified framework of Markov Decision Processes (MDP). In particular, we report on the results of a joint project between IBM Research and Saks Fifth Avenue to investigate the applicability of this technology to real world problems. The business problem we use as a testbed for our evaluation is that of optimizing direct mail campaign mailings for maximization of profits in the store channel. We identify a problem common to cross-channel CRM, which we call the Cross-Channel Challenge , due to the lack of explicit linking between the marketing actions taken in one channel and the customer responses obtained in another. We provide a solution for this problem based on old and new techniques in reinforcement learning. Our in-laboratory experimental evaluation using actual customer interaction data show that as much as 7 to 8 per cent increase in the store profits can be expected, by employing a mailing policy automatically generated by our methodology. These results confirm that our approach is valid in dealing with the cross channel CRM scenarios in the real world.

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

customer life time value
reinforcement learning
crm

targeted marketing
cost sensitive learning


Morphing the BlobTree Implicit surfaces have proved to be a particularly well suited and efficient model for animating and morphing shapes of arbitrary topologies. The BlobTree model is characterized as a hierarchical combination of skeletal primitives organized in a tree. The nodes hold blending, boolean and warping operators, which allows the design of complex objects. In this paper, we address the metamorphosis of the BlobTree. This appeals a difficult task as the tree data-structures of the initial and final shapes ale completely different in the general case, and consequently cannot be matched easily. We propose an original technique that solves the correspondence process and creates an intermediate generic BlobTree model whose instances interpolate the initial and final shapes. The animator may control the correspondence between features and can specify both the speed of transformation and the trajectory of the nodes and the leaves of the generic BlobTree model. This provides the end user with a tight control over the transformation so as to achieve good visual effects.

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

blobtree
implicit surfaces
metamorphosis
warping


A Tamper-Resistant Programming Language System An important and recurring security scenario involves the need to carry out trusted computations in the context of untrusted environments. It is shown how a tamper-resistant interpreter for a programming language-currently Lisp 1.5-combined with the use of a secure coprocessor can address this problem. This solution executes the interpreter on the secure coprocessor while the code and data of the program reside in the larger memory of an associated untrusted host. This allows the coprocessor to utilize the host's memory without fear of tampering even by a hostile host. This approach has several advantages including ease of use, and the ability to provide tamper-resistance for any program that can be constructed using the language. The language approach enabled the development of two novel mechanisms for implementing tamper resistance. These mechanisms provide alternatives to pure Merkle hash trees. Simulated relative performance of the various mechanisms is provided and shows the relative merits of each mechanism.

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

interpreters
memory management
garbage collection
infrastructure protection


focus dependent multi-level graph clustering In this paper we propose a structure-based clustering technique that transforms a given graph into a specific double tree structure called multi-level outline tree . Each meta-node of the tree - that represents a subset of nodes - is itself hierarchically clustered. So, a meta-node is considered as a tree root of included clusters.The main originality of our approach is to account for the user focus in the clustering process to provide views from different perspectives. Multi-level outline trees are computed in linear time and easy to explore. We think that our technique is well suited to investigate various graphs like Web graphs or citation graphs.

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


consistency challenges of service discovery in mobile ad hoc networks Emerging "urban" ad hoc networks resulting from a large number of individual WLAN users challenge the way users could explore and interact with their physical surroundings. Robust and efficient service discovery and routing protocols in such networks are a necessary ingredient. Although a lightweight service discovery proposal integrated with ad hoc routing exists, an implementation and performance evaluation with respect to overhead and correctness have so far been missing.Moreover, the different service providers in an urban scenario, which (more or less) frequently and actively change their status, demand more flexible handling of cached information on neighboring providers than what is currently proposed. We therefore contribute mechanisms that maintain cache consistency and show that explicitly removing cache entries on existing neighboring providers is well invested effort. We finally evaluate whether ad hoc network latency can implicitly help our protocol in retrieving the physically closest provider, using an 802.11 model. Additionally, we provide a general architectural framework for enabling lightweight service discovery on top of most reactive routing protocols.

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


Null Space Motion Control by PID Control Considering Passivity in Redundant Manipulator This paper describes a control strategy of a proportional-integral-derivative (PID) controller based on stability analysis considering passivity in null space motion of redundant manipulator. Control spaces of redundant manipulator are divided into work space and null space. In the proposed approach, a disturbance observer is employed in work space, which is called work space observer. On the other hand, null space uses PID controller which is passive controller. Using gamma-dissipative property, the PID controller can compensate null space without deteriorating the motion stability. This means that the proposed approach makes it possible to realize stable and dexterous null space motion effectively. The validity of the proposed approach is verified by simulations and experiments of 4-link redundant manipulator.

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

null space
passivity
redundant manipulator
work space observer


An efficient and accurate method for 3D-point reconstruction from multiple views In this paper we consider the problem of finding the position of a point in space given its projections in multiple images taken by cameras with known calibration and pose. Ideally the 3D point can be obtained as the intersection of multiple known rays in space. However, with noise the rays do not meet at a single point generally. Therefore, it is necessary to find a best point of intersection. In this paper we propose a modification of the method (Ma et al., 2001. Journal of Communications in Information and Systems, (1):51-73) based on the multiple-view epipolar constraints. The solution is simple in concept and straightforward to implement. It includes generally two steps: first, image points are corrected through approximating the error model to the first order, and then the 3D point can be reconstructed from the corrected image points using any generic triangulation method. Experiments are conducted both on simulated data and on real data to test the proposed method against previous methods. It is shown that results obtained with the proposed method are consistently more accurate than those of other linear methods. When the measurement error of image points is relatively small, its results are comparable to those of maximum likelihood estimation using Newton-type optimizers; and when processing image-point correspondences cross a small number of views, the proposed method is by far more efficient than the Newton-type optimizers.

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

intersection
maximum likelihood estimation

3d-point reconstruction
structure estimate
bundle adjustment
resection
first-order approximation


Inclusion properties of certain classes of meromorphic functions associated with the Wright generalized hypergeometric function The purpose of the present paper is to introduce several new classes of meromorphically univalent functions which are defined here by means of a linear operator. Also, we study various inclusion properties of these classes.

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

hadamard product
differential subordination
wright hypergeometric functions
integral operator


Exploration of spatial-temporal dynamic phenomena in a 32 x 32-cell stored program two-layer CNN universal machine chip prototype This paper describes a full-custom mixed-signal chip that embeds digitally programmable analog parallel processing and distributed image memory on a common silicon substrate. The chip was designed and fabricated in a standard 0.5 mum CMOS technology and contains approximately 500 000 transistors. It consists of 1024 processing units arranged into a 32 x 32 grid. Each processing element contains two coupled CNN cores, thus, constituting two parallel layers of 32 x 32 nodes. The functional features of the chip are in accordance with the 2nd Order Complex Cell CNN-UM architecture. It is composed of two CNN layers with programmable inter- and intra-layer connections between cells. Other features are: cellular, spatial- invariant array architecture; randomly selectable memory of instructions; random storage and retrieval of intermediate images. The chip is capable of completing algorithmic image processing tasks controlled by the user-selected stored instructions. The internal analog circuitry is designed to operate with 7-bits equivalent accuracy. The physical implementation of a CNN containing second order cells allows real-time experiments of complex dynamics and active wave phenomena. Such well-known phenomena from the react ion-diffusion equations are traveling waves, autowaves, and spiral-waves. All of these active waves are demonstrated on-chip. Moreover this chip was specifically designed to be suitable for the computation of biologically inspired retina models. These computational experiments have been carried out in a developmental environment designed for testing and programming the analogic (analog-and-logic) programmable array processors.

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

mixed signal chip
nonlinear wave
cellular neural networks


Techniques for Computing Fitness of Use (FoU) for Time Series Datasets with Applications in the Geospatial Domain Time series data are widely used in many applications including critical decision support systems. The goodness of the dataset, called the Fitness of Use (FoU), used in the analysis has direct bearing on the quality of the information and knowledge generated and hence on the quality of the decisions based on them. Unlike traditional quality of data which is independent of the application in which it is used, FoU is a function of the application. As the use of geospatial time series datasets increase in many critical applications, it is important to develop formal methodologies to compute their FoU and propagate it to the derived information, knowledge and decisions. In this paper we propose a formal framework to compute the FoU of time series datasets. We present three different techniques using the DempsterShafer belief theory framework as the foundation. These three approaches investigate the FoU by focusing on three aspects of data: data attributes, data stability, and impact of gap periods, respectively. The effectiveness of each approach is shown using an application in hydrological datasets that measure streamflow. While we use hydrological information analysis as our application domain in this research, the techniques can be used in many other domains as well.

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

dempstershafer belief theory
time series data


Pressure based finite volume method for calculation of compressible viscous gas flows A pressure based, iterative finite volume method is developed for calculation of compressible, viscous, heat conductive gas flows at all speeds. The method does not need the use of under-relaxation coefficient in order to ensure a convergence of the iterative process. The method is derived from a general form of system of equations describing the motion of compressible, viscous gas. An emphasis is done on the calculation of gaseous microfluidic problems. A fast transient process of gas wave propagation in a two-dimensional microchannel is used as a benchmark problem. The results obtained by using the new method are compared with the numerical solution obtained by using SIMPLE (iterative) and PISO (non-iterative) methods. It is shown that the new iterative method is faster than SIMPLE. For the considered problem the new method is slightly faster than PISO as well. Calculated are also some typical microfluidic subsonic and supersonic flows, and the RayleighBnard convection of a rarefied gas in continuum limit. The numerical results are compared with other analytical and numerical solutions.

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


Lattice-valued preuniform convergence spaces ? Using the intrinsic lattice-valued inclusion orders of L-subsets and of stratified L-filters, the concept of a stratified L-preuniform convergence structure is proposed. This convergence structure is asymmetric and can be used to establish a framework of asymmetric lattice-valued space structures. The category of stratified L-preuniform convergence spaces is introduced and some categorical properties are presented. A reflective subcategory of stratified L-preuniform convergence spaces is found that is categorically isomorphic to strong stratified L-convergence spaces (originally called stratified L-ordered convergence spaces). Several subcategories of stratified L-preuniform convergence spaces are established and relations between the different subcategories are presented. We conclude that stratified L-preuniform convergence structures introduced here could play a role in the framework of lattice-valued asymmetric space structures in lattice-valued topology.

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

stratified l-preuniform convergence space