Are American astrophysics papers accepted more quickly than others? Part I It has been shown that papers in stem cell research submitted from institutions in the USA are accepted faster than those submitted from elsewhere and that the cause might at least partly be some bias in the refereeing process. We investigate whether there is a similar difference in time scale for papers in astronomy, astrophysics, and cosmology and look briefly at some of the possible causes. We find a publication time lag of 3.8 days (out of a median time of 105 days) while in the stem cell case it is 24 days out of a median of 83 days. One of many possible causes is a difference in how useful the papers are to the community, and we will assess this in a second paper making use of citation analysis.

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

astronomical journals
publications
citations


Static analysis of real-time component-based systems configurations Nowadays, more and more often, complex systems are built by assembling together different system components. This technology also affects the construction of heterogeneous and/or hybrid systems where components can represent hardware sensors, software controllers, etc. Moreover the resulting system is normally distributed. These systems have often real-time constraints/ requirements and each component is characterized by its own speed determined by its local clock. In this paper we present a framework to specify and statically analyze the architecture of a system as a network of (parallel) components, each one with its own local clock. Configuring the system means to formally define how to get the global clock out of the local clocks. This clock configuration step is "optimal" that is, it is the best way to relate the local clocks so that the maximum number of synchronizations in the system can happen. Besides the usual behavioral and timing analysis, it is, for example, possible to verify if, and how changing the local speed of a component can affect the global performance of the system. Components behaviors are specified by means of a simple process algebra. Local clocks are modeled as higher order terms in a given signature, and unification is used to define the common clock. Then an operational semantics defines which transitions a process can perform and which transitions let time to elapse. A set of case studies illustrate the approach. (C) 2002 Elsevier Science B.V. All rights reserved.

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


G(2) quasi-developable Bezier surface interpolation of two space curves Surface development is used in many manufacturing planning operations, e.g., for garments, ships and automobiles. However, most freeform surfaces used in design are not developable, and therefore the developed patterns are not isometric to the original design surface. In some domains, the CAD model is created by interpolating two given space curves. In this paper, we propose a method to obtain a G(2) quasi-developable Bezier surface interpolating two arbitrary space curves. The given curves are first split into a number of piecewise Bezier curves and elemental Bezier patches each of which passes through four splitting points are constructed. All neighboring elemental patches are G(2) connected and they are assembled optimally in terms of the degree of developability (the integral Gaussian curvature). Experiments show that the final composite Bezier surface is superior to a lofted one which is defined regardless of the final surface developability. (c) 2013 Elsevier Ltd. All rights reserved.

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

developable surfaces
ruled surfaces
garment design
surface energy


Structural properties of semipolar InGaN/GaN quantum dot superlattices grown by plasma-assisted MBE The nanoscale properties of self-assembled semipolar InGaN/GaN quantum dot (QD) superlattices, grown by plasma-assisted molecular beam epitaxy (PAMBE) on ( 1 1 2 2 ) GaN template, were investigated by transmission electron microscopy (TEM) techniques. Preferential QD nucleation on crystal planes inclined at small angles relative to the ( 1 1 2 2 ) plane was observed. Nominal ( 1 1 2 2 ) QDs were lenticular-shaped but the QD size and faceting increased when nucleation occurred on the inclined planes. Strain and interaction with the threading dislocations introduced fluctuations in the indium concentration. Lattice strain analysis along the growth direction was correlated to the average indium content.

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


Mesh generation considering detailed tread blocks for reliable 3D tire analysis Tire tread is composed of many grooves and blocks in complex pattern for the sake of the major tire running performances, but the 3D tire analysis has been performed conventionally by either neglecting tread blocks or modeling only circumferential grooves. As a result, such simplified analyses lead to considerably poor numerical expectations. In this context, this paper addresses an effective mesh generation procedure for 3D automobile tires in which the detailed tread blocks with variable anti-skid depth are fully considered. Tire body and tread pattern meshes are constructed separately in the beginning, and then both are to be assembled by the incompatible tying method. Detailed pattern mesh is inserted either partially or fully depending on the analysis purpose. Through the tire contact analysis, we verified that the meshing technique introduced does not cause any meshing error and the detailed tire mesh expects the contact pressure more consistent with the experimental results.

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

three-dimensional tire mesh
variable anti-skid depth
body and pattern meshes
partial and full tread meshes
footprint and contact pressure


Exploring the directed h-degree in directed weighted networks Most networks in information science appear as weighted networks, while many of them (e.g. author citation networks, web link networks and knowledge flow networks) are directed networks. Based on the definition of the h-degree, the directed h-degree is introduced for measuring both weighted networks and directed networks. After analyzing the properties and derived measures of the directed h-degree an actual application of LIS journals citation network is worked out.

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

weighted networks
directed networks
citation networks

information networks
h-degree
directed h-degree


route flap damping with assured reachability It is well known that a relatively small percentage of unstable routes exists in the global routing system which contributes an out of proportion number of routing updates. The route flap damping (RFD) was once considered an effective means to curtail such instability. However, both measurement studies and operational observations show that BGP path exploration can trigger false route damping which leads to prolonged periods of lost network reachability. As a result, many networks turned off RFD. In this paper we propose a simple solution, RFD+RG, dubbed RFD with Reachability Guard , to address the reachability problem in the RFD deployment. RFD+RG performs route flap damping without losing reachability, and the +RG enhancement component works independently from specific damping algorithms and can be integrated into any existing RFD scheme. We use collected BGP data to evaluate RFD+RG performance and our results show that RFD+RG can suppress up to 27\% of route instabilities while faithfully preserving reachability.

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


Vertex disjoint paths on clique-width bounded graphs We show that the I vertex disjoint paths problem between 1 pairs of vertices can be solved in linear time for co-graphs but is NP-complete for graphs of clique-width at most 6 and NLC-width at most 4. The NP-completeness follows from the fact that the line graph of a graph of tree-width k has clique-width at most 2k + 2 and NLC-width at most k + 2, and a result by Nishizeki et al. [The edge-disjoint paths problem is NP-complete for series-parallel graphs, Discrete Appl. Math. 115 (2001) 177-186]. The vertex disjoint paths problem is the first graph problem shown to be NP-complete on graphs of bounded clique-width but solvable in linear time on co-graphs and graphs of bounded tree-width. Additionally, we show that the r vertex disjoint paths problem between each of I pairs of vertices can be solved in polynomial time for co-graphs, if 1 is given to the input, and for graphs of bounded clique-width, if I is fixed. (C) 2006 Elsevier B.V. All rights reserved.

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

nlc-width
clique-width
tree-width
line graphs
edge disjoint paths


Ontology Visualization: Tools and Techniques for Visual Representation of Semi-Structured Meta-Data Ontologies are used to represent a variety of domain knowledge and data collections, scopes, viewpoints and linked heterogeneous information sources. They range from simple topologies to highly structured knowledge bases with complex relations. When mapping or aligning two or more ontologies an efficient user support is needed so that the users can understand the prerequisites and the consequences of the alignments. Information Visualization techniques can help to facilitate user understanding of the ontology alignment results. In general, a lot of work in visualization of ontologies exist. We found an enormous number of ontology visualization tools by a literature study. Many of them apply graph visualization but there are other approaches as well. We have identified interesting solutions for dealing with the complexity of large ontologies. Ontology engineering, ontology mapping and alignment can benefit from Information Visualization. Our collection is a starting point to demonstrate the usefulness of Information Visualization techniques, however, a detailed evaluation would be the next step to consolidate this research area and help to boost the adoption of ontologies in common Web applications.

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

