Energy-based scatter correction for 3-D PET scanners using NaI(Tl) detectors Earlier investigations with EGO positron emission tomography (PET) scanners showed that the scatter correction technique based on multiple acquisitions with different energy windows are problematic to implement because of the poor energy resolution of EGO (22%), particularly for whole-body studies. We believe that these methods are likely to work better with NaI(TI) because of the better energy resolution achievable with NaI(TI) detectors (10%), Therefore, we investigate two different choices for the energy window, a low-energy window (LEW) on the Compton spectrum at 400-450 keV, and a high-energy window (HEW) within the photopeak (lower threshold above 511 keV). The results obtained for our three-dimensional (3-D) (septa-less) whole-body scanners [axial field of view (FOV) of 12.8 cm and 25.6 cm] as well as for our 3-D brain scanner (axial FOV of 25.6 cm) show an accurate prediction of the scatter distribution for the estimation of trues method (ETM) using a HEW, leading to a significant reduction of the scatter contamination. The dual-energy window (DEW) technique using a LEW is shown to be intrinsically wrong; in particular, it fails for line source and bar phantom measurements, However, the method is able to produce good results for homogeneous activity distributions. Both methods are easy to implement, are fast, have a low noise propagation, and will be applicable to other PET scanners with good energy resolution and stability, such as hybrid NaI(TI) PET/SPECT dual-head cameras and future PET cameras with GSO or LSO scintillators.

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

nai(tl) pet
positron emission tomography (pet)
quantitation


constructing universal version history Developers often copy code for parts or entire products to start a new product or a new release. In order to understand the software change history and to determine the code authorship, we propose to construct a universal version history from multiple version control repositories. To that end we create two practical code copy detection methods at the level of the source code file: prefix-postfix algorithm and prefix algorithm. The full pathname of a file and its version history are used to construct the universal version history of a file by linking together change histories of files that had the same code at any point in the past. The assumption of both algorithms is that developers often duplicate files by copying entire directories. Once the copying is identified we propose an algorithm to link version histories from multiple repositories in order to construct universal version history. The results show that about 41.32\% of source files (in the repository involving more than 6M versions of around 2M files) were duplicated among the Avaya's source code repositories for more than ten different projects. The prefix-postfix algorithm is more suitable than prefix algorithm due to the reasonable error rates after validation of the known copying behaviors.

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

version control
change history
code authorship


Afterschool centers in four rural communities in Michigan As part of KLICK, a statewide project supported by federal funds, afterschool centers were developed in four rural communities in Michigan. It was not long before local values and needs moved the centers in different directions. We describe the first year of operation of the four centers, focusing on the role of on-site coordinators and on the informal, activity-based instruction that the coordinators provided.

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


Just right outsourcing: Understanding and managing risk The risks associated with outsourcing have been the principal limitation on the growth of business process outsourcing, especially cross-border outsourcing. In addition to technological improvements in risk management, it is possible to reduce the risk of opportunistic behavior faced by the buyer by redesigning work flows and dividing work among multiple vendors, increasing the range of tasks that are now appropriate candidates for outsourcing. We provide a taxonomy of risks associated with the outsourcing of business processes. We focus on strategic risks and identify the components of this risk and the means by which it can be mitigated.

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

holdup problem
interorganizational work flows
process design
transaction-cost economics


Planar functions over fields of characteristic two Classical planar functions are functions from a finite field to itself and give rise to finite projective planes. They exist however only for fields of odd characteristic. We study their natural counterparts in characteristic two, which we also call planar functions. They again give rise to finite projective planes, as recently shown by the second author. We give a characterisation of planar functions in characteristic two in terms of codes over \(\mathbb {Z}_{4}\). We then specialise to planar monomial functions f(x)=cx t and present constructions and partial results towards their classification. In particular, we show that t=1 is the only odd exponent for which f(x)=cx t is planar (for some nonzero c) over infinitely many fields. The proof techniques involve methods from algebraic geometry.

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

algebraic curves
codes over \(\mathbb {z}_{4}\)
planar function
relative difference set


Neighbor initiated approach for avoiding deaf and hidden node problems in directional MAC protocol for ad-hoc networks In this paper we propose a MAC called Neighbor Initiated Approach for avoiding Deaf and Hidden node problems in directional MAC protocol for Ad Hoc networks, which takes advantage of the multi beam smart antennas. Through the antenna, a node can simultaneously transmit/receive a packet to/from all the directions around it. Thus the antenna switches itself in transmission and reception mode. In our scheme all transmission and reception will be directional. We discussed the hidden and deaf node problems with directional MAC and proposed the scheme to overcome those shortcomings. Our scheme has been inspired by the IEEE 802.11, which includes a new scheme to inform its neighbors who was deaf due to other communication. Moreover, the simultaneous transmission of the RTS/CTS through its all beams prevent the hidden node problem. In our scheme the idle nodes stay in reception mode for sensing the channel through its M non overlapping beams, as a substitute of omnidirectional antenna. It prevents the hidden node problem due to asymmetry in gain. We have simulated our scheme by OPNET 16.0, and compared our results with CDR MAC, DMAC and IEEE 802.11 protocols. Our results show that NIADH performs better than that of the existing protocols in majority of the scenarios.

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

wlan
ad-hoc networks
ieee802.11
multi-beam antenna


Novel resonant cantilever mass change detection and resonant frequency tuning This paper reports a novel way to detect the resonant frequency of an electro-thermally actuated cantilever sensor that we have previously reported, in order to perform mass detection by resonant frequency shift detection. The device is based on monitoring the rupture of a clamped cantilever structure due to mass changes. Thus the device can only be used once and is best suited for qualitative mass detection. At the same time, the resonant frequency of the device can be tuned by the input signal power. This allows scanning power instead of frequency, and simplifies device operation and accompanying electronics.

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


verifying correct pipeline implementation for microprocessors We introduce a general, automatic verification technique for pipelined designs. The technique is based on a scalable, formal methodology for analyzing pipelines. The key advantages to our technique are: it specifically targets pipeline control, making it more efficient; it requires no explicit specification, since it compares hardware against itself; it can be used within the broader framework of hierarchical verification; and, it can be easily extended to handle certain "complex" pipelined structures.

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

framework methodology pipeline implementation verification general hardware control

hierarchic formalism scalability design complexity


Using participatory modelling to compensate for data scarcity in environmental planning: A case study from India Participatory modelling has provided a new approach to overcome the problem of data scarcity which formerly interfered with the environmental planning for the restoration of the Kolleru-Upputeru wetland ecosystem on the east coast of Andhra Pradesh in South India. New ways had to be found to address the shortcomings of traditionally validated simulation models. The traditional validation process was replaced by joint plausibility discussions and shared vision building in order to improve the understanding of cause-effect relationships and proposals for restoration measures. This study has aimed to match the tacit knowledge of the local stakeholders with explicit scientific knowledge in order to create (i) a mutual basis for an integrated approach as opposed to single-issue measures and (ii) a mutual agreement on follow-up steps needed to sustain both the livelihood of the people as well as the wetland ecosystem. The challenge was to address the hydrological and social complexity. On the basis of a literature review, input data for model simulations were generated from the location-specific knowledge of stakeholders and a rapid field appraisal. The model simulations were used to predict the effects of a number of restoration options. In two workshops, these restoration options were discussed with the stakeholders in order to improve the mutual understanding of the complexity of the wetland system and to reach an agreement on the outlines of an integrated action plan. The participatory modelling approach proved to be a useful tool to obtain a consensus of opinions among the stakeholders.

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

