Hybrid probabilities and error-domain structural identification using ambient vibration monitoring For the assessment of structural behaviour, many approaches are available to compare model predictions with measurements. However, few approaches include uncertainties along with dependencies associated with models and observations. In this paper, an error-domain structural identification approach is proposed using ambient vibration monitoring (AVM) as the input. This approach is based on the principle that in science, data cannot truly validate a hypothesis, it can only be used to falsity it. Error-domain model falsification generates a space of possible model instances (combination of parameters), obtains predictions for each of them and then rejects instances that have unlikely differences (residuals) between predictions and measurements. Models are filtered in a two step process. Firstly a comparison of mode shapes based on MAC criterion ensures that the same modes are compared. Secondly, the frequencies from each model instance are compared with the measurements. The instances for which the difference between the predicted and measured value lie outside threshold bounds are discarded. In order to include uncertainty of uncertainty in the identification process, a hybrid probability scheme is also presented. The approach is used for the identification of the Langensand Bridge in Switzerland. It is used to falsify the hypothesis that the bridge was behaving as designed when subjected to ambient vibration inputs, before opening to the traffic. Such small amplitudes may be affected by low-level bearing-device friction. This inadvertently increased the apparent stiffness of the structure by 17%. This observation supports the premiss that ambient vibration surveys should be cross-checked with other information sources, such as numerical models, in order to avoid misinterpreting the data.

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

structural identification
ambient vibration monitoring
uncertainty

error-domain identification
extended uniform distribution
correlation


Properties of a fedarated epidemiology query system Purpose: The purpose of the study was to establish knowledge about how online access to epidemiological data from general practitioners (GPs) electronic health record (EHR) system should be provided. Before such systems are developed and deployed a decision about the appropriate system architecture must be made. Such a decision should ideally be based on knowledge about the properties of different system architectures. This choice is important because the system architecture may affect the willingness of GPs to participate in providing epidemiological data from their EHR system. Method: Verifying the performance and properties of an architectural approach by implementing and deploying a system on a trans -institutional level and performing evaluations studies is a very resource demanding method to establish a foundation for the decision of appropriate system architecture. Instead, we have tried to create this foundation by constructing a prototype system, establish knowledge about the properties of the system using experiments, and finally compare the properties of the federated approach to the properties of the centralised approach. By using this methodological approach we provide the best available knowledge, on this stage, for the appropriate system architecture to use for providing access to epidemiological data from the local population. Results: Our experimental results show that it is possible to improve the timeliness and the temporal and spatial resolution of epidemiological data, compared to traditional centralised disease surveillance systems. Up-to-date epidemiological data from the local population may be provided directly from the source EHR system within 4 s. The responsiveness of the system is minimally affected (0.1 s) as the number of participating data providers grows from 1 to 49 data providers. The comparison of the federated approach to the centralised approach indicates that federated approaches avoid the privacy issues involved, as intended; it offers better scalability when computing speed is compared, and it provides better specificity because more data about the patient may be used. Conclusion: The conclusion from our study is that the federated approach to providing epidemiological data about the local population has many benefits over the traditional centralised approach. A federated approach to an epidemiology system may raise the GPs awareness of local disease outbreak because it is possible to share information about incidence rates of communicable diseases and use of laboratory requests in a geographical area

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

distributed systems
population surveillance
computerised patient records


Beyond directed evolution: Darwinian selection as a tool for synthetic biology Synthetic biology is an engineering approach that seeks to design and construct new biological parts, devices and systems, as well as to re-design existing components. However, rationally designed synthetic circuits may not work as expected due to the context-dependence of biological parts. Darwinian selection, the main mechanism through which evolution works, is a major force in creating biodiversity and may be a powerful tool for synthetic biology. This article reviews selection-based techniques and proposes strict Darwinian selection as an alternative approach for the identification and characterization of parts. Additionally, a strategy for fine-tuning of relatively complex circuits by coupling them to a master standard circuit is discussed.

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

darwinian selection
directed evolution
synthetic biology


extending record typing to type parametric modules with sharing We extend term unification techniques used to type extensible records in order to solve the two main typing problems for modules in Standard ML: matching and sharing. We obtain a type system for modules based only on well known unification problems, modulo some equational theories we define. Our formalization is simple and has the elegance of polymorphic type disciplines based on unification. It can be seen as a synthesis of previous work on module and record typing.

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

sharing
unification
type system
ml
order
parametric
polymorphic
module
matching
synthesis
records

formalism standardization theory extensibility


generation of multimedia tv news contents for www In this paper, we present a system we have developed for automatic TV News video indexing that successfully combines results from the fields of speaker verification, acoustic analysis, very large vocabulary video OCR, content based sampling of video, information retrieval, dialogue systems, and ASF media delivery over IP. The prototype of TV news content processing Web was completed in July 2003. Since then, the system has been up running continuously. Up to the date when this message is written (March 27, 2006), the system records and analyzes the prime time evening news program in Taiwan every day of these years, except a few power failure shutdown. The TV news web is at http://140.113.216.64/NewsQuery/main.as

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


Dynamic analysis of steel frames with flexible connections This paper deals with the effects of flexibility and damping in the nodal connections on the dynamic behavior of plane steel frames. A flexible eccentric connection is idealized by nonlinear rotational spring and dashpot in parallel. Thus, the effects of viscous and hysteretic damping on dynamic response of frame structures are taken into consideration. A numerical model that includes both nonlinear connection behavior and geometric nonlinearity of the structure is developed. The complex dynamic stiffness matrix for the beam with flexible connections and linear viscous dampers at its ends is obtained. Several examples are included to illustrate the efficiency and accuracy of the present model.

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

steel frame
semi-rigid connection
nonlinear dynamic analysis


Computational resolution of Diophantine equations by means of alpha-dense curves Purpose - The purpose of this paper is to use alpha-dense curves for solving some Diophantine equations, such as Pythagorean triples, Linear Diophantine equations, the Pell Fermat equation, the Mordell equation for positive values. Design/methodology/approach - The paper's aim is to present the applications in Number Theory of a new method based on alpha-dense curves first developed at the beginning of the 1980s by Yves Cherruault and Arthur Guillez. The alpha-dense curves generalize the space filling curves (Peanocurves,. . .) and fractal curves. This technique can be used for solving all problems of operational research in a simple way. The main idea consists in expressing n variables by means of a single one. Findings - Apply the method to Number Theory. One of the most important applications is related to global optimization. Multivariable optimization problems coming from operational research or from industry can be quickly and easily solved. Originality/value - The paper presents a new method based on alpha-dense curves for solving Diophantine equations.

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

operational research
global optimization
number theory
diophantine equations


On self-healing key distribution schemes Self-healing key distribution schemes allow group managers to broadcast session keys to large and dynamic groups of users over unreliable channels. Roughly speaking, even if during a certain session some broadcast messages are lost due to network faults, the self-healing property of the scheme enables each group member to recover the key from the broadcast messages he has received before and after that session. Such schemes are quite suitable in supporting secure communication in wireless networks and mobile wireless ad-hoc networks. Recent papers have focused on self-healing key distribution, and have provided definitions, stated in terms of the entropy function, and some constructions. The contribution of this paper is the following. We analyze current definitions of self-healing key distribution and, for two of them, we show that no protocol can achieve the definition. We show that a lower bound on the size of the broadcast message, previously derived, does not hold. We propose a new definition of self-healing key distribution, and we show that it can be achieved by concrete schemes. We give some lower bounds on the resources required for implementing such schemes, i.e., user memory storage and communication complexity. We prove that the bounds are tight.

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

