New approach for ISAR imaging of ship target with 3D rotation Inverse synthetic aperture radar (ISAR) imaging of ship target is very important in the national defense. The imaging condition for ship target is very complicated due to the complexity of the ship's movement, and a three-dimensional (3D) rotation occurs for the ship with the oceanic waves. Furthermore, the multi-path effect can not be avoided in most circumstance. In general, the received signal for a 3D rotation ship target can be characterized as multi-component polynomial phase signals (PPS), and the parametric method can be used to obtain the instantaneous ISAR images. In this paper, the received signal is considered as multi-component cubic phase signal, and a new method for ISAR imaging of ship target with 3D rotation by the product high order bilinear matched-phase transform (PHBMT) is proposed. The instantaneous ISAR image is obtained, and the multi-path effect can be eliminated by separating the ISAR image in the range-instantaneous-Doppler domain. Results of real data validate the effectiveness of the new approach presented.

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

isar
3d rotation
cubic phase signal
phbmt


Task assignment in heterogeneous computing systems using an effective iterated greedy algorithm A fundamental issue affecting the performance of a parallel application running on a heterogeneous computing system is the assignment of tasks to the processors in the system. The task assignment problem for more than three processors is known to be NP-hard, and therefore satisfactory suboptimal solutions obtainable in an acceptable amount of time are generally sought. This paper proposes a simple and effective iterative greedy algorithm to deal with the problem with goal of minimizing the total sum of execution and communication costs. The main idea in this algorithm is to improve the quality of the assignment in an iterative manner using results from previous iterations. The algorithm first uses a constructive heuristic to find an initial assignment and iteratively improves it in a greedy way. Through simulations over a wide range of parameters, we have demonstrated the effectiveness of our algorithm by comparing it with recent competing task assignment algorithms in the literature.

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

iterated greedy algorithm
task assignment
heterogeneous computing


Prioritized OWA aggregation We indicate that the problem of prioritized criteria arises in situations in which there exists a relationship between the criteria so that lack of satisfaction by the higher priority criteria cannot be readily compensated for by satisfaction by lower priority criteria. Typical of this situation is the relationship between safety and cost. We consider the problem of criteria aggregation in this environment. Central to our approach is the use of importance weights to enforce this prioritization imperative. We apply our use of priority based importance weights to the case where the scope of the criteria aggregation is an OWA type aggregation.

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

multi-criteria
aggregation operators
decision-making
lexicographic


Return map quantization from an integrate-and-fire model with two periodic inputs In this paper, we consider the Integrate-and-Fire Model tab. IFM) with two periodic inputs. The IFM outputs a pulse-train which is governed by a one dimensional return map. Using the return map, the relationship between the inputs and the output is clarified: the first input determines the global shape of the return map and the IFM outputs various periodic and chaotic pulse-trains; the second input quantizes the state of the return map and the IFM outputs various periodic pulse-trains. Using a computer aided analysis method, the quantized return map can be analyzed rigorously. Also, some typical phenomena are confirmed in the laboratory.

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

return map
quantization
computer aided analysis


Contour extraction in medical images using initial boundary pixel selection and segmental contour following In today's health care, an imaging system plays an important role throughout the entire clinical process from diagnosis and treatment planning to surgical procedures and follow-up studies of disease. Boundary detection is a technique used to segment an object within a region of interest in the medical image for further clinical applications. Contour extraction is one of the most important boundary detection methods. In this paper, an object contour extraction for gray-level medical images using automatic initial boundary pixel selection and tracing of a segmental contour based on the boundary pixels obtained by the initial boundary pixel selection is proposed. Experimental results on artificial images of convex and deep concave objects, and real CT and MRI images show that, in comparing with other existing methods, a more detailed and accurate contour can be obtained using the proposed object contour extraction method. This has low computational complexity, which will benefit applications to clinical diagnosis, treatment, surgery, and follow up studies.

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


Decoder side information generation techniques in Wyner-Ziv video coding: a review In Wyner-Ziv (WZ) video coding, decoder side information (SI) takes a key role in a WZ video codec among other building blocks. In this paper, we review the decoder SI generation techniques according to the information utilized in the SI generation process. Specifically, motion compensated extrapolation based approaches, motion compensated interpolation based approaches, and hash-based decoder motion estimation approaches in which auxiliary information is sent by the encoder side. We also review the approaches for decoder SI refinement. The review will help us get insight in the current development of the topic and understand how new and better decoder SI generation approaches can be designed.

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

side information
motion compensated extrapolation
motion compensated interpolation
decoder motion estimation

wyner-ziv video coding
slepian-wolf theorem


multi-touch interaction for tasking robots The objective is to develop a mobile human-robot interface that is optimized for multi-touch input. Our existing interface was designed for mouse and keyboard input and was later adopted for voice and touch interaction. A new multi-touch interface permits multi-touch gestures, for example zooming and panning a map, and robot task specific touch interactions. An initial user evaluation found that the multi-touch interface is preferred and yields superior performance.

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

multi-touch interaction
human-robot interaction


Optimal parallel algorithm for the knapsack problem without memory conflicts The knapsack problem is well known to be NP-complete. Due to its importance in cryptosystem and in number theory, in the past two decades, much effort has been made in order to find techniques that could lead to practical algorithms with reasonable running time. This paper proposes a new parallel algorithm for the knapsack problem where the optimal merging algorithm is adopted. The proposed algorithm is based on an EREW-SIMD machine with shared memory. It is proved that the proposed algorithm is both optimal and the first without memory conflicts algorithm for the knapsack problem. The comparisons of algorithm performance show that it is an improvement over the past researches.

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

np-complete
optimal algorithm
memory conflict


Existence and global exponential stability of periodic solution of a class of impulsive networks with infinite delays Sufficient conditions are obtained for the existence and global exponential stability of a unique periodic solution of a class of impulsive tow-neuron networks with variable and unbounded delays. The approaches are based on Mawhin's continuation theorem of coincidence degree theory and Lyapunov functions.

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


Optimal design of MR damper via finite element analyses of fluid dynamic and magnetic field In the last decade many researchers have been carried out on semi-active control systems, a large number of academic publications have been presented. Semi-active control systems which are used the magnetic field controlled fluid have been shown significant improvements by the researchers. In the study, a design optimization method that has been carried out for the objectives of target damper force and maximum magnetic flux density of an MR damper has been presented. Finite element methods, electromagnetic analysis of magnetic field and CFD analysis of MR flow, have been used to obtain optimal value of design parameters. The new approach that is use of magnetic field and MR flow together and simultaneously has specified optimal design values. Two optimal design of MR damper obtained have been verified with experimental study by manufacturing and testing of the dampers. (C) 2012 Elsevier Ltd. All rights reserved.

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

mr damper
finite element
magnetic field
cfd

magnetorheological fluid
mr fluid
computational fluid dynamics


Advantages of online spellchecking: a Croatian example Online spellchecking is commonly regarded as an auxiliary way of performing spellchecking. However, it offers a unique opportunity to constantly improve spellchecker linguistic functionality through interaction with the community of spellchecker users. Such a possibility is crucial for spellchecking in non-central and under-resourced languages, in order to overcome gaps in NLP tools between them and central languages. The paper describes Hascheck, a Croatian online spellchecker able to learn words from texts it receives. It started as the first Croatian spellchecker, hence as a basic NLP tool for an under-resourced language, but due to its learning ability it demonstrates linguistic functionality comparable to that of conventional central-language spellcheckers. Based on these experiences we also discuss the future of online spellchecking in the context of global NLP tasks. Copyright 2010 John Wiley & Sons, Ltd.

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