delta system
estuary
environment
salt-water intrusion
duflow
stakeholder participation
integrated water resources management


Impact of harmonics on the interpolated DFT frequency estimator The expression for the frequency estimation error is derived. The expression for the combined variance of the frequency estimator is derived. A procedure for frequency estimation is proposed. The performance of the proposed procedure is compared with those of other methods. Theoretical results are confirmed through both simulation and experimental results.

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

error and uncertainty analysis
interpolated dft method
spectral interference
windowing


Reliability prediction for component-based software architectures One of the motivations for specifying software architectures explicitly is the use of high level structural design information for improved control and prediction of software system quality attributes. In this paper, we present an approach for determining the reliability of component-based software architectures. Our method is based on rich architecture definition language (RADL) oriented towards modem industrial middleware platforms, such as Microsofts. NET and Suns EJB. Our methods involve parameterised contractual specifications based on state machines and thus permits efficient static analysis. We show how RADL allows software architects to predict component reliability through compositional analysis of usage profiles and of environment component reliability. We illustrate our approach with an e-commerce example and report about empirical measurements which confirm our analytical reliability prediction through monitoring in our reliability test-bed. Our evaluation confirms that prediction accuracy for software components necessitates modelling the behaviour of binary components and the dependency of provided services on required components. Fortunately, our measurements also show that an abstract protocol view of that behaviour is sufficient to predict reliability with high accuracy. The reliability of a component most strongly depends on its environment. Therefore, we advocate a reliability model parameterized by required component reliability in a deployment context.

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

availability
component-based software
software architecture


Coupled coincidence point results for compatible mappings in partially ordered fuzzy metric spaces Coupled fixed point problems have attracted much attention in recent times. In this paper we establish coupled coincidence point and coupled fixed point results in the context of fuzzy metric spaces. The two mappings considered here are assumed to be compatible. Hadzic type t-norm is used. By an application of the coincidence point theorem in fuzzy metric spaces, a corresponding result is obtained in metric spaces. The main theorem of this paper is illustrated with an example. Our work extends some existing results. (C) 2012 Elsevier B.V. All rights reserved.

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

compatible mappings
coupled coincidence point

partially ordered set
fuzzy metric space
topology
hadzic type t-norm
cauchy sequence
mixed monotone property


Electronic transport in one-dimensional Ca3Co2O6 single crystal The electronic conductivity study of the quasi-one-dimensional Ca3Co2O6 single crystal evidences a Variable Range Hopping conductivity with temperature-induced crossover between 1D and 3D transport and the opening of a Coulomb gap in the d bands along with the ferromagnetic intra-chain ordering. A large negative magneto-resistance is observed at low temperatures. Both spin-dependent hopping and field-induced suppression of the Coulomb gap are discussed. The electronic hopping parameters we infer agree remarkably with the accessible Co sites. Finally, we present the first electronic noise study in a one-dimensional frustrated magnetic single crystal and we discuss the interplay between the low temperature 3D magnetic ordering and the spin-dependent hopping conductivity on the Co sites.

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

magnetization
magnetotransport
high magnetic field
one dimensional system


Morphological Changes Associated with Aging Affymetrix gene-expression analysis was performed on mRNAs from involved and noninvolved skin biopsies from three volunteers with Lentigo senilis.Of the 42,000 transcripts scanned, 17 were downregulated ( 1.9 times above the control level). A serine peptidase gene was downregulated in keeping with the suggestion that age spots are associated with impaired melanin degradation. Three genes involved in the keratinization and synthesis and the organization of fibers in the basement membrane were downregulated, two metalloproteinase genes were upregulated, as were six genes associated with the inflammatory response, in keeping with the postulate that the visible aspects of aged skin are causally linked with a microinflammatory response.The regulation of five genes associated with the Wnt family was altered. Antiapoptotic genes were downregulated, and six genes associated with transmembrane transport were upregulated

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


Stochastic programming methods applied to network optimization As communication technologies evolve, it becomes necessary to incorporate the stochastic effect of traffic flows into network models. This paper introduces the stochastic programming (SP) methodology for characterizing traffic. Two SP approaches, here-and-now (HN) and scenario tracking (ST), are described through case studies for a prototype network. A numerical optimization procedure is used to perform the simulation. It is clearly demonstrated that when the probability distributions can be estimated analytically, the HN approach can be attractive. Otherwise, the ST approach may be more appropriate.

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

network optimization
stochastic programming

communication networks
network modeling
network simulation


Fast motion estimation using bidirectional gradient methods Gradient-based motion estimation methods (GMs) are considered to be in the heart of state-of-the-art registration algorithms, being able to account for both pixel and subpixel registration and to handle various motion models (translation, rotation, affine, and projective). These methods estimate the motion between two images based on the local changes in the image intensities while assuming image smoothness. This paper offers two main contributions. The first is enhancement of the GM technique by introducing two new bidirectional formulations of the GM. These improve the convergence properties for large motions. The second is that we present an analytical convergence analysis of the GM and its properties. Experimental results demonstrate the applicability of these algorithms to real images.

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

global motion estimation
image alignment


Computing the zeros of quaternion polynomials A method is developed to compute the zeros of a quaternion polynomial with all terms of the form q(k) X-k. This method is based essentially in Niven's algorithm [1], which consists of dividing the polynomial by a characteristic polynomial associated to a zero. The information about the trace and the norm of the zero is obtained by an original idea which requires the companion matrix associated to the polynomial. The companion matrix is represented by a matrix with complex entries. Three numerical examples using Mathematica 2.2 version are given. (C) 2001 Elsevier Science Ltd. All rights reserved.

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

right (and left) quaternionic eigenvalues


A system of types and operators for handling vague spatial objects Vagueness is often present in spatial phenomena. Representing and analysing vague spatial phenomena requires vague objects and operators, whereas current GIS and spatial databases can only handle crisp objects. This paper provides mathematical definitions for vague object types and operators. The object types that we propose are a set of simple types, a set of general types, and vague partitions. The simple types represent identifiable objects of a simple structure, i.e. not divisible into components. They are vague points, vague lines, and vague regions. The general types represent classes of simple type objects. They are vague multipoint, vague multiline, and vague multiregion. General types assure closure under set operators. Simple and general types are defined as fuzzy sets in R(2) satisfying specific properties that are expressed in terms of topological notions. These properties assure that set membership values change mostly gradually, allowing stepwise jumps. The type vague partition is a collection of vague multiregions that might intersect each other only at their transition boundaries. It allows for a soft classification of space. All types allow for both a finite and an infinite number of transition levels. They include crisp objects as special cases. We consider a standard set of operators on crisp objects and define them for vague objects. We provide definitions for operators returning spatial types. They are regularized fuzzy set operators: union, intersection, and difference; two operators from topology: boundary and frontier; and two operators on vague partitions: overlay and fusion. Other spatial operators, topological predicates and metric operators, are introduced giving their intuition and example definitions. All these operators include crisp operators as special cases. Types and operators provided in this paper form a model for a spatial data system that can handle vague information. The paper is illustrated with an application of vague objects in coastal erosion.

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


