The BMAP/G/1 ->center dot/PH/1/M tandem queue with feedback and losses Tandem queues are good mathematical models of communication systems and networks, so their investigation is important for theory and applications. In this paper, exact analytical analysis of the tandem queue of the BMAP/G/1 -> ./PH/1/M type with customers loss in case when the intermediate buffer is full and with possible feedback is implemented. Possible correlation in the input stream is taken into account by of assuming the Batch Markovian Arrival Process (BMAP). Stability condition for the tandem is derived. Stationary distribution of the system states is derived. Loss probability is calculated. Dependence of the system performance measures on correlation in the input flow, buffer capacity, and feedback probability is numerically illustrated. (c) 2007 Elsevier B.V. All rights reserved.

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

batch markovian arrival process
tandem queue
feedback
loss probability

data-loss queueing networks
phase type service


Computation of through-space NMR shielding effects by small-ring aromatic and antiaromatic hydrocarbons The GIAO-HF method in Gaussian 03 was employed to calculate the isotropic NMR shielding values of a diatomic hydrogen probe above simple small-ring aromatic and antiaromatic hydrocarbons, including neutral and ionic examples. Subtraction of the isotropic shielding of diatomic hydrogen by itself allowed the prediction of through-space proton NMR shielding increment surfaces for these systems. Substantial shielding was observed above the center of aromatic rings, regardless of whether the ring was ?-aromatic or ?-aromatic, and also regardless of the charge. In sharp contrast, deshielding was observed above the center of antiaromatic rings, regardless of whether the ring was ?-aromatic or ?-aromatic, and also regardless of the charge. Shielding increment values at 2.5 above the ring centers were compared to NICS values at the same position. The shielding effects predicted by using diatomic hydrogen as a computational probe are diagnostic of whether a structure possesses aromaticity or antiaromaticity.

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

through-space shielding effects
giao
hydrocarbon


Occlusion robust and illumination invariant vehicle tracking for acquiring detailed statistics from traffic images Among ITS applications, it is very important to acquire detailed statistics of traffic flows. For that purpose, vision sensors have an advantage because of their rich information compared to such spot sensors such as loop detectors or supersonic wave sensors. However, for many years, vehicle tracking in traffic images has suffered from the problems of occlusion effect and illumination effect. In order to resolve occlusion problems, we have been proposing the Spatio-Temporal Markov Random Field model(S-T MRF) for segmentation of Spatio-Temporal images. This S-T MRF model optimizes the segmentation boundaries of occluded vehicles and their motion vectors simultaneously by referring to textures and segment labeling correlations along the temporal axis as well as the spatial axis. Consequently, S-T MRF has been proven to be successful for vehicle tracking even against severe occlusions found in low-angle traffic images with complicated motions, such at highway junctions. In addition, in this paper, we define a method for obtaining illumination-invariant images by estimating MRF energy among neighbor pixel intensities. These illumination-invariant images are very stable even when sudden variations in illumination or shading effect are occurred in the original images. We then succeeded in seamlessly integrating the method for MRF energy images into our S-T MRF model. Thus, vehicle tracking was performed successfully by S-T MRF, even against sudden variations in illumination and against shading effects. Finally, in order to verify the effectiveness of our tracking algorithm based on the S-T MRF for practical uses, we developed an automated system for acquiring traffic statistics out of a flow of traffic images. This system has been operating continuously for ten months, and thus effectiveness of the tracking algorithm based on S-T MRF model was proven.

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

tracking
occlusion
illumination invariant
traffic statistics


Image denoising using self-organizing map-based nonlinear independent component analysis This paper proposes the use of self-organizing maps (SOMs) to the blind source separation (BSS) problem for nonlinearly mixed signals corrupted with multiplicative noise. After an overview of some signal denoising approaches, we introduce the generic independent component analysis (ICA) framework, followed by a survey of existing neural solutions on ICA and nonlinear ICA (NLICA). We then detail a BSS method based on SOMs and intended for image denoising applications. Considering that the pixel intensities of raw images represent a useful signal corrupted with noise, we show that an NLICA-based approach can provide a satisfactory solution to the nonlinear BSS (NLBSS) problem. Furthermore, a comparison between the standard SOM and a modified version, more suitable for dealing with multiplicative noise, is made. Separation results obtained from test and real images demonstrate the feasibility of our approach.

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

independent component analysis
nonlinear
image denoising
multiplicative noise


timed grid routing (tigr) bites off energy Energy efficiency and collisions avoidance are both critical properties to increase the lifetime and effectiveness of wireless networks. This paper proposes a family of algorithms for reducing both energy consumption and packets collisions in ad-hoc networks. In particular, this family of protocols offers a tradeoff between bandwidth utilization and power consumption. The proposed algorithms are based on geographic knowledge to form a virtual grid and on synchronized clocks in order to achieve a collision free locally computable transmission schedule.As an added benefit to the proposed approach, a new efficient location service that is adjusted to the grid oriented geo-routing is also presented. The paper analyzes the proposed family of algorithms for their induced latency and the energy vs. latency tradeoffs they provide.

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

collision avoidance
geographic grid
power save
ad-hoc networks


SE-AKA: A secure and efficient group authentication and key agreement protocol for LTE networks To support Evolved Packet System (EPS) in the Long Term Evolution (LTE) networks, the 3rd Generation Partnership Project (3GPP) has proposed an authentication and key agreement (AKA) protocol, named EPS-AKA, which has become an emerging standard for fourth-generation (4G) wireless communications. However, due to the requirement of backward compatibility, EPS-AKA inevitably inherits some defects of its predecessor UMTS-AKA protocol that cannot resist several frequent attacks, i.e., redirection attack, man-in-the-middle attack, and DoS attack. Meanwhile, there are additional security issues associated with the EPS-AKA protocol, i.e., the lack of privacy-preservation and key forward/backward secrecy (KFS/KBS). In addition, there are new challenges with the emergence of group-based communication scenarios in authentication. In this paper, we propose a secure and efficient AKA protocol, called SE-AKA, which can fit in with all of the group authentication scenarios in the LTE networks. Specifically, SE-AKA uses Elliptic Curve Diffie-Hellman (ECDH) to realize KFS/KBS, and it also adopts an asymmetric key cryptosystem to protect users privacy. For group authentication, it simplifies the whole authentication procedure by computing a group temporary key (GTK). Compared with other authentication protocols, SE-AKA cannot only provide strong security including privacy-preservation and KFS/KBS, but also provide a group authentication mechanism which can effectively authenticate group devices. Extensive security analysis and formal verification by using proverif have shown that the proposed SE-AKA is secure against various malicious attacks. In addition, elaborate performance evaluations in terms of communication, computational and storage overhead also demonstrates that SE-AKA is more efficient than those existing protocols.

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

3rd generation partnership project (3gpp)


gossiping using the energy map in wireless sensor networks A gossip protocol randomly decides the set of nodes that will forward a packet it received. Gossiping was proposed to be used in dynamic topology networks such as Wireless Sensor Networks (WSNs). This work proposes Gossiping using the Energy Map (GEM), a new gossiping-based protocol to perform energy-aware broadcasting in WSNs. The key idea is to change the random selection of neighbors in a way that the selection process uses the energy map. In our protocol, the routing flow is directed to the nodes with the greatest energy reserves, balancing the network energy and preserving nodes localized inside low energy regions to perform sensing tasks.

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

wireless sensor networks
gossiping
energy map
broadcasting


