Multi-symplectic integration of the Camassa-Holm equation The Camassa-Holm equation is rich in geometric structures, it is completely integrable, bi-Hamiltonian, and it represents geodesics for a certain metric in the group of diffeomorphism. Here two new multi-symplectic formulations for the Camassa-Holm equation are presented, and the associated local conservation laws are shown to correspond to certain well-known Hamiltonian functionals. The multi-symplectic discretisation of each formulation is exemplified by means of the Euler box scheme. Numerical experiments show that the schemes have good conservative properties, and one of them is designed to handle the conservative continuation of peakon-antipeakon collisions. (c) 2008 Elsevier Inc. 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 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 I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

camassa-holm equation
multi-symplecticity
peakon-antipeakon collisions


On the Linear Ranking Problem for Integer Linear-Constraint Loops In this paper we study the complexity of the Linear Ranking problem: given a loop, described by linear constraints over a finite set of integer variables, is there a linear ranking function for this loop? While existence of such a function implies termination, this problem is not equivalent to termination. When the variables range over the rationals or reals, the Linear Ranking problem is known to be PTIME decidable. However, when they range over the integers, whether for single-path or multipath loops, the complexity of the Linear Ranking problem has not yet been determined. We show that it is coNP-complete. However, we point out some special cases of importance of PTIME complexity. We also present complete algorithms for synthesizing linear ranking functions, both for the general case and the special PTIME cases.

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

ranking functions
termination
linear constraints


Development of a new porous pin chuck for lithography The feature size for next-generation devices is decreasing and edge exclusion widths are becoming stricter, decreasing from 2 to 1.5mm. The development of a new porous pin chuck is thus necessary for flattening large wafers, including the periphery, which has small and extremely low pins. A reverse production process from the conventional method was adopted to form pins after careful polishing of the chuck surface. It is now possible to both measure and achieve a high level of flatness for pin chucks, while reducing vacuum leakage. Average pin heights were 33?m in the suction region and 5?m in the static-pressure seal. The uniformity of pin heights in the seal was improved compared with the conventional static-pressure-seal pin chuck. In addition, the contact ratio between the back surface of a wafer and the pin tops was reduced to 25% that of conventional static-pressure-seal pin chucks by using pins with smaller diameters and porous material.

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

porous material
porous pin chuck
contact ratio

vacuum pin chuck
wafer flatness
alumina ceramic
static-pressure seal


conformal virtual colon flattening We present an efficient colon flattening algorithm using a conformal structure, which is angle-preserving and minimizes the global distortion. Moreover, our algorithm is general as it can handle high genus surfaces. First, the colon wall is segmented and extracted from the CT data set of the abdomen. The topology noise (i.e., minute handle) is located and removed automatically. The holomorphic 1-form, a pair of orthogonal vector fields, is then computed on the 3D colon surface mesh using the conjugate gradient method. The colon surface is cut along a vertical trajectory traced using the holomorphic 1-form. Consequently, the 3D colon surface is conformally mapped to a 2D rectangle. The flattened 2D mesh is then rendered using a direct volume rendering method accelerated with the GPU. Our algorithm is tested with a number of CT data sets of real pathological cases, and gives consistent results. We demonstrate that the shape of the polyps is well preserved on the flattened colon images, which provides an efficient way to enhance the navigation of a virtual colonoscopy system.

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

virtual colonoscopy
direct volume rendering


Donald Schn, Herbert Simon and The Sciences of the Artificial In this paper, I examine Schn's criticism of Herbert Simon's instrumentalist theory of design and conclude that Schn's evaluation of Simon's theory of design, based on the first edition of The Sciences of the Artificial, overlooks many open-ended constructivist trajectories. By exploring later editions of The Sciences of the Artificial, the hope is to correct the misconception that Simon's substantive theory of design had very little to contribute to research studies in designerly ways of knowing.

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

reflective practice
design history
philosophy of design
design cognition
logic of design


Scaling the System Capacity and Reach of a 10G-TDM-OCDM-PON System Without an En/Decoder at an ONU To realize high scaling of a 10-Gbps-class optical access system, we propose and demonstrate two different long-reach hybrid multiplexing passive optical network (PON) systems. First, we demonstrate good scalability in the ultimate transmission distance over 100 km single-mode fiber without dispersion compensation of a 10G wavelength division multiplexing (WDM)-time division multiplexing (TDM)-optical code division multiplexing (OCDM) PON system. Second, we also demonstrate a 100 km 10G/1G-TDM-OCDM-PON system for the purpose of the scalability of the current mixed GE-PON and 10G-EPON system.

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

optical code division multiplexing (ocdm)