Defective Maturation of Myeloid Dendritic Cell (DC) in NOD Mice Is Controlled by IDD10/17/18 We previously demonstrated that adoptive transfer of NOD pancreatic lymph node (PLN) DC protected recipients from diabetes. Our recent studies showed that the tolerogenic DC population presented islet antigens and were mature myeloid DC that did not produce IL-12, suggestive of exhausted or fully mature DC. Extensive characterization of the DC population in vivo in NOD and control mice demonstrated a specific deficiency of PLN tolerogenic DC in older mice. These findings suggest autoimmunity might arise in NOD mice secondary to deficient maturation of myeloid DC to a tolerogenic state. To address this issue, we characterized maturation and function at development of bone marrow-derived myeloid DC from NOD and several control strains. We found that NOD DC were highly resistant to several maturation stimuli and maintained an immature phenotype (average % immature DC

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

idd10/17/18
dendritic cell (dc)
pancreatic lymph node (pln)
bone marrow
maturation defect


AM1*parameters for phosphorus, sulfur and chlorine An extension of the AM1 semiempirical molecular orbital technique, AM1*, is introduced. AM1* uses AM1 parameters and theory unchanged for the elements H, C, N, O and F. The elements P, S and Cl have been reparameterized using an additional set of d orbitals in the basis set and with two-center core-core parameters, rather than the Gaussian functions used to modify the core-core potential in AM1. Voityuk and Rosch's AM1(d) parameters have been adopted unchanged for AM1* with the exception that new core-core parameters are defined for Mo-P, Mo-S and Mo-Cl interactions. Thus, AM1* gives identical results to AM1 for compounds with only H, C, N, O, and F, AM1(d) for compounds containing Mo, H, C, N, O and F only, but differs for molybdenum compounds containing P, S or Cl. The performance and typical errors of AM1* are discussed.

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


Strong laws of large numbers for t-norm-based addition of fuzzy set-valued random variables This paper proposes a convergence theorem of fuzzy set-valued random variables under addition which is given by the general triangular normed extension principles. Applying the result with the known results of the various types for strong laws of large numbers of fuzzy set-valued random variables, we obtain a few interesting results of the strong laws of large numbers for triangular norm-based addition of fuzzy set-valued random variables. The finding of Teran [Strong law of large numbers for t-normed arithmetics, Fuzzy Sets and Systems 159 (2008) 343-360] is a special case of our results. (C) 2013 Elsevier B.V. All rights reserved.

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

fuzzy numbers
continuous archimedean t-norm
t-norm-based addition
necessity
fuzzy set-valued random variables


Digging control system for hydraulic excavator The hydraulic excavator is used at a wide variety of sites. Its diversity and convenient operating nature make it popular. Among the different types of work performed by hydraulic excavators, level digging work accounts for a large percentage. When digging or finishing ground surfaces level using the backhoe front attachment, the boom tip height must be controlled so that the bucket tooth tip can be moved horizontally. This paper describes a method of automated level digging control we wish to propose. By using this control system, depth controlled digging can be achieved in the same way as usual manual lever operation while minimizing repetitive depth confirmation work, thereby raising the working efficiency level. (C) 2001 Published by Elsevier Science Ltd.

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


A size-dependent bond failure criterion for cemented granules based on experimental studies In order to establish a new bond failure criterion for bonded particles to be used in two-dimensional Discrete Element Modelling, the mechanical behavior of cemented granules with different cement sizes were investigated. In this paper, experimental results of five series of loading tests on cemented granules with four cement widths were presented. Then incorporated the previous experiments with different cement thicknesses, a bond failure envelope dependent on the cement size was proposed. Among a total of about 600 pairs of tested samples, three failure modes were found. Only the failure mode, in which the failure surface was regular and mechanical responses were stable and repeatable, was considered as the representative results and adopted to establish the bond failure model. The experimental results showed that: the peak normal forces in the compression and tension tests are dependent on the cement size; the peak shear forces or peak torsions in the loading tests with complex loading paths, i.e. combined compression shear test, combined compression torsion test and combined compression shear torsion test, are dependent on the normal force and cement size. The peak shear force or peak torsion increases with the normal force when the normal force is smaller than a critical value, while decreases as the normal force is larger than the critical value. The failure envelope in the nomalsheartorsion space is in an ellipsoidal shape with a cut-off as the normal force reaches the peak compression force. It expands with the cement width and shrinks with the cement 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 O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

different cement sizes
bond failure envelope


A network thermodynamic method for the numerical solution of Burgers' equation This work presents a numerical solution of Burgers' equation using the Network Simulation Method, a method that has been used previously to solve problems of heat transfer through the electro-thermal analogy. In this paper, the analogy is extended to velocity, providing an electro-motion analogy. This method permits the direct visualisation of the local and/or integrated transport variables (velocities, temperatures, fluxes) at any point or section of the medium. It also permits both transient and steady-state problems to be solved simultaneously, while programming does not require the manipulation of sophisticated mathematical software that is inherent in other numerical methods. The accuracy and effectiveness of the method is demonstrated by comparing the results with the information existing in the literature. (c) 2007 Elsevier Ltd. All rights reserved.

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


Constraint-based deadlock checking of high-level specifications Establishing the absence of deadlocks is important in many applications of formal methods. The use of model checking for finding deadlocks in formal models is often limited. In this paper, we propose a constraint-based approach to finding deadlocks employing the ProB constraint solver. We present the general technique, as well as various improvements that had to be performed on ProB's Prolog kernel, such as reification of membership and arithmetic constraints. This work was guided by an industrial case study, where a team from Bosch was modelling a cruise control system. Within this case study, ProB was able to quickly find counterexamples to very large deadlock-freedom constraints. In the paper, we also present other successful applications of this new technique. Experiments using SAT and SMT solvers on these constraints were thus far unsuccessful.

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

constraints
formal methods
deadlocks
prolog
applications


Cryptanalysis of XiaYou group signature scheme Group signature is a variant of digital signatures, which allows members of a group to sign messages anonymously on behalf of the group. The application of group signatures includes e-voting, e-bidding and e-cash. Recently, Xia and You proposed an identity-based group signature scheme with strong separability. In this paper, however, we find that there are several problems in the XiaYou group signature scheme. This scheme is vulnerable to forgery attacks. Any adversary could easily forge a valid group signature for any message without the knowledge of the secret values of the legal members of the group. Furthermore, the XiaYou group signature scheme does not satisfy nearly all other security requirements of group signatures. The signatures are too long to be computed, stored and transmitted.

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

cryptography
discrete logarithm
factoring


Trust analysis of the UK e-voting pilots This article explores the issue of trust in the context of the e-electoral process based on the experience gained through the 2002 and 2003 U.K. e-voting pilots. In our analysis, we adopt a process-stage approach to e-elections. We identify the different agents involved in the e-electoral process so as to indicate who generates trust and to whom they convey their trust during the evolution of the process. We then describe agent responsibilities for each of the process stages to identify the issues that require trust between agents. Thus we indicate why trust was needed to support the deployment of the pilots. Based on our analysis we describe cases where "inherited trust" was indirectly conveyed between agents. Finally, because trust in e-voting is primarily needed from the electorate, we propose four levels of social acceptance for the e-voting process and discuss some trust-building arguments for prospective public administration e-transaction environments.

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


Contact dynamics simulations of compacting cohesive granular systems The modelling of cohesion on the particle scale in granular matter [Vermeer et al., 2001] [1] has recently received increasing attention, because various important applications call for a microscopic foundation for the existing phenomenological continuum theories. Specifically for understanding the different behaviour of nano-powders and ordinary granular matter cohesion has to be taken into account. An example in this context is the so-called sinter-forging of nano-powders, i.e. pressure sintering at relatively low temperatures [Skandan et al., 1994] [2]. We model the corresponding compaction by the rearrangement of a large number of grains by means of contact-dynamics. For this purpose we introduce an attractive force (cohesion) as well as rolling friction between the (round) grains. The latter turns out to be crucial for the stabilization of force chains. (C) 2002 Elsevier Science B.V. All rights reserved.

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


making a case for split data caches for embedded applications In this paper we show that cache memories for embedded applications can be designed to increase performance while reduce area and energy consumed. Previously we have shown that separating data cache into an array cache and a scalar cache can lead to significant performance improvements for scientific benchmarks. In this paper we show that such a split data cache can also benefit embedded applications. To further improve the split cache organization, we augment the scalar cache with a small victim cache and the array cache with a small stream buffer. This "integrated" cache organization can lead to 43\% reduction in the overall cache size, 37\% reduction in access time and a 63\% reduction in power consumption when compared to a unified 2-way set associative data cache for media benchmarks from MiBench suite.

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

victim cache
stream buffer
cache memories


From enzyme kinetics to epidemiological models with Michaelis-Menten contact rate: Design of nonstandard finite difference schemes We consider the basic SIR epidemiological model with the Michaelis-Menten formulation of the contact rate. From the study of the Michaelis-Menten basic enzymatic reaction, we design two types of Nonstandard Finite Difference (NSFD) schemes for the SIR model: Exact-related schemes based on the Lambert W function and schemes obtained by using Mickens's rules of more complex denominator functions for discrete derivatives and nonlocal approximations of nonlinear terms. We compare and investigate the performance of the two types of schemes by showing that they are dynamically consistent with the continuous model. Numerical simulations that support the theory and demonstrate computationally the power of NSFD schemes are presented. (C) 2011 Elsevier Ltd. All rights reserved.

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

nonstandard finite difference method
exact scheme
michaelis-menten equation
advection-reaction equations


Estimating the number of undetected software errors via the correlated capturerecapture model Sometimes a complex software system fails because of errors undiscovered in the design stage of the development process. Detecting these errors early in the process would eliminate many downstream problems. The so-called capturerecapture model, initially used by biologists to estimate the size of wildlife populations, has been widely used to estimate the number of software design errors. However, one simplifying assumption in capturerecapture models is that the inspections performed by various inspectors are statistically independent from each other. In the paper, we propose a novel method that is based on the correlation matrix of multiple inspectors. In a numerical analysis, we show that our method outperforms other traditional models that are based on the independence assumption.

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

software
inspections
capturerecapture model


Mod/Resc Parsimony Inference: Theory and application We address in this paper a new computational biology problem that aims at understanding a mechanism that could potentially be used to genetically manipulate natural insect populations infected by inherited, intra-cellular parasitic bacteria. In this problem, that we denote by MOD/RESC PARSIMONY INFERENCE, we are given a boolean matrix and the goal is to find two other boolean matrices with a minimum number of columns such that an appropriately defined operation on these matrices gives back the input. We show that this is formally equivalent to the BICLIQUE EDGE COVER FOR BIPARTITE GRAPHS problem and derive some complexity results for our problem using this equivalence. We provide a new, fixed-parameter tractability approach for solving both problems that slightly improves upon a previously published algorithm for the BICLIQUE EDGE COVER FOR BIPARTITE GRAPHS. Finally, we present experimental results applying some of our techniques to a real-life dataset. (C) 2012 Elsevier Inc. All rights reserved.

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

biclique edge covering
bipartite graph
np-completeness
graph theory
fixed-parameter tractability
kernelisation


Nonlinear fixed charge transportation problem by spanning tree-based genetic algorithm Networks provide a useful way for modeling real world problems and are extensively used in many different types of systems: communications, hydraulic, mechanical, electronic, and logistics. The transportation problem (TP) is known as one of the important network problems. When the TP problem is associated with additional fixed cost for establishing the facilities or fulfilling the demand of customers, then it is called fixed charge transportation problem (fcTP). This problem is one of the NP-hard (IE/OR) problems that are difficult to solve using traditional methods. This paper aims to show the application of spanning tree-based Genetic Algorithm (GA) approach for solving nonlinear fixed charge transportation problem. Our new idea lies on the GA representation that includes the feasibility criteria and repairing procedure for the chromosome. Several numerical experimental results are presented to show the effectiveness of the proposed method. (c) 2007 Published by Elsevier Ltd.

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

nonlinear fixed charge problem
spanning tree-based genetic algorithm


Program-input generation for testing database applications using existing database states Testing is essential for quality assurance of database applications. Achieving high code coverage of the database applications is important in testing. In practice, there may exist a copy of live databases that can be used for database application testing. Using an existing database state is desirable since it tends to be representative of real-world objects characteristics, helping detect faults that could cause failures in real-world settings. However, to cover a specific program-code portion (e.g., block), appropriate program inputs also need to be generated for the given existing database state. To address this issue, in this paper, we propose a novel approach that generates program inputs for achieving high code coverage of a database application, given an existing database state. Our approach uses symbolic execution to track how program inputs are transformed before appearing in the executed SQL queries and how the constraints on query results affect the applications execution. One significant challenge in our problem context is the gap between program-input constraints derived from the program and from the given existing database state; satisfying both types of constraints is needed to cover a specific program-code portion. Our approach includes novel query formulation to bridge this gap. We incorporate the data-instantiation component in our framework to deal with the case that no effective program input values can be attained. We determine how to generate new records and populate them in the new database state such that the code along the path can be covered. We also extend our approach of program-input generation to test database applications including canonical queries and group-by queries. Our approach is loosely integrated into Pex, a state-of-the-art white-box testing tool for .NET from Microsoft Research. Empirical evaluations on two real database applications show that our approach assists Pex to generate program inputs that achieve higher code coverage than the program inputs generated by Pex without our approachs assistance.

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

test generation
dynamic symbolic execution


Dynamic explicitly specified behaviors in distributed agent-based industrial solutions Currently, the manufacturing domain is primarily characterized by the flexibility, adaptability and robustness of the production system. The manufacturing flow processes lead to shorter cycle times to efficiently meet customer needs. Mentioned features can be more easily achieved in a distributed system, such as holonic or multi-agent system, which becomes strongly influenced by the advancement of semantic technologies. In the majority of existing multi-agent based control systems, which are responsible for acting, sensing, computing and production planning, the ontology (necessary for knowledge bases and communication) is usually hard-coded directly in the agent code. In this case, the hard-coded system behavior can be hardly maintained-usually system reprogramming is needed from time to time to satisfy customer requirements. In this paper we discuss the necessity of explicit definition of both declarative and procedural knowledge and propose explicit procedural knowledge handling. Sharing and distribution of such knowledge is discussed and illustrated on an implemented transportation system example. We also introduce the utilization of discussed architecture for explicit specification of agent behavior in failures patterns handling and smart grid configuration scenario. Such a solution greatly increases the possibility of system integration, openness, flexibility, and extensibility, all without having to restart the running distributed system. The topic discussed in this paper shows the ability of the dynamic reconfigurable multi-agent system to participate in development of industrial control systems and solutions.

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

industry automation
agents
architectures
events
knowledge representation
knowledge transfer


Spatio-temporal context for robust multitarget tracking In multitarget tracking, the main challenge is to maintain the correct identity of targets even under occlusions or when differences between the targets are small. The paper proposes a new approach to this problem by incorporating the context information. The context of a target in an image sequence has two components: the spatial context including the local background and nearby targets and the temporal context including all appearances of the targets that have been seen previously. The paper considers both aspects. We propose a new model for multitarget tracking based on the classification of each target against its spatial context. The tracker searches a region similar to the target while avoiding nearby targets. The temporal context is included by integrating the entire history of target appearance based on probabilistic principal component analysis (PPCA). We have developed a new incremental scheme that can learn the full set of PPCA parameters accurately online. The experiments show robust tracking performance under the condition of severe clutter, occlusions, and pose changes.

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

context-based tracking
probabilistic pca


Myo-electric signals to augment speech recognition It is proposed that myo-electric signals can be used to augment conventional speech-recognition systems to improve their performance under acoustically noisy conditions (e.g. in an aircraft cockpit). A preliminary study is performed to ascertain the presence of speech information within myo-electric signals from facial muscles. Five surface myo-electric signals are recorded during speech, using Ag-AgCl button electrodes embedded in a pilot oxygen mask, An acoustic channel is also recorded to enable segmentation of the recorded myo-electric signal. These segments are processed off-line, using a wavelet transform feature set, and classified with linear discriminant analysis. Two experiments are performed, using a ten-word vocabulary consisting of the numbers 'zero' to 'nine' . Five subjects are tested in the first experiment, where the vocabulary is not randomised. Subjects repeat each word continuously for 1 min; classification errors range from 0.0% to 6.1%. Two of the subjects perform the second experiment, saying words from the vocabulary randomly, classification errors are 2.7% and 10.4%. The results demonstrate that there is excellent potential for using surface myo-electric signals to enhance the performance of a conventional speech-recognition system.

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

myo-electric signal
pattern recognition
biological signal processing


A general framework for statistical performance comparison of evolutionary computation algorithms This paper proposes a statistical methodology for comparing the performance of evolutionary computation algorithms. A twofold sampling scheme for collecting performance data is introduced, and these data are analyzed using bootstrap-based multiple hypothesis testing procedures. The proposed method is sufficiently flexible to allow the researcher to choose how performance is measured, does not rely upon distributional assumptions, and can be extended to analyze many other randomized numeric optimization routines. As a result, this approach offers a convenient, flexible, and reliable technique for comparing algorithms in a wide variety of applications.

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

evolutionary computation
performance comparison
twofold sampling
multiple hypothesis testing


is the island model fault tolerant? This paper presents a research about the Fault Tolerancenature of the Island Model when applied to Distributed-Parallel Genetic Algorithms (GAs). Parallel and distributed models have been extensively applied to GAs when researchers tackle hard problems. Nevertheless, there are few works dealing with the problem of failures that are usually present when a distributed infrastructure is employed. The main results from this research suggest that the GAs Island Modelsare fault tolerant by nature.

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


Application of concurrent engineering in manufacturing industry Companies in either manufacturing or servicing have to be restructured or re-organised in order to overcome challenges of the 21st century in which customers are not only satisfied but also delighted. In this competitive environment, organisations should use a flexible, adaptive and responsive paradigm. Concurrent Engineering (CE) is a management philosophy and is not restricted to manufacturing companies only. It involves systematic and simultaneous approach in developing a product or process while bringing up all the people who need to be involved in the first place. Global competitive pressure has motivated many companies to change to a more rapid form of product development such as concurrent engineering (CE). By executing design in parallel, improvements occur in many areas such as communication, quality, production processes, cash flows, and profitability. Manufacturing enterprise today has become a matter of effective and efficient application of information technology and knowledge-based engineering. On the one hand, this will increase the competitiveness of a firm in terms of quickly meeting dynamic changes in the market. Concurrent engineering (CE) is undertaken to improve the product design process with the intention of improving organisation performance. The study presented in this paper conducted an analysis of existing solutions to the problem of concurrent optimisation of the design, and the process planning stages when a new product is developed is addressed. This paper describes an object-oriented manufacturing process information model in the Unified Modelling Language. The model comprises classes on the necessary manufacturing information, such as artefact, manufacturing activities, workpiece, manufacturing equipment, estimated cost and time, and manufacturing process sequences. The paper advocates for a simultaneous approach rather than the traditional sequential one.

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

concurrent engineering (ce)
design for manufacturability (dfm)
quality function deployment (qfd)
computer-aided process planning (capp)


Experimental Case Studies for Investigating E-Banking Phishing Techniques and Attack Strategies Phishing is a form of electronic identity theft in which a combination of social engineering and Web site spoofing techniques is used to trick a user into revealing confidential information with economic value. The problem of social engineering attack is that there is no single solution to eliminate it completely, since it deals largely with the human factor. This is why implementing empirical experiments is very crucial in order to study and to analyze all malicious and deceiving phishing Web site attack techniques and strategies. In this paper, three different kinds of phishing experiment case studies have been conducted to shed some light into social engineering attacks, such as phone phishing and phishing Web site attacks for designing effective countermeasures and analyzing the efficiency of performing security awareness about phishing threats. Results and reactions to our experiments show the importance of conducting phishing training awareness for all users and doubling our efforts in developing phishing prevention techniques. Results also suggest that traditional standard security phishing factor indicators are not always effective for detecting phishing websites, and alternative intelligent phishing detection approaches are needed.

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

phishing web site
social engineering
security awareness


Exact solution of the centralized network design problem on directed graphs We present a novel exact solution method for the centralized network design problem on directed graphs. The problem is modeled as the well-known graph theoretic problem: the capacitated directed spanning tree problem. We propose a Lagrangian relaxation where the subproblem is a directed spanning tree with a degree constraint on the root. The master problem has an exponential number of constraints and variables. To solve it, we present a cut-and-column generation algorithm based on analytic centers. The latter solves a restricted master problem using a primal analytic center cutting plane method and strengthens the bound by generating columns that correspond to violated primal constraints. The Lagrangian bound is embedded within branch-and-bound leading to an interior point branch-and-price algorithm with cut generation. We use a dual interior point method to warm start the solution of the restricted master problem both after adding columns and after branching. We present numerical results indicating that the proposed approach outperforms the literature on the directed case. (c) 2005 Wiley Periodicals, Inc.

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

analytic center cutting plane method
lagrangian relaxation

capacitated spanning trees
branch-and-price
cut and column generation


Static and Dynamic RED Tuning for TCP Performance on the Mobile Ad Hoc Networks In the past several years, many researchers and experts have focused on the studies of routing protocols over Mobile Ad Hoc Networks (MANETs). Today, the pervasion of Internet applications causes TCP as the standard data transfer protocol for most of networking applications. For achieving reliable data delivery, TCP provides mechanisms of flow and congestion control, where RED is one of the most commonly adopted flavors. Due to the unconstrained movement of the mobile nodes, TCP is unable to distinguish network congestion from link down in MANETs. The average queue length of RED will be longer than MinThreshold if the link re-establishment takes too much time. Then, it will invoke the sender to perform relative congestion control. Therefore, it may degrade the TCP performance before the link reestablishes completely. Hence, the main purpose of this paper is to adjust related parameters of RED for evaluating the performance and propose the tuning strategies in RED to improve the TCP performance in MANETs. Also, we design a simulator with ns-2 to perform simulations. Consequently, the final results indicate that we can obtain better TCP performance through static and dynamic tuning approaches in MANETs. The proposed novel tuning methods of this paper can be the reference for further studies in QoS features and other applications on the Ad-Hoc Wireless Networks.

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

tcp performance
red
static and dynamic tuning


Reasoning with Forest Logic Programs and f-hybrid knowledge bases Open Answer Set Programming (OASP) is an undecidable framework for integrating ontologies and rules. Although several decidable fragments of OASP have been identified, few reasoning procedures exist. In this paper, we provide a sound, complete, and terminating algorithm for satisfiability checking w.r.t. Forest Logic Programs (FoLPs), a fragment of OASP where rules have a tree shape and allow for inequality atoms and constants. The algorithm establishes a decidability result for FoLPs. Although believed to be decidable, so far only the decidability for two small subsets of FoLPs, local FoLPs and acyclic FoLPs, has been shown. We further introduce f-hybrid knowledge bases, a hybrid framework where SHOD knowledge bases and FoLPs coexist, and we show that reasoning with such knowledge bases can be reduced to reasoning with FoLPs only. We note that f-hybrid knowledge bases do not require the usual (weakly) DL-safety of the rule component, thus providing a genuine alternative approach to current integration approaches of ontologies and rules.

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

finite model property
f-hybrid knowledge bases
open answer sets
integration of rules and ontologies


H-infinity State Estimation for Takagi-Sugeno Fuzzy Delayed Hopfield Neural Networks This paper presents a new H-infinity state estimator for Takagi-Sugeno fuzzy delayed Hopfield neural networks. Based on Lyapunov-Krasovskii stability approach, a delay-dependent criterion is proposed to ensure that the resulting estimation error system is asymptotically stable with a guaranteed H-infinity performance. The proposed H-infinity state estimator can be realized by solving a linear matrix inequality (LMI) problem. An illustrative numerical example is given to verify the effectiveness of the proposed H-infinity state estimator

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

takagi-sugeno fuzzy hopfield neural networks


building user interfaces interactively using pre- and postconditions A tool is presented which allows graphic layout of a user interface integrated with specification of behavior using pre- and postconditions.

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

user interface management systems
graphics
dialogue sequencing
graphical user interface builders
integrability


integration and organization of information for display In this poster we present several methods for abstracting data into information and then integrating and organizing it for the purpose of display. We use an example from analysis of pilot-automation interaction to illustrate some of the underlying concepts.

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


Cellular and Molecular Pathogenic Mechanisms of Insulin-Dependent Diabetes Mellitus Insulin-dependent diabetes mellitus (IDDM), also known as type 1 diabetes, is an organ-specific autoimmune disease resulting from the destruction of insulin-producing pancreatic ? cells. The hypothesis that IDDM is an autoimmune disease has been considerably strengthened by the study of animal models such as the BioBreeding (BB) rat and the nonobese diabetic (NOD) mouse, both of which spontaneously develop a diabetic syndrome similar to human IDDM. ? cell autoantigens, macrophages, dendritic cells, B lymphocytes, and T cells have been shown to be involved in the pathogenesis of autoimmune diabetes. Among the ? cell autoantigens identified, glutamic acid decarboxylase (GAD) has been extensively studied and is the best characterized. ? cell-specific suppression of GAD expression in NOD mice results in the prevention of IDDM. Macrophages and/or dendritic cells are the first cell types to infiltrate the pancreatic islets. Macrophages play an essential role in the development and activation of ? cell-cytotoxic T cells. B lymphocytes play a role as antigen-presenting cells, and T cells have been shown to play a critical role as final effectors that kill ? cells. Cytokines secreted by immunocytes, including macrophages and T cells, may regulate the direction of the immune response toward Th1 or Th2 as well as cytotoxic effector cell or suppressor cell dominance. ? cells are destroyed by apoptosis through Fas-Fas ligand and TNF-TNF receptor interactions and by granzymes and perforin released from cytotoxic effector T cells. Therefore, the activated macrophages and T cells, and cytokines secreted from these immunocytes, act synergistically to destroy ? cells, resulting in the development of autoimmune IDDM.

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

autoimmune diseases
insulin-dependent
insulin-dependent diabetes mellitus


A few seemingly harmless routes to a false memory Since the invention of photography we have learned to rely on photos to help us remember significant moments in our lives. We have come to believe that photographs are accurate and valuable records of events thatyears down the trackwe may not be able to remember. In this paper, we review recent research demonstrating that photographs can also help us to remember events that never really happened. We trace the development of the leading false autobiographical memory paradigm, and we then describe research on the power of both fake narrative stories and fake photographs to cultivate false memories.

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


how to communicate unit error messages in spreadsheets In previous work we have designed and implemented an automatic reasoning system for spreadsheets, called UCheck, that infers unit information for cells in a spreadsheet. Based on this unit information, UCheck can identify cells in the spreadsheet that contain erroneous formulas. However, the information about an erroneous cell is reported to the user currently in a rather crude way by simply coloring the cell, which does not tell anything about the nature of error and thus offers no help to the user as to how to fix it.In this paper we describe an extension of UCheck, called UFix, which improves the error messages reported to the spreadsheet user dramatically. The approach essentially consists of three steps: First, we identify different categories of spreadsheet errors from an end-user's perspective. Second, we map units that indicate erroneous formulas to these error categories. Finally, we create customized error messages from the unit information and the identified error category. In many cases, these error messages also provide suggestions on how to fix the reported errors.

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

program analysis
end-user software engineering


Automatic sleep scoring: A search for an optimal combination of measures The objective of this study is to find the best set of characteristics of polysomnographic signals for the automatic classification of sleep stages. A selection was made from 74 measures, including linear spectral measures, interdependency measures, and nonlinear measures of complexity that were computed for the all-night polysomnographic recordings of 20 healthy subjects. The adopted multidimensional analysis involved quadratic discriminant analysis, forward selection procedure, and selection by the best subset procedure. Two situations were considered: the use of four polysomnographic signals (EEG, EMG, EOG, and ECG) and the use of the EEG alone. For the given database, the best automatic sleep classifier achieved approximately an 81% agreement with the hypnograms of experts. The classifier was based on the next 14 features of polysomnographic signals: the ratio of powers in the beta and delta frequency range (EEG, channel C3), the fractal exponent (EMG), the variance (EOG), the absolute power in the sigma 1 band (EEG, C3), the relative power in the delta 2 band (EEG, O2), theta/gamma (EEG, C3), theta/alpha (EEG, O1), sigma/gamma (EEG, C4), the coherence in the delta 1 band (EEG, O1O2), the entropy (EMG), the absolute theta 2 (EEG, Fp1), theta/alpha (EEG, Fp1), the sigma 2 coherence (EEG, O1C3), and the zero-crossing rate (ECG); however, even with only four features, we could perform sleep scoring with a 74% accuracy, which is comparable to the inter-rater agreement between two independent specialists. We have shown that 414 carefully selected polysomnographic features were sufficient for successful sleep scoring. The efficiency of the corresponding automatic classifiers was verified and conclusively demonstrated on all-night recordings from healthy adults.

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

rules of rechtschaffen and kales
automatic sleep stages classification


Soft-Decision-and-Forward Protocol for Cooperative Communication Networks with Multiple Antennas In this paper, a cooperative relaying protocol called soft-decision-and-forward (SDF) with multiple antennas in each node is introduced. SDF protocol exploits the soft decision source symbol values from the received signal at the relay node. For orthogonal transmission (OT), orthogonal codes including Alamouti code are used and for non-orthogonal transmission (NT), distributed space-time codes are designed by using a quasi-orthogonal space-time block code. The optimal maximum likelihood (ML) decoders for the proposed protocol with low decoding complexity are proposed. For OT, the ML decoders are derived as symbolwise decoders while for NT, the ML decoders are derived as pairwise decoders. It can be seen through simulations that SDF protocol outperforms AF protocol for both OT and NT.

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

amplify-and-forward (af)
cooperative communications
distributed space-time code (dstc)
maximum-likelihood (ml) decoder
soft-decision-and-forward (sdf)


Attribute-Based Secure Data Sharing with Hidden Policies in Smart Grid Smart grid uses intelligent transmission and distribution networks to deliver electricity. It aims to improve the electric system's reliability, security, and efficiency through two-way communication of consumption data and dynamic optimization of electric-system operations, maintenance, and planning. The smart grid systems use fine-grained power grid measurements to provide increased grid stability and reliability. Key to achieving this is securely sharing the measurements among grid entities over wide area networks. Typically, such sharing follows policies that depend on data generator and consumer preferences and on time-sensitive contexts. In smart grid, as well as the data, policies for sharing the data may be sensitive because they directly contain sensitive information, and reveal information about underlying data protected by the policy, or about the data owner or recipients. In this study, we propose an attribute-based data sharing scheme in smart grid. Not only the data but also the access policies are obfuscated in grid operators' point of view during the data sharing process. Thus, the data privacy and policy privacy are preserved in the proposed scheme. The access policy can be expressed with any arbitrary access formula. Thus, the expressiveness of the policy is enhanced. The security is also improved such that the unauthorized key generation center or the grid manage systems that store the data cannot decrypt the data to be shared. The computation overhead of recipients are also reduced by delegating most of the laborious decryption operations to the more powerful grid manage systems.

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 B O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O B O O B O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O 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 research framework for pharmacovigilance in health social media: Identification and evaluation of patient adverse drug event reports A research framework for patient reported adverse drug event extraction. Experiments conducted on posts from major diabetes and heart disease forums in US. Each component significantly contributes to the frameworks overall effectiveness.

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

adverse drug event extraction
pharmacovigilance

knowledge acquisition
information search and retrieval
health social media analytics
text mining


A BEM solution for plates on elastic half-space with unilateral contact The method developed to analyze the stress and deflection of plates on unilateral foundation is different from the traditional method. The behavior of plates on unilateral foundation belongs to that of free-boundary problems. It has been proved effective to solve the problems of free-boundary using the linear complementary equation method. In this paper, a boundary elementlinear complementary equation is derived according to contact theory. This equation is used to analyze plate-bending on elastic half-space foundation, especially considering the impact on the internal force and displacement of plate, which is caused by the neighboring loads acting on the foundation around the plate. The effectiveness of the method is illustrated by numerical results.

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

linear complementary equation
unilateral foundation
deflection

boundary element
neighbouring loads
elastic plate


Circular vertex arboricity ? The vertex arboricity va(G) v a ( G ) of graph G G is defined as the minimum of subsets in a partition of the vertex set of G G so that each subset induces an acyclic subgraph and has been widely studied. We define the concept of circular vertex arboricity vac(G) v a c ( G ) of graph G G , which is a natural generalization of vertex arboricity. We give some basic properties of circular vertex arboricity and study the circular vertex arboricity of planar graphs.

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


On thinging things and serving services: technological mediation and inseparable goods In our high-tech society, the design process involves profound questions about the effects of the resulting goods, and the responsibilities of designers. In the philosophy of technology, effects of things on user experience and behaviour have been discussed in terms of the concept of technological mediation. Meanwhile, what we create has moved more and more towards services (processes) rather than products (things), in particular in the context of information services. The question is raised to what extent the concept of technological mediation is adequate to understand effects and responsibilities in information services as well. Therefore, this paper discusses differences between product aspects and service aspects of our creations, and evaluates the applicability of the concept of technological mediation to information services. Specific features of a notion of technological mediation for information services are highlighted, in particular with respect to the different relation between production and consumption. Finally, the paper focuses on the ethical consequences of service impact, and recommendations for service providers, especially in terms of the possibilities for second-order mediation by inviting users to change service properties.

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

design ethics
inseparability
personalisation
product impact
responsibility


Adjustable speed surface subdivision We introduce a non-uniform subdivision algorithm that partitions the neighborhood of an extraordinary point in the ratio sigma : 1 - sigma, where sigma is an element of (0, 1). We Call sigma the speed of the non-uniform subdivision and verify C(1) continuity of the limit surface. For sigma = 1/2, the Catmull-Clark limit surface is recovered. Other speeds are useful to vary the relative width of the polynomial spline rings generated from extraordinary nodes. (C) 2009 Elsevier B.V. All rights reserved.

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


infosec technology management of user space and services through security threat gateways The focus of this paper will demonstrate the need to clearly define and segregate various user space environments in the enterprise network infrastructure with controls ranging from administrative to technical and still provide the various services needed to facilitate the work space environment and administrative requirements of an enterprise system. Standards assumed are industry practices and associated regulatory requirements with implementations as they apply to the various contextual applications. This is a high level approach to understanding the significance and application of an effective secure network infrastructure. The focus is on end user needs and the associated services to support those needs. Conceptually user space is a virtual area allocated to the end user needs identified with specific services to support those needs by creating a virtual playground. To manage risk, the concept of creating a "security threat gateway (STG)" isolates and secures each user space with its associated services. Emphasis will be placed on the functional managerial process and application of the STG, safeguarding one user space from another, to facilitate the use of the needed services to perform the operational tasks of the organization. When user's needs and associated components are clearly identified, then it is possible for anyone to use this model as a template, to guide them in creating an effective strategy for their own network security. This approach is practical in orientation and application, focusing on a high level perspective and assumes the reader already has a low level technical background for a tactical implementation in mitigating risk to the enterprise network infrastructure.

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

dmz
user services
regulatory compliance
security threat gateway (stg)


pattern generation for a deterministic bist scheme Recently a deterministic built-in self-test scheme has been presented based on reseeding of multiple-polynomial linear feedback shift registers. This scheme encodes deterministic test sets at distinctly lower costs than previously known approaches. In this paper it is shown how this scheme can be supported during test pattern generation. The presented ATPG algorithm generates test sets which can be encoded very efficiently. Experiments show that the area required for synthesizing a BIST scheme that encodes these patterns is significantly less than the area needed for storing a compact test set. Furthermore, it is demonstrated that the proposed approach of combining ATPG and BIST synthesis leads to a considerably reduced hardware overhead compared to encoding a conventionally generated test set.

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


New and improved GIST diagnosis methods from combinatorial group testing theory We examine the general problem of built-in-self-test (BIST) diagnosis in digital logic systems. The BIST diagnosis problem has applications that include identification of erroneous test vectors, faulty scan cells, and faulty items. We develop an abstract model of this problem and show a fundamental correspondence to the well-established subject of combinatorial group testing (CGT) (D. Du and F. K. Hwang, Combinatorial Group Testing and Its Applications, 1994). We exploit this new perspective to 1) link existing BIST diagnosis techniques to CGT techniques and provide further insights into existing diagnosis algorithms, 2) improve the performance of diagnosis algorithms, and 3) develop new techniques to address the BIST diagnosis problem. Using the ISCAS'89 benchmarks, we empirically demonstrate the effectiveness of our proposed techniques over existing BIST diagnosis techniques. The vastness of the CGT literature suggests that further improvements from existing research in CGT may be obtained.

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


