An easy-to-use MATLAB program (MamLand) for the assessment of landslide susceptibility using a Mamdani fuzzy algorithm In this study, landslide susceptibility mapping using a completely expert opinion-based approach was applied for the Sinop (northern Turkey) region and its close vicinity. For this purpose, an easy-to-use program, "MamLand," was developed for the construction of a Mamdani fuzzy inference system and employed in MATLAB. Using this newly developed program, it is possible to construct a landslide susceptibility map based on expert opinion. In this study, seven conditioning parameters characterising topographical, geological, and environmental conditions were included in the FIS. A landslide inventory dataset including 351 landslide locations was obtained for the study area. After completing the data production stage of the study, the data were processed using a soft computing approach, i.e., a Mamdani-type fuzzy inference system. In this system, only landslide conditioning data were assessed, and landslide inventory data were not included in the assessment approach. Thus, a file depicting the landslide susceptibility degrees for the study area was produced using the Mamdani FIS. These degrees were then exported into a GIS environment, and a landslide susceptibility map was produced and assessed in point of statistical interpretation. For this purpose, the obtained landslide susceptibility map and the landslide inventory data were compared, and an area under curve (AUC) obtained from receiver operating characteristics (ROC) assessment was carried out. From this assessment, the AUG value was found to be 0.855, indicating that this landslide susceptibility map, which was produced in a data-independent manner, was successful. (C) 2011 Elsevier Ltd. All rights reserved.

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

mamdani fuzzy inference system
landslide susceptibility

geographical information systems (gis)
sinop (turkey)


Growth optimal investment in horse race markets with costs We formulate the problem of growth optimal investment in horse race markets with proportional costs and study growth optimal strategies both for stochastic horse races as well as races where one does not make any distributional assumptions. Our results extend all known results for frictionless horse race markets to their natural analog in markets with costs.

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

growth optimality
proportional transaction costs
universal investment


Detecting verbose queries and improving information retrieval We consider query verbosity and query length two distinct query properties. We propose a methodology to automatically detect and process verbose queries. The methodology uses concept expansion and syntactic features for query modification. Experiments were carried out on a test collection built on TREC2004 Robust collection. Retrieval effectiveness can be significantly improved by considering query verbosity.

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

information retrieval
verbose queries
query modification


Automated theorem proving in Euler diagram systems Diagrammatic reasoning has the potential to be important in numerous application areas. This paper focuses on the simple, but widely used, Euler diagrams that form the basis of many more expressive logics. We have implemented a diagrammatic theorem prover, called Edith, which has access to four sound and complete sets of reasoning rules for Euler diagrams. Furthermore, for each rule set we develop a sophisticated heuristic to guide the search for a proof. This paper is about understanding how the choice of reasoning rule set affects the time taken to find proofs. Such an understanding will influence reasoning rule design in other logics. Moreover, this work specific to Euler diagrams directly benefits the many logics based on Euler diagrams. We investigate how the time taken to find a proof depends not only on the proof task but also on the reasoning system used. Our evaluation allows us to predict the best choice of reasoning system, given a proof task, in terms of time taken, and we extract a guide for defining reasoning rules for other logics in order to minimize time requirements.

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


Cytochrome P450 database This paper describes a specialized database dedicated exclusively to the cytochrome P450 superfamily. The system provides the impression of superfamily's nomenclature and describes structure and function of different P450 enzymes. Information on P450-catalyzed reactions, substrate preferences, peculiarities of induction and inhibition is available through the database management system. Also the source genes and appropriate translated proteins can be retrieved together with corresponding literature references. Developed programming solution provides the flexible interface for browsing, searching, grouping and reporting the information. Local version of database manager and required data files are distributed on a compact disk. Besides, there is a network version of the software available on Internet. The network version implies the original mechanism, which is useful for the permanent online extension of the data scope.

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


evaluating search systems using result page context We introduce a method for evaluating the relevance of all visible components of a Web search results page, in the context of that results page. Contrary to Cranfield-style evaluation methods, our approach recognizes that a user's initial search interaction is with the result page produced by a search system, not the landing pages linked from it. Our key contribution is that the method allows us to investigate aspects of component relevance that are difficult or impossible to judge in isolation. Such contextual aspects include component-level information redundancy and cross-component coherence. We report on how the method complements traditional document relevance measurement and its support for comparative relevance assessment across multiple search engines. We also study possible issues with applying the method, including brand presentation effects, inter-judge agreement, and comparisons with document-based relevance judgments. Our findings show this is a useful method for evaluating the dominant user experience in interacting with search systems.

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


Multicast Capacity Scaling Laws for Multihop Cognitive Networks In this paper, we study multicast capacity for cognitive networks. We consider the cognitive network model consisting of two overlapping ad hoc networks, called the primary ad hoc network (PaN) and secondary ad hoc network (SaN), respectively. PaN and SaN operate on the same space and spectrum. For PaN (or SaN, respectively), we assume that primary (or secondary, respectively) nodes are placed according to a Poisson point process of intensity n (or m, respectively) over a unit square region. We randomly choose n(s) (or m(s), respectively) nodes as the sources of multicast sessions in PaN (or SaN, respectively), and for each primary source v(p) (or secondary source v(s), respectively), we pick uniformly at random n(d) primary nodes (or m(d) secondary nodes, respectively) as the destinations of v(p) (or v(s), respectively). Above all, we assume that PaN can adopt the optimal protocol in terms of the throughput. Our main work is to design the multicast strategy for SaN by which the optimal throughput can be achieved, without any negative impact on the throughput for PaN in order sense. Depending on n(d) and n, we choose the optimal one for PaN from two strategies called percolation strategy and connectivity strategy, respectively. Subsequently, we design the corresponding throughput-optimal strategy for SaN. We derive the regimes in terms of n, n(d), m, and m(d) in which the upper bounds on multicast capacities for PaN and SaN can be achieved simultaneously. Unicast and broadcast capacities for the cognitive network can be derived by our results as the special cases by letting n(d) = 1 (or m(d) = 1) and n(d) = n - 1 (or m(d) = m - 1), respectively, which enhances the generality of this work.

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

wireless ad hoc networks
random networks
percolation theory


AND/OR Branch-and-Bound search for combinatorial optimization in graphical models This is the first of two papers presenting and evaluating the power of a new framework for combinatorial optimization in graphical models, based on AND/OR search spaces. We introduce a new generation of depth-first Branch-and-Bound algorithms that explore the AND/OR search tree using static and dynamic variable orderings. The Virtue of the AND/OR representation of the search space is that its size may be far smaller than that of a traditional OR representation, which can translate into significant time savings for search algorithms. The focus of this paper is on linear space search which explores the AND/OR search tree. In the second paper we explore memory intensive AND/OR search algorithms. In conjunction with the AND/OR search space we investigate the power of the mini-bucket heuristics in both static and dynamic setups. We focus on two most common optimization problems in graphical models: finding the Most Probable Explanation in Bayesian networks and solving Weighted CSPs. In extensive empirical evaluations we demonstrate that the new AND/OR Branch-and-Bound approach improves considerably over the traditional OR search strategy and show how various variable ordering schemes impact the performance of the AND/OR search scheme. (C) 2009 Elsevier B.V. All rights reserved.

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

search
graphical models
bayesian networks

and/or search
decomposition
constraint networks
constraint optimization