group communication
information theory
reliability
self-healing


Retracing the residual curve of a Lyapunov equation solver Let Aaa"e (nxn) and let Baa"e (nxp) and consider the Lyapunov matrix equation AX+XA (T) +BB (T) =0. If A+A (T) < 0, then the extended Krylov subspace method (EKSM) can be used to compute a sequence of low rank approximations of X. In this paper we show how to construct a symmetric negative definite matrix A and a column vector B, for which the EKSM generates a predetermined residual curve.

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


Applying Output Feedback Integral Sliding Mode Controller to Time-Delay Systems For time-delay systems with mismatched disturbances and uncertainties, this paper developed an integral sliding mode control algorithm using output information only to stabilize the system. An integral sliding surface is comprised of output vectors and an auxiliary full-order compensator. The proposed output feedback sliding mode controller can satisfy the reaching and sliding condition and maintain the system on the sliding surface from the initial moment. When the specific linear matrix inequality has a solution, our method can guarantee the stability of the closed-loop system and satisfy the property of disturbance attenuation. Moreover, the design parameters of the controller and compensator can be simultaneously determined by the solution to the linear matrix inequality. Finally, a numerical example illustrated the applicability of the proposed scheme.

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


N-Widths and epsilon-Dimensions for High-Dimensional Approximations In this paper, we study linear trigonometric hyperbolic cross approximations, Kolmogorov n-widths d (n) (W,H (gamma) ), and epsilon-dimensions n (epsilon) (W,H (gamma) ) of periodic d-variate function classes W with anisotropic smoothness, where d may be large. We are interested in finding the accurate dependence of d (n) (W,H (gamma) ) and n (epsilon) (W,H (gamma) ) as a function of two variables n, d and epsilon, d, respectively. Recall that n, the dimension of the approximating subspace, is the main parameter in the study of convergence rates with respect to n going to infinity. However, the parameter d may seriously affect this rate when d is large. We construct linear approximations of functions from W by trigonometric polynomials with frequencies from hyperbolic crosses and prove upper bounds for the error measured in isotropic Sobolev spaces H (gamma) . Furthermore, in order to show the optimality of the proposed approximation, we prove upper and lower bounds of the corresponding n-widths d (n) (W,H (gamma) ) and epsilon-dimensions n (epsilon) (W,H (gamma) ). Some of the received results imply that the curse of dimensionality can be broken in some relevant situations.

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

function classes with anisotropic smoothness


Models Used to Represent the Windings and its Effect on the Torque Obtained from the Finite Element Analysis This paper presents a comparison among different models used to represent the windings and their influence in the mechanic torque obtained from the finite element analysis. The results of the simulations are compared with those obtained from the static measurements of a real 8/6 switched reluctance motor, designed for an electric vehicle application. Also, the mathematical model of the spatially distributed coils, used for the simulations, is developed. Furthermore, the theory supporting the different torque results, obtained with the models, is presented.

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

windings
switched reluctance motor
finite element analysis


Mode-I fatigue crack growth analysis of V-ribbed belts One factor which is critical to the life of automotive serpentine belts is their failure due to propagation of initially small flaws in the elastomer located in the belt rib. This paper aims to develop a predictive fatigue crack growth model for serpentine belts with initially small rib tip flaws. The study combines the fatigue crack growth tests for belt rib material and computational fracture mechanics analysis for V-ribbed belts to predict fatigue life. The belt rib rubber material is tested for its fatigue behavior and the relationship between the fatigue crack growth rate and the tearing energy is constructed. A power law is employed to curve fit the fatigue crack growth rate curve. A globallocal finite element analysis procedure is used to compute the J-integral for a through-the-thickness crack in the belt rib tip. The three-dimensional global model is created with relatively coarse mesh using first order continuum elements in ABAQUS. The three-dimensional local model for the rib crack is constructed with significantly finer mesh and employs the second order continuum elements. The boundary conditions for the local model are driven by the displacement solution of the global model. The maximum and minimum J-integrals are calculated for two extreme configurations in one belt running cycle. The range of the J-integral is input into the curve fitted power law to derive the fatigue crack growth rate and hence the fatigue life for the belt.

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

serpentine belts
fatigue crack growth
elastomer
power law


Syntax-based reordering for statistical machine translation ? In this paper, we develop an approach called syntax-based reordering (SBR) to handling the fundamental problem of word ordering for statistical machine translation (SMT). We propose to alleviate the word order challenge including morpho-syntactical and statistical information in the context of a pre-translation reordering framework aimed at capturing short- and long-distance word distortion dependencies. We examine the proposed approach from the theoretical and experimental points of view discussing and analyzing its advantages and limitations in comparison with some of the state-of-the-art reordering methods. In the final part of the paper, we describe the results of applying the syntax-based model to translation tasks with a great need for reordering (Chinese-to-English and Arabic-to-English). The experiments are carried out on standard phrase-based and alternative N-gram-based SMT systems. We first investigate sparse training data scenarios, in which the translation and reordering models are trained on a sparse bilingual data, then scaling the method to a large training set and demonstrating that the improvement in terms of translation quality is maintained.

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

word reordering
natural language processing
computational linguistics


A modified joint inventory policy for VMI systems Vendor managed inventory (VMI) is a supply-chain initiative in which the vendor is authorized to manage inventories of agreed upon stock-keeping-units at retail locations. In this paper, a modi. ed joint inventory policy is introduced for VMI systems where the vendor takes a standard (s, S) policy and the retailers utilize can-order policies. Under the regime of a can-order policy, each retailer's inventory is controlled by three variables s, c and S. Once the inventory position of retailer k reaches its must-order level s(k), a dispatch from the vendor to retailers is triggered. At the same time, any retailer j, with inventory position at or below its can-order level c(j), is included in the dispatch and thus an economical consolidated dispatch quantity accumulates. To formulate the policy, a renewal theoretic model for the case of Poisson demands is developed. Due to the complexity of the problem, it is difficult to get the analytical solution and thus simulations are utilized to obtain an approximate optimal decision. Finally, the results from simulations show that about 5 to 20 percent of the cost can be saved from utilizing of the modi. ed joint policy, comparing with the standard joint (s, S) policy where both the vendor and retailers take (s, S) policies.

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

vendor-managed inventory
vendor-retailer coordination
can-order policy


Snapshot Isolation and Integrity Constraints in Replicated Databases Database replication is widely used for fault tolerance and performance. However, it requires replica control to keep data copies consistent despite updates. The traditional correctness criterion for the concurrent execution of transactions in a replicated database is 1-copy-serializability. It is based on serializability, the strongest isolation level in a nonreplicated system. In recent years, however, Snapshot Isolation (SI), a slightly weaker isolation level, has become popular in commercial database systems. There exist already several replica control protocols that provide SI in a replicated system. However, most of the correctness reasoning for these protocols has been rather informal. Additionally, most of the work so far ignores the issue of integrity constraints. In this article, we provide a formal definition of 1-copy-SI using and extending a well-established definition of SI in a nonreplicated system. Our definition considers integrity constraints in a way that conforms to the way integrity constraints are handled in commercial systems. We discuss a set of necessary and sufficient conditions for a replicated history to be producible under 1-copy-SI. This makes our formalism a convenient tool to prove the correctness of replica control algorithms.

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