Distributed collaboration for enhanced sender-driven video streaming We propose a sender-driven system for adaptive streaming from multiple servers to a single receiver over separate network paths. The servers employ information in receiver feedbacks to estimate the available bandwidth on the paths and then compute appropriate transmission schedules for streaming media packets to the receiver based on the bandwidth estimates. An optimization framework is proposed that enables the senders to compute their transmission schedules in a distributed way, and yet to dynamically coordinate them over time such that the resulting video quality at the receiver is maximized. To reduce the computational complexity of the optimization framework an alternative technique based on packet classification is proposed. The substantial reduction in online complexity due to the resulting packet partitioning makes the technique suitable for practical implementations of adaptive and efficient distributed streaming systems. Simulations with internet network traces demonstrate that the proposed solution adapts effectively to bandwidth variations and packet loss. They show that the proposed streaming framework provides superior performance over a conventional distortion-agnostic scheme that performs proportional packet scheduling on the network paths according to their respective bandwidth values.

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

distributed collaboration
internet
packet scheduling
packet partitioning
video streaming

channel coding
source prunning
optimal control
protocols
rate control
rate-distortion optimization
sender-driven transmission
video coding


The fine structure of galls in phylogenetic networks A phylogenetic network is a generalization of a phylogenetic tree, allowing properties that are not tree-like. With the growth of genomic data, much of which does not fit ideal tree models, there is greater need to understand the algorithmics and combinatorics of phylogenetic networks (Posada and Crandall 2001, Schierup and Hein 2000). Wang et al. (2001) studied the problem of constructing a phylogenetic network for a set of n binary sequences derived from the all-zero ancestral sequence, when each site in the sequence can mutate from zero to one at most once in the network, and recombination between sequences is allowed. They showed that the problem of minimizing the number of recombinations in such networks is NP-hard, but introduced a special case of the problem, i.e., to determine whether the sequences could be derived on a phylogenetic network where the recombination cycles are node-disjoint. Wang et al. (2001) provide a sufficient, but not a necessary test, for such solutions. Gusfield et al. (2003, 2004) gave a polynomial-time algorithm that is both a necessary and sufficient test. In this paper, we study in much more detail the fine combinatorial structure of node-disjoint cycles in phylogenetic networks, both for purposes of insight into phylogenetic networks and to speed up parts of the previous algorithm. We explicitly characterize all the ways in which mutations can be arranged on a disjoint cycle, and prove a strong necessary condition for a set of mutations to be on a disjoint cycle. The main contribution here is to show how structure in the phylogenetic network is reflected in the structure of an efficiently-computable graph, called the conflict graph. The success of this approach suggests that additional insight into the structure of phylogenetic networks can be obtained by exploring structural properties of the conflict graph.

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