A review of vibration serviceability criteria for floor structures This paper is a survey of the historical developments in modeling human dynamic loads, perception criteria used in structural floor vibrations, and the techniques used to mitigate the human-induced vibrations. Two of the techniques are explained in more detail, namely: semi-active control and passive control using advanced materials.

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

dynamic loads
vibrations
perception criteria


Spacetime proper generalized decompositions for the resolution of transient elastodynamic models In this paper, we investigate ability of proper generalized decomposition (PGD) to solve transient elastodynamic models in spacetime domain. Classical methods use time integration schemes and an incremental resolution process. We propose here to use standard time integration methods in a non-incremental strategy. As a result, PGD gives a separated representation of the spacetime solution as a sum of tensorial products of space and time vectors, that we interpret as spacetime modes. Recent time integration schemes are based on multi-field formulations. In this case, separated representation can be constructed using state vectors in space and same vectors in time. However, we have experienced bad convergence order using this decomposition. Furthermore, temporal approximation must be the same for all fields. Thus, we propose an extension of classical separated representation for multi-field problems. This multi-field PGD (MF-PGD) uses space and time vectors that are different for each field. Calculation of decomposition is done using a monolithic approach in space and time, potentially allowing the use of different approximations in space and time. Finally, several simulations are performed with the transient elastodynamic problem with one dimension in space. Different approximations in time are investigated: Newmark scheme, single field time discontinuous Galerkin method and two fields time continuous and discontinuous Galerkin methods.

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

multi-field proper generalized decomposition (mf-pgd)


A Boolean measure of similarity We propose a way of measuring the similarity of a Boolean vector to a given set of Boolean vectors, motivated in part by certain data mining or machine learning problems. We relate the similarity measure to one based on Hamming distance and we develop from this some ways of quantifying the quality of a dataset.

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


Efficient algorithms for chemical threshold testing problems We consider a generalization of the classical group testing problem. Let us be given a sample contaminated with a chemical substance. We want to estimate the unknown concentration c of this substance in the sample. There is a threshold indicator which can detect whether the concentration is at least a known threshold. We consider both the case when the threshold indicator does not affect the tested units and the more difficult case when the threshold indicator destroys the tested units. For both cases, we present a family of efficient algorithms each of which achieves a good approximation of c using a small number of tests and of auxiliary resources. Each member of the family provides a different tradeoff between the number of tests and the use of other resources involved by the algorithm. Previously known algorithms for this problem use more tests than most of our algorithms do. (C) 2001 Elsevier Science B.V. All rights reserved.

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


Making e-government work: Adopting the network approach We attempt to analyse why e-government projects are prone to design-reality gap. We argue that it is caused by the presence of a network of diverse actors. Network management theory can help us in understanding these gaps. Three Indian e-government cases having varying degrees of success are examined. Network management explains design-reality gap in all three cases.

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

e-government failure
multiple actors
politics of network management
resource dependency
process analysis


Global stability analysis in delayed Hopfield neural network models In this paper, without assuming the boundedness, monotonicity and differentiability of the activation functions, we present new conditions ensuring existence, uniqueness, and global asymptotical stability of the equilibrium point of Hopfield neural network models with fixed time delays or distributed time delays. The results are applicable to both symmetric and nonsymmetric interconnection matrices, and all continuous nonmonotonic neuron activation functions. (C) 2000 Elsevier Science Ltd. All rights reserved.

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

delay
global asymptotic stability
m-matrix


Securing web services for deployment in health grids In this paper we describe an approach to the facilitation of system-wide security that enables fine-grained access control within systems in which third party web services are deployed. The primary motivation for the work comes from the authors research into the development of grid-enabled healthcare systems (or health grids). Indeed, we would argue that if the e-Health dream is to become reality, then there is a clear need for web services that enable remote access to medical data to be secured in an appropriate fashion. We compare our approach of wrapping web services with alternative approaches based on generic SOAP proxies. As an illustrative example we describe how the OGSA-DAI grid services have been secured via XACML-based access control policies.

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

security
healthcare
web services
access control


A monolithic based NIRS front-end wireless sensor This paper concerns a novel analog front-end of a wireless brain oxymeter smart sensoring instrument based on near-infrared spectroreflectometry (NIRS). The NIRS sensor makes use of dynamic threshold transistors (DTMOS) for low voltage (1V), low power and low noise enhancement. The design is composed of a transimpedance amplifier (TIA) and an operational transconductance amplifier (OTA). The OTA differential input pairs use DTMOS devices for input common mode range enhancement. The OTA was fabricated in a standard 0.18?m CMOS process technology. Measurements under a 5pF capacitive load for the OTA gave a DC open loop gain of 67dB, unity frequency gain bandwidth of 400kHz, input and output swings of 0.58 and 0.7V, a power consumption of 18?W, and an input referred noise of 134nV/?Hz at 1kHz without any extra noise reduction techniques. The achieved features of the proposed oxymeter front-end will allow ultra low-light level measurements, high resolution and good temperature stability.

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


A comparison of loop closing techniques in monocular SLAM Loop closure detection systems for monocular SLAM come in three broad categories: (i) map-to-map, (ii) image-to-image and (iii) image-to-map. In this paper, we have chosen an implementation of each and performed experiments allowing the three approaches to be compared. The sequences used include both indoor and outdoor environments and single and multiple loop trajectories.

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


Ideals in constructive Banach algebra theory We introduce the notion of a 'q-ideal in a commutative Banach algebra, and investigate the relation between q-ideals and maximal ideals constructively. (C) 2006 Elsevier Inc. All rights reserved.

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


A new method to the treatment of corners in the BEM Corner problems frequently occur in boundary element analyses. By adding a virtual node to an element linked at a corner, we formulate the boundary integral equations corresponding to the virtual node to complement the auxiliary equations. Then, variables at virtual nodes are interpolated by the variables of the nodes of element including the virtual node. The proposed method does not use the constitutive relationship and can be easily extended to the situation where material nonlinearity is considered. Several numerical examples demonstrate the validity and accuracy of the proposed method.

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

boundary element method
direct boundary integral method
linear interpolation


A Variation Tolerant Current-Mode Signaling Scheme for On-Chip Interconnects Current-mode signaling (CMS) with dynamic overdriving is one of the most promising scheme for high-speed low-power communication over long on-chip interconnects. However, they are sensitive to parameter variations due to reduced voltage swings on the line. In this paper, we propose a variation tolerant dynamic overdriving CMS scheme. The proposed CMS scheme and a competing CMS scheme (CMS-Fb) are fabricated in 180-nm CMOS technology. Measurement results show that the proposed scheme offers 34% reduction in energy/bit and 42% reduction in energy-delay-product over CMS-Fb scheme for a 10 mm line operating at 0.64 Gbps of data rate. Simulations indicate that the proposed CMS scheme consumes 0.297 pJ/bit for data transfer over the 10 mm line at 2.63 Gb/s. Measurements indicate that the delay of CMS-Fb becomes 2.5 times its nominal value in the presence of intra-die variations whereas the delay of the proposed scheme changes by only 5% for the same amount of intra-die variations. Measurement and simulation results show that both the schemes are robust against inter-die variations. Experiments and simulations also indicate that the proposed CMS scheme is more robust against practical variations in supply and temperature as compared to CMS-Fb scheme.

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

current-mode circuit
on-chip global interconnects
process variation


Delay-dependent TS fuzzy control for nonlinear interconnected systems: Using dithers as auxiliaries A novel approach via the composite of fuzzy controllers and dithers is presented. We can synthesize a set of fuzzy controllers and find appropriate dithers to stabilize nonlinear multiple time-delay (NMTD) interconnected systems. When the designed fuzzy controllers cannot stabilize the NMTD interconnected systems, a batch of high-frequency signals (commonly referred to as dithers) is simultaneously introduced to stabilize it.

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


