The superstar phenomenon in the knowledge management and intellectual capital academic discipline This paper reports on the first documented attempt to investigate the presence of the superstar (or Matthew) effect in the knowledge management and intellectual capital (KM/IC) scholarly discipline. The YuleSimon model and Lotka's square law were applied to the publication data obtained from 2175 articles from 11 KM/IC journals. Based on the findings, it was concluded that the KM/IC discipline represents a very young, attractive academic field that welcomes contributions from a variety of academics and practitioners. In their paper acceptance decisions, KM/IC journal editors are not biased towards a small group of highly productive researchers, which is a positive sign that the field has been progressing in the right direction. The discipline is driven more by academics than by practitioners, and the distribution of articles is more concentrated among a few academic but not practitioner institutions. It was also observed that the YuleSimon model and Lotka's square law may produce different distributions with respect to institutions.

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

superstar effect
lotka's square law
editor bias


Motion marking menus: An eyes-free approach to motion input for handheld devices The increasing complexity of applications on handheld devices requires the development of rich new interaction methods specifically designed for resource-limited mobile use contexts. One appealingly convenient approach to this problem is to use device motions as input, a paradigm in which the currently dominant interaction metaphors are gesture recognition and visually mediated scrolling. However, neither is ideal. The former suffers from fundamental problems in the learning and communication of gestural patterns, while the latter requires continual visual monitoring of the mobile device, a task that is undesirable in many mobile contexts and also inherently in conflict with the act of moving a device to control it. This paper proposes an alternate approach: a gestural menu technique inspired by marking menus and designed specifically for the characteristics of motion input. It uses rotations between targets occupying large portions of angular space and emphasizes kinesthetic, eyes-free interaction. Three evaluations are presented, two featuring an abstract user interface (UI) and focusing on how user performance changes when the basic system parameters of number, size and depth of targets are manipulated. These studies show that a version of the menu system containing 19 commands yields optimal performance, compares well against data from the previous literature and can be used effectively eyes free (without graphical feedback). The final study uses a full graphical UI and untrained users to demonstrate that the system can be rapidly learnt. Together, these three studies rigorously validate the system design and suggest promising new directions for handheld motion-based UIs.

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


Iterative Schemes for Bump Solutions in a Neural Field Model We develop two iteration schemes for construction of localized stationary solutions (bumps) of a one-population WilsonCowan model with a smooth firing rate function. The first scheme is based on the fixed point formulation of the stationary WilsonCowan model. The second one is formulated in terms of the excitation width of a bump. Using the theory of monotone operators in ordered Banach spaces we justify convergence of both iteration schemes.

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

monotone operators in ordered banach spaces

neural field models
iteration schemes for bumps


DENOISING AND ENHANCEMENT OF MAMMOGRAPHIC IMAGES UNDER THE ASSUMPTION OF HETEROSCEDASTIC ADDITIVE NOISE BY AN OPTIMAL SUBBAND THRESHOLDING Mammographic images suffer from low contrast and signal dependent noise, and a very small size of tumoral signs is not easily detected, especially for an early diagnosis of breast cancer. In this context, many methods proposed in literature fail for lack of generality. In particular, too weak assumptions on the noise model, e. g., stationary normal additive noise, and an inaccurate choice of the wavelet family that is applied, can lead to an information loss, noise emphasizing, unacceptable enhancement results, or in turn an unwanted distortion of the original image aspect. In this paper, we consider an optimal wavelet thresholding, in the context of Discrete Dyadic Wavelet Transforms, by directly relating all the parameters involved in both denoising and contrast enhancement to signal dependent noise variance (estimated by a robust algorithm) and to the size of cancer signs. Moreover, by performing a reconstruction from a zero-approximation in conjunction with a Gaussian smoothing filter, we are able to extract the background and the foreground of the image separately, as to compute suitable contrast improvement indexes. The whole procedure will be tested on high resolution X-ray mammographic images and compared with other techniques. Anyway, the visual assessment of the results by an expert radiologist will be also considered as a subjective evaluation.

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

discrete dyadic wavelet transform
adaptive thresholding


