Loss resilient H.263+video over the Internet The Internet was designed mainly for non-real-time data, and the existing error recovery mechanisms cannot be used for time critical applications because of their latency. Therefore, any real-time interactive application will need to be robust to packet losses caused mainly by congestion at routers, and this is especially true for video transmissions. In this paper, the problem of robust H.263+ video over the Internet is addressed. The effect of packet loss on H.263 (version 2) video transmitted over the Internet using the real-time transport protocol (RTP) is assessed and different packetisation strategies are also compared. The main problem is the temporal propagation of errors resulting from packet losses because of the motion compensation process. Two ways of minimising this propagation are proposed: the selective use of FEC on the motion information and the use of periodic reference frames, protected with FEC as well. The main advantage of these two techniques is that they do not introduce more than one frame delay, and they do not rely on retransmissions. When combined together, these are shown to perform better than using periodic intraframes at minimising error propagation. Our robust H.263+ encoder has been integrated into vic, a videoconferencing tool widely used over the multicast backbone (MBone) of the Internet.

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


Mesh movement via Legendre transforms A new mesh movement algorithm is presented based on a Legendre transform arising from optimal transportation theory. This naturally allows the mesh connectivity to change, so that adjacent cells can move apart to avoid regions of distorted or poor quality mesh. It is applied here to the Enter equations with conservation on such a mesh achieved by the construction of space-time cells. The method is demonstrated on problems with large deformations and where the regions of concentrated mesh change their topology, e.g. merging and separating. (C) British Crown Copyright 2007/MOD. Reproduced with permission. Published by John Wiley & Sons, Ltd.

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


Maximising low voltage grid hosting capacity for PV and electric mobility by distributed voltage control European low voltage grids host an increasing amount of energy from rooftop PV installations. Experience in Germany has shown that PV installations do not grow uniformly but with regional hot spots. Meanwhile it is widely agreed that low voltage grids should only be updated to accommodate some 90% or less of available PV power in peak times in order to avoid extensive costs for grid reinforcement. The main limiting factor in rural distribution grids is the grid voltage. In the Austrian research project DG DemoNetSmart LV Grid new approaches to deal with restricted grid capacities are analysed using active voltage control. In three pilot regions, the actual amount of installed PV is increased to reach physical limits. Voltage control schemes are developed, tested in simulations and then validated in the field. In one pilot region, electric mobility as additional future load in low voltage grids and its integration into the overall system is considered. This paper analyses the performance of the developed control approaches in simulation.

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

smart grids
distributed control
intelligente stromnetze
spannungsregelung
niederspannungsnetze
verteilte regelung


Dynamic guard margin CAC algorithm with ensured QoS and low CDP in heterogeneous wireless networks This paper proposes a dynamic guard margin algorithm for connection admission control in heterogeneous wireless networks, where UMTS and WLAN systems co-exist in different tiers. The algorithm works based on the idea that a network controller should down-grade the similar or lower Quality of Service (QoS) classes of traffic during the QoS negotiation phase in handovers, instead of rejecting handover connection requests of higher QoS class of traffic. The efficiency of the proposed algorithm is evaluated and compared with the other proposed algorithms using computer simulations. The obtained results demonstrated that the proposed algorithm performs much better than the existing algorithms in terms of resource saving, number of accepted connections, number of rejected connections during handovers, and total resource utilization. (C) 2010 Elsevier B.V. All rights reserved.

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

heterogeneous network
multimedia
resource allocation


Forcemoment line element method for Stokes flow around a slender body We present a higher-order line element method for Stokes flow around a slender body by taking into account effects of both net force and couple moment densities along its center line. The numerical technique is based on a line integral equation, which in turn is derived by reducing from a boundary integral equation of Stokes flow. The line integral equation of velocity gradient is employed along with that of velocity to close the formulation. Numerical examples of rigid slender bodies are presented to demonstrate the capability and validity of the present method, including passive motion of a slender body suspended in a simple shear flow and active motion of a slender body driven by a body moment. In the first case, it is shown that the moment density due to shear rigidity mismatch between the fluid and solid can be finite. Meanwhile, the transverse net force density is rather induced by a small velocity lag due to the impeding moment density component. Effects of slip and no-slip interfacial conditions are examined, showing their important role in determining the slender-body hydrodynamics. The present forcemoment line element method provides a capable tool for solving the problems of strong and weak interactions between a slender body and a viscous fluid at low Reynolds number.

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

line element method
simple shear flow
slender body
stokes flow

boundary element method
fluidstructure interaction
integral equation technique


ProActNet: Modeling processes through activity networks This paper proposes a process-centered software engineering environment (PSEE) called ProActNet (modeling processes through activity networks), which provides a process modeling language also called ProActNet. ProActNet pays special attention to handling human factors, including: 1) facilitating process program development, 2) allowing incremental process program development, 3) modeling abnormal conditions such as worker, feedback,, abnormally quitting activities, and abnormally canceling activities, and 4) modeling incremental product development. In addition to handling human factors, ProActNet also supports process change (evolution), which is essential in a PSEE. Moreover, ProActNet models processes as unordered, concurrent activities. With this, activity sequence, concurrency, and synchronization need not be specified in a process program, which simplifies process program development.

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

process-centered software engineering environment (psee)


Design and verification of a frequency domain equalizer In this work we provide a methodology for the design and verification of a frequency domain equalizer. The performance analysis of the equalizer is conducted using two methods: simulation based verification in Simulink and System Generator and theorem proving techniques in Higher Order Logic. We conduct both floating-point and fixed-point error estimations for the design in Simulink and System Generator, respectively. Then, we use formal error analysis based on the theorem proving to verify an implementation of the frequency domain equalizer based on the Fast LMS algorithm. The formal error analysis and simulation based error estimation of the algorithm intend to show that, when converting from one number domain to another, the algorithm produces the same values with an accepted error margin caused by the round-off error accumulation. This work shows the efficiency of combining simulation and formal verification based methods in verifying complex systems such as the frequency domain equalizer.

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

error analysis
theorem proving
design and verification


Data warehousing supports corporate strategy at First American Corporation From 1990 through 1998, First American Corporation (FA C) changed its corporate strategy from a traditional banking approach to a customer relationship-oriented strategy that placed FAC's customers at the center of all aspects of the company's operations. The transformation made FAC an innovative leader in the financial services industry. This case study describes FAC's transformation and the way in which a data warehouse called VISION helped make it happen. FAC's experiences suggest lessons for managers who plan to use technology to support changes that are designed to significantly improve organizational performance. In addition, they raise interesting questions about the means by which information technology can be used to gain competitive advantage.

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

organizational transformation
customer relationship management
is management


Service Provision Control in Federated Service Providing Systems Different from traditional P2P systems, individuals nodes of a Federated Service Providing (FSP) system play a more active role by offering a variety of domain-specific services. The service provision control (SPC) problem is an important problem of the FSP system and will be tackled in this paper within a stochastic optimization framework through several steps. The first step focuses on using stochastic differential equations (SDEs) to model and analyze the dynamic evolution of the service demand. Driven by the SDE model, expected future performance of a FSP system is analytically evaluated in the second step. Step three utilizes the differential evolution (DE) algorithm to identify near-optimal service-providing policies for each node. The service subscription protocol is further proposed in step four to help every node adjust its local policy in accordance with the services provided by other nodes. The four steps together implement a complete solution of the SPC problem and will be called the SDE-based service-provision control (SSPC) mechanism in this paper. Experimental evaluation of the mechanism has been reported in the paper. The results show that our approach is effective in tackling the SPC problem and may be therefore suitable for many practical applications.

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

