a framework for refining similarity queries using learning techniques In numerous applications that deal with similarity search, a user may not have an exact idea of his information need and/or may not be able to construct a query that exactly captures his notion of similarity. A promising approach to mitigate this problem is to enable the user to submit a rough approximation of the desired query and use the feedback on the relevance of the retrieved objects to refine the query. In this paper, we explore such a refinement strategy for a general class of SQL similarity queries. Our approach casts the refinement problem as that of learning concepts using examples. This is achieved by viewing the tuples on which a user provides feedback as a labeled training set for a learner. Under this setup, SQL query refinement consists of two learning tasks, namely learning the structure of the SQL query and learning the relative importance of the query components. The paper develops appropriate machine learning approaches suitable for these two learning tasks. The primary contribution of the paper is a general refinement framework that decides when each learner is invoked in order to quickly learn the user query. Experimental analyses over many real life datasets and queries show that our strategy outperforms the existing approaches significantly in terms of retrieval accuracy and query simplicity.

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


Recognizing splicing languages: Syntactic monoids and simultaneous pumping We use syntactic monoid methods, together with an enhanced pumping lemma, to investigate the structure of splicing languages. We obtain an algorithm for deciding whether a regular language is a reflexive splicing language, but the general question remains open.

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

splicing systems
reflexive splicing languages
dna splicing


Fast and Efficient Second-Order Method for Training Radial Basis Function Networks This paper proposes an improved second order (ISO) algorithm for training radial basis function (RBF) networks. Besides the traditional parameters, including centers, widths and output weights, the input weights on the connections between input layer and hidden layer are also adjusted during the training process. More accurate results can be obtained by increasing variable dimensions. Initial centers are chosen from training patterns and other parameters are generated randomly in limited range. Taking the advantages of fast convergence and powerful search ability of second order algorithms, the proposed ISO algorithm can normally reach smaller training/testing error with much less number of RBF units. During the computation process, quasi Hessian matrix and gradient vector are accumulated as the sum of related sub matrices and vectors, respectively. Only one Jacobian row is stored and used for multiplication, instead of the entire Jacobian matrix storage and multiplication. Memory reduction benefits the computation speed and allows the training of problems with basically unlimited number of patterns. Several practical discrete and continuous classification problems are applied to test the properties of the proposed ISO training algorithm.

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

levenberg-marquardt algorithm
second order algorithm


Regional-scale bed roughness beneath ice masses: measurement and analysis We outline a method of assessing the roughness of the bed beneath ice-masses, applicable to data collected in a wide variety of (glaciated) environments. Roughness at scales >102m in particular is poorly constrained and understood in glaciated systems, and regional geophysical surveys collected over the past 30 years are ideally suited to addressing this issue. We demonstrate the technique using a radio-echo sounding data set collected during the 1970s, showing that regional characterization of roughness over a wide range of wavelengths (1 to >40km) is possible using Fast Fourier Transforms, even with quite coarse horizontal sampling. Coarse sampling captures all of the variation of higher resolution analyses and the technique appears robust up to the limit imposed by the Nyquist frequency.

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


permutation groups in nc We show that the basic problems of permutation group manipulation admit efficient parallel solutions. Given a permutation group G by a list of generators, we find a set of NC-efficient strong generators in NC. Using this, we show, that the following problems are in NC: membership in G; determining the order of G; finding the center of G; finding a composition series of G along with permutation representations of each composition factor. Moreover, given G, we are able to find the pointwise stabilizer of a set in NC. One consequence is that isomorphism of graphs with bounded multiplicity of eigenvalues is in NC. The analysis of the algorithms depends, in several ways, on consequences of the classification of finite simple groups.

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

order manipulation group factor permutation analysis parallel classification


Responsive in-season nitrogen management for cereals Current nitrogen (N) management strategies for worldwide cereal production systems are characterized by low N use efficiency (NUE), environmental contamination, and considerable ongoing debate regarding what can be done to improve N fertilizer management. Development of innovative strategies that improve NUE and minimize off-field losses is crucial to sustaining cereal-based farming. In this paper, we review the major managerial causes for low NUE, including (1) poor synchrony between fertilizer N and crop demand, (2) uniform field applications to spatially variable landscapes that commonly vary in crop N need, and (3) failure to account for temporally variable influences on crop N needs. Poor synchronization is mainly due to large pre-plant applications of fertilizer N, resulting in high levels of inorganic soil N long before rapid crop uptake occurs. Uniform applications within fields discount the fact that N supplies from the soil, crop N uptake, and crop response are spatially variable. Current N management decisions also overlook year-to-year weather variations and sometimes fail to account for soil N mineralized in warm, wet years, ignoring indigenous N supply. The key to optimizing tradeoffs amongst yield, profit, and environmental protection is to achieve synchrony between N supply and crop demand, while accounting for spatial and temporal variability in soil N. While some have advocated a soil-based management zones (MZ) approach as a means to direct variable N applications and improve NUE, this method disregards yearly variation in weather. Thus, it seems unlikely that the soil-based MZ concept alone will be adequate for variable application of crop N inputs. Alternatively, we propose utilizing emerging computer and electronic technologies that focus on the plant to assess N status and direct in-season spatially variable N applications. Several of these technologies are reviewed and discussed. One technology showing promise is ground-based active-light reflectance measurements converted to NDVI or other similar indices. Preliminary research shows this approach addresses the issue of spatial variability and is accomplished at a time within the growing season so that N inputs are synchronized to match crop N uptake. We suggest this approach may be improved by first delineating a field into MZ using soil or other field properties to modify the decision associated with ground-based reflectance sensing. While additional adaptive research is needed to refine these newer technologies and subsequent N management decisions, preliminary results are encouraging. We expect N use efficiency can be greatly enhanced using this plant-based responsive strategy for N management in cereals. (C) 2007 Elsevier B.V. All rights reserved.

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

nutrient management
remote sensing
geospatial technology
canopy sensors


Linear logic by levels and bounded time complexity We give a new characterization of elementary and deterministic polynomial time computation in linear logic through the proofs-as-programs correspondence. Girard's seminal results, concerning elementary and light linear logic, achieve this characterization by enforcing a stratification principle on proofs, using the notion of depth in proof nets. Here, we propose a more general form of stratification, based on inducing levels in proof nets by means of indices, which allows us to extend Girard's systems while keeping the same complexity properties. In particular, it turns out that Girard's systems can be recovered by forcing depth and level to coincide. A consequence of the higher flexibility of levels with respect to depth is the absence of boxes for handling the paragraph modality. We use this fact to propose a variant of our polytime system in which the paragraph modality is only allowed on atoms, and which may thus serve as a basis for developing lambda-calculus type assignment systems with more efficient typing algorithms than existing ones. (C) 2009 Elsevier B.V. All rights reserved.

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

implicit computational complexity
light linear logics
type systems for polynomial time


Generalizations of Milne's U(n+1)q-binomial theorems In this paper, we use the generalized Andrews-Askey integral and Milne's U(n + 1)q-binomial theorems to derive some multiple extensions of the q-binomial identities. (C) 2009 Elsevier Ltd. All rights reserved.

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

milne's u(n+1) refinement of the q-binomial theorems