mathematical modeling of spellchecking parameters


Numerical simulation of high-Reynolds number flow around circular cylinders by a three-step FEM-BEM model An innovative computational model. developed to simulate high-Reynolds number flow past circular cylinders in two-dimensional incompressible viscous flows in external flow fields is described in this paper. The model. based on transient Navier-Stokes equations, can solve the infinite boundary value problems by extracting the boundary effects on a specified finite computational domain, using the projection method. The pressure is assumed to be zero at infinite boundary and the external flow field is simulated using a direct boundary element method (BEM) by solving a pressure Poisson equation, A three-step finite element method (FEM) is used to solve the momentum equations of the flow. The present model is applied to simulate high-Reynolds number flow past a single circular cylinder and flow past two cylinders in which one acts as a control cylinder. The simulation results are compared with experimental data and other numerical models and are found to be feasible and satisfactory. Copyright (C) 2001 John Wiley & Sons, Ltd.

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

boundary elements
finite elements
incompressible viscous flow
navier-stokes equations
vortex shedding suppression


evaluation of digital games using qol measurements Digital Games have become part of everyday life all over the world. In this article, we suggest to use Quality of Life (QOL) to investigate the characteristics of game play and to evaluate games. We measured emotional changes caused by game play using a QOL questionnaire specialized in the detection of the mental change (POMS-Brief Form) and saliva enzymatic analysis that is typical biomarker test about stress in Interrupted Time-Series Design. As a result, the analysis of variance showed that some negative feelings such as uneasiness and anger are reduced significantly by game play. Furthermore, it was indicated that an appreciative evaluation of the game correlates with a positive effect. Therefore it became clear that there is a need to consider the test participant's subjective evaluation of the game during the experiment. Additionally, the feelings affected were clearly different in each of the 16 titles analyzed. Therefore, a new classification of games from the viewpoint of the POMS change in QOL is possible.

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


A model of end user attitudes and intentions toward alternative sources of support End-user computing has been the focus of research for over a decade. Recent studies on end-user computing support concluded that end users are dissatisfied with the support provided by the information center. In addition to support from an information center, end users seek help from informal sources and local MIS staff. In this study we examine why end-users prefer one source of support (e.g. information center) to another (e.g. local MIS staff). In order to understand end user preferences, we study the factors that affect end user attitude toward a support source. Attitude is an important component in determining user behavior toward using a support source. In this study, a model of end user attitudes and intentions toward the source of support is presented. Analysis of data collected from 108 middle-level managers shows that respondents preferred the use of local MIS staff to both information centers and informal support sources. The results appear to reflect an emerging trend in EUC support and implications of these results are examined in the study.

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

informal support
local mis staff
user attitude

support services perceived to be important by users


Conjugacy relationship between M-convex and L-convex functions in continuous variables By extracting combinatorial structures in well-solved nonlinear combinatorial optimization problems, Murota ( 1996,1998) introduced the concepts of M-convexity and L-convexity to functions defined over the integer lattice. Recently, Murota - Shioura ( 2000, 2001) extended these concepts to polyhedral convex functions and quadratic functions in continuous variables. In this paper, we consider a further extension to more general convex functions defined over the real space, and provide a proof for the conjugacy relationship between general M-convex and L-convex functions.

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

matroid
base polyhedron
convex function
convex analysis


cache-efficient memory layout of aggregate data structures We describe an important memory optimization that arises in the presence of aggregate data structures such as arrays and structs in a C/C++ based system design methodology. We present an algorithm for determining an optimized memory layout of such data. Our implementation consists of a pointer analysis and resolution phase, followed by memory layout optimization. Experiments on typical applications from the DSP domain result in up to 44\% improvement in memory performance.

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

data cache
data layout
embedded processors


server-side detection of malware infection We review the intertwined problems of malware and online fraud, and argue that the fact that service providers often are nancially responsible for fraud causes a relative lack of incentives for clients to manage their own security well. This suggests the need for a server-side tool to determine the security posture of clients before letting them transact. We introduce an exceedingly lightweight audit mechanism to address this need -- permitting for post-mortem infection analysis -- and prove its security properties based on standard cryptographic hardness assumptions. We describe a deployment architecture that aligns the incentives of participants in order to facilitate quick adoption and widespread use of the technology. Our approach is exible enough to protect even low-end computing devices like mobile handsets, which future malware will target heavily, but whose power and bandwidth limitations result in poor effectiveness for traditional anti-virus solutions. A contribution of independent potential value is the enabling of a centralized analysis of malware-related events, which promises to extend the power of detection in comparison to what today's decentralized paradigm allows.

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

infection detection audit fraud malware mobile

incentive compatible
retroactive
post-mortem
cell phone
anti-virus


application of fitts' law to eye gaze interaction An experiment is described comparing the performance of an eye tracker and a mouse in a simple pointing task. Subjects had to make rapid and accurate horizontal movements to targets that were vertical ribbons located at various distances from the cursor's starting position. The dwell-time protocol was used for the eye tracker to make selections. Movement times were shorter for the mouse than for the eye tracker. Fitts' Law model was shown to predict movement times using both interaction techniques equally well. The model is thus seen to be a potential contributor to design of modern multimodal human-computer interfaces.

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


Database research: Achievements and challenges Database system is the infrastructure of the modern information system. The R&D in the database system and its technologies is one of the important research topics in the field. The database R&D in China took off later but it moves along by giant steps. This report presents the achievements Remnin University of China (RUC) has made in the past 25 years and at the same time addresses some of the research projects we, RUC, are currently working on. The National Natural Science Foundation of China supports and initiates most of our research projects and these successfully conducted projects have produced fruitful results.

database management system
parallel database systems
chinese database systems
self-managing databases
p2p computing and databases
data warehousing
olap
web data management
xml
mobile data management
semantic web
contextual information retrieval


Therapy for ?-globinopathies: a brief review and determinants for successful and safe correction Gene therapy for ?-globinopathies, particularly ?-thalassemia and sickle cell anemia, hold much promise for the future, as a one time cure for these common and debilitating disorders. Correction of the ?-globinopathies using lentivirus vectors (LV) carrying the ?- or ?-globin genes and elements of the locus control region has been well established in murine models, and a good idea of what it will take to cure these diseases has been developed in the first decade of the twenty-first century. A clinical trial using one such vector has been initiated in France while other trials are in development. Vector improvements to enhance the safety and efficiency of LV are being explored, while newer strategies, like homologous recombination in induced pluripotent cells for correction of sickle cell anemia, has been shown as a proof-of-concept. Here we provide a review of current progress in genetic correction of ?-globin disorders.

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

thalassemia
lentivirus vectors
gene therapy


