Fairness in systems based on multiparty interactions In the context of the Multiparty Interaction Model, fairness is used to insure that an interaction that is enabled sufficiently often in a concurrent program will eventually be selected for execution. Unfortunately, this notion does not take conspiracies into account, i.e. situations in which an interaction never becomes enabled because of an unfortunate interleaving of independent actions; furthermore, eventual execution is usually too weak for practical purposes since this concept can only be used in the context of infinite executions. In this article, we present a new fairness notion, k-conspiracy-free fairness, that improves on others because it takes finite executions into account, alleviates conspiracies that are not inherent to a program, and k may be set a priori to control its goodness to address the above-mentioned problems. Copyright (C) 2003 John Wiley Sons, Ltd.

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

multiparty interactions
fairness
conspiracies


an analysis of representations for hyper-heuristics for the uncapacitated examination timetabling problem in a genetic programming system Earlier research into the examination timetabling problem focused on applying different methodologies to generate solutions to the problem. More recently research has been directed at developing hyper-heuristic systems for timetable construction. Hyper-heuristic systems are used to decide which examination to schedule next during the timetable construction process and aim at allocating those examinations that are most difficult to schedule first. This study investigates using a genetic programming based hyper-heuristic system to evolve heuristic combinations for the uncapacitated examination timetabling problem. More specifically it presents and evaluates three different representations for heuristic combinations in a genetic programming system. The performance of the genetic programming based system using the different representations is applied to three examination timetabling problems with different characteristics and the performance on these problems is compared. The results obtained are also compared to that of other hyper-heuristic systems applied to the same problems.

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

examination timetabling
genetic programming


CORRELATION ENERGY AND ENTANGLEMENT GAP IN CONTINUOUS MODELS Our goal is to clarify the relation between entanglement and correlation energy in a bipartite system with infinite dimensional Hilbert space. To this aim, we consider the completely solvable Moshinsky's model of two linearly coupled harmonic oscillators. Also, for small values of the couplings, the entanglement of the ground state is nonlinearly related to the correlation energy, involving logarithmic or algebraic corrections. Then, looking for witness observables of the entanglement, we show how to give a physical interpretation of the correlation energy. In particular, we have proven that there exists a set of separable states, continuously connected with the Hartree-Fock state, which may have a larger overlap with the exact ground state, but also a larger energy expectation value. In this sense, the correlation energy provides an entanglement gap, i.e. an energy scale, under which measurements performed on the 1-particle harmonic sub-system can discriminate the ground state from any other separated state of the system. However, in order to verify the generality of the procedure, we have compared the energy distribution cumulants for the 1-particle harmonic sub-system of the Moshinsky's model with the case of a coupling with a damping Ohmic bath at 0 temperature.

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

moshinsky's model
harmonic oscillator
hartree-fock state


new approach to evaluate the effectiveness of the audio information protection for determining the identity of virtual speech images In this paper, we describe new approach to evaluate the effectiveness of the audio information protection for determining the identity of virtual speech images

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

legibility
information security
virtual adaptive scrambling
virtual scrambling
scrambling
redundancy


Fourier analysis of the generalized CMAC neural network The Cerebellar Model Articulation Controller (CMAC) is a simple and fast neural network: these characteristics have extended its successful applications, while the analysis of its representation capabilities, as for many other neural networks, did not follow a similar development. In this article we discover the close parallelism between the representation of a function by a Generalized CMAC (GCMAC) and Nyquist sampling theory: discussing the role of different parameters and components of the network according to this similarity. The consideration of a representative example shows how the parallelism can be used to design a GCMAC adapted to its particular application.

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

associative memory
function approximation
modeling capabilities


the complexity of computing a nash equilibrium We resolve the question of the complexity of Nash equilibrium by showing that the problem of computing a Nash equilibrium in a game with 4 or more players is complete for the complexity class PPAD. Our proof uses ideas from the recently-established equivalence between polynomial time solvability of normal form games and graphical games, establishing that these kinds of games can simulate a PPAD-complete class of Brouwer functions.

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


TCP Libra: Derivation, analysis, and comparison with other RTT-fair TCPs The Transmission Control Protocol (TCP), the most widely used transport protocol over the Internet, has been advertised to implement fairness between flows competing for the same narrow link. However, when session round-trip-times (RTTs) radically differ, the share may be anything but fair. This RTT-unfairness represents a problem that severely affects the performance of long-RTT flows and whose solution requires a revision of TCPs congestion control scheme. To this aim, we discuss TCP Libra, a new transport protocol able to ensure fairness and scalability regardless of the RTT, while remaining friendly towards legacy TCP. As main contributions of this paper: (i) we focus on the model derivation and show how it leads to the design of TCP Libra; (ii) we analyze the role of its parameters and suggest how they may be adjusted to lead to asymptotic stability and fast convergence; (iii) we perform model-based, simulative, and real testbed comparisons with other TCP versions that have been reported as RTT-fair in the literature. Results demonstrate the ability of TCP Libra in ensuring RTT-fairness while remaining throughput efficient and friendly towards legacy TCP.

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


Automated seismic event location for hydrocarbon reservoirs An automatic monitoring system has been developed to process continuously recorded microseismic data and locate the associated events. To this end we use P- and S-wave travel times and the direction of the incoming wave field. The processing is organised in four modules: (i) a multi-channel detection algorithm based on signal-to-noise ratios, (ii) a P-wave onset determination based on error prediction filtering with an auto-regressive model, (iii) a P-wave polarisation analysis providing the direction of the incoming wave field, and (iv) a rotation of seismic traces into the ray coordinate system with subsequent S-wave onset determination. For a homogeneous velocity model the event hypocenter is determined by a linearised inversion technique, and for a three-dimensional (3D) velocity model a directed grid search method or the neighbourhood algorithm is applied. We applied the monitoring system to a microseismic data set from the Ekofisk oil field in the North Sea and located about 2000 microseismic events close to the borehole receiver string. Most of the microseismic events occurred in clusters and in a depth range from 2800 to about 3050m depth. Location errors were estimated by bootstrapping, and a comparison between results from directed grid search and neighbourhood algorithm revealed a high level of consistency.

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

microseismicity
event detection
ray tracing


Sensorimotor mechanisms in music performance: actions that go partially wrong Even expert musicians make errors occasionally, and overt responses that are correct may be accompanied by partial-error behavior that can be indicative of online error detection processes. We compare pianists production of correct pitches, pitch errors, and partial errors (correct pitches with incorrect force or duration) by examining events prior to errors. Errors tended to be produced with slower durations and softer intensities (associated with force reduction) than correct events. In addition, pre-error events tended to have durations and intensities that fell between those of errors and correct responses, presumably due to response competition with upcoming errors that resulted in partial-error outcomes. These findings support the inference that partial information about upcoming (planned) sequence events is used to guide current responses, consistent with cascade models of activation during sequence production.

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

conflict monitoring
mismatch detection
executive control


Achievable Rate Regions and Performance Comparison of Half Duplex Bi-Directional Relaying Protocols In a bi-directional relay channel, two nodes wish to exchange independent messages over a shared wireless half-duplex channel with the help of a relay. In this paper, we derive achievable rate regions for four new half-duplex protocols and compare these to four existing half-duplex protocols and outer bounds. In time, our protocols consist of either two or three phases. In the two phase protocols, both users simultaneously transmit during the first phase and the relay alone transmits during the second phase, while in the three phase protocol the two users sequentially transmit followed by a transmission from the relay. The relay may forward information in one of four manners; we outline existing amplify and forward (AF), decode and forward (DF), lattice based, and compress and forward (CF) relaying schemes and introduce the novel mixed forward scheme. The latter is a combination of CF in one direction and DF in the other. We derive achievable rate regions for the CF and Mixed relaying schemes for the two and three phase protocols. We provide a comprehensive treatment of eight possible half-duplex bi-directional relaying protocols in Gaussian noise, obtaining their relative performance under different SNR and relay geometries.

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