replication
snapshot isolation
integrity constraints


1st international workshop on replication in empirical software engineering research (reser) The RESER 2010 workshop provides a venue in which empirical Software Engineering researchers may present and discuss theoretical foundations and methods of replication, as well as the results of replicated studies.

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

software engineering
research
replication
methods

computer science
validity
reporting
validation


Study of complex charge distributions in an electrolyte using the PoissonBoltzmann equation by lattice-Boltzmann method The main goal of this work is the computational study of the PoissonBoltzmann (PB) equation for a circular and elliptical charges immerse in a strong electrolyte using the lattice-Boltzmann method. We remark that this kind of charge distributions has no analytical results due to the non-linearity of PB equation and the complexity of the charge distributions. The model describes the electrical potential and his interactions produced by ions adsorption on the surface of circular or elliptical charged particles. Finally, we analyze the stability of the method.

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


Hermite spline interpolation on patches for parallelly solving the Vlasov-Poisson equation This work is devoted to the numerical simulation of the Vlasov. equation using a phase space grid. In contrast to Particle-In-Cell (PIC) methods, which are known to be noisy, we propose a semi-Lagrangian-type method to discretize the Vlasov equation in the two-dimensional phase space. As this kind of method requires a huge computational effort, one has to carry out the simulations on parallel machines. For this purpose, we present a method using patches decomposing g the phase domain, each patch being devoted to a processor. Some Hermite boundary conditions allow for the reconstruction of a good approximation of the global solution. Several numerical results demonstrate the accuracy and the good scalability of the method with up to 64 processors. This work is a part of the CALVI project.

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

vlasov-poisson equation
semi-lagrangian method
parallelism


topologic class routing for printed circuit boards A routing procedure is given which is different from Lee type algorithms in that it considers a large group of interconnections simultaneously. A finite number of path classes are established and an algorithm is given for finding the maximum number of non-intersecting interconnections which can be routed if the paths are restricted to these classes. Procedures are given for drawing all interconnections which have been assigned to some path class.

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

routing group algorithm drawing procedure class


The complexity of constructing pseudorandom generators from hard functions We study the complexity of constructing pseudorandom generators ( PRGs) from hard functions, focussing on constant-depth circuits. We show that, starting from a function f : {0, 1}(l) --> {0, 1} computable in alternating time O(l) with O(1) alternations that is hard on average ( i. e. there is a constant epsilon > 0 such that every circuit of size 2(epsilonl) fails to compute f on at least a 1/poly(l) fraction of inputs) we can construct a PRG : {0, 1}(O(log n)) --> {0, 1}(n) computable by DLOGTIME-uniform constant-depth circuits of size polynomial in n. Such a PRG implies BP (.) AC(0) = AC(0) under DLOGTIME-uniformity. On the negative side, we prove that starting from a worst-case hard function f : {0, 1}(l) --> {0, 1} ( i. e. there is a constant epsilon > 0 such that every circuit of size 2(epsilonl) fails to compute f on some input) for every positive constant delta {0, 1}(n) computable by constant-depth circuits of size polynomial in n. We also study worst-case hardness amplification, which is the related problem of producing an average-case hard function starting from a worst-case hard one. In particular, we deduce that there is no black-box worst-case hardness amplification within the polynomial time hierarchy. These negative results are obtained by showing that polynomial-size constant-depth circuits cannot compute good extractors and list-decodable codes.

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

pseudorandom generator
constant-depth circuit
dlogtime-uniformity
noise sensitivity


Topic based photo set retrieval using user annotated tags As a storage and retrieval unit of user generated web objects, set has been receiving increased attention recently in information retrieval research community. Set search requires relevant sets to be retrieved to meet information needs of users. It is different from individual object search in terms of content granularity. While a web object itself is not divisible and independent with each other, a set consists of separable objects that are related in some aspects. This paper proposes a new approach that can effectively measure topical relevance of sets against a user query by utilizing the tags attached to web objects. The main idea of the proposed approach is to prefer the set which covers as many query related subtopics as possible. In particular, in order to compute the topical relevance while addressing the problem of noisy tags, the notion of tag significance score is introduced based on tag co-occurrence frequency. We consider a problem domain of photo set search at flickr.com where individual photos are annotated with texts such as titles and tags. Experimental results show that our proposed method outperforms the previous approaches for photo set retrieval.

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

set search
photo set retrieval
information retrieval

structured data retrieval
ranking
collaborative tagging
collection selection
multimedia retrieval


On the inductive inference of recursive real-valued functions We combine traditional studies of inductive inference and classical continuous mathematics to produce a study of learning real-valued functions. We consider two possible ways to model the learning by example of functions with domain and range the real numbers. The first approach considers functions as represented by computable analytic functions. The second considers arbitrary computable functions of recursive real numbers. In each case we find natural examples of learnable classes of functions and unlearnable classes of functions. (C) 1999 Elsevier Science B.V. All rights reserved.

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


An embedded 5(4) pair of modified explicit Runge-Kutta methods for the numerical solution of the Schrodinger equation A new way for constructing efficient embedded modified Runge-Kutta methods for the numerical solution of the Schrodinger equation is presented in this paper. The methods of the embedded scheme have algebraic orders five and four. Applications of the new pair to the elastic scattering phase-shift problem and coupled differential equations of Schrodinger type indicate that the new pair is much more efficient than other well known comparable embedded Runge-Kutta pairs.

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

coupled differential equations of schrodinger type

explicit runge-kutta methods
embedded runge-kutta methods
variable stepsize algorithms
phase-shift problem


Fabrication and characterization of injection molded multi level nano and microfluidic systems We here present a method for fabrication of multi-level all-polymer chips by means of silicon dry etching, electroplating and injection molding. This method was used for successful fabrication of microfluidic chips for applications in the fields of electrochemistry, cell trapping and DNA elongation. These chips incorporate channel depths in the range between 100nm and 100?m and depth to width aspect ratios between 1/200 and 2. Optimization of the sealing process of all-polymer COC microfluidic chips by means of thermal bonding is also presented. The latter includes comparing the bonding strength of UV-treated foils and presentation of a simple model for estimating the delamination pressure. With UV surface treatments, foils of 100?m thickness were found to withstand pressures up to 9atm in 4mm cylindrical inlets when thermally bonded to micropatterned substrates of 2mm thickness.

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

dry etching
electroplating
injection molding
thermal bonding


Moving object detection based on incremental learning low rank representation and spatial constraint Background modeling and subtraction, the task to detect moving objects in a scene, is an important step in video analysis. In this paper, we present a novel moving object detection method based on Online Low Rank Matrix Recovery and graph cut from monocular video sequences. First, use the K-SVD method to initialize the dictionary to construct the background model, perform foreground detection with augmented Lagrange multipliers (ALM) and refine foreground values by spatial smooth constraint to extract the background and foreground information; Then obtain the clusters of foreground and background respectively using mean shift clustering on the background and foreground information; Third, initialize the S/T Network with corresponding image pixels as nodes (except S/T node); Calculate the data and smoothness term of graph; Finally, use max flow/minimum cut to segmentation S/T network to extract the motion objects. Online dictionary learning is adopted to update the background model. Experimental results on indoor and outdoor videos demonstrate the efficiency of our proposed method.

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