IS integration and business performance: The mediation effect of organizational absorptive capacity in SMEs A fundamental result of the information technology (IT) and business performance literature is that IT is not a driver of performance per se. However, it can be associated with higher performance if accompanied by organizational change. The identification of the variables describing organizational change is still on-going work. This paper focuses on organizational absorptive capacity and analyses its effects on the relationship between IT and business performance in small and medium enterprises (SMEs). Organizational absorptive capacity measures the ability of an organization to complete a learning process. A significant learning effort is typically associated with IT, as it represents a complex technology. To cope with IT's complexity, implementation is typically incremental and is accompanied by a continuous integration effort of data and applications. The degree of integration of a company's information system (IS), called IS integration, is a proxy of IT maturity and quality. In this study, we explore the effect of IS integration on business performance through absorptive capacity, that is, we hypothesize that absorptive capacity has a mediation role between IS integration and business performance. The proposed research model is tested with data surveyed from 466 SMEs sited in Italy, for which exports constitute more than half of their revenues. Results indicate that organizational absorptive capacity has a mediation effect. Alternative models attributing to absorptive capacity a role different from mediation are found to be non-significant.

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

is integration
organizational absorptive capacity
smes
business performance


Identifying financially successful start-up profiles with data mining Start-ups are crucial in the modern economy as they provide dynamism and growth. Research on the performance of new ventures increasingly investigates initial resources as determinants of success. Initial resources are said to be important because they imprint the firm at start-up, limit its strategic choices, and continue to impact its performance in the long run. The purpose of this paper is to identify configurations of initial resource bundles, strategy and environment that lead to superior performance in start-ups. To date, interdependencies between resources on the one hand and between resources, strategy and environment on the other hand have been neglected in empirical research. We rely on data mining for the analysis because it accounts for premises of configurational theory, including reversed causality, intradimensional interactions, multidimensional dependencies, and equifinality. We apply advanced data mining techniques, in the form of rule extraction from non-linear support vector machines, to induce accurate and comprehensible configurations of resource bundles, strategy and environment. We base our analysis on an extensive survey among 218 Flemish start-ups. Our experiments indicate the good performance of rule extraction technique ALBA. Finally, for comprehensibility, intuitiveness and implementation reasons, the tree is transformed into a decision table. (C) 2010 Elsevier Ltd. All rights reserved.

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

active learning
start-up companies
ideal configurations


Meshfree point collocation method for the stream-vorticity formulation of 2D incompressible NavierStokes equations Meshfree point collocation method is developed for the stream-vorticity formulation of two-dimensional incompressible NavierStokes equations. Particular emphasis is placed on the novel formulation of effective vorticity condition on no-slip boundaries. The moving least square approximation is employed to construct shape functions in conjunction with the framework of point collocation method. The derivatives of an arbitrary function can be obtained by the linear combination of these shape functions, which enables the vorticity boundary condition to vary linearly with the boundary velocity and the stream function. Together with the second-order partial differential equations for the stream and vorticity functions, this boundary condition of vorticity provides the efficient meshfree point collocation scheme for the two-dimensional incompressible flow. The accuracy and stability for the proposed scheme are demonstrated through a new type of application problem with complex geometry, in addition to several typical examples of steady-state flow simulation.

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

meshfree point collocation method
vorticity boundary condition

stream-vorticity formulation
2d incompressible navierstokes flow


Minimizing Communication Interruptions Using Smart Proactive Channel Scanning Over IEEE 802.11 WLANs Wireless connectivity is becoming pervasive in our lives as wireless networks and mobile devices have been undergoing a magnificent evolution. In this context, consumers demand to access to the wireless communication services anytime and anywhere with high performance. IEEE 802.11 wireless local area networks (WLANs) have a direct impact on this widespread use. Nevertheless, as any standard procedure, WLAN also has its own drawbacks. In IEEE 802.11 wireless networks, periodic channel scanning is an essential procedure to discover available access points in the vicinity and to achieve fast handover. However, this procedure leads to unnecessary overhead in wireless networks and also interrupts ongoing communications of stations. In this paper, we propose a smart proactive channel scanning scheme that allows stations to achieve fast handover with minimized communication interruptions. In the proposed scheme, periodic channel scanning is scheduled based on adaptive channel scanning intervals and activated after a frame transmission only if the mobile station is on move or the received signal strength indicator value drops below a pre-specified threshold. The proposed scheme is a client-side software solution that any station can benefit from, without changing the standard in any existing IEEE 802.11 environment. Analytical and simulation results show that the proposed channel scanning scheme reduces the channel scanning overhead dramatically, minimizes communication interruptions and improves the overall throughput of stations.

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


Composite automated distribution system reliability model considering various automated substations We propose a set of composite reliability evaluation models. We assess the role of automated substations on the distribution system reliability. SAS plays a vital role in the enhancement of the distribution system reliability. System reliability is significantly improved by implementing the DA schemes. We rank various automated distribution systems based on their reliability.

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

automated substation
composite reliability assessment model
distribution automation
quantitative reliability assessment
substation automation system


FBeeAdHoc: A secure routing protocol for BeeAdHoc based on fuzzy logic in MANETs Mobile ad hoc network (MANET) is a group of mobile nodes that are formed dynamically by an autonomous system and communicates with each other without any supporting infrastructure. These networks are vulnerable to a number of security threats due to their unique features such as open nature, lack of infrastructure, node mobility and limited physical security of the nodes. Hence designing a secure routing protocol has become a popular research topic. Bio/Nature-inspired routing algorithms (Swarm Intelligence) such as BeeAdHoc have been offered for developing routing algorithms for MANETs. In this paper, the security vulnerabilities of BeeAdHoc are investigated and then a security framework, FBeeAdHoc, which utilizes fuzzy set theory and digital signature is proposed. A toolbox TRUTIME is used with MATLAB for simulation. The results of our experiments show that our proposed framework is able to counter the different types of threats and achieves better performance as compared to ad hoc on-demand distance vector (AODV).

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

mobile ad hoc networks (manet)
swarm intelligence (si)
digital signatures


an efficient dynamic memory allocator for sensor operating systems Dynamic memory allocation mechanism is important aspect of operating system, because an efficient dynamic memory allocator improves the performance of operating systems. In wireless sensor networks, sensor nodes have miniature computing device, small memory space and very limited battery power. Therefore, sensor operating systems should be able to operate efficiently in terms of energy consumption and resource management. And the role of dynamic memory allocator in sensor operating system is more important than one of general operating system. In this pager, we propose new dynamic memory allocation scheme that solves problems of existing dynamic memory allocators. We implement our scheme on Nano-Qplus which is a sensor operating system base on multi-threading. Our experimental results show our scheme performs efficiently in both time and space compared with existing memory allocation mechanism.

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

sensor networks
dynamic memory allocation
operating system


Scaling of hybrid-electric vehicle powertrain components for Hardware-in-the-loop simulation Hardware-in-the-loop (HIL) simulation enables experimental study of prototype hardware systems or control algorithms via real time interaction between physical hardware and virtual simulations. As a result, this method is a particularly valuable tool for hybrid vehicle powertrain analysis. In the case where novel or prototype hardware is being examined, it is often necessary to scale the signals in and out of the prototype system in order to represent production-sized components. This scaling process is often done in an ad-hoc manner. In this work. a formal method is presented that derives appropriate input/output signal conditioning to correctly scale electric vehicle components, particularly the following subsystems: electric motor and battery pack. (C) 2009 Elsevier Ltd. All rights reserved.

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

hardware-in-the-loop
hybrid electric vehicle
buckingham pi theorem
battery model