achievable rate regions
compress and forward
relaying


Fuzzy subgroups as products We find necessary and sufficient conditions for a fuzzy subgroup of a Cartesian product of groups to be a Cartesian product of fuzzy subgroups. (C) 2003 Elsevier B.V. All rights reserved.

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


Experiments in multirobot coordination Consequent to previously published theoretical work by Marshall, Broucke, and Francis, this paper summarizes the apparatus and results of multirobot coordination experiments conducted at the University of Toronto Institute for Aerospace Studies. These experiments successfully demonstrate the practicality of cyclic pursuit as a distributed control strategy for multiple wheeled-robot systems. The pursuit-based coordination algorithm was found to be surprisingly robust in the presence of unmodelled dynamics and delays due to sensing and information processing. Moreover, the findings of this research not only bode well for continuing research on pursuit-based coordination strategies, but also for other cooperative multirobot control techniques employing similar local interactions.

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

autonomous robots
multiagent coordination
cooperative control


Microwave Dual-Band Bandstop Filter with Improved Spurious Resonance Behavior A design technique to improve the spurious resonance behavior of dual-band bandstop filters is presented. A compact dual-band bandstop filter with two stop bands that can be controlled independently with improved passband frequency response is designed. The operational bandwidth of the proposed compact dual-band bandstop filter is increased by pushing the first spurious resonance from being about twice the resonance frequency to more than three times the resonance frequency. Stepped impedance open loop resonators with substantially increased outer-edge width are used to improve the spurious resonance response. Both simulation and measured results are presented and good agreement is obtained between the results. The fabricated filter exhibits dual operating frequencies at 1460 MHz and 2640 MHz with 5.5% and 5% stopband fractional bandwidths, respectively. (c) 2012 Wiley Periodicals, Inc. Int J RF and Microwave CAE 23: 627-633, 2013.

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

dual-band filters
microstrip filters
open-loop resonators
spurious response


Balanced random interval arithmetic in market model estimation The possibility of estimating bounds for the econometric likelihood function using balanced random interval arithmetic is experimentally investigated. The experiments on the likelihood function with data from housing starts have proved the assumption that distributions of centres and radii of evaluated balanced random intervals are normal. Balanced random interval arithmetic can therefore be used to estimate bounds for this function and global optimization algorithms based on this arithmetic are applicable to optimize it. The interval branch and bound algorithms with bounds calculated using standard and balanced random interval arithmetic were used to optimize the likelihood function. Results of the experiments show that when reliability is essential the algorithm with standard interval arithmetic should be used, but when speed of optimization is more important, the algorithm with balanced random interval arithmetic should be used which in this case finishes faster and provides good, although not always optimal, values.

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


Unbordered partial words ? An unbordered word is a string over a finite alphabet such that none of its proper prefixes is one of its suffixes. In this paper, we extend the results on unbordered words to unbordered partial words. Partial words are strings that may have a number of do not know symbols. We extend a result of Ehrenfeucht and Silberger which states that if a word u u can be written as a concatenation of nonempty prefixes of a word v v , then u u can be written as a unique concatenation of nonempty unbordered prefixes of v v . We study the properties of the longest unbordered prefix of a partial word, investigate the relationship between the minimal weak period of a partial word and the maximal length of its unbordered factors, and also investigate some of the properties of an unbordered partial word and how they relate to its critical factorizations (if any).

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

partial words
unbordered words
unbordered partial words


Using the Rhythm of Nonverbal Human-Robot Interaction as a Signal for Learning Human-robot interaction is a key issue in order to build robots for everyone. The difficulty for people to understand how robots work and how they must be controlled will be one of the mains limit for broad robotics. In this paper, we study a new way of interacting with robots without needing to understand how robots work or to give them explicit instructions. This work is based on psychological data showing that synchronization and rhythm are very important features for pleasant interaction. We propose a biologically inspired architecture using rhythm detection to build an internal reward for learning. After showing the results of keyboard interactions, we present and discuss the results of real human-robots (Aibo and Nao) interactions. We show that our minimalist control architecture allows the discovery and learning of arbitrary sensorimotor associations games with expert users. With nonexpert users, we show that using only the rhythm information is not sufficient for learning all the associations due to the different strategies used by the human. Nevertheless, this last experiment shows that the rhythm is still allowing the discovery of subsets of associations, being one of the promising signal of tomorrow social applications.

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

artificial neural networks
autonomous robotics
human-robot interaction
rhythm detection and prediction
self-supervised learning


Monochromatic Clique Decompositions of Graphs Let G be a graph whose edges are colored with k colors, and be a k-tuple of graphs. A monochromatic -decomposition of G is a partition of the edge set of G such that each part is either a single edge or forms a monochromatic copy of in color i, for some . Let be the smallest number ?, such that, for every order-n graph and every k-edge-coloring, there is a monochromatic -decomposition with at most ? elements. Extending the previous results of Liu and Sousa [Monochromatic -decompositions of graphs, J Graph Theory 76 (2014), 89100], we solve this problem when each graph in is a clique and is sufficiently large.

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

monochromatic graph decomposition
turn number
ramsey number


Wave overtopping over a sea dike This paper describes a solver on the simulation of overtopping of water waves over sloping and vertical structures in a numerical wave tank (NWT). It involves a time-implicit cell-staggered approximately factored VOF finite volume (FV) approach for solution of unsteady incompressible NavierStokes (NS) equations with a free surface on nonuniform Cartesian cut-cell grids. The Godunov-type high-order upwind schemes are introduced for discretization of the convective fluxes, while the coupling of the pressure with the velocity is realized by a projection method. The effects of turbulence are incorporated with a subgrid-scale (SGS) model. A novel VOF solver is proposed for the capture of a free surface undergoing severe topological deformation related with breaking waves. Only an approximation for the free-surface boundary conditions neglects the viscous stress but surface tension is modelled as a body force. A blend of second- and fourth-order artificial damping terms is designed for enhancement of the numerical stability. Additionally, the cut-cell techniques are utilized for handling an arbitrary geometry, and an absorbing-generating boundary condition for a wave generator is applied. The calculated results are represented in terms of the surface elevation versus time at certain locations and the velocity fields created by regular and irregular waves. Furthermore, the convergence behavior, the grid refinement effects, the study of different SGS models, the surface tension and Reynolds number effects and the role of a turbulence model under breaking waves are discussed, including a comparison with measurements available.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 ns equations with a free-surface
overtopping of breaking waves
a vof-based finite volume solver
nonuniform cartesian cut-cell meshes


Integrals of motion of the reduced three-wave interaction system By using the Darboux method of integrability and solving linear partial differential equations, the whole classification of the integrals of motion of the reduced three-wave interaction system is obtained. Rigorous proof is given. (C) 2009 Elsevier Ltd. All rights reserved.

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

integral of motion
polynomial first integral
the method of characteristic curves
reduced three-wave interaction system