improved analysis methods for crossover-based algorithms We deepen the theoretical analysis of the genetic algorithm for the all-pairs shortest path problem proposed by Doerr, Happ and Klein (GECCO 2008). We show that the growth of the paths through crossover operations can be analyzed without the previously used approach of waiting until all paths of a certain length are present in the population. This allows to prove an improved guarantee for the optimization time of O (n 3.25 log 1/4 (n) . We also show that this bound is asymptotically tight. Besides the mere run-time result, our analysis is a step towards understanding how crossover works and how it can be analyzed with rigorous methods.

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

evolutionary algorithm
combinatorial optimization


Model checking at IBM Over the past nine years, the Formal Methods Group at the IBM Haifa Research Laboratory has made steady progress in developing tools and techniques that make the power of model checking accessible to the community of hardware designers and verification engineers, to the point where it has become an integral part of the design cycle of many teams. We discuss our approach to the problem of integrating formal methods into an industrial design cycle, and point out those techniques which we have found to be especially effective in an industrial setting.

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


Investigation on doping behavior of copper in ZnO thin film An experiment to determine the electronic and chemical states of Cu in a ZnO crystal was performed using Hall measurement, X-ray photoelectron spectroscopy (XPS) and low-temperature photoluminescence (PL). Cu atoms showed different behaviors in the ZnO matrix as a function of oxygen gas pressure. Metallic copper (Cu0)-related Cu 2p3/2 peak was observed in highly n-type ZnO:Cu film deposited in 10mTorr. In the Cu-doped p-type ZnO film prepared in 50mTorr, CuZn1+-related peak and small CuZn2+-related satellite peak exhibited and the optical acceptor binding energies of Cu3d9 and Cu3d10 were 173 and 213meV, respectively.

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

cu-doped zno
pulsed laser deposition
x-ray photoelectron spectroscopy


Model and data integration and re-use in environmental decision support systems A software architecture for the management of environmental models is presented. The Systems Theory representation of models is embedded in an object-oriented approach that emphasises the separation of models from data, thereby promoting model and data integration and re-use. The concepts presented here correspond to the requirements of a Model Management System (MMS). It is finally shown how a Decision Support System can use this approach to implement the MMS in order to facilitate problem definition (via the domain base) and problem solution (via the model base).

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

model management
environmental decision support systems


sustained systems performance monitoring at the u. s. department of defense high performance computing modernization program The U. S. Department of Defense High Performance Computing Modernization Program (HPCMP) has implemented sustained systems performance testing on high performance computing systems in use at DoD Supercomputing Resource Centers. The intent is to monitor performance improvements by updates to the operating system, compiler suites, and numerical and communications libraries, and to monitor penalties arising from security patches. In practice, each system's workload is simulated by appropriate choices of user application codes representative of the HPCMP computational technical areas. Past successes include surfacing an imminent failure of an OST in a Cray XT3, incomplete configuration of a scheduler update on an SGI Altix 4700, performance issues associated with a communications library update for a Linux Networx Advanced Technology Cluster, and intermittent resetting of Intel Nehalem cores to standard mode from turbo mode. This history demonstrates that SSP testing is critical to deliver the highest quality of service to the HPCMP users.

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


Design, field experiments and evaluation of a web-based remote medical care support system In this research, we propose and develop a remote medical care system to support nurses, care managers and care helpers during their work. The proposed system has three functions: a multipoint communication function using video images and voice, vital signs data auto-uploading and referencing function, and a drip infusion monitoring function. In this paper, we present the proposed remote medical care support system and report the field experiment results using the system in a medical care support centre. The experimental results show that the proposed system has a good performance.

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

remote medical care support system
vital signs
drip infusion monitoring


A game-theoretic formulation of joint implementation of environmental projects The aim of this paper is to provide a game-theoretic interpretation of joint implementation in environmental projects and to assess the merit of such a strategy. More specifically, we consider a two-player game and solve it under three different cases. In the first case, countries play a non-cooperative game and optimize their welfare under an environmental constraint without having access to joint implementation. In the second case, we assume countries do have access to JI, which allows us to assess its merits by comparing the players welfare levels achieved with and without JI. In the last case, the players jointly optimize their welfare under a collective environmental constraint. Comparing welfare levels in this case to those in the second case allows us to assess the merits of cooperation.

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

game theory
environmental economics
foreign investment


On the design of space-time and space-frequfency codes for MIMO frequency-selective fading channels Recently, the authors introduced an algebraic design framework for space-time coding in flat-fading channels [1]-[4]. In this correspondence, we extend this framework to design algebraic codes for multiple-input multiple-output (MIMO) frequency-selective fading channels. The proposed codes strive to optimally exploit both the spatial and frequency diversity available in the channel. We consider two design approaches: The first uses space-time coding and maximum likelihood decoding to exploit the multi-path nature of the channel at the expense of increased receiver complexity. Within this time domain framework, we also propose a serially concatenated coding construction which is shown to offer a performance gain with a reasonable complexity iterative receiver in some scenarios. The second approach utilizes the orthogonal frequency division multiplexing technique to transform the MIMO multi-path channel into a MIMO flat block fading channel. The algebraic framework [1] is then used to construct space-frequency codes (SFC) that optimally exploit the diversity available in the resulting flat block fading channel. Finally, the two approaches are compared in terms of decoder complexity, maximum achievable diversity advantage, and simulated frame error rate performance in certain representative scenarios.

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

algebraic space-time codes (stc)
multiple transmit and receive antennas
stacking construction


Message-Passing Algorithms and Improved LP Decoding Linear programming (LP) decoding for low-density parity-check codes (and related domains such as compressed sensing) has received increased attention over recent years because of its practical performance-coming close to that of iterative decoding algorithms-and its amenability to finite-blocklength analysis. Several works starting with the work of Feldman et al. showed how to analyze LP decoding using properties of expander graphs. This line of analysis works for only low error rates, about a couple of orders of magnitude lower than the empirically observed performance. It is possible to do better for the case of random noise, as shown by Daskalakis et al. and Koetter and Vontobel. Building on work of Koetter and Vontobel, we obtain a novel understanding of LP decoding, which allows us to establish a 0.05 fraction of correctable errors for rate-1/2 codes; this comes very close to the performance of iterative decoders and is significantly higher than the best previously noted correctable bit error rate for LP decoding. Our analysis exploits an explicit connection between LP decoding and message-passing algorithms and, unlike other techniques, directly works with the primal linear program. An interesting byproduct of our method is a notion of a "locally optimal" solution that we show to always be globally optimal (i.e., it is the nearest codeword). Such a solution can in fact be found in near-linear time by a "reweighted" version of the min-sum algorithm, obviating the need for LP. Our analysis implies, in particular, that this reweighted version of the min-sum decoder corrects up to a 0.05 fraction of errors.

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

linear programming (lp) decoding
low-density parity-check (ldpc) codes
message-passing algorithms
min-sum algorithm


An improved upper bound of the rate of Euclidean superimposed codes A family of n-dimensional unit norm vectors is an Euclidean superimposed code if the sums of any two distinct at most m-tuples of vectors are separated by a certain minimum Euclidean distance d. Ericson and Gyorfi [8] proved that the rate of such a code is between (log m)/4m and (log m)lm for m large enough. In this paper-improving the above long-standing best upper bound for the rate-it is shown that the rate is always at most (log m)/2m, i.e., the size of a possible superimposed code is at most the root of the size given in [8]. We also generalize these codes to other normed vector spaces.

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

growth rate
superimposed geometric codes


providing synthesized audio description for online videos We describe an initial attempt to develop a common platform for adding an audio description (AD) to an online video so that blind and visually impaired people can enjoy such material. A speech synthesis technology allows content providers to offer the AD at minimal cost. We exploit external metadata so that the AD can be independent of the video format. The external approach also allows external supporters to add ADs to any online videos. Our technology includes an authoring tool for writing AD scripts, a Web browser add-on for synthesizing ADs synchronized with original videos, and a text-based format to exchange AD scripts.

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

external metadata
online videos
speech synthesis
audio description


aspect-oriented programming with model checking Aspect-oriented programming (AOP) is a programming paradigm such that crosscutting concerns including synchronization policies, resource sharing and performance optimizations over objects are modularized as aspects that are separated from objects. A compiler, called a weaver, weaves aspects and objects together into a program. In AOP, however, it is not easy to verify the correctness of a woven program because crucial behaviors are strongly influenced by aspect descriptions. In order to deal with such problem, this paper proposes an automatic verification approach using model checking that verifies whether the woven program contains unexpected behaviors such as deadlocks. The objectives of this paper are as follows: 1) to verify the correctness of AOP-based programs using model checking, 2) to provide AOP-based model checking frameworks.

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

program
order
resource sharing
aspect
synchronization
correctness
performance
verification
checking frameworks
paper
model checking

crosscutting concern
deadlock
framework
policy
optimality
behavior
object
compilation
modular
aspect-oriented programming
validation


The development of a maximum likelihood model for model-based applications Since model parameter uncertainties affect the accuracy of the model's outputs, this work describes the development of a maximum likelihood model based on robust parameter estimates to improve the model's results. A robust statistical theory framework is used to determine the robust parameter estimates. Next, it is proven that a process model parameterized by robust parameter estimates within their feasible ranges is a maximum likelihood model. A chemical reactor process is presented to demonstrate the development of the maximum likelihood model and its performance properties in a model-based predictive control framework. (C) 2012 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 O O O O O O O O O O O O O O

robust state estimation
model predictive control
parameter uncertainty


formalising trust for online communities Provision of services within a virtual framework for resource sharing across institutional boundaries has become an active research area. Many such services encode access to computational and data resources. Consequently, we envision a service rich environment in the future, where service consumers are represented by intelligent agents. If interaction between agents is automated, it is necessary for these agents to be able to automatically choose between a set of equivalent (or similar) services. In such a scenario trust serves as a benchmark to differentiate between services. The concept of trust suffers from an imperfect understanding, a plethora of definitions, and informal use in the literature. We present a formalism for describing trust within multi-institutional service sharing that can be embedded in an artificial agent; enabling the agent to make trust-based decision.

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


Cryptanalysis of a multi-server password authenticated key agreement scheme using smart cards Recently, Juang proposed an efficient password authenticated key agreement scheme using smart cards for the multi-server architecture. Juang's scheme was intended to provide mutual authentication and session key agreement. Herein, we show that Juang's scheme is vulnerable to a privileged insider's attack and is not easily reparable. Furthermore, it does not provide forward secrecy and the user eviction mechanism.

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