Design of efficient Java message-passing collectives on multi-core clusters This paper presents a scalable and efficient Message-Passing in Java (MPJ) collective communication library for parallel computing on multi-core architectures. The continuous increase in the number of cores per processor underscores the need for scalable parallel solutions. Moreover, current system deployments are usually multi-core clusters, a hybrid shared/distributed memory architecture which increases the complexity of communication protocols. Here, Java represents an attractive choice for the development of communication middleware for these systems, as it provides built-in networking and multithreading support. As the gap between Java and compiled languages performance has been narrowing for the last years, Java is an emerging option for High Performance Computing (HPC). Our MPJ collective communication library increases Java HPC applications performance on multi-core clusters: ( I) providing multi-core aware collective primitives; (2) implementing several algorithms (up to six) per collective operation, whereas publicly available MPJ libraries are usually restricted to one algorithm; (3) analyzing the efficiency of thread-based collective operations; (4) selecting at runtime the most efficient algorithm depending on the specific multi-core system architecture, and the number of cores and message length involved in the collective operation; (5) supporting the automatic performance tuning of the collectives depending on the system and communication parameters; and (6) allowing its integration in any MPJ implementation as it is based on MPJ point-to-point primitives. A performance evaluation on an InfiniBand and Gigabit Ethernet multi-core cluster has shown that the implemented collectives significantly outperform the original ones, as well as higher speedups when analyzing the impact of their use on collective communications intensive Java HPC applications. Finally, the presented library has been successfully integrated in MPJ Express (http://mpj-express.org), and will be distributed with the next release.

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

high performance computing performance evaluation


Stability analysis for linear discretisations of the advection equation with Runge-Kutta time integration For the 1-dim. linear advection problem stability limits of Runge-Kutta (RK) methods from 1st to 7th order in combination with upwind or centered difference schemes from 1st to 6th order are presented. The analysis can be carried out in a rather general way by introduction of a broad class of Runge-Kutta methods, here called 'Linear Case Runge-Kutta (LC-RK)' methods, which behave completely similar for linear, time-independent and homogeneous ODE-systems and contain the 'classical' order = stage RK methods. The set of conditions for the coefficients of these LC-RK-schemes could be derived explicitly for arbitrary order N. From an efficiency viewpoint the LC-RK 3rd order methods in combination with upwind 3rd or 5th order or the LC-RK 4th order scheme with 4th order centered difference advection are a good choice. The analysis can be extended easily to multidimensional splited advection for which a necessary stability condition is presented. (C) 2008 Elsevier Inc. All rights reserved.

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

runge-kutta methods
linear stability analysis
von-neumann stability


efficient distributed simulation of a communication switch with bursty sources and losses Algorithms for simulating an ATM switch on a distributed memory multiprocessor are described. These include parallel generation of bursty arrival streams, along with the marking and deleting of lost cells due to buffer overflows. These algorithms increase the amount of computation carried out independently by each processor, and reduce the communication between the processors. When the number of cells lost is relatively small, the run time of the simulation is approximately O ( N/P ), where N is the total number of cells simulated and P is the number of processors. The cells are processed in intervals of fixed length; that length affects the structure and the performance of the algorithms.

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

processor communication generation structure simulation parallel performance computation switch distributed multiprocessor

affect
interval
efficiency
memorialized
buffer overflow
timing
distributed simulation
algorithm


towards billion-bit optimization via a parallel estimation of distribution algorithm This paper presents a highly efficient, fully parallelized implementation of the compact genetic algorithm (cGA) to solve very large scale problems with millions to billions of variables. The paper presents principled results demonstrating the scalable solution of a difficult test function on instances over a billion variables using a parallel implementation of cGA. The problem addressed is a noisy, blind problem over a vector of binary decision variables. Noise is added equaling up to a tenth of the deterministic objective function variance of the problem, thereby making it difficult for simple hillclimbers to find the optimal solution. The compact GA, on the other hand, is able to find the optimum in the presence of noise quickly, reliably, and accurately, and the solution scalability follows known convergence theories. These results on noisy problem together with other results on problems involving varying modularity, hierarchy, and overlap foreshadow routine solution of billion-variable problems across the landscape of search problems.

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

population sizing
billion-variable optimization
large-scale optimization
parallelization
efficiency enhancement
vectorization
convergence time
scalability analysis


Real-time synchronization of batch trajectories for on-line multivariate statistical process control using Dynamic Time Warping This paper addresses the real-time monitoring of batch processes with multiple different local time trajectories of variables measured during the process run. For Unfold Principal Component Analysis (U-PCA)-or Unfold Partial Least Squares (U-PLS)-based on-line monitoring of batch processes, batch runs need to be synchronized, not only to have the same time length, but also such that key events happen at the same time. An adaptation from Kassidas et al's approach [1] will be introduced to achieve the on-line synchronization of batch trajectories using the Dynamic Time Warping (DTW) algorithm. In the proposed adaptation, a new boundaries definition is presented for accurate on-line synchronization of an ongoing batch, together with a way to adapt mapping boundaries to batch length. A relaxed greedy strategy is introduced to avoid assessing the optimal path each time a new sample is available. The key advantages of the proposed strategy are its computational speed and accuracy for the batch process context. Data from realistic simulations of a fermentation process of the Saccharomyces cerevisae cultivation are used to illustrate the performance of the proposed strategy. (C) 2011 Elsevier B.V. All rights reserved.

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


A graph theoretical method for frontwidth reduction A graph theoretical approach is designed for element renumbering of finite element meshes for frontwidth reduction of sparse matrices with symmetric structures. In this heuristic, the problem is transformed into that of a graph nodal ordering. The incidence graph of a mesh is used for representing its connectivity. The efficiency of the method is illustrated through worst-case analysis and examples of unstructured finite element models.

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

finite elements
heeled shortest route tree
graph theory
complexity analysis


Generic NDT mapping in dynamic environments and its application for lifelong SLAM ? We present a new mapping approach that combines normal distribution transform (NDT) and occupancy mapping. The mapping approach is fully generic and suitable for 2D and 3D mapping with different sensors. We describe a method for detecting and handling dynamic objects to allow mapping in highly dynamic environments. Based on the mapping algorithm a graph based SLAM algorithm is described. The presented SLAM approach allows lifelong mapping and localization in real world applications.

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

lifelong slam
2d and 3d mapping
normal distribution transform
occupancy mapping

detection and tracking of moving objects


Generalized Poisson Integral Formula applied to potential flow solutions for free and confined jets with secondary flow A generalized form of the Poisson Integral Formula is presented and applied to obtain a new class of two-dimensional, incompressible, potential flowfield solutions for free and confined jets. Two basic configurations are considered that demonstrate the procedure, a jet issuing from a straight wall or flowing from a semi-infinite, constant area duct. In either case the jet can be free or confined, with or without uniform external flow. A discretized form of the Poisson Integral Formula is also presented so that arbitrary boundary value distributions (i.e., boundary conditions) can be handled, including those with functional and/or slope discontinuities. The procedure makes use of conformal mapping and complex variable theory so that jet flowfield determination is reduced to solution of a boundary value problem on a simple domain (i.e., upper half-plane). The entire velocity field is described analytically; stream function and velocity potential contour maps are readily constructed. These solutions can serve as the zero-order inviscid outer solution (replacing the usual assumption of uniform or quiescent outer flow) in a matched asymptotic expansion process whereby viscous effects are introduced near the jet axis by means of a boundary-layer-type analysis. A number of example solutions are presented, most without any form of singularity in the flowfield as a result of having the freedom to arbitrarily select boundary conditions. Solutions are also presented having separation and recirculation regions adjacent to sharp jet exit corners. Several additional examples of the generalized Poisson Integral Formula applied to other types of problems are also described, including periodic boundary distributions and distributions having discontinuities. (C) 2011 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

boundary value problems
potential equation
inviscid jet flow


Face Detection using Representation Learning Face representation is a crucial step of face detection system. In this paper, we present a fast face detection algorithm based on representation learnt using convolutional neural network (CNN) so as to explicitly capture various latent facial features. Firstly, in order to improve the speed of detection in the system, we train an Adaboost background filter which can remove the background most quickly. Secondly, we use the CNN to extract more distinctive features for those face and non-face patterns that have not been filtered by Adaboost. CNN can automatically learn and synthesize a problem-specific feature extractor from a training set, without making any assumptions or using any hand-made design concerning the features to extract or the areas of the face pattern to analyze. Finally, support vector machines (SVM) is used to detect instead of using the classification function of CNN itself. Extensive experiments demonstrate the robustness and efficiency of our system by comparing it with several popular face detection algorithms on the widely used CMU+MIT frontal face dataset and FDDB dataset.

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

face detection
convolutional neural network
adaboost


Accurate 3D-vision-based obstacle detection for an autonomous train In this paper we present a 3D-vision based obstacle detection system for an autonomously operating train in open terrain environments. The system produces dense depth data in real-time from a stereo camera system with a baseline of 1.4 m to fulfill accuracy requirements for reliable obstacle detection 80 m ahead. On an existing high speed stereo engine, several modifications have been applied to significantly improve the overall performance of the system. Hierarchical stereo matching and slanted correlation masks increased the quality of the depth data in a way that the obstacle detection rate increased from 89.4% to 97.75% while the false positive detection rate could be kept as low as 0.25%. The evaluation results have been obtained from extensive real-world test data. An additional stereo matching speed-up of factor 2.15 was achieved and the overall latency of obstacle detection is considerably faster than 300 ms. (C) 2013 Elsevier B.V. All rights reserved.

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

slanted correlation masks
autonomous train
obstacle detection

dense stereo matching
census transformation


Computing special functions of mathematical physics Relations between special mathematical functions and computational physics are discussed, needs and opportunities are presented, and a reference book with CD-ROM, the Atlas,for Computing Mathematical Functions (Wiley, 1997), is described. Future advances in visualizing and computing special functions are outlined. (C) 2001 Elsevier Science B.V. All rights reserved.

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

special functions
mathematical physics
computing


Range-Based Skyline Queries in Mobile Environments Skyline query processing for location-based services, which considers both spatial and nonspatial attributes of the objects being queried, has recently received increasing attention. Existing solutions focus on solving point-or line-based skyline queries, in which the query location is an exact location point or a line segment. However, due to privacy concerns and limited precision of localization devices, the input of a user location is often a spatial range. This paper studies a new problem of how to process such range-based skyline queries. Two novel algorithms are proposed: one is index-based (I-SKY) and the other is not based on any index (N-SKY). To handle frequent movements of the objects being queried, we also propose incremental versions of I-SKY and N-SKY, which avoid recomputing the query index and results from scratch. Additionally, we develop efficient solutions for probabilistic and continuous range-based skyline queries. Experimental results show that our proposed algorithms well outperform the baseline algorithm that adopts the existing line-based skyline solution. Moreover, the incremental versions of I-SKY and N-SKY save substantial computation cost, especially when the objects move frequently.

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


On the statistical characterization of flows in Internet traffic with application to sampling A new method of estimating some statistical characteristics of TCP flows in the Internet is developed in this paper. For this purpose, a new set of random variables (referred to as observables) is defined. When dealing with sampled traffic, these observables can easily be computed from sampled data. By adopting a convenient mouse/elephant dichotomy also dependent on traffic, it is shown how these variables give a reliable statistical representation of the number of packets transmitted by large flows during successive time intervals with an appropriate duration. A mathematical framework is developed to estimate the accuracy of the method. As an application, it is shown how one can estimate the number of large TCP flows when only sampled traffic is available. The algorithm proposed is tested against experimental data collected from different types of IP networks. (c) 2009 Elsevier B.V. All rights reserved.

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

flow statistics
statistical models
pareto distribution
poisson approximation


A new unconstrained third-order plate theory for Navier solutions of symmetrically laminated plates Among the many higher order plate theories, the third-order shear deformation plate theory (TSDT) of Reddy is, perhaps, the most widely adopted model in the study of laminated plates. It, however, imposes a restriction that transverse shear stress vanishes on the top and bottom surfaces of the plate. Such requirement, although reasonable in many engineering applications, is not valid when the plate is subject to shear traction parallel to the surface. To account for such problems, the present plate model releases the constraints of vanishing transverse shear stress on the top and bottom plate surfaces. This unconstrained third-order shear deformation plate theory (UTSDT) is particularly useful for the study of a plate with contact friction or present in a flow field where the boundary layer shear stress is significant. The governing differential equations of UTSDT are of similar complexity as that of TSDT but it yields more accurate solutions. In addition, it is more flexible as it can be degenerated to the first-order shear deformation plate theory (FSDT) of Reissner and Mindlin if the higher-order rotation coefficients are neglected and a shear correction factor is considered, or to the TSDT if the relevant rotation coefficients are constrained. The present study further develops the unconstrained theory in composite laminates. Navier solutions for bending and stress analysis of multilayered and symmetrically laminated composite plates are presented. It is concluded that the present plate model provides more accurate solutions than that of TSDT, with similar level of analytical complexity, when compared with the 3D elasticity exact solutions.

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

laminated
plate
shear deformation
unconstrained


Savannah woody structure modelling and mapping using multi-frequency (X-, C- and L-band) Synthetic Aperture Radar data Structural parameters of the woody component in African savannahs provide estimates of carbon stocks that are vital to the understanding of fuelwood reserves, which is the primary source of energy for 90% of households in South Africa (80% in Sub-Saharan Africa) and are at risk of over utilisation. The woody component can be characterised by various quantifiable woody structural parameters, such as tree cover, tree height, above ground biomass (AGB) or canopy volume, each been useful for different purposes. In contrast to the limited spatial coverage of ground-based approaches, remote sensing has the ability to sense the high spatio-temporal variability of e.g. woody canopy height, cover and biomass, as well as species diversity and phenological status a defining but challenging set of characteristics typical of African savannahs. Active remote sensing systems (e.g. Light Detection and Ranging LiDAR; Synthetic Aperture Radar SAR), on the other hand, may be more effective in quantifying the savannah woody component because of their ability to sense within-canopy properties of the vegetation and its insensitivity to atmosphere and clouds and shadows. Additionally, the various components of a particular targets structure can be sensed differently with SAR depending on the frequency or wavelength of the sensor being utilised. This study sought to test and compare the accuracy of modelling, in a Random Forest machine learning environment, woody above ground biomass (AGB), canopy cover (CC) and total canopy volume (TCV) in South African savannahs using a combination of X-band (TerraSAR-X), C-band (RADARSAT-2) and L-band (ALOS PALSAR) radar datasets. Training and validation data were derived from airborne LiDAR data to evaluate the SAR modelling accuracies. It was concluded that the L-band SAR frequency was more effective in the modelling of the CC (coefficient of determination or R2 of 0.77), TCV (R2 of 0.79) and AGB (R2 of 0.78) metrics in Southern African savannahs than the shorter wavelengths (X- and C-band) both as individual and combined (X+C-band) datasets. The addition of the shortest wavelengths also did not assist in the overall reduction of prediction error across different vegetation conditions (e.g. dense forested conditions, the dense shrubby layer and sparsely vegetated conditions). Although the integration of all three frequencies (X+C+L-band) yielded the best overall results for all three metrics (R2=0.83 for CC and AGB and R2=0.85 for TCV), the improvements were noticeable but marginal in comparison to the L-band alone. The results, thus, do not warrant the acquisition of all three SAR frequency datasets for tree structure monitoring in this environment.

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

woody structure
savannahs
sar
lidar
random forest


Equivalent pile loadhead settlement curve using a bi-directional pile load test An equivalent pile loadhead settlement curve to predict pile capacity has been obtained by using test results from the Osterberg Cell (O-cell). The method assumes that the pile is a rigid body and predicts very stiff pile behavior. This study describes a new method for predicting an equivalent pile loadhead settlement curve considering the elastic shortening of piles. The static pile load test is compared to the O-cell test using two piles constructed 10m apart (center-to-center distance). A measured O-cell test settlement consists of an elastic shortening under the load applied inside the pile and a net settlement. The measured net settlement is added to the elastic shortening, which has a different unit skin friction distribution under the top-down load on the pile head, to predict the equivalent pile loadhead settlement curve. The new equivalent pile loadhead settlement curve, considering the elastic shortening under top-down load, is similar to the pile loadhead settlement curve obtained by the static pile load test before the pile yields. The new method can be used to effectively estimate the pile head settlement as well as pile capacity by using the bi-directional load test results.

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

elastic shortening
rigid body
settlement
skin friction distribution


Vehicle spacing control using robust fuzzy control with pole placement in LMI region This work presents a robust pole placement in an LMI region for TakagiSugeno (TS) (Takagi T., Sugeno M., 1985. Fuzzy identification of systems and its application to modelling and control. IEEE Transactions on SMC 15 (1), 116132.) fuzzy models. The objective is to find a set of linear matrix inequalities in order to ensure that the linear model poles of the nonlinear TS model remain in a specified region of the complex plane, even in presence of model uncertainties. As an illustration, the obtained conditions are applied to the spacing policy control of an automated electric vehicle. Simulation and real-time results are presented.

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

lmi region
robust pole placement
vehicle spacing control


An artificial bee colony algorithm for data collection path planning in sparse wireless sensor networks In sparse wireless sensor networks, a mobile robot is usually exploited to collect the sensing data. Each sensor has a limited transmission range and the mobile robot must get into the coverage of each sensor node to obtain the sensing data. To minimize the energy consumption on the traveling of the mobile robot, it is significant to plan a data collection path with the minimum length to complete the data collection task. In this paper, we observe that this problem can be formulated as traveling salesman problem with neighborhoods, which is known to be NP-hard. To address this problem, we apply the concept of artificial bee colony (ABC) and design an ABC-based path planning algorithm. Simulation results validate the correctness and high efficiency of our proposal.

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


An approach to completing variable names for implicitly typed functional languages This paper presents an approach to completing variable names when writing programs in an implicitly typed functional language. As a first step toward developing practical systems, we considered a simple case: up to the cursor position the program text is given completely. With this assumption we specify a variable completion problem for an implicitly typed core functional language with let-polymorphism, and show an algorithm for solving the problem. Based on the algorithm we have implemented a variable name completion system for the language as an Emacs-mode.

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

polymorphic language
type inference
emacs-mode


Cultural Selves Recent cross-cultural studies of child development reveal that child rearing, while strikingly culturally variable, is everywhere designed to make the child's experience of important lessons constant, to link those lessons to emotional arousal, and to connect them to evaluations of the child's goodness and badness. These claims are illustrated from research on Americans, Chinese, Germans, Gusii (Kenya), Ifaluk (Micronesia), and Inuit (Baffin Island). These three universal features of child rearing accomplish what is a highly specialized task. Constancy of experience alters synaptic connections to grant the pattern of their firing especially high-resolution, so that the lessons to be learned are unmistakable ones. Accompanied by emotional arousal, these lessons are especially motivating and unforgettable. Brought home with evaluations of the learner's goodness and badness, these lessons are even more motivating and unforgettable. Children get the point of the lesson, enact it once they get it, and remember to enact it on subsequent occasions. Cultural models of child rearing, thus, exploit the neural capacities of the children so reared, to achieve a result, human adulthood, that could not be accomplished by the human brain alone. From exposure to these practices result distinctive cultural selves. These selves are partly implicit, based on the largely unmarked practices designed to make children's experience of important lessons constant and these lessons arousing, and partly explicit, based on the labeling and other marking that connects these lessons to evaluations of children's goodness and badness. The conscious, self-reflective self that emerges from such explicit evaluation lays the basis for identityeverywhere profoundly culturally shaped, infused with powerful evaluative meanings, and itself highly motivating.

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

cultural models
child rearing
cultural selves


Computational investigation of early child language acquisition using multimodal neural networks: a review of three models Current opinion suggests that language is a cognitive process in which different modalities such as perceptual entities, communicative intentions and speech are inextricably linked. As such, the process of child language acquisition is one in which the child learns to decipher this inextricability and to acquire language capabilities starting from gesturing, followed by language dominated by single word utterances, through to full-blown native language capability. In this paper I review three multimodal neural network models of early child language acquisition. Using these models, I show how computational modelling, in conjunction with the availability of empirical data, can contribute towards our understanding of child language acquisition. I conclude this paper by proposing a control theoretic approach towards modelling child language acquisition using neural networks.

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

child language acquisition
neural network


Daubechies wavelet beam and plate finite elements In the last few years, wavelets analysis application has called the attention of researchers in a wide variety of practical problems, particularly for the numerical solutions of partial differential equations using different methods such as finite differences, semi-discrete techniques or finite element method. In some mathematical models in mechanics of continuous media, the solutions may have local singularities and it is necessary to approximate with interpolatory functions having good properties or capacities to efficiently localize those non-regular zones. Due to their excellent properties of orthogonality and minimum compact support, Daubechies wavelets can be useful and convenient, providing guaranty of convergence and accuracy of the approximation in a wide variety of situations. In this work, we show the feasibility of a hybrid scheme using Daubechies wavelet functions and the finite element method to obtain numerical solutions of some problems in structural mechanics. Following this scheme, the formulations of an EulerBernoulli beam element and a MindlinReisner plate element are derived. The accuracy of this approach is investigated in some numerical test cases.

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

wavelet-finite element
scaling functions
connection coefficients


Display of search results in Hebrew: a comparison study between Google and LCC&K interface Google search engine is one of the most popular search engines used on the Internet today. It is used to display search results in English, but also in other languages as well. In this paper, we focus on display of search results in Hebrew. Search results retrieved from textual databases may be presented in several ways. In commercial search engines, the most common method is the presentation of a list that includes the titles of the retrieved documents, and, sometimes, the first few lines of each document and additional information. A series of studies at the Hebrew University examined the impact of different textual elements presented to the user on the effectiveness of the search. In the current experiment, presentation of search results in the Google-based interface was compared to presentation of search results in the LCC&K (Line in Context, Categories & Keywords) interface that was developed consequent to the findings of a previous series of studies. Both interfaces displayed the search results in Hebrew and addressed a Hebrew-speaking population. The outcome of the experiment shows that although Hebrew is considered to be a complex language considering its morphology aspects, there is little difference between the results obtained in a previous experiment that was conducted in English and the current experiment that was conducted in Hebrew. This paper will address the experimental process and its findings.

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


Geometrical position tolerance assignment in reverse engineering Geometric dimensioning and tolerancing constitutes the dominant approach for design and manufacture of mechanical parts that control inevitable dimensional and geometric deviations within appropriate limits. Position tolerance is a critical geometric tolerance very frequently used in industry. Its designation requires size data in conjunction with appropriate datums and location coordinates for the position. In reverse engineering, where typically relevant engineering information does not exist, conventional, human-based, trial and error approach for the allocation of positional tolerances requires much effort and time and offers no guarantee for the generation of the best results. This is mainly due to the large number of possible data combinations and the applicable relationships that have to be developed and processed. A methodology that aims towards the systematic solution of this problem in reasonable computing time and provides realistic and industry approved results is presented, demonstrated and discussed in the paper.

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

reverse engineering
tolerancing
position tolerance


An experimental investigation on a multilevel inverter for solar energy applications The main objective of the proposed work is to design, develop and test a three phase multilevel inverter with the modern power electronic switches to reduce the power quality issues in solar power conversion system. Due to the increased usage of power electronic converters for processing the power in all walks of our life, the power quality problem become the hot research topic in the recent years. As the power level increases, the voltage level is increased accordingly to obtain satisfactory efficiency. The multilevel power converter has shown growing popularity. The fundamental advantages of multilevel converter topologies are low distorted output waveforms and limited voltage stress on the switching devices and hence the reduced electromagnetic interferences. The main disadvantages are higher complexity and more difficult control; it can be overcome by using modern digital controllers. In this paper, the performance parameters are analyzed with the developed prototype of the three phase cascaded multilevel inverter for solar energy conversion designed with digital controller for reduced power quality issues with three phase AC motor drive. The main objective is to obtain the better quality of output waveform on the inverter output with suitable control strategy on the experimental hardware setup.

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

inverters
power electronics
drives
power converters
multi level inverter
field programmable gate array


Phase Auto Correlation (PAC) features for noise robust speech recognition In this paper, we introduce a new class of noise robust features derived from an alternative measure of autocorrelation representing the phase variation of speech signal frame over time. These features, referred to as Phase AutoCorrelation (PAC) features include PAC-spectrum and PAC-MFCC, among others. In traditional autocorrelation, correlation between two time delayed signal vectors is computed as their dot product. Whereas in PAC, angle between the vectors in the signal vector space is used to compute the correlation. PAC features are more noise robust because the angle is typically less affected by noise than the dot product. However, the use of angle as correlation estimate makes the PAC features inferior in clean speech. In this paper, we circumvent this problem by introducing another set of features where complementary information among the PAC features and the traditional features are combined adaptively to retain the best of both. An entropy based feature combination method in a multi-layer perceptron (MLP) based multi-stream framework is used to derive an adaptively combined representation of the component feature streams. An evaluation of the combined features using OGI Numbers95 database and Aurora-2 database under various noise conditions and noise levels show significant improvements in recognition accuracies in clean as well as noisy conditions. (C) 2012 Elsevier B.V. All rights reserved.

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

phase autocorrelation (pac)
energy normalization
inverse cosine
inverse entropy
mlp feature combination


A SECURITY MECHANISM FOR RFID WITH DEPENDABLE PROXY RFID (Radio Frequency Identification) is a non-contact auto identification technology widely applied in many fields nowadays, while its security issues also get much concern in practical applications. So far, experts from industry and academia have proposed a series of solutions, mainly including physical methods, security protocols based on cryptography, hardware encryption technique and so on. However, various defects still exist in all the three categories, which may lead to the failure to achieve the security requirements of RFID systems. Aiming to make a further improvement to these solutions, we propose a security mechanism designed with dependable proxy in this paper, which demonstrates a good fusion of physical methods and security protocols. In allusion to the new scheme, we use BAN logic to do the formal analysis to derive the security objectives of our mechanism. Subsequently, given the corresponding theoretic analysis and comparison, it is indicated that the new mechanism can efficiently defend RFID systems against monitoring, deception, tracking, replay attacks, and greatly decrease the possibility of suffering denial of service. The asynchronous problem that may arise on systemic information is also discussed to lessen the authentication failure of the legal tags.

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

rfid
physical methods
security protocols
proxy
ban logic


Invention property-function network analysis of patents: a case of silicon-based thin film solar cells Technology analysis is a process which uses textual analysis to detect trends in technological innovation. Co-word analysis (CWA), a popular method for technology analysis, encompasses (1) defining a set of keyword or key phrase patterns which are represented in technology-dependent terms, (2) generating a network that codifies the relations between occurrences of keywords or key phrases, and (3) identifying specific trends from the network. However, defining the set of keyword or key phrase patterns heavily relies on effort of experts, who may be expensive or unavailable. Furthermore defining keyword or key phrase patterns of new or emerging technology areas may be a difficult task even for experts. To solve the limitation in CWA, this research adopts a property-function based approach. The property is a specific characteristic of a product, and is usually described using adjectives; the function is a useful action of a product, and is usually described using verbs. Properties and functions represent the innovation concepts of a system, so they show innovation directions in a given technology. The proposed methodology automatically extracts properties and functions from patents using natural language processing. Using properties and functions as nodes, and co-occurrences as links, an invention property-function network (IPFN) can be generated. Using social network analysis, the methodology analyzes technological implications of indicators in the IPFN. Therefore, without predefining keyword or key phrase patterns, the methodology assists experts to more concentrate on their knowledge services that identify trends in technological innovation from patents. The methodology is illustrated using a case study of patents related to silicon-based thin film solar cells.

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

property
function
technology analysis
natural language processing
social network analysis


SemSearchPro Using semantics throughout the search process Semantic search attempts to go beyond the current state of the art in information access by addressing information needs on the semantic level, i.e. considering the meaning of users queries and the available resources. In recent years, there have been significant advances in developing and applying semantic technologies to the problem of semantic search. To collate these various approaches and to better understand what the concept of semantic search entails, we study semantic search under a general model. Extending this model, we introduce the notion of process-based semantic search, where semantics is exploited not only for query processing, but might be involved in all steps of the search process. We propose a particular approach that instantiates this process-based model. The usefulness of using semantics throughout the search process is finally assessed via a task-based evaluation performed in a real world scenario.

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

semantic search process
ontology-based document retrieval
semantic data retrieval


the role of the traditional tv in the age of intermedial media spectacles Combination of broadcast and digital media is high on the agenda of today's international media industries. Basically this means combining broadcasting with digital platforms. [29] This sort of cross-platform thinking is most common in different real TV-formats that offer interactive audience participation on TV, net and other mediums and/or devices. Naturally these intermedial TV-formats are bound to affect the role of the traditional TV-set. This paper presents an audience research study that was conducted in autumn 2009 by an internet inquiry that contained approximately 45 questions related to iTV/participatory TV- and media culture. The current situation and the questionnaire data were analyzed to answer the following questions: what is TV's role in the era of intermedial multiplatform media spectacles? How TV is watched and participated? What are the motives behind participation and what are the opinions towards iTV-entertainment and participatory TV- and media culture? This research is important since TV has been constantly over going several changes during the 21st century. Therefore, there is obvious room for further research on actual production, reception and participation practises when it comes to academic research on cross-media and multiplatform phenomena. [29]

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

intermedialism
tv &#38
ipart-formats
multiplatform tv-formats


Regulatory control structure selection of linear systems The selection of manipulated and controlled variables as well as the structure and parameters of their interconnecting controller is an important synthesis problem that has received a lot of attention from the process control community. This paper presents a mathematical programming methodology for the solution of this multifaceted synthesis problem. The method is applicable to linear or linearised nonlinear systems. In addition, a quantitative index is proposed for the estimation of the advantages in using unstructured controllers, such as model predictive controller (MPC, when compared to classical structured controllers such as multivariable proportional-integral-derivative (PID) controllers. Two case studies are presented where the potential of the method as a rigorous technique for solving the regulatory control structure selection problem for linear systems is established. (C) 2002 Elsevier Science Ltd. All rights reserved.

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

control structure selection
linear systems


Approaches to Distributed Execution of Scientific Workflows in Kepler The Kepler scientific workflow system enables creation, execution and sharing of workflows across a broad range of scientific and engineering disciplines while also facilitating remote and distributed execution of workflows. In this paper, we present and compare different approaches to distributed execution of workflows using the Kepler environment, including a distributed data-parallel framework using Hadoop and Stratosphere, and Cloud and Grid execution using Serpens, Nimrod/K and Globus actors. We also present real-life applications in computational chemistry, bioinformatics and computational physics to demonstrate the usage of different distributed computing capabilities of Kepler in executable workflows. We further analyze the differences of each approach and provide a guidance for their applications.

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

kepler
scientific workflow
distributed execution


A revision of recent approaches for two-dimensional strip-packing problems In this paper, we present a review of the recent approaches proposed in the literature for strip-packing problems. Many of them have been concurrently published, given some similar results for the same set of benchmarks. Due to the quantity of published papers, it is difficult to ascertain the level of current research in this area. (C) 2008 Published by Elsevier Ltd.

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

strip packing
heuristic search
metaheuristics
constrained problems
optimization


Quality of security adaptation in parallel disk systems In the past decade, parallel disk systems have been highly scalable and able to alleviate the problem of disk I/O bottleneck, thereby being widely used to support data-intensive applications. Although a variety of parallel disk systems were developed, most existing disk systems lack a means to adaptively control the quality of security for dynamically changing workloads. We address this gap in disk technology by designing, implementing, and evaluating a quality of security control framework for parallel disk systems, or ASPAD for short, that makes it possible for parallel disk systems to adapt to changing security requirements and workload conditions. The ASPAD framework comprises four major components, namely, a security service middleware, a dynamic data-partitioning mechanism, a response time estimator, and an adaptive security quality controller. The framework is conducive to adaptively and expeditiously determining security services for requests submitted to a parallel disk system in a way to improve security of the disk system while making an effort to guarantee desired response times of the requests. We conduct extensive experiments to quantitatively evaluate the performance of the proposed ASPAD framework. Empirical results show that ASPAD significantly improves the overall performance of parallel disk systems over the same disk systems without using the ASPAD framework.

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

quality of security
parallel disk systems
security services

adaptive control
desired response time
data partitioning


A software methodology for applied research: eXtreme Researching Applied research is, by necessity, a distributed, collaborative process. To be useful, research methodologies must not only be applicable in such an environment, but must also be adaptive to the needs of human resources and specific research area requirements. This paper introduces eXtreme Researching (XR), an adaptation of eXtreme Programming (XP) by Ericsson, to support distributed telecommunications research and development. XR builds on XP and tailors it to meet the needs of applied industrial research. It adopts and extends the most useful elements of XP: collective ownership, planning game, continuous integration and metaphor and shows how they are applicable in multi-site, research projects. XPWeb is developed as a tool to facilitate XR in a distributed research environment. XPWeb and XR are actively used by Ericsson Applied Research and have been shown to significantly increase output and efficiencies in multi disciplinary research projects. Copyright (c) 2005 John Wiley & Sons, Ltd.

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


Productivity metrics and models for high performance computing Historically, high performance computing has been measured in terms of peak or delivered performance, and to a lesser extent to performance to cost. Such metrics fail to capture the impact on the usefulness and ease of use of such systems. Productivity has been identified as a new parameter for high end computing systems that include both delivered system performance and the programmability of the system. System productivity is directly affected by many factors contributing to the achieved performance, the speed with which users construct application programs, and the availability of the system to perform user applications. This paper explores the concept of productivity as a quantifiable; parameter through a series of analytical models and considers the factors that contribute to it.

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


Do instant messaging interruptions help or hinder knowledge workers task performance? The modern workplace environment is filled with interruptions due to the necessity of coworkers to communicate with each other. Studies have revealed that interruptions can impact task performance (TP). Communication interruptions are due, in part, to the unavoidable side-effect of using technology to facilitate these interactions. This experimental case study reports about an investigation we conducted on the role of instant messaging interruptions (IMI) and its implications on knowledge workers TP in a workplace environment. We have gathered data from knowledge workers engaged in an e-learning activity. The case study included a total of 60 experimental observations and analysis of the 120 records revealed that the time to complete a task (TPtct) for certain types of tasks, was significantly affected by IMI. This case study addressed gaps in IM interruption research and practical knowledge about the role of instant messages in the organization. Previous research has been conducted in a laboratory environment with interruptions generated by means other than actual IM. This case study used IMI with participants working in their normal workplace. Findings were used to provide a set of lessons learned recommendations for managers when it comes to the use of IM in the workplace.

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

instant messaging
interruptions
task performance
experimental case study

internet interruptions
knowledge worker's performance


Efficient Algorithms for Summarizing Graph Patterns We investigate the problem of summarizing frequent subgraphs by a smaller set of representative patterns. We show that some special graph patterns, called delta-jump patterns in this paper, must be representative patterns. Based on the fact, we devise two algorithms, RP-FP and RP-GD, to mine a representative set that summarizes frequent subgraphs. RP-FP derives a representative set from frequent closed subgraphs, whereas RP-GD mines a representative set from graph databases directly. Three novel heuristic strategies, Last-Succeed-First-Check, Reverse-Path-Trace, and Nephew-Representative-Based-Cover, are proposed to further improve the efficiency of RP-GD. RP-FP can provide a tight ratio bound but has heavy computation cost. RP-GD cannot provide a ratio bound guarantee but is more efficient than RP-FP. We also make use of the similarity between sibling branches in the graph pattern space to devise another much more efficient algorithm, RP-Leap, for mining a representative set that can approximately summarize frequent subgraphs. Our extensive experiments on both real and synthetic data sets verify the summarization quality and efficiency of our algorithms. To further demonstrate the interestingness of representative patterns, we study an application of representative patterns to classification. We demonstrate that the classification accuracy achieved by representative pattern-based model is no less than that achieved by closed graph pattern-based model.

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

data mining
graph mining
pattern summarization


Route optimization in optical burst switched networks considering the streamline effect Route optimization in optical burst switching (OBS) networks is investigated in this paper. Two route optimization problems are studied. The first problem considers the network in the normal working state where all the links are working properly. The route for each flow is decided so as to minimize the overall network burst loss. The second problem considers the failure states apart from the normal working state. The primary and backup paths for each flow are determined in such a way to minimize the expected burst loss over the normal and failure states. We argue that route selection based on load balancing or the traditional Erlang B formula is not efficient because of an important feature called the streamline effect. We analyze the streamline effect and propose a more accurate loss estimation formula which considers the streamline effect. Based on this formula, we develop mixed integer linear programming (MILP) formulations for the two problems. Since the MILP-based solutions are computationally intensive, we develop heuristic algorithms. We verify the effectiveness of our algorithms through numerical results obtained by solving the MILP formulations with CPLEX and also through simulation results. (C) 2008 Elsevier B.V. All rights reserved.

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

optical burst switching
route optimization
loss estimation
streamline effect


Fourier nonlinear filters Two sub-classes of linear-in-the-parameters nonlinear filters, called Fourier nonlinear (FN) filters and even mirror Fourier nonlinear (EMFN) filters, are presented and discussed. The filters derive from the truncation of multidimensional generalized Fourier series. Like the Volterra filters, FN and EMFN filters are universal approximators for causal, time-invariant, finite memory continuous nonlinear systems. Differently from Volterra filters, FN and EMFN filters satisfy an orthogonality property for white uniform input signals. The orthogonality property guarantees fast convergence of gradient descent adaptation algorithms and efficient identification methods for nonlinear systems.

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

fourier nonlinear filters
even mirror fourier nonlinear filters


An oracle builder's toolkit We show how to use various notions of genericity as tools in oracle creation. In particular, 1. we give an abstract definition of genericity that encompasses a large collection of different generic notions; 2. we consider a new complexity class AWPP, which contains BQP (quantum polynomial time), and infer several strong collapses relative to SP-generics; 3. we show that under additional assumptions these collapses also occur relative to Cohen generics; 4. we show that relative to SP-generics, ULIN boolean AND co-ULIN not subset of or equal to DTIME(n(k)) for any k, where ULIN is unambiguous linear time, despite the fact that UP boolean OR (NP boolean AND co-NP) subset of or equal to P relative to these generics; 5. we show that there is an oracle relative to which NP/1 boolean AND co-NP/1 subset of or equal to (NP boolean AND co-NP)/poly; and 6. we use a specialized notion of genericity to create an oracle relative to which NPBPP not superset of or equal to MA. (C) 2003 Elsevier Science (USA). All rights reserved.

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

complexity classes
relativization
generic oracles
forcing


Newly Developed Aminopropyl-Silicate Immunoisolation Membrane for a Microcapsule-Shaped Bioartificial Pancreas An aminopropyl-silicate membrane, synthesized from tetramethoxysilane (TMOS) and 3-aminopropyltrimethoxysilane (APTrMOS) by the sol-gel method, was formed onto Ca-alginate gel beads via electrostatic interactions. The permeability of the membrane could be controlled easily by changing the molar ratio of both the precursors ([APTrMOS]/[TMOS]). The aminopropyl-silicate membrane prepared at a molar ratio of 2.40 rejected ?-globulin and BSA successfully, whereas it permeated ovalbumin. This result indicates that the molecular weight cutoff point of this newly developed aminopropyl-silicate membrane is approximately 60 kDa.

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


Resource-aware and quality-fair video-streaming using multiple adaptive TCP connections In this paper, we present a resource-aware and quality-fair video content sharing system. When a video sharing server has insufficient uplink bandwidth and needs to serve multiple video content sharing services via streaming or downloading to other client peers using TCP transport, each service shares the limited uplink bandwidth equitably, due to the fair sharing characteristics inherent in TCP. However this bandwidth fair sharing cannot always guarantee quality fairness among the services, due to the specific requirements for video-streaming services, such as the playout rate and the size of the playout buffer. In our system, the server uses multiple TCP connections adaptively, depending on the anticipated status of each client playout buffer, to guarantee the bandwidth of each video-streaming session. By guaranteeing the quality of each video-streaming session, without the quality loss of other service sessions, the proposed system can successfully achieve service quality fairness. Simulation results show that our proposed algorithm can dramatically enhance the quality of each streaming session and thus provide service quality fairness among simultaneous multiple heterogeneous video-streaming services and content download services.

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


Establishing the provenance of historical manuscripts with a novel distance measure The recent digitization of more than 20 million books has been led by initiatives from countries wishing to preserve their cultural heritage and by several commercial endeavors, including the Google Print Library Project. It is expected that within a few years a significant fraction of the worlds books will be online. However, for millions of complete books and tens of millions of loose pages, the provenance of the manuscripts may be completely unknown or disputed, thus denying historians an understanding of the context in which the content was created. In a handful of cases, it may be possible for experts to regain the provenance by examining linguistic, cultural and/or stylistic clues. However, such experts are a rarity and these investigations are time-consuming and expensive. One technique used by experts to establish provenance is the examination of the ornate initial letters appearing in the questioned manuscript. By comparing the initial letters in the manuscript to annotated initial letters whose origin is known, the provenance can be determined. In this work, we show for the first time that we can reproduce this ability with a computer algorithm. We use a recently introduced technique to measure texture similarity and show that it can recognize initial letters with an accuracy that rivals or exceeds human performance. A brute force implementation of this measure would require several months to process a single large book; however, we introduce a novel lower bound that allows us to process the books in hours or minutes.

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

image similarity
classification
clustering


Simulation and analysis for microstructure profile of optical lithography based on SU-8 thick resist Profile simulation of optical lithography is very useful for micro-fabrication of microstructure with high sidewall quality. In this paper the light wave propagation, exposure and development process were analyzed, and modeling for thick film lithography was developed to accurately and rapidly obtain simulated results. The effect of exposure dose on the profile quality after development were simulated and discussed, which show that these process parameters have a great impact on the profile quality of microstructure. With guidance of the simulation and analysis, the micro-gear and micro-piston of micro-motor fabricated by SU-8 thick resist were presented.

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

optical lithography
microstructure
profile quality
simulation


signal to noise ratio of information in documentation The signal to noise ratio is a common concept in radio communications and electronic communication in general. For a radio, the static is the noise. Too much static and the storm report gets drowned out, or at least you must listen closely to understand the announcer. Unfortunately, information designers do not posses a clear cut set of techniques available to electrical engineers. For information systems, taking the raw data in a system and deciding what is signal and what is noise proves to be extremely difficult. This paper will examine how the concept of signal to noise ratio can be applied to documentation. It will consider how the need to address different tasks and audience forces compromises on the writer to meet those different needs, when each audience has different definitions of which information constitutes signal and which constitutes noise.

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


a framework for filtering web accessibility guidelines This paper first presents a framework for filtering the Web Accessibility Guidelines according to contexts of use. It then presents a prototype that implements the framework and explains an evaluation of the prototype.

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

context of use
content filtration
web accessibility guidelines


An immersed boundary method based on the lattice Boltzmann approach in three dimensions, with application The immersed boundary (IB) method originated by Peskin has been popular in modeling and simulating problems involving the interaction of a flexible structure and a viscous incompressible fluid. The NavierStokes (NS) equations in the IB method are usually solved using numerical methods such as FFT and projection methods. Here in our work, the NS equations are solved by an alternative approach, the lattice Boltzmann method (LBM). Compared to many conventional NS solvers, the LBM can be easier to implement and more convenient for modeling additional physics in a problem. This alternative approach adds extra versatility to the immersed boundary method. In this paper we discuss the use of a 3D lattice Boltzmann model (D3Q19) within the IB method. We use this hybrid approach to simulate a viscous flow past a flexible sheet tethered at its middle line in a 3D channel and determine a drag scaling law for the sheet. Our main conclusions are: (1) the hybrid method is convergent with first-order accuracy which is consistent with the immersed boundary method in general; (2) the drag of the flexible sheet appears to scale with the inflow speed which is in sharp contrast with the square law for a rigid body in a viscous flow.

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

immersed boundary method
lattice boltzmann method
drag scaling

fluidstructure interaction
deformable body
computational fluid dynamics
incompressible viscous flow


the implementation of procedurally reflective languages In a procedurally reflective programming language, all programs are executed not through the agency of a primitive and inaccessible interpreter, but rather by the explicit running of a program that represents that interpreter. In the corresponding virtual machine, therefore, there are an infinite number of levels at which programs are processed, all simultaneously active. It is therefore a substantial question to show whether, and why, a reflective language is computationally tractable. We answer this question by showing how to produce an efficient implementation of a procedurally reflective language, based on the notion of a level-shifting processor. A series of general techniques, which should be applicable to reflective variants of any standard applicative or imperative programming languages, are illustrated in a complete implementation for a particular reflective LISP dialect called 3-LISP.

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

processor
program
lisp
language
implementation
general
virtual machine

activation
efficiency
interpretation
standardization
completeness
programming language


learning user interest for image browsing on small-form-factor devices Mobile devices which can capture and view pictures are becoming increasingly common in our life. The limitation of these small-form-factor devices makes the user experience of image browsing quite different from that on desktop PCs. In this paper, we first present a user study on how users interact with a mobile image browser with basic functions. We found that on small displays, users tend to use more zooming and scrolling actions in order to view interesting regions in detail. From this fact, we designed a new method to detect user interest maps and extract user attention objects from the image browsing log. This approach is more efficient than image-analysis based methods and can better represent users' actual interest. A smart image viewer was then developed based on user interest analysis. A second experiment was carried out to study how users behave with such a viewer. Experimental results demonstrate that the new smart features can improve the browsing efficiency and are a good compliment to traditional image browsers.

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

order use efficiency log analysis maps browser experience paper user attention method users demonstrate image learning

zoom
mobility
object
mobile image browsing
attention model
scroll
browse
user experience
small display
experimentation
extraction
mobile device
factor
region
device
display
feature
image analysis.
action
user studies


Representing time intervals in a two-dimensional space: An empirical study ? An empirical study is conducted to compare the 1D and 2D models of time interval. Participants can more accurately process interval relations using the 2D model. Participants can more quickly process interval relations using the 2D model. Participants can better use the 2D model to process a large number of intervals. This study implicates that the 2D model has great potential in interval analysis.

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

temporal reasoning
information visualisation
temporal information


Talairach-Tournoux brain atlas registration using a metalforming principle-based finite element method In this paper, a novel non-rigid registration method is proposed for registration of the Talairach-Tournoux brain atlas with MRI images and the Schaltenbrand-Wahren brain atlas. A metalforming principle-based finite element method with the large deformation problem is used to find the local deformation, in which finite element equations are governed by constraints in the form of displacements derived from the correspondence relationship between extracted feature points. Some detectable substructures, such as the cortical surface, ventricles and corpus callosum, are first extracted from MRI, forming feature points which are classified into different groups. The softassign method is used to establish the correspondence relationship between feature points within each group and to obtain the global transformation concurrently. The displacement constraints are then derived from the correspondence relationship. A metalforming principle-based finite element method with the large deformation problem is used in which finite element equations are reorganized and simplified by integrating the displacement constraints into the system equations. Our method not only matches the model to the data efficiently, but also decreases the degrees of freedom of the system and consequently reduces the computational cost. The method is illustrated by matching the Talairach-Tournoux brain atlas to MRI normal and pathological data and to the Schaltenbrand-Wahren brain atlas. We compare the results quantitatively between the force assignment-based method and the proposed method. The results show that the proposed method yields more accurate results in a fraction of the time taken by the previous method. (C) 2001 Elsevier Science B.V. All rights reserved.

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

brain atlas
finite element method
large deformation

non-rigid registration
metalforming principle-based


A unified framework for structure identification We propose a general framework for structure identification, as defined by Dechter and Pearl. It is based on the notion of prime implicate, and handles Horn, bijunctive and affine, as well as Horn-renamable formulas, for which, to our knowledge, no polynomial algorithm has been proposed before. This framework, although quite general, gives good complexity results, and in particular we get for Horn formulas the same running time and better output size than the algorithms previously known. (C) 2002 Elsevier Science B.V. All rights reserved.

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

structure identification
prime implicate
affine


Remain Faithful to the Earth!*: Reporting Experiences of Artifact-Centered Design in Healthcare In this paper we report about two design experiences in the domain of healthcare information technology that shed light on the advantages of getting rid of complex and abstract representations of hospital work and of concentrating on the artifacts that practitioners habitually use in their daily practice. We ground our approach in the recent literature on the often unintended shortcomings exhibited by healthcare information systems and propose a lightweight method to support the phases of requirement elicitation and functional design. We then discuss the main requirements expressed in our recent research activity and provide examples of how to address them in terms of modular and reusable design solutions.

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

requirement elicitation
healthcare
hospital work

artifact-centered design
domain analysis
system analysis
healthcare information technology


Integrating computational thinking with K-12 science education using agent-based computation: A theoretical framework Computational thinking (CT) draws on concepts and practices that are fundamental to computing and computer science. It includes epistemic and representational practices, such as problem representation, abstraction, decomposition, simulation, verification, and prediction. However, these practices are also central to the development of expertise in scientific and mathematical disciplines. Recently, arguments have been made in favour of integrating CT and programming into the K-12 STEM curricula. In this paper, we first present a theoretical investigation of key issues that need to be considered for integrating CT into K-12 science topics by identifying the synergies between CT and scientific expertise using a particular genre of computation: agent-based computation. We then present a critical review of the literature in educational computing, and propose a set of guidelines for designing learning environments on science topics that can jointly foster the development of computational thinking with scientific expertise. This is followed by the description of a learning environment that supports CT through modeling and simulation to help middle school students learn physics and biology. We demonstrate the effectiveness of our system by discussing the results of a small study conducted in a middle school science classroom. Finally, we discuss the implications of our work for future research on developing CT-based science learning environments.

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

computational thinking
science education

agent-based modeling and simulation
visual programming
multi-agent systems
learning by design
computational modeling
physics education
biology education


Tests for consistent measurement of external subjective software quality attributes One reason that researchers may wish to demonstrate that an external software quality attribute can be measured consistently is so that they can validate a prediction system for the attribute. However, attempts at validating prediction systems for external subjective quality attributes have tended to rely on experts indicating that the values provided by the prediction systems informally agree with the experts intuition about the attribute. These attempts are undertaken without a pre-defined scale on which it is known that the attribute can be measured consistently. Consequently, a valid unbiased estimate of the predictive capability of the prediction system cannot be given because the experts measurement process is not independent of the prediction systems values. Usually, no justification is given for not checking to see if the experts can measure the attribute consistently. It seems to be assumed that: subjective measurement isnt proper measurement or subjective measurement cannot be quantified or no one knows the true values of the attributes anyway and they cannot be estimated. However, even though the classification of software systems or software artefacts quality attributes is subjective, it is possible to quantify experts measurements in terms of conditional probabilities. It is then possible, using a statistical approach, to assess formally whether the experts measurements can be considered consistent. If the measurements are consistent, it is also possible to identify estimates of the true values, which are independent of the prediction system. These values can then be used to assess the predictive capability of the prediction system. In this paper we use Bayesian inference, Markov chain Monte Carlo simulation and missing data imputation to develop statistical tests for consistent measurement of subjective ordinal scale attributes.

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

subjective software quality attributes
consistent measurement
bayesian inference
data imputation

conditional probability
multinomial distribution
error rates
distribution principle
minimum rejection principle


Path computation in multi-layer multi-domain networks: A language theoretic approach Multi-layer networks are networks in which several protocols may coexist at different layers. The Pseudo-Wire architecture provides encapsulation and decapsulation functions of protocols over Packet-Switched Networks. In a multi-domain context, computing a path to support end-to-end services requires the consideration of encapsulation and decapsulation capabilities. It appears that graph models are not expressive enough to tackle this problem. In this paper, we propose a new model of heterogeneous networks using Automata Theory. A network is modeled as a Push-Down Automaton (PDA) which is able to capture the encapsulation and decapsulation capabilities, the PDA stack corresponding to the stack of encapsulated protocols. We provide polynomial algorithms that compute the shortest path either in hops or in the number of encapsulations and decapsulations along the inter-domain path, the later reducing manual configurations and possible loops in the path. (C) 2012 Elsevier B.V. All rights reserved.

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

multi-layer networks
pseudo-wire
push-down automata


CALHIDRA 3.0 New software application for river water quality prediction based on RWQM1 This paper presents CalHidra 3.0, a new software package developed for dynamic simulation of water quality in rivers. CalHidra 3.0 combines a 1-D hydrodynamic model based on Saint Venant equations, a transport sub-model that incorporates the advectiondispersion terms, and a simplified version of the River Water Quality Model 1 (RWQM1) for the biochemical transformations. This advanced biochemical sub-model allows the dynamic simulation of the bacterial populations in rivers, making possible the simulation of the river acclimatisation to changes of pollutant load or environmental conditions. The software also includes new tools for a Monte Carlo based Bayesian calibration of the unknown model parameters. CalHidra 3.0 is implemented based on the Component Object Model (COM) programming paradigm and uses the Windows graphical environment. Three case studies illustrate the possibilities of the CalHidra 3.0 software.

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

component object model
river water quality
rwqm1
saint venant equations