Sample size and power calculations in repeated measurement analysis Controlled clinical trials in neuropsychopharmacology, as in numerous other clinical research domains, tend to employ a conventional parallel-groups design with repeated measurements. The hypothesis of primary interest in the relatively short-term, double-blind trials, concerns the difference between patterns or magnitudes of change from baseline. A simple two-stage approach to the analysis of such data involves calculation of an index or coefficient of change in stage 1 and testing the significance of difference between group means on the derived measure of change in stage 2. This article has the aim of introducing formulas and a computer program for sample size and/or power calculations for such two-stage analyses involving each of three definitions of change, with or without baseline scores entered as a covariate, in the presence of homogeneous or heterogeneous (autoregressive) patterns of correlation among the repeated measurements. Empirical adjustments of sample size for the projected dropout rates are also provided in the computer program.

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

repeated measures
sample size estimate
power calculation
dropouts


An efficient scheduling scheme for hybrid TDMA and SDMA systems with smart antennas in WLANs Smart antennas are an emerging technology that exploits spatial diversity and allows an access point (AP) to simultaneously transmit downlink packets to multiple stations (STAs). In this paper, we propose a new AP scheduling scheme for hybrid TDMA (Time Division Multiple Access) and SDMA (Spatial Division Multiple Access). Our scheduling scheme aims at maximizing the system throughput while maintaining the fairness among STAs and guaranteeing Quality of Service of different traffic classes. The original contributions of our scheduling scheme include: (1) We propose a transmission framework that allows TDMA STAs to transmit in the TDMA fashion, and non-TDMA STAs to compete channel access in the CSMA/CA fashion. (2) We analyze the performance of CSMA/CA STAs and determine the optimal contention window size for each STA to minimize the collision rate subject to the contention period constraint. (3) We propose an analysis to determine the minimal length of time allocated to non-TDMA STAs during a transmission period such that each STA will have a success transmission probability above a specified threshold in each period. (4) We propose a scheduling algorithm that schedules simultaneous packet transmission to multiple STAs such that maximal number of packets can be transmitted to multiple STAs without causing unacceptable interference.

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

spatial division multiple access (sdma)
time division multiple access (tdma)
transmission scheduling
resource allocation
algorithmic approach


recommender systems at the long tail Recommender systems form the core of e-commerce systems. In this paper we take a top-down view of recommender systems and identify challenges, opportunities, and approaches in building recommender systems for a marketplace platform. We use eBay as an example where the elaborate interaction offers a number opportunities for creative recommendations. However, eBay also poses complexities resulting from high sparsity of relationships. Our discussion can be generalized beyond eBay to other marketplaces.

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


A transactional object calculus A transaction defines a locus of computation that satisfies important concurrency and failure properties. These so-called ACID properties provide strong serialization guarantees that allow us to reason about concurrent and distributed programs in terms of higher-level units of computation (e.g., transactions) rather than lower-level data structures (e.g., mutual-exclusion locks). This paper presents a framework for specifying the semantics of a transactional facility integrated within a host programming language. The TFJ calculus, an object calculus derived from Featherweight Java, supports nested and multi-threaded transactions. We give a semantics to THJ that is parametrized by the definition of the transactional mechanism that permits the study of different transaction models. We give two instantiations: one that defines transactions in terms of a versioning-based optimistic concurrency model, and the other which specifies transactions in terms of a pessimistic two-phase locking protocol, and present soundness and serializability properties for our semantics. (c) 2005 Elsevier 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 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 I O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B 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

transactions
object calculus
optimistic concurrency


Image steganalysis using a bee colony based feature selection algorithm Feature selection is one of the most significant phases of pre-analysis processing, which can influence the performance of steganalysis. In this paper, we have proposed a new feature-based blind steganalysis method for detecting stego images from the cover images in JPEG images using a feature selection technique based on artificial bee colony (IFAB). Most usual techniques for feature selection are wrapper methods and filter methods which IFAB is one of the wrapper based feature selection methods. Artificial bee colony (ABC) algorithm is inspired by honey bees' social behavior in their search for perfect food sources. However, in the suggested algorithm, classifier performance and the dimension of the selected feature vector are dependent on heuristic information for ABC. As a result, we can choose the adaptive feature subset with respect to the shortest feature dimension and the improved performance of the classifier. The experimental results show that the proposed approach is easy to be employed for steganalysis purposes. Moreover, since IFAB is used as one of wrapper methods, as a result, its overall performance is better than several recent and well-known feature selection methods.

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

artificial bee colony (abc)
swarm intelligent


A three-stage analysis of IDS for critical infrastructures We analyze the special requirements and constraints of critical control systems. We determine the requirements imposed to IDS solutions by critical environments. We establish satisficing techniques that help the IDS fulfill the requirements. We identify useful metrics to help quantify the suitability of the IDS for the CCS. This analysis is done inspired on the NFR Framework and the GQM Approach.

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

control systems
critical infrastructures
requirements
satisficing techniques
metrics


A novel Cartesian cut cell solver for incompressible viscous flow in irregular domains A Cartesian cut cell solver with solution-based adaptive mesh refinement is developed for simulating viscous, incompressible flows with arbitrary complex geometries. The cut cells are automatically generated using Volume CAD (VCAD), a framework for storing geometric and material attribute data. Unlike earlier cut cell methods, this solver organizes the cutting patterns into only six categories and further subdivides the resulting pentagon into two quadrilaterals, such that mesh data can be stored by uniform data structure and the post-processing of flow data can be handled conveniently. A novel method is proposed to treat minuscule cut cells without the process of cell merging. A collocated finite volume method, which can be used even when multiple cell shapes and orthogonal and non-orthogonal grids exist in the decomposition, is employed to discretize the Navier-Stokes equations. A modified SIMPLE-based smoothing pressure correction scheme is applied in this cut cell method to suppress checkerboard pressure oscillations caused by collocated arrangement. The solver is first used to simulate a channel flow to demonstrate its calculation accuracy expressed with L-1 and L-infinity norm errors and then the method is utilized to solve three benchmark problems of flow and heat transfer within irregular domains to verify its feasibility, efficiency, accuracy and potential in engineering applications. Copyright (C) 2010 John Wiley & Sons, Ltd.

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

vcad
cartesian cut cell
smoothing pressure correction scheme


The symmetric group defies strong Fourier sampling The dramatic exponential speedups of quantum algorithms over their best existing classical counterparts were ushered in by the technique of Fourier sampling, introduced by Bernstein and Vazirani and developed by Simon and Shor into an approach to the hidden subgroup problem. This approach has proved successful for abelian groups, leading to efficient algorithms for factoring, extracting discrete logarithms, and other number-theoretic problems. We show, however, that this method cannot resolve the hidden subgroup problem in the symmetric groups, even in the weakest, information-theoretic sense. In particular, we show that the Graph Isomorphism problem cannot be solved by this approach. Our work implies that any quantum approach based upon the measurement of coset states must depart from the original framework by using entangled measurements on multiple coset states.

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

hidden subgroup problem
graph isomorphism
fourier sampling


Level set-based topology optimization for 2D heat conduction problems using BEM with objective function defined on design-dependent boundary with heat transfer boundary condition This paper proposes an optimum design method for two-dimensional heat conduction problem with heat transfer boundary condition based on the boundary element method (BEM) and the topology optimization method. The level set method is used to represent the structural boundaries and the boundary mesh is generated based on iso-surface of the level set function. A major novel aspect of this paper is that the governing equation is solved without ersatz material approach and approximated heat convection boundary condition by using the mesh generation. Additionally, the objective functional is defined also on the design boundaries. First, the topology optimization method and the level set method are briefly discussed. Using the level set based boundary expression, the topology optimization problem for the heat transfer problem with heat transfer boundary condition is formulated. Next, the topological derivative of the objective functional is derived. Finally, several numerical examples are provided to confirm the validity of the derived topological derivative and the proposed optimum design method.

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