A note to inequalities of Euler-Gruss type Following the main ideas of Wang [1], we generalize Matic's results and establish our inequalities for functions with n(th) derivatives of bounded p-variation. All of our error bounds are sharp in the sense that they cannot be replaced by smaller ones. (c) 2006 Elsevier Ltd. All rights reserved.

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

bernoulli polynomial
bounded p-variation
error estimate
gruss inequality
symmetric nodes


An analog drive loop for a capacitive MEMS gyroscope The linear model and the design of an analog drive loop for the drive (primary) resonator in a capacitive gyroscope are presented. Four different types of gain control topologies are compared and analyzed with both P- and PI-type controllers. The simple model proposed in the paper allows the small signal properties of the loop to be predicted. The theoretical models based on the small signal analysis are compared to the simulated and measured results. A proportional amplitude controller, together with the rest of the drive loop, is implemented using a high-voltage 0.35-mu m CMOS technology and a nominal supply of 3 V. Clock generation using a PLL and the drive loop signal as the reference are also discussed in the paper.

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

interface
integrated circuits
amplitude control
agc


Extension and generalization properties of the weighted Minkowski inverse in a Minkowski space for an arbitrary matrix The weighted Minkowski inverse A M , N ? ? M n , m ?related to the positive definite matrices M?Mm M ? M m and N?Mn N ? M n of an arbitrary matrix A?Mm,n A ? M m , n (including singular and rectangular) is one of the important generalized inverses for solving matrix equations in Minkowski space ? ? . In this paper, the results are introduced in the following three ways. First, we establish some new and attractive properties of the weighted Minkowski inverse A M , N ? in a Minkowski space ? ? . Second, new representations and conditions for the continuity of the weighted Minkowski inverse A M , N ? in a Minkowski space ? ? are discussed. Finally, some illustrated counterexamples are also studied to show that some well-known properties of the weighted MoorePenrose inverse A M , N + in a Hilbert space H H are not valid in the Minkowski inverse A M , N ? in a Minkowski space ? ? .

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

weighted minkowski inverse
weighted moorepenrose inverse

weighted ? ? -symmetric ? ? ? ? ?
weighted singular value decomposition


Development of an integrated model for assessing the impact of diffuse and point source pollution on coastal waters Pollution loads from land sources and their impact on the receiving waters can be predicted by using land-use and surface water quality models, respectively. In this paper details are given of the development of an integrated modelling system for managing water quality in coastal basins. The system includes a model linking the pollution input loads to land-use and a model for simulating surface flow and chemical and biological processes. The land-use model consists of two main components: a database and a model base. It uses a GIS system, namely ArcGIS, as the model platform. The database, built in the Geo-database format, includes six data sets containing information on social, economical, bathymetrical and hydrological aspects of a study area. The model base includes a series of transfer functions that link the pollution loads to key sources, including those from: industrial, domestic and agricultural inputs, and fish and animal farming. The water quality model is a numerical model which solves the governing equations representing the physical, chemical and biological processes in coastal waters. The modelling system was set up for Bohai Bay in China, with the land-use model being used to provide nutrient loadings from individual inputs and the water quality model used to predict the impact of these inputs on the receiving waters. Model simulations were also undertaken to predict the water quality conditions for various development and management scenarios.

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

land-use management
hydro-environmental impact assessment


Operation Mechanism of the Driving Force System of Ecosystem of Cyber-society Based on the System Dynamics Operation of the driving force system of Ecosystem of Cyber-society needs a scientific mechanism of intervention and regulation to solve the integration problem of a variety of organizations and forces within the Ecosystem of Cyber-society, shorten the process from uncoordination to coordination, promote the orderly operation of the driving force system of Ecosystem of Cyber-society, make the system play a strong force, in order to promote the formation and rapid development of Ecosystem of Cyber-society. We analyze the driving force system of Ecosystem of Cyber-society using the theory of System Dynamics and propose a theoretical framework, and then present its operation mechanism systematically.

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

driving force system
operation mechanism
system dynamics


PCM: a privacy-preserving detection mechanism in mobile ad hoc networks Although extensive research work has been undertaken to secure mobile ad hoc networks, till recently, researchers began to pay attention to the anonymity issue, and this issue was investigated mainly in terms of secure routing and data forwarding. We indicate that, in mobile ad hoc networks, there is an increasing interest in providing anonymity for the witnesses, i.e., those users who share their knowledge in detecting either malicious or selfish users. On the other hand, it is also a challenging problem to prevent the misuse of anonymous sources. In this paper, we propose the PlainClothesMan (PCM) protocol to provide anonymity for the witness who helps identify malicious or selfish users. Once there are more than a certain number of claims from distinct users against the same user, she is identified as a malicious or selfish user. Moreover, in PCM, the misuse of the witness anonymity is prevented in such a way that any malicious user who broadcasts multiple invalid claims against the same user for the same reason can be identified. Two exemplary scenarios are designed and simulated to model the necessities of witness anonymity in mobile ad hoc networks. Simulation results show that witness anonymity is very important for ensuring proper and efficient executions of fundamental functionalities of mobile ad hoc networks, e.g., certificate revocation and fairness, and PCM is both effective and efficient in providing such a type of anonymity. Copyright (C) 2009 John Wiley & Sons, Ltd.

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


improving citizens' interactions in an e-deliberation environment In an e-deliberation environment it is particularly important to conceive tools and web interfaces able to facilitate social online interactions between citizens and public officers. In this paper we present some choices made in the development of an e-deliberation platform. In particular we will focus on the use of maps to facilitate citizens interaction based on geo-localized discussions, and on the design of an ad hoc interface for online discussion to increase citizens' participation.

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

web-based social interaction
map-based interaction
e-deliberation
e-participation


Separation of structural modes and harmonic frequencies in Operational Modal Analysis using random decrement A method of separation of structural modes from the harmonic frequencies in OMA is proposed. The method utilizes the difference in the characteristics of randomdec signature of stochastic and harmonic response. Method works well for well-separated harmonics as well as harmonics close to resonant frequencies. Method is easy to implement and requires little data.

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

harmonic separation
random decrement technique
random plus sine signal
randomdec with harmonic


Real-time computer-generated integral imaging and 3D image calibration for augmented reality surgical navigation A new graphics pipeline for computer-generated integral imaging is presented for autostereoscopic 3D image surgical overlay. An automatic 3D image calibration paradigm for removing the distortion of 3D images is proposed. The undistorted 3D image after the calibration yields sub-millimeter geometric accuracy. A novel AR device for 3D image surgical overlay is presented based on the proposed methods. A phantom application simulating oral and maxillofacial surgery was performed which has confirmed the usability of the AR system.

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

integral imaging
3d image calibration
augmented reality
surgical navigation