Adaptive frame synchronization for surveillance system across a heterogeneous network As mobile techniques are booming, the surveillance function is extended from a stationary mode to a mobile mode. In a heterogeneous network environment, cameras and viewers are located in different networks so that frame synchronization may span across diverse network domains with different transmission capabilities. The mismatch of transmission capabilities may affect the viewing continuity and playback liveness between cameras and viewers. In the article, we propose an adaptive frame synchronization mechanism for frame capturing at cameras based on the network condition to improve the frame synchronization between two sides across a heterogeneous network. Based on a brief theoretical analysis of the asynchronization effect for video communication in a heterogeneous network environment, the proposed adaptive pause time mechanism can be an effective solution to relieve the asynchronization effect in the unmatched transmission rate situation. The evaluation results show that the proposed scheme can achieve a shorter time delay between the captured frames at the camera site and the viewer site.

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

surveillance system
heterogeneous network
frame synchronization
playback liveness


Quasi-disjoint pentadiagonal matrix systems for the parallelization of compact finite-difference schemes and filters This paper proposes a novel systematic approach for the parallelization of pentadiagonal compact finite-difference schemes and filters based on domain decomposition. The proposed approach allows a pentadiagonal banded matrix system to be split into quasi-disjoint subsystems by using a linearalgebraic transformation technique. As a result the inversion of pentadiagonal matrices can be implemented within each subdomain in an independent manner subject to a conventional halo-exchange process. The proposed matrix transformation leads to new subdomain boundary (SB) compact schemes and filters that require three halo terms to exchange with neighboring subdomains. The internode communication overhead in the present approach is equivalent to that of standard explicit schemes and filters based on seven-point discretization stencils. The new SB compact schemes and filters demand additional arithmetic operations compared to the original serial ones. However, it is shown that the additional cost becomes sufficiently low by choosing optimal sizes of their discretization stencils. Compared to earlier published results, the proposed SB compact schemes and filters successfully reduce parallelization artifacts arising from subdomain boundaries to a level sufficiently negligible for sophisticated aeroacoustic simulations without degrading parallel efficiency. The overall performance and parallel efficiency of the proposed approach are demonstrated by stringent benchmark tests.

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

parallel computing
compact filters
computational aeroacoustics


A data cloning algorithm for computing maximum likelihood estimates in spatial generalized linear mixed models Non-Gaussian spatial data are common in many sciences such as environmental sciences, biology and epidemiology. Spatial generalized linear mixed models (SGLMMs) are flexible models for modeling these types of data. Maximum likelihood estimation in SGLMMs is usually made cumbersome due to the high-dimensional intractable integrals involved in the likelihood function and therefore the most commonly used approach for estimating SGLMMs is based on the Bayesian approach. This paper proposes a computationally efficient strategy to fit SGLMMs based on the data cloning (DC) method suggested by Lele etal. (2007). This method uses Markov chain Monte Carlo simulations from an artificially constructed distribution to calculate the maximum likelihood estimates and their standard errors. In this paper, the DC method is adapted and generalized to estimate SGLMMs and some of its asymptotic properties are explored. Performance of the method is illustrated by a set of simulated binary and Poisson count data and also data about car accidents in Mashhad, Iran. The focus is inference in SGLMMs for small and medium data sets.

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

data cloning
generalized linear mixed models

mcmc algorithms
spatial generalized linear mixed models


Variational approach for a general financial equilibrium problem: The Deficit Formula, the Balance Law and the Liability Formula. A path to the economy recovery General equilibrium financial model. Variational inequality formulation. Propositions for the recovery of the economy.

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

variational inequality formulation
deficit formula
balance law
liability formula


Transient analysis of an M/G/1 retrial queue subject to disasters and server failures ? An M/G/1 retrial queueing system with disasters and unreliable server is investigated in this paper. Primary customers arrive in the system according to a Poisson process, and they receive service immediately if the server is available upon their arrivals. Otherwise, they will enter a retrial orbit and try their luck after a random time interval. We assume the catastrophes occur following a Poisson stream, and if a catastrophe occurs, all customers in the system are deleted immediately and it also causes the servers breakdown. Besides, the server has an exponential lifetime in addition to the catastrophe process. Whenever the server breaks down, it is sent for repair immediately. It is assumed that the service time and two kinds of repair time of the server are all arbitrarily distributed. By applying the supplementary variables method, we obtain the Laplace transforms of the transient solutions and also the steady-state solutions for both queueing measures and reliability quantities of interest. Finally, numerical inversion of Laplace transforms is carried out for the blocking probability of the system, and the effects of several system parameters on the blocking probability are illustrated by numerical inversion results.

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

disasters
reliability
transient analysis
laplace transforms
numerical inversion


Linear programming in disassembly/clustering sequence generation Based on earlier research on optimal disassembly sequence generation, notably graphically supported search methods, a method for solving general optimal disassembly sequence generation problems by linear programming has been developed and described. This method puts no serious restriction to the size of the model,lt is adaptable to changes in model structures and constraints, and it is even not restricted to divergent operations, such as disassembly. This is demonstrated by solving the combined disassembly/clustering problem. Clustering is the combination of different disassembly products to categories that can be considered - and sold - as a single product, e.g. steel parts. The theoretical model is validated and clarified by its application to some standard problems from literature. (C) 1999 Elsevier Science Ltd. All rights reserved.

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

recycling
mathematical programming
design for disassembly
design for environment


Real-time massive convolution for audio applications on GPU Massive convolution on GPU Massive convolution is the basic operation in multichannel acoustic signal processing. This field has experienced a major development in recent years. One reason for this has been the increase in the number of sound sources used in playback applications available to users. Another reason is the growing need to incorporate new effects and to improve the hearing experience. Massive convolution requires high computing capacity. GPUs offer the possibility of parallelizing these operations. This allows us to obtain the processing result in much shorter time and to free up CPU resources. One important aspect lies in the possibility of overlapping the transfer of data from CPU to GPU and vice versa with the computation, in order to carry out real-time applications. Thus, a synthesis of 3D sound scenes could be achieved with only a peer-to-peer music streaming environment using a simple GPU in your computer, while the CPU in the computer is being used for other tasks. Nowadays, these effects are obtained in theaters or funfairs at a very high cost, requiring a large quantity of resources. Thus, our work focuses on two mains points: to describe an efficient massive convolution implementation and to incorporate this task to real-time multichannel-sound applications.

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


Security notes on generalization of threshold signature and authenticated encryption In 2000, Wang et al. proposed a (t, n) threshold signature scheme with (k, l) threshold shared verification, and a (t, n) threshold authenticated encryption scheme with (k, l) threshold shared verification. Later, Tseng et al. mounted some attacks against Wang et al.'s schemes. At the same, they also presented the improvements. In this paper, we first point out that Tseng et al.'s attacks are actually invalid due to their misunderstanding of Wang et al.'s Schemes. Then, we show that both Wang et al.'s schemes and Tseng et al.'s improvements are indeed insecure by demonstrating several effective attacks.

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

threshold signature
authenticated encryption
security