low rank representation
moving object detection
dictionary learning
mean shift
graph cut


Systematic pattern selection using pattern language grammars and design space analysis Software patterns provide reusable solutions to recurring design problems in a particular context. The software architect or designer must find the relevant patterns and pattern languages that need to be considered, and select the appropriate patterns, as well as the best order to apply them. If the patterns and pattern languages are written by multiple pattern authors, it might be necessary to identify interdependencies and overlaps between these patterns and pattern languages first. Out of the possible multitude of patterns and pattern combinations that might provide a solution to a particular design problem, one fitting solution must be selected. This can only be mastered with a sufficient expertise for both the relevant patterns and the domain in which they are applied. To remedy these issues we provide an approach to support the selection of patterns based on desired quality attributes and systematic design decisions based on patterns. We propose to formalize the pattern relationships in a pattern language grammar and to annotate the grammar with effects on quality goals. In a second step, complex design decisions are analyzed further using the design spaces covered by a set of related software patterns. This approach helps to systematically find and categorize the appropriate software patterns-possibly even from different sources. As a case study of our approach, we analyze patterns from a pattern language for distributed object middleware. Copyright (C) 2006 John Wiley & Sons, Ltd.

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

software patterns
pattern languages
pattern selection
design space analysis


Mean field variational Bayesian inference for nonparametric regression with measurement error A fast mean field variational Bayes (MFVB) approach to nonparametric regression when the predictors are subject to classical measurement error is investigated. It is shown that the use of such technology to the measurement error setting achieves reasonable accuracy. In tandem with the methodological development, a customized Markov chain Monte Carlo method is developed to facilitate the evaluation of accuracy of the MFVB method.

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

classical measurement error
markov chain monte carlo

penalized splines
variational approximations


Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems This paper studies gradient-based schemes for image denoising and deblurring problems based on the discretized total variation (TV) minimization model with constraints. We derive a fast algorithm for the constrained TV-based image deburring problem. To achieve this task, we combine an acceleration of the well known dual approach to the denoising problem with a novel monotone version of a fast iterative shrinkage/thresholding algorithm (FISTA) we have recently introduced. The resulting gradient-based algorithm shares a remarkable simplicity together with a proven global rate of convergence which is significantly better than currently known gradient projections-based methods. Our results are applicable to both the anisotropic and isotropic discretized TV functionals. Initial numerical results demonstrate the viability and efficiency of the proposed algorithms on image deblurring problems with box constraints.

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

image deblurring
image denoising
total variation

convex optimization
fast gradient-based methods


The pattern of electronic game use and related bodily discomfort in Hong Kong primary school children The present study examined the usage pattern of electronic game devices among primary school children in Hong Kong. Commonly used types of games devices were grouped into three main categories: large-screen/TV-based games, small handheld game devices and active game devices. A survey was conducted among 476 students in a local primary school, with 258 males and 205 females in the age range of 8-13. A self-reported questionnaire was administered at the school and students reported on the frequency and duration of play with eight types of common electronic game devices in the past month and any bodily discomforts associated with this activity. The results showed that use of several game devices (as many as 3-5 types) were common, with about 40% of the respondents being weekly users and 18% daily users. The design of the different electronic game controllers may affect the postures and muscle loading in the body in different ways, and prolonged exposure can lead to musculoskeletal symptoms. Nearly one third of the respondents (28.9%) reported some bodily discomfort associated with electronic game use. Neck discomfort was most commonly reported, followed by shoulders and fingers. Use of more than 2 h daily of small-screen handheld game devices significantly increased the risk of developing bodily discomfort in any region with an odds ratio of 4.75. The present results have highlighted the importance of monitoring primary school children's exposure to electronic games, especially with small handheld devices, as this may have adverse effect on their musculoskeletal health. (C) 2011 Elsevier Ltd. All rights reserved.

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

child
posture
ergonomics
small-screen handheld devices


mining concept-drifting data streams using ensemble classifiers Recently, mining data streams with concept drifts for actionable insights has become an important and challenging task for a wide range of applications including credit card fraud protection, target marketing, network intrusion detection, etc. Conventional knowledge discovery tools are facing two challenges, the overwhelming volume of the streaming data, and the concept drifts. In this paper, we propose a general framework for mining concept-drifting data streams using weighted ensemble classifiers. We train an ensemble of classification models, such as C4.5, RIPPER, naive Beyesian, etc., from sequential chunks of the data stream. The classifiers in the ensemble are judiciously weighted based on their expected classification accuracy on the test data under the time-evolving environment. Thus, the ensemble approach improves both the efficiency in learning the model and the accuracy in performing classification. Our empirical study shows that the proposed methods have substantial advantage over single-classifier approaches in prediction accuracy, and the ensemble framework is effective for a variety of classification models.

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

framework
task
applications
streams
efficiency
protection
concept
general
paper
model
classification
mining
knowledge discovery
accuracy
network intrusion detection
test
data
learning
ensemble
tools

empirical studies
challenge
concept drift
market
timing
classifier ensemble
predict
training
method
environments
classifier
data streams
effect


Calculation of shrinkage compensation factors for rapid prototyping (FDM 1650) Rapid prototyping turns a three-dimensional CAD drawing into an actual part that can be tested for form, fit, and function. Therefore, accuracy of the prototype is important. The goal of this research was to improve in-plane dimensional accuracy for the Stratasys FDM 1650 rapid prototyping machine. The CHRISTMAS-TREE(TM) test procedure developed by 3D Systems, Inc., was used to arrive at a new shrinkage compensation factor (SCF) for the Stratasys machine. It was found that an SCF of 1.010 will produce a 53% reduction in mean error of the dimensions. More test procedures could be implemented to further refine accuracy. (C) 1999 John Wiley & Sons, Inc.

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

rapid prototyping
shrinkage compensation factor


An Eulerian-Lagrangian moving immersed interface method for simulating burning solids This study concerns the development of a numerical methodology to conduct conjugate heat and mass transfer simulations of burning and moving solids. The flow is described using an Eulerian representation and the solid described using a Lagrangian finite element (FE) method. The fluid-solid interface is defined using a level set function that is initialized by a surface mesh representation that balances accuracy with the computational cost of re-initializing moving interfaces. A ghost-fluid methodology is implemented that results in low errors in mass and energy conservation. Mass transfer from solid ablation is computed explicitly using surface integration over the solid surface mesh to guarantee enforcement of conservation principles. The introduced methodologies are applied to the study of the burning of carbon-epoxy composites. (C) 2013 Elsevier Inc. All rights reserved.

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


Mining customer knowledge for product line and brand extension in retailing Retailing consists of the final activities and steps needed to place a product in the hands of the consumer or to provide services to the consumer. In fact, retailing is actually the last step in a supply chain that may stretch from Europe or Asia to the customers hometown. Therefore, any firm that sells a product or provides a service to the final consumer is performing the retailing function. On the other hand, product line extension, which adds depth to an existing product line by introducing new products in the same product category, can give customers greater choice and help to protect the firm from flanking attack by a competitor. In addition, a product line extension is marketed under the same general brand as a previous item or items. Thus, to distinguish the brand extension from the other item(s) under the primary brand, the retailer can either add secondary brand identification or add a generic brand. This paper investigates product line and brand extension issues in the Taiwan branch of a leading international retailing company, Carrefour, which is a hypermarket retailer. This paper develops a relational database and proposes Apriori algorithm and K-means as methodologies for association rule and cluster analysis for data mining, which is then implemented to mine customer knowledge from household customers. Knowledge extraction by data mining results is illustrated as knowledge patterns/rules and clusters in order to propose suggestions and solutions to the case firm for product line and brand extensions and knowledge management.

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