molecular evolution
ancestral recombination graph
recombination snp
bi-convex graph


An improved algorithm for determinization of weighted and fuzzy automata For a given weighted finite automaton over a strong bimonoid we construct its reduced Nerode automaton, which is crisp-deterministic and equivalent to the original weighted automaton with respect to the initial algebra semantics. We show that the reduced Nerode automaton is even smaller than the Nerode automaton, which was previously used in determinization related to this semantics. We determine necessary and sufficient conditions under which the reduced Nerode automaton is finite and provide an efficient algorithm which computes the reduced Nerode automaton whenever it is finite. In determinization of weighted finite automata over semirings and fuzzy finite automata over lattice-ordered monoids this algorithm gives smaller crisp-deterministic automata than any other known determinization algorithm. (C) 2010 Elsevier Inc. All rights reserved.

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

weighted automaton
strong bimonoid
determinization
nerode automaton


Neural controller for business yield management In the business and operational research field there is a class of perishable inventory control problems called 'yield management'. Examples are floating pricing strategies in air ticket reservation and hotel room booking. Due to the complex nature of yield management, there are few analytical models available for practical application. This paper presents a neural network approach to solving yield management problems. Using modified back propagation neural networks, a threshold band in the high-dimensional yield management space is generated based on historical data and/or management expertise. When the actual inventory level is outside the threshold band, prices should be adjusted to lead the inventory level back to the threshold band. The interval of the threshold band indicates the stability of the business system.

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