p2p system
service management
stochastic differential equation


V-SAT: A visual specification and analysis tool for system-on-chip exploration We describe V-SAT, a tool for performing design space exploration of system-on-chip (SOC) architectures. The key components of V-SAT include EXPRESSION, a language for specification of the architecture, SIMPRESS, a simulator generator for analysis/evaluation of the architecture, and the V-SAT GUI front-end for easy specification and detailed analysis. We give a brief overview of the components (EXPRESSION, SIMPRESS and GUI) and, using an example DLX architecture, demonstrate V-SAT's usefulness in exploration for an embedded SOC codesign flow by specifying and evaluating several modifications to the pipeline structure of the processor. We believe that V-SAT provides a powerful environment, both for early design space exploration, as well as for the detailed design of SOC architectures. (C) 2001 Elsevier Science B.V. All rights reserved.

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

system-on-chip architecture
specification language


A fault location criterion for MTDC transmission lines using transient current characteristics The characteristics of the DC filter are used for the fault locating of MTDC transmission lines. The inevitable one-end protection blind zones are deduced in the distributed parameter model. The fault line section selection is important to MTDC control strategy. We propose a fault location criterion based on complex wavelet transform. The algorithm is successfully tested and the results are compared with those from other algorithms.

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

mtdc
dc filter
fault location
protection

transmission line
complex wavelet algorithm


Global stability analysis for delayed virus infection model with general incidence rate and humoral immunity In this paper, we investigate the dynamical behavior of a virus infection model with general incidence rate and humoral immunity. By using suitable Lyapunov functional and the LaSalle's invariance principle, we establish the global stability of the three equilibria. The uninfected equilibrium E-0 is globally asymptotically stable if R-0 1, the infected equilibrium with humoral immunity E-2 is globally asymptotically stable if R-1 > 1. We check our theorems with numerical simulation in the end. (C) 2013 IMACS. Published by Elsevier B.V. All rights reserved.

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

general incidence rate
humoral immunity
global stability
lyapunov functional


General Minkowski type inequalities for Sugeno integrals Minkowski type inequalities for the Sugeno integral on abstract spaces are studied in a rather general form, thus closing the series of papers on the topic dealing with special cases restricted to the (pseudo-)additive operation. (C) 2009 Elsevier B.V. All rights reserved.

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

fuzzy measure
comonotone functions
minkowski's inequality


Characterization of aboveground biomass in an unmanaged boreal forest using Landsat temporal segmentation metrics Canada is dominated by forested ecosystems which are subject to various inventory and management practices, with more northern boreal forests subject to neither. Our objectives were to measure the capacity of temporal trajectory metrics for estimating selected forest attributes in a northern Canadian boreal forest context using Landsat imagery and investigate the importance of different types of temporal trajectory metrics. Results indicated that Wetness was the best Tasseled Cap (TC) component for aboveground biomass estimation (R2=50%, RMSE%=56%), and the combination of simple and complex metrics from all TC components produced the highest R2 (62%) and lowest RMSE% (49%). Using a similar combination of variables, other forest attributes were estimated equally reliably with lower RMSE% values. The most important temporal trajectory metrics were simple and described TC component values at each point of change in the temporal trajectory, however the most important variables overall were environmental variables.

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


Constrained shrinking dimer dynamics for saddle point search with constraints In this paper, we study the constrained shrinking dimer dynamics (CSDD) which leads to numerical procedures for locating saddle points (transition states) associated with an energy functional defined on a constrained manifold. We focus on the most generic case corresponding to a constrained stationary point where the projected Hessian of the energy onto the tangent hyperplane of the constrained manifold has only one unstable direction and demonstrate, in this case, the local stability of the CSDD. We examine various numerical implementation issues and consider some interesting applications of CSDD including the computation of periodic centroidal Voronoi tessellations, generalized Thomson problems about particle/charge distribution on the unit sphere, and the critical nuclei morphology in binary phase transformations. (C) 2012 Elsevier Inc. All rights reserved.

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

periodic centroidal voronoi tessellations

transition state
potential energy surface
constrained saddle point
generalized thomson problem


Steady-state methods of differential-algebraic equations in circuit simulation In the paper, we study the steady-state methods of large dynamic systems. For a nonlinear system of differential-algebraic equations with a known period T, we decouple it, in function space, into linear subsystems by quasilinearization. The resulting linear dynamic systems can be solved by a waveform Krylov subspace method. For the autonomous case, that is, the period T is unknown, the well-known shooting process can be applied where Newton iterations are computed with pseudo-inverse.

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

differential-algebraic equations
steady-state methods
waveform relaxation
krylov subspace methods
pseudo-inverse of matrix


Not just another focus group: making the case for the nominal group technique in criminology The Nominal Group Technique (NGT) is seldom applied in criminological research. This article explores the potential of NGT as a tool for criminological research.

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


Dynamic, location-based channel selection for power consumption reduction in EEG analysis The objective of this study is to develop methods to dynamically select EEG channels to reduce power consumption in seizure detection while maintaining detection accuracy. A method is proposed whereby a number of primary screening channels are predefined. Depending on the classification results of those channels, further channels are selected for analysis. This method provides savings in computational complexity of 43%. A further method called idling is then proposed which increases the computational saving to 75%. The performance of a location-independent, decision-based method is used for comparison. The proposed method achieves better computational savings for the same performance than the decision-based method. The decision-based method was capable of higher overall computational savings, but with a reduction in seizure detection performance. Each method was also implemented with the REACT algorithm on a Blackfin microprocessor and the average power measured. The proposed methods gave a power saving of up to 47% with no reduction in detection performance.

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


An Empirical Examination of Maturity Model as Measurement of Information Technology Governance Implementation The aim of this study is to evaluate information technology governance implementation in the Jordanian domestic banks using the maturity model. An empirical survey using self-administered questionnaire has been carried out to achieve the study objectives. The study results reveal that Jordanian domestic banks applied effective awareness and communications, responsibility, and accountability, and skills and expertise dimensions mainly, while they do not do enough with regard to the other dimensions (tools and automation, "goal setting and measurement", and "policies, plans and procedures"). The study main recommendation for domestic hanks is to give more attention to information technology governance. Professionals in Jordanian domestic banks should work more to increase the information technology; governance strength for all its dimensions.

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

information technology governance
maturity model

accounting information system
control
security


a global router for sea-of-gates circuits We describe a new global routing algorithm designed specifically for sea-of-gates circuits. The algorithm has been generalized to handle gate array and standard cell circuits. The main features of the algorithm are: (1) interconnection length minimization using a new Steiner tree generation method, (2) a two-stage coarse global routing method which seeks to even congestion, (3) a maze routing procedure which removes overflows and reduces the congestion, (4) vertical track assignment, and (5) congestion evening at the detailed global routing level. In tests on the MCNC benchmark circuits, the algorithm produced layouts with an average of 11\% fewer routing tracks than the other algorithms. In tests on gate array benchmark circuits, the algorithm not only achieved uniform channel densities, but the maximum channel densities it produced are the lowest values that have ever been reported.

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

tree
generation
method
standard cell
values
benchmark
assignment
router
routing
algorithm
congestion
global
circuits