ontology
information visualization techniques


Balanced corpus of contemporary written Japanese The balanced corpus of contemporary written Japanese (BCCWJ) is Japans first 100 million words balanced corpus. It consists of three subcorpora (publication subcorpus, library subcorpus, and special-purpose subcorpus) and covers a wide range of text registers including books in general, magazines, newspapers, governmental white papers, best-selling books, an internet bulletin-board, a blog, school textbooks, minutes of the national diet, publicity newsletters of local governments, laws, and poetry verses. A random sampling technique is utilized whenever possible in order to maximize the representativeness of the corpus. The corpus is annotated in terms of dual POS analysis, document structure, and bibliographical information. The BCCWJ is currently accessible in three different ways including Chunagon a web-based interface to the dual POS analysis data. Lastly, results of some pilot evaluation of the corpus with respect to the textual diversity are reported. The analyses include POS distribution, word-class distribution, entropy of orthography, sentence length, and variation of the adjective predicate. High textual diversity is observed in all these analyses.

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

bccwj
japanese
balanced corpus
dual pos analysis
evaluation
chunagon


Fast pedestrian detection based on region of interest and multi-block local binary pattern descriptors ? We introduced a new ROI method, it decreases computational cost and improve detection speed. We improved the images edges within the candidate region using non-tensor product wavelet filter. We used full-body descriptor based on shapelet and body-part descriptor based on MB-LBP for features extraction. We built a cascade ILFDA classifier to handle large data.

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

non-tensor product wavelet filter
shapelet feature
mb-lbp
iflda


Quasi-randomness

of

graph

balanced

cut

properties

Quasi-random

graphs

can

be

informally

described

as

graphs

whose

edge

distribution

closely

resembles

that

of

a

truly

random

graph

of

the

same

edge

density.

Recently,

Shapira

and

Yuster

proved

the

following

result

on

quasi-randomness

of

graphs.

Let

k

be

a

fixed

integer,

be

positive

reals

satisfying

\documentclass{article}\usepackage{mathrsfs}\usepackage{amsmath,

amssymb}\pagestyle{empty}\begin{document}

\end{document}

and

and

G

be

a

graph

on

n

vertices.

If

for

every

partition

of

the

vertices

of

G

into

sets

V

k

of

size

the

number

of

complete

graphs

on

k

vertices

which

have

exactly

one

vertex

in

each

of

these

sets

is

similar

to

what

we

would

expect

in

a

random

graph,

then

the

graph

is

quasi-random.

However,

the

method

of

quasi-random

hypergraphs

they

used

did

not

provide

enough

information

to

resolve

the

case

for

graphs.

In

their

work,

Shapira

and

Yuster

asked

whether

this

case

also

forces

the

graph

to

be

quasi-random.

Janson

also

posed

the

same

question

in

his

study

of

quasi-randomness

under

the

framework

of

graph

limits.

In

this

paper,

we

positively

answer

their

question.

(C)

Wiley

Periodicals,

Inc.

Random

Struct.

Alg.,

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

quasi-random graphs
pseudo-random graphs


Generalized Dictionaries for Multiple Instance Learning We present a multi-class multiple instance learning (MIL) algorithm using the dictionary learning framework where the data is given in the form of bags. Each bag contains multiple samples, called instances, out of which at least one belongs to the class of the bag. We propose a noisy-OR model and a generalized mean-based optimization framework for learning the dictionaries in the feature space. The proposed method can be viewed as a generalized dictionary learning algorithm since it reduces to a novel discriminative dictionary learning framework when there is only one instance in each bag. Various experiments using popular vision-related MIL datasets as well as the UNBC-McMaster Pain Shoulder Archive database show that the proposed method performs significantly better than the existing methods.

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

multiple instance learning
dictionary learning

sparse coding
object recognition
pain detection


Experimenting statecharts for multiple experts knowledge elicitation in agriculture Statecharts were experimented as a mediation tool between multiple experts and a knowledge engineer. After a short survey of knowledge elicitation methods for multiple experts, we present our method for assessing the quality of the elicited model and give critiques on the basis of our case study in vineyards crop protection management. (C) 2009 Elsevier Ltd. All rights reserved.

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

knowledge acquisition
expert systems
decision support systems
discrete event systems
viticulture
workflow modelling


The semantics of augmented constraint diagrams Constraint diagrams are a diagrammatic notation which may be used to express logical constraints. They generalize Venn diagrams and Euler circles, and include syntax for quantification and navigation of relations. The notation was designed to complement the Unified Modelling Language in the development of software systems. Since symbols representing quantification in a diagrammatic language can be naturally ordered in multiple ways, some constraint diagrams have more than one intuitive meaning in first-order predicate logic. Any equally expressive notation which is based on Euler diagrams and conveys logical statements using explicit quantification will have to address this problem. We explicitly augment constraint diagrams with reading trees, which provides a partial ordering for the quantifiers (determining their scope as well as their relative ordering). Alternative approaches using spatial arrangements of components, or alphabetical ordering of symbols, for example, can be seen as implicit representations of a reading tree. Whether the reading tree accompanies the diagram explicitly (optimizing expressiveness) or implicitly (simplifying diagram syntax), we show how to construct unambiguous semantics for the augmented constraint diagram.

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

visual formalisms
software specification
formal methods


flowchart schemata with counters The translation of a specific flowchart schema with one counter into an equivalent flowchart schema without counters is described. This result leads easily to the general translation method from one-counter flowchart schemata to zero-counter flowchart schemata. Some generalizations are then presented.

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


use of structured flowcharts in the undergraduate computer science curriculum Over the last four years a new Computer Science major program has been introduced into the curriculum of the School of Engineering at Oakland University. During this period computer science educators throughout the country have debated the best way to introduce structured programming into the curriculum. There is now a widespread belief that beginning FORTRAN courses cannot be taught using structured programming in a form that is palatable to freshmen students without the aid of a structured FORTRAN preprocessor. Our experience in teaching structured programming using FORTRAN to large numbers of freshmen students has indicated that this widespread belief is false. We will illustrate the use of structured flowcharts with FORTRAN in Section 2 by showing one of the actual programming assignments that was given to our freshman introductory computer course this term. The same structured flowcharting techniques are used throughout the curriculum. An example that uses ALGOL and is taken from our junior level data structures class is given in Section 3. The use of the structured flowcharts forces all programs to be well-structured and encourages a top-down approach to programming. It is a very useful vehicle for describing any language-independent structured algorithm. An example of using structured flowcharts to describe a simple precedence parser in a senior course on compilers is given in Section 4.

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

computer science
program
parser
use
senior
data structures
teaching
experience
algorithm
class
curriculum

education
structure
examples
engine
language
computation
assignment
compilation
computer science curriculum
student


Membrane computing model for IIR filter design Adaptive infinite impulse response (IIR) filter has been preferably used in modeling real-world systems because of its reduced number of coefficients and better performance over finite impulse response (FIR) filter. However, it is still a challenging problem how to design an optimal IIR filter due to its nonlinear and multimodal error surface. This paper introduces membrane computing to design an optimal IIR filter and proposes a novel design method that employs a tissue-like membrane system with ring-shaped topology structure. A modification of the different evolution mechanism was developed as evolution rules for objects according to the special membrane structure. Under the control of the objects evolution-communication mechanism, the tissue-like membrane system can effectively find the global minima for an IIR filter design problem. The proposed method was evaluated over several benchmark IIR systems and was compared with several state-of-the-art evolutionary algorithms. The experimental results show that the proposed method has better identification performance compared with other algorithms.

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