achieving 550 mhz in an asic methodology Typically, good automated ASIC designs may be two to five times slower than handcrafted custom designs. At last year's DAC this was examined and causes of the speed gap between custom circuits and ASICs were identified. In particular, faster custom speeds are achieved by a combination of factors: good architecture with well-balanced pipelines; compact logic design; timing overhead minimization; careful floorplanning, partitioning and placement; dynamic logic; post-layout transistor and wire sizing; and speed binning of chips. Closing the speed gap requires improving these same factors in ASICs, as far as possible. In this paper we examine a practical example of how these factors may be improved in ASICs. In particular we show how techniques commonly found in custom design were applied to design a high-speed 550 MHz disk drive read channel in an ASIC design flow.

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


a scheme for balancing heterogeneous request load in dht-based p2p systems DHT-based P2P systems have been proven to be a scalable and efficient means of sharing information. With the entrance of quality of services concerns into DHT systems, however, the ability to guarantee that the system will not be overwhelmed due to load imbalance becomes much more significant, especially when factors such as item popularity and skewing are taken into consideration. In this paper, we focus on the problem of load imbalance caused by skewed access distribution. We propose an effective load balancing solution, which takes the peer heterogeneity and access popularity into account to determine the load distribution. Our algorithm achieves load balancing by dynamically balancing the query routing load and query answering load respectively. Experimentations performed over a Pastry-like system illustrate that our balancing algorithms effectively balance the system load and significantly improves performance.

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

quality of service (qos)
load-balancing
peer-to-peer (p2p) systems
distributed hash tables (dht)


Topic aspect-oriented summarization via group selection The summarization is desirable to efficiently apprehend the gist of the huge amount of data and becomes a significant challenge in many applications such as news article summarization and social media mining. Considering the summaries from multi-documents of one topic can describe various aspects of one given topic, this paper attempts to exploit appropriate priors to generate topic aspect-oriented summarization (abbreviated as TAOS). The underlying intuition of the proposed TAOS is that different topics can prefer different aspects and the different aspects can be represented by different preference of features(e.g., technical topic may prefer proper noun than sports topic). In order to materialize the intuition of TAOS, we first extract several groups of features according to topic factors, and then a group norm penalty (i.e., ?1/?2 ? 1 / ? 2 norm) and latent variables are utilized to select overlapping groups of features. We compare our proposed approach with some state-of-the-art methods on DUC2003, DUC2004 datasets for text summarization and NUS-Wide dataset for image summarization. The results show our method can generate meaningful summarization in terms of ROUGE and JensenShannon Divergence metrics.

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

large margin
submodular function
text/image summarization


On stable and explicit numerical methods for the advection-diffusion equation In this paper two stable and explicit numerical methods to integrate the one-dimensional (1D) advection-diffusion equation are presented. These schemes are stable by design and follow the main general concept behind the semi-Lagrangian method by constructing a virtual grid where the explicit method becomes stable. It is shown that the new schemes compare well with analytic solutions and are often more accurate than implicit schemes. In particular, the diffusion-only case is explored in some detail. The error produced by the stable and explicit method is a function of the ratio between the standard deviation an of the initial Gaussian state and the characteristic virtual grid distance AS. Larger values of this ratio lead to very accurate results when compared to implicit methods, while lower values lead to less accuracy. It is shown that the sigma(0)/Delta S ratio is also significant in the advection-diffusion problem: it determines the maximum error generated by new methods, obtained with a certain combination of the advection and diffusion values. In addition, the error becomes smaller when the problem becomes more advective or more diffusive. (C) 2008 IMACS. Published by Elsevier B.V. All rights reserved.

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

advection-diffusion equation
numerical stability


Open geospatial technology standards and their potential in plant pest risk managementGPS-enabled mobile phones utilising open geospatial technology standards Web Feature Service Transactions support the fighting of fire blight in Norway The threat posed by invasive alien species to global crop production and biodiversity is recognized as one of the major drivers of global change today. Here we report on a successful implementation and operational use of new technology to support risk- and crisis management in the case of fighting an invasive plant disease. The open geospatial standards Web Feature Service Transaction (WFS-T) was implemented in software for GPS-enabled mobile phones communicating with a GeoServer backend in order to track down and eradicate disease outbreaks and susceptible host plants. This new technology offering georeferenced events online from field provides new possibilities for real time action in risk and crisis management.

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

wfs-t
smilex
pest risk management
invasive organisms
gps
mobile phone
postgis
java


Smoke Detection in Video: An Image Separation Approach Existing video-based smoke detection methods often rely on the visual features extracted directly from the original frames. In the case of light smoke, the background is still visible and it deteriorates the quality of the features. This paper presents an approach to separating the smoke component from the background such that visual features can be extracted from the smoke component for reliable smoke detection. Specifically, an image is assumed to be a linear blending of a smoke component and a background image. Given a video frame and its background, the estimation of the blending parameter and the actual smoke component can be formulated as an optimization problem. Three methods based on different models for the smoke component are proposed to solve the optimization problem. Experimental results on synthesized and real video data have shown that the proposed approach can effectively separate the smoke component and the smoke detection performance is significantly improved by using the visual features extracted from the smoke component.

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


Parallel incomplete factorizations with pseudo-overlapped subdomains We address the hard question of efficient use on parallel platforms, of incomplete factorization preconditioning techniques for solving large and sparse linear systems by Krylov subspace methods. A novel parallelization strategy based on pseudo-overlapped subdomains is explored. This results in efficient parallelizable preconditioners. Numerical results give evidence that high performance can be achieved.

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

large sparse linear systems
preconditioned conjugate gradient
multiprocessor computers
domain decomposition


(1+epsilon)-competitive algorithm for online OVSF code assignment with resource augmentation This paper studies the online Orthogonal Variable Spreading Factor (OVSF) code assignment problem with resource augmentation introduced by Erlebach et al. (in STACS 2004. LNCS, vol. 2996, pp. 270-281, 2004). We propose a (1 + 1/alpha)-competitive algorithm with help of (1 + left perpendicular alpha right perpendicular) lg*h trees for the height h of the OVSF code tree and any alpha >= 1. In other words, it is a (1 + epsilon)-competitive algorithm with help of (1 + left perpendicular 1/epsilon right perpendicular)lg*h trees for any constant 0 = 3 (or epsilon <= 1/3), although the incurred cost for individual requests is bounded to a constant.

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

online ovsf code assignment problem
competitive algorithm


Development of a parametric finite element model of the proximal femur using statistical shape and density modelling Skeletal fractures associated with bone mass loss are a major clinical problem and economic burden, and lead to significant morbidity and mortality in the ageing population. Clinical image-based measures of bone mass show only moderate correlative strength with bone strength. However, engineering models derived from clinical image data predict bone strength with significantly greater accuracy. Currently, image-based finite element (FE) models are time consuming to construct and are non-parametric. The goal of this study was to develop a parametric proximal femur FE model based on a statistical shape and density model (SSDM) derived from clinical image data. A small number of independent SSDM parameters described the shape and bone density distribution of a set of cadaver femurs and captured the variability affecting proximal femur FE strength predictions. Finally, a three-dimensional FE model of an 'unknown' femur was reconstructed from the SSDM with an average spatial error of 0.016 mm and an average bone density error of 0.037 g/cm(3).

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

fracture risk
statistical shape model
parametric model


