SUBBAND VARIANCE COMPUTATION OF HOMOSCEDASTIC ADDITIVE NOISE IN DISCRETE DYADIC WAVELET TRANSFORM The paper deals with noise power variation that occurs when Discrete Dyadic Wavelet Transform (DDWT) is applied to signals affected by Wide Sense Stationary (WSS) additive white noise owing to the use of a non orthonormal expansion. An exact relationship between the noise variance in the original signal and the noise variance in the wavelet coefficients at a generic level is derived. This relationship is crucial in the application of wavelet thresholding for signal denoising to properly select the threshold in each subband.

O O O O B I I O B I I I O O O O O O O O O O B I I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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
homoscedastic additive noise


COMPARISON OF OPEN SOURCE TOOLS FOR PROJECT MANAGEMENT Software projects often fail, because they are not adequately managed. The establishment of effective and efficient project management practices still remains a key challenge to software organizations. Striving to address these needs, "best practice" models, such as, the Capability Maturity Model Integration (CMMI) or the Project Management Body of Knowledge (PMBOK), are being developed to assist organizations in improving project management. Although not required, software tools can help implement the project management process in practice. In order to provide comprehensive, low-cost tool support for project management, specifically, for small and medium enterprises (SMEs), in this paper we compare the most popular free/open-source web-based project management tools with respect to their compliance to PMBOK and CMMI for Development (CMMI-DEV). The results of this research can be used by organizations to make decisions on tool adoptions as well as a basis for evolving software tools in alignment with best practices models.

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

open-source software (oss)
small and medium enterprises (smes)


Interpretable prediction of non-genotoxic hepatocarcinogenic chemicals The assessment of non-genotoxic hepatocarcinogenicity of chemicals relies on time-consuming rodent bioassays. The development of alternative methods for non-genotoxic hepatocarcinogenicity could help the identification of potential hepatocarcinogenic chemicals. This study evaluated four types of features for the interpretable prediction of non-genotoxic hepatocarcinogenic chemicals including chemicalchemical interactions (CCI), chemicalprotein interactions (CPI), chemical descriptors (QSAR) and gene expression profiles (TGx). Based on the results of decision tree classifiers, the CPI-based features perform best with independent test accuracies of 90% and 86% for interaction scores from combined scores and databases, respectively. Informative features were identified and analyzed to give insights into the non-genotoxic hepatocarcinogenicity of chemicals. The difference between CPI scores and gene expression profiles for the identified important proteins shows that CPI could play more important roles in non-genotoxic hepatocarcinogenicity.

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


Salient object detection using content-sensitive hypergraph representation and partitioning As an important problem in image understanding, salient object detection is essential for image classification, object recognition, as well as image retrieval. In this paper, we propose a new approach to detect salient objects from an image by using content-sensitive hypergraph representation and partitioning. Firstly, a polygonal potential Region-Of-Interest (p-ROI) is extracted through analyzing the edge distribution in an image. Secondly, the image is represented by a content-sensitive hypergraph. Instead of using fixed features and parameters for all the images, we propose a new content-sensitive method for feature selection and hypergraph construction. In this method, the most discriminant color channel which maximizes the difference between p-ROI and the background is selected for each image. Also the number of neighbors in hyperedges is adjusted automatically according to the image content. Finally, an incremental hypergraph partitioning is utilized to generate the candidate regions for the final salient object detection, in which all the candidate regions are evaluated by p-ROI and the best match one will be the selected as final salient object. Our approach has been extensively evaluated on a large benchmark image database. Experimental results show that our approach can not only achieve considerable improvement in terms of commonly adopted performance measures in salient object detection, but also provide more precise object boundaries which is desirable for further image processing and understanding.

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

salient object detection
hypergraph representation
incremental hypergraph partitioning

potential region-of-interest (p-roi) extraction


Energy efficient fault tolerant clustering and routing algorithms for wireless sensor networks ? Conservation of energy and fault tolerance are two major issues in the deployment of a wireless sensor network (WSN). Design of clustering and routing algorithms for a large scale WSN should incorporate both these issues for the long run operation of the network. In this paper, we propose distributed clustering and routing algorithms jointly referred as DFCR. The algorithm is shown to be energy efficient and fault tolerant. The DFCR uses a distributed run time recovery of the sensor nodes due to sudden failure of the cluster heads (CHs). It takes care of the sensor nodes which have no CH within their communication range. We perform extensive experiments on the proposed algorithm using various network scenarios. The experimental results are compared with the existing algorithms to demonstrate the strength of the algorithm in terms of various performance metrics.

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

wireless sensor networks
clustering
routing
fault tolerant


Dynamic service migration and workload scheduling in edge-clouds Edge-clouds provide a promising new approach to significantly reduce network operational costs by moving computation closer to the edge. A key challenge in such systems is to decide where and when services should be migrated in response to user mobility and demand variation. The objective is to optimize operational costs while providing rigorous performance guarantees. In this paper, we model this as a sequential decision making Markov Decision Problem (MDP). However, departing from traditional solution methods (such as dynamic programming) that require extensive statistical knowledge and are computationally prohibitive, we develop a novel alternate methodology. First, we establish an interesting decoupling property of the MDP that reduces it to two independent MDPs on disjoint state spaces. Then, using the technique of Lyapunov optimization over renewals, we design an online control algorithm for the decoupled problem that is provably cost-optimal. This algorithm does not require any statistical knowledge of the system parameters and can be implemented efficiently. We validate the performance of our algorithm using extensive trace-driven simulations. Our overall approach is general and can be applied to other MDPs that possess a similar decoupling property.

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

edge-clouds
stochastic optimization
markov decision processes


Nonlinear regenerative chatter in turning Chatter is a topic of immense engineering importance because its occurrence in machining results in poor surface finish, promotes tool wear and hampers productivity. In this paper, a single degree of freedom, delay differential equation model is presented. The central idea of the model is the study of regenerative chatter effect, which qualitatively explains the nonlinear dynamics in machining. Stability charts are derived for the linearized case in a two dimensional phase plane (?,?) with the bifurcation parameter ? representing the dynamic variation of the chip thickness, and the critical rotational speed ?. The governing nonlinear equations are integrated in time by Adams Predictor corrector Method. Phase portraits are drawn between the instantaneous tool position x1 and the relative tangential velocity x2. It has been shown that in the absence of a cubic nonlinearity, the chatter response appears to be more chaotic.

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


Finite element analysis of the indentation test on rocks with microstructure Strength parameters of rocks are currently determined from indentation tests. In this paper, a finite element analysis of this test is presented and scale effect is studied. The rock is modelled as an elasto-plastic medium with Cosserat microstructure and consequently possesses an internal length. The response of the indentation curve is studied for various values of the size of the indentor as compared to the internal length of the rock in order to assess the scale effect.

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

strength
microstructure
finite element analysis
scale effect


Marching along a regular surface surface intersection with circular steps This paper presents a simple and elegant algorithm to estimate adaptively the stepping direction and size for tracing a branch of the intersection curve between two regular surfaces without any nonlinear equation system solver (Kriezis and Patrikalakis, 1991; Abdel-Malek and Yeh, 1996; Grandine and Klein, 1997). The step is neither along the tangent vector at the current point (Barnhill, 1987) nor along a parabola in a vicinity of the current point (Stoyanov, 1992); it is along a circle at the current point. Although no curvature analysis or power series expansions about each point of the intersection curve were used in its construction, we demonstrate that our circle tends to the exact osculating circle, when the distance between two subsequent sampling points tends to zero. Through numerical examples, we also show that the performance of our algorithm by handling singular points, bifurcations, and points on the closely spaced branches, is equivalent to the ones based on embedding schemes (Abdel-Malek and Yeh, 1996; Grandine and Klein, 1997). (C) 1999 Elsevier Science B.V. All rights reserved.

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