retailing
product line extension
brand extension
data mining
cluster analysis
knowledge extraction


Grid-Based Geoprocessing for Integrated Global Navigation Satellite System Simulation It is anticipated that the integration of global navigation satellite systems (GNSS) will improve the overall positioning performance benefiting many existing applications and paving the way for the emergence of new location-based or location-aware applications. However, such integrations of GNSSs (iGNSS) will also require the development of a new generation of receivers and methodologies that can utilize the new information efficiently and effectively. This is especially true for real-time applications, such as navigation, for which time performance is of the essence in providing highly accurate positioning solutions. In this paper, we address time performance of iGNSS by focusing only on the visibility parameter, among all parameters, because the visibility solution is a prerequisite for the other parameters, and it is very expensive computationally. We propose an efficient web service for visibility computation, called iGNSS-v and discuss our experimentation with a grid computing platform. The results of the experiment indicate that grids can potentially benefit iGNSS by improving the time performances of its various components, but further optimization is needed in order to address the real-time requirement of iGNSS-QoS prediction. DOI: 10.1061/(ASCE)CP.1943-5487.0000102. (C) 2012 American Society of Civil Engineers.

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

global navigation satellite systems
grid computing
satellite system simulation

grid-based simulation
distributed computing
gps quality of service
navigation systems


an empirical study of fault localization for end-user programmers End users develop more software than any other group of programmers, using software authoring devices such as e-mail filtering editors, by-demonstration macro builders, and spreadsheet environments. Despite this, there has been little research on finding ways to help these programmers with the dependability of their software. We have been addressing this problem in several ways, one of which includes supporting end-user debugging activities through fault localization techniques. This paper presents the results of an empirical study conducted in an end-user programming environment to examine the impact of two separate factors in fault localization techniques that affect technique effectiveness. Our results shed new insights into fault localization techniques for end-user programmers and the factors that affect them, with significant implications for the evaluation of those techniques.

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

help
software
research
affect
environments
fault localization
spreadsheet
debugging
group
paper
filtering
evaluation

empirical studies
activation
dependencies
macros
author
factor
device
demonstrate
end-user
effect
end-user programming
end-user software engineering
programmer


A cellular automaton for the propagation of circular fronts and its applications Artificial intelligence techniques are widely used to solve complicated manufacturing and fabrication process problems in today's industrial world. Cellular automata (CAs) have been applied numerous times as an evolvable technique to the solution of some of the aforementioned complicated problems with great success due to their inherent parallelism, structural locality, regularity and modularity. One of the most difficult problems that CAs dealt with in several cases (i.e. integrated circuit fabrication, pattern recognition and classification, computer aided design, machine vision, etc.) is the identification and the reproduction of circular fronts and shapes. In this paper a CA is used to propagate circular fronts. This CA has an extended Moore neighborhood and a relatively simple local rule based on Boolean operators. Simulation results of an integrated circuit fabrication process, namely chemical vapor deposition based on the proposed CA are also presented. These results were found to be in very good qualitative agreement with the experimental results published in the literature. Moreover, because of the CA's binary states and its local rule simplicity, the VLSI implementation of the proposed CA is straightforward.

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

cellular automata
circular fronts
simulation
chemical vapor deposition


Energy-efficient power allocation for selfish cooperative communication networks using bargaining game In commercial networks, user nodes operating on batteries are assumed to be selfish to consume their energy solely to maximize their own benefits, e.g., data rates. In this paper, we propose a bargaining game to perform the power allocation for the selfish cooperative communication networks. In our system, two partner nodes can act as a source as well as a relay for each other, and each node is with an energy constraint to transmit one frame. Consider a selfish node is willing to seek cooperative transmission only if the data rate achieved through cooperation will not lower than that achieved through noncooperation by using the same amount of energy. The energy-efficient power allocation problem can be modeled as a cooperative game. We proved that there exists a unique Nash bargaining solution (NBS) for the game by verifying that the game is indeed a bargaining problem. Thus, the two objectives, i.e., system efficiency and user fairness specified in the selfish networks can be achieved. Simulation results show that the NBS scheme is efficient in that the performance loss of the NBS scheme to that of the maximal overall rate scheme is small while the maximal-rate scheme is unfair. The simulation results also show that the NBS result is fair in that both nodes could experience better performance than they work independently and the degree of cooperation of a node only depends on how much contribution its partner can make to improve its own performance.

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

cooperative communication
nash bargaining solution

energy efficiency
resource allocation
cooperative game theory


foldable interactive displays Modern computer displays tend to be in fixed size, rigid, and rectilinear rendering them insensitive to the visual area demands of an application or the desires of the user. Foldable displays offer the ability to reshape and resize the interactive surface at our convenience and even permit us to carry a very large display surface in a small volume. In this paper, we implement four interactive foldable display designs using image projection with low-cost tracking and explore display behaviors using orientation sensitivity.

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

projection
orientation sensitivity
interactive
foldable displays


Critical factors for evaluating the public value of e-government in Sri Lanka This paper aims to identify the critical factors for evaluating the public value of e-government in Sri Lanka from the perspective of the delivery of public services and the efficiency of public organizations. To fulfill these aims of the study, a conceptual framework is developed based on a comprehensive review of the related literature by considering the delivery of public services and the efficiency of public organizations. With the collected survey data from Sri Lanka, the conceptual framework is empirically tested and validated by performing a confirmatory factor analysis using structural equation modeling. The study shows that the delivery of quality information and services, user-orientation of information and services, efficiency and responsiveness of public organizations, and contributions of public organizations to the environmental sustainability are the critical factors for evaluating the public value of e-government in Sri Lanka. As the first study in examining the critical factors for evaluating the public value of e-government in Sri Lanka, the findings of the study would be of practical significance to the continuous development of e-government in Sri Lanka and other countries in the world.

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

public value
structural equation modeling
sri lanka


Queueing systems to study the energy consumption of a campus WLAN In this paper we exploit simple approximate queueing models to assess the effectiveness of the approaches that have been proposed to save energy in dense wireless local area networks (WLANs), based on the activation of access points (APs) according to the user demand. In particular, we look at a portion of a dense WLAN, where several APs are deployed to provide sufficient capacity to serve a large number of active users during peak traffic hours. To increase capacity, some APs are colocated and provide identical coverage; we say that these APs belong to the same group, and they serve users in the same area. The areas covered by different AP groups only partially overlap, so that some active users can only be served by a group of APs, but a fraction of active users can be served by more groups. Due to daily variations of the number of active users accessing the WLAN, some APs can be switched off to save energy when not all the capacity is needed. A real example of this setting is provided by a floor of one building of Politecnico di Torino in Italy, where a student library is located. The approximate analytical models indicate that the energy saving achievable with the proposed approaches is quite substantial, over 40% if at least one AP for each group is always kept on, even with no traffic, to be ready to accept incoming users, and it grows to almost 60% if all APs can be switched off at night, using a separate technology to activate an AP when the first user requests association in the morning.

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