Cryptanalysis and improvement of practical convertible authenticated encryption schemes using self-certified public keys A convertible authenticated encryption scheme allows a specified recipient to recover and verify a message simultaneously. Moreover the recipient can prove the dishonesty of the sender to any third party if the sender repudiates her signature later. Recently, Lv et al. (2005) showed that the Wu et al.'s (1999) and the Huang et al.'s (2003) convertible authenticated encryption schemes cannot provide the semantic security of encrypted messages. Then they proposed a practical convertible authenticated encryption scheme using self-certified public keys, and extended it to one with message linkages when the signed message is large. In this paper, we show that the verifier can recover messages if given many triples of message, signature and ciphertext in the Lv et al.'s basic convertible authenticated encryption scheme. Finally we propose a new improvement to these schemes to overcome this weakness and to improve its efficiency.

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

authenticated encryption scheme
message linkages

public key cryptology
self-certified public key


Progressive High-Quality Response Surfaces for Visually Guided Sensitivity Analysis In this paper we present a technique which allows us to perform high quality and progressive response surface prediction from multidimensional input samples in an efficient manner. We utilize kriging interpolation to estimate a response surface which minimizes the expectation value and variance of the prediction error. High computational efficiency is achieved by employing parallel matrix and vector operations on the GPU. Our approach differs from previous kriging approaches in that it uses a novel progressive updating scheme for new samples based on blockwise matrix inversion. In this way we can handle very large sample sets to which new samples are continually added. Furthermore, we can monitor the incremental evolution of the surface, providing a means to early terminate the computation when no significant changes have occurred. When the generation of input samples is fast enough, our technique enables steering this generation process interactively to find relevant dependency relations. Categories and Subject Descriptors (according to ACM CCS): I. 3.3 [Computer Graphics]: Picture/ Image Generation-Line and curve generation

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

i.3.3 [computer graphics]: picture/image generation


as-awareness in tor path selection Tor is an anonymous communications network with thousands of router nodes worldwide. An intuition reflected in much of the literature on anonymous communications is that, as an anonymity network grows, it becomes more secure against a given observer because the observer will see less of the network. In particular, as the Tor network grows from volunteers operating relays all over the world, it becomes less and less likely for a single autonomous system (AS) to be able to observe both ends of an anonymous connection. Yet, as the network continues to grow significantly, no analysis has been done to determine if this intuition is correct. Further, modifications to Tor's path selection algorithm to help clients avoid an AS-level observer have not been proposed and analyzed. Five years ago a previous study examined the AS-level threat against client and destination addresses chosen a priori to be likely or interesting to examine. Using an AS-level path inference algorithm with improved accuracy, more extensive Internet routing data, and, most importantly, a model of typical Tor client AS-level sources and destinations based on data gathered from the live network, we demonstrate that the threat of a single AS observing both ends of an anonymous Tor connection is greater than previously thought. We look at the growth of the Tor network over the past five years and show that its explosive growth has had only a small impact on the network's robustness against an AS-level attacker. Finally, we propose and evaluate the effectiveness of some simple, AS-aware path selection algorithms that avoid the computational overhead imposed by full AS-level path inference algorithms. Our results indicate that a novel heuristic we propose is more effective against an AS-level observer than other commonly proposed heuristics for improving location diversity in path selection.

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


building, deploying, and monitoring distributed applications with eclipse and r-osgi Designing and testing distributed applications is still a difficult task that requires in-depth knowledge about networking issues. Eclipse is, among other things, a powerful and widely used IDE for the development of complex applications, in particular modular applications for the OSGi framework. Our R-OSGi middleware supports the seamless distribution of OSGi applications along the boundaries of services. By combining R-OSGi with Eclipse into the R-OSGi Deployment Tool, we give developers a tool that automatically handles distribution in a transparent way and integrates the capabilities of R-OSGi into the Eclipse workflow. With this tool, building, deploying, and monitoring distributed applications is as easy as writing OSGi applications in Eclipse and using a graphical editor to visually create distributed deployments of the modules. The tool can also be used to great effect by researchers to test and benchmark distributed applications and for education purposes.

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


Making nonlinear manifold learning models interpretable: The manifold grand tour Smooth nonlinear topographic maps of the data distribution to guide a Grand Tour visualisation. Prioritisation of data linear views that are most consistent with data structure in the maps. Useful visualisations that cannot be obtained by other more classical approaches.

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

data visualisation
nonlinear dimensionality reduction
linear projections


Design theory and method of multivariate hash function This paper proposes a novel hash algorithm whose security is based on the multivariate nonlinear polynomial equations of NP-hard problem over a finite field and combines with HAIFA iterative framework. Over the current widely used hash algorithms, the new algorithm has the following advantages: its security is based on a recognized difficult mathematical problem; the hash length can be changed freely; its design can be automated such that users may construct specific hash function meeting the actual needs. Furthermore, we discuss the security, efficiency and performance of the new algorithm. Under some related difficult mathematical assumptions and theoretical analysis, the new algorithm is proven practical by the experiment results, and capable of achieving security of an ideal hash function by choosing suitable parameters. In addition, it can also be used as a pseudo-random number generator for the good randomness of its output.

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

cryptology
mq problem
multivariate polynomials


Local shape of generalized offsets to algebraic curves Offsetting is an important operation in computer aided design, with applications also in other contexts like robot path planning or tolerance analysis. In this paper we study the local behavior of an algebraic curve under a variation of the usual offsetting construction, namely the generalized offsetting process (Sendra and Sendra, 2000a). More precisely, here we discuss when and how this geometric construction may cause local changes in the shape of an algebraic curve, and we compare our results with those obtained for the case of classical offsets (Alcazar and Sendra, 2007). For these purposes, we use well-known notions of Differential Geometry, and also the notion of local shape introduced in Alcazar and Sendra (2007). Our analysis shows important differences between the topological properties of classical and generalized offsets, both at regular and singular points. (C) 2011 Elsevier Ltd. All rights reserved.

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


Representation of radiation damping in a dam-reservoir interaction analysis based on a rational stiffness approximation In this paper, the dam-reservoir interaction problem is solved directly in the time-domain by modelling a part of the reservoir as a semi-infinite fluid-channel. Radiation damping is taken into account rigorously using an analytical solution with respect to the direction of wave propagation. The key step of the method consists of approximating the resulting modal flux-pressure relationship by a rational function in i Omega, which can be replaced by a system of linear equations in the frequency-domain. Two algorithms for the calculation of the coefficients of the rational function are described and compared. Finally, a system of first-order differential equations in the time-domain is obtained which completely represents the semi-infinite fluid-channel and can be coupled to the equations of motion of a dam and a bounded reservoir. The proposed strategy is verified considering a rigid dam. Moreover, the results of an earthquake analysis of a coupled flexible dam-reservoir system are presented. (c) 2006 Elsevier Ltd. All rights reserved.

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

dam-reservoir interaction
unbounded domain
rational approximation
least-squares approach