Brief view on control of grid-interfacing AC-DC-AC converter and active filter under unbalanced and distorted voltage conditions Purpose - The purpose of this paper is to consider both sides of a back-to-back AC-DC-AC interface. Design/methodology/approach - The paper presents a mathematical 'analysis, simulation, laboratory test in scaled model. Findings - The two main findings comprised concept of control methods for grid AC-DC-AC converter applied in renewable energy sources with variable speed operation under distorted grid. Active filtering functionality in case of non-linear current of a parallel load. Second, a control algorithm dedicated for two-level AC-DC converter applied in industrial networks with high-order harmonics compensation working under hard conditions balanced and unbalanced voltage dips. Research limitations/implications - The paper shows preliminary results for AC-DC-AC converter and active filter (AF) during voltage dips and for harmonics compensation. Control methods and/or topology should be improved and tested in scale and after at high-power system. Practical implications - Power quality supplied/received to/from the grid can be increased. In case of low-cost system only AF can be applied to existing non-linear receivers. Moreover, in case of full AC-DC-AC converter energy saving and production is possible. Originality/value - Presented control methods give satisfactory results. Paper presents laboratory results for grid and machine side two different power circuits during steady states and transients. Moreover, active filtering operation during voltage dips is presented.

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

wind power
electric power generation
electric converters


A methodology for evaluating test coverage criteria of high level Petri nets High level Petri nets have been extensively used for modeling concurrent systems: however, their strong expressive power reduces their ability to be easily analyzed. Currently there are few effective formal analysis techniques to support the validation of high level Petri nets. The executable nature of high level Petri nets means that during validation they can be analyzed using test criteria defined on the net model. Recently, theoretical test adequacy coverage criteria for concurrent systems using high level Petri nets have been proposed. However, determining the applicability of these test adequacy criteria has not yet been undertaken. In this paper, we present an approach for evaluating the proposed test adequacy criteria for high level Petri nets through experimentation. In our experiments we use the simulation functionality of the model checker SPIN to analyze various test coverage criteria on high level Petri nets. (C) 2009 Elsevier B.V. All rights reserved.

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

test adequacy criteria
model checker spin

predicate/transition nets
software testing


Listing all potential maximal cliques of a graph A potential maximal clique of a graph is a vertex set that induces a maximal clique in some minimal triangulation of that graph. It is known that if these objects can be listed in polynomial time for a class of graphs, the treewidth and the minimum fill-in are polynomially tractable for these graphs. We show here that the potential maximal cliques of a graph can be generated in polynomial time in the number of minimal separators of the graph. Thus, the treewidth and the minimum fill-in are polynomially tractable for all classes of graphs with a polynomial number of minimal separators. (C) 2002 Elsevier Science B.V. All rights reserved.

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

treewidth
minimal separators
potential maximal cliques


Acyclic chromatic indices of planar graphs with large girth An acyclic edge coloring of a graph G G is a proper edge coloring such that no bichromatic cycles are produced. The acyclic chromatic index a?(G) a ? ( G ) of G G is the smallest k k such that G G has an acyclic edge coloring using k k colors. In this paper, we prove that every planar graph G G with girth g(G) g ( G ) and maximum degree ? ? has a?(G)=? a ? ( G ) = ? if there exists a pair (k,m)?{(3,11),(4,8),(5,7),(8,6)} ( k , m ) ? { ( 3 , 11 ) , ( 4 , 8 ) , ( 5 , 7 ) , ( 8 , 6 ) } such that G G satisfies ??k ? ? k and g(G)?m g ( G ) ? m .

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

acyclic edge coloring
acyclic chromatic index
planar graph
girth


cheat-prevention and -analysis in online virtual worlds Virtual environments and online games are becoming a major market force. At the same time, the virtual property contained in these environments is being traded for real money and thus attains a real value. Although the legal issues involved with this virtual property have not yet been decided, they will have to be soon. To protect virtual property, virtual environment systems will have to conform to certain requirements. We analyze what these requirements are in order to either prevent cheating or at least prove a digital offense has transpired. Along with greater security, this will also reduce the cost of support, which is one of the major cost factors for online games.

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

virtual environments
games
virtual property


multi-optimization power management for chip multiprocessors The emergence of power as a first-class design constraint has fueled the proposal of a growing number of run-time power optimizations. Many of these optimizations trade-off power saving opportunity for a variable performance loss which depends on application characteristics and program phase. Furthermore, the potential benefits of these optimizations are sometimes non-additive, and it can be difficult to identify which combinations of these optimizations to apply. Trial-and-error approaches have been proposed to adaptively tune a processor. However, in a chip multiprocessor, the cost of individually configuring each core under a wide range of optimizations might be prohibitive under simple trial-and-error approaches. In this work, we introduce an adaptive, multi-optimization power saving strategy for multi-core power management. Specifically, we solve the problem of meeting a global chip wide power budget through run-time adaptation of highly configurable processor cores. Our approach applies analytic modeling to reduce exploration time and decrease the reliance on trial-and-error methods. We also introduce risk evaluation to balance the benefit of various power saving optimizations versus the potential performance loss. Overall, we find that our approach can significantly reduce processor power consumption compared to alternative optimization strategies.

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

risk
design
performance
constraint
evaluation
exploration
processor
chip multiprocessors
strategies
power consumption
meeting
budget
power
core
cost
global
emergence

cache resizing
voltage/frequency scaling
applications
analytic models
timing
errors
multi core
variability
method
adapt
optimality
chip multi-processor
configurability
power-save
power-management
dynamic power management
class
power optimization


precise and efficient parametric path analysis Hard real-time systems require tasks to finish in time. To guarantee the timeliness of such a system, static timing analyses derive upper bounds on the worst-case execution time (WCET) of tasks. There are two types of timing analyses: numeric and parametric. A numeric analysis derives a numeric timing bound and, to this end, assumes all information such as loop bounds to be given a priori. If these bounds are unknown during analysis time, a parametric analysis can compute a timing formula parametric in these variables. A performance bottleneck of timing analyses, numeric and especially parametric, is the so-called path analysis, which determines the path in the analyzed task with the longest execution time bound. In this paper, we present a new approach to path analysis. This approach exploits the often rather regular structure of software for hard real-time and safety-critical systems. As we show in the evaluation of this paper, we strongly improve upon former techniques in terms of precision and runtime in the parametric case. Even in the numeric case, the approach competes with state-of-the-art techniques and may be an alternative to commercial tools employed for path analysis.

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


Tolerance design of manipulator parameters using design of experiment approach A robotic arm must manipulate objects with high accuracy and repeatability to perform precise tasks. There are many factors that cause variations in performance and they referred as noise factors. A probabilistic approach has been used to model the effects of noise factors and an experimental design technique has been adopted to select optimal tolerance of kinematic and dynamic parameters for minimal performance variations. The control and noise factor arrays are employed to identify statistically significant parameters and their interactions. The performance measures like signal to noise ratio and reliability have been utilized and results are validated by Monte Carlo simulations. The proposed design of experiment methodology requires minimal computations. The tolerance design methodology of manipulator is illustrated by 2-DOF revolute-revolute planar manipulator following cubic and quintic trajectory to perform a task. The statistical analysis of simulated performances is carried out using analysis of variance technique, which showed that statistically significant parameters are independent of trajectory. The individual parameter tolerance sensitivity has also been carried out.

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

tolerance design
noise factors
reliability
parameter tolerance sensitivity

control factors
positional error-s/n ratio


body-bias compensation technique for subthreshold cmos static logic gates This paper analyzes the performance of the conventional CMOS inverter, NAND-2 and NOR-2 static logic gates operating in the subthreshold region. The dependence of the drain currents on the process parameters can give rise to drive currents of NMOS and PMOS transistors that differ by an order of magnitude or even more. To compensate for this difference in currents, we propose three bias circuits in single-well processes that adjust the body voltage. Computer simulations using the AMS 0.8um technology and the BSIM3v3 model were carried out to assess the compensation technique. A test chip was fabricated in both AMIS 1.5um and TSMC0.35um to further validate the proposal.

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