Sensitivity and the available free space per molecule in the unit cell Invoking the known link between impact sensitivity and compressibility, we have expanded upon an earlier preliminary study of the significance of the available free space per molecule in the unit cell, Delta V. We express Delta V as V(eff) - V(int), where V(eff) corresponds to zero free space, V(eff) = molecular mass/density. V(int) is the intrinsic gas phase molecular volume. We demonstrate that V(int) can be appropriately defined as the volume enclosed by the 0.003 au contour of the molecule's electronic density; this produces packing coefficients that have the range and average value found crystallographically. Measured impact sensitivities show an overall tendency to increase as Delta V becomes larger. For nitramines, the dependence upon Delta V is rather weak; we interpret this as indicating that a single overriding factor dominates their initiation mechanism, e.g., N-NO(2) rupture. (An analogous situation appears to hold for many organic azides.) In addition to the conceptual significance of identifying Delta V as a factor in impact sensitivity, the present results allow rough estimates of relative sensitivities that are not known.

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

available free space
impact sensitivity
packing coefficients


A buffered-bandwidth approach for supporting real-time video streaming over cellular networks In this paper, we Study the admission and bandwidth allocation problems in real-time video streaming in a cellular network. Admission control in a cellular network is a complex issue due to the mobility of the clients, and the additional workload imposed by incoming clients could exceed the network capacity of a cell and seriously degrade the quality of services provided to the resident clients. To minimize the number of forced terminations of real-time video playback, we incorporate the notion of buffered bandwidth in the admission test for handoff client. Using this approach, we can balance the video workload among adjacent cells to minimize the impact of overloading as the result of handoff operations. We also examine techniques to maintain fairness in services especially under overload situations even though the requested videos from various types of clients could generate very different workload. Simulation experiments confirm the effectiveness of our approach compared to widely used schemes.

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

cellular network
bandwidth allocation
admission control


Coefficient Quantization in Banach Spaces Let (e (i) ) be a dictionary for a separable infinite-dimensional Banach space X. We consider the problem of approximation by linear combinations of dictionary elements with quantized coefficients drawn usually from a 'finite alphabet'. We investigate several approximation properties of this type and connect them to the Banach space geometry of X. The existence of a total minimal system with one of these properties, namely the coefficient quantization property, is shown to be equivalent to X containing c (0). We also show that, for every epsilon > 0, the unit ball of every separable infinite-dimensional Banach space X contains a dictionary (x (i) ) such that the additive group generated by (x (i) ) is (3+epsilon)-1-separated and 1/3-dense in X.

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


Flat image recognition in the process of microdevice assembly An image recognition system for use in the assembly of microdevices is developed. The system gives an increase in the assembly process precision. A pin-to-hole insertion task was used to test developed system. The system will be used for assembly of microring-based filters.

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

microassembly
neural classifier
neural interpolator


Partitioned time discretization for parallel solution of coupled ODE systems One decoupling method for multiphysics, multiscale, multidomain applications involves partitioning the problem via explicit time discretizations in the coupling terms. Specialized, problem-specific techniques are needed for the resulting partitioned methods to avoid time step restrictions which make long time calculations costly. This report studies unconditionally stable, uncoupled time stepping methods for a model problem sharing mathematical structure akin to the coupled atmosphere-ocean system. Three decoupled time stepping algorithms are introduced and their stability and consistency are rigorously examined. Numerical experiments are performed that study their stability and convergence properties.

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

semi-implicit implicit-explicit atmosphere-ocean nonlinear


Social-oriented visual image search We exploit social information to help understanding user intention in image search. We propose a novel scenario by combining social factor and visual factor. Social relevance is important in predicting user intention. For best performance, the weights of social factor and visual factor need a balance. Experiment result shows effectiveness in both social relevance and visual quality

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


multi-level hierarchical scheduling in ethernet switches The complexity of Networked Embedded Systems (NES) has been growing steeply, due to increases both in size and functionality, and is becoming a major development concern. This situation is pushing for paradigm changes in NES design methodologies towards higher composability and flexibility. Component-oriented design technologies, in particular supported by server-based scheduling, seem to be good candidates to provide the needed properties. As a response we developed a multi-level hierarchical server-based architecture for Ethernet switches that provides composability and supports online adaptation and reconfiguration. This paper extends our work, presenting the associated response-time based schedulability analysis, necessary for the admission control procedure. Additionally, we have derived the temporal complexity of the analysis, which is shown to be O ( n 2 ), where n is the number of higher priority components associated with a given server. Finally, we present a proof-of-concept implementation and a set of experimental results that validates the analysis.

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

real-time systems
real-time communications
real-time ethernet
response-time analysis


Computer aided erosions and osteophytes detection based on hand radiographs We introduce a new algorithm of local segmentation based on a region growing. We define a new shape description language for syntactic pattern recognition. We present a multi-stage algorithm, which expands on those created so far. We designed, implemented and tested an automatic computer system which detects erosions and osteophytes (the system operator has to only load the image and mark the area of the analysis).

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

radiographs
erosions
osteophytes
syntactic pattern recognition

medical imaging
computer aided rheumatoid diagnosis
image processing
image analysis


Perception of Blending in Stereo Motion Panoramas Most methods for synthesizing panoramas assume that the scene is static. A few methods have been proposed for synthesizing stereo or motion panoramas, but there has been little attempt to synthesize panoramas that have both stereo and motion. One faces several challenges in synthesizing stereo motion panoramas, for example, to ensure temporal synchronization between left and right views in each frame, to avoid spatial distortion of moving objects, and to continuously loop the video in time. We have recently developed a stereo motion panorama method that tries to address some of these challenges. The method blends space-time regions of a video XYT volume, such that the blending regions are distinct and translate over time. This article presents a perception experiment that evaluates certain aspects of the method, namely how well observers can detect such blending regions. We measure detection time thresholds for different blending widths and for different scenes, and for monoscopic versus stereoscopic videos. Our results suggest that blending may be more effective in image regions that do not contain coherent moving objects that can be tracked over time. For example, we found moving water and partly transparent smoke were more effectively blended than swaying branches. We also found that performance in the task was roughly the same for mono versus stereo videos.

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

performance stereo perception blending motion

experimentation
measurement
visual perception
omnistereo


Estimation of realized stochastic volatility models using Hamiltonian Monte Carlo-Based methods This study develops and compares performance of Hamiltonian Monte Carlo (HMC) and Riemann manifold Hamiltonian Monte Carlo (RMHMC) samplers with that of multi-move Metropolis-Hastings sampler to estimate stochastic volatility (SV) and realized SV models with asymmetry effect. In terms of inefficiency factor, empirical results show that the RMHMC sampler give the best performance for estimating parameters, followed by multi-move Metropolis-Hastings sampler. In particular, it is also shown that RMHMC sampler offers a greater advantage in the mixing property of latent volatility chains and in the computational time than HMC sampler.

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

hamiltonian monte carlo
inefficiency factor


Simulations of single-fluid flow in porous media Several results of lattice-gas and lattice-Boltzmann simulations of single-fluid flow in 2D and 3D porous media are discussed. Simulation results for the tortuosity, effective porosity and permeability of a 2D random porous medium are reported. A modified Kozeny-Carman law is suggested, which includes the concept of effective porosity. This law is found to fit well the simulated 2D permeabilities. The results for fluid flow through large 3D random fibre webs are also presented. The simulated permeabilities of these webs are found to be in good agreement with experimental data. The simulations also confirm that, for this kind of materials, permeability depends exponentially on porosity over a large porosity range.

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