Deliberative on-line local path planning for autonomous mobile robots This paper describes a method for local path planning for mobile robots that combines reactive obstacle avoidance with on-line local path planning. Our approach is different to other model-based navigation approaches since it integrates both global and local planning processes in the same architecture while other methods only combine global path planning with a reactive method to avoid non-modelled obstacles. Our local planning is only triggered when an unexpected obstacle is found and reactive navigation is not able to regain the initial path. A new trajectory is then calculated on-line using only proximity sensor information. This trajectory can be improved during the available time using an anytime algorithm. The proposed method complements the reactive behaviour and allows the robot to navigate safely in a partially known environment during a long time period without human intervention.

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

local path planning
obstacle avoidance
autonomous mobile robots


Modeling time criticality of information ? We present a formal setting for time criticality of information in computations. We propose a measure of usefulness of advice. Time criticality exhibits a complex and unexpected behavior during a computation.

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


Molecular docking and 3D-QSAR studies on beta-phenylalanine derivatives as dipeptidyl peptidase IV inhibitors Three-dimensional quantitative structure-activity relationship (3D-QSAR) and molecular docking studies were carried out to explore the binding of 73 inhibitors to dipeptidyl peptidase IV (DPP-IV), and to construct highly predictive 3D-QSAR models using comparative molecular field analysis (CoMFA) and comparative molecular similarity indices analysis (CoMSIA). The negative logarithm of IC(50) (pIC(50)) was used as the biological activity in the 3D-QSAR study. The CoMFA model was developed by steric and electrostatic field methods, and leave-one-out cross-validated partial least squares analysis yielded a cross-validated value (r(cv)(2)) of 0.759. Three CoMSIA models developed by different combinations of steric, electrostatic, hydrophobic and hydrogen-bond fields yielded significant r(cv)(2) values of 0.750, 0.708 and 0.694, respectively. The CoMFA and CoMSIA models were validated by a structurally diversified test set of 18 compounds. All of the test compounds were predicted accurately using these models. The mean and standard deviation of prediction errors were within 0.33 and 0.26 for all models. Analysis of CoMFA and CoMSIA contour maps helped identify the structural requirements of inhibitors, with implications for the design of the next generation of DPP-IV inhibitors for the treatment of type 2 diabetes.

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

beta-phenylalanine
dpp-iv inhibitors
3d-qsar


SOCIAL CHOICE AXIOMS FOR FUZZY SET AGGREGATION The problem of aggregating n fuzzy sets F1, F2,..., F(n) on a set OMEGA is viewed as one of merging the opinions of n individuals (e.g. experts) that rate objects belonging to OMEGA. This approach contrasts with the pure set-theoretic point of view, and leads to interpreting already known axioms underlying fuzzy connectives in a way different from that of multiple criteria aggregation. Various natural properties of a voting procedure, including the ones proposed by Arrow are expressed in the fuzzy set setting. A number of conditions limiting the choice of fuzzy set operations are proposed and classified according to whether they are imperative, mainly technical, or facultative. Families of solutions are obtained that include those proposed in earlier works. The case of non-homogeneous groups is briefly examined. Lastly the application of the voting paradigm to the management of antagonistic local decision rules in knowledge-based systems is outlined.

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

fuzzy set connectives
knowledge-based systems


Real-time business process monitoring using formal concept analysis Purpose - The purpose of this paper is to help industrial managers monitor and analyze critical performance indicators in real time during the execution of business processes by proposing a visualization technique using an extended formal concept analysis (FCA). The proposed approach monitors the current progress of ongoing processes and periodically predicts their probable routes and performances. Design/methodology/approach - FCA is utilized to analyze relations among patterns of events in historical process logs, and this method of data analysis visualizes the relations in a concept lattice. To apply FCA to real-time business process monitoring, the authors extended the conventional concept lattice into a reachability lattice, which enables managers to recognize reachable patterns of events in specific instances of business processes. Findings - By using a reachability lattice, expected values of a target key performance indicator are predicted and traced along with probable outcomes. Analysis is conducted periodically as the monitoring time elapses over the course of business processes. Practical implications - The proposed approach focuses on the visualization of probable event occurrences on the basis of historical data. Such visualization can be utilized by industrial managers to evaluate the status of any given instance during business processes and to easily predict possible subsequent states for purposes of effective and efficient decision making. The proposed method was developed in a prototype system for proof of concept and has been illustrated using a simplified real-world example of a business process in a telecommunications company. Originality/value - The main contribution of this paper lies in the development of a real-time monitoring approach of ongoing processes. The authors have provided a new data structure, namely a reachability lattice, which visualizes real-time progress of ongoing business processes. As a result, current and probable next states can be predicted graphically using periodically conducted analysis during the processes.

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


A methodology for modeling inter-company supply chains and for evaluating a method of integrated product and process documentation Due to the increasing complexity in products and in the resulting enterprise processes, new concepts for process optimization are necessary. One innovative concept, resulting from the requirements of the automotive industry, is the method of an integrated product and process documentation. In order to evaluate the benefits of an inter-company use of this documentation approach a simulation-based decision support system using a modular modeling concept for intra- and inter-company process chains has been developed. This concept is based on the Supply Chain Operations Reference-model (SCOR-model). The developed concept allows the evaluation of different configurations of process chains with different sets of parameters describing realistic production and inventory processes. Focussed on supply chains with high variant and complex products within the automotive industry first scenarios have been built up and the benefits of this integrated documentation approach can be visualized. This approach is the future basis for optimization methods coming from control theory.

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

product and process documentation
decision support system

supply chain management
logistics
enterprise engineering
simulation


Sensitivity analysis of logistic regression parameterization for land use and land cover probability estimation The recent availability of regional-scale land use and land cover data made it possible to apply land use and land cover models at regional-, national-and even continental-scale levels. A commonly used modelling approach is based on the assessment of land cover probabilities by means of logistic regression equations. In most cases, however, the error involved in the parameterization of logistic regression equations is not known. In this article, the sensitivity of logistic regression parameterization for land use and land cover probability assessments is analysed by comparing the results using input maps from different sources. Land cover maps with a range of accuracy levels were collected for a sub-catchment of the Lake Balaton watershed in Hungary. The results show that the parameterization of the logistic regression coefficients is highly dependent on the quality of the input maps. Both the spatial pattern and the area covered by a specific land cover type have a direct influence on the error propagation in the land cover probability maps. These findings should be taken into account when interpreting the results of land use and land cover change models at regional- and national-scale levels.

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


Exploring the Landscape of Protein-Ligand Interaction Energy Using Probabilistic Approach Analysis of protein/small molecule interactions is crucial in the discovery of new drug candidates and lead structure optimization. Small biomolecules (ligands) are highly flexible and may adopt numerous conformations upon binding to the protein. Using computer simulations instead of sophisticated laboratory procedures may significantly reduce cost of some stages of drug development. Inspired by probabilistic path planning in robotics, stochastic roadmap methodology can be regarded as a very interesting approach to effective sampling of ligand conformational space around a protein molecule. Protein-ligand interactions are divided into two parts: electrostatics, modeled by the Poisson-Boltzmann equation, and van der Waals interactions, represented by the Lennard-Jones potential. The results are promising; it can be shown that locations of binding sites predicted by the simulation are in agreement with those revealed by experimental x-ray crystallography of protein-ligand complexes. We wanted to extend our knowledge beyond the current molecular modeling tools to arrive at a better understanding of the ligand-binding process. To this end, we investigated a two-level model of protein-ligand interaction and sampling of ligand conformational space covering the entire surface of protein target. Supplementary Material is available at www.liebertonline.com/cmb.

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