business yield management
operational research


Translational psychiatrylight at the end of the tunnel Neuroscience has made tremendous progress delineating the cellular and molecular processes important for understanding neuronal development and behavior, but this knowledge has been slow to translate to new treatments for psychiatric illness. To accelerate this transfer of knowledge to the human condition requires the wide-scale adoption of biomarkers that can bridge preclinical and clinical discoveries, and serve as surrogate measures of efficacy before commencing expensive phase III studies. Several biomarker methodologies, including imaging, electroencephalography (EEG), and blood transcriptomics/proteomics, are now showing promise. From an industry perspective, we highlight the utility of quantitative EEG as one example of a translatable biomarker applicable to psychiatric drug development and discuss recent insights into glutamate system dysfunction in schizophrenia and depression gained through translational studies of the drug ketamine.

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

translational biomarker electroencephalography glutamate ketamine


Design of Ultrawideband Coplanar Waveguide-Fed Koch-Fractal Triangular Antenna This article proposes a new ultrawideband coplanar waveguide-fed-triangular antenna operating in the FCC band (3.1-10.6) GHz. This antenna employs Koch fractal to increase the bandwidth of the triangular antenna. Two iterations of this fractal antenna are fabricated and tested and found to have good agreement with numerical simulations obtained using HFSS. Full parametric study of the antenna is provided. (C) 2012 Wiley Periodicals, Inc. Int J RF and Microwave CAE 23: 200-207, 2013.

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