surface intersection
regular surfaces
osculating circle

marching method
marching step
geometric modeling


The role of 3-D interactive visualization in blind surveys of Hi in galaxies Upcoming Hi surveys will deliver large datasets, and automated processing using the full 3-D information (two positional dimensions and one spectral dimension) to find and characterize Hi objects is imperative. In this context, visualization is an essential tool for enabling qualitative and quantitative human control on an automated source finding and analysis pipeline. We discuss how Visual Analytics, the combination of automated data processing and human reasoning, creativity and intuition, supported by interactive visualization, enables flexible and fast interaction with the 3-D data, helping the astronomer to deal with the analysis of complex sources. 3-D visualization, coupled to modeling, provides additional capabilities helping the discovery and analysis of subtle structures in the 3-D domain. The requirements for a fully interactive visualization tool are: coupled 1-D/2-D/3-D visualization, quantitative and comparative capabilities, combined with supervised semi-automated analysis. Moreover, the source code must have the following characteristics for enabling collaborative work: open, modular, well documented, and well maintained. We review four state of-the-art, 3-D visualization packages assessing their capabilities and feasibility for use in the case of 3-D astronomical data.

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

radio lines: galaxies
galaxies: kinematics and dynamics
scientific visualization


Radio frequency perforation of cardiac tissue: modelling and experimental results Radio frequency (RF) current delivered through a thin catheter can be used to perforate the pulmonary valve or the atrial septum to treat pulmonary atresia in newborns. To understand better the mechanisms of RF perforation, a numerical model is developed, and experiments are performed in isolated canine cardiac tissue. The model consists of a cylindrical domain with a tissue layer between two blood layers. The finite-difference method is used to compute both the potential and temperature distributions. When the tissue temperature exceeds 100 degreesC in all points that are directly in front of the catheter, these points are considered to be instantly vaporised, and the catheter advances over these points. The computed temperature time course coincides with measured temperature at small voltages (<16 V). Simulated perforation occurs when the voltage exceeds a threshold of 70-80 V for a catheter diameter of 0.30-0.44 mm, which coincides with experimental observations in the myocardium. A voltage exceeding this perforation threshold fends to decrease tissue damage. Shorter electrodes (0.7 mm as against 2.4 mm) with smaller diameters produce a more rapid perforation, in conclusion, numerical simulations provide insights into aspects of RF perforation, such as electrode size, current, speed of perforation and collateral damage.

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


Can a convex polyhedron have a developable face-cycle? A face-cycle of a polyhedron in R-3 is a cyclic sequence of at least three, distinct faces of the polyhedron such that each consecutive pair of faces have a common edge. We prove that for any face-cycle cut out from a (cardboard) convex polyhedron, it is impossible to unfold the face-cycle to lie flat on the plane. (C) 2000 Elsevier Science B.V. All rights reserved.

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


Three-Parallel Reed-Solomon Decoder Using S-DCME for High-Speed Communications This paper proposes a high-speed and area-efficient three-parallel Reed-Solomon (RS) decoder using the simplified degree computationless modified Euclid (S-DCME) algorithm for the key equation solver (KES) block. To achieve a high throughput rate, the inner signals, such as the syndrome, error locator and error value polynomials, are computed in parallel. In addition, the key equations are solved by using the S-DCME algorithm to reduce the hardware complexity. To handle the many problems caused by applying the S-DCME algorithm to the KES block, we modify the architectures of some of the blocks in the three-parallel RS decoder. The proposed RS architecture can reduce the hardware complexity by about 80% with respect to the KES block. In addition, the proposed RS architecture has an approximately 25% shorter latency than the conventional parallel RS architectures.

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


More than words: Social networks' text mining for consumer brand sentiments Blogs and social networks have recently become a valuable resource for mining sentiments in fields as diverse as customer relationship management, public opinion tracking and text filtering. In fact knowledge obtained from social networks such as Twitter and Facebook has been shown to be extremely valuable to marketing research companies, public opinion organizations and other text mining entities. However, Web texts have been classified as noisy as they represent considerable problems both at the lexical and the syntactic levels. In this research we used a random sample of 3516 tweets to evaluate consumers' sentiment towards well-known brands such as Nokia, T-Mobile, IBM, KLM and DHL. We used an expert-predefined lexicon including around 6800 seed adjectives with known orientation to conduct the analysis. Our results indicate a generally positive consumer sentiment towards several famous brands. By using both a qualitative and quantitative methodology to analyze brands' tweets, this study adds breadth and depth to the debate over attitudes towards cosmopolitan brands. (C) 2013 Elsevier Ltd. All rights reserved.

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

consumer behavior
global brands
sentiment analysis


Vascular tree object segmentation by deskeletonization of valley courses In this paper, we propose a valley-course-based image segmentation technique for tree-like object delineation, as an alternative to the traditional centerline-based methods. This technique consists of valley-course extraction, skeleton pruning and deskeletonization. Valley courses, constructed from valley points that are obtained by star-pattern scanning over an image, offer a natural manner of identifying tree skeletons. Unattached segments are removed using morphological operations. A structured tree is then constructed from the skeletons by using a tree pruning/spanning algorithm. A fleshy tree-like object is obtained by a deskeletonization procedure, which consists of extracting tree boundary in vicinity of the skeletons in the original image. The tree boundary is determined by identifying paired edge points at a valley point. A derivative-free edge identification approach is proposed, which defines an edge point at a side-slope by a relative intensity drop with respect to the local background. An empirical formula using a logarithmic function of local intensity contrast offers desirable characteristics of adaptability and stability. The adaptability of edge points to the local background is attributed to the compression behavior of logarithmic function. Furthermore, stability to noise is resulted because derivative operations are not used. The segmentation technique was validated using coronary angiographic images.

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

image segmentation
valley courses
skeleton pruning
deskeletonization


Optimal shapes of parametrically excited beams Straight elastically supported beams of variable width under the action of a periodic axial force are considered. Two shape optimization problems for reducing parametric resonance zones are studied. In the first problem, the minimal (critical) amplitude of the excitation force is maximized. In the second problem, the range of resonant frequencies is minimized for a given parametric resonance zone and a fixed amplitude of excitation. These two optimization problems are proved to be equivalent in the case of small external damping and small excitation force amplitude. It is shown that optimal designs have strong universal character, i.e. they depend only on the natural modes involved in the parametric resonance and boundary conditions. An efficient numerical method of optimization is developed. Optimal beam shapes are found for different boundary conditions and resonant modes. Experiments for uniform and optimal simply supported elastic beams have been conducted demonstrating a very good agreement with theoretical prediction.

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

elastic beam
singularity
sensitivity analysis
experiment


communities, technology, and civic intelligence In this paper, we ask what it would take to envision and support collective intelligence that was socially and environmentally ameliorative. To help answer that question we introduce the concept of "civic intelligence" as a manifestation of collective intelligence that could serve the needs of researchers and practitioners working at the intersection of communities and technology. We build a case for its importance and relevance, and provide several examples, and some preliminary models and frameworks. We also discuss implications for members of this community. We argue that an examination of the social context is critical and that a civic intelligence orientation surfaces important research questions. We present some thoughts on future projects that would help promote understanding about civic intelligence while improving it. Finally we present some choices before us as we move forward in an environment that is dynamic and uncertain.

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