level set method
topology optimization
heat transfer problem
boundary element method
topological derivative


a qos-aware end-to-end connectivity management algorithm for mobile applications In a dynamic heterogeneous environment, such as pervasive and ubiquitous computing, context-aware adaptation is a key concept to meet the varying requirements of different users. Context-awareness is the most promising way to manage the user information and to provide the means of communication at the right time in the right way. Connectivity and quality of service (QoS) of applications are two most important considerations that should be taken into account for designing a context-aware system. This paper presents connectivity from the view point of context awareness, identifies various relevant raw connectivity contexts, and discusses how high-level context information can be abstracted from the raw context information. It also presents a QoS-and context-aware algorithm for supporting mobile applications in a heterogeneous network environment. The unified approach towards connectivity information and QoS-awareness makes the algorithm more practical than most of the currently existing algorithms which consider connectivity and QoS separately. Simulation results show that the use of context information helps to improve the delivered application QoS.

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

heterogeneous network
connectivity management
context awareness


Consultation of medical narratives in the electronic medical record This article presents an overview of a research project concerning the consultation of medical narratives in the electronic medical record (EMR). It describes an analysis of user needs, the design and implementation of a prototype EMR system, and the evaluation of the ease of consultation of medical narratives when using this system. In a questionnaire survey, 85 hospital physicians judged the quality of their paper-based medical record with respect to data entry, information retrieval and some other aspects. Participants were more positive a bout the paper medical record than the literature suggests. They wished to maintain the flexibility of data entry but indicated the need to improve the retrieval of information. A prototype EMR system was developed to facilitate the consultation of medical narratives. These parts were divided into labeled segments that could be arranged source-oriented and problem-oriented. This system was used to evaluate the ease of information retrieval of 24 internists and 12 residents at a teaching hospital when using free-text medical narratives divided at different levels of detail. They solved, without time pressure, some predefined problems concerning three voluminous, inpatient case records. The participants were randomly allocated to a sequence that was balanced by patient case and learning effect. The division of medical narratives affected speed, but not completeness of information retrieval. Progress notes divided into problem-related segments could be consulted 22% faster than when undivided. Medical history and physical examination divided into segments at organ-system level could be consulted 13% faster than when divided into separate questions and observations. These differences were statistically significant. The fastest divisions were also appreciated as the best combination of easy searching and best insight in the patient case. The results of our evaluation study suggest a trade-off between searching and reading: too much detailed segments will delay the consultation of medical narratives. Validation of the results in daily practice is recommended.

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

electronic medical record
medical narratives
information retrieval
user needs


Pro-Apoptotic and Anti-Apoptotic Molecules Affecting Pathways of Signal Transduction Selective inhibition of the false proliferative signals via targeting tyrosine kinases resulting in the induction of apoptosis by depletion of the survival factors is one of the most studied and widely accepted concepts of modern chemotherapy. We have synthesized a series of potent tyrosine kinase inhibitors and tested these compounds for apoptosis induction. Some of the tyrosine kinase inhibitors caused either apoptotic or cytoplasmic vacuolar cell death in various tumor cell cultures. The somatostatin analogue oligopeptide TT-232, which indirectly inhibits tyrosine kinases, exerted a dose-dependent apoptosis-inducing effect. The tumor growth-inhibitory effect of TT-232 and some tyrosine kinase inhibitors has also been proven by in vivo experiments, using human tumor xenografts. On the other hand, a dose-dependent pro- or anti-apoptotic activity of (?)-deprenyl has been shown in melanoma cell cultures, the lower doses inhibiting and the higher doses inducing apoptosis. Various metabolites of (?)-deprenyl are responsible for these actions. The effect of (?)-deprenyl is connected with depolarization of mitochondrial membranes. The kinase inhibitors act on the growth factor receptor signaling pathways (survival factor pathways) and initiate the caspase cascade. The key enzyme for the action of both pro-apoptotic and anti-apoptotic compounds is caspase 3.

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


Habituation to the side effects of immersion in a virtual environment When people are exposed to movement within a virtual environment, they experience symptoms, such as nausea, which are similar to those of motion sickness. True motion sickness is reduced or eliminated by repeated exposure to motion, and we examined whether people also habituate to the visual appearance of motion. Nineteen subjects used a non-tracked Head-Mounted Display (a personal display system) to view the game Wipeout for 20min on five consecutive days. On average, they reported significantly less nausea and a delayed nausea onset on the fifth day compared with that reported on the first day. Thus, we conclude that habituation did occur.

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


value benefit analysis of technologies for ubiquitous computing to be implemented in the healthcare sector The tasks and objectives of automatic identification (Auto-ID) are to provide information on goods and products. It has already been established for years in the areas of logistics and trading and can no longer be ignored by the German healthcare sector. Some German hospitals have already discovered the capabilities of Auto-ID. Improvements in quality, safety and reductions in risk, cost and time are aspects and areas where improvements are achievable. Privacy protection, legal restraints, and the personal rights of patients and staff members are just a few aspects which make the heath care sector a sensible field for the implementation of Auto-ID. Auto-ID in this context contains the different technologies, methods and products for the registration, provision and storage of relevant data. With the help of a quantifiable and science-based evaluation, an answer is sought as to which Auto-ID has the highest capability to be implemented in healthcare business.

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


Segmentation with area constraints Image segmentation approaches typically incorporate weak regularity conditions such as boundary length or curvature terms, or use shape information. High-level information such as a desired area or volume, or a particular topology are only implicitly specified. In this paper we develop a segmentation method with explicit bounds on the segmented area. Area constraints allow for the soft selection of meaningful solutions, and can counteract the shrinking bias of length-based regularization. We analyze the intrinsic problems of convex relaxations proposed in the literature for segmentation with size constraints. Hence, we formulate the area-constrained segmentation task as a mixed integer program, propose a branch and bound method for exact minimization, and use convex relaxations to obtain the required lower energy bounds on candidate solutions. We also provide a numerical scheme to solve the convex subproblems. We demonstrate the method for segmentations of vesicles from electron tomography images.

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

alternating direction method of multipliers


Knowledge based quality system in support of space shuttle operations In an attempt to use statistical variable data for process improvement at Kennedy Space Center (KSC), statistical quality control is being introduced in the shop floor for use by technicians and engineers. An Expert System is proposed to support this effort. The system has a component for process improvement, which uses a process capability index to suggest continuos process improvement to reduce cost and duration of the process.

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

statistical process control
continuous improvement


TMBETADISC-RBF: Discrimination of ? -barrel membrane proteins using RBF networks and PSSM profiles Discriminating outer membrane proteins (OMPs) from other folding types of globular and membrane proteins is an important task both for identifying OMPs from genomic sequences and for the successful prediction of their secondary and tertiary structures. We have developed a method based on radial basis function networks and position specific scoring matrix (PSSM) profiles generated by PSI-BLAST and non-redundant protein database. Our approach with PSSM profiles has correctly predicted the OMPs with a cross-validated accuracy of 96.4% in a set of 1251 proteins, which contain 206 OMPs, 667 globular proteins and 378 ? -helical inner membrane proteins. Furthermore, we applied our method on a dataset containing 114 OMPs, 187 TMH proteins and 195 globular proteins obtained with less than 20% sequence identity and obtained the cross-validated accuracy of 95%. This accuracy of discriminating OMPs is higher than other methods in the literature and our method could be used as an effective tool for dissecting OMPs from genomic sequences. We have developed a prediction server, TMBETADISC-RBF, which is available at http://rbf.bioinfo.tw/~sachen/OMP.html.

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