adaptive iir filter
system identification
tissue-like membrane systems


Dynamic data integration for structural modeling: model screening approach using a distance-based model parameterization This paper proposes a novel history-matching method where reservoir structure is inverted from dynamic fluid flow response. The proposed workflow consists of searching for models that match production history from a large set of prior structural model realizations. This prior set represents the reservoir structural uncertainty because of interpretation uncertainty on seismic sections. To make such a search effective, we introduce a parameter space defined with a "similarity distance" for accommodating this large set of realizations. The inverse solutions are found using a stochastic search method. Realistic reservoir examples are presented to prove the applicability of the proposed method.

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

structural uncertainty
stochastic search

history matching
data assimilation
discrete-space optimization
distance-based model parameterization
distance function


A new surrogate modeling technique combining Kriging and polynomial chaos expansions Application to uncertainty analysis in computational dosimetry In numerical dosimetry, the recent advances in high performance computing led to a strong reduction of the required computational time to assess the specific absorption rate (SAR) characterizing the human exposure to electromagnetic waves. However, this procedure remains time-consuming and a single simulation can request several hours. As a consequence, the influence of uncertain input parameters on the SAR cannot be analyzed using crude Monte Carlo simulation. The solution presented here to perform such an analysis is surrogate modeling. This paper proposes a novel approach to build such a surrogate model from a design of experiments. Considering a sparse representation of the polynomial chaos expansions using least-angle regression as a selection algorithm to retain the most influential polynomials, this paper proposes to use the selected polynomials as regression functions for the universal Kriging model. The leave-one-out cross validation is used to select the optimal number of polynomials in the deterministic part of the Kriging model. The proposed approach, called LARS-Kriging-PC modeling, is applied to three benchmark examples and then to a full-scale metamodeling problem involving the exposure of a numerical fetus model to a femtocell device. The performances of the LARS-Kriging-PC are compared to an ordinary Kriging model and to a classical sparse polynomial chaos expansion. The LARS-Kriging-PC appears to have better performances than the two other approaches. A significant accuracy improvement is observed compared to the ordinary Kriging or to the sparse polynomial chaos depending on the studied case. This approach seems to be an optimal solution between the two other classical approaches. A global sensitivity analysis is finally performed on the LARS-Kriging-PC model of the fetus exposure problem.

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

polynomial chaos expansions
kriging
dosimetry
specific absorption rate


Synthesis of arithmetic circuits considering layout effects In deep submicron technology, wires are equally or more important than logic components since wire-related problems such as crosstalk noise is much critical in system-on-chip design. Recently, a method for generating a partial product reduction tree with optimal-timing using bit-level adders to implement arithmetic circuits has been proposed, which outperforms the current best designs. However, in the conventional approaches, interconnects are not primary components to be optimized in the synthesis of arithmetic circuits, mainly due to its integration complexity or unpredictable wire effects, thereby resulting in unsatisfactory lay-out results with long and messy wire connections. To overcome the limitation, we propose a new module generation/synthesis algorithm for arithmetic circuits utilizing carry-save-adder (CSA) modules, which not only optimizes the circuit timing but also generates a much regular interconnect topology of the final circuits. Specifically, we propose a two-step algorithm: (Phase 1: CSA module generation) we propose an optimal-timing CSA module generation algorithm for an arithmetic expression under a general CSA timing model; then (Phase 2: Bit-level interconnect refinements), we optimally refine the interconnects between the CSA modules while retaining the global CSA-tree structure produced by Phase 1. We show that the timing of the circuits produced by our approach is equal or almost close to that in most test cases (even without including the interconnect delay), and at the same time, the interconnects in layout are short and regular.

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

arithmetic circuit
carry-save-adder (csa)
layout-aware synthesis
timing optimization


Security of E2 against truncated differential cryptanalysis This paper evaluates the security of the block cipher E2 against truncated differential cryptanalysis. We show an algorithm to search for effective truncated differentials. The result of the search confirmed that there exist no truncated differentials that lead to possible attacks for E2 with more than 8 rounds. The best attack breaks an 8-round variant of E2 with either IT-Function (the initial transformation) or FT-Function (the final transformation) using 2(94) chosen plaintexts. We also found the attack which distinguishes a 7-round variant of E2 with IT- and FT-Functions from a random permutation using 2(91) chosen plaintexts.

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


A sliding window method with iterative tuning for channel estimation of UWB signals This letter proposes a sliding window method with iterative tuning for channel estimation of UWB signals. The iterative tuning scheme, which is based on multiple iterations of least mean square (LMS) algorithm, is utilized for modifying the output of the conventional sliding window channel estimator. By using this, the proposed method is more flexible due to the tradeoff between the processing time and accuracy, which makes it more suitable for practical UWB wireless communications. Simulations are also provided for demonstrating the validation of the proposed method.

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

sliding window (sw)
ultra-wideband (uwb)


Video matching This paper describes a method for bringing two videos (recorded at different times) into spatiotemporal alignment, then comparing and combining corresponding pixels for applications such as background subtraction, compositing, and increasing dynamic range. We align a pair of videos by searching for frames that best match according to a robust image registration process. This process uses locally weighted regression to interpolate and extrapolate high-likelihood image correspondences, allowing new correspondences to be discovered and refined. Image regions that cannot be matched are detected and ignored, providing robustness to changes in scene content and lighting, which allows a variety of new applications.

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

video alignment
robust image matching
high dynamic range video


Nondeterministic Algorithm for Breaking Diffie-Hellman Key Exchange using Self-Assembly of DNA Tiles The computation based on DNA tile self-assembly has been demonstrated to be scalable, which is consider as a promising technique for computation. In this work, I first show how the tile self-assembly process can be used for computing the modular multiplication by mainly constructing three small systems including addition system, subtraction system and comparing system which can also be parallely implemented the discrete logarithm problem in the finite field GF(p). Then the nondeterministic algorithm is successfully performed to break Diffie-Hellman key exchange with the computation time complexity of Theta(p), and the probability of finding the successful solutions among many parallel executions is proved to be arbitrarily close to 1.

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

modular multiplication
discrete logarithm
nondeterministic
key exchange
dna tiles


Sound retrieval with intuitive verbal descriptions Our aim is to develop an intuitive and effective sound retrieval method for non-expert users. Such a retrieval method should be developed to accommodate a human's perceptual features. We therefore first conducted an experiment to clarify how people represent sound. A participant listens to one sound stimulus and then conveys the sound to a partner. The results indicated that people used mostly verbal description categorized in three groups: the sound itself, the sound's situation, and the sound's impression. Based on these results, we propose three types of keywords: onomatopoeia, sound source, and adjective, which are typical keywords of the above three groups of sound description, for sound retrieval. This retrieval method was implemented for a sound database. Our method can increase the varieties of sounds able to be retrieved and allow users to intuitively search sounds because users can retrieve sounds by using keywords that are most natural to them.

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

sound retrieval onomatopoeia source adjective