generalized linear perspective shadow map reparameterization Shadow mapping is an efficient approach for real-time shadow rendering, but it usually suffers from inherent aliasing artifacts due to the image-based nature. The aliasing errors of shadow mapping can be classified into two categories: perspective aliasing errors and projection aliasing errors. In this paper, we present the Generalized Linear Perspective Reparameterization (GLPR) of shadow maps to reduce perspective aliasing errors. The generalized perspective reparameterization function is formulized first, in which three parameters are taken into account: 1) the cross angle between the view and light direction, 2) the distance from the projection reference point to the near plane in the perspective warping frustum, and 3) the pixel's depth. The distribution of perspective aliasing errors of all currently existing perspective reparamterizations can be uniformly described by this function. Based on this generalized representation, the direction-dependent warping transform is chosen to keep the linear perspective aliasing distribution when the light direction is not perpendicular with the view direction.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 fuzzy-based reactive controller for a non-holonomic mobile robot This paper presents the theoretical development of a complete navigation problem of an autonomous mobile robot. The situation for which the vehicle tries to reach the endpoint is treated using a fuzzy logic controller. The problem of extracting the optimized IFTHEN rule base is solved using an evolutionary algorithm. A new approach based on fuzzy concepts is presented in this paper to avoid any collision with the surrounding environment when this latter becomes relatively complex. Simulation results show that the designed fuzzy controller achieves effectively any movement control of the vehicle from its current position to its end motion and without any collision.

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

evolutionary programming
obstacle avoidance


Advanced analysis techniques for cross-product coverage Coverage analysis is used to monitor the quality of the verification process. Reports provided by coverage tools help users identify areas in the design that have not been adequately tested. Because of their sheer size, the analysis of large coverage models can be an intimidating and time-consuming task. This paper presents several techniques for coverage analysis. These techniques range from highly interactive and dynamic analysis that allows users to focus on certain aspects or areas of interest in the coverage model to fully automated coverage analysis, which identifies uncovered or lightly covered areas. The proposed techniques provide additional means for extracting relevant, useful information, thereby improving the quality of the coverage analysis. A number of examples show how the proposed method improved the verification of actual designs.

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

functional verification
classification algorithms


Low-power highly linear UWB CMOS mixer with simultaneous second- and third-order distortion cancellation A 3.14.8GHz mode-1 UWB CMOS mixer that utilizes simultaneous second- and third-order distortion cancellation is presented. The scheme is based on a new derivative superposition, employing PMOS as an auxiliary FET to cancel the second- and the third-order nonlinear currents of common-source transconductance in the mixer and gives rise to low-distortion operation for a broad range of gate-source voltage. Full Volterra series analysis of the proposed transconductance is reported to examine the effectiveness of the new technique. Simulations in a 0.13?m CMOS technology demonstrate that IIP3 and IIP2 of the proposed mixer have 18 and 10dB improvements, respectively, compared with conventional Gilbert-type mixer with the same power consumption. The robustness of the technique has been verified by Monte Carlo analysis. The mixer has a gain of 12dB and noise figure of 13dB, while drawing only 2.5mA from 1.2V supply voltage.

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

derivative superposition
distortion cancellation
volterra series analysis

inter-modulation distortion
ultra-wideband mixer


Formal modeling of evolving self-adaptive systems In this paper, we present a formal model, named PobSAM (Policy-based Self-Adaptive Model), for developing and modeling self-adaptive evolving systems. In this model, policies are used as a mechanism to direct and adapt the behavior of self-adaptive systems. A PobSAM model is a collection of autonomous managers and managed actors. The managed actors are dedicated to the functional behavior while the autonomous managers govern the behavior of managed actors by enforcing suitable policies. A manager has a set of configurations including two types of policies: governing policies and adaptation policies. To adapt the system behavior in response to the changes, the managers switch among different configurations. We employ the combination of an algebraic formalism and an actor-based model to specify this model formally. Managed actors are expressed by an actor model. Managers are modeled as meta-actors whose configurations are described using a multi-sorted algebra called CA. We provide an operational semantics for PobSAM using labeled transition systems. Furthermore, we provide behavioral equivalence of different sorts of CA in terms of splitting bisimulation and prioritized splitting bisimulation. Equivalent managers send the same set of messages to the actors. Using our behavioral equivalence theory, we can prove that the overall behavior of the system is preserved by substituting a manager by an equivalent one. (C) 2011 Elsevier B.V. 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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

adaptive systems
policy-based systems
actor models
software engineering


ISOLATED HIGH STEP-UP ZERO-VOLTAGE-SWITCHING DC-DC CONVERTER WITH A CONTINUOUS INPUT CURRENT An isolated high step-up DC-DC converter with a continuous input current is proposed. The proposed converter consists of two converter cells - a boost converter cell at the input stage for a low input current ripple and a DC-DC converter cell for high voltage gain. Zero-voltage-switching of power switches are achieved and the leakage inductance of the transformer alleviates the reverse-recovery problems of the output diodes. Therefore, the proposed converter achieves high efficiency. Detailed analysis and design of the proposed converter are carried out. A prototype of the proposed converter is developed, and its experimental results are presented for validation.

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


Why situational method engineering is useful to information systems development Effective methods and methodologies for building information systems (IS) remain crucial to building successful IS. This paper investigates the use of situational method engineering for IS development (ISD) projects in a professional bureaucracy. This specialist organization methodology (SOM) is built starting with the philosophy of ISD moving through to flexible, amethodical implementation methods, a proposed instance of situational method engineering that is targeted towards professional bureaucracies. An in-depth philosophical discussion of the ontological, epistemological, research methodological and ethical underpinnings of SOM are outlined, in addition to its limitations, to develop the building blocks of a methodology to implement within a professional bureaucracy organization ISD scenario. Amethodical ISD will be introduced as the appropriate way to implement this developed methodology to build a successful IS. The contribution of this paper is to detail how to develop a philosophically consistent methodology for a specific organizational environment (in this case, using the specific organizational example of a professional bureaucracy) that, when combined with developers and tools, can create a method to be applied to build an IS that has a greater possibility of successful organizational adoption than an IS built using a method devised using more common IS method engineering approaches.

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

information systems development
situational method engineering

isd approach
philosophical foundations of isd
amethodical systems development


Performance of parallel communication and spawning primitives on a Linux cluster The Linux cluster considered in this paper, formed from shuttle box XPC nodes with 2 GHz Athlon processors connected by dual Gb Ethernet switches, is relatively easily constructed, but, while effective as a throughput engine, may result in disappointing results when running explicitly parallel software if weakly-performing communication mechanisms and process spawning are selected. This paper carefully compares the implementations of communication and spawning primitives in MPICH-2, openMosix, and Linux Remote Procedure Call, forking, and various lower-level communication mechanisms. The test selection compares the provision of both a message-passing library, and a single system image software package, with direct use of lower-level primitives. The information in the paper will be of interest to those considering the use of one of the well-known packages, or directly writing their own distributed applications, or constructing a distributed language by layering on top of an existing set of parallel primitives. The results expose a ranking in terms of process spawning and a similar ranking of communication software performance. They reveal poor performance in certain circumstances, well below the hardware specification, which it is as well that the developer is aware of. In general, the paper emphasizes the importance of efficient transport software to cluster machines.

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


Robust model-based signal analysis and identification We describe and evaluate a model-based scheme for feature extraction and model-based signal identification which uses likelihood criteria for "edge" detection. Likelihood measures from the feature identification process are shown to provide a well behaved measure of signal interpretation confidence. We demonstrate that complex, transient signals, from one of 6 classes, can reliably be identified at signal to noise ratios of 2 and that identification does not fail until the signal to noise ratio has reached 1. Results show that the loss in identification performance resulting from the use of a heuristic, rather than an exhaustive, search strategy is minimal. Crown Copyright (C) 2001 Published by Elsevier Science Ltd on behalf of the Pattern Recognition Society. All rights reserved.

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