Plane cracks with frictionally constrained surfaces This paper examines the class of problems dealing with the mechanics of planar cracks that are subjected to incremental loading and where the surfaces of the crack exhibit a non-linear constraint over a finite region. Since the effects of the non-linearity are restricted to pre-defined surfaces, the boundary element technique can be applied quite successfully to determine the influence of such non-linearity on the development of stress intensity factors at the crack tip. In particular, attention is focussed on the evaluation of the stress intensity factors for plane crack with a non-linear surface constraint, which is subjected in turn to an isotropic compressive stress field followed by an incremental uniaxial loading in either tension or compression.

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

boundary elements
contact mechanics
coulomb friction
frictional contact in cracks
incremental analysis of cracks
incremental plasticity
interface degradation


MuscleBuilder: A modeling tool for human anatomy A traditional multi-layered approach is adopted to human body modeling and deformation. The model is split into three general anatomical structures: the skeleton, musculature and skin. It is shown that each of these layers is modeled and deformed by using fast, procedural, ad-hoc methods that can painlessly be reimplemented. The modeling approach is generic enough to handle muscles of varying shape, size and characteristics and does not break in extreme skeleton poses. It is also described that the integrated MuscleBuilder system whose main features are: i) easy and quick creation of muscle deformation models; ii) automatic deformation of an overlying skin. It is shown that visually realistic results can be obtained at interactive frame rates with very little input from the designer.

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

human modeling
anatomically-based modeling


A methodology for the semi-automatic creation of data-driven detailed business ontologies In the context of technological expansion and development, companies feel the need to renew and optimize their information systems as they search for the best way to manage knowledge. Business ontologies within the semantic web are an excellent tool for managing knowledge within this space. The proposal in this article consists of a methodology for integrating information in companies. The application of this methodology results in the creation of a specific business ontology capable of semantic interoperability. The resulting ontology, developed from the information system of specific companies, represents the fundamental business concepts, thus making it a highly appropriate information integration tool. Its level of semantic expressivity improves on that of its own sources, and its solidity and consistency are guaranteed by means of checking by current reasoning tools. An ontology created in this way could drive the renewal processes of companies information systems. A comparison is also made with a number of well-known business ontologies, and similarities and differences are drawn, highlighting the difficulty in aligning general ontologies to specific ones, such as the one we present.

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

e-business
knowledge integration
enterprise ontologies
ecommerce
semantic of integration information
semantic of data integration


similarity matrix compression for efficient signature quadratic form distance computation Determining similarities among multimedia objects is a fundamental task in many content-based retrieval, analysis, mining, and exploration applications. Among state-of-the-art similarity measures, the Signature Quadratic Form Distance has shown good applicability and high quality in comparing flexible feature representations. In order to improve the efficiency of the Signature Quadratic Form Distance, we propose the similarity matrix compression approach which aims at compressing the distance's inherent similarity matrix. We theoretically show how to reduce the complexity of distance computations and benchmark computation time improvements. As a result, we improve the efficiency of a single distance computation by a factor up to 9.

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

similarity matrix compression
signature quadratic form distance

content-based multimedia retrieval
efficient query processing
similarity search


towards ide support for abstract thinking Abstract thinking is considered to be a high level cognitive skill that enables a comprehensive understanding of a specific concept or a problem using different levels of detailing. Based on a lab activity we conducted on the matter of abstraction, we present guidelines for enabling an Integrated Development Environment (IDE) to promote abstract thinking. The guidelines are defined in the context of an Aspect-Oriented Process Support (AOPS) framework that aims at customizing IDEs to automatically support various software development practices. Specifically, we suggest two kinds of guidelines. The first is concerned with a positive feedback from the IDE in cases where abstraction is used. The second kind is concerned with cases in which the developer is encouraged to move to a different level of detailing, that is, promoted to use abstract thinking.

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


A hierarchical algorithm for the planar single-facility location routing problem Location routing problem (LRP) is an important logistical problem that comprises two of the main logistical drivers namely facility location and vehicle routing. In this paper, we focus on the planar single-facility LRP with Euclidean distance where the location of the facility can be anywhere in the space and not restricted to a given set of potential sites only as in the discrete case. A hierarchical heuristic-based method is put forward which continuously takes into account the information from the routing results while systematically improving the location using the end-points of the obtained routes. In addition, some enhancement schemes that include a set of local searches as well as diversification and intensification mechanisms are also incorporated into the search. The proposed method outperformed the existing approaches when tested on the data sets taken from the literature. Our approach produced nine new best results out of the fifteen in the literature besides being relatively robust when compared to the existing methods.

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


Symplectic Partitioned Runge-Kutta methods with minimal phase-lag Symplectic Partitioned Runge-Kutta (SPRK) methods with minimal phase-lag are derived. Specifically two new symplectic methods are constructed of second and third order with fifth phase-lag order. The methods are tested on the numerical integration of Hamiltonian problems and the Schrodinger equation. (C) 2010 Elsevier B.V. All rights reserved.

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

methods
hamiltonian problems
schrodinger equation

symplectic partitioned runge-kutta
phase-lag


Progressive transmission of images using MAP detection over channels with memory We propose a new maximum a posteriori (MAP) detector, without the need for explicit channel coding, to lessen the impact of communication channel errors an compressed image sources, The MAP detector exploits the spatial correlation in the compressed bitstream as well as the temporal memory in the channel to correct channel errors, We first present a technique for computing the residual redundancy inherent in a Compressed grayscale image (compressed using VQ). The performance of the proposed MAP detector is compared to that of: a memoryless MAP detector. We also investigate the dependence of the performance on memory characteristics of the Gilbert-Elliott channel as well as average Channel error rate. Finally, we study the robustness of the proposed MAP detector's performance to estimation errors.

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

channels with memory
map detection
residual redundancy

non-causal source modeling
vector quantization
viterbi algorithm


An Anonymous Password-Authenticated and Key Exchange Protocol for Roaming Services in Wireless Networks Due to the convenient capability of roaming, wireless communication has been widely used in our life with no limits of geography and space. To achieve privacy and authentication simultaneously, many anonymous authentication and key exchange protocols have been proposed for roaming services. In this paper, we propose an efficient and secure password-authenticated and key exchange protocol. Our proposal provides user anonymity and untraceability,. confidentiality and fairness of session key, mutual authentication between parties and perfect forward secrecy while preventing conventional attacks. Besides, it reduces the computation cost and communication load for parties, especially the home agent, which suffices to the requirements of multiple services request concurrently. Compared with related protocols, it is more suitable and practical for roaming services in wireless environments.

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

anonymity
untraceability
authentication
key exchange
roaming services


Restorative Justice for Sexual Violence Problems in criminal justice system response to date and acquaintance rape, and the nonpenetration sexual offenses are identified

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