Parallel real-time computation: Sometimes quantity means quality The primary purpose of parallel computation is the fast execution of computational tasks that require an inordinate amount of time to perform sequentially. As a consequence, interest in parallel computation to date has naturally focused on the speedup provided by parallel algorithms over their sequential counterparts. The thesis of this paper is that a second equally important motivation for using parallel computers exists. Specifically, the following question is posed: Can parallel computers, thanks to their multiple processors, do more than simply speed up the solution to a problem? We show that within the paradigm of real-time computation, some classes of problems have the property that a solution to a problem in the class, when computed in parallel, is far superior in quality than the best one obtained on a sequential computer. What constitutes a better solution depends on the problem under consideration. Thus, 'better' means 'closer to optimal' for optimization problems, 'more secure' for cryptographic problems, and 'more accurate' for numerical problems. Examples from these classes are presented. In each case, the solution obtained in parallel is significantly, provably, and consistently better than a sequential one. It is important to note that the purpose of this paper is not to demonstrate merely that a parallel computer can obtain a better solution to a computational problem than one derived sequentially. The latter is an interesting (and often surprising) observation in its own right, but we wish to go further. It is shown here that the improvement in quality can be arbitrarily high (and certainly superlinear in the number of processors used by the parallel computer). This result is akin to superlinear speedup - a phenomenon itself originally thought to be impossible.

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

parallelism
real-time computation
cryptography
numerical analysis


Dual-code quantum computation model In this work, we propose the dual-code quantum computation modela fault-tolerant quantum computation scheme which alternates between two different quantum error-correction codes. Since the chosen two codes have different sets of transversal gates, we can implement a universal set of gates transversally, thereby reducing the overall cost. We use code teleportation to convert between quantum states in different codes. The overall cost is decreased if code teleportation requires fewer resources than the fault-tolerant implementation of the non-transversal gate in a specific code. To analyze the cost reduction, we investigate two cases with different base codes, namely the Steane and Bacon-Shor codes. For the Steane code, neither the proposed dual-code model nor another variation of it achieves any cost reduction since the conventional approach is simple. For the Bacon-Shor code, the three proposed variations of the dual-code model reduce the overall cost. However, as the encoding level increases, the cost reduction decreases and becomes negative. Therefore, the proposed dual-code model is advantageous only when the encoding level is low and the cost of the non-transversal gate is relatively high.

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

fault-tolerant quantum computation
bacon-shor code
reed-muller code
code conversion


Discontinuous fluctuation distribution This paper describes a new numerical scheme for the approximation of steady state solutions to systems of hyperbolic conservation laws. It generalises the fluctuation distribution framework by allowing the underlying representation of the solution to be discontinuous. This leads to edge-based fluctuations in addition to the standard cell-based fluctuations, which are then distributed to the cell vertices in an upwind manner which retains the properties of the continuous scheme (positivity, linearity preservation, conservation, compactness and continuity). Numerical results are presented on unstructured triangular meshes in two space dimensions for linear and nonlinear scalar equations as well as the Euler equations of gasdynamics. The accuracy of the approximation in smooth regions of the flow is shown to be very similar to the corresponding continuous scheme, but the discontinuous approach improves the sharpness with which discontinuities in the flow can be captured and provides additional flexibility which will allow adaptive techniques to be applied simply to improve efficiency.

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


Psychometric properties of the Problematic Internet Use Questionnaire ? Several instruments have been designed to measure problems associated with excessive, compulsive, or addictive use of the Internet. One such instrument, the 18-item Problematic Internet Use Questionnaire, was recently published with data supporting a three subscale model (Demetrovics et al., 2008). These researches utilized an online format with a sample taken from the general population of Hungary. We utilized an American college student sample and a paper and pencil format to perform a confirmatory factor analysis of the PIUQ. In addition, we examined the reliability and construct validity of the PIUQ by examining the scales relationship with several indices of psychological and physical health. CFA results indicate a barely adequate and not completely problem free three factor model for the PIUQ (?2=477.40; root mean square error=.097; comparative fit index=.831; Tucker Lewis coefficient=.804). Cronbachs ? for the total scale was .91 while the Cronbachs ? for each subscale were .81, .77, and .79. Construct validity for the model is demonstrated with significant correlations between the subscales and several indices of psychological and physical health. Suggestions for further research are provided.

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


Robust thyristor-controlled series capacitor controller design based on linear matrix inequality for a multi-machine power system Power system stabilizing control has an important role in maintaining synchronism in power systems during major disturbances resulting from sudden changes of load and configuration. The thyristor-controlled series capacitor (TCSC) is one of the representative devices in flexible AC transmission systems. In this paper, robust TCSC controllers are applied to suppress disturbances in realistic power systems. H? control is adopted as the methodology of the robust controller design along with a linear matrix inequality (LMI), which solves the Lyapunov inequality without the weighting coefficients used in other control theories. In the proposed design, load changes are treated as a system uncertainty in the LMI approach. The proposed LMI-based approach is shown to be effective in the design of TCSC controllers to enhance robustness and response by simulations on a test system.

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

transient stability
thyristor-controlled series capacitor


transforming documentation from the xml doctypes used for the apache website to dita A primary factor behind the enormous interest in XML is the support it provides for transforming documents to meet the needs of information-processing applications as well as human readers working with HTML, print, and other presentation media. This case study reviews the issues we confronted, the tools we implemented, and the procedures we adopted to transform a documentation set from one XML document type to another, and from XML to HTML and Adobe PDF.The documentation set for Xalan, the Apache XSL transformer based largely on code donated by Lotus/IBM, is written in XML, using document types shared by the projects on the Apache XML website. To present Xalan reference releases to IBM project groups, the Cambridge Advanced Technology Group has set up build procedures to transform the Xalan XML documentation to DITA, an extensible XML information typing architecture currently under development in IBM. After verifying that the DITA output conforms to its declared document type, the build publishes the DITA documentation set as HTML and as PDF.

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

stylesheets
xslt
document transformation
formatting objects


Design and simulation of a flexible beamforming interface for MIMO receivers using a Butler labyrinth This article focuses on the design and simulation of a new component for analog beamforming based on the Butler labyrinth. The proposed component enables the analysis of four-antenna beamforming in systems with two receive channels. The problem was to design a component that would enable simulation of a MIMO receiver with an accurate account of the analog beam-former effects on the digital signal processing level. The entire process is describedfrom layout design to the final DSP level integration and simulation. The performance of the simulated Butler component is compared to that of an ideal, theoretical one. The differences in the results indicate the importance of taking into account the effects of the layout level design on the DSP simulation level. The new component proves valuable for the bottom-up approach in the design and simulation of a wireless system. 2011 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2011.

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

analog beamforming
butler labyrinth
mimo receiver
design and simulation


assessment and pruning of hierarchical model based clustering The goal of clustering is to identify distinct groups in a dataset. The basic idea of model-based clustering is to approximate the data density by a mixture model, typically a mixture of Gaussians, and to estimate the parameters of the component densities, the mixing fractions, and the number of components from the data. The number of distinct groups in the data is then taken to be the number of mixture components, and the observations are partitioned into clusters (estimates of the groups) using Bayes' rule. If the groups are well separated and look Gaussian, then the resulting clusters will indeed tend to be "distinct" in the most common sense of the word - contiguous, densely populated areas of feature space, separated by contiguous, relatively empty regions. If the groups are not Gaussian, however, this correspondence may break down; an isolated group with a non-elliptical distribution, for example, may be modeled by not one, but several mixture components, and the corresponding clusters will no longer be well separated. We present methods for assessing the degree of separation between the components of a mixture model and between the corresponding clusters. We also propose a new clustering method that can be regarded as a hybrid between model-based and nonparametric clustering. The hybrid clustering algorithm prunes the cluster tree generated by hierarchical model-based clustering. Starting with the tree corresponding to the mixture model chosen by the Bayesian Information Criterion, it progressively merges clusters that do not appear to correspond to different modes of the data density.

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