key agreement
mutual authentication
password


A data mining approach to knowledge discovery from multidimensional cube structures In this research we present a novel methodology for the discovery of cubes of interest in large multi-dimensional datasets. Unlike previous research in this area, our approach does not rely on the availability of specialized domain knowledge and instead makes use of robust methods of data reduction such as Principal Component Analysis and Multiple Correspondence Analysis to identify a small subset of numeric and nominal variables that are responsible for capturing the greatest degree of variation in the data and are thus used in generating cubes of interest. Hierarchical clustering was integrated with the use of data reduction in order to gain insights into the dynamics of relationships between variables of interests at different levels of data abstraction. The two case studies that were conducted on two real word datasets revealed that the methodology was able to capture regions of interest that were significant from both the application and statistical perspectives.

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 B I I O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 mining
principal component analysis
multiple correspondence analysis


Optimal WCDMA network planning by multiobjective evolutionary algorithm with problem-specific genetic operation The wideband code division multiple access (WCDMA) network planning problem requires to determine the location and the configuration parameters of the base stations (BSs) so as to maximize the capacity and minimize the installation cost. This problem can be formulated as a complex set covering problem. Compared to the classical set covering problems, the coverage area of each BS is unknown in advance. This makes that the selection of each BS location and configuration parameters is determined by the location and configuration parameters of the neighbor BSs. Accordingly, we will conduct a competition and cooperation model based on the re-covered area of the BSs to measure the relationship of the BSs. Then, an efficient genetic operation based on this model is proposed to generate new-quality solutions. Further, four BS configuration parameters, i.e., the antenna height, antenna tilt, sector orientation and pilot signal power, are taken into account as well. Since there are too many combination levels of the configuration parameters, an encoding method based on orthogonal design is presented to reduce the search space. Subsequently, we merge the proposed encoding method and genetic operation into the multiobjective evolutionary algorithm-based decomposition(MOEA/D-M2M) to solve the WCDMA network planning problem. Simulation results show the efficacy of the proposed encoding and genetic operation in comparison with the existing counterpart.

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

set covering problem
multiobjective evolutionary algorithm
orthogonal design


A novel asymmetric three-party based authentication scheme in wearable devices environment As we know, wearable devices usually store the user?s private data, such as healthy data, which is related with users privacy. As an increasing number of people are going to use this kind of devices, some security problems have emerged and have not resolved perfectly, for example, how to protect the privacy of sensitive information stored on wearable devices, which becomes an important issue in these recent years. Implementing authentication among the wearable devices, mobile terminals and users can effectively resolve this problem. However, traditional lightweight authentication could not be applied for this new environment. Therefore, we propose an asymmetric three-party based authentication scheme in wearable devices environment. It contains three parties: wearable devices, mobile terminals and users. Drawing on the visual out of band (OOB) channel, two-dimensional code (QR code) and secure device pairing technology, new scheme provides a mutual efficient authentication between the wearable device and mobile terminal. And we make the Bluetooth device address into a visual tag, which can improve efficiency of Bluetooth connection. In addition, the scheme takes the multi-users condition into consideration and allows primary user to increase the numbers of legitimate users through authentication. According to security analysis and usability analysis, we can prove that this scheme can not only resist known types of attacks but also can be perfectly applied in wearable devices environment. Besides, we have implemented this scheme in the real-life setting. The experiment results of this scheme show that practical applications of the scheme meet expectations.

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

authentication
wearable devices
oob
secure device pairing
mobile terminals


Formant position based weighted spectral features for emotion recognition In this paper, we propose novel spectrally weighted mel-frequency cepstral coefficient (WMFCC) features for emotion recognition from speech. The idea is based on the fact that formant locations carry emotion-related information, and therefore critical spectral bands around formant locations can be emphasized during the calculation of MFCC features. The spectral weighting is derived from the normalized inverse harmonic mean function of the line spectral frequency (LSF) features, which are known to be localized around formant frequencies. The above approach can be considered as an early data fusion of spectral content and formant location information. We also investigate methods for late decision fusion of unimodal classifiers. We evaluate the proposed WMFCC features together with the standard spectral and prosody features using HMM based classifiers on the spontaneous FAU Aibo emotional speech corpus. The results show that unimodal classifiers with the WMFCC features perform significantly better than the classifiers with standard spectral features. Late decision fusion of classifiers provide further significant performance improvements.

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

emotion recognition
spectral features
line spectral frequency
decision fusion

emotional speech classification
formant frequency


Selective color transfer with multi-source images A novel method is proposed to transfer selective colors from a set of source images to a target image. An improved EM method is presented to model regional color distribution of the target image by Gaussian Mixture Model (GMM), then, trained by this model, appropriate reference colors are automatically selected from the given source images to color each target region. The generated compelling results prove that our proposed method is applicable to colorize grayscale images and color transfer between chromatic images. A new objective metric considering colorfulness and structural similarity is also proposed to evaluate the quality of the transferred image, which verifies good performance of our method.

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

color transfer
em method
gaussian mixture model
structural similarity


Tailoring chromatic dispersion in chalcogenidetellurite microstructured optical fiber A chalcogenidetellurite microstructured optical fiber was fabricated. The flattened chromatic dispersion can be achieved at ?=1.351.7?m. Supercontinuum generation in this fiber was investigated.

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

glasses and optical materials
optical properties of glasses
optical fibers


Saliency detection in complex scenes Detecting multiple salient objects in complex scenes is a challenging task. In this paper, we present a novel method to detect salient objects in images. The proposed method is based on the general center-surround visual attention mechanism and the spatial frequency response of the human visual system (HVS). The saliency computation is performed in a statistical way. This method is modeled following three biologically inspired principles and compute saliency by two scatter matrices which are used to measure the variability within and between two classes, i.e., the center and surrounding regions, respectively. In order to detect multiple salient objects of different sizes in a scene, the saliency of a pixel is estimated via its saliency support region which is defined as the most salient region centered at the pixel. Compliance with human perceptual characteristics enables the proposed method to detect salient objects in complex scenes and predict human fixations. Experimental results on three eye tracking datasets verify the effectiveness of the method and show that the proposed method outperforms the state-of-the-art methods on the visual saliency detection task.

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

saliency model
complex scene
human fixation prediction


Relaxin Family Peptide Receptor 1 Activation Stimulates Peroxisome Proliferator-Activated Receptor Gamma Relaxin (RLX) has antifibrotic effects in a number of tissues. Many of these effects are similar to those induced by the activators of peroxisome proliferator-activated receptor gamma (PPAR?), raising the possibility that a mechanism for RLX's antifibrotic effects may involve activation of the PPAR? pathway. This study investigated the effect of RLX on PPARs and their mechanism of upregulation. It shows that RLX stimulates ligand-independent PPAR activation in a dose-dependent manner. The combined effect of RLX and PPAR? agonists was superadditive, suggesting that both agents might be used together for an increased antifibrotic effect. RLX caused increased expression of the PPAR? target genes CD36 and LXR?. RLX's effect was mimicked by forskolin and partially blocked by pertussis toxin, suggesting that RLX works through a cAMP/protein kinase A pathway to activate PPAR?. A better understanding of this pathway might help in the amelioration of fibrotic diseases.

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

peroxisome proliferator-activated receptor (ppar)

peroxisome proliferator response element (ppre)