layout
arrays
interconnect
tracking
general
feature
global routing
minimal


SaC-FRAPP: a scalable and cost-effective framework for privacy preservation over big data on cloud Big data and cloud computing are two disruptive trends nowadays, provisioning numerous opportunities to the current information technology industry and research communities while posing significant challenges on them as well. Cloud computing provides powerful and economical infrastructural resources for cloud users to handle ever increasing data sets in big data applications. However, processing or sharing privacy-sensitive data sets on cloud probably engenders severe privacy concerns because of multi-tenancy. Data encryption and anonymization are two widely-adopted ways to combat privacy breach. However, encryption is not suitable for data that are processed and shared frequently, and anonymizing big data and manage numerous anonymized data sets are still challenges for traditional anonymization approaches. As such, we propose a scalable and cost-effective framework for privacy preservation over big data on cloud in this paper. The key idea of the framework is that it leverages cloud-based MapReduce to conduct data anonymization and manage anonymous data sets, before releasing data to others. The framework provides a holistic conceptual foundation for privacy preservation over big data. Further, a corresponding proof-of-concept prototype system is implemented. Empirical evaluations demonstrate that scalable and cost-effective framework for privacy preservation can anonymize large-scale data sets and mange anonymous data sets in a highly flexible, scalable, efficient, and cost-effective fashion. Copyright (c) 2013 John Wiley & Sons, Ltd.

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

big data
cloud
privacy preservation
framework
anonymization


Some Components of Hibernation Rhythms Abstract: At low ambient temperatures some small mammals drastically reduce their body temperature and enter a state of dormancy known as hibernation. They exhibit endogenous rhythms of heterothermy/homeothermy and body mass fluctuations with the period close to one year. At high ambient temperature only body mass cycling is expressed for almost one year as well. The effect of temperature on circannual periods of some biological rhythms in different hibernators in free-running conditions as well as the circaseptal character of the intrahibernation rhythm of periodic arousals are reviewed.

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

body mass period
hibernation/activity period


Theoretical underpinnings for maximal clique enumeration on perturbed graphs The problem of enumerating the maximal cliques of a graph is a computationally expensive problem with applications in a number of different domains. Sometimes the benefit of knowing the maximal clique enumeration (MCE) of a single graph is worth investing the initial computation time. However, when graphs are abstractions of noisy or uncertain data, the MCE of several closely related graphs may need to be found, and the computational cost of doing so becomes prohibitively expensive. Here, we present a method by which the cost of enumerating the set of maximal cliques for related graphs can be reduced. By using the MCE for some baseline graph, the MCE for a modified, or perturbed, graph may be obtained by enumerating only the maximal cliques that are created or destroyed by the perturbation. When the baseline and perturbed graphs are relatively similar, the difference set between the two MCEs can be overshadowed by the maximal cliques common to both. Thus, by enumerating only the difference set between the baseline and perturbed graphs' MCEs, the computational cost of enumerating the maximal cliques of the perturbed graph can be reduced. We present necessary and sufficient conditions for enumerating difference sets when the perturbed graph is formed by several different types of perturbations. We also present results of an algorithm based on these conditions that demonstrate a speedup over traditional calculations of the MCE of perturbed, real biological networks. (C) 2010 Elsevier B.V. All rights reserved.

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

graph perturbation theory
graph algorithms
uncertain and noisy data


synchronous elastic circuits with early evaluation and token counterflow A protocol for latency-insensitive design with early evaluation is presented. The protocol is based on a symmetric view of the system in which tokens carrying information move in the forward direction and anti-tokens canceling information move in the backward direction. An implementation of the protocol and an example illustrate the flow for converting a regular synchronous design into an elastic circuit with early evaluation.

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


Hypoxia-Mediated Mitochondrial Stress in RAW264.7 Cells Induces Osteoclast-Like TRAP-Positive Cells Previously we showed that mitochondrial dysfunction induced by mitochondrial DNA depletion or treatment with electron transport chain inhibitors triggers a stress signaling involving activation of calcineurin and Ca2+-responsive factors. In this study we show that exposure of RAW 264.7 cells to hypoxia, causing increased reactive oxygen species (ROS) production and disruption of mitochondrial transmembrane potential, also induced a similar stress signaling. Hypoxia caused increased [Ca2+]c, activation of cytosolic calcineurin and induced expression of Ryanodine Receptor 2 (RyR2) gene. Prolonged hypoxia (5% O2 for 56 days) also induced the expression of calcitonin receptor at high levels, and those of cathepsin K, and tartarate-resistant alkaline phosphatase (TRAP) at low-moderate levels in macrophage cells. Addition of RANKL had an additive effect suggesting different mechanisms of activation. Consistent with this possibility, prolonged hypoxia induced the formation of TRAP-positive osteoclast-like cells suggesting the occurrence of an autocrine mechanism for osteoclastogenesis

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

mitochondrial ros production
macrophage differentiation
osteoclast marker gene expression


Parameterized complexity of cardinality constrained optimization problems We study the parameterized complexity of cardinality constrained optimization problems, i.e. optimization problems that require their solutions to contain specified numbers of elements to optimize solution values. For this purpose, we consider around 20 such optimization problems, as well as their parametric duals, that deal with various fundamental relations among vertices and edges in graphs. We have almost completely settled their parameterized complexity by giving either FPT algorithms or W[1]-hardness proofs. Furthermore, we obtain faster exact algorithms for several cardinality constrained optimization problems by transforming them into problems of finding maximum (minimum) weight triangles in weighted graphs.

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


Multimedia algorithmics If perceptually relevant multimedia methods with guaranteed performance are not developed soon, there is no hope that the problem of multimedia information overload is effectively solved. Research is needed to handle images, music, video, and 3D models, with methods that guarantee robustness, invariance, efficiency, etc., and are also perceptually and cognitively relevant. The invention of algorithms that provably satisfy such properties is a new field of research: multimedia algorithmics.

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


Reconstruction of 3D genome architecture via a two-stage algorithm The three-dimensional (3D) configuration of chromosomes within the eukaryote nucleus is an important factor for several cellular functions, including gene expression regulation, and has also been linked with cancer-causing translocation events. While visualization of such architecture remains limited to low resolutions, the ability to infer structures at increasing resolutions has been enabled by recently-devised chromosome conformation capture techniques. In particular, when coupled with next generation sequencing, such methods yield an inventory of genome-wide chromatin contacts or interactions. Various algorithms have been advanced to operate on such contact data to produce reconstructed 3D configurations. Studies have shown that these reconstructions can provide added value over raw interaction data with respect to downstream biological insights. However, only limited, low-resolution reconstructions have been realized for mammals due to computational bottlenecks.

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

chromatin conformation capture
multi-dimensional scaling
procrustes transformation
downsampling


A note on A heuristic method for two-stage hybrid flow shop with dedicated machines In a recent paper by Wang and Liu (A heuristic for two-stage hybrid flow shop with dedicated machines. Computers & Operations Research 2013;40:43850), two elimination rules are proposed for the hybrid flow shop with dedicated machines. This note shows that one of them is not valid and that the other is dominated by an other elimination rule.

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

hybrid flow shop
dedicated machines
elimination rule


Evolving control metabolisms for a robot This article demonstrates a new method of programming artificial chemistries. It uses the emerging capabilities of the system's dynamics for information-processing purposes. By evolution of metabolisms that act as control programs for a small robot one achieves the adaptation of the internal metabolic pathways as well as the selection of the most relevant available exteroceptors. The underlying artificial chemistry evolves efficient information-processing pathways with most benefit for the desired task, robot navigation. The results show certain relations to such biological systems as motile bacteria.

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