collective intelligence
civic intelligence

democracy
collaboration
web 2.0
social learning
social cognition


Guarded fixed point logics and the monadic theory of countable trees Different variants of guarded logics (a powerful generalization of modal logics) are surveyed and an elementary proof for the decidability of guarded fixed point logics is presented. In a joint paper with Igor Walukiewicz, we proved that the satisfiability problems for guarded fixed point logics are decidable and complete for deterministic double exponential time (E. Gradel and I. Walukiewicz, Proc. 14th IEEE Symp. on Logic in Computer Science, 1999, pp. 45-54). That proof relies on alternating automata on trees and on a forgetful determinacy theorem for games on graphs with unbounded branching. The exposition given here emphasizes the tree model property of guarded logics: every satisfiable sentence has a model of bounded tree width. Based on the tree model property, we show that the satisfiability problem for guarded fixed point formulae can be reduced to the monadic theory of countable trees (SomegaS), or to the mu-calculus with backwards modalities. (C) 2002 Elsevier Science B.V. All rights reserved.

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

guarded logics
fixed point logics
decidability


Modeling and simulation of supply network evolution based on complex adaptive system and fitness landscape A supply network (SN) is a complex adaptive system, and its structure and collaboration mechanism evolves over time. However, most literature views SN as a static system and the study on the evolution of SNs is very limited. Based on complex adaptive system and fitness landscape theory, this paper first proposes an evolution model of SNs in order to understand the general principle of SN evolution. Then the paper conducts a multi-agent simulation oil the evolution model, and discloses that the SN emerges and evolves front firms' dynamic interaction under the dynamic environment. Dominated by the environment and firms' internal mechanism, the evolution is highly sensitive to the initial condition, and it is path-dependent and difficult to predict precisely. Although the dynamics of environments is different, it SN enjoys the stable structure in different environments. Higher level of structure stability and fitness of the SN are achieved when the firms in the SN adopt the long-term collaboration strategy rather than the short-term strategy. Finally, a China case is explored which validates the self-organization evolution of SNs. (C) 2008 Elsevier Ltd. All rights reserved.

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

operations management
supply networks
self-organization
system modeling
case study


Low bit-rate multi stage vector quantization based on energy clustered training set In this paper, a new multi stage vector quantization with energy clustered training set is proposed for color image coding. The input image is applied with orthogonal polynomials based transformation and the energy clustered transformed training vectors are obtained with reduced dimension. The stage-by-stage codebook for vector quantization is constructed from the proposed transformed training vectors so as to reduce computational complexity. This method also generates a single codebook for all the three color components, utilizing the inter-correlation property of individual color planes and interactions among the color planes due to the proposed transformation. As a result, the color image encoding time is only slightly higher than that of gray scale image coding time and in contrast to the existing color image coding techniques, whose time is thrice greater than that of gray scale image coding. The experimental results reveal that only 35% and 10% of transform coefficients are sufficient for smaller and larger blocks respectively, for the reconstruction of images with good quality. The proposed multi stage vector quantization technique is faster when compared to existing techniques and yields better trade-off between image quality and block size for encoding.

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

color image coding
energy clustered training set
multi stage vector quantization


Manifold regularized kernel logistic regression for web image annotation With the rapid advance of Internet technology and smart devices, users often need to manage large amounts of multimedia information using smart devices, such as personal image and video accessing and browsing. These requirements heavily rely on the success of image (video) annotation, and thus large scale image annotation through innovative machine learning methods has attracted intensive attention in recent years. One representative work is support vector machine (SVM). Although it works well in binary classification, SVM has a non-smooth loss function and can not naturally cover multi-class case. In this paper, we propose manifold regularized kernel logistic regression (KLR) for web image annotation. Compared to SVM, KLR has the following advantages: (1) the KLR has a smooth loss function; (2) the KLR produces an explicit estimate of the probability instead of class label; and (3) the KLR can naturally be generalized to the multi-class case. We carefully conduct experiments on MIR FLICKR dataset and demonstrate the effectiveness of manifold regularized kernel logistic regression for image annotation.

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

kernel logistic regression
image annotation

manifold regularization
laplacian eigenmaps
semi-supervised learning


An information theoretic approach for improving data driven prediction of protein model quality We present the results of an information theory-based approach to select an optimal subset of features for the prediction of protein model quality. The optimal subset of features was calculated by means of a backward selection procedure. The performances of a probabilistic classifier modeled by means of a Kernel Probability Density Estimation method (KPDE) were compared with those of a feed-forward Artificial Neural Network (ANN) and a Support Vector Machine (SVM).

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

protein structure prediction
feature selection
relative entropy
statistical learning


Au efficient reduction method of a substrate RC network model This paper proposes an efficient reduction method for a substrate network model. which is extracted from layout datal to analize a substrate coupling noise. The proposed method adopts in a reduction operation a hierarchic structure of a substrate RC network model, a computational procedure using matrix elements: and an expression of admittance as polynominal in complex frequency s = jw. These techniques improve computational efficiency and are suitable for an implementation. In the example of a triple well CMOS circuit, a reduced model, from 7500 nodes to 5 nodes. has less than 25% errors up to 1 GHz.

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

modeling
circuit simulation
model reduction


An improved, wavelet-based, stereoscopic image sequence codec with SNR and spatial scalability A novel stereoscopic moving-image compression structure is presented in this paper that allows for SNR and spatial scalability. The right picture sequence, referred to as the reference sequence, is encoded in the wavelet domain using motion-compensated prediction, where intra-pictures and prediction error are encoded using an adaptively scanned wavelet-difference-reduction (ASWDR) algorithm. The left picture sequence, referred to as the target sequence, is coded using disparity-compensated prediction, where the prediction error is also coded with ASWDR. Variable-block disparity and motion compensation and a novel loop filtering scheme to suppress partition artifacts induced by imperfect disparity and motion compensation are the key features of the proposed algorithm. The hierarchical structure of the two-dimensional DWT is exploited to obtain discrete levels of spatial scalability.

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

time-varying stereoscopic imagery
asymmetrical coding
loop-filtering
snr scalability


Molecular dynamics study on the ligand recognition by tandem SH3 domains of p47phox, regulating NADPH oxidase activity The phagocyte NADPH oxidase complex plays a crucial role in host defense against microbial infection through the production of superoxides. Chronic granulomatous disease (CGD) is an inherited immune deficiency caused by the absence of certain components of the NADPH oxidase. Key to the activation of the NADPH oxidase is the cytoplasmic subunit p47phox, which includes the tandem SH3 domains (N-SH3 and C-SH3). In active phagocytes, p47phox forms a stable complex with the cytoplasmic region of membrane subunit p22phox that forms a left-handed polyproline type-II (PPII) helix conformation. In this report, we have analyzed the conformational changes of p47phoxp22phox complexes of wild-type and three mutants, which have been detected in CGD patients, using molecular dynamics simulations. We have found that in the wild-type, two basal planes of PPII prism in cytoplasmic region of p22phox interacted with N-SH3 and C-SH3. In contrast, in the modeled mutants, the residue at the ape of PPII helix, which interacts simultaneously with both of the tandem SH3 domains in the wild-type, moved toward C-SH3. Furthermore, interaction energies of the cytoplasmic region of p22phox with C-SH3 tend to decrease in these mutants. All these findings led us to conclude that interactions between N-SH3 of p47phox and PPII helix, which is formed by cytoplasmic region of p22phox, may play a significant role in the activation of the NADPH oxidase.

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