relaxin family peptide receptor1 (rxfp1)


BEIRA: An Area-based User Interface for Map Services This paper introduces BEIRA, an area-based map user interface for location-based contents. Recently, various web map services are widely used to search for location-based contents. However, browsing a large number of contents that are arranged on a map as points may be troublesome. We tackle this issue by using area-based representations instead of points. AOI (Area of Interest), which is core concept of BEIRA, is an arbitrary shaped area boundary with text summary information. With AOI, users can instantly grasp area characteristics without examining each point. AOI is deduced by performing geo-semantic co-clustering of location-based contents. Geo-semantic co-clustering takes both geographic and semantic features of contents into account. We confirm that the ratio of the geo-semantic blend is the key to deducing an appropriate boundary. We further propose and evaluate location-aware term weighting to obtain an informative summary.

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

map interface
web mining
geographic information system
co-clustering


Expression of Aromatase mRNA in the Abdominal Gland of the Newt, Cynops pyrrhogaster Abstract: As a step to see whether the local aromatization mechanism exists in the newt, Cynops pyrrhogaster, cDNA cloning and characterization of newt cytochrome P450 aromatase (P450arom) were conducted. Newt P450arom cDNA was obtained from a C. pyrrhogaster ovarian cDNA library. By RT-PCR and in situ hybridization, an intense P450arom mRNA expression was detected in the abdominal gland. Employing biochemical techniques combined with HPLC and TLC analyses, we also demonstrated the conversion of testosterone to estradiol in the abdominal grand. The significance of aromatization of testosterone in this gland is discussed.

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


Reducing the exhaustive key search of the Data Encryption Standard (DES) The Data Encryption Standard (DES) is among the most popular encryption method that has become the de facto standard to protect confidential information ranging from Automatic Teller Machines (ATMs) and smart cards to emails and online websites. Although recently a successor the Advanced Encryption Standard (AES) has emerged, DES and its variants remain being used in various applications as the complete roll out of the AES will take some years to materialize. To date, the only practical attack on the DES is the exhaustive key search. In this paper, we exploit a recently presented sliding property of the DES key schedule to show that the exhaustive key search of the DES can be further reduced from previous known results.

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

cryptology
data encryption standard (des)
exhaustive search


Improving performance and energy saving in a reconfigurable processor via accelerating control data flow graphs Extracting frequently executed (hot) portions of the application and executing their corresponding data flow graph (DFG) on the hardware accelerator brings about more speedup and energy saving for embedded systems comprising a base processor integrated with a tightly coupled accelerator. Extending DFGs to support control instructions and using Control DFGs (CDFGs) instead of DFGs results in more coverage of application code portion are being accelerated hence, more speedup and energy saving. In this paper, motivations for extending DFGs to CDFGs and handling control instructions are introduced. In addition, basic requirements for an accelerator with conditional execution support are proposed. Then, two algorithms are presented for temporal partitioning of CDFGs considering the target accelerator architectural constraints. To demonstrate effectiveness of the proposed ideas, they are applied to the accelerator of a reconfigurable processor called AMBER. Experimental results approve the remarkable effectiveness of covering control instructions and using CDFGs versus DFGs in the aspects of performance and energy reduction.

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

conditional execution
temporal partitioning
reconfigurable processor

reconfigurable accelerator
control data flow graph


effective compilation support for variable instruction set architecture Traditional compilers perform their code generation tasks based on a fixed, pre-determined instruction set. This paper describes the implementation of a compiler that determines the best instruction set to use for a given program and generates efficient code sequence based on it. We first give an overview of the VISC Architecture pioneered at Cognigine that exemplifies a Variable Instruction Set Architecture. We then present three compilation techniques that, when combined, enable us to provide effective compilation and optimization support for such an architecture. The first technique involves the use of an abstract operation representation that enables the code generator to optimize towards the core architecture of the processor without committing to any specific instruction format. The second technique uses an enumeration approach to scheduling that yields near-optimal instruction schedules while stilladhering to the irregular constraints imposed by the architecture. We then derive the dictionary and the instruction output based on this schedule. The third technique superimposes dictionary re-use on the enumeration algorithm to provide trade-off between program performance and dictionary budget. This enables us to make maximal use of the dictionary space without exceeding its limit. Finally, we provide measurements to show the effectiveness of these techniques.

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

scheduling
use
performance
paper
representation
processor
variable instruction set
space
enumeration
architecture
code
dictionary
implementation
instruction
budget
support
compilation
core
algorithm
sequence

measurement
efficiency
constraint
variability
abstraction
resource modeling
optimality
program representation
instruction scheduling
embedded processor
configurable code generation
effect
code generation


Margrabe's option to exchange in a Paretian-stable subordinated market This paper derives the formula for a European option to exchange one asset for another provided that the underlying asset price is logstable. Using the subordination principle of Feller [1] first applied by Hurst, Platen and Rachev [2] to option pricing, we can extend former results of Margrabe [3] to a richer class of stochastic processes which are able to better capture empirical asset return distributions. The obtained option price can be used as a building block in the context of real option valuation. (C) 2001 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 B 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

finance
real options
non-gaussian processes
alpha-stable distribution


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

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

service description
matchmaking
semantic web
daml


Attitude toward ethical behavior in computer use: a shifting model Purpose - In this study the researchers attempt to identify factors that could influence an individual's attitude toward ethical behavior in the information systems (IS) environment and compare them to the findings of an earlier study to determine any changes. Design/methodology/approach - A sample of university students is used to assess environmental influences (societal, belief system, personal, professional, legal, and business), moral obligation, consequences of the action, and gender, in order to determine what influences an individual's attitude toward a behavior. Discriminant analysis is used to assess the factor influences. Findings - The findings indicate that many factors influence attitude toward ethical decisions and are dependent upon the type of ethical issue involved. Moreover, based on two time periods, the ethical attitude influencers; have shifted over time. The gender findings indicate that attitude influencers are also dependent on the sex of the individual. Originality/value - The findings show that attitude influencers have shifted over time (since an earlier study), which means that organizations must periodically reassess their employees' ethical climate and adjust their ethics' programs as attitude influencers change. The findings also show that training programs need to focus on the different influencers for males and females.

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


Modeling Signal Transduction in Enzyme Cascades with the Concept of Elementary Flux Modes Concepts such as elementary flux modes (EFMs) and extreme pathways are useful tools in the detection of non-decomposable routes (metabolic pathways) in biochemical networks. These methods are based on the fact that metabolic networks obey a mass balance condition. In signal transduction networks, that condition is of minor importance because it is the flow of information that matters. Nevertheless, it would be interesting to apply pathway detection methods to signaling systems. Here, we present a formalism by which this can be achieved in the case of enzyme cascades operating, for example, by phosphorylation and dephosphorylation. It is based on the ideas that the signal is not diminished along each route and that the system has to return to its original state after each signaling event. We illustrate the method by several simple prototypic single-phosphorylation and double-phosphorylation cascades, including convergent and divergent branching. Moreover, it is applied to a specific example from insulin signaling. (See online Supplementary Material at www.liebertonline.com.)

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

elementary flux modes
signal transduction networks

double phosphorylation
insulin signaling network
kinase cascades