Discrete sets with minimal moment of inertia We analyze the moment of inertia I(S), relative to the center of gravity, of finite plane lattice sets S. We classify these sets according to their roundness: a set S is rounder than a set T if I(S) < I(T). We introduce the notion of quasi-discs and show that roundest sets are strongly-convex quasi-discs in the discrete sense. We use weakly unimodal partitions and an inequality for the radius to make a table of roundest discrete sets up to size 40. Surprisingly, it turns out that the radius of the smallest disc containing a roundest discrete set S is not necessarily the radius of S as a quasi-disc. Crown Copyright (c) 2008 Published by Elsevier B.V. All rights reserved.

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


Dynamic Aurora Sequence Recognition Using Volume Local Directional Pattern with local and global features Aurora event consists of the spatial structure and temporal evolution of aurora luminosity, which attributes to the effects of the solar wind-magnetosphere interaction and the physics of the magnetosphere-ionosphere interaction. Dynamic Aurora event provides a meaningful projection of effects from plasma processes of outer space and also reveals some certain physical phenomenon and principle. Aurora sequence recognition is one of the key procedure in the analysis of dynamic aurora event. Lots of effective features for static aurora image classification are proposed. If these features for static image classification are utilized to recognize the dynamic aurora sequence, it will result in higher computational complexity. The dynamic features of aurora sequence are seldom proposed due to its complexity. To this end, this paper proposes an efficient aurora sequence descriptor which combines local and global spatial information with temporal location information, which is called as Volume Local Directional Patterns. The ring-section spatial pyramid partition structure is used in the VLDP code image which is coded by Volume Local Directional Patterns to obtain the local spatial feature. After combining the global feature of VLDP code image, the final RSPLDP feature is obtained. Finally, the STSC (self-tuning spectral clustering) method is used to classify the aurora sequence. The experimental results on the dataset which is captured from All-sky Imager (ASI) at the Chinese Yellow River Station demonstrate the effectiveness of the proposed classification scheme.

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

aurora sequence
volume local directional patterns
temporal location information
local spatial feature


adapting a fault prediction model to allow inter languagereuse An important step in predicting error prone modules in a project is to construct the prediction model by using training data of that project, but the resulting prediction model depends on the training data. Therefore it is difficult to apply the model to other projects. The training data consists of metrics data and bug data, and these data should be prepared for each project. Metrics data can be computed by using metric tools, but it is not so easy to collect bug data. In this paper, we try to reuse the generated prediction model. By using the metrics and bug data which are computed from C++ and Java projects, we have evaluated the possibility of applying the prediction model, which is generated based on one project, to other projects, and have proposed compensation techniques for applying to other projects. We showed the evaluation result based on open source projects.

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


Measure Solutions for Some Models in Population Dynamics We give a direct proof of well-posedness of solutions to general selection-mutation and structured population models with measures as initial data. This is motivated by the fact that some stationary states of these models are measures and not L 1 functions, so the measures are a more natural space to study their dynamics. Our techniques are based on distances between measures appearing in optimal transport and common arguments involving Picard iterations. These tools provide a simplification of previous approaches and are applicable or adaptable to a wide variety of models in population dynamics.

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


REPAIR SHOP JOB SCHEDULING WITH PARALLEL OPERATORS AND MULTIPLE CONSTRAINTS USING SIMULATED ANNEALING Scheduling problems are generally treated as NP - complete combinatorial optimization problems which is a multi-objective and multi constraint one. Repair shop Job sequencing and operator allocation is one such NP - complete problem. For such problems, an efficient technique is required that explores a wide range of solution space. This paper deals with Simulated Annealing Technique, a Meta - heuristic to solve the complex Car Sequencing and Operator Allocation problem in a car repair shop. The algorithm is tested with several constraint settings and the solution quality exceeds the results reported in the literature with high convergence speed and accuracy. This algorithm could be considered as quite effective while other heuristic routine fails.

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

car sequencing
simulated annealing technique
repair shop
optimization
operator allocation


Riesz ideals in generalized pseudo effect algebras and in their unitizations We prove that there is an order isomorphism between the lattice of all normal Riesz ideals and the lattice of all Riesz congruences in upwards directed generalized pseudoeffect algebras (or GPEAs, for short). We give a sufficient and necessary condition under which a normal Riesz ideal I of a weak commutative generalized pseudoeffect algebra P is a normal Riesz ideal also in the unitization \(\widehat{P}\) of P. These results extend those obtained recently by Avalllone, Vitolo, Pulmannov and Vincekov for effect algebras. At the same time, we give the conditions under which the quotient of a generalized pseudoeffect algebra P is a generalized effect algebra and linearly ordered generalized pseudoeffect algebra.

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

generalized pseudoeffect algebra
normal riesz ideal


Evolvable concurrent processes This paper presents a formal model of concurrent processes whose functions can be modified from the environments during execution. In many applications, it takes too much cost to stop the whole of the concurrent system working in distributed environments to update its components. Features of dynamic evolution that make it possible to modify functions of processes without termination are important. In this paper, a formal model of evolvable concurrent processes is presented using logical formulas of linear logic. The operational semantics is defined using a formal proof in a fragment of the sequent calculus of linear logic. A method for replacing the continuations of working processes by applications of inference rules of linear logic is presented.

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

concurrent processes
linear logic
dynamic evolution


Three-step estimation of latent Markov models with covariates A three-step approach is proposed to estimate latent Markov (LM) models for longitudinal data with and without covariates. The approach is based on a preliminary clustering of sample units on the basis of time-specific responses only, and is particularly useful when a large number of response variables are observed at each time occasion. In such a context, full maximum likelihood estimation, which is typically based on the ExpectationMaximization algorithm, may have some drawbacks, essentially due to the presence of many local maxima of the model likelihood. Moreover, this algorithm may be particularly slow to converge, and may become unstable with complex LM models. The properties of the proposed estimator are illustrated theoretically and by a simulation study in which this estimator is compared with the full likelihood estimator. How reliable standard errors for the three-step parameter estimates are obtained is also shown. The approach is applied to the analysis of a dataset about the health status of elderly people resident in certain Italian nursing homes.

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

em algorithm
latent class model
pseudo likelihood methods


Using machine learning in a cooperative hybrid parallel strategy of metaheuristics This paper proposes the construction of a centralized hybrid metaheuristic cooperative strategy to solve optimization problems. Knowledge (intelligence) is incorporated into the coordinator to improve performance. This knowledge is incorporated through a set of rules and models obtained from a knowledge extraction process applied to the records of the results returned by individual metaheuristics. The effectiveness of the approach is tested in several computational experiments in which we compare the results obtained by the individual metaheuristics, by several non-cooperative and cooperative strategies and by the strategy proposed in this paper.

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

soft computing
multi-agent systems
cooperative metaheuristic systems
data mining


Capacity Pre-Log of Noncoherent SIMO Channels Via Hironaka's Theorem We find the capacity pre-log of a temporally correlated Rayleigh block-fading single-input multiple-output (SIMO) channel in the noncoherent setting. It is well known that for block-length length L and rank of the channel covariance matrix equal to Q, the capacity pre-log in the single-input single-output (SISO) case is given by 1 - Q/L. Here, Q/L can be interpreted as the pre-log penalty incurred by channel uncertainty. Our main result reveals that, by adding only one receive antenna, this penalty can be reduced to 1/L and can, hence, be made to vanish for the block-length L -> infinity, even if Q/L remains constant as L -> infinity Intuitively, even though the SISO channels between the transmit antenna and the two receive antennas are statistically independent, the transmit signal induces enough statistical dependence between the corresponding receive signals for the second receive antenna to be able to resolve the uncertainty associated with the first receive antenna's channel and thereby make the overall system appear coherent. The proof of our main theorem is based on a deep result from algebraic geometry known as Hironaka's Theorem on the Resolution of Singularities.

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