signal interpretation
signal identification

model based
maximum likelihood
machine learning
robust methods


Evaluation of stress intensity factors for multiple surface cracks in bi-material tubes This paper presents stress intensity factors (SIFs) of multiple semi-elliptical surface cracks in bi-material tubes subjected to internal pressure by boundary element method. In this case the water-tube boiler with oxide scale formed on the inner surface due to prolonged exposure at elevated temperature is considered as the bi-material tubes. Variations of modulus of elasticity and thickness for the oxide scale are used to evaluate their effects on the stress intensity factors. The increasing of thickness of the oxide scale causes decreasing values of the normalized stress intensity factor as the modulus of elasticity for the oxide scale is greater than that of the tube metal. Conversely, if the modulus of elasticity for the oxide scale is smaller, the increasing of thickness of the scale would also give increasing values of the normalized stress intensity factor.

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

boundary element modeling
multiple surface crack
bi-material


Parameter estimation for HFM signals using combined STFT and iteratively reweighted least squares linear fitting A method combing STFT and IRLS linear fitting for estimating parameters of HFM signals is proposed. The proposed method transforms a complex nonlinear problem into a linear one. The lower bound of the estimator's variance and bias of the parameters of HFM signals are derived. Both simulation results and processing of sea trial data are presented. The proposed method is generic and may be applied to any TF representation.

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

hyperbolic frequency modulated signals
instantaneous frequency
zero crossing interval
short-time fourier transform


Field evaluation of the pedostructure-based model (Kamel (R)) This study involves a field evaluation of the pedostructure-based model Kamel(R) and comparisons between Kamel(R) and the Hydrus-1D(R) model. Both models are commonly named 1D - soil water models because they simulate the flux of water within the soil, related to climate conditions variation and water uptake by roots. The field site used in the investigation is within the Upper Cedar Creek Watershed (UCCW) in northwestern Indiana, USA. A description of both models has been made, emphasizing on the physical principles on which the pedostructure parameters for Kamel(R) were calculated or estimated using usual pedotransfer functions according to a methodology explained in the article. Sensitivity analysis for the pedostructure parameters of the Kamel(R) model showed that values for Kbs (slope of shrinkage curve for basic water content), VA (specific volume of pedostructure at dry state) and alpha L (hydraulic conductivity coefficient for high range of macropores) were the most sensitive parameters of the soil medium for Kamel(R) model input. The calibration for Kamel(R) and Hydrus-1D(R) was carried out for a 15 day time period for determining the non-measured parameters. The calibrated parameters were used for validation of both models for the field site. Both models were found to be in good agreement with measured water content at the 5 and 20 cm layers for the field site, but performance of Kamel(R) was superior to Hydrus-1D(R) for deeper layers. However the lack of information about the internal organization of the soil in situ, like thickness of horizons, roots repartition, accepted by Kamel(R), does not permit to make a complete validation of the model. We only show here that Kamel(R) can do as well as Hydrus-1D(R), a more known and experimented soil water model; however, Kamel(R) is more promising in terms of ability to couple dynamics of the internal hydrostructural state of the soil medium to the external climatic conditions and the biological processes in the critical zone. (C) 2012 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 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 B O O O O O O O O O O O O O O O O O O O B I O O B O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

soil water models
sensitivity analysis
pedostructure

soil hydrostructural modeling
rev and srev variables


augmenting interoperability across scholarly repositories The panel will discuss various aspects related to an invitational meeting held at the Mellon Foundation On April 20th and 21st 2006 aimed at identifying concrete steps that can be taken to reach new levels of interoperability across scholarly repositories. The focus of the meeting was specifically on repository interfaces that support locating, identifying, harvesting, retrieving and submitting complex digital objects.

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


Precise eye localization using HOG descriptors In this paper, we present a novel algorithm for precise eye detection. First, a couple of AdaBoost classifiers trained with Haar-like features are used to preselect possible eye locations. Then, a Support Vector Machine machine that uses Histograms of Oriented Gradients descriptors is used to obtain the best pair of eyes among all possible combinations of preselected eyes. Finally, we compare the eye detection results with three state-of-the-art works and a commercial software. The results show that our algorithm achieves the highest accuracy on the FERET and FRGCv1 databases, which is the most complete comparative presented so far.

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


Sensitivity analysis for a structured juvenileadult model In this paper, we consider a model which describes the dynamics of an amphibian population where individuals are divided into juveniles and adults. We derive sensitivity partial differential equations for the sensitivities of the solution with respect to the reproduction and mortality rates for adults. We also present numerical results to show the application of these equations to an amphibian population of green tree frogs (Hyla cinerea).

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

sensitivity equations
finite difference approximation


e-governance initiatives in india Information and Communication Technology (ICT) in government agencies as well as educational and research institutions facilitates an efficient, speedy and transparent dissemination of information to the public and other agencies for performance of governments' administrative activities. The importance of ICT in governance has been recognised the world over. Electronic governance (e-governance) highlights several elements of good governance such as transparency, accountability, participation, social integration, public financial management reforms and development. This study is based on personal interview of selected representatives of the Government of National Capital Territory of Delhi and review of e-Governance initiatives taken by the government. The findings of this study highlight the role of Internet, particularly the World Wide Web (WWW), which has made it easier for citizens to locate and download official information and to conduct transactions. We conclude that e-Governance needs to be integrated into the broader public management framework so as to make a substantial change in the government to citizen (G2C) relationship.

delhi government
e-governance
networked environment
information communication technologies


Detecting oestrus by monitoring sows' visits to a boar This paper suggests a method for automatic detection of sows returning to oestrus in the gestation department. The detection is based on monitoring of sows' visits to a boar, where the duration and frequency of visits are modelled separately and subsequently combined. The hypothesis is that it is possible to reduce the response time and the number of false alarms compared to previously published attempts. The duration of visits to a boar is defined as seconds per hour the sow is near the boar - logarithmically transformed. The duration is modelled with a multiprocess dynamic linear model with first order Markov probabilities. The indicator of oestrus is the probability of the model describing oestrus, P(M(OE)), and it is monitored with a threshold value. The frequency of visits to a boar is defined as number of visits per 6 h. A dynamic generalised linear model with two built-in diurnal periods is applied. The indicator of oestrus is the relative deviation from the forecasted frequency, which is monitored with a threshold value. The probability, P(M(OE)), and the relative deviation from the forecasted frequency are combined by means of Bayes Theorem. The combined probability of oestrus is monitored with a threshold value as well. Results indicate that the specificity is superior compared to previously published attempts. The model describing duration alone yields the most satisfactory specificity - 99.4% per sow clay, which is considerably greater than previously published studies. Furthermore, this model detects 87.4% of the sows entering oestrus, which is slightly lower than previous attempts. The response time of the models is 1 h for the duration model and the combined model and 6h for the frequency model. This is better than previous attempts. Even though the specificity is greater, the proportion of false alarms on a day-to-day basis is still too high (91.0%), which is due to the very large proportion of the sow clays defined as non-oestrus. In order to improve the specificity of the detection method, it is suggested to combine the detection method in the present study with other information sources about oestrus. (C) 2010 Elsevier B.V. All rights reserved.

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

group housing
heat detection
state space model