On a quasi-ordering on Boolean functions It was proved few years ago that classes of Boolean functions definable by means of functional equations [O. Ekin, S. Foldes, P.L. Hammer, L. Hellerstein, Equational characterizations of boolean functions classes, Discrete Mathematics 211 (2000) 27-51], or equivalently, by means of relational constraints [N. Pippenger. Galois theory for minors of finite functions, Discrete Mathematics 254 (2002) 405-419], coincide with initial segments of the quasi-ordered set (Omega, , subset of) also embeds ([omega](<omega), subset of). From this result, we deduce that the dual space of the distributive lattice made of finitely definable classes is uncountable. Looking at examples of finitely definable classes, we show that the classes of Boolean functions with a bounded number of essential variables are finitely definable. We provide a concrete equational characterization for each of these classes, and for the subclasses made of linear functions. We describe the classes of functions with bounded polynomial degree in terms of minimal obstructions. (C) 2008 Elsevier B.V. All rights reserved.

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

initial segments
boolean functions
minors
essential variables
functional equations
relational constraints
linear functions

quasi-orders
qosets
partial-orders
posets
antichains
order-embeddings
equational classes


Evaluating information accessibility and community adaptivity features for sustaining virtual learning communities Virtual communities have been identified as the killer applications on the Internet Information Superhighway. Their impact is increasingly pervasive, with activities ranging from the economic and marketing to the social and educational. Despite their popularity, little is understood as to what factors contribute to the sustainability of virtual communities. This study focuses on a specific type of virtual communitiesthe virtual learning communities. It employs an experiment to examine the impact of two critical issues in system designinformation accessibility and community adaptivityon the sustainability of virtual learning communities. Adopting an extended Technology Acceptance Model, the experiment exposed 69 subjects to six different virtual learning communities differentiated by two levels of information accessibility and three levels of community adaptivity, solicited their feelings and perceptions, and measured their intentions to use the virtual learning communities. Results indicate that both information accessibility and community adaptivity have significant effects on user perceptions and behavioural intention. Implications for theory and practice are drawn and discussed.

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

information accessibility
community adaptivity
technology acceptance model

virtual learning community
community sustainability
sense of belonging


Theoretical investigations of a high density cage compound 10-(1-nitro-1, 2, 3, 4-tetraazol-5-yl)) methyl-2, 4, 6, 8, 12-hexanitrohexaazaisowurtzitane A new polynitro cage compound with the framework of HNIW and a tetrazole unit, i.e., 10-(1-nitro-1, 2, 3, 4-tetraazol-5-yl)) methyl-2, 4, 6, 8, 12-hexanitrohexaazaisowurtzitane (NTz-HNIW) has been proposed and studied by density functional theory (DFT) and molecular mechanics methods. Properties such as IR spectrum, heat of formation, thermodynamic properties, and crystal structure were predicted. The compound belongs to the Pbca space group, with the lattice parameters a = 15.07 , b = 12.56 , c = 18.34 , Z = 8, and rho = 1.990 g center dot cm(-3). The stability of the compound was evaluated by the bond dissociation energies and results showed that the first step of pyrolysis is the rupture of the N-NO(2) bond in the side chain. The detonation properties were estimated by the Kamlet-Jacobs equations based on the calculated crystal density and heat of formation, and the results were 9.240 km center dot s(-1) for detonation velocity and 40.136 GPa for detonation pressure. The designed compound has high thermal stability and good detonation properties and is probably a promising high energy density compound (HEDC).

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

crystal structure
dft
molecular mechanics
stability


Pose-independent surface matching for intra-operative soft-tissue marker-less registration Marker-less approach for intra-operative soft-tissue registration. Replaces invasive markers with surface information. Designed for highly noisy surfaces without salient landmarks. Evaluation performed on the liver, which is known as a difficult organ to register. In-vitro evaluation using a time-of-flight camera yields errors below 10mm.

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

intra-operative registration
computer-assisted surgery
time-of-flight camera


a fault simulator for mos lsi circuits This paper describes a fault simulator for MOS LSI circuits. The basic primitives for this simulator are MOS transistor structures where the transistors are evaluated logically. The simulator provides the capability of modeling and simulating both the classical input/output stuck-at faults and the non-classical transistor stuck-on and stuck-open faults .

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


Self-organized fuzzy system generation from training examples In the synthesis of a fuzzy system two steps are generally employed: the identification of a structure and the optimization of the parameters defining it. This paper presents a methodology to automatically perform these two steps in conjunction using a three-phase approach to construct a fuzzy system from numerical data. Phase 1 outlines the membership functions and system rules for a specific structure, starting from a very simple initial topology. Phase 2 decides a new and more suitable topology with the information received from the previous step; it determines for which variable the number of fuzzy sets used to discretize the domain must be increased and where these new fuzzy sets should be located. This, in turn, decides in a dynamic way in which part of the input space the number of fuzzy rules should be increased. Phase 3 selects from the different structures obtained to construct a fuzzy system the one providing the best compromise between the accuracy of the approximation and the complexity of the rule set. The accuracy and complexity of the fuzzy system derived by the proposed self-organized fuzzy rule generation procedure (SOFRG) are studied for the problem of function approximation. Simulation results are compared with other methodologies such as artificial neural networks, neuro-fuzzy systems, and genetic algorithms.

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

generation of membership functions and rules


Load balancing and OpenMP implementation of nested parallelism Many problems have multiple layers of parallelism. The outer-level may consist of few and coarse-grained tasks. Next, each of these tasks may also be rich in parallelism, and be split into a number of fine-grained tasks, which again may consist of even finer subtasks, and so on. Here we argue and demonstrate by examples that utilizing multiple layers of parallelism may give much better scaling than if one restricts oneself to only one level of parallelism. Two non-trivial issues for multi-level parallelism are load balancing and implementation. In this paper we provide an algorithm for finding good distributions of threads to tasks and discuss how to implement nested parallelism in OpenMP.

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


Heuristics for distribution network design in telecommunication A distribution network problem arises in a lower level of an hierarchical modeling approach for telecommunication network planning. This paper describes a model and proposes a lagrangian heuristic for designing a distribution network. Our model is a complex extension of a capacitated single commodity network design problem. We are given a network containing a set of sources with maximum available supply, a set of sinks with required demands, and a set of transshipment points. We need to install adequate capacities on the arcs to route the required flow to each sink, that may be an intermediate or a terminal node of an arborescence. Capacity can only be installed in discrete levels, i.e., cables are available only in certain standard capacities. Economies of scale induce the use of a unique higher capacity cable instead of an equivalent set of lower capacity cables to cover the flow requirements of any link. A path from a source to a terminal node requires a lower flow in the measure that we are closer to the terminal node, since many nodes in the path may be intermediate sinks. On the other hand, the reduction of cable capacity levels across any path is inhibited by splicing costs. The objective is to minimize the total cost of the network, given by the sum of the arc capacity (cables) costs plus the splicing costs along the nodes. In addition to the limited supply and the node demand requirements, the model incorporates constraints on the number of cables installed on each edge and the maximum number of splices at each node. The model is a NP-hard combinatorial optimization problem because it is an extension of the Steiner problem in graphs. Moreover, the discrete levels of cable capacity and the need to consider splicing costs increase the complexity of the problem. We include some computational results of the lagrangian heuristics that works well in the practice of computer aided distribution network design.

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

distribution network
network design
lagrangian heuristics