fading
multiple-antenna channels
noncoherent capacity


Incorporating a wavelet transform into a saliency-based method for online handwriting segmentation In the framework of a saliency-based approach for segmenting cursive handwriting into elementary strokes, we propose a smoothing technique based on the use of a Wavelet Transform to describe the electronic ink at different resolutions. According to such an approach, derived in analogy with those proposed in the literature for early visual tasks in primates, curvature maxima corresponding to actual segmentation points are separated from those produced by the different source of noise affecting the handwriting generation process. This is obtained by evaluating the curvature maxima at different levels of resolution, and by arranging them into a pyramidal structure, from which a saliency map is eventually achieved by combining the values across all possible scales. Such maps enjoy the property of exhibiting higher values in correspondence of regions of the original ink where curvature maxima survive along difference scales, thus indicating that those regions should correspond to the parts of the ink where two strokes join. Experiments performed by using both standard databases and one of online words collected in our laboratory, have shown high performance in terms of correct segmentation, stability and predictability of the results.

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

online handwriting
segmentation
saliency
handwriting generation


on reference string generation processes Efficient memory management is important for optimizing computer usage. Intuition, simulation, experience, and analysis have contributed to the design of space management algorithms. Analytical models require accurate and concise descriptions of the system's environment. The referencing pattern, describing the sequence of memory addresses, is the environment for memory management problems. One referencing model assigns probabilities to positions in an LRU stack of memory pages. Local behavior is easily described using this model. However, the distinctly different behavior among instruction and data references is lost. In this paper we generalize the LRU stack model to an arbitrary number of memory spaces which are selected by the transitions of a Markov chain. The additional detail affects the behavior of the models for a working set management strategy.

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

generation
memory management
lru
simulation
analysis
design
experience
paper
model
management
pattern
systems
space
working set
behavior
instruction
data
sequence

affect
markov models
computation
probability
replacement policies
general
reference strings
stack distance
strings
strategies
environments
optimality
transit
memorialized
process
algorithm


smooth approximation and rendering of large scattered data sets We present an efficient method to automatically compute a smooth approximation of large functional scattered data sets given over arbitrarily shaped planar domains. Our approach is based on the construction of a C 1 -continuous bivariate cubic spline and our method offers optimal approximation order. Both local variation and nonuniform distribution of the data are taken into account by using local polynomial least squares approximations of varying degree. Since we only need to solve small linear systems and no triangulation of the scattered data points is required, the overall complexity of the algorithm is linear in the total number of points. Numerical examples dealing with several real world scattered data sets with up to millions of points demonstrate the efficiency of our method. The resulting spline surface is of high visual quality and can be efficiently evaluated for rendering and modeling. In our implementation we achieve real-time frame rates for typical fly-through sequences and interactive frame rates for recomputing and rendering a locally modified spline surface.

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

terrain visualization
data compression
scattered data approximation
least squares approximation


A monomial-based method for non-linear structural analysis The analysis of certain structures must be performed with due consideration to nonlinear behavior, such as material and geometric non-linearities. The existing methods for treating non-linear structural behavior generally make use of repeated linearization, such as load increment methods. This paper demonstrates that there is an alternative type of linearization that appears to have significant advantages when applied to the analysis of non-linear structural systems. Briefly stated this alternative linearization can be thought of as a "monomialization". This monomial (single-termed power function) approximation more faithfully models the power function behavior inherent in typical structural systems. Conveniently it becomes a linear form when transformed into lag space. Thus, computational tools based on linear algebra remain useful and effective. Preliminary results indicate that the monomial approximation provides a higher quality approximation to non-linear phenomena exhibited in structural applications Consequently, incremental and iterative methods become more effective because larger steps can be taken. The net result is an increase in reliability of the solution process and a significant reduction in computational effort. Two examples are presented to demonstrate the method.

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

numerical methods
approximation concepts
newton's method
finite element method


Power And Fault Emulation for Software Verification and System Stability Testing in Safety Critical Environments In recent years the complexity of digital control systems in safety critical environments increased steadily from simple discrete control units to complex embedded systems. A wide industrial consensus about the necessity of a set of safety definitions lead to the introduction of several functional safety standards like IEC61508. To achieve that novel embedded systems comply with these requirements, thorough testing is needed during early design stages of the integrated device. Currently only fault injection testing using manufactured products and netlists of system-on-chips are used to determine the fault resistance of the embedded system. This late testing could result in expensive redesigns and hide implementation errors because of the black-box approach. This approach is also not practicable if software and hardware providers are separate entities. This paper presents a flexible fault injection and power estimation platform to enable thorough examinations of novel complex system-on-chips for automotive or similar critical environments. The microprocessor evaluation approach is extended with smart bus fault emulation units for common buses like Ethernet. The combined power and fault emulation techniques allow for the instant exploration of eventual power supply peaks and implementation weaknesses.

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

fault injection
power estimation
software verification

automotive embedded system
fault tolerance


A comparison of data models in chemical engineering Several data models have been developed in the domain of chemical engineering as the basis of specialized computer-aided tools, for the exchange of data between different tools, or to obtain a better understanding of the domain in order to improve its work processes and to provide specific support functionalities. All these data models where developed independently from each other and for specific applications. Within this paper, a comparison of different chemical engineering data models, that are currently developed and used, is attempted. First some fundamentals of data modeling will be presented. General requirements of data models are given as well as requirements that are specific to chemical engineering. These requirements and the covered data scope build the basis for the discussion and comparison of the data models. Based on this analysis, open issues in data modeling are derived that need to be approached in order to obtain high quality data models as a basis for information management and support of concurrent engineering.

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

product data model
information modeling
step


Assessing aspects of children's written grammar: automating the process Teachers are expected to make regular assessments of pupils' writing, providing feedback about their strengths and weaknesses. If the computer could assist teachers in this task by effectively analysing the grammar element in children's writing, then the teacher's work load would be significantly reduced. A computer generated 'text analysis' of grammatical features would have the benefit of providing diagnostic information systematically and efficiently. Although text analysis is not new, it is generally restricted to applications aimed at adults. The development of a quantitative text analysis program, specifically geared to analysing children's writing was therefore considered profitable. This required an understanding of both the development of children's writing abilities and the criteria of the National Curriculum levels of attainment for the Standard Assessment Tasks (SATs). Ten grammar features were selected for analysis. Stories reflecting the spread of attainment associated with the end of Key Stage 2 were analysed. The computer successfully distinguished positive and negative grammar features within these texts. Nevertheless, an assessment of qualitative genre details made by teachers will still be required, in order to provide a balanced assessment which includes all elements that contribute to effective writing. (C) 2002 Elsevier Science Ltd. All rights reserved.

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

elementary education
evaluation methodologies
improving classroom teaching