Implicit predictorcorrector central finite difference scheme for the equations of magnetohydrodynamic simulations Nowadays most of supercomputers are based on the frame of PC cluster; therefore, the efficiency of parallel computing is of importance especially with the increasing computing scale. This paper proposes a high-order implicit predictorcorrector central finite difference (iPCCFD) scheme and demonstrates its high efficiency in parallel computing. Of special interests are the large scale numerical studies such as the magnetohydrodynamic (MHD) simulations in the planetary magnetosphere. An iPCCFD scheme is developed based on fifth-order central finite difference method and fourth-order implicit predictorcorrector method in combination with elimination-of-the-round-off-errors (ERE) technique. We examine several numerical studies such as one-dimensional BrioWu shock tube problem, two-dimensional OrszagTang vortex system, vortex type KH instability, kink type KH instability, field loop advection, and blast wave. All the simulation results are consistent with many literatures. iPCCFD can minimize the numerical instabilities and noises along with the additional diffusion terms. All of our studies present relatively small numerical errors without employing any divergence-free reconstruction. In particular, we obtain fairly stable results in the two-dimensional BrioWu shock tube problem which well conserves ? ? B = 0 throughout the simulation. The ERE technique removes the accumulation of roundoff errors in the uniform or non-disturbed system. We have also shown that iPCCFD is characterized by the high order of accuracy and the low numerical dissipation in the circularly polarized Alfvn wave tests. The proposed iPCCFD scheme is a parallel-efficient and high precision numerical scheme for solving the MHD equations in hyperbolic conservation systems.

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

numerical methods
magnetohydrodynamics
implicit time stepping method


Regularity of bondgraphs and directed bondgraphs This article concludes the presentation of a theory for the mathematical foundations that tacitly support the construction and manipulation of a bondgraph model (BGM) of a spatially discrete physical system. A di-bondgraph B consists of an underlying bondgraph B , a diagram with only junctions and bonds, and directions assigned to the bonds. B generates a pair of integral chain group representations of its dual cycle and cocycle matroids, which encapsulate the structural relationships in the system. The important class of regular (di-)bondgraphs can be identified using the concepts of regular matroids and chain groups. Bond and junction elimination operations are described to create a sub-diagram called a minor, reflecting the matroid operations of contraction and deletion of matroid elements. This provides a device for manipulating a (di-)bondgraph diagram to test for a redundant internal junction, or for a non-regular matroid. A di-bondgraph B induces an orientation on its cycle and cocycle matroid; if B is regular it has the same matroids as its underlying bondgraph B , and the orientation defined by B is a signing of these. In a BGM the integral cycles and cocycles obtained from the dual chain groups may be used to express spatial constraints between variables, signed quantities being essential to represent polarities required by physical measurements. A discussion is focused on several important issues: a rationale for excluding TF and GY elements in a purely combinatorial analysis, maintaining the symmetry of duality which is so central to the bondgraph concept; the independent influence of bond directions on structure (matroids) and orientation (chain groups); and the relevance of non-regular di-bondgraphs in practical modelling. In conclusion, an argument is made for the essential practical equivalence of bondgraph and graph-theoretic modelling (GTM). Any technique, formulation, computer software, algorithm, or application expressed in terms of one method will have a parallel version in terms of the other. Moreover, conversion between the BGM and GTM views ought to be a conceptually and computationally trivial exercise.

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

bond graph model
directed bondgraph
junction structure
regular matroid
graph-theoretic model


Anatomy of high-performance matrix multiplication We present the basic principles that underlie the high-performance implementation of the matrix-matrix multiplication that is part of the widely used GotoBLAS library. Design decisions are justified by successively refining a model of architectures with multilevel memories. A simple but effective algorithm for executing this operation results. Implementations on a broad selection of architectures are shown to achieve near-peak performance.

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

algorithms
linear algebra
basic linear algebra subprogrms


Fast Min-Hashing Indexing and Robust Spatio-Temporal Matching for Detecting Video Copies The increase in the number of video copies, both legal and illegal, has become a major problem in the multimedia and Internet era. In this article, we propose a novel method for detecting various video copies in a video sequence. To achieve fast and robust detection, the method fully integrates several components, namely the min-hashing signature to compactly represent a video sequence, a spatio-temporal matching scheme to accurately evaluate video similarity compiled from the spatial and temporal aspects, and some speedup techniques to expedite both min-hashing indexing and spatio-temporal matching. The results of experiments demonstrate that, compared to several baseline methods with different feature descriptors and matching schemes, the proposed method which combines both global and local feature descriptors yields the best performance when encountering a variety of video transformations. The method is very fast, requiring approximately 0.06 seconds to search for copies of a thirty-second video clip in a six-hour video sequence.

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

algorithms
design
experimentation
content-based copy detection
near-duplicate
histogram pruning


Implication of network size and structure on organizations knowledge transfer Past studies have suggested an interaction between knowledge transfer, structural characteristics and behavioral patterns of network organizations. However, most research has explored the process of knowledge transfer from the micro-level perspective, and less attention has been paid to the macro-level dynamic behavior patterns of network-based organization and the micromacro links in the process of knowledge transfer. In this paper, a virtual experiment (VE) is utilized to explore the interdependence of knowledge transfer and dynamic behavior patterns of network-based organizations on the basis of rules systems. Our model shows that the speed of knowledge transfer and power influence of individuals play dominant roles in the process of knowledge transfer. The larger the network organization and the greater number of the neighbor nodes an organization have, the higher the proportion of nodes that will change their knowledge state.

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

network organization
network size
knowledge transfer
virtual experiment


Electromigration characteristics in dual-damascene copper interconnects by difference of via structures In order to improve the interconnect performance, copper has been used as the interconnect material instead of aluminum. One of the advantages of using copper interconnects instead of aluminum is better electromigration (EM) performance and lower resistance for ultralarge-scale integrated (ULSI) circuits. Dual-damascene processes use different approaches at the via bottom for lowering the via resistance. In this study, the effect of a Ta/TaN diffusion barrier on the reliability and on the electrical performance of copper dual-damascene interconnects was investigated. A higher EM performance in copper dual-damascene structures was obtained in barrier contact via (BCV) interconnect structures with a Ta/TaN barrier layer, while a lower EM performance was observed in direct contact via (DCV) interconnect structures with a bottomless process, although DCV structures had lower via resistance compared to BCV structures. The EM failures in BCV interconnect structures were formed at the via, while those in DCV interconnect structures were formed in the copper line. The existence of a barrier layer at the via bottom was related to the difference of EM failure modes. It was confirmed that the difference in EM characteristics was explained to be due to the fact that the barrier layer at the via bottom enhanced the back stress in the copper line.

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

electromigration (em)
barrier contact via (bcv)
direct contact via (dcv)
dual-damascene


The role of Internet-specific epistemic beliefs in laypersons source evaluations and decisions during Web search on a medical issue This study investigated the predictive value of epistemic beliefs about knowledge and knowing on the Web for source evaluations and post-search decisions when university students (n=79) searched the Web to make an informed decision about a conflicting and unfamiliar medical issue. Epistemic beliefs were assessed with the Internet-Specific Epistemological Questionnaire (ISEQ) and processing of source information was measured through eye tracking, log files, and verbal protocols. Furthermore, Web users post-search decisions and their basis for those decisions were assessed. Results from multiple regression analyses indicated that beliefs in the Web as a reliable resource of accurate knowledge and detailed facts were related to decreased verbal reflection on the credibility and type of sources and decreased attention to the URLs of the search results, as well as a greater certainty in the post-search decision. In addition, doubts about the need to check knowledge claims on the Web against other sources, reason, and prior knowledge were related to a more one-sided representation of the conflicting issue. In conclusion, the findings suggested that Internet-specific certainty, source, and structure beliefs primarily play a role in source evaluation, while Internet-specific beliefs about the justification for knowing primarily play a role in constructing a complete representation of document contents.

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

epistemic beliefs
web search
source evaluation
eye tracking