porous medium
permeability
tortuosity
effective porosity


A robust scheme for distributed speech recognition over loss-prone packet channels In this paper, we propose a whole recovery scheme designed to improve robustness against packet losses in distributed speech recognition systems. This scheme integrates two sender-driven techniques, namely, media-specific forward error correction (FEC) and frame interleaving, along with a receiver-based error concealment (EC) technique, the weighted Viterbi algorithm (WVA). Although these techniques have been already tested separately, providing a significant increase of performance in clean acoustic environments, in this paper they are jointly applied and their performance in adverse acoustic conditions is evaluated. In particular, a noisy speech database and the ETSI Advanced Front-end are used, while the dynamic features, which play ail important role in adverse acoustic environments, and their confidences for the WVA algorithm are examined. In order to solve the issue of mixing two sender-driven techniques (both causing a delay) whose direct composition causes an increase of the global latency, we propose a double stream scheme which limits the latency to the maximum delay of both techniques. As a result, with very few overhead bits and a very limited delay, the integrated scheme achieves a significant improvement in the performance of a DSR system over a degraded transmission channel, both in clean and noisy acoustic conditions. (C) 2009 Elsevier B.V. All rights reserved.

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

distributed speech recognition
interleaving

media-specific fec
weighted viterbi decoding


Finding best-fitted rectangle for regions using a bisection method In this paper, we have presented a new method for computing the best-fitted rectangle for closed regions using their boundary points. The vertices of the best-fitted rectangle are computed using a bisection method starting with the upper-estimated rectangle and the under-estimated rectangle. The vertices of the upper- and under-estimated rectangles are directly computed using closed-form solutions by solving for pairs of straight lines. Starting with these two rectangles, we solve for the best-fitted rectangle iteratively using a bisection method. The algorithm stops when the areas of the fitted rectangles remain unchanged during consecutive iterations. Extensive evaluation of our algorithm demonstrates its effectiveness.

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

minimum bounding box
shape features
centroid
orientation
major axis
minor axis
rectangular fit
segmentation
least square method


New results on delay-dependent robust stability of uncertain time delay systems This article considers delay-dependent robust stability for linear uncertain systems with time delay. The delay is assumed to be constant and unknown, but its upper bound is known. The uncertainty is assumed to be time-varying structured uncertainties. By introducing augmented Lyapunov functional and using free-weighting matrix method, the improved delay-dependent stability and robust stability conditions will be obtained by means of linear matrix inequalities. Theoretical and numerical examples comparison suggest that the proposed conditions are less conservative than existing ones.

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


Power allocation policies with full and partial inter-system channel state information for cognitive radio networks This paper investigates several power allocation policies in orthogonal frequency division multiplexing -based cognitive radio networks under the different availability of inter-system channel state information (CSI) and the different capability of licensed primary users (PUs). Specifically, we deal with two types of PUs having different capabilities: a dumb (peak interference-power tolerable) PU and a more sophisticated (average interference-power tolerable) PU. For such PU models, we first formulate two optimization problems that maximize the capacity of unlicensed secondary user (SU) while maintaining the quality of service of PU under the assumption that both intra- and inter-system CSI are fully available. However, due to loose cooperation between SU and PU, it may be difficult or even infeasible for SU to obtain the full inter-system CSI. Thus, under the partial inter-system CSI setting, we also formulate another two optimization problems by introducing interference-power outage constraints. We propose optimal and efficient suboptimal power allocation policies for these four problems. Extensive numerical results demonstrate that the spectral efficiency achieved by SU with partial inter-system CSI is less than half of what is achieved with full inter-system CSI within a reasonable range of outage probability (e.g., less than 10%). Further, it is shown that the average interference-power tolerable PU can help to increase the saturated spectral efficiency of SU by about 20 and 50% in both cases of full and partial inter-system CSI, respectively.

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

inter-system channel state information
interference tolerability


A novel belief rule base representation, generation and its inference methodology Advancement and application of rule-based systems have always been a key research area in computer-aided support for human decision making due to the fact that rule base is one of the most common frameworks for expressing various types of human knowledge in an intelligent system. In this paper, a novel rule-based representation scheme with a belief structure is proposed firstly along with its inference methodology. Such a rule base is designed with belief degrees embedded in the consequent terms as well as in the all antecedent terms of each rule, which is shown to be capable of capturing vagueness, incompleteness, uncertainty, and nonlinear causal relationships in an integrated way. The overall representation and inference framework offers a further improvement and great extension of the recently developed belief Rule base Inference Methodology (refer to as RIMER), although they still share a common scheme at the final step of inference, i.e., the evidential reasoning (ER) approach is applied to the rule combination. It is worth noting that this new extended belief rule base representation is a great extension of traditional rule base as well as fuzzy rule base by encompassing the uncertainty description in the rule antecedent and consequent. Subsequently, a simple but efficient and powerful method for automatically generating such extended belief rule base from numerical data is proposed involving neither time-consuming iterative learning procedure nor complicated rule generation mechanisms but keeping the relatively good performance, which thanks to the new features of the extended rule base with belief structures. Then some case studies in oil pipeline leak detection and software defect detection are provided to illustrate the proposed new rule base representation, generation, and inference procedure as well as demonstrate its high performance and efficiency by comparing with some existing approaches.

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

rule-based system
belief distribution
decision-making
inference mechanisms
evidential reasoning approach


cts: An R Package for Continuous Time Autoregressive Models via Kalman Filter We describe an R package cts for fitting a modified form of continuous time autoregressive model, which can be particularly useful with unequally sampled time series. The estimation is based on the application of the Kalman filter. The paper provides the methods and algorithms implemented in the package, including parameter estimation, spectral analysis, forecasting, model checking and Kalman smoothing. The package contains R functions which interface underlying Fortran routines. The package is applied to geophysical and medical data for illustration.

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

continuous time autoregressive model
kalman filter
kalman smoothing
r


Online tree node assignment with resource augmentation Given a complete binary tree of height h, the online tree node assignment problem is to serve a sequence of assignment/release requests, where an assignment request, with an integer parameter 0a parts per thousand currency signia parts per thousand currency signh, is served by assigning a (tree) node of level (or height) i and a release request is served by releasing a specified assigned node. The node assignments have to guarantee that no node is assigned to two assignment requests unreleased, and every leaf-to-root path of the tree contains at most one assigned node. With assigned node reassignments allowed, the target of the problem is to minimize the number of assignments/reassignments, i.e., the cost, to serve the whole sequence of requests. This online tree node assignment problem is fundamental to many applications, including OVSF code assignment in WCDMA networks, buddy memory allocation and hypercube subcube allocation. Most of the previous results focus on how to achieve good performance when the same amount of resource is given to both the online and the optimal offline algorithms, i.e., one tree. In this paper, we focus on resource augmentation, where the online algorithm is allowed to use more trees than the optimal offline algorithm. By using different approaches, we give (1) a 1-competitive online algorithm, which uses (h+1)/2 trees and is optimal because (h+1)/2 trees are required by any online algorithm to match the cost of the optimal offline algorithm with one tree; (2) a 2-competitive algorithm with 3h/8+2 trees; (3) an amortized 8/3-competitive algorithm with 11/4 trees; (4) a general amortized (4/3+alpha)-competitive algorithm with (11/4+4/(3 alpha)) trees, for 0 <alpha a parts per thousand currency sign4/3.

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