logic circuits
body-bias compensation
low-power


temperature-aware microarchitecture With power density and hence cooling costs rising exponentially, processor packaging can no longer be designed for the worst case, and there is an urgent need for runtime processor-level techniques that can regulate operating temperature when the package's capacity is exceeded. Evaluating such techniques, however, requires a thermal model that is practical for architectural studies.This paper describes HotSpot, an accurate yet fast model based on an equivalent circuit of thermal resistances and capacitances that correspond to microarchitecture blocks and essential aspects of the thermal package. Validation was performed using finite-element simulation. The paper also introduces several effective methods for dynamic thermal management (DTM): "temperature-tracking" frequency scaling, localized toggling, and migrating computation to spare hardware units. Modeling temperature at the microarchitecture level also shows that power metrics are poor predictors of temperature, and that sensor imprecision has a substantial impact on the performance of DTM.

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

sensor
simulation
performance
computation
temperature
case
model
paper
microarchitecture
practical
runtime
processor
packaging
dynamic
power
hardware
thermal management

scale
metrication
aspect
method
architecture
capacities
operability
tracking
effect
circuits
finite element


Flux reconstruction and solution post-processing in mimetic finite difference methods We present a post-processing technique for the mimetic finite difference solution of diffusion problems in mixed form. Our post-processing method yields a piecewise linear approximation of the scalar variable that is second-order accurate in the L2-norm on quite general polyhedral meshes, including non-convex and non-matching elements. The post-processing is based on the reconstruction of vector fields projected onto the mimetic space of vector variables. This technique is exact on constant vector fields and is shown to be independent of the mimetic scalar product choice if a local consistency condition is satisfied. The post-processing method is computationally inexpensive. Optimal performance is confirmed by numerical experiments.

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

polyhedral mesh
mimetic finite difference method
compatible discretization
solution post-processing
gradient reconstruction
super-convergence


A partition of unity method for a class of fourth order elliptic variational inequalities We consider a partition of unity method (PUM) for a class of fourth order elliptic variational inequalities on convex polygonal domains that include obstacle problems of simply supported Kirchhoff plates and elliptic distributed optimal control problems with pointwise state constraints as special cases. By including singular functions in the local approximation spaces we are able to show that the partition of unity method converges optimally. Numerical results that corroborate the theoretical estimates are also presented.

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


approximate computation of multidimensional aggregates of sparse data using wavelets Computing multidimensional aggregates in high dimensions is a performance bottleneck for many OLAP applications. Obtaining the exact answer to an aggregation query can be prohibitively expensive in terms of time and/or storage space in a data warehouse environment. It is advantageous to have fast, approximate answers to OLAP aggregation queries. In this paper, we present a novel method that provides approximate answers to high-dimensional OLAP aggregation queries in massive sparse data sets in a time-efficient and space-efficient manner. We construct a compact data cube , which is an approximate and space-efficient representation of the underlying multidimensional array, based upon a multiresolution wavelet decomposition. In the on-line phase, each aggregation query can generally be answered using the compact data cube in one I/O or a smalll number of I/Os, depending upon the desired accuracy. We present two I/O-efficient algorithms to construct the compact data cube for the important case of sparse high-dimensional arrays , which often arise in practice. The traditional histogram methods are infeasible for the massive high-dimensional data sets in OLAP applications. Previously developed wavelet techniques are efficient only for dense data. Our on-line query processing algorithm is very fast and capable of refining answers as the user demands more accuracy. Experiments on real data show that our method provides significantly more accurate results for typical OLAP aggregation queries than other efficient approximation techniques such as random sampling.

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

histogram
applications
data cube
approximation
performance
computation
arrays
case
paper
representation
user
multiresolution
decomposition
method
compact
accuracy
space
wavelet
storage
data
queries
algorithm
query processing
query

efficiency
experience
timing
high-dimensional data
practical
random sample
environments
aggregate
data warehouse
refine


Prevention slot flow-control mechanism for low latency torus network-on-chip The challenge for on-chip networks is to provide low latency communication in a very low power budget. To reduce the latency and maintain the simplicity of a mesh topology, torus topology is proposed. As torus topology has an inherent circular dependency, additional effort is needed to prevent deadlock, even if deadlock free routing algorithms are used. The authors propose a novel flow-control mechanism to address cost/performance constraints in torus networks and ensure deadlock freedom. They achieve flow-control by using a prevention mechanism and ensure deadlock freedom while requiring only a single packet buffer per input port. They simplify the router design by having a simple switch allocator that prioritises in-flight packets, and a single packet buffer per input port that eliminates the need for virtual channels. They also propose a mechanism to avoid starvation that can arise because of the prioritised arbitration. Experimental validation reveals that the authors design achieves significant improvement in throughput, as compared with the traditional design, while using significantly fewer buffers.

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

topology
inherent circular dependency
deadlock free routing algorithms
simple switch allocator
single packet buffer
virtual channels

mesh generation
network-on-chip
prevention slot flow-control mechanism
low latency torus network-on-chip
mesh topology
torus topology
novel flow-control mechanism


?-polymers in crowded media under stretching force We study the peculiarities of stretching of globular polymer macromolecules in a disordered (crowded) environment, using the model of self-attracting self-avoiding walks on site-diluted percolative lattices in space dimensions d=3 d = 3 . Applying the prunedenriched Rosenbluth chain-growth method (PERM), we construct the phase diagram of collapsedextended state coexistence when varying temperature and stretching force. The change in shape characteristics of globular polymers under stretching is analyzed as well.

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

percolation
self-avoiding walks
disorder


From Complex B-1 Mapping to Local SAR Estimation for Human Brain MR Imaging Using Multi-Channel Transceiver Coil at 7T Elevated specific absorption rate (SAR) associated with increased main magnetic field strength remains a major safety concern in ultra-high-field (UHF) magnetic resonance imaging (MRI) applications. The calculation of local SAR requires the knowledge of the electric field induced by radio-frequency (RF) excitation, and the local electrical properties of tissues. Since electric field distribution cannot be directly mapped in conventional MR measurements, SAR estimation is usually performed using numerical model-based electromagnetic simulations which, however, are highly time consuming and cannot account for the specific anatomy and tissue properties of the subject undergoing a scan. In the present study, starting from the measurable RF magnetic fields (B-1) in MRI, we conducted a series of mathematical deduction to estimate the local, voxel-wise and subject-specific SAR for each single coil element using a multi-channel transceiver array coil. We first evaluated the feasibility of this approach in numerical simulations including two different human head models. We further conducted experimental study in a physical phantom and in two human subjects at 7T using a multi-channel transceiver head coil. Accuracy of the results is discussed in the context of predicting local SAR in the human brain at UHF MRI using multi-channel RF transmission.

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

electrical properties tomography (ept)
magnetic resonance imaging (mri)
parallel transmission
specific absorption rate (sar)
ultra-high-field (uhf)
b-1-mapping


Investigating Participatory Dynamics Through Social Media Using a Multideterminant Frame Approach: The Case of Climategate on YouTube This paper offers a framework for examining the relationship between social, instrumental, and technological determinants of participation through social media (Dahlberg, 2004) using a discursive approach based in the concepts of frames and framing (Goffman, 1974; Snow & Benford, 1992). We apply our multideterminant framework to investigate participatory dynamics on YouTube in the case of climategate. Our interpretive analysis of videos and comments shows how public responses to climategate were scripted around 3 dominant master frames, reinforced by calls to collective action and media form. Our multideterminant framework makes a contribution to the debate over the transformative potential of social media by providing a method to assess the relative value of social media in response to specific social problems.

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