Similarity relation matrix-based color edge detection A novel edge detection algorithm for color images was described in this paper. In the proposed method, smoothness of each pixel in color image is firstly calculated by means of similarity relation matrix and is normalized to maximum gray level. In other words, color image in three-dimensional color spaces is mapped into one dimension. Accordingly the edges are performed in such a way that pixels lower than thresholds are assigned to be edge. Thus with proposed method, edge pixels in a color image are detected simultaneously without any complex calculations such as gradient, Laplace and statistical calculations.

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

edge detection
similarity relation matrix


A storm of feasibility pumps for nonconvex MINLP One of the foremost difficulties in solving Mixed-Integer Nonlinear Programs, either with exact or heuristic methods, is to find a feasible point. We address this issue with a new feasibility pump algorithm tailored for nonconvex Mixed-Integer Nonlinear Programs. Feasibility pumps are algorithms that iterate between solving a continuous relaxation and a mixed-integer relaxation of the original problems. Such approaches currently exist in the literature for Mixed-Integer Linear Programs and convex Mixed-Integer Nonlinear Programs: both cases exhibit the distinctive property that the continuous relaxation can be solved in polynomial time. In nonconvex Mixed-Integer Nonlinear Programming such a property does not hold, and therefore special care has to be exercised in order to allow feasibility pump algorithms to rely only on local optima of the continuous relaxation. Based on a new, high level view of feasibility pump algorithms as a special case of the well-known successive projection method, we show that many possible different variants of the approach can be developed, depending on how several different (orthogonal) implementation choices are taken. A remarkable twist of feasibility pump algorithms is that, unlike most previous successive projection methods from the literature, projection is naturally taken in two different norms in the two different subproblems. To cope with this issue while retaining the local convergence properties of standard successive projection methods we propose the introduction of appropriate norm constraints in the subproblems; these actually seem to significantly improve the practical performance of the approach. We present extensive computational results on the MINLPLib, showing the effectiveness and efficiency of our algorithm.

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

90c59 approximation methods and heuristics


UAV photogrammetry for topographic monitoring of coastal areas Coastal areas suffer degradation due to the action of the sea and other natural and human-induced causes. Topographical changes in beaches and sand dunes need to be assessed, both after severe events and on a regular basis, to build models that can predict the evolution of these natural environments. This is an important application for airborne LIDAR, and conventional photogrammetry is also being used for regular monitoring programs of sensitive coastal areas. This paper analyses the use of unmanned aerial vehicles (UAV) to map and monitor sand dunes and beaches. A very light plane (SwingletCam) equipped with a very cheap, non-metric camera was used to acquire images with ground resolutions better than 5cm. The Agisoft Photoscan software was used to orientate the images, extract point clouds, build a digital surface model and produce orthoimage mosaics. The processing, which includes automatic aerial triangulation with camera calibration and subsequent model generation, was mostly automated. To achieve the best positional accuracy for the whole process, signalised ground control points were surveyed with a differential GPS receiver. Two very sensitive test areas on the Portuguese northwest coast were analysed. Detailed DSMs were obtained with 10cm grid spacing and vertical accuracy (RMS) ranging from 3.5 to 5.0cm, which is very similar to the image ground resolution (3.24.5cm). Where possible to assess, the planimetric accuracy of the orthoimage mosaics was found to be subpixel. Within the regular coastal monitoring programme being carried out in the region, UAVs can replace many of the conventional flights, with considerable gains in the cost of the data acquisition and without any loss in the quality of topographic and aerial imagery data.

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

coast monitoring photogrammetry accuracy


Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem We consider the problem of scheduling a number of jobs on a number of unrelated parallel machines in order to minimize the makespan. We develop three heuristic approaches, i.e., a genetic algorithm, a tabu search algorithm and a hybridization of these heuristics with a truncated branch-and-bound procedure. This hybridization is made in order to accelerate the search process to near-optimal solutions. The branch-and-bound procedure will check whether the solutions obtained by the meta-heuristics can be scheduled within a tight upper bound. We compare the performances of these heuristics on a standard dataset available in the literature. Moreover, the influence of the different heuristic parameters is examined as well. The computational experiments reveal that the hybrid heuristics are able to compete with the best known results from the literature.

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


Quasi-cyclic codes over F13 F 13 and enumeration of defining polynomials Let dq(n,k) d q ( n , k ) be the maximum possible minimum Hamming distance of a linear [n,k n , k ] code over Fq F q . Tables of best known linear codes exist for small fields. In this paper, linear codes over F13 F 13 are constructed for k up to 6. The codes constructed are from the class of quasi-cyclic codes. The number of mm m m circulant matrices over Fq F q is enumerated. In addition, the minimum distance of the extended quadratic residue code of length 44 is determined.

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

necklaces
linear block codes
finite fields


Simplification and independence of axioms of fuzzy logic systems IMTL and NM Monoidal t-norm-based logic MTL is the common formalization of all fuzzy logic of left continuous t-norms and their residua. This system has two important schematic extensions: involutive monoidal t-norm-based logic IMTL and nilpotent minimum logic NM. In this paper, we discuss simplification and independence of axioms of IMTL and NM, the shorter axioms of both logics, and an independent axioms of the system IMTL are given. (c) 2005 Elsevier B.V. All rights reserved.

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

fuzzy logic
nilpotent minimum logic
simplification
independence


bibtex document generating using semantic web technologies BibTeX is a file format that can be used for describing references. BibTeX elements can be represented in several languages such as XML, RDF, or OWL. Although, such representation provides more accessibility to BibTeX elements, it does not preserve the template of the original BibTeX element. In this paper, we propose to use (X)HTML-based templates for representing BibTeX elements. Such representation not only preserves the template of the original BibTeX elements but it also allows the BibTeX elements to be annotated directly in web pages using RDFa annotations. We conjuncture that this approach increases the accessibility and reconstruction of BibTeX elements by allowing to use semantic search based on the annotations on the BibTeX elements and the automatic construction of queries from the BibTeX elements.

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


LCD Motion Blur: Modeling, Analysis, and Algorithm Liquid crystal display (LCD) devices are well known for their slow responses due to the physical limitations of liquid crystals. Therefore, fast moving objects in a scene are often perceived as blurred. This effect is known as the LCD motion blur. In order to reduce LCD motion blur, an accurate LCD model and an efficient deblurring algorithm are needed. However, existing LCD motion blur models are insufficient to reflect the limitation of human-eye-tracking system. Also, the spatiotemporal equivalence in LCD motion blur models has not been proven directly in the discrete 2-D spatial domain, although it is widely used. There are three main contributions of this paper: modeling, analysis, and algorithm. First, a comprehensive LCD motion blur model is presented, in which human-eye-tracking limits are taken into consideration. Second, a complete analysis of spatiotemporal equivalence is provided and verified using real video sequences. Third, an LCD motion blur reduction algorithm is proposed. The proposed algorithm solves an l(1)-norm regularized least-squares minimization problem using a subgradient projection method. Numerical results show that the proposed algorithm gives higher peak SNR, lower temporal error, and lower spatial error than motion-compensated inverse filtering and Lucy-Richardson deconvolution algorithm, which are two state-of-the-art LCD deblurring algorithms.

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

human visual system
liquid crystal displays (lcds)
spatial consistency
temporal consistency