model-based clustering
density estimation
unimodality


Specifics of information retrieval for young users: A survey In this paper, we present the state of the art in the field of information retrieval that is relevant for understanding how to design information retrieval systems for children. We describe basic theories of human development to explain the specifics of young users, i.e., their cognitive skills, fine motor skills, knowledge, memory and emotional states in so far as they differ from those of adults. We derive the implications these differences have on the design of information retrieval systems for children. Furthermore, we summarize the main findings about childrens search behavior from multiple user studies. These findings are important to understand childrens information needs, their search strategies and usage of information retrieval systems. We also identify several weaknesses of previous user studies about childrens information-seeking behavior. Guided by the findings of these user studies, we describe challenges for the design of information retrieval systems for young users. We give an overview of algorithms and user interface concepts. We also describe existing information retrieval systems for children, in specific web search engines and digital libraries. We conclude with a discussion of open issues and directions for further research. The survey provided in this paper is important both for designers of information retrieval systems for young users as well as for researchers who start working in this field.

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


Enhanced thermoelectric performance of highly conductive poly(3,4-ethylenedioxythiophene)/carbon black nanocomposites for energy harvesting Synthesized 030% carbon black/PEDOT composites show high thermoelectric efficiency. PEDOT layer coating the filler has an affinity to help its dispersion into the matrix. Strong conductive network between filler and matrix improves electrical conductivity. The Seebeck coefficient remains almost constant with filler load. Small changes in thermal conductivity are attributed to the phonon scattering effect.

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


Are actresses better simulators than female students? The effects of simulation on prosodic modifications of infant- and foreigner-directed speech ? Previous research has used simulated interactions to investigate emotional and linguistic speech phenomena. Here, we evaluate the use of these simulated interactions by comparing speech addressed to imaginary speech partners produced by psychology students and actresses, to an existing study of natural speech addressed to genuine interaction partners. Simulated infant- (IDS), foreigner- (FDS) and adult-directed speech (ADS) was obtained from 10 female students and 10 female actresses. These samples were acoustically analysed and rated for positive vocal affect. Our results for affect for actresses and student speakers are consistent with previous findings using natural interactions, with IDS rated higher in positive affect than ADS/FDS, and ADS rated higher than FDS. In contrast to natural speech, acoustic analyses of IDS produced by student speakers revealed a smaller vowel space than ADS/FDS, with no significant difference between those adult conditions. In contrast to natural speech (IDS>ADS/FDS), the mean F0 of IDS was significantly higher than ADS, but not than FDS. Acoustic analyses of actress speech were more similar to natural speech, with IDS vowel space significantly larger than ADS vowel space, and with the mean FDS vowel space positioned between these two conditions. IDS mean F0 of the actress speakers was significantly higher than both ADS and FDS. These results indicate that training plays an important role in eliciting natural-like speech in simulated interactions, and that participants without training are less successful in reproducing such speech. Speech obtained from simulated interactions should therefore be used with caution, and level of experience and training of the speakers should be taken into account.

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


Computable representations for convex hulls of low-dimensional quadratic forms Let C be the convex hull of points {(1 x) ((1) x)(T) [x is an element of F subset of R(n)}. Representing or approximating C is a fundamental problem for global optimization algorithms based on convex relaxations of products of variables. We show that if 17 <= 4 and F is a simplex, then C has a computable representation in terms of matrices X that are doubly nonnegative (positive semidefinite and componentwise nonnegative). We also prove that if n = 2 and F is a box, then C has a representation that combines semidefiniteness with constraints on product terms obtained from the reformulation-linearization technique (RLT). The simplex result generalizes known representations for the convex hull of {(x(1), x(2), x(1)x(2)) vertical bar x is an element of F} when F subset of R(2) is a triangle, while the result for box constraints generalizes the well-known fact that in this case the RLT constraints generate the convex hull of ((x(1), x(2), x(1)x(2)) vertical bar x is an element of F}. When n = 3 and F is a box, we show that a representation for C can be obtained by utilizing the simplex result for n = 4 in conjunction with a triangulation of the 3-cube.

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

quadratic form
convex envelope
semidefinite programming


SnapShot: Visualization to Propel Ice Hockey Analytics Sports analysts live in a world of dynamic games flattened into tables of numbers, divorced from the rinks, pitches, and courts where they were generated. Currently, these professional analysts use R, Stata, SAS, and other statistical software packages for uncovering insights from game data. Quantitative sports consultants seek a competitive advantage both for their clients and for themselves as analytics becomes increasingly valued by teams, clubs, and squads. In order for the information visualization community to support the members of this blossoming industry, it must recognize where and how visualization can enhance the existing analytical workflow. In this paper, we identify three primary stages of today's sports analyst's routine where visualization can be beneficially integrated: 1) exploring a dataspace; 2) sharing hypotheses with internal colleagues; and 3) communicating findings to stakeholders. Working closely with professional ice hockey analysts, we designed and built SnapShot, a system to integrate visualization into the hockey intelligence gathering process. SnapShot employs a variety of information visualization techniques to display shot data, yet given the importance of a specific hockey statistic, shot length, we introduce a technique, the radial heat map. Through a user study, we received encouraging feedback from several professional analysts, both independent consultants and professional team personnel.

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

visual knowledge discovery
visual knowledge representation
hypothesis testing
visual evidence
human computer interaction


Multi-Fault Tolerance for Cartesian Data Distributions Faults are expected to play an increasingly important role in how algorithms and applications are designed to run on future extreme-scale systems. Algorithm-based fault tolerance is a promising approach that involves modifications to the algorithm to recover from faults with lower overheads than replicated storage and a significant reduction in lost work compared to checkpoint-restart techniques. Fault-tolerant linear algebra algorithms employ additional processors that store parities along the dimensions of a matrix to tolerate multiple, simultaneous faults. Existing approaches assume regular data distributions (blocked or block-cyclic) with the failures of each data block being independent. To match the characteristics of failures on parallel computers, we extend these approaches to mapping parity blocks in several important ways. First, we handle parity computation for generalized Cartesian data distributions with each processor holding arbitrary subsets of blocks in a Cartesian-distributed array. Second, techniques to handle correlated failures, i.e., multiple processors that can be expected to fail together, are presented. Third, we handle the colocation of parity blocks with the data blocks and do not require them to be on additional processors. Several alternative approaches, based on graph matching, are presented that attempt to balance the memory overhead on processors while guaranteeing the same fault tolerance properties as existing approaches that assume independent failures on regular blocked data distributions. Evaluation of these algorithms demonstrates that the additional desirable properties are provided by the proposed approach with minimal overhead.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O 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 tolerant linear algebra
checksums
data distribution


AIR application for reliability analysis considering debugging process and network traffic in mobile clouds Mobile clouds are used by many people via a network service to share the computing resources, because of the unification management of data and low cost. In case of the mobile device, the network access devices are frequently used by many software installed via the installer software. Considering the effect of the debugging process on mobile software in the development of a method of reliability assessment for the mobile clouds, it is necessary to grasp the situation of installer software, the network traffic, the installed software, etc. In this paper, we develop an integrated method of reliability assessment considering the software failure and network traffic based on a hazard rate model and neural network for the mobile clouds. In particular, we develop the AIR application for reliability analysis based on the proposed method. Then, we show the performance examples of the developed AIR application to analyze the method of software reliability assessment for the mobile clouds.

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