Yet Faster Ray-Triangle Intersection (Using SSE4) Ray-triangle intersection is an important algorithm, not only in the field of realistic rendering (based on ray tracing) but also in physics simulation, collision detection, modeling, etc. Obviously, the speed of this well-defined algorithm's implementations is important because calls to such a routine are numerous in rendering and simulation applications. Contemporary fast intersection algorithms, which use SIMD instructions, focus on the intersection of ray packets against triangles. For intersection between single rays and triangles, operations such as horizontal addition or dot product are required. The SSE4 instruction set adds the dot product instruction which can be used for this purpose. This paper presents a new modification of the fast ray-triangle intersection algorithms commonly used, which-when implemented on SSE4-outperforms the current state-of-the-art algorithms. It also allows both a single ray and ray packet intersection calculation with the same precomputed data. The speed gain measurements are described and discussed in the paper.

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


Area, Curve Complexity, and Crossing Resolution of Non-Planar Graph Drawings In this paper we study non-planar drawings of graphs, and study trade-offs between the crossing resolution (i.e., the minimum angle formed by two crossing segments), the curve complexity (i.e., maximum number of bends per edge), the total number of bends, and the area.

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

graph drawing
non-planar drawings
rac drawings
lac drawings


CORDIC-Based VLSI Architecture for Implementing Kaiser-Bessel Window in Real Time Spectral Analysis Windowing techniques have been widely used for preprocessing of samples before fast Fourier transform (FFT) in real time spectral analysis to minimize spectral leakage and picket fence effect. Among all popular window functions, Kaiser-Bessel window is an obvious choice for its better spectral characteristics. In this paper, CORDIC (CO-ordinate Rotation DIgital Computer) based VLSI architecture for implementing Kaiser-Bessel window has been proposed for real time applications. The parallel-pipelined technique has been adopted for the present design to ensure high throughput. Various architectural design and implementation issues have been discussed. The physical synthesis for ASIC implementation of proposed architecture using Synopsys design compiler(Design Vision) and commercially available 0. 18 ?m CMOS yields the core area of 52 mm 2and worst case dynamic power of 890 mW at an operating frequency and voltage of 400 MHz and 1.8 V respectively.

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


Gene regulated car driving: using a gene regulatory network to drive a virtual car This paper presents a virtual racing car controller based on an artificial gene regulatory network. Usually used to control virtual cells in developmental models, recent works showed that gene regulatory networks are also capable to control various kinds of agents such as foraging agents, pole cart, swarm robots, etc. This paper details how a gene regulatory network is evolved to drive on any track through a three-stages incremental evolution. To do so, the inputs and outputs of the network are directly mapped to the car sensors and actuators. To make this controller a competitive racer, we have distorted its inputs online to make it drive faster and to avoid opponents. Another interesting property emerges from this approach: the regulatory network is naturally resistant to noise. To evaluate this approach, we participated in the 2013 simulated racing car competition against eight other evolutionary and scripted approaches. After its first participation, this approach finished in third place in the competition.

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

gene regulatory network
incremental evolution


estimating the global pagerank of web communities Localized search engines are small-scale systems that index a particular community on the web. They offer several benefits over their large-scale counterparts in that they are relatively inexpensive to build, and can provide more precise and complete search capability over their relevant domains. One disadvantage such systems have over large-scale search engines is the lack of global PageRank values. Such information is needed to assess the value of pages in the localized search domain within the context of the web as a whole. In this paper, we present well-motivated algorithms to estimate the global PageRank values of a local domain. The algorithms are all highly scalable in that, given a local domain of size n, they use O(n) resources that include computation time, bandwidth, and storage. We test our methods across a variety of localized domains, including site-specific domains and topic-specific domains. We demonstrate that by crawling as few as n or 2n additional pages, our methods can give excellent global PageRank estimates.

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

page rank
stochastic complementation
markov chain


Stability of operator splitting methods for systems with indefinite operators: Advectiondiffusionreaction systems ? This brief paper presents an A-stability result for operator splitting type time integration methods applied to advectiondiffusionreaction equations with possibly indefinite source terms. These results extend our earlier work on diffusionreaction systems [D.L. Ropp, J.N. Shadid, Stability of operator splitting methods for systems with indefinite operators: reactiondiffusion systems, J. Comput. Phys. 203 (2) (2005) 449466]. The A-stability result presents sufficient conditions that control both low and high wave number instabilities. A corollary shows that if L-stable methods are used for the diffusion term the high wave number instability will be controlled more easily. Numerical results are presented that verify second-order convergence for the operator splitting methods and demonstrate control of instabilities on a chemotaxis problem by use of an L-stable diffusion integrator.

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

operator splitting methods
time integration

advectiondiffusionreaction pdes
linear stability
numerical methods


A Map-Reduce-enabled SOLAP cube for large-scale remotely sensed data aggregation Remote-sensing data aggregation in Spatial OLAP faces big data challenge. A tile-based SOLAP cube model for raster is presented based on parallel map algebra. The model integrates SOLAP with Map-Reduce for accelerating spatio-temporal aggregations. The model shows good scalability along with both increased data and node number. Complexity of the distribution is encapsulated via transparent SOLAP interface.

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

spatio-temporal cube
data-intensive computing
cybergis
environment monitoring


A Wikipedia Matching Approach to Contextual Advertising Contextual advertising is an important part of today's Web. It provides benefits to all parties: Web site owners and an advertising platform share the revenue, advertisers receive new customers, and Web site visitors get useful reference links. The relevance of selected ads for a Web page is essential for the whole system to work. Problems such as homonymy and polysemy, low intersection of keywords and context mismatch can lead to the selection of irrelevant ads. Therefore, a simple keyword matching technique gives a poor accuracy. In this paper, we propose a method for improving the relevance of contextual ads. We propose a novel "Wikipedia matching" technique that uses Wikipedia articles as "reference points" for ads selection. We show how to combine our new method with existing solutions in order to increase the overall performance. An experimental evaluation based on a set of real ads and a set of pages from news Web sites is conducted. Test results show that our proposed method performs better than existing matching strategies and using the Wikipedia matching in combination with existing approaches provides up to 50% lift in the average precision. TREC standard measure bpref-10 also confirms the positive effect of using Wikipedia matching for the effective ads selection.

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

contextual advertising
wikipedia matching


An architecture for the vertical integration of tooling considerations from design to process planning To meet the competitive demands of modern manufacturing, it is necessary to reduce design times and enrich decision making by integrating process planning into the design activity using Concurrent Engineering principles. Although this is traditionally done through the interaction between designers and process planners, it is perhaps more desirable for a CAD system to have the functionality necessary to automatically advise the designer of the shop floor implications of design decisions. Cutting tool selection is an essential thread linking feature-based design of machined parts to process planning. Thus, the implementation of tooling considerations into design is an important requirement for an integrated CAD/CAPP system. This paper defines an architecture to enable the vertical integration of tooling considerations from early design to process planning and scheduling. The architecture is based on a five-level tool selection procedure which is mapped to a time-phased aggregate, management and detailed process planning framework. This paper draws on literature and the results of an industrial survey to identify the tooling methods suitable for integration within a CAD system and categorises them into the five levels of tool selection. The functions are then placed on a time-dependent framework that covers the progression of a product from design to process planning. The new functionality is being implemented as an object-oriented application called VITool, which is being developed so that it can be fully integrated within an existing CAD 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 B O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O 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