tree node assignment
resource augmentation


Spline-based and stress-monitored patterning of fabric structures The shape of tensioned fabric structures is realised via a process of patterning, which involves flattening of sections, or panels, of a 3D membrane, onto a plane. The patterning method proposed here uses bicubic spline descriptions of surfaces undergoing flattening, followed by elastic analysis of strains arising from this process and from membrane pre-stress. The results, which ensure stress compatibility along panel edges, produce a cutting pattern and stress variation within it when the panel is assembled into the 3D form. They confirm a general relationship between panel width and stress deviation from the intended pre-stress reported in [1].

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


Two adaptive wavelet algorithms for non-linear parabolic partial differential equations This paper is concerned with the construction of wavelet based adaptive algorithms for the numerical resolution of evolution equations. The adaptivity is applied into two complementary directions. The first direction shares the approaches involved in classical adaptive finite element methods and is related to a solution dependent definition of spaces of approximation. The second direction is related to the approximation of evolution operators that is made solution dependent following the philosophy of essentially non-oscillatory schemes. After the construction of the schemes, numerical tests are provided. (C) 2002 Elsevier Science Ltd. All rights reserved.

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

wavelets
adaptive methods
non-linear pdes


3-D deformable image registration: A topology preservation scheme based on hierarchical deformation models and interval analysis optimization This paper deals with topology preservation in three-dimensional (3-D) deformable image registration. This work is a nontrivial extension of [34], which addresses the case of two-dimensional (2-D) topology preserving mappings. In both cases, the deformation map is modeled as a hierarchical displacement field, decomposed on a multiresolution B-spline basis. Topology preservation is enforced by controlling the Jacobian of the transformation. Finding the optimal displacement parameters amounts to solving a constrained optimization problem: The residual energy between the target image and the deformed source image is minimized under constraints on the Jacobian. Unlike the 2-D case, in which simple linear constraints are derived, the 3-D B-spline-based deformable mapping yields a difficult (until now, unsolved) optimization problem. In this paper, we tackle the problem by resorting to interval analysis optimization techniques. Care is taken to keep the computational burden as low as possible. Results on multipatient 3-D MRI registration illustrate the ability of the method to preserve topology on the continuous image domain.

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

hierarchical parametric deformation models

three-dimensional (3-d) image registration


The effect of an interactive e-drug calculations package on nursing students' drug calculation ability and self-efficacy Objective: Nurses need to be competent and confident in performing drug calculations to ensure patient safety. The purpose of this study is to compare an interactive e-drug calculations package, developed using Cognitive Load Theory as its theoretical framework, with traditional handout learning support on nursing students' drug calculation ability, self-efficacy and support material satisfaction. Design: A cluster randomised controlled trial comparing the e-package with traditional handout learning support was conducted with a September cohort (n = 137) and a February cohort (n = 92) of second year diploma nursing students. Students from each cohort were geographically dispersed over 3 or 4 independent sites. Measurements: Students from each cohort were invited to participate, halfway through their second year, before and after a 12 week clinical practice placement. During their placement the intervention group received the e-drug calculations package while the control group received traditional 'handout' support material. Drug calculation ability and self-efficacy tests were given to the participants pre- and post-intervention. Participants were given the support material satisfaction scale post-intervention. Results: Students in both cohorts randomised to e-learning were more able to perform drug calculations than those receiving the handout (September: mean 48.4% versus 34.7%, p = 0.027; February: mean 47.6% versus 38.3%, p = 0.024). February cohort students using the e-package were more confident in performing drug calculations than those students using handouts (self-efficacy mean 56.7% versus 45.8%, p = 0.022). There was no difference in improved self-efficacy between intervention and control for students in the September cohort. Students who used the package were more satisfied with its use than the students who used the handout (mean 29.6 versus 26.5, p = 0.001), particularly with regard to the package enhancing their learning (p = 0.023), being an effective way to learn (p = 0.005), providing practice and feedback (p < 0.001), being accessible (p = 0.027), user friendly (p = 0.02) and providing learning enjoyment (p = 0.022). Conclusion: It is essential that nurses are educated and supported to become, and remain, confident and competent in performing drug calculations. This study found the e-drug calculations package, based on Cognitive Load Theory, to be significantly more effective than a handout in improving students' drug calculation ability and self-efficacy, with students who used the package being significantly more satisfied with its use than students who used the handout. This package could particularly be useful for the continuing professional development of any healthcare professional involved in drug calculations. (C) 2011 Elsevier Ireland 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 B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

computer-assisted instruction
drug dosage calculations
medication errors
nursing education
self-efficacy


Real-time ambient occlusion and halos with Summed Area Tables Volume models often show high depth complexity. This poses difficulties to the observer in judging the spatial relationships accurately. Illustrators usually use certain techniques such as improving the shading through shadows, halos, or edge darkening in order to enhance depth perception of certain structures. Both effects are difficult to generate in real-time for volumetric models. Either they may have an important impact in rendering time, or they require precomputation that prevents changing the transfer function interactively, as it determines the occlusions. In this paper we present two methods for the fast generation of ambient occlusion on volumetric models. The first is a screen-space approach that does not require any precomputed data structure. The second is a view independent method that stores volumetric information in the form of a Summed Area Table of the density values, and thus, allows the interactive change of transfer functions on demand, although at the expense of memory space. Despite the fact that similar quality results are obtained with both approaches, the 3D version is more suitable for objects with discontinuous structures such as a vessels tree or the intestines, and it yields better framerates. The screen-space version is more suitable in limited GPU memory environments because it does not need extra 3D texture storage. As an extra result, our screen-space technique also allows for the computation of view dependent, interactively configurable halos using the same data structure. We have also implemented both methods using CUDA and have analyzed their efficiency.

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

gpu-based volume ray casting
depth perception enhancement
halo rendering


Planning biped locomotion using motion capture data and probabilistic roadmaps Typical high-level directives for locomotion of human-like characters are useful for interactive games and simulations as well as for off-line production animation. In this paper, we present a new scheme for planning natural-looking locomotion of a biped figure to facilitate rapid motion prototyping and task-level motion generation. Given start and goal positions in a virtual environment, our scheme gives a sequence of motions to move from the start to the goal using a set of live-captured motion clips. Based on a novel combination of probabilistic path planning and hierarchical displacement mapping, our scheme consists of three parts: roadmap construction, roadmap search, and motion generation. We randomly sample a set of valid footholds of the biped figure from the environment to construct a directed graph, called a roadmap, that guides the locomotion of the figure. Every edge of the roadmap is associated with a live-captured motion clip. Augmenting the roadmap with a posture transition graph, we traverse it to obtain the sequence of input motion clips and that of target footprints. We finally adapt the motion sequence to the constraints specified by the footprint sequence to generate a desired locomotion.

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

biped locomotion
probabilistic path
planning

algorithms
experimentation
theory
human navigation
motion editing and adaptation