binding site discovery
poisson-boltzmann equation
protein-ligand interaction
stochastic roadmap simulation


From open data to information justice This paper argues for subsuming the question of open data within a larger question of information justice, with the immediate aim being to establish the need for rather than the principles of such a theory. I show that there are several problems of justice that emerge as a consequence of opening data to full public accessibility, and are generally a consequence of the failure of the open data movement to understand the constructed nature of data. I examine three such problems: the embedding of social privilege in datasets as the data is constructed, the differential capabilities of data users (especially differences between citizens and enterprise users), and the norms that data systems impose through their function as disciplinary systems. In each case I show that open data has the quite real potential to exacerbate rather than alleviate injustices. This necessitates a theory of information justice. I briefly suggest two complementary directions in which such a theory might be developed: one defining a set of moral inquiries that can be used to evaluate the justness of data practices, and another exploring the practices and structures that a social movement promoting information justice might pursue.

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

social justice
constructivism
data pluralism


Fairly sharing the credit of multi-authored papers and its application in the modification of h-index and g-index Except the alphabetic ordering authorship papers, the citations of multi-authored papers are allocated to the authors based on their contributions to the paper. For papers without clarification of contribution proportion, a function of author number and rank is presented to rightly determine the credit allocated proportion and allocated citations of each author. Our citation allocation scheme is between the equally fractional counting and the one using the inverse of author rank. It has a parameter to adjust the credit distribution among the different authors. The allocated citations can either be used alone to indicate ones performance in a paper, or can be applied in the modification of h-index and g-index to represent the achievement of a scientist on the whole. The modified h-index and g-index of an author makes use of more papers in which he or she played important roles. Our method is suitable for the papers with wide range of author numbers.

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

ranking
co-authorship
contribution evaluation
h-index
g-index
26b99
c13


Human movement analysis around a view circle using time-order similarity distributions ? We propose a novel scheme for view-changeable action event analysis. A view alignment scheme is proposed for action analysis around a view circle. A property of mirror symmetry is proposed for reducing the whole view space. A novel time-order similarity distribution matrix is proposed for robust event analysis.

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

video surveillance
centroid context
behavior analysis
view invariance
time-order similarity distribution
action classification
hmm
symmetrical projection


The fuzzy based QMPR selection for OLSR routing protocol In this paper, a heuristics for highly efficient selection of multipoint relays (MPR) in optimized link state routing (OLSR) protocol is proposed. MPR selection is one of the most important and critical function of OLSR protocol. This paper proposes a Fuzzy logic based novel routing metric for MPR selection based on the energy, stability and buffer occupancy of the nodes. An algorithm is designed to cope with these constraints in order to find quality MPR (QMPR) that guarantees the QoS in OLSR. The aim of this paper is to formulate, build, evaluate, validate and compare rules for QMPR selection using fuzzy logic. It has been validated that proposed composite metric (based on energy, stability and buffer occupancy) selects a more stable MPR. By mathematical analysis and simulation, it is shown that efficiency of OLSR protocol has been improved using this new routing metric, in terms of energy efficiency and network life time.

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


New bounds for the marcum Q-function New bounds are proposed for the Marcum Q-function, which is defined by an integral expression where the 0th-order modified Bessel function appears. The proposed bounds are derived by suitable approximations of the 0th-order modified Bessel function in the integration region of the Marcum Q-function. They prove to be very tight and outperform bounds previously proposed in the literature. In particular, the proposed bounds are noticeably good for large values of the parameters of the Marcum Q-function, where previously introduced bounds fail and where exact computation of the function becomes critical due to numerical problems.

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

modified bessel function of the first kind


Design and evaluation of a high throughput QoS-aware and congestion-aware router architecture for Network-on-Chip This paper proposes a novel QoS-aware and congestion-aware Network-on-Chip architecture that not only enables quality-oriented network transmission and maintains a feasible implementation cost but also well balance traffic load inside the network to enhance overall throughput. By differentiating application traffic into different service classes, bandwidth allocation is managed accordingly to fulfill QoS requirements. Incorporating with congestion control scheme which consists of dynamic arbitration and adaptive routing path selection, high priority traffic is directed to less congested areas and is given preference to available resources. Simulation results show that average latency of high priority and overall traffic is improved dramatically for various traffic patterns. Cost evaluation results also show that the proposed router architecture requires negligible cost overhead but provides better performance for both advanced mesh NoC platforms.

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

network-on-chip (noc)
interconnection network
congestion-aware
quality-of-service (qos)


Imaging Brain Activation Elucidation of biochemical, physiological, and cellular contributions to metabolic images of brain is important for interpretation of images of brain activation and disease. Discordant brain images obtained with [14C]deoxyglucose and [1- or 6-14C]glucose were previously ascribed to increased glycolysis and rapid [14C]lactate release from tissue, but direct proof of [14C]lactate release from activated brain structures is lacking. Analysis of factors contributing to images of focal metabolic activity evoked by monotonic acoustic stimulation of conscious rats reveals that labeled metabolites of [1- or 6-14C]glucose are quickly released from activated cells as a result of decarboxylation reactions, spreading via gap junctions, and efflux via lactate transporters. Label release from activated tissue accounts for most of the additional [14C]glucose consumed during activation compared to rest. Metabolism of [3,4-14C]glucose generates about four times more [14C]lactate compared to 14CO2 in extracellular fluid, suggesting that most lactate is not locally oxidized. In brain slices, direct assays of lactate uptake from extracellular fluid demonstrate that astrocytes have faster influx and higher transport capacity than neurons. Also, lactate transfer from a single astrocyte to other gap junction-coupled astrocytes exceeds astrocyte-to-neuron lactate shuttling. Astrocytes and neurons have excess capacities for glycolysis, and oxidative metabolism in both cell types rises during sensory stimulation. The energetics of brain activation is quite complex, and the proportion of glucose consumed by astrocytes and neurons, lactate generation by either cell type, and the contributions of both cell types to brain images during brain activation are likely to vary with the stimulus paradigm and activated pathways.

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

brain activation
glucose
lactate
astrocyte

functional brain imaging
glucose utilization
deoxyglucose
neuron
gap junction
lactate trafficking


Comparison of hydro-environmental impacts for ebb-only and two-way generation for a Severn Barrage Marine renewable energy is playing an increasing significant role in many parts of the world, mainly due to a rise in the awareness of climate change, and its detrimental effects, and the increasing cost of natural resources. The Severn Estuary, located between South West England and South Wales, has a tidal range of up to 14m which makes it the second highest tidal range in the world. There are a number of barrage proposals amongst various marine renewable energy schemes proposed to be built in the estuary. The Cardiff-Weston STPG (Severn Tidal Power Group) Barrage, which would be one of the world?s largest tidal renewable energy schemes if built, is one of the most publicised schemes to-date. This barrage would generate about 17TWh/annum of power, which is approximately 5% of the UK?s electricity consumption, whilst causing significant hydro-environmental and ecological impact on the estuary. This study mainly focuses on investigating the hydro-environmental impacts of the STPG barrage for the option of two-way generation, and compares this with the commonly investigated option of ebb-only generation. The impacts of the barrage were modelled by implementing a linked 1-D/2-D hydro-environmental model, with the capability of modelling several key environmental processes. The model predictions show that the hydro-environmental impacts of the barrage on the Severn Estuary and Bristol Channel, such as changes in the maximum velocity and reduction in suspended sediment and bacteria levels, were less significant for the two-way generation scheme when compared with the corresponding impacts for ebb-only generation.

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