Mapping Highly Detailed Colour Information on Extremely Dense 3D Models: The Case of David's Restoration The support of advanced information technology (IT) to preservation, restoration and documentation of Cultural Heritage (CH) is becoming a very important goal for the research community. Michelangelo's David was one of the first applications of 3D scanning technology on a highly popular work of art. The subsequent restoration campaign, started in 2002 and concluded in 2004, was also a milestone for the adoption of modern scientific analysis procedures and IT tools in the framework of a restoration process. One of the focuses in this restoration was also methodological, i.e. to plan and adopt innovative ways to document the restoration process. In this paper, we present the results of an integration of different restoration data (2D and 3D datasets) which has been concluded recently. The recent evolution of HW and SW graphics technologies gave us the possibility to interactively visualize an extremely dense 3D model which incorporates the colour information provided by two professional photographic campaigns, made before and after the restoration. Moreover, we present the results concerning the mapping, in this case on the 2D media, of the reliefs produced by restorers to assess and document the status of the marble surface before the restoration took place. This result could lead to new and fascinating applications of computer graphics for preservation, restoration and documentation of CH.

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

colour projection
texture mapping
image registration


Multiple color space channel fusion for skin detection Skin detection is used in applications ranging from face detection, tracking body parts and hand gesture analysis, to retrieval and blocking of objectionable content. We investigate color based skin detection. We linearly merge different color space channels representing it as a fusion process. The aim of fusing different color space channels is to achieve invariance against varying imaging and illumination conditions. The non-perfect correlation between the color spaces is exploited by learning weights based on an optimization for a particular color space channel using the mathematical financial model of Markowitz. The weight learning process develops a color weighted model using positive training data only. Experiments on a database of 8991 images with annotated pixel-level ground truth show that the fusion of color space channels approach is well suited to stable and robust skin detection. In terms of precision and recall, the fusion approach provides a competitive performance to other state-of-the-art approaches which require negative and positive training data with the exception of the decision tree based classifier (J48). As a real-time application, we show that the weight based color channel fusion approach can be used for learning of weights for skin detection based on detected faces in image sequences.

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


Associating visual textures with human perceptions using genetic algorithms This paper deals with an approach allowing to associate visual textures with given human perceptions. Hereby, based on a forward model associating human perceptions for given visual textures, the deduction of an reverse process is presented which is able to associate and characterize visual textures for given human perceptions. For doing so, we propose a constraint-based genetic algorithm approach, which is able to minimize a specific optimization problem containing constraints in form of band-widths for valid individuals (low level features extracted from textures) in a population. The constraints are determined by relationships between (low level) features characterizing textures in form of high-dimensional approximation models. Additionally, in each iteration step checking for valid individuals is carried out with a texture/non-texture classifier or by using a convex hull over a set of valid textures. The whole approach is evaluated based on a real-world texture set used as a start population in the genetic algorithm and by defining various kinds of human perceptions (for which textures are sought) represented by adjective vectors in the aesthetic space. The generated individuals (low level feature vectors) have a high level of fitness (they are quite close to the pre-defined adjective vectors) and a small distance to the initial population. The textures synthesized based on the generated individuals are visualized and compared with textures synthesized by a time-intensive direct texture mixing and re-combination method based on a real-world texture data base.

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

human perception
constraint-based genetic algorithms
high-dimensional approximation models
texture synthesis


PKLot A robust dataset for parking lot classification We present a robust image dataset for parking space classification. We evaluate textural-based descriptors for parking space detection. Classifiers are evaluated on different parking lots. Classifiers are evaluated on parking lots that were used for training.

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

parking space detection
parking space classification

textural-based descriptors
parking space dataset


picojava-ii in an fpga picoJava is a Java microprocessor developed by Sun to speedup execution of Java in embedded systems and an often-cited reference design for other Java processors. Information about implementations of picoJava is rare however. In contrast to a number of new Java processors which are targeted at FPGAs, picoJava was designed for ASICs, and no implementation in an FPGA is known up to date. In this paper we show the implementation and evaluation of Sun's picoJava-II microprocessor in an FPGA.

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


Throughput Optimization for Area-Constrained Links With Crosstalk Avoidance Methods The effect of crosstalk avoidance codes on the throughput of fixed width communication channels is studied. Closed form expressions of the throughput which incorporate the dimensions of the interconnects and the wiring overheads incurred by such techniques are derived for lines under different buffering conditions. These formulae are utilized to optimize the bandwidth of constrained-area parallel buses under different latency and power constraints. Our results are confirmed by the simulations we have performed in Spectre for a UMC CMOS 90-nm technology.

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


HIV/AIDS-related stigma and information behaviour: an ethnographic study in the UK This feature explores the information behaviour of people infected with or affected by HIV/AIDS. It investigates specifically the difficult issue of stigma and how this shapes the ways in which people interact with vital information. The study adopted an ethnographic whereby the researcher worked as a part-time volunteer at an HIV support centre in the North of England for over a year. This is the first time that such an approach has been reported in this feature and is interesting from this perspective alone. The very rich data which was gathered as a result of the approach is also instructive. The study formed part of a PhD thesis, which Robinah Kalemeera Namuleme completed at the University of Sheffield in March 2013.

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

covert information seeking
ethnography
information seeking behaviour
interviews
qualitative research


Conformational properties of chiral tobacco alkaloids by DFT calculations and vibrational circular dichroism: (?)-S-anabasine Steric/electrostatic factors determine the overall conformational distribution. Hyperconjugation controls the equilibrium between the two main rotamers. Increasing solvents polarity barely affects the conformational energy profile. Boltzmann weighted (2:1) DFT spectra match IR and VCD experimental profiles.

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

(?)-s-anabasine
conformational profile
nbo


Locally affine patch mapping and global refinement for image super-resolution This paper deals with the super-resolution (SR) problem based on a single low-resolution (LR) image. Inspired by the local tangent space alignment algorithm in [16] for nonlinear dimensionality reduction of manifolds, we propose a novel patch-learning method using locally affine patch mapping (LAPM) to solve the SR problem. This approach maps the patch manifold of low-resolution image to the patch manifold of the corresponding high-resolution (HR) image. This patch mapping is learned by a training set of pairs of LR/HR images, utilizing the affine equivalence between the local low-dimensional coordinates of the two manifolds. The latent HR image of the input (an LR image) is estimated by the HR patches which are generated by the proposed patch mapping on the LR patches of the input. We also give a simple analysis of the reconstruction errors of the algorithm LAPM. Furthermore we propose a global refinement technique to improve the estimated HR image. Numerical results are given to show the efficiency of our proposed methods by comparing these methods with other existing algorithms.

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

image super-resolution
manifold learning
tangent coordinate
principal component analysis


Image Segmentation by Probabilistic Bottom-Up Aggregation and Cue Integration We present a bottom-up aggregation approach to image segmentation. Beginning with an image, we execute a sequence of steps in which pixels are gradually merged to produce larger and larger regions. In each step, we consider pairs of adjacent regions and provide a probability measure to assess whether or not they should be included in the same segment. Our probabilistic formulation takes into account intensity and texture distributions in a local area around each region. It further incorporates priors based on the geometry of the regions. Finally, posteriors based on intensity and texture cues are combined using "a mixture of experts" formulation. This probabilistic approach is integrated into a graph coarsening scheme, providing a complete hierarchical segmentation of the image. The algorithm complexity is linear in the number of the image pixels and it requires almost no user-tuned parameters. In addition, we provide a novel evaluation scheme for image segmentation algorithms, attempting to avoid human semantic considerations that are out of scope for segmentation algorithms. Using this novel evaluation scheme, we test our method and provide a comparison to several existing segmentation algorithms.

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