network synchronization and localization based on stolen signals We consider an anchor-free, relative localization and synchronization problem where a set of n receiver nodes and m wireless signal sources are independently, uniformly, and randomly distributed in a disk in the plane. The signals can be distinguished and their capture times can be measured. At the beginning neither the positions of the signal sources and receivers are known nor the sending moments of the signals. Now each receiver captures each signal after its constant speed journey over the unknown distance between signal source and receiver position. Given these nm capture times the task is to compute the relative distances between all synchronized receivers. In a more generalized setting the receiver nodes have no synchronized clocks and need to be synchronized from the capture times of the stolen signals.

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


Shielding area optimization under the solution of interconnect crosstalk As the technology advances into deep sub-micron era, crosstalk reduction is of paramount importance for signal integrity. Simultaneous shield insertion and net ordering (SINO) has been shown to be effective to reduce both capacitive and inductive couplings. As it introduces extra shields, area minimization is also critical for an efficient SINO algorithm. In this paper, three novel algorithms using fewer shields to solve crosstalk reduction problem with RLC noise constraint are proposed, namely, net coloring (NC), efficient middle shield insertion (EMSI) and NC+EMSI two-step algorithm. Compared with the corresponding algorithms in previous work, these algorithms can reduce shielding area up to 25.77%, 46.19%, and 7.17%, respectively, with short runtime.

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


time-aware test-case prioritization using integer linear programming Techniques for test-case prioritization re-order test cases to increase their rate of fault detection. When there is a fixed time budget that does not allow the execution of all the test cases, time-aware techniques for test-case prioritization may achieve a better rate of fault detection than traditional techniques for test-case prioritization. In this paper, we propose a novel approach to time-aware test-case prioritization using integer linear programming. To evaluate our approach, we performed experiments on two subject programs involving four techniques for our approach, two techniques for an approach to time-aware test-case prioritization based on genetic algorithms, and four traditional techniques for test-case prioritization. The empirical results indicate that two of our techniques outperform all the other techniques for the two subjects under the scenarios of both general and version-specific prioritization. The empirical results also indicate that some traditional techniques with lower analysis time cost for test-case prioritization may still perform competitively when the time budget is not quite tight.

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


Optimum rigid pavement design by genetic algorithms The design of rigid pavements according to AUSTROADS involves assuming a pavement structure then using a number of tables and figures to calculate the two governing design criteria, the flexural fatigue of the concrete base and the erosion of the sub-grade/sub-base. Each of these two criteria needs to be less than 100%. The designer needs to ensure that both criteria are near 100% so that safe and economical designs are achieved. This paper presents a formulation for the problem of optimum rigid road pavement design by defining the objective function, which is the total cost of pavement materials, and all the constraints that influence the design. A genetic algorithm is used to find the optimum design. The results obtained from the genetic algorithm are compared with results obtained from a NewtonRaphson based optimisation solver. The latter being developed using spreadsheets.

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


Delay analysis of randomised algorithms for link scheduling in wireless networks To design a link scheduling algorithm that can maximise the throughput region yet meet the average delay constraint is a challenging issue in wireless networks. In this paper we aim to analyse and improve the delay performance of the well-studied randomised link scheduling algorithms. To this end, we first introduce a novel concept, the average hitting time, and analyse its impact on the upper bound of the average delay. We analytically show that for two given randomised algorithms achieving the same throughput region, the one with a smaller average hitting time has less average delay bound. We also show that by assigning traffic priorities in some specific applications, the achievable throughput region delivered by the randomised algorithm remains intact. This result is much valuable in the design of algorithms for some real-time applications by prioritising the traffic to reduce the average delay of those applications. The simulation results are consistent with our theoretical analysis.

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

wireless networks
link scheduling
randomised algorithm
delay
throughput region

ad hoc networks
maximum weight matching
lyapunov drift


Improving accuracy in Mitchell's logarithmic multiplication using Operand Decomposition Logarithmic number systems (LNS) offer a viable alternative in terms of area, delay, and power to binary number systems for implementing multiplication and division operations for applications in signal processing. The Mitchell algorithm ( MA), proposed in [ 15], reduces the complexity of finding the logarithms and the antilogarithms using piecewise straight line approximations of the logarithm and the antilogarithm curves. The approximations, however, result in some loss of accuracy. Thus, several methods have been proposed in the literature for improving the accuracy of Mitchell's algorithm. In this work, we investigate a new method based on Operand Decomposition ( OD) to improve the accuracy of Mitchell's algorithm when applied to logarithmic multiplication. In the OD technique proposed in [ 9] for reducing the amount of switching activity in binary multiplication, the two inputs to be multiplied are together decomposed into four binary operands and the product is expressed as the sum of the products of the decomposed numbers. We show that applying operand decomposition to the inputs as a preprocessing step to Mitchell's multiplication algorithm significantly improves the accuracy. Experimental results indicate that the proposed algorithm for logarithmic multiplication reduces the error percentage of Mitchell's algorithm by 44.7 percent on the average. It is also shown that the OD method yields further improvement when combined with the other correction methods proposed in the literature.

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

computer arithmetic
error analysis
logarithmic number system
interpolation


Solo versus collaborative writing: Discrepancies in the use of tables and graphs in academic articles The number of authors collaborating to write scientific articles has been increasing steadily, and with this collaboration, other factors have also changed, such as the length of articles and the number of citations. However, little is known about potential discrepancies in the use of tables and graphs between single and collaborating authors. In this article, we ask whether multiauthor articles contain more tables and graphs than single-author articles, and we studied 5,180 recent articles published in six science and social sciences journals. We found that pairs and multiple authors used significantly more tables and graphs than single authors. Such findings indicate that there is a greater emphasis on the role of tables and graphs in collaborative writing, and we discuss some of the possible causes and implications of these findings.

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


Self-repairing adder using fault localization All full-adders are self-checking with respect to their individual functionality. Self-checking CSeA with fault localization and reduced area overhead is achieved. A reliable carry propagation chain has been designed. Our self-repairing adder can provide reliable output for more than one fault.

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

self-checking adder
carry-select adder
self-repairing adder
multiple faults


From paper-and-pen annotations to artefact-based mobile learning Making annotations on books and learning materials is part of students' everyday life. Although there are many computer-based annotation systems, many people prefer to print digital documents and make annotations on physical paper. We introduce a classification scheme for computer-based annotation systems and provide an overview of different systems using this scheme. During our investigations, we identified several shortcomings in existing annotation systems: limitation to single document formats, no capturing of relations to reflect lateral reading, loss of context information an annotation was created in and limited sharing capabilities among collaborative users. To overcome these shortcomings, we introduce the concepts of Anchor Points, Artefacts and Spaces. Anchor Points define locations in arbitrary documents. Artefacts capture annotations on multiple Anchor Points in several documents, allowing students to map their current working context that typically contains several open documents and a relationship between them. Spaces are repositories for the learning materials and annotations that are automatically replicated among collaborative mobile users.

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

annotation systems
artefacts
context
mobile learning


towards a narrative-oriented approach in media architecture design This paper proposes a narrative-oriented approach in media architecture design, which encourages people to get involved and interact due to the scenario rendering characteristics of the space. In the context of current digital media technologies, this paper begins by reviewing the postmodernism architects' vision of architecture "as signs and systems" which represent its "characteristics". One question that is raised is: Within the limits of technologies, to what extent, can we integrate narratives in media architecture to fabricate a comprehensive user experience, through which the building's characteristics are better represented and the branding message better delivered? This paper then, endeavors to find answers and solutions to this challenge within three case studies of ongoing media architecture projects, in which the narrative methodologies are integrated with interactive digital media design.

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