Design of a packet-switched WDM network with multi-wavelength selectivity The use of low-speed tunable devices in packet-switched WDM star networks may lead to throughput and delay penalties. We propose (i) a new receiver architecture using multi-wavelength selectivity to eliminate the penalties, and (ii) a corresponding optimal scheduling algorithm for uniform all-to-all transmission. This architecture results in significant cost reduction in comparison with existing pipeline technique. When using a two-wavelength simultaneous selection, our numerical results show that (i) the throughput can increase by 40% in comparison with using a tunable filter alone; (ii) the throughput degradation is 2% in comparison with using two tunable filters in systems using a pipeline technique.

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

acoustooptic filters
receivers
delay lines
optical packet switching
wavelength division multiplexing
multi-wavelength selectivity


recency ranking by diversification of result set In this paper, we propose a web search retrieval approach which automatically detects recency sensitive queries and increases the freshness of the ordinary document ranking by a degree proportional to the probability of the need in recent content. We propose to solve the recency ranking problem by using result diversification principles and deal with the query's non-topical ambiguity appearing when the need in recent content can be detected only with uncertainty. Our offine and online experiments with millions of queries from real search engine users demonstrate the significant increase in satisfaction of users presented with a search result generated by our approach.

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


OvaSpec A vision-based instrument for assessing concentration and developmental stage of Trichuris suis parasite egg suspensions A scalable, objective method for in-process drug testing was developed. OvaSpec automatically assess concentration and embryonation percentage of TSO. Algorithms were tested on a large, annotated dataset of 42,894 eggs in 2970 images. Darkfield scattering and larval morphology enables classification accuracies of 99%. Computer vision agrees with manual microscopy but has superior precision.

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

computer vision
embryonation percentage
concentration

parasite egg classification
image analysis
darkfield microscopy
trichuris suis eggs


Trusting Spam Reporters: A Reporter-Based Reputation System for Email Filtering Spam is a growing problem; it interferes with valid email and burdens both email users and service providers. In this work, we propose a reactive spam-filtering system based on reporter reputation for use in conjunction with existing spam-filtering techniques. The system has a trust-maintenance component for users, based on their spam-reporting behavior. The challenge that we consider is that of maintaining a reliable system, not vulnerable to malicious users, that will provide early spam-campaign detection to reduce the costs incurred by users and systems. We report on the utility of a reputation system for spam filtering that makes use of the feedback of trustworthy users. We evaluate our proposed framework, using actual complaint feedback from a large population of users, and validate its spam-filtering performance on a collection of real email traffic over several weeks. To test the broader implication of the system, we create a model of the behavior of malicious reporters, and we simulate the system under various assumptions using a synthetic dataset.

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


SmartVisionApp: A framework for computer vision applications on mobile devices This is a framework for developing computer vision applications in mobile devices. This framework combines mobile devices, network technologies and computer vision. The framework performs object recognition through photos captured by a phone camera. Two plug-ins for landmark recognition and fashion shopping are presented. Experiments on several datasets shows that the system is efficient and robust.

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

content analysis
image classification
mobile landmark recognition


Verifying GPU Kernels by Test Amplification We present a novel technique for verifying properties of data parallel GPU programs via test amplification. The key insight behind our work is that we can use the technique of static information flow to amplify the result of a single test execution over the set of all inputs and interleavings that affect the property being verified. We empirically demonstrate the effectiveness of test amplification for verifying race-freedom and determinism over a large number of standard GPU kernels, by showing that the result of verifying a single dynamic execution can be amplified over the massive space of possible data inputs and thread interleavings.

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


Global optimization of generalized geometric programming In this paper a deterministic global optimization algorithm is proposed for locating the global minimum of the generalized geometric programming (GGP) problem. By utilizing an exponential variable transformation and some other techniques the initial nonconvex problem (GGP) is reduced to a typical reverse convex programming (RCP). Then a linear relaxation of problem (RCP) is obtained based on the famous arithmetic-geometric mean inequality and the linear upper bound of the reverse constraints inside some hyperrectangle region. The proposed branch and bound algorithm is convergent to the global minimum through the successive refinement of the linear relaxation of the feasible region of the objective function and the solutions of a series of linear optimization problems. And finally the numerical experiment is given to illustrate the feasibility and the robust stability of the present algorithm. (C) 2004 Elsevier Ltd. All rights reserved.

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

ggp
global optimization
linear relaxation
branch and bound


busy and lazy fp with infinite objects The paper introduces a variant of Backus' functional programming language FP that has non-strict basic operations as well as non-strict language constructs. The basic data structure of FP, finite nested sequences, is generalized to infinite trees by allowing a non-strict sequence constructor. Then infinite objects can be described as least solutions of recursion equations. For this language variant we give a structured mathematical and operational semantics which employs rewriting rules on finite terms. Infinite objects are evaluated by repeated unfolding of their recursive definitions and subsequent simplifications according to a confluent and Noetherian rewriting system on the level of objects. Two algorithms are given that formalize the ideas of busy (data-driven) and lazy (demand-driven) evaluation. Throughout the paper the semantic concepts of FP are explained; special emphasis is laid on the notion and the proper algebraic treatment of infinite objects.

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

structure
recursion
semantic
operational semantics
language
data
trees
paper
evaluation
rules
sequence
functional programming

rewrite
systems
definition
data structures
concept
object
operability
general
algorithm


Filling holes in meshes using a mechanical model to simulate the curvature variation minimization The presence of holes in a triangle mesh is classically ascribed to the deficiencies of the point cloud acquired from a physical object to be reverse engineered. This lack of information results from both the scanning process and the object complexity. The consequences are simply not acceptable in many application domains (e.g. visualization, finite element analysis or STL prototyping). This paper addresses the way these holes can be filled in while minimizing the curvature variation between the surrounding and inserted meshes. The curvature variation is simulated by the variation between external forces applied to the nodes of a linear mechanical model coupled to the meshes. The functional to be minimized is quadratic and a set of geometric constraints can be added to further shape the inserted mesh. In addition, a complete cleaning toolbox is proposed to remove degenerated and badly oriented triangles resulting from the scanning process.

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

holes in meshes
curvature variation minimization
linear mechanical model

reverse engineering
geometric modelling
triangle mesh deformation
shape manipulations


Performance modeling of hybrid MPI/OpenMP scientific applications on large-scale multicore supercomputers In this paper, we present a performance modeling framework based on memory bandwidth contention time and a parameterized communication model to predict the performance of OpenMP, MPI and hybrid applications with weak scaling on three large-scale multicore supercomputers: IBM POWER4, POWER5+ and BlueGene/P, and analyze the performance of these MPI, OpenMP and hybrid applications. We use STREAM memory benchmarks and Intel's MPI benchmarks to provide initial performance analysis and model validation of MPI and OpenMP applications on these multicore supercomputers because the measured sustained memory bandwidth can provide insight into the memory bandwidth that a system should sustain on scientific applications with the same amount of workload per core. In addition to using these benchmarks, we also use a weak-scaling hybrid MPI/OpenMP large-scale scientific application: Gyrokinetic Toroidal Code (GTC) in magnetic fusion to validate our performance model of the hybrid application on these multicore supercomputers. The validation results for our performance modeling method show less than 7.77% error rate in predicting the performance of hybrid MPI/OpenMP GTC on up to 512 cores on these multicore supercomputers. (C) 2013 Elsevier Inc. All rights reserved.

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