Flexible authorisation in dynamic e-business environments using an organisation structure-based access control model In dynamic e-business and e-manufacturing environments, enterprises require a secure access control mechanism based on an access control model to manage employee authorisations flexibly. This study presents an organisation structure-based access control (OSAC) model based on a task-role-based access control (T-RBAC) model. The OSAC model emphasises that employee authorisations are generated directly based on their position in the enterprise organisational structure. The proposed model extends the concepts of static separation of duty (SSD), dynamic separation of duty (DSD), prerequisite, and cardinality constraints in the role-based access control (RBAC) model to present department and role relations that identify the cooperative interactive relations among roles across department boundaries to facilitate resource sharing among roles and simplify enterprise resource management. Various relations and applied examples are demonstrated using the class model in unified modelling language (UML). Examples of inappropriate use of relations that lead to violation of relation are also presented. To demonstrate the feasibility of the proposed model for most businesses, a case study involving an automobile component producer is presented and an OSAC model-based administrative management system is developed to ensure that appropriate resources can be legally used by the correct employees and at the right time. By applying the proposed model, administrators can easily manage resources based on an organisational structure perspective and the resource sharing capabilities of all departments can be improved.

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


Behavioral modeling of nonlinear RF power amplifiers using ensemble SDBCC network A new behavioral model of nonlinear RF power amplifiers (PA) is presented to treat memory effects. The key issue here is considering the phenomenon that uplink quadrature modulation signals are influenced not only by the current uplink signals, but also by previous terms. The variation of AM/AM and AM/PM, and the asymmetries in lower and upper intermodulation terms are frequently observed in high-power PAs. To treat these phenomena, this paper proposes a model based on artificial neural network. The contribution made of this model is to solve the order determination issue (determining the order of the previous output and input signals that have influence on the current output signal). In addition, the recognized difficulty of long training process is overcome by using SDBCC algorithm, a novel neural network design method combining structure decomposition and the Cascade-Correlation neural network algorithm. The required maximum delay is established by examining the autocorrelation coefficient of the residual error. Ensemble system is finally used to improve the performance further. This proposed method is successfully validated in nonlinear modeling of the RF PAs from HuaWei Company, including 8000 samples.

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

rf power amplifier
cascade-correlation algorithm
parallel learning


Using competitive layer model implemented by Lotka-Volterra recurrent neural networks for detecting brain activated regions from fMRI data The competitive layer model (CLM) implemented by the Lotka-Volterra recurrent neural networks (LV RNNs) is prominently characterized by its capability of binding neurons with similar feature into the same layer by competing among neurons at different layers in a column. This paper proposes to use the CLM of the LV RNN for detecting brain activated regions from the fMRI data. The correlated voxels from brain fMRI data can be obtained, and the clusters from fMRI time series can be uncovered. Experiments on synthetic and real fMRI data demonstrate the effectiveness of binding activated voxels into the 'active' layers of the CLM. The activated voxels can be detected more accurately than some existing methods by the proposed method.

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

lotka-volterra recurrent neural networks


Emerging and scripted roles in computer-supported collaborative learning Emerging and scripted roles pose an intriguing approach to analysing and facilitating CSCL. The concept of emerging roles provides a perspective on how learners structure and self-regulate their CSCL processes. Emerging roles appear to be dynamic over longer periods of time in relation to learners advancing knowledge, but are often unequally distributed in ad hoc CSCL settings, e.g., a learner being the typist and another being the thinker. Empirical findings show that learners benefit from structuring or scripting CSCL. Scripts can specify roles and facilitate role rotation for learners to equally engage in relevant learning roles and activities. Scripted roles can, however, collide with emerging roles and therefore need to be carefully attuned to the advancing capabilities of the learners.

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


FPGA-based sliding mode direct control of single phase PWM boost rectifier In this paper, a Field Programmable Gate Array (FPGA) based controller for single phase PWM boost rectifier is presented. The control is made up of an internal current control loop and external DC-link voltage control loop. The internal control loop allows active shaping of the line current and is synthesized via sliding mode theory. The external control loop is based on a PI controller and allows imposing the shape of the DC-link voltage response. Experimental results carried out on a FPGA-based prototyping platform are presented and discussed in order to illustrate the efficiency of the developed FPGA-based controller. (c) 2012 IMACS. Published by Elsevier B.V. All rights reserved.

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


Tool support for hardware/software co-design of communication protocols An important aspect in providing high performance distributed systems such as multimedia systems is the combined use of hardware and software in the end systems. System design techniques should allow hardware/software (HW/SW) co-design to integrate both means of implementation. Zn this paper, we show how the standardized formal language Estelle can be used to facilitate co-design. The system to be developed will first be designed in Estelle. At the point of time of final decision on which parts to implement in software and which in hardware, the original specification will be split into several partial specifications, The software parts are translated into C code, while the hardware parts are translated into VHDL code for further analysis and development. We present a tool environment that supports the protocol developer in the design and implementation process. An example shows the usefulness of the tool environment. (C) 2000 Elsevier Science 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 B O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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


The role of social and parasocial relationships on social networking sites loyalty The effect of social and parasocial relationships in loyalty to SNSs is examined. The model was tested by SEM with data from a convenience sample of 320. Social relations are directly influencing consumers loyalty to SNSs. Parasocial relationships precedes social in SNSs which it turn lead to loyalty.

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

parasocial behavior
social behavior
identification
engagement


virtual gazing in video surveillance Although a computer can track thousands of moving objects simultaneously, it often fails to understand the priority and the meaning of the dynamics. Human vision, on the other hand, can easily track multiple objects with saccadic motion. The single thread eye movement allows people to shift attention from one object to another, enabling visual intelligence from complex scenes. In this paper, we present a motion-context attention shift (MCAS) model to simulate attention shifts among multiple moving objects in surveillance videos. The MCAS model includes two modules: The robust motion detector module and the motion-saliency module. Experimental results show that the MCAS model successfully simulates the attention shift in tracking multiple objects in surveillance videos.

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

simulation
motion-context attention shift
motion-saliency module


An architectural style for spatial data infrastructures This work proposes an architectural style, a pattern, for spatial data infrastructures (SDIs). This style provides a tool and a shared vocabulary to help system architects to design these infrastructures, and facilitates the exchange of knowledge about them. This style is defined under the component-and-connector architectural viewtype, extending the client-server and shared-data styles. The style has been created after analyzing six of the most relevant SDIs and geo-service architectural proposals. Several architectural elements that these proposals have not properly addressed are considered. Three real projects, with published architectural views or models, have been examined to verify the applicability of the style. The proposed style offers a systematization and refinement of knowledge about SDIs, grounded in well-known concepts in software architecture.

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

software architecture
architectural style
pattern


The novel use of low temperature hydrogenated microcrystalline silicon germanium (?cSiGe:H) for MEMS applications In this paper, we propose hydrogenated microcrystalline silicon germanium (?cSiGe:H) as a MEMS structural material deposited at temperatures of 300400 C, showing good mechanical and electrical properties. This range of deposition temperatures is investigated in order to allow post-processing of MEMS on top of CMOS with low-permittivity inter-metal dielectrics. Plasma enhanced chemical vapor deposition (PECVD) is used to deposit in situ Boron doped SiGe films with low tensile stress (down to +25 MPa) and low electrical resistivity (down to 7 m?cm). The use of a multilayer film deposition technique is investigated as a means to obtain films with low stress gradient values suitable for MEMS surface micromachining.

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

growth mechanism
low temperature processing
microelectromechanical systems