chemical information processing
autonomous robots
genetic programming


Stochastic ordering and robustness in classification from a Bayesian network Consider a model-based decision support system (DSS) where all the variables involved are binary, each taking on 0 or 1. The system categorizes the probability that a certain variable is equal to 1 conditional on a set of variables in an ascending order of the probability values and predicts for the variable in terms of category levels. Under the condition that all the variables are positively associated with each other, it is shown in this paper that the category levels are robust to the probability values. This robustness is illustrated by a simulated experiment using a variety of model structures where a set of probability values is proposed for a robust classification. A robust classification method is proposed as an alternative when exact or satisfactory probability values are not available.

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

agreement level
basic structures of model
conditional probability
graphical model
positive association


Asymptotic stabilisation for a class of feedforward input-delay systems with ratios of odd integers This article addresses the stabilisation problem by state-feedback for a class of feedforward input-delay nonlinear systems with ratios of odd integer powers. The designed controller achieves the global asymptotic stability. Based on the appropriate state transformation of time-delay systems and the Lyapunov method, the problem of controller design can be converted into the problem of finding a parameter which can be obtained by appraising the nonlinear terms of the systems. Finally, three simulation examples are given to illustrate the effectiveness of the control algorithm proposed in this article.

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

nonlinear time-delay systems
feedforward systems
state-feedback stabilisation


Vision system for model based control of cryogenic tunnel freezers This paper presents a novel solution, using a vision-sensor, to a challenging control problem in cryogenic food freezing industry. This industrial application is characterized by significant variation in input food products because cryogenics-freezing technology with its inherent process flexibility is typically used in low volume/high mix applications. Current industrial controllers use PLCs for regulating the belt speed of the tunnel, which leads to conservative set-points and consequently significant operational cost and frequent over-freezing. Servo control of the process is difficult because of the complicated nonlinear dynamics of cryogenic freezing caused by phase-change, and thermal dynamics between the frozen products and the tunnel. The solution presented in this paper uses a vision-sensor to estimate the shape, size, and heat load of food products that will enter the freezing tunnel. An analysis of the sensor location and its impact on disturbance feed-forward control is also presented. Efficacies of these developments are verified in an industrial case study using a commodity webcam for capturing and processing two-dimensional streaming images, and integrating the processed information with an industrial control system using model-predictive control architecture. The proposed solution is especially attractive for the food industry because of the low-cost and non-contact features of webcam, operational cost savings through reduced consumption of cryogen, and improved quality through reduction in variation of temperature of the frozen products. (c) 2005 Elsevier B.V. All rights reserved.

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

vision-sensor
sensor selection
sensor positioning
sensor integration
image processing


Corporate disclosure dissemination: when more is less The U.S. Securities and Exchange Commission's EDGAR on the Internet (EOI) initiative greatly expanded investors' access to corporate disclosure documents. Investors refer to these documents when making investment decisions. Management science literature and the popular press assume that more complete disclosure and more widespread dissemination of these data are always beneficial. On the other hand, the analytical literature in finance and accounting shows that the benefits of disclosure, as measured by investor utility, are not straightforward. In this paper, we adopt a rational expectations equilibrium model to investigate whether investors benefit from the wider dissemination that resulted from EOI. Our analysis shows that many investors are unambiguously hurt by EOI. Moreover, even those investors who previously had no access to the documents are hurt under certain conditions. These results, which have an intuitive basis, suggest that the public policy of wider dissemination requires more carefully articulated motivations.

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


Self-organization in sensor networks In an effort to better guide research into self-configuring wireless sensor networks, we discuss a technical definition of the term self-organization. We define a self-organizing system as one where a collection of units coordinate with each other to form a system that adapts to achieve a goal more efficiently. We then lay out some conditions that must hold for a system to meet this definition and discuss some examples of self-organizing systems. Finally, we explore some of the ways this definition applies to wireless sensor networks. (C) 2004 Elsevier Inc. All rights reserved.

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


Convolution-Based Simulation of Homogeneous Subsurface Scattering This paper introduces a new method for simulating homogeneous subsurface light transport in translucent objects. Our approach is based on irradiance convolutions over a multi-layered representation of the volume for light transport, which is general enough to obtain plausible depictions of translucent objects based on the diffusion approximation. We aim at providing an efficient physically based algorithm that can apply arbitrary diffusion profiles to general geometries. We obtain accurate results for a wide range of materials, on par with the hierarchical method by Jensen and Buhler.

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


specifying electronic voting protocols in typed msr Electronic voting, as well as other privacy-preserving protocols, use special cryptographic primitives and techniques that are not widely used in other types of protocols, e.g. in authentication protocols. These include blind signatures, commitments, zero-knowledge proofs, mixes and homomorphic encryption. Furthermore, typical formalizations of the Dolev-Yao intruder's capabilities do not take into account these primitives and techniques, nor do they consider some types of attacks that e-voting as well as other types of protocols are designed to protect against, such as privacy attacks due to undesired linkability of protocol executions. This work aims to extend Typed MSR so that it is able to support the specification of privacy-preserving protocols, as well as the capabilities of a Dolev-Yao intruder designed to attack such protocols.

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

privacy
specification
electronic voting
typed msr


security metrics for software systems Security metrics for software products provide quantitative measurement for the degree of trustworthiness for software systems. This paper proposes a new approach to define software security metrics based on vulnerabilities included in the software systems and their impacts on software quality. We use the Common Vulnerabilities and Exposures (CVE), an industry standard for vulnerability and exposure names, and the Common Vulnerability Scoring System (CVSS), a vulnerability scoring system designed to provide an open and standardized method for rating software vulnerabilities, in our metric definition and calculation. Examples are provided in the paper, which show that our definition of security metrics is consistent with the common practice and real-world experience about software quality in trustworthiness.

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

software quality
software vulnerabilities
security metrics


Generating random graphs for the simulation of wireless ad hoc, actuator, sensor, and internet networks In this paper, we consider generation of graphs that represent specific scenarios that appear in wireless ad hoc, actuator, sensor and Internet networks. Most simulation studies for these networks use connected random unit disk graphs generated by placing nodes randomly and independently from each other. However, in real life usually networks are created in a cooperative manner; certain restrictions are imposed during the placement of a new node in order to improve network connectivity and functionality. This article is an initial study on how constrained connected random unit graphs (C-CRUG) can be generated by fast algorithms and what kind of desirable characteristics can be achieved compared to completely random graphs, especially for sparse node densities.

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


Structural Presburger digit vector automata The least significant digit first decomposition of integer vectors into words of digit vectors provides a natural way for representing sets of integer vectors by automata. In this paper, the minimal automata representing Presburger sets are proved structurally Presburger: automata obtained by moving the initial state and replacing the accepting condition represent Presburger sets. (C) 2008 Elsevier B.V. All rights reserved.

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


Why does signaling enhance multimedia learning? Evidence from eye movements Previous studies have suggested that signaling enhances multimedia learning. However, there is not enough evidence showing why signaling leads to better performance. The goal of this study was to examine the effects of signaling on learning outcomes and to reveal the underlying reasons for this effect by using eye movement measures. The participants were 40 undergraduate students who were presented with either signaled or nonsignaled multimedia materials. Labels in the illustration were signaled by temporarily changing the color of the items. The results suggest that the signaled group outperformed the nonsignaled group on transfer and matching tests. Eye movement data shows that signaling guided attention to relevant information and improved the efficiency and effectiveness of finding necessary information.

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