performance modeling
multicore supercomputers
memory bandwidth contention time


locating need-to-translate constant strings in web applications Software internationalization aims to make software accessible and usable by users all over the world. For a Java application that does not consider internationalization at the beginning of its develop- ment stage, our previous work proposed an approach to locating need-to-translate constant strings in the Java code. However, when being applied on web applications, it can identify only constant strings that may go to the generated HTML texts, but cannot further distinguish constant strings visible at the browser side (need-to-translate) from other constant strings (not need-to-translate). In this paper, to address significant challenges in internationalizing web applications, we propose a novel approach to locating need-to-translate constant strings in web applications. Among those constant strings that may go to the generated HTML texts, our approach further distinguishes strings visible at the browser side from non-visible strings via a novel technique called flag propagation. We evaluated our approach on three real-world open source PHP-based web applications (in total near 17 KLOC): Squirrel Mail, Lime Survey, and Mrbs. The empirical results demonstrate that our approach accurately distinguishes visible strings from non-visible strings among all the constant strings that may go to the generated HTML texts, and is effective for locating need-to-translate constant strings in web applications.

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

software internationalization
flag propagation


Simulation of generalized newtonian fluids with the lattice boltzmann method This paper proposes a study of the computational efficiency of a lattice Boltzmann model (LBM) solver to simulate the behavior of a generalized Newtonian fluid. We present recent progress concerning a 4-1 planar contraction considering a power-law and a Carreau-law model. First we compare the power-law model for a Poiseuille flow with the analytical solution, and show that our model is second-order accurate in space. Then we compare the results obtained with LBM for both laws to those obtained using a commercial finite element solver for the 4-1 plane sharp corner contraction.

O O B I I O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 boltzmann method
generalized newtonian fluids

power-law fluid
carreau fluid
4-1 contraction.


A semantic framework to protect the privacy of electronic health records with non-numerical attributes Structured patient data like Electronic Health Records (EHRs) are a valuable source for clinical research. However, the sensitive nature of such information requires some anonymisation procedure to be applied before releasing the data to third parties. Several studies have shown that the removal of identifying attributes, like the Social Security Number, is not enough to obtain an anonymous data file, since unique combinations of other attributes as for example, rare diagnoses and personalised treatments, may lead to patients identity disclosure. To tackle this problem, Statistical Disclosure Control (SDC) methods have been proposed to mask sensitive attributes while preserving, up to a certain degree, the utility of anonymised data. Most of these methods focus on continuous-scale numerical data. Considering that part of the clinical data found in EHRs is expressed with non-numerical attributes as for example, diagnoses, symptoms, procedures, etc., their application to EHRs produces far from optimal results. In this paper, we propose a general framework to enable the accurate application of SDC methods to non-numerical clinical data, with a focus on the preservation of semantics. To do so, we exploit structured medical knowledge bases like SNOMED CT to propose semantically-grounded operators to compare, aggregate and sort non-numerical terms. Our framework has been applied to several well-known SDC methods and evaluated using a real clinical dataset with non-numerical attributes. Results show that the exploitation of medical semantics produces anonymised datasets that better preserve the utility of EHRs.

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

electronic health records
privacy
statistical disclosure control
snomed ct


On name-based inter-domain routing Locating objects with topology-independent identifiers has emerged as a key functionality in recent content networking approaches. Numerous designs have been proposed to address the obvious scalability and efficiency challenges such systems face in Internet-scale deployments. These designs have often been based on implicit assumptions of full deployment and a homogeneous autonomous system structure. Considering incremental deployment in a heterogeneous inter-domain setting, however, reveals both new scalability challenges and deployment and operation related disincentives. In this paper, we propose an inter-domain rendezvous design that combines policy-based name routing between adjacent networks with hierarchical interconnection overlays for scalable global connectivity. This hybrid design enables partial deployment and explicitly addresses the different operational incentives and policies of network service providers and enterprise networks. Extensive domain-level simulations show good performance for our solution in terms of overlay-induced latency, inter-domain path stretch and routing load distribution. (C) 2010 Elsevier B.V. All rights reserved.

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

name-based inter-domain routing
naming
network architecture


Digital watermarking of text, image, and video documents The ease of reproduction, distribution, and manipulation of digital documents creates problems for authorized parties that wish to prevent illegal use of such documents. To this end, digital watermarking has been proposed as a last line of defense. A digital watermark is an imperceptible, robust, secure message embedded directly into a document. The watermark is imperceptible both perceptually and statistically. Robustness means that the watermark cannot be removed or modified unless the document is altered to the point of no value. The watermark is secure if unauthorized parties cannot erase or modify it. Current watermarking schemes may be viewed as spread-spectrum communications systems, which transmit a message redundantly using a low-amplitude, pseudo-noise carrier signal. An example highlights the basic mechanisms and properties of spread spectrum and their relation to watermarking. Finally, specific issues in watermarking of text, images, and video are discussed, along with watermarking examples.

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

data hiding
copyright protection
spread-spectrum communications


A technique of three-level thresholding based on probability partition and fuzzy 3-partition Thresholding is a commonly used technique in image segmentation. Selecting the correct thresholds is a critical issue. In this paper, the relationship between a probability partition (PP) and a fuzzy c-partition (FP) in thresholding is given. This relationship and the entropy approach are used to derive a thresholding technique to select the best fuzzy c-partition. The measure of the selection quality is the compatibility between the FP and the PP generated by the problem. An entropy function defined by the PP and FP is used to measure the compatibility. A necessary condition of the entropy function arriving at a maximum is derived. Based on this condition, an efficient algorithm for three-level thresholding is deduced. Experiments to verify the efficiency of the proposed method and comparison to some existing techniques are also presented. The experiment results show that our proposed method gives the best performance in three-level thresholding using fuzzy c-partition.

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

entropy
probability partition
thresholding


Neurobiological Research on Sleep and Stress Hormones in Epidemiological Samples Information on stress hormones and sleep disturbance in posttraumatic stress disorder (PTSD) is on the basis of clinical samples and samples of other selective populations. Neurobiological studies nested in a large epidemiological community sample were recently reported. PTSD was compared with several control groups, defined by exposure and by diagnostic classification on the basis of comorbidity with Major Depression. Key findings wer

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


enhancing esl education in india with a reading tutor that listens We report results of a 2 1/2-month pilot study of Project Listen's PC-based Reading Tutor program for enhancing English education in India. Our focus was on low-income elementary school students, a population that has little or no exposure to English outside of school. The students showed measurable improvement on quantitative tests of reading fluency while using the tutor. Post-pilot interviews explored the students' experience of the reading tutor. Further, a survey of educational programs gives a picture of the wide range of institutions providing training in English in and around Bangalore to low-income populations. Each has associated infrastructure, personnel, and curricular constraints that would be faced by interventions like the reading tutor, even if it can be shown to be effective. The perceived advantages of literacy software and associated measures of success also vary by program.

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

educational technology
speech recognition