Dynamic map labeling We address the problem of filtering, selecting and placing labels on a dynamic map, which is characterized by continuous zooming and panning capabilities. This consists of two interrelated issues. The first is to avoid label popping and other artifacts that cause confusion and interrupt navigation, and the second is to label at interactive speed. In most formulations the static map labeling problem is NP-hard, and a fast approximation might have O(n log n) complexity. Even this is too slow during interaction, when the number of labels shown can be several orders of magnitude less than the number in the map. In this paper we introduce a set of desiderata for "consistent" dynamic map labeling, which has qualities desirable for navigation. We develop a new framework for dynamic labeling that achieves the desiderata and allows for fast interactive display by moving all of the selection and placement decisions into the preprocessing phase. This framework is general enough to accommodate a variety of selection and placement algorithms. It does not appear possible to achieve our desiderata using previous frameworks. Prior to this paper, there were no formal models of dynamic maps or of dynamic labels; our paper introduces both. We formulate a general optimization problem for dynamic map labeling and give a solution to a simple version of the problem. The simple version is based on label priorities and a versatile and intuitive class of dynamic label placements we call "invariant point placements". Despite these restrictions, our approach gives a useful and practical solution. Our implementation is incorporated into the G-Vis system which is a full-detail dynamic map of the continental USA. This demo is available through any browser.

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

human-computer interface
label placement
label selection
label filtering
label consistency
computational cartography
gis
hcl
realtime


A new way to generate a ring: Universal ring signature A ring signature enables an individual of a group to sign a message on behalf of the group without revealing the identity of the real signer. It is useful in the application of leaking authoritative secrets in an anonymous way. In this paper, we define a new type of ring signature called Universal Ring Signature (US(1,n) U S ( 1 , n ) ). In our scheme, a ring is not generated by a signer but by a signature holder. A signer just sign a message by a standard digital signature and when necessary, a signature holder can modify the standard digital signature into a ring signature by spontaneously conscript arbitrarily n?1 n ? 1 entities and/or n?1 n ? 1 messages at most. In addition, the signature holder generating the US(1,n) U S ( 1 , n ) is not required to have any public/private key-pair. With this modification to the original ring signature, we allow any signature holder (ie., user of the signature) to protect personal privacy including signer anonymity and message ambiguity from the perspective of himself (instead of a signer). This kind of new protocol is useful when a signature is actually a certificate signed by a certificate issuer. We will show how to use this scheme to protect the identity of a certificate issuer and protect some sensitive information on a certificate. We will also show the relationship of our scheme with the standard ring signature and the relationship of our scheme with the universal designated verifier signature. Our scheme can actually be regarded as a generic construction of these two schemes. The security concerning to the unforgeability and privacy are also defined and proved in the random oracle model.

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

ring signature
universal designated verifier signature

applied cryptography
message/signer ambiguous
privacy protection


H? H ? consensus performance for discrete-time multi-agent systems with communication delay and multiple disturbances This paper proposes a new H? H ? consensus criterion for discrete-time multi-agent systems with communication-delay and disturbances. By constructing a suitable LyapunovKrasovskii (LK) functional, which fractionizes the delay interval into two subsections, and utilizing reciprocally convex approach, a new H? H ? consensus criterion for the concerned systems is established in terms of linear matrix inequalities (LMIs) which can be easily solved by various effective optimization algorithms. One numerical example is given to illustrate the effectiveness of the proposed method.

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

h? h ? consensus h? h ? h? h ? h ?
discrete-time multi-agent systems
time-delay
lyapunov method


Severity and impact of computer user frustration: A comparison of student and workplace users User frustration with information and computing technology is a pervasive and persistent problem. When computers crash, network congestion causes delays, and poor user interfaces trigger confusion there are dramatic consequences for individuals, organizations, and society. These frustrations, not only cause personal dissatisfaction and loss of self-efficacy, but may disrupt workplaces, slow learning, and reduce participation in local and national communities. Our exploratory study of 107 student computer users and 50 workplace computer users shows high levels of frustration and loss of 1/3-1/2 of time spent. This paper reports on the incident and individual factors that cause of frustration, and how they raise frustration severity. It examines the frustration impacts on the daily interactions of the users. The time lost and time to fix problem, and importance of task, strongly correlate with frustration levels for both student and workplace users. Differences between students and workplace users are discussed in the paper, as are implications for researchers. (c) 2005 Elsevier B.V. All rights reserved.

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

user interface design
training
helpdesk
computer experience
computer anxiety


experience with an experimental compiler generator based on denotational semantics Compiler generation based on formal semantics has received considerable attention in recent years from a number of semanticists. Compiler writers, on the other hand, know relatively little about these efforts. This paper tries to remedy this situation by discussing our experimentation with the Semantics Implementation System (SIS) of Peter Mosses. SIS allows the user to generate a complete compiler from a formal specification of the syntax and semantics of a programming language. In particular, the translator component of a compiler is obtained by directly implementing a denotational semantics. Consequently, a compiler is expressed as a higher order function. A program is compiled by formally applying the compiler to a tree representation of the program and simplifying this application. The experimentation with SIS indicates that compiler generation based on denotational semantics is feasible, though not yet viable. We argue that SIS constitutes an important first step toward the automatic construction of provably correct, complete, and reasonably efficient compilers from formal syntactic and semantic specifications.

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

tree
attention
order
generation
experimentation
semantic
implementation
formal semantics
experience
representation
paper
user
formal specification
denotational semantics
component
programming language

situated translation applications efficiency systems formalism functional compilation completeness


MuPIF A distributed multi-physics integration tool This paper presents the design of a multi-physics integration tool with an object-oriented architecture that facilitates the implementation of multi-physics and multi-level simulations assembled from independently developed applications (components). The tool provides high-level support for mutual data exchange between codes, including support for different discretization techniques and specific field transfer operators, being aware of the underlying physical phenomena. Parallel and distributed applications and aspects of the applications are also addressed. Each application is required to implement application and data interfaces, which allow abstract access to solution domains and fields, and provide services for steering individual applications. The Python scripting language is extended by modules representing interfaces to existing codes. The high-level language serves as a glue to tie the modules or components together and to create a specialized application. The capabilities of the tool are demonstrated on two examples that illustrate staggered thermo-mechanical analysis and distributed field mapping.

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

multi-physics simulations
software integration
system integration
distributed computing
interactive computing
object-oriented design


Towards a solid solution of real-time fire and flame detection Although the object detection and recognition has received growing attention for decades, a robust fire and flame detection method is rarely explored. This paper presents an empirical study, towards a general and solid approach for fast detection of fire and flame in videos, with the applications in video surveillance and event retrieval. Our system consists of three cascaded steps: (1) candidate regions proposing by a background model, (2) fire region classifying with color-texture features and a dictionary of visual words, and (3) temporal verifying. The experimental evaluation and analysis are done for each step. We believe that it is a useful service to both academic research and real-world application. In addition, we release the software of the proposed system with the source code, as well as a public benchmark and data set, including 64 video clips covered both indoor and outdoor scenes under different conditions. We achieve an 82 % Recall with 93 % Precision on the data set, and greatly improve the performance by state-of-the-arts methods.

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