participation
social media
youtube
frames
social problems


Simple scheduling algorithms for use with a waveguide grating multiplexer based local optical network As the need for greater bandwidth in local-area networks grows, wavelength-division multiplexing (WDM) is gathering attention as a viable successor to Gigabit Ethernet technologies. In this paper we introduce a new WDM optical LAN architecture based on the waveguide grating multiplexer (WGM) rather than the traditional passive star coupler (PSC). An N-port WGM allows N-2 x N-2 connectivity via only N physical wavelengths, due to its inherent space-division multiplexing property. Wavelength-routed networks based on the WGM promise to be significant components of future LAN and WAN technologies not only because of their efficient use of wavelengths, but also because they have been implemented as integrated devices. We propose simple, low-complexity TDM schedules for interconnecting MN nodes (M nodes per port) with a WGM in a local environment. Each node is equipped with a single tunable transmitter and a single tunable receiver (both of which can access all N wavelengths). Various transmitter and receiver tuning latencies are considered. We show that, for negligible tuning latencies, aggregate network throughput approaching min(MN, N-2) can be achieved, and for tuning latencies on the order of a packet length or more, throughput on the order of N can be achieved. Since these performance metrics are vastly superior to that of an equivalent PSC-based system (whose maximum throughput is limited by the number of wavelengths, N), we propose that the WGM be considered as an alternative to the PSC for enabling WDM LANs and multiprocessor interconnects.

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

optical network
waveguide grating multiplexer
wdm

local-area network
wavelength routing
tdm packet scheduling


probabilistic model for the interfaces personalized creation User interfaces are designed taking in account different user needs (preferences, abilities, etc.) and various prototypes and usability tests are carried out during their development. However, when they are used by their final users, it can be seen that the interfaces do not meet the users requirements or, more usually, it is evident that the UI can be improved. This paper presents a system that helps to personalize a user interface for an art digital library. The system has different predefined interfaces according to end-user characteristics, but the users can tailor the final appearance of the information to be showed by the system. From these different adaptations, tailored by users, the system tries to find similarities that can result in a modification of the default interface that is presented to new users of the system. The new interface could be distinct from the one constructed by the original interface designer.

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

personalization
presentation
adaptive interfaces


Intelligent region-based thresholding for color document images with highlighted regions The study applies an intelligent region-based thresholding method for the binarization of color document images with highlighted regions. The results also indicate that the proposed method can threshold simultaneously when the background is gradually changing, reversed, or inseparable from the foreground, with efficient binarization results. Rather than the traditional method of scanning the entire document at least once, this method intelligently divides a document image into several foreground regions and decides the background range for each foreground region, in order to effectively process the detected document regions. Experimental results demonstrate the high effectiveness of the proposed method in providing promising binarization results with low computational cost. Furthermore, the results of the proposed method are more accurate than global, region-based, local, and hybrid methods. Images were analyzed using MODI OCR measurement data such as recall rate and precision rate. In particular, when test images produced under inadequate illumination are processed using the proposed method, the binarization results of this method have better visual quality and better measurable OCR performance than compared global, region-based, local, and hybrid methods. Moreover, the proposed algorithm can be run in an embedded system due to its simplicity and efficiency.

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

region-based thresholding
color document image
highlighted region background
restricted background projection


Learning Rates of Tikhonov Regularized Regressions Based on Sample Dependent RKHS It is known that the learning algorithm with sample hypothesis spaces is essentially different from the algorithms with hypothesis spaces independent of the sample. In the present paper, we consider the error bounds for norm square regularized regressions associated with Lipschitz loss and sample depending reproducing kernel spaces. By giving the unique solution with subgradients of the loss functions, we estimate the learning rates with the regularization parameters lambda and the sample number m. The sample error rates obtained are O(1/lambda root m) and the approximation error rates are O(1/root m + lambda).

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

sample depending reproducing kernel hilbert spaces


Reasoning about fuzzy temporal information from the web: towards retrieval of historical events When searching for information about historical events, queries are naturally formulated using temporal constraints. However, the structured temporal information needed to support such constraints is usually not available to information retrieval systems. Furthermore, the temporal boundaries of most historical events are inherently ill-defined, calling for suitable extensions of classical temporal reasoning frameworks. In this paper, we propose a framework based on a fuzzification of Allens Interval Algebra to cope with these issues. By using simple heuristic techniques to extract temporal information from web documents, we initially focus more on recall than on precision, relying on the subsequent application of a fuzzy temporal reasoner to improve the reliability of the extracted information, and to deal with conflicts that arise because of the vagueness of events. Experimental results indicate that a consistent and reliable knowledge base of fuzzy temporal relations can thus be obtained, which effectively allows us to target temporally constrained retrieval tasks.

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


On the Termination of Integer Loops In this article we study the decidability of termination of several variants of simple integer loops, without branching in the loop body and with affine constraints as the loop guard (and possibly a precondition). We show that termination of such loops is undecidable in some cases, in particular, when the body of the loop is expressed by a set of linear inequalities where the coefficients are from Z boolean OR {r} with r an arbitrary irrational; when the loop is a sequence of instructions, that compute either linear expressions or the step function; and when the loop body is a piecewise linear deterministic update with two pieces. The undecidability result is proven by a reduction from counter programs, whose termination is known to be undecidable. For the common case of integer linear-constraint loops with rational coefficients we have not succeeded in proving either decidability or undecidability of termination, but we show that a Petri net can be simulated with such a loop; this implies some interesting lower bounds. For example, termination for a partially specified input is at least EXPSPACE-hard.

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


Dairy proteins and the response to pneumovax in senior citizens: a randomized, double-blind, placebo-controlled pilot study With the progressive aging of the world's population, immunosenescence is rapidly becoming a clinical concern as it accounts for a higher incidence of severe infections and poor response to vaccines. To identify nutritional approaches that may counteract immunosenescence is of obvious importance in clinical practice. Dairy products in general and whey proteins in particular share the capacity to stimulate the immune system within the digestive tract while the antibody response to Streptococcus pneumoniae vaccine is a good marker of the immune function. We performed a controlled, randomized, double-blind pilot study to determine if an eight-week supplementation with whey protein (or soy protein used as control) could enhance the serum response to pneumococcal vaccine in healthy senior citizens. Out of 127 volunteers, 17 subjects were eligible and completed the study receiving the vaccine after four weeks of supplementation. Antibody levels were measured at baseline and the end of the study against 14 pneumococcal types and a detailed nutritional questionnaire was administered to all subjects. Subjects receiving whey protein manifested a serum response higher compared to the control soy supplementation against 12/14 bacterial types. In particular, whey led to a higher frequency of response to all four more virulent types (4, 9, 14, and 23). Calorie and protein intake data suggest a better nutritional status in the whey group. Whey protein supplementation is a promising supplement to stimulate the immune response to vaccine in senior citizens and possibly to counteract immunosenescence while larger studies are warranted.

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


Shape and motion from simultaneous equations with closed-loop solution This paper proposes a method for simultaneously estimating 2D image motion and 3D object shape and motion from only two frames. The problem is formulated in a system of equations, including the differential epipolar constraint, a newly derived optical flow equation and surface normal constraint, under the assumption of perspective projection, rigid motion, Lambertian reflectance and distant lighting. A closed-loop solver is constructed based on the simultaneous equations to export accurate estimate for optical flow as well as dense shape and motion. Experimental results are also provided.

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