ultrawideband
koch fractal
triangular antenna


benchmark-based design strategies for single chip heterogeneous multiprocessors Single chip heterogeneous multiprocessors are arising to meet the computational demands of portable and handheld devices. These computing systems are not fully custom designs traditionally targeted by the Design Automation (DA) community, general purpose designs traditionally targeted by the Computer Architecture (CA) community, nor pure embedded designs traditionally targeted by the real-time (RT) community. An entirely new design philosophy will be needed for this hybrid class of computing. The programming of the device will be drawn from a narrower set of applications with execution that persists in the system over a longer period of time than for general purpose programming. But the devices will still be programmable, not only at the level of the individual processing element, but across multiple processing elements and even the entire chip. The design of other programmable single chip computers has enjoyed an era where the design trade-offs could be captured in simulators such as SimpleScaler and performance could be evaluated to the SPEC benchmarks. Motivated by this, we describe new benchmark-based design strategies for single chip heterogeneous multiprocessors. We include an example and results.

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

scenario-oriented design
systems-on-chips (socs)
benchmarking
heterogeneous multiprocessing


Numerical stability and convergence analysis of bone remodeling model Most of remodeling models are lacking of an analysis of its stability and convergence. A novel modification is proposed, assuming the reference equilibrium stimulus as time-dependent. This reference equilibrium stimulus is also considered to be dependent on the local loading history. This modification improves the convergence and the numerical stability in the longterm.

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

strain-adaptivity
error estimates
bone adaptation
finite element analysis
numerical simulations/convergence
dead zone