eye-tracking
signaling effect
cognitive processes


A 2D model for shape optimization of solid oxide fuel cell cathodes A topology optimization method is used to identify the optimal shape of the nano-composite cathode of a solid oxide fuel cell (SOFC). A simplified analysis model is used in computations aimed at reducing ohmic losses by optimizing the shape of the cathode to minimize resistance. The model of the SOFC is reduced to a periodic, 2D conduction problem with design-dependent ionic transfer boundary conditions. Special techniques are introduced to avoid physically inadmissible designs that would otherwise be allowed by the 2D model. Isoperimetric constraints on the perimeter and the amount of material are used in the problem. Numerical examples are provided to discuss the effect of material properties and the resource restrictions introduced by the constraints. The methodology discussed can be applied to similar problems involving design-dependent boundary conditions.

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

solid oxide fuel cells
design dependent boundary conditions


Solving the canonical dual of box- and integer-constrained nonconvex quadratic programs via a deterministic direct search algorithm This paper presents a massively parallel global deterministic direct search method (VTDIRECT) for solving nonconvex quadratic minimization problems with either box or +/- 1 integer constraints. Using the canonical dual transformation, these well-known NP-hard problems can be reformulated as perfect dual stationary problems (with zero duality gap). Under certain conditions, these dual problems are equivalent to smooth concave maximization over a convex feasible space. Based on a perturbation method proposed by Gao, the integer programming problem is shown to be equivalent to a continuous unconstrained Lipschitzian global optimization problem. The parallel algorithm VTDIRECT is then applied to solve these dual problems to obtain global minimizers. Parallel performance results for several nonconvex quadratic integer programming problems are reported.

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

algorithm vtdirect
global optimization
integer programming


Multiplicity and word sense: evaluating and learning from multiply labeled word sense annotations Supervised machine learning methods to model word sense often rely on human labelers to provide a single, ground truth label for each word in its context. We examine issues in establishing ground truth word sense labels using a fine-grained sense inventory from WordNet. Our data consist of a sentence corpus of 1,000 sentences: 100 for each of ten moderately polysemous words. Each word was given multiple sense labelsor a multilabelfrom trained and untrained annotators. The multilabels give a nuanced representation of the degree of agreement on instances. A suite of assessment metrics is used to analyze the sets of multilabels, such as comparisons of sense distributions across annotators. Our assessment indicates that the general annotation procedure is reliable, but that words differ regarding how reliably annotators can assign WordNet sense labels, independent of the number of senses. We also investigate the performance of an unsupervised machine learning method to infer ground truth labels from various combinations of labels from the trained and untrained annotators. We find tentative support for the hypothesis that performance depends on the quality of the set of multilabels, independent of the number of labelers or their training.

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

word sense annotation
multilabel learning
inter-annotator reliability


Measures of farm business efficiency Purpose - The aim of this paper is to investigate technical, scale, allocative and economic efficiencies by data envelopment analysis (DEA) and stochastic frontier methods to provide a decision-making tool and managerial implications in the measurement of farm business performance and efficiency. Design/methodology/approach - Technical, scale, allocative and economic efficiencies are analyzed with the Farm Accountancy Data Network (FADN) sample for 13 farm business branches in Slovenia in the period 1994-2003. DEA models are used with an output-orientation, three outputs and four inputs. The non-parametric DEA estimations are compared with a parametric stochastic frontier approach. The cluster analysis is used to identify three different farm business groups according to their performance. Findings - The average technical, scale, allocative and economic efficiencies for the whole FADN sample over the analyzed period are relatively high (around or over 0.90), suggesting that, although the FADN sample contains very different farms, the latter have similar management practices, and are similarly able to make the best use of the existing technology. Five farm branches (crop, dairy, livestock using own feed, fruit, and forestry) are fully efficient with respect to all four analyzed efficiency measures, suggesting that these specializations have the best chance to compete on the European and world markets. Originality/value - Studies of technical, scale, allocative and economic efficiencies are rare for transitional farm businesses, especially in Slovenia. The research contributes to the crucial issue of whether small family farm businesses might be able to compete on international markets, as Slovenian agriculture is characterized by such structures.

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


Evaluation of DOCK 6 as a pose generation and database enrichment tool In conjunction with the recent American Chemical Society symposium titled "Docking and Scoring: A Review of Docking Programs" the performance of the DOCK6 program was evaluated through (1) pose reproduction and (2) database enrichment calculations on a common set of organizer-specified systems and datasets (ASTEX, DUD, WOMBAT). Representative baseline grid score results averaged over five docking runs yield a relatively high pose identification success rate of 72.5 % (symmetry corrected rmsd) and sampling rate of 91.9 % for the multi site ASTEX set (N = 147) using organizer-supplied structures. Numerous additional docking experiments showed that ligand starting conditions, symmetry, multiple binding sites, clustering, and receptor preparation protocols all affect success. Encouragingly, in some cases, use of more sophisticated scoring and sampling methods yielded results which were comparable (Amber score ligand movable protocol) or exceeded (LMOD score) analogous baseline grid-score results. The analysis highlights the potential benefit and challenges associated with including receptor flexibility and indicates that different scoring functions have system dependent strengths and weaknesses. Enrichment studies with the DUD database prepared using the SB2010 preparation protocol and native ligand pairings yielded individual area under the curve (AUC) values derived from receiver operating characteristic curve analysis ranging from 0.29 (bad enrichment) to 0.96 (good enrichment) with an average value of 0.60 (27/38 have AUC a parts per thousand yen 0.5). Strong early enrichment was also observed in the critically important 1.0-2.0 % region. Somewhat surprisingly, an alternative receptor preparation protocol yielded comparable results. As expected, semi-random pairings yielded poorer enrichments, in particular, for unrelated receptors. Overall, the breadth and number of experiments performed provide a useful snapshot of current capabilities of DOCK6 as well as starting points to guide future development efforts to further improve sampling and scoring.

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

pose identification
docking
enrichment
scoring
sampling
rmsd
symmetry

pose rescoring
virtual screening
roc curves


a mixed digital / physical snapshot of early internet / web usage in new zealand We are in the early stages of developing a unique physical and digital record of New Zealand's early experience of the Internet.

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

internet archive
digital museum
history of the web


ENERGY ESTIMATION FOR n-INPUT ADIABATIC LOGIC GATE: A PROPOSED ANALYTICAL MODEL In this paper, an analytical model is proposed to estimate the energy consumption of n-input adiabatic logic gate. The model is based on RC linearization of the adiabatic circuit network. To validate the model expressions, simulations are carried out at 90 nm technology node using the Cadence Spectre simulator. Model validates with simulation results at a maximum error equals to 9.94%. Model expressions are also applied in comparison of energy performance of adiabatic logic and conventional CMOS logic. Proposed research work suggests the operating conditions which makes the adiabatic logic more energy efficient than conventional CMOS logic.

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

adiabatic switching
energy estimation model
energy recovery logic
low-power cmos circuit