molecular dynamics
nadph oxidase
ppii helix
ligand recognition


categorical skylines for streaming data The problem of skyline computation has attracted considerable research attention. In the categorical domain the problem becomes more complicated, primarily due to the partially-ordered nature of the attributes of tuples. In this paper, we initiate a study of streaming categorical skylines. We identify the limitations of existing work for offline categorical skyline computation and realize novel techniques for the problem of maintaining the skyline of categorical data in a streaming environment. In particular, we develop a lightweight data structure for indexing the tuples in the streaming buffer, that can gracefully adapt to tuples with many attributes and partially ordered domains of any size and complexity. Additionally, our study of the dominance relation in the dual space allows us to utilize geometric arrangements in order to index the categorical skyline and efficiently evaluate dominance queries. Lastly, a thorough experimental study evaluates the efficiency of the proposed techniques.

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


Modeling of lifting-device aerodynamics using the actuator surface concept The actuator surface (AS) concept and its implementation within a differential, Navier Stokes control volume finite-element method (CVFEM) are presented in this article. Inspired by vortex and actuator disk methods, the AS concept consists of using porous surfaces carrying velocity and pressure discontinuities to model the action of lifting surfaces on the flow. The underlying principles and mathematics associated with AS are first reviewed, as well as their implementation in a CVFEM. Results are presented for idealized 2D cases with analytical solutions, as well as for the 3D cases of a finite wing and an experimental wind turbine. In the case of the finite wing, wake induction is well handled by the model with accurate predictions of induced angles and drag when compared with the Prandtl lifting line model. Comparisons with volume force approaches, often used to model the action of propellers or wind turbine blades in a simplified analysis, show that the AS concept has some interesting advantages in terms of accuracy and respect of flow physics. This new approach is easy and rapid to embed in most computational fluid dynamics (CFD) methods. It is applicable to a wide range of problems involving thin lifting devices like finite wings, propellers, helicopter or wind turbine blades. Copyright (C) 2009 John Wiley & Sons, Ltd.

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

cfd
actuator surface
actuator disk
wake induction
finite wings

control volume finite-element methods
rotating flows


Testing for expected return and market price of risk in Chinese A and B share markets: A geometric Brownian motion and multivariate GARCH model approach There exist dual listed stocks which are issued by the same company in some stock markets. Although these stocks bare the same firm-specific risks and enjoy identical dividends and voting policies, they are priced differently. Some previous studies show this seeming deviation from the law of one price can be solved by allowing different expected returns and market prices of risk for investors holding heterogeneous beliefs. This paper provides empirical evidence for that argument by testing the expected return and market price of risk between Chinese A and B shares listed in Shanghai and Shenzhen stock markets. Models with dynamic of Geometric Brownian Motion are adopted. Multivariate GARCH models are also introduced to capture the feature of time-varying volatility in stock returns. The results suggest that the different pricing can be explained by the difference in expected returns between A and B shares. However, the difference between market price of risk is insignificant for both markets if GARCH models are adopted. (C) 2009 IMACS. Published by Elsevier B.V. All rights reserved.

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

expected return
market price of risk
multivariate garch


A training whole-heart model for simulating propagation and ECG patterns The forward problem of electrocardiography describes the spatio-temporal sourcefield relationship generating the body surface potential (BSP) and, thus, the electrocardiogram (ECG). The paper presents a ventricular and atrial model for simulating cardiac de- and repolarization and the P-, QRS- and T-wave. The atria and the ventricles are coupled, so that electroanatomical function can be simulated at ones. Movement and contraction are not taken into account while an individual geometry, fibre architecture and ECG sensor arrangement including the Wilson central terminal (WCT) as common reference were considered. This in silico whole-heart model can be used for detailed investigations of the nature of the ECG for the normal beat, arrhythmias, ischemia and infarction. In addition, this model was used as a reference tool for developing and testing different electrocardiographic inverse approaches.

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


Generalized balanced tournament designs and related codes A generalized balanced tournament design, or a GBTD(k, m) in short, is a (km, k, k - 1)-BIBD defined on a km-set V. Its blocks can be arranged into an m x (km - 1) array in such a way that (1) every element of V is contained in exactly one cell of each column, and (2) every element of V is contained in at most k cells of each row. In this paper, we present a new construction for GBTDs and show that a GBTD(4, m) exists for any integer m >= 5 with at most eight possible exceptions. A link between a GBTD(k, m) and a near constant composition code is also mentioned. The derived code is optimal in the sense of its size.

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

near constant composition codes
constructions


New complex solutions for some special nonlinear partial differential systems In this present work, we explore new applications of direct algebraic method for some special nonlinear partial differential systems and equations. Then new types of complex travelling wave solutions are obtained to the DaveyStewartson system, the coupled Higgs system and the perturbed nonlinear Schrodingers equation; the balance number of it is not a positive integer.

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

perturbed nonlinear schrodingers equation


Design, Implementation, and Evaluation of a QoS-Aware Real-Time Embedded Database Quality-aware realtime Embedded DataBase (QeDB) is a database for data-intensive real-time applications running on embedded devices. Currently, databases for embedded systems are best effort, providing no guarantees on their timeliness and data freshness. Existing real-time database (RTDB) technology cannot be applied to these embedded databases since it hypothesizes that the main memory of a system is large enough to hold the entire database. This, however, might not be true in data-intensive real-time applications. QeDB uses a novel feedback control scheme to support QoS in such embedded systems without requiring all data to reside in main memory. In particular, our approach is based on simultaneous control of both I/O and CPU resources to guarantee the desired timeliness. Unlike existing work on feedback control of RTDB performance, we implement and evaluate the proposed scheme on a modern embedded device. The experimental results show that our approach supports the desired timeliness of transactions while still maintaining high data freshness compared to baseline approaches.

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

multiple input/multiple output (mimo) control


Turbine blade temperature transfer using the load surface method Temperature transfer is important to MDA (multidisciplinary analysis) of turbine blades, for the separation of aerodynamics and structure analysis codes. To re-couple these codes, a load surface method is provided here to transfer temperature across the interface of arbitrarily meshed CFD (Computational Fluid Dynamics) and CSM (Computational Structural Mechanics) models. The idea of the method is to transfer temperature by a Bi-cubic B B -spline surface, fitted from the CFD temperature results of interfaces in parametric space. The temperature of the CSM nodes of the interface is calculated from the load surface in the same parametric space. An important step in this transfer method is to map the CFD and CSM nodes into the same parametric space. The mapping surface method is detailed for this purpose. In the mapping method, the nodes are mapped onto a structured quad mesh, called a mapping surface, which is additionally generated on the interface surface. Then, the nodes are mapped into the parametric space, which is defined by a parameterization of the mapping surface. To evaluate the accuracy of the method, the temperature of a turbine blade is transferred experimentally. The result indicates that the method is accurate even for coarse meshes.

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

temperature transfer
parameterization
load surface


Theory of reference frames and biological control This article is aimed at introducing the theory of reference frames in mathematical psychology to the control theory community and to point out its relevance in understanding the differences between biological and engineering control systems. As an example, we discuss the problem of human posture control and point out how the reference frames theory lead to a natural solution which is in agreement with everyday observations on how a child learns to do posture control. (C) 2001 Elsevier Science Ltd. All rights reserved.

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