programmatic narratives
real estate branding


A fractional-step thermal lattice Boltzmann model for high Peclet number flow As a promising approach in hydrodynamics and thermodynamics modeling, the lattice Boltzmann method (LBM) still suffers severe numerical instability when the temperature field of the flow is convection-dominant (high Peclet number). Despite a lot of research devoted to solve this problem worldwide, to simulate high Peclet number thermal flow at comparably few computational cost is still a hard work, making it inefficient in practical use. In this paper, we combine the LBM and the fractional-step method to propose a novel and stable thermal lattice Boltzmann scheme for high Peclet number flow without refining the lattice. By numerical tests of thermal Poiseuille flow and Couette flow, we quantify second-order accuracy of the proposed model, and through several cases of Peclet number from low to high, the superior stability and efficiency compared with existing thermal lattice Boltzmann model.

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

fractional-step method
strang operator splitting
high peclet number (pe)
polymer injection molding


Examining multi-dimensional trust and multi-faceted risk in initial acceptance of emerging technologies: An empirical study of mobile banking services The factors affecting rejection or acceptance of an emerging IT artifact such as mobile banking have piqued interest among IS researchers and remain unknown due in part to consumers' trust and risk perceptions in the wireless platform. This study extends this line of research by conjointly examining multi-dimensional trust and multi-faceted risk perceptions in the initial adoption stage of the wireless Internet platform. Results of this study indicate that risk perception, derived from eight different facets, is a salient antecedent to innovative technology acceptance. Beyond prior studies, the results also provide empirical support for employing personal trait factors in analyzing acceptance of emerging IT artifacts.

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

mobile banking
trust
innovative technology

acceptance of technology
perceived risk
self-efficacy
partial least squares (pls)


Fundamental methodological issues of syntactic pattern recognition Fundamental open problems, which are frontiers of syntactic pattern recognition are discussed in the paper. Methodological considerations on crucial issues in areas of string and graph grammar-based syntactic methods are made. As a result, recommendations concerning an enhancement of context-free grammars as well as constructing parsable and inducible classes of graph grammars are formulated.

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


Highly scalable computational algorithms on emerging parallel machine multicore architectures: development and implementation in CFD context In this paper, the first in a series, the authors have developed and implemented new computational algorithms for improving the scalability of CFD simulations on emerging architectures such as multicore high performance computing (HPC) platforms. These algorithmic developments and implementations are classified into three categories: (i) improved partition for multicore platforms, (ii) improved and optimized communication for HPC and (iii) enhancing scalability using computer science based methods. In the first category, the multilevel partitioning strategy was modified to reduce the number of out-of-core communications. This resulted in noticeable speedup even for small cases. In the second category, the authors came up with a next generation communication procedure optimized for the architecture and the partitioning. This next generation communication resulted in noticeable speedups. In the third category, improvements with respect to better management of memory were implemented. This again resulted in a speedup of nearly 10%. The overall scalability, as a result of the three algorithmic implementations, yielded ideal and at times superlinear scalability until 3000 processors. In general, the scalability results are very promising and indicate that the approach has a great potential for more complicated multidisciplinary problems such as fluid-structure interaction and aeroelastic simulations. Copyright (c) 2013 John Wiley & Sons, Ltd.

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

hpc multicore partitioning communication


Fast surface segmentation guided by user input using implicit extension of minimal paths We introduce a novel implicit approach for single object segmentation in 3D images. The boundary surface of this object is assumed to contain two or more known curves (the constraining curves), given by an expert. The aim of our method is to find the desired surface by exploiting the information given in the supplied curves as much as possible. We use a cost potential which penalizes image regions of low interest (for example areas of low gradient). In order to avoid local minima, we introduce a new partial differential equation and use its solution for segmentation. We show that the zero level set of this solution contains the constraining curves as well as a set of paths joining them. These paths globally minimize an energy which is defined from the cost potential. Our approach, although conceptually different, can be seen as an implicit extension to 3D of the minimal path framework already known for 2D image segmentation. As for this previous approach, and unlike other variational methods, our method is not prone to local minima traps of the energy. We present a fast implementation which has been successfully applied to 3D medical and synthetic images.

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

active contours
level set method
object extraction
stationary transport equation


Nonlocal linear minimum mean square error methods for denoising MRI We introduced four filters based on LMMSE estimation for denoising MR images produced with single coil MRI. The self-similarity and natural redundancy of the magnitude MR image are considered to achieve high denoising performance. Finding best samples for LMMSE estimation in DCT domain will improve the denoising performance. Nonlocal PCA domain shrinkage is used as a refinement stage to further remove the uncorrelated noise.

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

denoising
linear minimum mean square error

discrete cosine transform
magnetic resonance image
principal component analysis
rician distribution


Model averaging software for dichotomous dose response risk estimation Model averaging has been shown to be a useful method for incorporating model uncertainty in quantitative risk estimation. In certain circumstances this technique is computationally complex, requiring sophisticated software to carry out the computation. We introduce software that implements model averaging for risk assessment based upon dichotomous dose-response data. This software, which we call Model Averaging for Dichotomous Response Benchmark Dose (MADr-BMD), fits the quantal response models, which are also used in the US Environmental Protection Agency benchmark dose software suite, and generates a model-averaged dose response model to generate benchmark dose and benchmark dose lower bound estimates. The software fulfills a need for risk assessors, allowing them to go beyond one single model in their risk assessments based on quantal data by focusing on a set of models that describes the experimental data.

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


Empirical studies concerning the maintenance of UML diagrams and their use in the maintenance of code: A systematic mapping study The Unified Modelling Language (UML) has, after ten years, become established as the de facto standard for the modelling of object-oriented software systems. It is therefore relevant to investigate whether its use is important as regards the costs involved in its implantation in industry being worthwhile. We have carried out a systematic mapping study to collect the empirical studies published in order to discover What is the current existing empirical evidence with regard to the use of UML diagrams in source code maintenance and the maintenance of the UML diagrams themselves? We found 38 papers, which contained 63 experiments and 3 case studies. Although there is common belief that the use of UML is beneficial for source code maintenance, since the quality of the modifications is greater when UML diagrams are available, only 3 papers concerning this issue have been published. Most research (60 empirical studies) concerns the maintainability and comprehensibility of the UML diagrams themselves which form part of the systems documentation, since it is assumed that they may influence source code maintainability, although this has not been empirically validated. Moreover, the generalizability of the majority of the experiments is questionable given the material, tasks and subjects used. There is thus a need for more experiments and case studies to be performed in industrial contexts, i.e., with real systems and using maintenance tasks conducted by practitioners under real conditions that truly show the utility of UML diagrams in maintaining code, and that the fact that a diagram is more comprehensible or modifiable influences the maintainability of the code itself. This utility should also be studied from the viewpoint of cost and productivity, and the consistent and simultaneous maintenance of diagrams and code must also be considered in future empirical studies.

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

uml
empirical studies
systematic mapping study

software maintenance
systematic literature review