Parametric variational principle based elasticplastic analysis of materials with polygonal and Voronoi cell finite element methods Parametric variational principle based polygonal finite element method (PFEM) and Voronoi cell finite element method (VCFEM) are developed for the numerical simulations of the elasticplastic mechanical behavior of heterogeneous materials under small deformation. The shape functions for the polygonal element are given and the parametric potential energy principle of the elasticplastic system is verified. Based on the parametric complementary energy principle, the formulations of VCFEM and the corresponding parametric quadratic programming model are deduced for the elasticplastic analysis of materials. Numerical examples are computed to demonstrate the validity and efficiency of the methods developed.

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

polygonal finite element method
voronoi cell finite element method
parametric variational principle


Distribution of event complexity in the British Columbia court system an analysis based on the CourBC analytical system This paper reports an exploratory research on the distribution of event complexity in the British Columbia court system. Analysis of event distribution shows that the frequency of events sharply decreases with the increase in the number of persons and counts. The most frequently observed type of event is the event that has one person involved with one count. The number of events observed sharply declines when we query for events with a larger number of people involved or more counts charged. It is found that the number of events observed exponentially decreases when more complex events comprising more counts are analyzed. The same exponential decrease is observed for events with two or more people. This means that, in general, the least complex events are the most frequently observed ones. The events with more than one person involved have a mode of two counts. A first approximation model for the distribution of the load on the system based on different levels of complexity is proposed. The proposed model can be used for and be evaluated by predicting the load distribution in the BC criminal court system.

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

event complexity
counts
persons
distribution
event

courts
data mining
entity relationships
charge


LIMITATIONS ON THE SIMULATION OF NON-SPARSE HAMILTONIANS The problem of simulating sparse Hamiltonians on quantum computers is well studied. The evolution of a sparse N x N Hamiltonian H for time t can be simulated using O(parallel to Ht parallel to poly(log N)) operations, which is essentially optimal due to a no fast-forwarding theorem. Here, we consider non-sparse Hamiltonians and show significant limitations on their simulation. We generalize the no fast-forwarding theorem to dense Hamiltonians, ruling out generic simulations taking time o(parallel to Ht parallel to), even though parallel to H parallel to is not a unique measure of the size of a dense Hamiltonian H. We also present a stronger limitation ruling out the possibility of generic simulations taking time polyt(parallel to Ht parallel to, log N), showing that known simulations based on discrete-time quantum walk cannot be dramatically improved in general. On the positive side, we show that some non-sparse Hamiltonians can be simulated efficiently, such as those with graphs of small arboricity.

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


applicability of recommender systems to medical surveillance systems In traditional Event-Based Surveillance systems, documents are continuously monitored for health threats detection and reporting, following a user-defined set of rules. This monitoring may result in a large set of events detected, overwhelming the user. In addition, such systems would not consider aspects similar to the user's set of defined rules other than exact matches. This prevents the user from discovering similar health threats that could also be of interest. In this paper, we perform a two-fold evaluation of a recommendation algorithm that infers the user preferences from his set of defined rules. In the first part of the evaluation, the participants evaluate the recommendations whether they match their interest in the H1N1 virus. For this evaluation, we achieved a precision rate of 0.81. In the second part, we conduct a group discussion with health surveillance experts where they provide feedback on the recommendations received. We present these results in terms of what should be recommended, and how the recommendations should be evaluated and take place in a surveillance system.

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

personalization
health surveillance systems


A vision-based intelligent inspector for wine production A machine-vision-based intelligent inspector is presented. The mechanical structure and electric control system are illustrated in detail. The sub-pixel edge location method is used for confirming the inspection region. The second-difference and energy accumulation method are used for identifying the small moving objects. The algorithms of shape recognition and moving trajectory discrimination are used to extract the foreign substances. A prototype was developed and experimental results demonstrate the feasibility of the inspector. Inspections performed by the prototype have proved the effectiveness and value of proposed algorithms in automatic real-time inspection.

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

machine vision
inspection region location
foreign substances recognition


Anonymous channel and authentication in wireless communications In this paper, we propose a scheme for providing anonymous channel, service in wireless communications. By this service, many interesting applications, such as electronic elections, anonymous group discussions, with user identification confidential can be easily realized. No one can trace a sender's identification and no one but the authority centre can distinguish an anonymous message from a normal message when a user uses the anonymous channel. The user anonymity in our scheme is neither based on any trusted authority nor on the cooperation of all potential senders. Our scheme can be easily applied to existing wireless systems, such as GSM and CDPD, without changing their underlying structures. (C) 1999 Elsevier Science B.V. All rights reserved.

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

anonymous channel
authentication
electronic elections
anonymous group discussions

untraceable e-mail systems
privacy and security


Machining scheme selection of digital manufacturing based on genetic algorithm and AHP The selection of machining scheme for a part is an important and strategic problem. It involves multiple and conflicting objectives such as cost, time, quality, service level, resource utilization, etc. The selection is always affected by subjective factors such as the knowledge and experiences of decision maker in conventional machining. This paper proposes a method based on genetic algorithms (GA) to find out the set of Pareto-optimal solutions for multi-objective digital machining scheme selection. To deal with multi-objective and enable the engineer to make decision on different demands, an analytic hierarchy process (AHP) is implemented in the proposed procedure to determine the weight value of evaluation indexes. Three conflicting objectives: cost, quality and operation time are simultaneously optimized. An application sample is developed and its results are analyzed. The optimization results show that the hybrid algorithm is reliable and robust.

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

genetic algorithm
analytic hierarchy process
machining scheme


Three improved hybrid metaheuristic algorithms for engineering design optimization This paper presents three hybrid metaheuristic algorithms that further improve the two hybrid differential evolution (DE) metaheuristic algorithms described in Liao [1]. The three improved algorithms are: (i) MDE?HJ, which is a modification of MAMDE? in Liao [1] by replacing the random walk with direction exploitation local search with the Hooke and Jeeves (HJ) method; (ii) MDE?IHSHJ, which is constructed by adding the Hooke and Jeeves method to the original cooperative hybrid, i.e., MDE?IHS; and (iii) PSOMDE?HJ, which is a variation of MDE?IHSHJ by replacing improved harmony search (IHS) with particle search optimization (PSO). A comprehensive comparative study was carried out to compare the three improved hybrids with the three algorithms presented by Liao [1] in terms of average success rate, average function evaluations taken, average elapsed CPU time, and convergence profiles. A total of 18 problems, 4 more than those used in Liao [1], were selected from different engineering domains for testing. The test results indicate that all three new hybrids can achieve higher success rate in much less CPU time. Among these three hybrids, MDE?IHSHJ is the best one in terms of success rate, better than the best hybrid in Liao [1] by over 15% and better than the second best, PSOMDE?HJ, by nearly 10%.

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

differential evolution
harmony search
hybrid metaheuristic
hooke and jeeves


The effect of gender on trust perception and performance in computer-mediated virtual environments An important area in Computer-Mediated Communication (CMC) is how gender affects trust building and performance in virtual settings. This paper empirically investigates gender differences in two media, video and Instant Messaging, while performing negotiation tasks. The primary results indicate that: (1) female pairs perceive higher levels of trust than male pairs when gender information about the partner is either seen via the video channel or mutually revealed via the IM channel, and (2) male/female pairs have better performance outcomes than female pairs. The results imply that having females in the remote working teams may help teams achieve high levels of initial trust leading to cooperation and information sharing in virtual settings. In addition, the results suggest that gender diversity, as represented in male/female pairs, may be important to quality performance outcomes in collaborative work groups.

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