Acyclic coloring with few division vertices An acyclic k-coloring of a graph G is a mapping ? from the set of vertices of G to a set of k distinct colors such that no two adjacent vertices receive the same color and ? does not contain any bichromatic cycle. In this paper we prove that every planar graph with n vertices has a 1-subdivision that is acyclically 3-colorable (respectively, 4-colorable), where the number of division vertices is at most 2n?5 2 n ? 5 (respectively, n?3 n ? 3 ). On the other hand, we prove a 1.28n (respectively, 0.3n) lower bound on the number of division vertices for acyclic 3-colorings (respectively, 4-colorings) of planar graphs. Furthermore, we establish the NP-completeness of deciding acyclic 4-colorability for graphs with maximum degree 5 and for planar graphs with maximum degree 7.

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


Automated sleep stage identification system based on time-frequency analysis of a single EEG channel and random forest classifier In this work, an efficient automated new approach for sleep stage identification based on the new standard of the American academy of sleep medicine (AASM) is presented. The propose approach employs time-frequency analysis and entropy measures for feature extraction from a single electroencephalograph (EEG) channel. Three time-frequency techniques were deployed for the analysis of the EEG signal: Choi-Williams distribution (CWD), continuous wavelet transform (CWT), and Hilbert-Huang Transform (HHT). Polysomnographic recordings from sixteen subjects were used in this study and features were extracted from the time-frequency representation of the EEG signal using Renyi's entropy. The classification of the extracted features was done using random forest classifier. The performance of the new approach was tested by evaluating the accuracy and the kappa coefficient for the three time-frequency distributions: CWD, CWT, and HHT. The CWT time-frequency distribution outperformed the other two distributions and showed excellent performance with an accuracy of 0.83 and a kappa coefficient of 0.76. (c) 2011 Elsevier Ireland Ltd. All rights reserved.

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

automated sleep stage identification
random forest classifier

time-frequency analysis
choi-williams distribution (cwd)
continuous wavelet transform (cwt)
hilbert-huang transform (hht)


Finite-buffer queues with workload-dependent service and arrival rates We consider M/G/1 queues with workload-dependent arrival rate, service speed, and restricted accessibility. The admittance of customers typically depends on the amount of work found upon arrival in addition to its own service requirement. Typical examples are the finite dam, systems with customer impatience and queues regulated by the complete rejection discipline. Our study is motivated by queueing scenarios where the arrival rate and/or speed of the server depends on the amount of work present, like production systems and the Internet. First, we compare the steady-state distribution of the workload in two finite-buffer models, in which the ratio of arrival and service speed is equal. Second, we find an explicit expression for the cycle maximum in an M/G/1 queue with workload-dependent arrival and service rate. And third, we derive a formal solution for the steady-state workload density in case of restricted accessibility. The proportionality relation between some finite and infinite-buffer queues is extended. Level crossings and Volterra integral equations play a key role in our approach.

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

restricted accessibility
impatience
workload
cycle maximum
level crossings

finite buffer
state-dependent rates
volterra integral equation


An integrated environmental modeling framework for performing Quantitative Microbial Risk Assessments IEM FRAMES is a flexible tool to support custom-designed source-to-receptor QMRAs. FRAMES captures multiple and user-defined modeling approaches. An example QMRA assesses source apportionment and pathogens of importance. Pathogen fate and transport modeling is linked to point-of-exposure risk analysis. IEM links environmental and microbial characteristics with an uncertainty analysis.

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

integrated environmental modeling
qmra
pathogens

risk assessment
manure
watershed modeling


A filtration method for order-preserving matching We present a sublinear solution based on filtration for order-preserving matching. Any algorithm for exact string matching can be used as a filtering method. If the filtration algorithm is sublinear, the total method is sublinear on average. We show by practical experiments that the new solution is more efficient than earlier 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 B

combinatorial problems
order-preserving matching
string searching


A Close-to-linear Topic Detection Algorithm using Relative Entropy based Relevance Model and Inverted Indices Retrieval Although timely access to information is becoming increasingly important and gaining such access is no longer a problem, the capacity for humans to assimilate such huge amounts of information is limited. Topic Detection(TD) is then a promising research area that addresses speedy access of desired information. However, ironically, the time complexity of existing TD algorithms themselves is usually O(n(3)) or up to the x-th power of e. Linear performance requirement of real world topic detection has not been significantly addressed. This paper reveals a new patented topic detection algorithm called RMIR that combines relevance model with information retrieval technique to improve on time efficiency. Relevance Model(RM) is a theoretical extension of statistical language modeling that was developed for the task of document retrieval. To reduce the costs of fetching RM, we reduce the number of comparisons for stories by a query-based approach that makes similar stories exist in the top-k query results. We also build our query based on inverted indices, which have the complexity close to linear. The time cost of rest of operations in the RMIR topic detection process is a constant. Hence, the total complexity of RMIR topic detection algorithm should be close to linear as shown in experimental results. In addition, RMIR also gains better detection rates and robustness by relative entropy based topic model design.

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

topic detection
information retrieval
inverted indices

link topic detection
retrospective event detection
relevance models


persistence in web based collaborations We outline work on web based support for group creativity. We focus on a study of the effect persistence of participants' musical contributions has on their mutual engagement.

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


Nanoelectrode lithography using a flat mold with a pattern defined by different conductivities Nanoelectrode lithography is a pattern duplication method that combines nanoimprint with an electrochemical reaction. The method can form an oxide pattern directly on a semiconductor or metal. This method can use flat molds with patterns defined by substances with different conductivities, while the conventional nanoimprint technique must use a mold with a relief pattern. In this paper, the mold pattern for the technique is defined with an oxide material on the surface of a conductive substrate. Nanoelectrode lithography itself can be used to form a flat mold by using a conductive mold with a relief pattern, which leaves an oxide pattern via the anodic oxidation of Si. AFM lithography also can utilize an electrochemical reaction in the air to generate an oxide pattern on a conductive substrate, which gives us a flat mold. This paper shows that both types of flat mold can transfer a pattern to a target substrate. These strategies will allow us to realize on-demand mold fabrication, mold modification, and an easy way of obtaining a mold with a finer pattern.

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

nanoelectrode lithography
afm lithography


Software for X-ray fluorescence and scattering tomographic reconstruction Computer tomography is commonly based on transmitted radiation, i.e. the part of the radiation that does not interact with the sample. In recent years the scientific community has demonstrated a growing interest in alternative tomographic techniques, based on fluorescence or on scattered radiation. These kinds of tomography provide complementary information about the sample, e.g., information concerning the spatial distribution of particular elements. Furthermore, they can be applied on experimental situations where a complete turn of the apparatus around the object is not possible. However, fluorescence tomography presents certain additional difficulties in comparison to transmission tomography. This is mainly due to self-absorption effects in the sample. Few algorithms for the correction of such effects are reported in the literature. The solution proposed by Hogan et al. provides a good compromise between image quality and reconstruction speed. In this paper we report an implementation of such an algorithm and also several examples. It is our intention that this paper and the included software represent the first part of a complete set of tools for scattering and fluorescence tomography, which we intend to present in the near future. (C) 2001 Elsevier Science B.V. All rights reserved.

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


A new method for improved standardisation in three-dimensional computed tomography cephalometry Interest for three-dimensional computed tomography cephalometry has risen over the last two decades. Current methods commonly rely on the examiner to manually point-pick the landmarks and/or orientate the skull. In this study, a new approach is presented, in which landmarks are calculated after selection of the landmark region on a triangular model and in which the skull is automatically orientated in a standardised way. Two examiners each performed five analyses on three skull models. Landmark reproducibility was tested by calculating the standard deviation for each observer and the difference between the mean values of both observers. The variation can be limited to 0.1mm for most landmarks. However, some landmarks perform less well and require further investigation. With the proposed reference system, a symmetrical orientation of the skulls is obtained. The presented methods contribute to standardisation in cephalometry and could therefore allow improved comparison of patient data.

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