structure from motion
closed-loop solution


Error analysis in electric power system available transfer capability computation A key concept in the restructuring of the electric power industry is the ability to accurately and rapidly quantify the capabilities of the transmission system. Transmission transfer capability is limited by a number of different mechanisms, including thermal, voltage, and stability constraints. This paper discusses the available transfer capability (ATC) definitions and determination guidelines approved by the North American Electric Reliability Council (NERC) and presents several concepts for dealing with the potential errors and technical challenges of computation.

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

available transfer capability (atc)
power system loadability


A novel image denoising algorithm in wavelet domain using total variation and grey theory Purpose - The traditional total variation (TV) models in wavelet domain use thresholding directly in coefficients selection and show that Gibbs' phenomenon exists. However, the nonzero coefficient index set selected by hard thresholding techniques may not be the best choice to obtain the least oscillatory reconstructions near edges. This paper aims to propose an image denoising method based on TV and grey theory in the wavelet domain to solve the defect of traditional methods. Design/methodology/approach - In this paper, the authors divide wavelet into two parts: low frequency area and high frequency area; in different areas different methods are used. They apply grey theory in wavelet coefficient selection. The new algorithm gives a new method of wavelet coefficient selection, solves the nonzero coefficients sort, and achieves a good image denoising result while reducing the phenomenon of "Gibbs." Findings - The results show that the method proposed in this paper can distinguish between the information of image and noise accurately and also reduce the Gibbs artifacts. From the comparisons, the model proposed preserves the important information of the image very well and shows very good performance. Originality/value - The proposed image denoising model introducing grey relation analysis in the wavelet coefficients selecting and modifying is original. The proposed model provides a viable tool to engineers for processing the image.

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

image processing
mathematical modelling
programming and algorithm theory


Computable error estimators for the approximation of nonlinear problems by linearized models In the modeling of nonlinear phenomena, a nonlinear model may often be replaced by a linear one, giving rise to a modeling or linearization error. This is in addition to the discretization error introduced when this linear model is solved, using, e.g., the finite element method. We investigate the a posteriori estimation of these errors for a general class of problems characterized by strongly monotone operators. Our results lead to the construction of computable upper estimators for the total error, with identifiable components from each of the these error sources. Several numerical tests evaluating the efficiency of our estimators are provided.

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


Improving video-mediated communication with orchestration Video-mediated communication (VMC) has become a popular communication medium. However, research to date suggests that the inherent constraints of VMC impair effective and efficient communication and task performance. We propose that these negative findings could be attributed to how the technology was used and propose the novel concept of communication orchestration aimed at mitigating some of the signaled limitations. Orchestration is a selection process for displaying information that is deemed relevant for accomplishing an effective and efficient task performance and communicative experience. We report an experiment that confirmed this suggestion. The results indicate that orchestration could be an important novel feature to aid humans when communicating via VMC, but also suggest that there is potential for further improvements in orchestration.

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

orchestration
task performance
communication

video-mediated communication
user experience
videoconferencing


Algorithm 905: SHEPPACK: Modified Shepard Algorithm for Interpolation of Scattered Multivariate Data Scattered data interpolation problems arise in many applications. Shepard's method for constructing a global interpolant by blending local interpolants using local-support weight functions usually creates reasonable approximations. SHEPPACK is a Fortran 95 package containing five versions of the modified Shepard algorithm: quadratic (Fortran 95 translations of Algorithms 660, 661, and 798), cubic (Fortran 95 translation of Algorithm 791), and linear variations of the original Shepard algorithm. An option to the linear Shepard code is a statistically robust fit, intended to be used when the data is known to contain outliers. SHEPPACK also includes a hybrid robust piecewise linear estimation algorithm RIPPLE (residual initiated polynomial-time piecewise linear estimation) intended for data from piecewise linear functions in arbitrary dimension m. The main goal of SHEPPACK is to provide users with a single consistent package containing most existing polynomial variations of Shepard's algorithm. The algorithms target data of different dimensions. The linear Shepard algorithm, robust linear Shepard algorithm, and RIPPLE are the only algorithms in the package that are applicable to arbitrary dimensional data.

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

design
documentation
m-estimation
shepard's algorithm


machine vision based liquid level inspection system using isef edge detection technique We have developed a machine vision based liquid level inspection system which decides the liquid level of bottle to be under or overfilled using ISEF edge detection technique. The system is having a conveyer belt controlled by Siemens LOGO24RLC PLC. MATLAB image acquisition toolbox along with a normal web camera is used for image acquisition purpose. We apply ISEF Edge detection technique and an average distance algorithm to decide about the level of the liquid in the bottles. A GUI based interfacing software is made to display the over and under filled status of the bottles on the screen.

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

machine vision
edge detection
average distance algorithm
gui

isef edge detection
siemens plc
quality inspection


Web generation of experimental designs balanced for indirect effects of treatments (WEB-DBIE) Online software to generate designs balanced for indirect effects of treatments. It consists of randomized layout of Neighbour Balanced and Crossover Designs. Online catalogue of designs within a permissible range of parameters is provided. This software (WEB-DBIE) is deployed at www.iasri.res.in/webdbie. It is freely available for the researchers and students working in this area.

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

neighbour balanced designs
randomization
web generation of designs


Inconsistency-tolerant reasoning with OWL DL The Web Ontology Language (OWL) is a family of description logic based ontology languages for the Semantic Web and gives well defined meaning to web accessible information and services. The study of inconsistency-tolerant reasoning with description logic knowledge bases is especially important for the Semantic Web since knowledge is not always perfect within it. An important challenge is strengthening the inference power of inconsistency-tolerant reasoning because it is normally impossible for paraconsistent logics to obey all important properties of inference together. This paper presents a non-classical DL called quasi-classical description logic (QCDL) to tolerate inconsistency in OWL DL which is a most important sublanguage of OWL supporting those users who want the maximum expressiveness while retaining computational completeness (i.e., all conclusions are guaranteed to be computable) and decidability (i.e., all computations terminate in finite time). Instead of blocking those inference rules, we validate them conditionally and partially, under which more useful information can still be inferred when inconsistency occurs. This new non-classical DL possesses several important properties as well as its paraconsistency in DL, but it does not bring any extra complexity in worst case. Finally, a transformation-based algorithm is proposed to reduce reasoning problems in QCDL to those in DL so that existing OWL DL reasoners can be used to implement inconsistency-tolerant reasoning. Based on this algorithm, a prototype OWL DL paraconsistent reasoner called PROSE is implemented. Preliminary experiments show that PROSE produces more intuitive results for inconsistent knowledge bases than other systems in general.

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

description logics
quasi-classical logic
paraconsistent reasoning
inconsistency-tolerance