computer-mediated communication
virtual collaboration


A choice relation framework for supporting category-partition test case generation We describe in this paper a choice relation framework for supporting category-partition test case generation. We capture the constraints among various values (or ranges of values) of the parameters and environment conditions identified from the specification, known formally as choices. We express these constraints in terms of relations among choices and combinations of choices, known formally as test frames. We propose a theoretical backbone and techniques for consistency checks and automatic deductions of relations. Based on the theory, algorithms have been developed for generating test frames from the relations. These test frames can then be used as the basis for generating test cases. Our algorithms take into consideration the resource constraints specified by software testers, thus maintaining the effectiveness of the test frames (and hence test cases) generated.

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

category-partition testing
choice relation table
specification-based testing
test case construction
test frame


an architecture for the provision of content networks based on ims, metadata, presence and p2p technologies The Internet is currently being designed and used in a way that is strongly influenced by inter-personal communications and content-based services. Content Networks, having presence and audiovisual metadata descriptions as central concepts, can play an important role in the provision of these services. Existing standards from the ISO/IEC MPEG (MPEG-7,-21) and IETF (PIDF, RPID) provide the technologies for these elementary features. This paper contributes to the deployment of Content Networks by proposing a layered architecture where the IMS Multimedia Subsystem and P2P-based midlleware tackle the problem of terminal, networks heterogeneity and the integration of different presence and metadata tools. The P2P-based middleware is used to construct autonomously self-organized, context and interest based communities by providing overlay infrastructures for the interconnection of different Content Networks components. The results obtained from implementing this architecture using Open IMS Core and Scribe open platforms show that the proposed architecture can be used for the creation and deployment of services on Content Networks.

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

content network architecture
presence services
ip multimedia subsystem
p2p networks


Image tag refinement by regularized latent Dirichlet allocation A novel regularized latent Dirichlet allocation approach to tag refinement is proposed. The proposed approach can explore the multiple-wise tag relations and visual relations. The tag relevance estimation using the proposed approach is interpreted in the form of the deep structure.

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

image tag refinement
regularized latent dirichlet allocation


Electrical resistivity calculations for copper nanointerconnect The size effect of copper interconnect in nanoscale based on various scattering mechanisms including surface roughness reflection, surface electronphonon scattering, grain boundary and background scattering is studied theoretically using Monte Carlo method as a statistical solution to Boltzmann Transport Equation. Surface phonon dispersion and corresponding scattering probability are calculated from first principle calculations based on density functional perturbation theory. The performed simulation to investigate the influence of linewidth on resistivity shows a good agreement with published experimental results. A comparison of the resistivity behaviour of quasi elastic and inelastic surface model reveals surface electronphonon scattering is an effective energy-loss channel of electrons.

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


Effective band-limited extrapolation relying on Slepian series and l(1) regularization We consider a rather simple algorithm to address the fascinating field of numerical extrapolation of (analytic) band-limited functions. It relies on two main elements: namely, the lower frequencies are treated by projecting the known part of the signal to be extended onto the space generated by "Prolate Spheroidal Wave Functions" (PSWF, as originally proposed by Slepian), whereas the higher ones can be handled by the recent so-called "Compressive Sampling" (CS, proposed by Candes) algorithms which are independent of the largeness of the bandwidth. Slepian functions are recalled and their numerical computation is explained in full detail, whereas l(1) regularization techniques are summarized together with a recent iterative algorithm which has been proved to work efficiently on so-called "compressible signals", which appear to match rather well the class of smooth bandlimited functions. Numerical results are displayed for both numerical techniques and the accuracy of the process consisting of putting them all together is studied for some test-signals showing a quite fast Fourier decay. (C) 2010 Elsevier Ltd. All rights reserved.

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

prolate spheroidal wave functions
slepian series

sparse and compressible signals recovery


Trends of internet auctions and agent-mediated Web commerce Electronic Commerce (EC) is a promising field for applying agent and Artificial Intelligence technologies. In this article, we give an overview of the trends of Internet auctions and agent-mediated Web commerce, We describe the theoretical backgrounds of auction protocols and introduce several Internet auction sites. Furthermore, we describe various activities aimed toward utilizing agent technologies in EC and the trends in standardization efforts on agent technologies.

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


stacking recommendation engines with additional meta-features In this paper, we apply stacking, an ensemble learning method, to the problem of building hybrid recommendation systems. We also introduce the novel idea of using runtime metrics which represent properties of the input users/items as additional meta-features, allowing us to combine component recommendation engines at runtime based on user/item characteristics. In our system, component engines are level-1 predictors, and a level-2 predictor is learned to generate the final prediction of the hybrid system. The input features of the level-2 predictor are predictions from component engines and the runtime metrics. Experimental results show that our system outperforms each single component engine as well as a static hybrid system. Our method has the additional advantage of removing restrictions on component engines that can be employed; any engine applicable to the target recommendation task can be easily plugged into the system.

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

content-based recommender
machine learning
stacked generalization
meta-feature
collaborative filtering
hybrid recommender systems
engine hybridization


MIXED MAXIMALLY ENTANGLED STATES We find that the mixed maximally entangled states exist and prove that the form of the mixed maximally entangled states is unique in terms of the entanglement of formation. Moreover, even if the entanglement is quantified by other entanglement measures, this conclusion is still proven right. This result is a supplementary to the generally accepted fact that all maximally entangled states are pure. These states possess important properties of the pure maximally entangled states, for example, these states can be used as a resource for faithful teleportation and they can be distinguished perfectly by local operations and classical communication.

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

maximally entangled state
entanglement measure
quantum teleportation


an elastic software cache with fast prefetching for motion compensation in video decoding Real-time decoding of ultrahigh resolution video using multicore architectures is important for future embedded systems. However, memory bandwidth is still a bottleneck of system performance. Video coding performs irregular DRAM access resulting in very low and unstable efficiency. The conventional cache approach is insufficient because it reduces only the redundant accesses to data that has already been fetched during prior-macroblock decoding. We present an Elastic Software Cache (ESC) for ultrahigh resolution video decoding on Scratchpad Memory (SPM)-based systems. Utilizing access region analysis, our latency-optimized prefetching scheme rearranges accesses to minimize both data redundancy and DRAM access latency. Compared to the conventional cache approach, our scheme requires only 4.6 Kbytes of SPM space but it can save up to 25\% of memory access cycles resulting in both higher performance and lower power.

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

software cache
video decoding
motion compensation


Parallel Godunov smoothed particle hydrodynamics (SPH) with improved treatment of Boundary Conditions and an application to granular flows Smoothed Particle Hydrodynamics has been successfully used for various fluid-dynamics problems, such as breaking-waves, flooding etc., since it was originally proposed. While the Lagrangian approach is naturally suitable for free-surface flows, enforcing boundary conditions and poor approximations in the presence of discontinuities in the solution are major difficulties with the method. In this paper we present an enhanced conservative Godunov SPH based on the work of Inutsuka [S.Inutsuka, Reformulation of smoothed particle hydrodynamics with Riemann solver, Journal of Computational Physics 179 (2002) 238267] that accurately resolves discontinuities without the need to use artificial viscosity, preserves partition of unity everywhere in the domain, correctly and flexibly enforces necessary essential and frictional slip boundary conditions to approximately solve free-surface granular flows. The development is motivated by the need to improve upon depth averaged grid based models of large scale debris flows and avalanches often characterized as granular flows. Simple validation of the results is obtained by comparison to table-top experiments.

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