Minimizing variance of reservoir systems operations benefits using soft computing tools Soft computing based tools including fuzzy inference systems (FIS), artificial neural networks (ANN), and genetic algorithms (GA) are used here to tackle the minimization of variance of benefits from reservoir operation. Variance reduction is a very hard optimization problem and solvable only using implicit methods like simulation, especially if the problem is nonlinear. First, a recently developed stochastic optimization method develops the optimal release policy (which is simply the recommended release in each season) of the system whose objective function maximizes the expected benefits. The policy is then simulated for a long inflow series to provide the trajectories of optimal releases and storages of the reservoir. These trajectories are then used as input-output data to train an adaptive neuro fuzzy inference system (ANFIS) to obtain updated fuzzy operating rules. The ANFIS based fuzzy rules are simulated and compared with policies developed using a multiple regression analysis, a commonly used method in water resources optimization. As the ANFIS performed better, further, a parameterized T-norm operator is applied and its parameters (numbering only two) are optimized through GA but with the objective of variance reduction in the benefits achieved. Results compare the better performance of the ANFIS based policies with other methods such as stochastic dynamic programming and the original stochastic method to demonstrate the usefulness of GA optimized parameters of a T-norm fuzzy operator for variance reduction. (C) 2002 Elsevier B.V. All rights reserved.

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

soft computing
optimization
fuzzy inference system


Priority-based minimum interference path multicast: routing algorithm in optical virtual private network While the "Virtual Private Network (VPN) over Internet" is cost-effective and flexible, it suffers from the difficulty of providing adequate transmission capacity for high bandwidth services. Hence a Dense Wavelength Division Multiplexing (DWDM) based "Optical VPN (OVPN)" technology has been regarded as a good alternative for realizing the future VPN services. To improve the transparency and data rate of OVPN, it is critical to consider the problem of Routing and Wavelength Assignment (RWA) for transmission capacity utilization. This paper proposes a Priority-based Minimum Interference Path Multicast Routing (PMIPMR) algorithm, a new routing algorithm which finds alternative routes based on node priorities and Virtual Source ( VS) nodes that has both splitting and wavelength conversion, and then chooses a path that does not interfere with potential future multicast session requests when congestions occur in the network. The PMIPMR algorithm reduces blocking rate significantly and increases the wavelength utilization by avoiding congestion in future multicast session requests. We measured the performance of the proposed algorithm in terms of blocking rate and the resource utilization. The simulation results demonstrate that the PMIPMR algorithm is superior to the previous multicast routing algorithms using the Capability-based-Connection algorithm based on Capability-based-Priority and Spawn-from-VS methods.

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

multicast routing and wavelength assignment


Slice-to-volume registration and its potential application to interventional MRI-guided radio-frequency thermal ablation of prostate cancer In this study, we registered live-time interventional magnetic resonance imaging (iMRI) slices with a previously obtained high-resolution MRI volume that in turn can be registered with a variety of functional images, e.g., PET, SPECT, for tumor targeting. We created and evaluated a slice-to-volume (SV) registration algorithm with special features for its potential use in iMRI-guided radio-frequency (RF) thermal ablation of prostate cancer. The algorithm features included a multiresolution approach, two similarity measures, and automatic restarting to avoid local minima. Imaging experiments were performed on volunteers using a conventional 1.5-T MR scanner and a clinical 0.2-T C-arm iMRI system under realistic conditions. Both high-resolution MR volumes and actual iMRI image slices were acquired from the same volunteers. Actual and simulated iMRI images were used to test the dependence of SV registration on image noise, receive coil inhomogeneity, and RF needle artifacts. To quantitatively assess registration, we calculated the mean voxel displacement over a volume of interest between SV registration and volume-to-volume registration, which was previously shown to be quite accurate. More than 800 registration experiments were performed. For transverse image slices covering the prostate, the SV registration algorithm was 100% successful with an error of <2 mm, and the average and standard deviation was only 0.4 mm +/- 0.2 mm. Visualizations such as combined sector display and contour overlay showed excellent registration of the prostate and other organs throughout the pelvis. Error was greater when an image slice was obtained at other orientations and positions, mostly because of inconsistent image content such as that from variable rectal And bladder filling. These preliminary experiments indicate that MR SV registration is sufficiently accurate to aid image-guided therapy.

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

interventional magnetic resonance imaging (imri)


Pseudo-optimal parameter selection of non-stationary generalized extreme value models for environmental variables Recent advances in the description of environmental and geophysical extreme events allow incorporating smooth time variations for the parameters of the GEV distribution using harmonic functions, long-term trends and covariates (North Atlantic Oscillation, El Nio, etc.). Most of the proposed models rely on the maximum likelihood estimation method for a given parameterization. However, finding the best parameter selection for each case is not an easy task, since the number of possible combinations grows exponentially with the number of possible parameters to be considered. This problem is usually overcome by assuming simplified models based on experience or using heuristic approaches, which are computationally very expensive. In this paper, a method to obtain a pseudo-optimal parameterization using the maximum likelihood method is presented. The proposed algorithm automatically selects the parameters which minimize the Akaike Information Criterion within an iterative scheme, including one parameter at a time based on a score perturbation criteria. The process is repeated until no further improvement in the objective function is achieved. The proposed method is applied for the adjustment of monthly maximum significant wave height at different locations around the Atlantic coast and results are compared with those obtained using an existing heuristic approach, showing an important reduction in computational time and comparable results in terms of fitting quality.

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

automatic adjustment
geophysical variables
non-stationary
return period
time-dependent


a certifying compiler for java This paper presents the initial results of a project to determine if the techniques of proof-carrying code and certifying compilers can be applied to programming languages of realistic size and complexity. The experiment shows that: (1) it is possible to implement a certifying native-code compiler for a large subset of the Java programming language; (2) the compiler is freely able to apply many standard local and global optimizations; and (3) the PCC binaries it produces are of reasonable size and can be rapidly checked for type safety by a small proof-checker. This paper also presents further evidence that PCC provides several advantages for compiler development. In particular, generating proofs of the target code helps to identify compiler bugs, many of which would have been difficult to discover by testing.

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

size
code
project
complexity
evidence
paper
type safety
global
bugs
programming language

program test developer standardization compilation experience locality


a demand-driven analyzer for data flow testing at the integration level Data-flow testing relies on static analysis for computing the definition-use pairs that serve as the test case requirements for a program. When testing large programs, the individual procedures are first tested in isolation during unit testing. Integration testing is performed to specifically test the procedure interfaces. The procedures in a program are integrated and tested in several steps. Since each integration step requires data-flow analysis to determine the new test requirements, the accumulated cost of repeatedly analyzing a program can contribute considerably to the overhead of testing. Data-flow analysis is typically computed using an exhaustive approach or by using incremental data-flow updates. This paper presents a new and more efficient approach to data-flow integration testing that is based on demand-driven analysis. We developed and implemented a demand-driven analyzer and experimentally compared its performance during integration testing with the performance of (i) a traditional exhaustive analyzer, and (ii) an incremental analyzer. Our experiments show that demand-driven analysis is faster than exhaustive analysis by up to a factor of 25. The demand-driven analyzer also outperforms the incremental analyzer in 80\% of the test programs by up to a factor of 5.

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

requirements
data flow testing
static analysis
analysis
interfaces
case
paper
incremental
performance
program
factor
procedure
test
exhaustive analyzer
integration testing
overhead
unit testing
cost

use
efficiency
definition-use pairs
computation
definition
experience
incremental analyzer
incremental data-flow updates
demand-driven analyzer
data
flow
program testing
data flow analysis
isolates
test case requirements
update
large program testing
integrability
program procedure interfaces