Fault Tolerance in Distributed Systems Using Fused Data Structures Replication is the prevalent solution to tolerate faults in large data structures hosted on distributed servers. To tolerate f crash faults (dead/unresponsive data structures) among n distinct data structures, replication requires f + 1 replicas of each data structure, resulting in nf additional backups. We present a solution, referred to as fusion that uses a combination of erasure codes and selective replication to tolerate f crash faults using just f additional fused backups. We show that our solution achieves O(n) savings in space over replication. Further, we present a solution to tolerate f Byzantine faults (malicious data structures), that requires only nf + f backups as compared to the 2nf backups required by replication. We explore the theory of fused backups and provide a library of such backups for all the data structures in the Java Collection Framework. The theoretical and experimental evaluation confirms that the fused backups are space-efficient as compared to replication, while they cause very little overhead for normal operation. To illustrate the practical usefulness of fusion, we use fused backups for reliability in Amazon's highly available key-value store, Dynamo. While the current replication-based solution uses 300 backup structures, we present a solution that only requires 120 backup structures. This results in savings in space as well as other resources such as power.

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

distributed systems
fault tolerance
data structures


Data multicasting procedure for increasing configuration speed of coarse grain reconfigurable devices A novel configuration method called Row Multicast Configuration (RoMultiC) is proposed for high speed configuration of coarse grain reconfigurable systems. The same configuration data can be transferred in multicast fashion to configure many Processing Elements (PEs) by using a multicast bit-map provided in row and column directions of PE array. Evaluation results using practical applications show that a model reconfigurable system that incorporates this scheme can reduce configuration clock cycles by up to 73.1% compared with traditional configuration delivery scheme. Amount of required memory to store the configuration data at external memory is also reduced by omitting the duplicated configuration data.

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

dynamically reconfigurable system
configuration network


Constitute: The worlds constitutions to read, search, and compare Constitutional design and redesign is constant. Over the last 200 years, countries have replaced their constitutions an average of every 19years and some have amended them almost yearly. A basic problem in the drafting of these documents is the search and analysis of model text deployed in other jurisdictions. Traditionally, this process has been ad hoc and the results suboptimal. As a result, drafters generally lack systematic information about the institutional options and choices available to them. In order to address this informational need, the investigators developed a web application, Constitute [online at http://www.constituteproject.org], with the use of semantic technologies. Constitute provides searchable access to the worlds constitutions using the conceptualization, texts, and data developed by the Comparative Constitutions Project. An OWL ontology represents 330 topicse.g.right to healthwith which the investigators have tagged relevant provisions of nearly all constitutions in force as of September of 2013. The tagged texts were then converted to an RDF representation using R2RML mappings and Capsentas Ultrawrap. The portal implements semantic search features to allow constitutional drafters to read, search, and compare the worlds constitutions. The goal of the project is to improve the efficiency and systemization of constitutional design and, thus, to support the independence and self-reliance of constitutional drafters.

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


Energy efficiency in multiaccess fading channels under QoS constraints In this article, transmission over multiaccess fading channels under quality-of-service (QoS) constraints is studied in the low-power and wideband regimes. QoS constraints are imposed as limitations on the buffer violation probability. The effective capacity, which characterizes the maximum constant arrival rates in the presence of such statistical QoS constraints, is employed as the performance metric. A two-user multiaccess channel model is considered, and the minimum bit energy levels and wideband slope regions are characterized for different transmission and reception strategies, namely time-division multiple-access (TDMA), superposition coding with fixed decoding order, and superposition coding with variable decoding order. It is shown that the minimum received bit energies achieved by these different strategies are the same and independent of the QoS constraints in the low-power regime, while they vary with the QoS constraints in the wideband regime. When wideband slope regions are considered, the suboptimality of TDMA with respect to superposition coding is proven in the low-power regime. On the other hand, it is shown that TDMA in the wideband regime can interestingly outperform superposition coding with fixed decoding order. The impact of varying the decoding order at the receiver under certain assumptions is also investigated. Overall, energy efficiency of different transmission strategies under QoS constraints are analyzed and quantified.

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

effective capacity
energy efficiency
superposition coding
wideband regime
wideband slope

energy per information bit
low-power regime
multiple-access fading channels
quality of service
time-division multiple access


Fair resource allocation with guaranteed statistical QoS for multimedia traffic in wideband CDMA cellular network A dynamic fair resource allocation scheme is proposed to efficiently support real-time and non-real-time multimedia traffic with guaranteed statistical quality of service (QoS) in the uplink of a wideband code-division multiple access (CDMA) cellular network. The scheme uses the generalized processor sharing (GPS) fair service discipline to allocate uplink channel resources, taking into account the characteristics of channel fading and intercell interference. In specific, the resource allocated to each traffic flow is proportional to an assigned weighting factor. For real-time traffic, the assigned weighting factor is a constant in order to guarantee the traffic statistical delay bound requirement; for non-real-time traffic, the assigned weighting factor can be adjusted dynamically according to fading channel states and the traffic statistical fairness bound requirement. Compared with the conventional static-weight scheme, the proposed dynamic-weight scheme achieves capacity gain. A flexible trade-off between the GIPS fairness and efficient resource utilization can also be achieved. Analysis and simulation results demonstrate that the proposed scheme enhances radio resource utilization and guarantees statistical QoS under different fairness bound requirements.

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

resource allocation
generalized processor sharing
quality of service
multimedia traffic


Looking beyond bone mineral density Bone fracture is related to bone strength. In current clinical practice, bone mineral density (BMD) is used as the prime indicator of bone strength, not infrequently at the neglect of an even more pertinent measure of reduced bone strength, namely the radiographic presence of an insufficiency fracture. Bone strength depends not just on BMD but also on bone quality, which relates to such factors as bone architecture, turnover, mineralization, and cellularity. The high resolution available from current imaging techniques, particularly computed tomography and magnetic resonance imaging, along with advanced analytical software has greatly enhanced evaluation of bone architecture and strength. This has improved our knowledge of the pathophysiological processes behind osteoporosis and its treatment beyond that provided by BMD measurement alone. Although still in the experimental stage, these techniques will no doubt be incorporated into clinical practice, leading to a more tailored approach to the screening, monitoring, and treatment of osteoporosis.

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

imaging
bone quality
computed tomography

radiography
dxa
magnetic resonance imaging


misconceived misconceptions? Detailed user activity scripts from two previous studies of novice users working at a command language or a direct representation interface were submitted to independent expert judges for the justified ascription of misconceptions . Our initial hypothesis was that behavioral evidence for such misconceptions comes about as a result of well-articulated hypothetical reasoning. Although the evidence we obtained supports this view, it also suggests that for the direct representation case some activity normally attributed to misconceptions is non-reasoned in nature and governed by inherent powers of the representation.

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

direct case reasoning evidence representation novice users user language


Influence of visual stimulus on amplitude and phase of alpha wave as measured by multi-channel EEG The objective of this paper is to study the relationship between a visual stimulus and the amplitude and phase of the alpha wave as a first step to investigating a change in the background wave after a sensory stimulus and an evoked potential. We examined the effect of a, single visual stimulus on the amplitude and phase of alpha waves using the complex demodulation method. The visual stimuli were generated by an LED mounted in goggles with the eyes-closed condition. The amplitude of the alpha wave decreased gradually after the stimulus, until it reached a minimum at around 300 ms after the stimulus. The alpha wave continued to increase, showing some rebound, and returning again to the pre-stimulus level. The phase variation after the stimulus tends to be considerably larger than that before the stimulus. Moreover, the average phase returned to the same slope as the pre-stimulus by 2550 ms after the stimulus. The visual stimulus has an effect on the alpha wave until about 2500 ms after the stimulus. The phase variation difference before and after stimulus is significant from 112 ms to 678 ms after the stimulus. This finding suggests there is a partially pararell time course between the change in VEPs plus ERP complex and the alpha wave.

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

complex demodulation method
amplitude
phase
alpha wave
visual stimulus