severn barrage
marine renewable energy
severn estuary
bristol channel

hydro-environmental modelling
barrage operation


Fusion of local maps in mobile ad-hoc networks One of the problems during a great disaster is the breakdown of communication infrastructure. One of the solutions is the use of mobile ad-hoe networks (MANET). In this paper, we consider the situation in a building after a big fire, explosion or earthquake. Rescue workers equipped with PDAs, which are wireless connected, explore the dynamically changing world. Each individual builds up a local world map based on their local exploration and observation. The local maps are fused via the MANET structure and provide an up to date map of the dynamically changing world. Such maps can be used for mitigation, escape or rescue work.

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

dynamic routing
path finding
artificial intelligence


An embedded processor core for consumer appliances with 2.8GFLOPS and 36 M polygons/s FPU A SuperH(TM) embedded processor core implemented in a 130-nm CMOS process running at 400 MHz achieved 720 MIPS and 2.8 GFLOPS at a power of 250 mW in worst-case conditions. It has a dual-issue seven-stage pipeline architecture but maintains the 1.8 MIPS/MHz of the previous five-stage processor. The processor meets the requirements of a wide range of applications, and is suitable for digital appliances aimed at the consumer market, such as cellular phones, digital still/video cameras, and car navigation systems.

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

embedded processor
architecture
fpu
pipeline


Creating a national strategy for Internet development in Chile A growing body of literature points to the importance of both economic and non-economic factors in reducing the digital divide. This paper examines Chile as a successful case where changes in government policies dramatically increased Internet access from about 2% of the population in 1998 to 23.8% in 2002. After reviewing the literature, the paper examines the debates in Chile over Internet development, tracing how public opinion was able to influence government policies, and how in turn, government policies increased Internet access. Specific policies include lowering telephone rates, connecting the various national networks, creating public access centers, and passing e-commerce legislation.

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


A class of acyclic digraphs with interval competition graphs Let D be an acyclic digraph. The competition graph of D has the same set of vertices as D and an edge between vertices u and v v if and only if there is a vertex x in D such that (u,x) ( u , x ) and (v,x) ( v , x ) are arcs of D. In this paper, we show that the competition graphs of doubly partial orders are interval graphs. We also show that an interval graph together with enough isolated vertices is the competition graph of a doubly partial order. Finally, we introduce a new notion called the doubly partial order competition number of an interval graph and present some open questions.

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

competition graph
interval graph
doubly partial order


extracting smp parallelism for dense linear algebra algorithms from high-level specifications We show how to exploit high-level information, available as part of the derivation of provably correct algorithms, so that SMP parallelism can be systematically identified. Recent research has shown that loop-based dense linear algebra algorithms can be systematically derived from the mathematical specification of the operation. Fundamental to the methodology is the determination of loop-invariants (in the sense of Dijkstra and Hoare) from which correct loops can be systematically derived. We show how the high-level specification of the operation together with these loop-invariants can be exploited to detect the independence of loop iterations. This in turn then allows a Workqueuing Model to be used to implement and parallelize the algorithms using a feature proposed for OpenMP 3.0, task queues. Although performance is not the main feature of this paper, performance is reported on a 4 CPU Itanium2 server for a concrete example, the symmetric rank-k update operation.

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


A first step mapping IMS Learning Design and Moodle Mapping the specification IMS Learning Design and the Course Management System Moodle is a logical step forward on interoperability between eLearning systems and specifications in order to increase the best acceptance of the specifications into the widespread world of the eLearning systems and to ensure the standardization of the outputs from the systems to be used in others. IMS Learning Design and Moodle look for a common understanding focused on the integration of information packages modelled by each part in the other. The final goal aims at Moodle playing an IMS LD package. A second step will map a Moodle course to be used in any IMS LD complaint tool. The Unit of Learning in IMS LD and the course in Moodle become the perfect couple where to find several elements that should match each other. This paper shows how to make this understanding, mapping related elements in both to get a list of pairs easy to translate from one to another, and to define also a list of requirements for this protocol.

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

ims learning design
moodle
integration
mapping


Finite element implementation of a glass tempering model in three dimensions The present paper develops and validates a 3D model for the simulation of glass tempering. It is assembled from well-known models of temperature dependent viscoelasticity and structural relaxation and predicts both transient and steady-state stresses in complex 3D glass geometries. The theory and implementation of the model is comprehensively given and the model is carefully checked and validated. It is demonstrated that by adjusting a single parameter in the model, experimental results can be replicated accurately even for cooling rates far from normal.

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

residual stresses
toughened glass
thermorheological simple material
strength of tempered glass
soda-lime-silica glass


Modified automatic teller machine prototype for older adults: A case study of participative approach to inclusive design The goal of this study was to enhance an existing automated teller machine (ATM) humanmachine interface in order to accommodate the needs of older adults. Older adults were involved in the design and field test of the modified ATM prototype. The design of the user interface and functionality took the cognitive and physical abilities of older adults into account. The modified ATM system included only cash withdrawal and transfer functions based on the task demands and needs for services of older adults. One hundred and forty-one older adults (aged 60 or above) participated in the field test by operating modified or existing ATM systems. Those who operated the modified system were found to have significantly higher success rates than those who operated the existing system. The enhancement was most significant among older adults who had lower ATM-related abilities, a lower level of education, and no prior experience of using ATMs. This study demonstrates the usefulness of using a universal design and participatory approach to modify the existing ATM system for use by older adults. However, it also leads to a reduction in functionality of the enhanced system. Future studies should explore ways to develop a universal design ATM system which can satisfy the abilities and needs of all users in the entire population.

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

universal design
automatic teller machine


Deep Learning with Hierarchical Convolutional Factor Analysis Unsupervised multilayered ("deep") models are considered for imagery. The model is represented using a hierarchical convolutional factor-analysis construction, with sparse factor loadings and scores. The computation of layer-dependent model parameters is implemented within a Bayesian setting, employing a Gibbs sampler and variational Bayesian (VB) analysis that explicitly exploit the convolutional nature of the expansion. To address large-scale and streaming data, an online version of VB is also developed. The number of dictionary elements at each layer is inferred from the data, based on a beta-Bernoulli implementation of the Indian buffet process. Example results are presented for several image-processing applications, with comparisons to related models in the literature.

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

bayesian
deep learning
convolutional
factor analysis


Conjugate conflict continuation graphs for multi-layer constrained via minimization A graph model for describing the relationships among wire segments is crucial to constrained via minimization (CVM) in a VLSI design. In this paper we present a new graph model, called the conjugate conflict continuation graph, for multi-layer CVM with stacked vias. This graph model eases the handling of stacked via problems. An integer linear programming (ILP) formulation and a simulated annealing (SA) algorithm based on this graph model are developed to solve multi-layer CVM. The ILP model is too complicated to solve efficiently. The SA algorithm on average achieves 6.4% via reduction for layouts obtained using a commercial tool under a set of practical constraints in which the metal wires (including pins) used in cell layouts, power rails and rings, and clock routing are treated as obstacles or fixed-layer objects to a multi-layer CVM.

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