dynamic thermal-aware scheduling on chip multiprocessor for soft real-time system Thermal aware scheduling (TAS) is an important system level solution for dealing with the thermal issues on CMP. We propose a TAS algorithm based on look up tables to allow the rapid calculation of the post-thermal map from the current thermal profile. We propose two different metrics for determining where to place the task: one based on the maximum core temperature in the post-thermal map; and another based on the sum of the product of the post-thermal map temperature and the remaining task runtime for each core. Experimental results show that our algorithms are better, particularly for high power applications, at minimizing the peak/average temperature, and are able to achieve an average rejection ratio of about 30\% to 50\% of that chieved by existing algorithms from the literature.

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

soft real-time
post thermal map
dynamic tas


computer science in the air force academy core curriculum At last year's SIGCSE Technical Symposium on Computer Science Education, we were struck by three things. First, many people were struggling with how to best teach introductory computer science to a population that is predominantly not potential computer science majors (1). Second, there is great value in the exchange of information about how we are attacking the problem, why we chose this path, and how we feel it's working (2). Third, motivation is a key element in learning (3). Many things we heard last year acted as a catalyst for us to make some changes in the core computer science course (Comp Sci 100) at the Air Force Academy. In this paper, we discuss these changes and offer a candid, but preliminary, evaluation of our success in serving the needs of a large and diverse student population.

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

computer science
value
learning
core
paper
motivation
evaluation
curriculum

informal
change
computer science education


An evaluation of keyword, string similarity and very shallow syntactic matching for a university admissions processing infobot "Infobots" are small-scale natural language question answering systems drawing inspiration from ELIZA-type systems. Their key distinguishing feature is the extraction of meaning from users' queries without the use of syntactic or semantic representations. Three approaches to identifying the users' intended meanings were investigated: keyword-based systems, Jaro-based string similarity algorithms and matching based on very shallow syntactic analysis. These were measured against a corpus of queries contributed by users of a WWW-hosted infobot for responding to questions about applications to MSc courses. The most effective system was Jaro with stemmed input (78.57%). It also was able to process ungrammatical input and offer scalability.

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

chatbot
question-answering
jaro string similarity
jaro-winkler string similarity
shallow syntactic processing


Multi agent systems: An example of power system dynamic reconfiguration The energy management in complex power electronic systems especially in case of limited power availability is challenging. In these systems generators, loads, energy storage devices and electrical power routers must be dynamically controlled and reconfigured based on need and priority in order to accommodate the power demand. Furthermore, to achieve optimal use of the available energy, soft continuous reconfiguration is more effective than hard switching reconfiguration. The implementation of this capability in large systems calls for distribution on one hand and integration on the other hand, of control functionalities with monitoring, decision making and other ancillary functions. A multi-agent framework has been proposed in the literature to control these systems. Agents must perform different tasks such as measurement, control, computation, decision making, and simulation, each task being best performed in a specific hardware or software environment. The focus of this work is a heterogeneous agent-based monitoring and control system, while the aim is to allow the use of interactive and proactive capabilities proper of agents. For this purpose dedicated interfaces between the agents and the measurement, control and simulation environments have been implemented. The presented application is the load management in a limited-power, power electronic system.

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

distributed control
reconfigurable architecture
power electronics


An efficient system for combined route traversal and collision avoidance Here we consider the problem of a robot that must follow a previously designated path outdoors. While the nominal path, a series of closely spaced via points, is provided with an assurance that it will lead to the destination, we can't be guaranteed that it will be obstacle free. We present an efficient system capable of both following the path as well as being perceptive and agile enough to avoid obstacles in its way. We present a system that detects obstacles using laser ranging, as well as a layered system that continuously tracks the path, avoiding obstacles and replanning the route when necessary. The distinction of this system is that compared to the state of the art, it is minimal in sensing and computation while achieving high speeds. In this paper, we present an algorithm that is based on models of obstacle avoidance by humans and show variations of the model to deal with practical considerations. We show how the parameters of this model are automatically learned from observation of human operation and discuss limitations of the model. We then show how these models can be extended by adding online route planning and a formulation that allows for operation at varying speeds. We present experimental results from an autonomous vehicle that has operated several hundred kilometers to validate the methodology.

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

mobile robots
navigation
obstacle detection


Currency crisis forecasting with general regression neural networks The main purpose of this study is to devise a general regression neural network (GRNN)- based currency crisis forecasting model for Southeast Asian economies based upon the disastrous 1997-1998 currency crisis experience. For this some typical indicators of currency exchange rates volatility are first chosen, then these indicators are input into GRNN for training, and finally the trained GRNN is used for future crisis prediction. To verify the effectiveness of the proposed currency crisis forecasting approach, four typical Southeast Asian currencies, Indonesian rupiah, Philippine peso, Singapore dollar and Thai baht, are selected. Meantime we compare its performance with those of other forecasting methods to evaluate the forecasting ability of the proposed approach. Empirical results obtained reveal that the proposed currency crisis forecasting model has a surprisingly high degree of accuracy in judging the currency crisis level of each country in specified time period, implying that our proposed approach can be used as a feasible currency crisis early-warning system to predict currency crisis level for other countries around the world.

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

general regression neural network (grnn)


Broadcast cooperation strategies for two colocated users This work considers the problem of communication between a remote single transmitter and a destined user, with helping colocated users, over an independent block Rayleigh-fading channel. The colocation nature of the users allows cooperation, which increases the overall achievable rate, from transmitter to destination. The transmitter is ignorant of the fading coefficients, while receivers have access to perfect channel state information (CSI). We propose, for this setting, a multilayer broadcast transmission approach. The broadcast approach enables enhanced cooperation between the colocated users. That is due to the nature of broadcasting, where the better the channel quality, the more layers that can reliably be decoded. The cooperation between the users is performed over additive white Gaussian noise (AWGN) channels, with a relaying power constraint, and unlimited bandwidth. Three commonly used cooperation techniques are studied: amplify-and-forward (AF), compress-and-forward (CF), and decode-and-forward (DF). These techniques are extended by using the broadcast approach for the case of relaxed decoding delay constraint. For this case, a separate processing of the layers, which includes multisession cooperation is shown to be beneficial. Further, closed-form expressions for infinitely many AF sessions and recursive expressions for the more complex CF are given. Numerical results for the various cooperation strategies demonstrate how the multisession cooperation outperforms conventional relaying techniques.

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

ad hoc networks
amplify-and-forward (af)
code layering
compress-and-forward (cf)
decode-and-forward (df)
single-user broadcasting


Late work minimization in flow shops by a genetic algorithm The work concerns the permutation flow shop scheduling problem with release times and the late work criterion. The late work criterion estimates the quality of a solution with regard to the duration of the late parts of jobs, not taking into account the quantity of the delay for the fully late activities. Particular jobs consist of a sequence of tasks, which have to be executed in the same order on a set of dedicated machines. The execution of a job has to start after its release time and it should finish preferably before its due date. Since the problem is known to be NP-hard, we propose a genetic algorithm to solve this scheduling case. We describe the components of the method, which is based on an indirect solution representation as a sequence of priority dispatching rules. A sequence of rules is transformed to a schedule by the list scheduling approach. Then, we report results of computational experiments, which were preceded by the tuning process of the genetic algorithm. Tests were performed for randomly generated instances of different difficulty in terms of the distribution of release times and due dates over time, as well as the number of jobs and machines. We analyze the results of computational experiments disclosing a strong influence of the problem data on the efficiency of the proposed meta-heuristic algorithm. (C) 2009 Elsevier Ltd. All rights reserved.

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