stochastic modeling
software tool
open source software


ftl design exploration in reconfigurable high-performance ssd for server applications Solid-state disks (SSDs) are becoming widely used in personal computers and are expected to replace a great portion of magnetic disks in servers and supercomputers. Although many high-speed SSDs are present in the market, both the design of hardware architecture and the details of the flash translation layer (FTL) are not well known. Meanwhile, in the systems requiring high-end storages, specially tuned SSDs can perform better than the generic ones, because the applications in such environment are usually fixed. Based on the architectural design of our reconfigurable high-performance SSD prototype and by using a trace-driven simulator, we explore the key factors and tradeoffs that must be considered when designing a customized FTL. FTL related issues, such as data allocation, cleaning, and wear leveling, are analyzed in detail presenting suitable design decisions for different workload characteristics. The experimental result shows that the figures for the performance metrics will vary from several percent to more than tens of times among each other depending on the decision made for designing each FTL functionality.

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

nand flash memory
solid state disk
high performance ssd


Estimating Haplotype Frequencies by Combining Data from Large DNA Pools with Database Information We assume that allele frequency data have been extracted from several large DNA pools, each containing genetic material of up to hundreds of sampled individuals. Our goal is to estimate the haplotype frequencies among the sampled individuals by combining the pooled allele frequency data with prior knowledge about the set of possible haplotypes. Such prior information can be obtained, for example, from a database such as HapMap. We present a Bayesian haplotyping method for pooled DNA based on a continuous approximation of the multinomial distribution. The proposed method is applicable when the sizes of the DNA pools and/or the number of considered loci exceed the limits of several earlier methods. In the example analyses, the proposed model clearly outperforms a deterministic greedy algorithm on real data from the HapMap database. With a small number of loci, the performance of the proposed method is similar to that of an EM-algorithm, which uses a multinormal approximation for the pooled allele frequencies, but which does not utilize prior information about the haplotypes. The method has been implemented using Matlab and the code is available upon request from the authors.

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

dna pools
hapmap database
multinomial distribution