Dynamic phase transition and multicritical dynamic phase diagrams of the kinetic spin-3/2 Blume-Emery-Griffiths model with repulsive biquadratic coupling under a time-dependent oscillating external field We extend our recent paper [O. Canko, B. Deviren, M. Keskin, J. Phys.: Condens. Mater 118 (2006) 6635] to present a study, within a mean-field approach, the stationary states of the kinetic spin-3/2 Blume-Emery-Griffiths model with repulsive biquadratic interaction under the presence of a time varying (sinusoidal) magnetic field. We found that the dynamic phase diagrams of the present work exhibit more complex, richer and more topological different types of phase diagrams than our recent paper. Especially, the obtained dynamic phase diagrams show the ferrimagnetic (i) phase in addition to the ferromagnetic +/- 3/2 (f(3/2)), ferromagnetic +/- 1/2 (f(1/2)), antiquadrupolar or staggered (a) and disordered (d) phases, and the f(3/2) + i, f(1/2) + d, i + d, f(3/2) + i + d, a + d and/or f(3/2) + i + a coexistence regions in addition to the f(3/2) + f(1/2), f(3/2) + d, f(3/2) + a, f(1/2) + d and/or f(3/2) + a + d coexistence regions, depending on interaction parameters. Moreover, the phase diagrams exhibit dynamic zero-temperature critical, critical end, double critical end, multicritical, and/or pentacritical special points in addition to the dynamic tricritical, double critical end point, triple, quadruple and/or tetracritical special points that depending on the interaction parameters. (C) 2007 Published by Elsevier B.V.

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

two-sublattice spin-3/2 blume-emery-griffiths model


Artificial Neural Network for Compositional Ionic Liquid Viscosity Prediction Being a new generation of green solvents and high-tech reaction media of the future, ionic liquids have increasingly attracted much attention. Of particular interest in this context are room temperature ionic liquids (in short as ILs in this paper). Due to the relatively high viscosity, ILs is expected to be used in the form of solvent diluted mixture with reduced viscosity in industrial application, where predicting the viscosity of IL mixture has been an important research issue. Different IL mixture and many modelling approaches have been investigated. The objective of this study is to provide an alternative model approach using soft computing technique, i.e., artificial neural network (ANN) model, to predict the compositional viscosity of binary mixtures of ILs [C-n-mim][ NTf2] with n=4, 6, 8, 10 in methanol and ethanol over the entire range of molar fraction at a broad range of temperatures from T=293.0-328.0K. The results show that the proposed ANN model provides alternative way to predict compositional viscosity successfully with highly improved accuracy and also show its potential to be extensively utilized to predict compositional viscosity taking account of IL alkyl chain length, as well as temperature and compositions simultaneously, i.e., more complex intermolecular interactions between components in which it would be hard or impossible to establish the analytical model. This illustrates the potential application of ANN in the case that the physical and thermodynamic properties are highly non-linear or too complex.

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

artificial neural network
room temperature ionic liquids
viscosity


A strategy-based model for e-commerce planning Poor planning practice is one of the reasons for the inferior results of some e-commerce ventures. In this paper, it is suggested at a strategy-based e-commerce planning model containing seven specific dimensions, with strategy at its core, should be considered when entering into a new e-commerce venture. Implications for managerial practice upon the adoption of such a planning model are also discussed.

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

electronic commerce
process planning
modelling


What have examinations got to do with computers in education? Abstract ? Courseware, i.e. computer based learning materials, usually includes some self-assessment for formative assessment. Insufficient attention has been paid, however, to the link between formal assessment and use of courseware: teachers and learners focus on examination syllabuses. Examinations bodies can use only the simplest forms of ICT-based assessment (objective or multiple choice tests) until learners are familiar with newer styles. This problem can be addressed on several fronts: with new ICT styles of tests, by developing websites supporting learners and teachers, by conducting field trials using computers under examination conditions and by commissioning new types of examination questions built around online interactive simulations.

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

change english internet mathematics professional secondary vocational


Towards applying content-based image retrieval in the clinical routine Content-based image retrieval (CBIR) has been one the most vivid research areas in the field of computer vision, and substantial progress has been made over the last years. As such, many have argued for the use of CBIR to support medical imaging diagnosis. However, the sheer volume of data produced in radiology centers has precluded the use of CBIR in the daily routine of hospitals and clinics. This paper aims to change this status quo. We here present a solution that applies Computational Grids to significantly speed up the CBIR procedure, while preserving the security of data in the clinical routine. This solution combines texture attributes and registration algorithms that together are capable of retrieving images with greater-than-90% precision, yet running in a few minutes over the Grid, making it usable in the clinical routine.

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

content-based image retrieval
image registration
grid computing


Impact analysis and change propagation in service-oriented enterprises: A systematic review The adoption of Service-oriented Architecture (SOA) and Business Process Management (BPM) is fairly recent. The major concern is now shifting towards the maintenance and evolution of service-based business information systems. Moreover, these systems are highly dynamic and frequent changes are anticipated across multiple levels of abstraction. Impact analysis and change propagation are identified as potential research areas in this regard. The aim of this study is to systematically review extant research on impact analysis and propagation in the BPM and SOA domains. Identifying, categorizing and synthesizing relevant solutions are the main study objectives. Through careful review and screening, we identified 60 studies relevant to 4 research questions. Two classification schemes served to comprehend and analyze the anatomy of existing solutions. BPM is considered at the business level for business operations and processes, while SOA is considered at the service level as deployment architecture. We focused on both horizontal and vertical impacts of changes across multiple abstraction layers. Impact analysis solutions were mainly divided into dependency analysis, traceability analysis and history mining. Dependency analysis is the most frequently adopted technique followed by traceability analysis. Further categorization of dependency analysis indicates that graph-based techniques are extensively used, followed by formal dependency modeling. While considering hierarchical coverage, inter-process and inter-service change analyses have received considerable attention from the research community, whereas bottom-up analysis has been the most neglected research area. The majority of change propagation solutions are top-down and semi-automated. This study concludes with new insight suggestions for future research. Although, the evolution of service-based systems is becoming of grave concern, existing solutions in this field are less mature. Studies on hierarchical change impact are scarce. Complex relationships of services with business processes and semantic dependencies are poorly understood and require more attention from the research community.

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

soa
bpm
dependency analysis
change propagation

web service
cia
semantic annotation
msr
soc
systematic literature review (slr)


The development of an embedded, integrated INS/GPS system An embedded, real-time, loosely-coupled INS/GPS integration system has been developed and used for an unmanned land vehicle's control and navigation. For this integrated system, a Kalman filter software is used for INS error damping and corrections via the weighted aiding of a GPS output. The detailed development work will be presented in this paper including algorithm simplification, sensor selection and critical problems solving. Vehicular trial is also conducted. Simulated outage in GPS availability is made to assess the bridging accuracy of this system.

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


Optical coordinate tracking system using afocal optics for image-guided surgery Image-guided surgery using medical robots supports surgeons by providing critical real-time feedback information, such as surgical instrument tracking, patient-specific models, and the use of surgery robots. An image-guided surgery system based on afocal optics was developed to overcome the problems associated with conventional optical tracking systems.

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


Improved quality analytical models for aquatic products at the transportation in the cold chain This paper theoretically analyzes the quality changes of aquatic products by the temperature environments according to the types of temperature fluctuations. First the temperature fluctuation is divided into three types of temperature environments for discussion during the transportation in the aquatic cold chain, by which the temperature model is put forward for each type. And then quality evaluation models are established respectively for the three temperature fluctuating environments. Finally, experiments are given, which show the effectiveness of the models. (C) 2011 Elsevier Ltd. All rights reserved.

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