shop scheduling
late work criterion
genetic algorithm


Adaptive visual target detection and tracking using weakly supervised incremental appearance learning and RGM-PHD tracker ? A multiple visual target detection and tracking system is proposed. Relative keypoint-based appearance model is proposed for visual targets. Incremental learning method with weak supervision is introduced to update target appearances. The appearance-based detector is proposed in conjunction with background subtraction detector. RGM-PHD tracker is combined with the detectors to keep the trajectories of targets.

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

background subtraction
incremental appearance learning
weak supervision

visual tracking
appearance modeling
appearance-based detection
keypoint descriptors
rgm-phd tracker


Optimal pricing and ordering policies for perishable commodities In the pricing problem considered, a seller must determine the price for several units of a perishable or seasonal product to be sold for a limited period of time. The list price should be posted in advance of the sale and is not negotiable with potential buyers. Any product not sold by the end of the sales period will be disposed at a lower price. Assuming that the customer's demand is represented as a negative binomial distribution, we determine the optimal product price based on the demand rate, buyers' preferences, and length of the sales period. Because the seller's average revenue decreases as the number of items for sale increases, we also consider the optimal-order quantity that maximizes the seller's total expected profit. For the case where the seller can divide the sales period into several short periods, we finally propose a multi-period pricing model.

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

product pricing
price posting
optimal-order quantity
perishable inventory


Absalom: Balancing assembly lines with assignment restrictions Assembly line balancing problems (ALBPs) arise whenever an assembly line is configured, redesigned or adjusted. An ALBP consists of distributing the total workload for manufacturing products among the work stations along the line. On the one hand, research has focussed on developing effective and fast solution methods for exactly solving the simple assembly line balancing problem (SALBP). On the other hand, a number of real-world extensions of SALBP have been introduced but solved with straight-forward and simple heuristics in many cases. Therefore, there is a lack of procedures for exactly solving such generalized ALBP. In this paper, we show how to extend the well-known solution procedure Salome [Scholl, A., Klein, R., 1997. Salome: A bidirectional branch-and-bound procedure for assembly line balancing. Informs J. Comput. 9 319334], which is able to solve even large SALBP instances in a very effective manner, to a problem extension with different types of assignment restrictions (called ARALBP). The extended procedure, referred to as Absalom, employs a favorable branching scheme, an arsenal of bounding rules and a variety of logical tests using ideas from constraint programming. Computational experiments show that Absalom is a very promising exact solution approach although the additional assignment restrictions complicate the problem considerably and necessitate a relaxation of some components of Salome.

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

assembly line balancing
assignment restrictions


the macroscopic lwr model of the transport equation viewed as a distributed parameter system The main aim of this paper is the obtaining of transfer function of the macroscopic traffic flow model using an exact analytical method of solution of the non-linear partial differential equations, presenting the transportation problem model as distributed parameter system. The different analytical methods of solution are shown, some of them giving an exact solution. Using this exact method we obtain directly the plant transfer function for the traffic flow model viewed as a distributed parameter system. The entire physical phenomenon is presenting through the partial differential equations whose show the distribution in vehicles on the high ways. All the research is devoted on the transfer function result because of the control system modeling. In the presenting paper we shown the verification of the analytical result of the model simulation thought the time and frequency characteristics analysis.

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

laplace tranform
green function method
partial differential equation
model performance
analytical solution
automation system
lwr macroscopic traffic flow model
convolution theory
fluid traffic


Organization, Integration, and Assembly of Genetic and Epigenetic Regulatory Machinery in Nuclear Microenvironments There is growing awareness that the fidelity of gene expression necessitates coordination of transcription factor metabolism and organization of genes and regulatory proteins within the three-dimensional context of nuclear architecture. The regulatory machinery that governs genetic and epigenetic control of gene expression is compartmentalized in nuclear microenvironments. Temporal and spatial parameters of regulatory complex organization and assembly are functionally linked to biological control and are compromised with the onset and progression of tumorigenesis. High throughput imaging of cells, tissues, and tumors, including live cell analysis, is expanding research's capabilities toward translating components of nuclear organization into novel strategies for cancer diagnosis and therapy.

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

nuclear microenvironments
epigenetic control
transcription

nuclear matrix
chromatin
runx
proteomics
genomics


Comprehensive QoS analysis of enhanced distributed channel access in wireless local area networks Wireless information networks satisfy the users desirable requirements for mobility and relocation and thus have experienced tremendous growth in recent years. The Enhanced Distributed Channel Access (EDCA) is a promising Medium Access Control (MAC) protocol for provisioning of Quality-of-Service (QoS) in Wireless Local Area Networks (WLANs). This protocol specifies three important QoS schemes including Arbitrary Inter-Frame Space (AIFS), Contention Window (CW) and Transmission Opportunity (TXOP). Analytical models of EDCA reported in the literature have been primarily developed for the AIFS, CW, and TXOP schemes, separately. This paper proposes a comprehensive analytical model to accommodate the integration of these three QoS schemes in WLANs with finite buffer capacity under unsaturated traffic loads. The important QoS performance metrics in terms of throughput, delay, delay jitter, and frame loss probability are derived. The accuracy of the model is validated through extensive simulation experiments. Performance results reveal that the TXOP can support QoS differentiation, improve the system performance significantly and outperform AIFS and CW owing to its unique burst transmission property. Furthermore, the results demonstrate that the buffer size has considerable impact on the QoS of EDCA, highlighting the importance of taking the buffer size into account for design and analysis of MAC protocols.

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

medium access control
qos
transmission opportunity


Stochastic

hyperfine

interactions

modeling

library

The

stochastic

hyperfine

interactions

modeling

library

(SHIML)

provides

a

set

of

routines

to

assist

in

the

development

and

application

of

stochastic

models

of

hyperfine

interactions.

The

library

provides

routines

written

in

the

C

programming

language

that

read

a

text

description

of

a

model

for

fluctuating

hyperfine

fields,

set

up

the

Blume

matrix,

upon

which

the

evolution

operator

of

the

system

depends,

and

find

the

eigenvalues

and

eigenvectors

of

the

Blume

matrix

so

that

theoretical

spectra

of

experimental

techniques

that

measure

hyperfine

interactions

can

be

calculated.

The

optimized

vector

and

matrix

operations

of

the

BLAS

and

LAPACK

libraries

are

utilized;

however,

there

was

a

need

to

develop

supplementary

code

to

find

an

orthonormal

set

of

(left

and

right)

eigenvectors

of

complex,

non-Hermitian

matrices.

In

addition,

example

code

is

provided

to

illustrate

the

use

of

SHIML

to

generate

perturbed

angular

correlation

spectra

for

the

special

case

of

polycrystalline

samples

when

anisotropy

terms

of

higher

order

than

A

can

be

neglected.

Program

title:

SHIML

Catalogue

identifier:

Program

summary

Program

obtainable

from:

CPC

Program

Library,

Queen's

University,

Belfast,

N.

Ireland

Licensing

provisions:

GNU

GPL

No.

of

lines

in

distributed

program,

including

test

data,

etc.:

No.

of

bytes

in

distributed

program,

including

test

data,

etc.:

Distribution

format:

tar.gz