Linear kernelizations for restricted 3-Hitting Set problems In this paper, we study the 3-HITTING SET problem, also called the VERTEX COVER problem on 3-uniform hypergraphs. We provide linear kernelizations for this problem and its dual problem in three types of 3-uniform hypergraphs. Moreover, we obtain lower bounds on the kernel size for them by the parametric duality technique. (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

computational complexity
3-hitting set problem
kernelization


Fractional differential repetitive processes with RiemannLiouville and Caputo derivatives In the paper, we study differential repetitive processes with fractional RiemannLiouville and Caputo derivatives, in the context of the existence, uniqueness and continuous dependence of solutions on controls. Some applications to controllabilty of such processes are given as well.

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

riemannliouville derivative
caputo derivative
differential repetitive process
reachable set


on locally minimal nullstellensatz proofs Hilbert's weak Nullstellensatz guarantees the existence of algebraic proof objects certifying the unsatisfiability of systems of polynomial equations not satisfiable over any algebraically closed field. Such proof objects take the form of ideal membership identities and can be found algorithmically using Grbner bases and cofactor-based linear algebra techniques. However, these proof objects may contain redundant information: a proper subset of the equational assumptions used in these proofs may be sufficient to derive the unsatisfiability of the original polynomial system. For using Nullstellensatz techniques in SMT-based decision methods, a minimal proof object is often desired. With this in mind, we introduce a notion of locally minimal Nullstellensatz proofs and give ideal-theoretic algorithms for their construction.

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

gr&ouml
bner bases
non-linear arithmetic
automated reasoning
formal proofs
smt
decision procedures
satisfiability modulo theories
computer algebra


Locating agreement in grammar: an argument from agreement in conjunctions In Hindi-Urdu, T(ense) can agree with non-overtly case-marked subjects or objects. Despite being controlled by the same head and being sensitive to the same morphological properties of the agreement target, agreement inside conjunction structures reveals differences between subjects and objects: agreement with objects is sensitive to linear proximity, while agreement with subjects is not. This difference shows itself in two sets of conjunction structures: agreement with conjoined subjects and objects, and agreement in Right Node Raising. This difference between agreement with co-ordinated subjects and objects is addressed in terms of two questions: why does object agreement not access the same features as subject agreement, and how does it access the features of the closest NP in the coordinated object. We argue that the answers to these questions show that agreement is largely syntactic, but that post-syntactic processes can be recruited for agreement when syntactic processes have failed to value agreement in the syntax. The inaccessibility of certain features to agreement with objects follows from Bhatts (2005) proposal that agreement with subjects assigns case, but agreement with objects is agreement with an already case-licensed argument. While T-agreement can access the ?-features of subjects, case assignment to the object prior to T-agreement deactivates the objects ?-features so that T can match their features but is not valued by them. Post-syntactic processes use the matching relation between T and the inactive features of objects to retrieve values for T. This process is sensitive to linear proximity.

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

closest conjunct agreement
post-syntactic processes
hindi-urdu


Cardiac myocyte force development during differentiation and maturation The maturation of cardiac myocytes during the immediate prenatal period coincides with changes in the mechanical properties of the extracellular matrix. We investigated the effects of extracellular stiffness on cardiomyocyte maturation in neonatal rat ventricular myocytes grown on collagen-coated gels. Cells on 10-kPa substrates developed aligned sarcomeres, while cells on stiffer substrates had unaligned sarcomeres and stress fibers. Cells generated greater mechanical force on gels with stiffness similar to that of the native myocardium than on stiffer or softer substrates. To investigate the differentiation of myocyte progenitors, we used clonal expansion of engineered human embryonic stem cells. Puromycin-selected cardiomyocytes exhibited a gene expression profile similar to that of adult human cardiomyocytes and generated force and action potentials consistent with normal fetal cardiomyocytes. These results suggest that extracellular stiffness significantly affects maturation and differentiation of immature ventricular myocytes.

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

mechanotransduction
substrate stiffness
gel
stem cell


Generalized fractional minimax programming with B-(p,r) B - ( p , r ) -invexity Optimality conditions are proved for a class of generalized fractional minimax programming problems involving B-(p,r) B - ( p , r ) -invexity functions. Subsequently, these optimality conditions are utilized as a basis for constructing various duality models for this type of fractional programming problems and proving appropriate duality theorems.

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

fractional programming
optimality conditions
duality

b-(p
r) b - ( p
r ) -invex function b-(p
r ) b-(p
r ) b - ( p
r )


BIOMODULE: a Java program to help model and interpret the stratigraphic record ? A combination of a stratigraphic simulation package (STRATA) and an evolutionary-ecological model (BIOSTRAT) can be used to simulate the distribution of species within a sequence stratigraphic framework. BIOMODULE is an extension of this model approach in that it facilitates the visualization and interpretation of those simulations and their input data. Environmental factors (e.g., sea-level changes or sedimentation rates) and ecological factors (preferred water depth, depth tolerance, abundance) that determine the spatial and temporal distribution of species are easily and quickly investigated. In addition, BIOMODULE can be used to compile the stratigraphic first and last appearances of those species and export them into available graphic correlation software packages (Conop9 and GraphCor). This can be used to test the graphic correlation technique and investigate its accuracy and precision under a range of different conditions (e.g., different stratigraphic architectures and sampling densities) since the true correlation of the different sections is already known.

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

biostratigraphy
stratigraphy
computer simulation


Data assimilation of ozone in the atmospheric transport chemistry model LOTOS Modelled ozone concentrations often differ from measured concentrations quite substantially, partly due to measurement errors, but mainly due to uncertainties in the model. Modelling studies would therefore benefit highly from more reliable model simulations. One way to achieve this is the application of data assimilation, a technique that uses measurement information within the model simulation in a way that is consistent with the model itself. This aim of this paper is to show that this is indeed one way to go with atmospheric transport chemistry models (ATCMs) by presenting results of data assimilation simulations of ozone with the model LOTOS. The assimilation technique used in this study is the Ensemble Kalman Filter. A simulation for a period of 4 weeks has been performed in which ground-level ozone measurements have been assimilated. The necessary noise input consisted of uncertainties in the emissions of NOx, SOx, VOC and CO in 17 groups of countries. The main conclusion is that it is possible to improve ATCM simulations of ozone by data assimilation, but that noise inputs other than emissions only are essential for the reduction of the differences between measured and modelled concentrations to acceptable margins. (C) 2000 Elsevier Science Ltd. All rights reserved.

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


Identical projective geometric properties of central catadioptric line images and sphere images with applications to calibration Central catadioptric cameras are imaging devices that use mirrors to enhance the field of view while preserving a single effective viewpoint. Lines and spheres in space are all projected into conics in the central catadioptric image planes, and such conics are called line images and sphere images, respectively. We discovered that there exists an imaginary conic in the central catadioptric image planes, defined as the modified image of the absolute conic (MIAC), and by utilizing the MIAC, the novel identical projective geometric properties of line images and sphere images may be exploited: Each line image or each sphere image is double-contact with the MIAC, which is an analogy of the discovery in pinhole camera that the image of the absolute conic (IAC) is double-contact with sphere images. Note that the IAC also exists in the central catadioptric image plane, but it does not have the double-contact properties with line images or sphere images. This is the main reason to propose the MIAC. From these geometric properties with the MIAC, two linear calibration methods for central catadioptric cameras using sphere images as well as using line images are proposed in the same framework. Note that there are many linear approaches to central catadioptric camera calibration using line images. It seems that to use the properties that line images are tangent to the MIAC only leads to an alternative geometric construction for calibration. However, for sphere images, there are only some nonlinear calibration methods in literature. Therefore, to propose linear methods for sphere images may be the main contribution of this paper. Our new algorithms have been tested in extensive experiments with respect to noise sensitivity.

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

catadioptric camera
line image
sphere image

omnidirectional vision
camera calibration
double-contact theorem


Optical monitoring of neural networks evoked by focal electrical stimulation on microelectrode arrays using FM dyes Patchclamping or microelectrode arrays (MEA) are conventional methods to monitor the electrical activity in biological neural networks in vitro. Despite the effectiveness of these techniques, there are disadvantages including the limited number of electrodes and the predetermined location of electrodes in MEAs. In particular, these drawbacks raise a difficulty in monitoring a number of neurons outnumbering the electrodes. Here, we propose an optical technique to determine the effective range of focal electrical stimulation using FM dyes in neural networks grown on planar-type MEAs. After 3weeks in culture, electrical stimulation was delivered to neural networks via an underlying electrode in the presence of FM dyes. The stimulation induced the internalization of the dye into the neurons around the stimulating electrodes. Fluorescent images of dye distribution successfully showed the effects of focal stimulation. A range of stimulus amplitudes and frequencies were examined to collect fluorescence images. FM-dye uptake after electrical stimulation resulted in the labeling of cells up to approximately 300?m away from the stimulating electrode. Fluorescence intensity increased proportionally to stimulation amplitude. Tetrodotoxin was shown to inhibit the labeling of neurons except those located immediately adjacent (within 40?m) from the stimulating electrode. In the presence of AMPA and NMDA receptors antagonists, the FM-dye labeling appeared within 80?m from the electrode, indicating directly evoked neural networks via blocking of glutamatergic synaptic transmission. These results showed that FM dyes can be a useful tool for monitoring activity-dependent synaptic events and determining the effect of focal stimulation in cultured neural networks.

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

neural network
fm dye
microelectrode array


semantic term matching in axiomatic approaches to information retrieval A common limitation of many retrieval models, including the recently proposed axiomatic approaches, is that retrieval scores are solely based on exact (i.e., syntactic) matching of terms in the queries and documents, without allowing distinct but semantically related terms to match each other and contribute to the retrieval score. In this paper, we show that semantic term matching can be naturally incorporated into the axiomatic retrieval model through defining the primitive weighting function based on a semantic similarity function of terms. We define several desirable retrieval constraints for semantic term matching and use such constraints to extend the axiomatic model to directly support semantic term matching based on the mutual information of terms computed on some document set. We show that such extension can be efficiently implemented as query expansion. Experiment results on several representative data sets show that, with mutual information computed over the documents in either the target collection for retrieval or an external collection such as the Web, our semantic expansion consistently and substantially improves retrieval accuracy over the baseline axiomatic retrieval model. As a pseudo feedback method, our method also outperforms a state-of-the-art language modeling feedback method.

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

constraints
use
web
query expansion
mutual information
paper
model
feedback
method
accuracy
semantic
matching
retrieval
data
queries
support

collect
extensibility
experience
art
language modelling
axiomatic model
retrieval heuristics
functional
documentation
retrieval model
semantic-similarity
information retrieval


Conformational analysis of tetracycline using molecular mechanical and semiempirical MO-calculations A combination of gas phase molecular dynamics and systematic conformational searches with semiempirical MO-theory has been used to identify and characterise the low energy conformations of tetracycline in its neutral non-polar and zwitterionic forms and as the deprotonated zwitteranion. The conformations found have been characterised by cluster- and principal components analyses as belonging to three main groups. These are very similar for the nonpolar and zwitterionic neutral forms of tetracycline, but very different for the anion. The likely consequences of the conformational flexibilty for metal ion complexation by tetracycline are discussed.

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

molecular dynamics simulations
semiempirical mo-calculations


About using the Dirichlet boundary conditions in heat transfer equation solved lay finite element method In the variational approach for heat equation, the Newmann, convection and radiation B.C. are already built in this expression. The Dirichlet (imposed temperature) must be applied after the matrix formulation was derived, for the analyzed system. This paper presents a study about the performances (precision and execution speed) using different methods to input the Dirichlet BC. These estimations are made on program which uses triangular elements, to solve the heat equation.

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

heat transfer
dirichlet boundary conditions
finite element


StarLogo under the hood and in the classroom StarLogo is a computer modeling tool that empowers students to understand the world through the design and creation of complex systems models. StarLogo enables students to program software creatures to interact with one another and their environment, and study the emergent patterns from these interactions. Building an easy-to-understand, yet powerful tool for students required a great deal of thought about the design of the programming language, environment, and its implementation. The salient features are StarLogo's great degree of transparency (the capability to see how a simulation is built), its support to let students create their own models (not just use models built by others), its efficient implementation (supporting simulations with thousands of independently executing creatures on desktop computers), and its flexible and simple user interface (which enables students to interact dynamically with their simulation during model testing and validation). The resulting platform provides a uniquely accessible tool that enables students to become full-fledged practitioners of modeling. In addition, we describe the powerful insights and deep scientific understanding that students have developed through the use of StarLogo.

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

computer simulation
adaptive systems
cybernetics
software development


Bison: bisulfite alignment on nodes of a cluster DNA methylation changes are associated with a wide array of biological processes. Bisulfite conversion of DNA followed by high-throughput sequencing is increasingly being used to assess genome-wide methylation at single-base resolution. The relative slowness of most commonly used aligners for processing such data introduces an unnecessarily long delay between receipt of raw data and statistical analysis. While this process can be sped-up by using computer clusters, current tools are not designed with them in mind and end-users must create such implementations themselves.

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


Identification of an integrated mathematical model of standard oral glucose tolerance test for characterization of insulin potentiation in health Two new formulations, respectively denominated INT_M1 and INT_M2, of an integrated mathematical model to describe the glycemic and insulinemic responses to a 75g oral glucose tolerance test (OGTT) are proposed and compared. The INT_M1 assumes a single compartment for the intestine and the derivative of a power exponential function for the gastric emptying rate, while, in the INT_M2, a nonlinear three-compartment system model is adopted to produce a more realistic, multiphase gastric emptying rate. Both models were implemented in a Matlab-based, two-step procedure for estimation of seven adjustable coefficients characterizing the gastric emptying rate and the incretin, insulin and glucose kinetics. Model behaviour was tested vs. mean plasma glucagon-like peptide 1 (GLP-1), glucose-dependent insulinotropic polypeptide (GIP), glucose and insulin measurements from two different laboratories, where glycemic profiles observed during a 75g OGTT were matched in healthy subjects (HC1- and HC2-group, respectively) by means of an isoglycemic intravenous glucose (I-IVG) infusion. Under the hypothesis of an additive effect of GLP-1 and GIP on insulin potentiation, our results demonstrated a substantial equivalence of the two models in matching the data. Model parameter estimates showed to be suitable markers of differences observed in the OGTT and matched I-IVG responses from the HC1-group compared to the HC2-group. Model implementation in our two-step parameter estimation procedure enhances the possibility of a prospective application for individualization of the incretin effect in a single subject, when his/her data are plugged in.

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

gastric emptying
gip
incretin effect
parameter estimation

glucose-insulin system
oral glucose absorption
glp-1


The lifecontingencies Package: Performing Financial and Actuarial Mathematics Calculations in R It is possible to model life contingency insurances with the life contingencies R package, which is capable of performing financial and actuarial mathematics calculations. Its functions permit one to determine both the expected value and the stochastic distribution of insured bene fits. Therefore, life insurance coverage can be priced and portfolios risk-based capital requirements can be assessed. This paper briefly summarizes the theory regarding life contingencies that is based on financial mathematics and demographic concepts. Then, with the aid of applied examples, it shows how the lifecontingencies package can be a useful tool for executing routine, deterministic, or stochastic calculations for life-contingencies actuarial mathematics.

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

financial mathematics
actuarial mathematics
life insurance


The traffic phases of road networks We study the relation between the average traffic flow and the vehicle density on road networks that we call 2D-traffic fundamental diagram. We show that this diagram presents mainly four phases. We analyze different cases. First, the case of a junction managed with a priority rule is presented, four traffic phases are identified and described, and a good analytic approximation of the fundamental diagram is obtained by computing a generalized eigenvalue of the dynamics of the system. Then, the model is extended to the case of two junctions, and finally to a regular city. The system still presents mainly four phases. The role of a critical circuit of non-priority roads appears clearly in the two junctions case. In Traffic control, we use traffic light controls to improve the traffic diagram. We present the improvements obtained by open-loop, local feedback, and global feedback strategies. A comparison based on the response times to reach the stationary regime is also given. Finally, we show the importance of the design of the junction. It appears that if the junction is enough large, the traffic is almost not slowed down by the junction.

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

fundamental diagram of 2d-traffic
microscopic traffic modeling


Finite time stability of periodic solution for Hopfield neural networks with discontinuous activations ? Based on the tangency or non-tangency of the periodic solution to certain surface, this paper gives a set of conditions ensuring global convergence in finite time toward a unique periodic solution for Hopfield neural networks with discontinuous activations. Moreover, two numerical examples are provided to illustrate the theoretical results.

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


blitz: a rule-based system for massively parallel architectures The rule-based system has emerged as an important tool to developers of artificial intelligence programs. Because of the computational resources required to realize the MATCH-SELECT-EXECUTE cycle of rule-based systems, researchers have been trying to introduce parallelism into these systems for some time. We describe a new approach to parallel rule-based systems which exploits fine-grained hypercube hardware. The new algorithms for parallel rule matching and simultaneous execution of several rules at once are presented. Experimental results using a Connection Machine* implementation of BLITZ are presented.

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

systems intelligence parallel implementation matching tool hardware hypercube connection rules

select
program
research
experimentation
rule based system
exploit
developer
computation
timing
algorithm
parallel architecture
resource


Measures for mobile users: an architecture Software measures are important to evaluate software properties like complexity, reusability, maintainability, effort required, etc. Collecting such data is difficult because of the lack of tools that perform acquisition automatically. It is not possible to implement a manual data collection because it is error prone and very time expensive. Moreover, developers often work in teams and sometimes in different places using laptops. These conditions require tools that collect data automatically, can work offline and merge data from different developers working in the same project. This paper presents PROM (PRO Metrics), a distributed Java based tool designed to collect automatically software measures. This tool uses a distributed architecture based on plug-ins, integrated in most popular development tools, and the SOAP communication protocol.

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

development monitoring
process metrics
product metrics


Modelling vertical error in LiDAR-derived digital elevation models A hybrid theoreticalempirical model has been developed for modelling the error in LiDAR-derived digital elevation models (DEMs) of non-open terrain. The theoretical component seeks to model the propagation of the sample data error (SDE), i.e. the error from light detection and ranging (LiDAR) data capture of ground sampled points in open terrain, towards interpolated points. The interpolation methods used for infilling gaps may produce a non-negligible error that is referred to as gridding error. In this case, interpolation is performed using an inverse distance weighting (IDW) method with the local support of the five closest neighbours, although it would be possible to utilize other interpolation methods. The empirical component refers to what is known as information loss. This is the error purely due to modelling the continuous terrain surface from only a discrete number of points plus the error arising from the interpolation process. The SDE must be previously calculated from a suitable number of check points located in open terrain and assumes that the LiDAR point density was sufficiently high to neglect the gridding error. For model calibration, data for 29 study sites, 200200m in size, belonging to different areas around Almeria province, south-east Spain, were acquired by means of stereo photogrammetric methods. The developed methodology was validated against two different LiDAR datasets. The first dataset used was an Ordnance Survey (OS) LiDAR survey carried out over a region of Bristol in the UK. The second dataset was an area located at Gador mountain range, south of Almera province, Spain. Both terrain slope and sampling density were incorporated in the empirical component through the calibration phase, resulting in a very good agreement between predicted and observed data (R2=0.9856;p<0.001 R 2 = 0.9856 ; p < 0.001 ). In validation, Bristol observed vertical errors, corresponding to different LiDAR point densities, offered a reasonably good fit to the predicted errors. Even better results were achieved in the more rugged morphology of the Gador mountain range dataset. The findings presented in this article could be used as a guide for the selection of appropriate operational parameters (essentially point density in order to optimize survey cost), in projects related to LiDAR survey in non-open terrain, for instance those projects dealing with forestry applications.

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

vertical accuracy assessment
spatial modelling
topographic mapping