Harris function based active contour external force for image segmentation Deformable active contour (snake) models are efficient tools for object boundary detection. Existing alterations of the traditional gradient vector flow (GVF) model have reduced sensitivity to noise, parameters and initial location, but high curvatures and noisy, weakly contrasted boundaries cause difficulties for them. This paper introduces two Harris based parametric snake models, Harris based gradient vector flow (HGVF) and Harris based vector field convolution (HVFC), which use the curvature-sensitive Harris matrix to achieve a balanced, twin-functionality (corner and edge) feature map. To avoid initial location sensitivity, starting contour is defined as the convex hull of the most attractive points of the map. In the experimental part we compared our methods to the traditional external energy-inspired state-of-the-art GVF and VFC; the recently published parametric decoupled active contour (DAC) and the non-parametric ChanVese (ACWE) techniques. Results show that our methods outperform the classical approaches, when tested on images with high curvature, noisy boundaries.

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

gradient vector flow
vector field convolution

boundary extraction
harris corner detection


integer representations of convex polygon intersection graphs We give the first lower bounds on the grid size needed to represent the intersection graphs of~convex polygons. Here each corner of a polygon in the representation must lie on a corner of the grid. We provide a series of geometric constructions showing that for intersection graphs of: translated copies of any fixed parallelogram, grids of size ?(n 2 ) x ?(n 2 ) are needed; translated copies of any other fixed convex polygon, grids of size 2 ?(n) x 2 ?(n) are needed; homothetic copies of any fixed convex polygon, grids of size 2 ?(n) x 2 ?(n) are needed. We complement these results by giving a matching upper bound in each case. Hence we settle the complexity of the integer representation problem for these graphs. The upper bounds substantially improve earlier bounds and extend to higher dimensions.

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

upper and lower bounds
geometric intersection graphs
convex polygons


Who publishes in predatory journals? Many open access journals have a reputation for being of low quality and being dishonest with regard to peer review and publishing costs. Such journals are labeled predatory journals. This study examines author profiles for some of these predatory journals as well as for groups of more well-recognized open access journals. We collect and analyze the publication record, citation count, and geographic location of authors from the various groups of journals. Statistical analyses verify that each group of journals has a distinct author population. Those who publish in predatory journals are, for the most part, young and inexperienced researchers from developing countries. We believe that economic and sociocultural conditions in these developing countries have contributed to the differences found in authorship between predatory and nonpredatory journals.

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

scholarly publishing
commercial publishers
open access publications


Squeezing a sponge: a three-dimensional solution in poroelasticity A three-dimensional solution is derived for the fluid flow in a deformable porous medium. It is assumed that the deformation of the medium is described by Hooke's law and the flow of the fluid by Darcy's law, i.e. the theory of poroelasticity applies. The governing equations are completed by suitable boundary conditions such that a compressed saturated cubic sponge is modelled. The solution is a three-dimensional generalisation of the one-dimensional solution of Terzaghi. A two-dimensional plane strain solution is derived also. Both solutions give excellent possibilities to test numerical codes.

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


The Robin Hood method - A novel numerical method for electrostatic problems based on a non-local charge transfer We introduce a novel numerical method, named the Robin Hood method, of solving electrostatic problems. The approach of the method is closest to the boundary element methods, although significant conceptual differences exist with respect to this class of methods. The method achieves equipotentiality of conducting surfaces by iterative non-local charge transfer. For each of the conducting surfaces,. non-local charge transfers are performed between surface elements, which differ the most from the targeted equipotentiality of the surface. The method is tested against analytical solutions and its wide range of application is demonstrated. The method has appealing technical characteristics. For the problem with N surface elements, the computational complexity of the method essentially scales with N-x, where alpha < 2, the required computer memory scales with N, while the error of the potential decreases exponentially with the number of iterations for many orders of magnitude of the error, without the presence of the Critical Slowing Down. The Robin Hood method could prove useful in other classical or even quantum problems. Some future development ideas for possible applications outside electrostatics are addressed. (c) 2005 Elsevier Inc. All rights reserved.

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

electrostatics
robin hood
equipotentiality
critical slowing down

non-local charge transfer
real space dft
numerical methods


models for metasearch Given the ranked lists of documents returned by multiple search engines in response to a given query, the problem of metasearch is to combine these lists in a way which optimizes the performance of the combination. This paper makes three contributions to the problem of metasearch: (1) We describe and investigate a metasearch model based on an optimal democratic voting procedure, the Borda Count; (2) we describe and investigate a metasearch model based on Bayesian inference; and (3) we describe and investigate a model for obtaining upper bounds on the performance of metasearch algorithms. Our experimental results show that metasearch algorithms based on the Borda and Bayesian models usually outperform the best input system and are competitive with, and often outperform, existing metasearch strategies. Finally, our initial upper bounds demonstrate that there is much to learn about the limits of the performance of metasearch.

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

strategies input performance demonstrate response model paper metasearch voting query

systems
experimentation
search engine
optimality
competition
learning
algorithm
documentation
combinational


Gate-level power and current simulation of CMOS integrated circuits In this paper, we present a new gate-level approach to power and current simulation, We propose a symbolic model of complementary metal-oxide-semiconductor (CMOS) gates to capture the dependence of power consumption and current hows on input patterns and fan-in/fan-out conditions. Library elements are characterized once for all and their models are used during event-driven logic simulation to provide power information and construct time-domain current waveforms, We provide both global and local pattern-dependent estimates of power consumption and current peaks (with accuracy of 6 and 10% from SPICE, respectively), while keeping performance comparable with traditional gate-level simulation with unit delay. We use VERILOG-XL as simulation engine to grant compatibility with design tools based on Verilog HDL, A Web-based user interface allows our simulator (PPP) to be accessed through the Internet using a standard web browser.

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


BOUNDED LINEAR PROGRAMS WITH TRAPEZOIDAL FUZZY NUMBERS Recently Ganesan and Veeramani introduced a new approach for solving a kind of linear programming problems involving symmetric trapezoidal fuzzy numbers without converting them to the crisp linear programming problems. But their approach is not efficient for situations in which some or all variables are restricted to lie within fuzzy lower and fuzzy upper bounds. In this paper, by a natural extension of their approach we obtain some new results leading to a new method to overcome this shortcoming.

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

bounded linear programming
fuzzy arithmetic
fuzzy linear programming
fuzzy ordering


Application of global sensitivity analysis and uncertainty quantification indynamic modelling of micropollutants in stormwater runoff The need for estimating micropollutants fluxes in stormwater systems increases the role of stormwater quality models as support for urban water managers, although the application of such models is affected by high uncertainty. This study presents a procedure for identifying the major sources of uncertainty in a conceptual lumped dynamic stormwater runoff quality model that is used in a study catchment to estimate (i) copper loads, (ii) compliance with dissolved Cu concentration limits on stormwater discharge and (iii) the fraction of Cu loads potentially intercepted by a planned treatment facility. The analysis is based on the combination of variance-decomposition Global Sensitivity Analysis (GSA) with the Generalized Likelihood Uncertainty Estimation (GLUE) technique. The GSA-GLUE approach highlights the correlation between the model factors defining the mass of pollutant in the system and the importance of considering hydrological parameters as source of uncertainty when calculating Cu loads and concentrations due to their influence. The influence of hydrological parameters on simulated concentrations changes during rain events. Four informal likelihood measures are used to quantify model prediction bounds. The width of the uncertainty bounds depends on the likelihood measure, with the inverse variance based likelihood more suitable for covering measured pollutographs. Uncertainty for simulated concentration is higher than for Cu loads, which again shows lower uncertainty compared to studies neglecting the hydrological submodel as source of uncertainty. A combined likelihood measure ensuring both good predictions in flow and concentration is used to identify the parameter sets used for long time simulations. These results provide a basis for reliable application of models as support in the development of strategies aiming to reduce discharge of stormwater micropollutants to the aquatic environment.

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