smoothed particle hydrodynamics
granular flows


The use of neural network approximation models to speed up the optimisation process in electrical impedance tomography A reduced approximation model technique based on neural networks is developed in order to increase the rate of convergence of an evolution strategy (ES) used for solving a non-destructive evaluation problem. The inverse problem investigated consists of identifying the geometry of discontinuities in a conductive material from Cauchy data measurements taken on the boundary. In this study, we use neural network (NN) approximation models in order to increase the rate of convergence of the optimisation algorithm and to efficiently detect, from a computational time point of view a subsurface cavity, such as a circle. The algorithm developed by combining evolution strategies and neural networks is found to be a robust, fast and efficient method for detecting the size and location of subsurface cavities.

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

cavity detection
inverse geometric problem


soap based multiple search The Grid and the Web Services technologies are explain. Web Service for remote data access is described. A SOAP based software decision for multiple search in databases, is developed. Standardization issues are under consideration.

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


Fractal image compression based on spatial correlation and hybrid genetic algorithm In order to solve the high complexity of the conventional encoding scheme for fractal image compression, a spatial correlation hybrid genetic algorithm based on the characteristics of fractal and partitioned iterated function system (PIFS) is proposed in this paper. There are two stages for the algorithm: (1) Make use of spatial correlation in images for both range and domain pool to exploit local optima. (2) Adopt simulated annealing genetic algorithm (SAGA) to explore the global optima if the local optima are not satisfied. In order to avoid premature convergence, the algorithm adopt dyadic mutation operator to take place of the traditional one. Experiment results show that the algorithm convergent rapidly. At the premise of good quality of the reconstructed image, the algorithm saved the encoding time and obtained high compression ratio.

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

fractal image compression
pifs
spatial correlation
hybrid genetic algorithm
simulated annealing
dyadic mutation operator


Hadamard products and N-K space In this paper, we study holomorphic N-K functions in the sense of the K-Carleson measure. Also, we obtain some characterizations of functions in N-K space in terms of the Hadamard products. (C) 2009 Elsevier Ltd. All rights reserved.

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


Prosodic variation enhancement using unsupervised context labeling for HMM-based expressive speech synthesis We propose a technique for adding prosodic variations in HMM-based speech synthesis. Phrase-level contexts are defined that compensate the lack of prosodic variations. Average prosodic difference between original and synthetic speech is used. Expressive speech of sales talk and fairy tale is used for evaluation. Users can manually change phrase-level pitch without degrading naturalness.

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

hmm-based expressive speech synthesis
prosodic context
unsupervised labeling
audiobook
prosody control


Selection of third party software in Off-The-Shelf-based software development-An interview study with industrial practitioners The success of software development using third party components highly depends on the ability to select a suitable component for the intended application. The evidence shows that there is limited knowledge about current industrial OTS selection practices. As a result, there is often a gap between theory and practice, and the proposed methods for supporting selection are rarely adopted in the industrial practice. This paper's goal is to investigate the actual industrial practice of component selection in order to provide an initial empirical basis that allows the reconciliation of research and industrial endeavors. The study consisted of semi-structured interviews with 23 employees from 20 different software-intensive companies that mostly develop web information system applications. It provides qualitative information that help to further understand these practices, and emphasize some aspects that have been overlooked by researchers. For instance, although the literature claims that component repositories are important for locating reusable components: these are hardly used in industrial practice. Instead, other resources that have not received considerable attention are used with this aim. Practices and potential market niches for software-intensive companies have been also identified. The results are valuable from both the research and the industrial perspectives as they provide a basis for formulating well-substantiated hypotheses and more effective improvement strategies. (C) 2010 Elsevier Inc. All rights reserved.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 conceptual approach to information security in financial account aggregation An important dimension of mobile computing is the ubiquitous and location-independent availability of data. Aggregation is the ability to electronically access and display personal account information from disparate sources through a single identity. The client financial data is assembled in an organized format providing meaningful summarization and analysis. The prevalent methods of aggregation pose issues in information security and assurance. Utilizing advances in Internet technology such as web services and SOAP coupled with the best of the present approaches to aggregation we can arrive at better solutions to securing the identity and data of aggregation customers. The paper puts forth conceptual solutions to address issues regarding security of user profile and identifying aggregators masquerading as users through processes such as screen scraping.

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

account service providers
identity service providers


Multicriteria decision making under uncertainty Formalization for problems of multicriteria decision making under uncertainty is constructed in terms of guaranteed and weak estimates. A relevant definition of the vector maximinimax value is given. Parameterization and approximation of maximum, minimax, and maximinimax values based on the inverse logical convolution are suggested. An application for multicommodity networks is considered.

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

multicriteria decision making
uncertainty
approximation
parameterization
logical convolution


detecting online commercial intention (oci) Understanding goals and preferences behind a user's online activities can greatly help information providers, such as search engine and E-Commerce web sites, to personalize contents and thus improve user satisfaction. Understanding a user's intention could also provide other business advantages to information providers. For example, information providers can decide whether to display commercial content based on user's intent to purchase. Previous work on Web search defines three major types of user search goals for search queries: navigational, informational and transactional or resource [1][7]. In this paper, we focus our attention on capturing commercial intention from search queries and Web pages, i.e., when a user submits the query or browse a Web page, whether he/she is about to commit or in the middle of a commercial activity, such as purchase, auction, selling, paid service, etc. We call the commercial intentions behind a user's online activities as OCI (Online Commercial Intention). We also propose the notion of "Commercial Activity Phase" (CAP), which identifies in which phase a user is in his/her commercial activities: Research or Commit. We present the framework of building machine learning models to learn OCI based on any Web page content. Based on that framework, we build models to detect OCI from search queries and Web pages. We train machine learning models from two types of data sources for a given search query: content of algorithmic search result page(s) and contents of top sites returned by a search engine. Our experiments show that the model based on the first data source achieved better performance. We also discover that frequent queries are more likely to have commercial intention. Finally we propose our future work in learning richer commercial intention behind users' online activities.

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

help
framework
online commercial intention
oci
user satisfaction
goals
performance
browse
model
paper
business
user
online
search
attention
research
users
web page
types
auction
intention
data
queries
machine learning
commit
learning
future
resource
query

understandability
activation
search intention
paging
examples
personality
experience
informal
preference
training
svm
web search
contention
search engine
web site
transaction


Three-dimensional simulation of the femto-second pulsed laser interacting with a nitrogen molecule Interaction of femto-second pulsed laser with a nitrogen molecule at various angles is investigated numerically in the present study. We propose a three-dimensional time-dependent Schrdinger equation (TDSE) solver using finite volume method (FVM) with single-active-electron (SAE) assumption. We construct the model potential by combining the soft-Coulomb potential and Yukawa potential and fitting both the first ionization energy and orbital type of highest-occupied molecular orbital (HOMO) of a N2 molecule. The ratio of simulated maximum (?=0 ? = 0 ) to minimum (?=90 ? = 90 ) ionization yield is 1.9 and it agrees more favorably with the converted experimental data (2.33.3) than the MO-ADK model does (10.0). This shows that the proposed model potential in the 3D TDSE solver can faithfully predict the ionization of a nitrogen molecule under strong pulsed laser incidence and is a very useful tool for future application in similar analysis of more complicated molecules.

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