Clinical effect of computer generated physician reminders in health screening in primary health carea controlled clinical trial of preventive services among the elderly Objectives: To apply and evaluate the effects of a program for computer generated physician reminders, integrated with an electronic patient record (EPR) system, for opportunistic health screening in elderly patients. Design: A pilot study designed as a 20-month clinical trial with a control group and a 20-month non-intervention follow-up using a computer reminder program that selects patients for screening in five intervention areas (diabetes, hypertension, cobalamin deficiency, hypothyroidism and anaemia). Setting: Four primary health care (PHC) centres in suburban Stockholm. Subjects: The intervention was designed for patients 70 years or older from one health care centre who visited a general practitioner (GP) during the first 20-month period. Patients from the three remaining centres served as controls. Main outcome measures: The number of patients who underwent the tests, who had pathological test results, new diagnoses and new pharmacological treatments in both patient groups. Results: In total, 602 patients underwent screening and 1989 were controls. There was a statistically significant, moderate or marked increase (1375%) in the number of patients who were tested in all five intervention areas. An increase in pathological test results (18%) was found in two areas: hypertension and cobalamin deficiency. There was an increase in the number of patients with the diagnosis of cobalamin deficiency during the study. At follow-up a decrease in new diagnoses for anaemia was found. Conclusion: The system seems to be associated with a moderate to large increase in laboratory and manual screening tests for both established and new screening areas. The effect on clinical outcomes was found mainly in a not-yet-established screening area (cobalamin deficiency), indicating that the system may be clinically useful when introducing new screening services.

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

primary health care
opportunistic health screening
elderly

computer generated reminders
electronic patient records


An ant-swarm inspired dynamic multiresolution data dissemination protocol for wireless sensor networks One of the main concerns of wireless sensor networks (WSNs) is to deliver useful information from data sources to users at a minimum power consumption due to constraints that sensor nodes must operate on limited power sources for extended time. In particular, achieving power-efficiency and multihop communication in WSN applications is a major issue. This paper continues on the investigation of a recently proposed Minimum-power Multiresolution Data Dissemination (MMDD) problem for WSNs (whose solution is considered here as a benchmark). We propose an ant-inspired solution to this problem. To the best of our knowledge, no attempts have been made so far in this direction. We have evaluated the performance of our proposed solution by conducting a variety of experiments and have found our solution to be promising in terms of total energy consumption in data dissemination.

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

data dissemination
wireless sensor networks

dynamic tree adaptation
energy efficiency
ant-swarm-based algorithms
dissemination tree construction
simulation


Atrial cell action potential parameter fitting using genetic algorithms Understanding of the considerable variation in action potential (AP) shape throughout the heart is necessary to explain normal and pathological cardiac function. Existing mathematical models reproduce typical APs, but not all measured APs, as fitting the sets of non-linear equations is a tedious process. The study describes the integration of a pre-existing mathematical model of an atrial cell AP with a genetic algorithm to provide an automated tool to generate APs for arbitrary cells by fitting ionic channel conductances. Using the Nygren model as the base, the technique was first verified by starting with random values and fitting the Nygren model to itself with an error of only 0.03%. The Courtemanche model, which has a different morphology from that of the Nygren model, was successfully fitted. The AP duration restitution curve generated by the fit matched that of the target model very well. Finally, experimentally recorded APs were reproduced. To match AP duration restitution behaviour properly, it was necessary simultaneously to fit over several stimulation frequencies. Also, fitting of the upstroke was better if the stimulating current pulse replicated that found in situ as opposed to a rectangular pulse. In conclusion, the modelled parameters were successfully able to reproduce any given atrial AP. This tool can be useful for determining parameters in new AP models, reproducing specific APs, as well as determining the locus of drug action by examining changes in conductance values.

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


pH control structure design for a periodically operated membrane separation process A bioreactor integrated with an electrically driven membrane separation process (Reverse Electro-Enhanced Dialysis - REED) is under investigation as potential technology for intensifying lactic acid bioproduction. In this contribution the pH regulation issue in the periodically operated REED module is studied. A methodology for control structure design is proposed to handle the dynamic system. A sensitivity analysis is used for the conceptual design of the control structure. Dynamic simulations are employed to evaluate the sensitivity index. From the analysis a periodic input-resetting control structure is selected. The system controls pH using the imposed current density and resets the current density manipulating the hydroxide inlet concentration to the dialysate channel. The control structure is satisfactorily achieving a desired pH at the outlet of the feed channel in REED from period to period and resetting the current density. Thus suitable performance is achieved within a large part of the operating window. (C) 2012 Elsevier Ltd. All rights reserved.

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

lactate recovery from fermentation broth


A split-step numerical method for the time-dependent Dirac equation in 3-D axisymmetric geometry A numerical method is developed to solve the time-dependent Dirac equation in cylindrical coordinates for 3-D axisymmetric systems. The time evolution is treated by a splitting scheme in coordinate space using alternate direction iteration, while the wave function is discretized spatially on a uniform grid. The longitudinal coordinate evolution is performed exactly by the method of characteristics while the radial coordinates evolution uses Poisson's integral solution, which allows to implement the radial symmetry of the wave function. The latter is evaluated on a time staggered mesh by using Hermite polynomial interpolation and by performing the integration analytically. The cylindrical coordinate singularity problem at r=0 r = 0 is circumvented by this method as the integral is well-defined at the origin. The resulting scheme is reminiscent of non-standard finite differences. In the last step of the splitting, the remaining equation has a solution in terms of a time-ordered exponential, which is approximated to a higher order than the time evolution scheme. We study the time evolution of Gaussian wave packets, and we evaluate the eigenstates of hydrogen-like systems by using a spectral method. We compare the numerical results to analytical solutions to validate the method. In addition, we present three-dimensional simulations of relativistic lasermatter interactions, using the Dirac equation.

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

dirac equation
cylindrical coordinates
alternate direction iteration


Data harvesting with mobile elements in wireless sensor networks In recent studies, using mobile elements (MEs) as mechanical carriers to relay data has been shown to be an effective way of prolonging sensor network life time and relaying information in partitioned networks. As the data generation rates of sensors may vary, some sensors need to be visited more frequently than others. In this paper, a partitioning-based algorithm is presented that schedules the movements of MEs in a sensor network such that there is no data loss due to buffer overflow. Simulation results show that the proposed Partitioning-Based Scheduling (PBS) algorithm performs well in terms of reducing the minimum required ME speed to prevent data loss, providing high predictability in inter-visit durations, and minimizing the data loss rate for the cases when the ME is constrained to move slower than the minimum required ME speed. (c) 2006 Elsevier B.V. All rights reserved.

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

sensor-actor
mobility
path planning
data collection


Implementing the 4-dimensional GLV method on GLS elliptic curves with j-invariant 0 The Gallant-Lambert-Vanstone (GLV) method is a very efficient technique for accelerating point multiplication on elliptic curves with efficiently computable endomorphisms. Galbraith et al. (J Cryptol 24(3): 446-469, 2011) showed that point multiplication exploiting the 2-dimensional GLV method on a large class of curves over F-p2 was faster than the standard method on general elliptic curves over F-p, and left as an open problem to study the case of 4-dimensional GLV on special curves (e.g., j (E) = 0) over F-p2. We study the above problem in this paper. We show how to get the 4-dimensional GLV decomposition with proper decomposed coefficients, and thus reduce the number of doublings for point multiplication on these curves to only a quarter. The resulting implementation shows that the 4-dimensional GLV method on a GLS curve runs in about 0.78 the time of the 2-dimensional GLV method on the same curve and in between 0.78 - 0.87 the time of the 2-dimensional GLV method using the standard method over F-p. In particular, our implementation reduces by up to 27% the time of the previously fastest implementation of point multiplication on x86-64 processors due to Longa and Gebotys (CHES2010).

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

elliptic curves
point multiplication
glv method


Input feature selection by mutual information based on Parzen window Mutual information is a good indicator of relevance between variables, and have been used as a measure in several feature selection algorithms: However, calculating the mutual information is difficult, and the performance of a feature selection algorithm depends on the accuracy of the mutual information. In this paper, we propose a new method of calculating mutual information between input and class variables based on the Parzen window, and we apply this to a feature selection algorithm for classification problems.

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

feature selection
mutual information
parzen window