generalized likelihood uncertainty estimation

sobol sensitivity indices
glue-gsa approach
pollution control strategies
sewsys


Multiset rewriting for the verification of depth-bounded processes with name binding We combine two of the existing approaches to the study of concurrency by means of multiset rewriting: multiset rewriting with existential quantification (MSR) and constrained multiset rewriting. We obtain nu-MSR, where we rewrite multisets of atomic formulae, in which terms can only be pure names, where some names can be restricted. We consider the subclass of depth-bounded nu-MSR, for which the interdependence of names is bounded. We prove that they are strictly Well Structured Transition Systems, so that coverability, termination and boundedness are all decidable for depth-bounded nu-MSR. This allows us to obtain new verification results for several formalisms with name binding that can be encoded within nu-MSR, namely polyadic nu-PN (Petri nets with tuples of names as tokens), the pi-calculus, MSR or Mobile Ambients. (C) 2012 Elsevier Inc. All rights reserved.

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

multiset rewriting
verification
petri nets

depth-bounded ness
wsts
decidability
process algebra


On acoustic very near field measurements Experimental, numerical and analytical investigations of possibility for measurements in a very near field. Analysis of the very near field in front of the vibrating surface with nodes and antinodes. Vibration modes visualization using a microphone scanning in a very near field. Numerical stability of the Inverse Numerical Acoustic used for the vibration mode visualization.

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

acoustics
inverse methods
sound source visualization
near field acoustic holography


Incremental maintenance of generalized association rules under taxonomy evolution Mining association rules from large databases of business data is an important topic in data mining. In many applications, there are explicit or implicit taxonomies (hierarchies) for items, so it may be useful to find associations at levels of the taxonomy other than the primitive concept level. Previous work on the mining of generalized association rules, however, assumed that the taxonomy of items remained unchanged, disregarding the fact that the taxonomy might be updated as new transactions are added to the database over time. If this happens, effectively updating the generalized association rules to reflect the database change and related taxonomy evolution is a crucial task. In this paper, we examine this problem and propose two novel algorithms, called IDTE and IDTE2, which can incrementally update the generalized association rules when the taxonomy of items evolves as a result of new transactions. Empirical evaluations show that our algorithms can maintain their performance even for large numbers of incremental transactions and high degrees of taxonomy evolution, and are faster than applying contemporary generalized association mining algorithms to the whole updated database.

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

data mining
generalized association rules
incremental maintenance
taxonomy evolution


A three-dimensional criterion for asymptotic states The asymptotic state of a soil is affected by stress states and deformation constraints. Experimental results indicate that the stress ratio approaches a constant when soil is loaded along with a strain path. Such a stable state is referred to as the asymptotic state. Indeed, failure can be viewed as a special condition of asymptotic states. Therefore, the shear strength of a soil at its failure state can also be interpreted by the criterion for asymptotic states. A three-dimensional criterion for asymptotic states that can take into account the influence of deformation constraints is proposed in this technical note. By involving both triaxial compression and extension tests to calibrate a new fitting parameter, ?, the proposed criterion can provide an accurate simulation of the influence of Lodes angle. The performance of the proposed three-dimensional criterion for asymptotic states is investigated via numerical examples and then validated against experimental results.

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

asymptotic state
deformation constraints


A mechanism for supporting collective innovation: the open contract-based challenge The paper proposes a multi-attribute combinatorial auction-based mechanism, called open contract mechanism (OCM), which allows an organization or an individual (seeker) to dynamically and simultaneously bargain the features of distinct innovation contracts with other organizations and individuals (solvers), in general collective innovation environments. In such contexts, a seeker does not possess specific skills and technical knowledge which are crucial for an innovation or for a part of a new product development project, while some solvers might be willing to provide their relevant know-how to the seeker. To induce collaboration between the seeker and solvers, voluntary and legally enforceable agreements need to be formulated, where a fair evaluation of the intellectual property rights of any party is guaranteed, and all technical and economic aspects are detailed. Therefore, OCM allows the seeker to involve solvers in defining a collection of open contract schemes, related to the supply of the required specific skills and technical knowledge. The solvers must submit offers in terms of contract versions of these contract schemes. In such a way, OCM aims at partially extracting from the solvers their multidimensional private information regarding economic and technical issues, in order to reduce the occurrences of pre- and post-contractual opportunistic behaviours.

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

crowdsourcing
incomplete contracts
multi-attribute auctions
combinatorial auctions


handling data sparsity in collaborative filtering using emotion and semantic based features Collaborative filtering (CF) aims to recommend items based on prior user interaction. Despite their success, CF techniques do not handle data sparsity well, especially in the case of the cold start problem where there is no past rating for an item. In this paper, we provide a framework, which is able to tackle such issues by considering item-related emotions and semantic data. In order to predict the rating of an item for a given user, this framework relies on an extension of Latent Dirichlet Allocation, and on gradient boosted trees for the final prediction. We apply this framework to movie recommendation and consider two emotion spaces extracted from the movie plot summary and the reviews, and three semantic spaces: actor, director, and genre. Experiments with the 100K and 1M MovieLens datasets show that including emotion and semantic information significantly improves the accuracy of prediction and improves upon the state-of-the-art CF techniques. We also analyse the importance of each feature space and describe some uncovered latent groups.

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

semantic
collaborative filtering
emotion


The robot in the mirror Humans maintain a body image of themselves, which plays a central role in controlling bodily movement, planning action, recognising and naming actions performed by others, and requesting or executing commands. This paper explores through experiments with autonomous humanoid robots how such a body image could form. Robots play a situated embodied language game called the Action Game in which they ask each other to perform bodily actions. They start without any prior inventory of names, without categories for visually recognising body movements of others, and without knowing the relation between visual images of motor behaviours carried out by others and their own motor behaviours. Through diagnostic and repair strategies carried out within the context of action games, they progressively self-organise an effective lexicon as well as bi-directional mappings between the visual and the motor domain. The agents thus establish and continuously adapt networks linking perception, body representation, action and language.

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

self organisation
lexicon acquisition
embodied language games


energy-efficient cache coherence protocol for noc-based mpsocs As the number of cores and functionalities integrated in embedded devices increases, the amount of memory used on these devices also increases, justifying the development of memory architectures presenting scalability, low energy consumption and low latency. To implement memory solutions, most works adopting NoC-based MPSoCs only employ basic communication services, such as send/receive, without exploring the services NoCs can offer, for instance connection, priorities and multicast communication. Multicast can be used to optimize the cache coherence protocol, leading to both traffic and energy consumption reduction. The goal of this work is to optimize a directory-based cache coherence protocol exploiting specific NoC services, as multicast and priorities. To demonstrate our proposal, an MPSoC described at the RTL level is used, enabling accurate performance and energy evaluation. Results show a reduction of 17\% in the number of clock cycles and a reduction up to 86\% (average reduction: 39\%) in energy consumption for some memory transactions.

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