Programming

language:

C

Computer:

Any

Operating

system:

LINUX,

OS

X

RAM:

Varies

Classification:

External

routines:

TAPP

BLAS

a

C-interface

to

BLAS

and

LAPACK

Nature

of

problem:

In

condensed

matter

systems,

hyperfine

methods

such

as

nuclear

magnetic

resonance

(NMR),

Mssbauer

effect

(ME),

muon

spin

rotation

(?SR),

and

perturbed

angular

correlation

spectroscopy

(PAC)

measure

electronic

and

magnetic

structure

within

Angstroms

of

nuclear

probes

through

the

hyperfine

interaction.

When

interactions

fluctuate

at

rates

comparable

to

the

time

scale

of

a

hyperfine

method,

there

is

a

loss

in

signal

coherence,

and

spectra

are

damped.

The

degree

of

damping

can

be

used

to

determine

fluctuation

rates,

provided

that

theoretical

expressions

for

spectra

can

be

derived

for

relevant

physical

models

of

the

fluctuations.

SHIML

provides

routines

to

help

researchers

quickly

develop

code

to

incorporate

stochastic

models

of

fluctuating

hyperfine

interactions

in

calculations

of

hyperfine

spectra.

Solution

method:

Calculations

are

based

on

the

method

for

modeling

stochastic

hyperfine

interactions

for

PAC

by

Winkler

and

Gerdau

The

method

is

extended

to

include

other

hyperfine

methods

following

the

work

of

Dattagupta

The

code

provides

routines

for

reading

model

information

from

text

files,

allowing

researchers

to

develop

new

models

quickly

without

the

need

to

modify

computer

code

for

each

new

model

to

be

considered.

Restrictions:

In

the

present

version

of

the

code,

only

methods

that

measure

the

hyperfine

interaction

on

one

probe

spin

state,

such

as

PAC,

?SR,

and

NMR,

are

supported.

Running

time:

Varies

References:

M.O.

Zacate,

The

adjustable

parameter

package,

Technical

report

CINSAM

Grant

(unpublished);

available

for

download

at

L.S.

Blackford,

et

al.,

ACM

Trans.

Math.

Soft.

J.

Dongarra,

International

Journal

of

High

Performance

Applications

and

Supercomputing

M.

Galassi,

et

al.,

GNU

Scientific

Library

Reference

Manual,

third

edition

available

for

download

at

E.

Anderson,

et

al.,

LAPACK

Users'

Guide,

third

edition,

Society

for

Industrial

and

Applied

Mathematics,

Philadelphia,

H.

Winkler,

E.

Gerdau,

Z.

Phys.

S.

Dattagupta,

Hyperfine

Interactions

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

perturbed angular correlation spectroscopy


Modeling image textures by Gibbs random fields ? Drawbacks of the traditional scenario of image modeling by Gibbs random fields with multiple pairwise pixel interactions are outlined, and a more reasonable alternative scenario based on Controllable Simulated Annealing is described. The latter scenario uses an analytic and stochastic approximation of Gibbs potentials to minimize a distance between the selected gray level co-occurrence or difference histograms for a given training sample and the simulated images.

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

image modeling
stochastic approximation
controllable simulated annealing


OpenMP versus MPI for PDE solvers based on regular sparse numerical operators ? Two parallel programming models represented by OpenMP and MPI are compared for PDE solvers based on regular sparse numerical operators. As a typical representative of such an operator, a finite difference approximation of the Euler equations for fluid flow is considered. The comparison of programming models is made with regard to uniform memory access (UMA), non-uniform memory access (NUMA), and self-optimizing NUMA (NUMA-opt) computer architectures. By NUMA-opt, we mean NUMA systems extended with self-optimization algorithms, in order to reduce the non-uniformity of the memory access time. The main conclusions of the study are: (1) that OpenMP is a viable alternative to MPI on UMA and NUMA-opt architectures; (2) that OpenMP is not competitive on NUMA platforms, unless special care is taken to get an initial data placement that matches the algorithm; (3) that for OpenMP to be competitive in the NUMA-opt case, it is not necessary to extend the OpenMP model with additional data distribution directives, nor to include user-level access to the page migration library.

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


A new intelligent distension system for hollow organs Controlled distension of hollow organs is an accepted technique for generating reproducible visceral stimuli. We have constructed a new, flexible and intelligent distension system in which discomfort, pain and autonomic responses are recorded online. These responses can be fed back into the system in a regulatory loop and be used to shape the distension paradigm. Consequently, it is possible to take all subjects to a state of equal, although subjective, level of discomfort or pain, even though pressure, tension and volume might be totally different. By using a variable airflow, this new distension system can be effectively used in all kinds of paradigms, e.g. phasic, tonic, or ramp distensions or customized combinations of them. The system can be used to control pressure, volume or tension. A refinement of the system is that it is possible to automatically change the controlled entity during a distension, e.g. from an isobaric ramp directly into an isovolumetric tonic phase. Furthermore, the distension device allows double distensions with independent distension paradigms.

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

barostat
visceral distension
visceral perception
visceral sensation


A shift of mind - Introducing a concept creation model The ability to construct concepts is indispensable to both individual and evolutionary development. Our model involves the use of ambiguous stimuli to facilitate decision-making by promoting analogical reasoning. Toward this end, we have developed Web-based exercises in word categorization for the purpose of engaging participants in analogical reasoning that contributes to the integration of words and leads to the construction of new concepts. 12 graduate students and 20 junior high school students were presented with ambiguous information for the purpose of comparison between the senior and the junior students. We hypothesized that the senior students tend to behave with more insight rather than junior students with less activation of thought process. Our results suggested that the presentation of the ambiguous stimuli were associated with unique thought processes, which are consistent with approaches to word categorization that reflect either the experience of insight or the operation of a trial and error strategy, depending on the junior or the senior students. We showed that the senior students tend to be more like insight into categorization design, while the junior as rather try and error behavior, in consideration of needed time and actions in analogical thinking. (C) 2008 Elsevier Inc. All rights reserved.

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


The Australian general public's perceptions of having a personally controlled electronic health record (PCEHR) The study examines people's lack of take-up of an e-PHR system in its first year. Value, usefulness and compatibility are low suggesting ambivalence about the initiative. This ambivalence is not strongly affected by risk, trust or privacy concerns. Respondents do not see themselves as lacking in web-skills to set up their record. More research on people's beliefs about having e-PHRs is needed for critical mass.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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
e-service
technology acceptance
personal
attitude
australia


Android\(^\mathrm{TM}\) development and performance analysis The advent of emergent systems on chip and MPSocs opens a new era in the small mobile devices (Smartphones, Tablets,...) in terms of computing capabilities and applications to be addressed. Currently, these devices have multicore processors and GPUs which provide high computational power. The efficient use of such devices, including the parallel power, is still a challenge for general-purpose programmers. In the last years Android has become the dominant platform in the small mobile devices. In addition, it has a large community of developers. For application development, Android provides two development kits, the Software Development Kit and Native Development Kit. To exploit the high computational capabilities on current devices, Android provides Renderscript, an API that allows the execution of parallel applications and it is designed to be used in applications that require high computing power. The development model used involves an important impact in the performance of the applications. In this paper, we address the evaluation of the performance on Android platforms. A set of benchmark applications has been implemented to evaluate the performance of the different development models. Sequential and parallel versions of the different development kits are considered in the computational experience. This benchmark and the computational experience achieved are greatly helpful to the programmer for understanding sources of overhead and bottlenecks in the developed code.

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