Adaptive self-tuning techniques for performance tuning of database systems: a fuzzy-based approach with tuning moderation Self-tuning of database management systems (DBMS) offers important advantages such as improved performance, reduced total cost of ownership, eliminates the need for an expert database administrator (DBA), and improves business prospects. Several techniques have been proposed by researchers and the database vendors to self-tune the DBMS. However, the research focus was confined to physical tuning techniques, and the algorithms used for self-tuning the shared memory of DBMS have high computational overheads as they use large statistical data. As a result, these approaches are not only computationally expensive but also do not adapt well to highly unpredictable workload types and user-load patterns. Hence, in this paper an important soft-computing method, namely, fuzzy-based self-tuning approach has been proposed wherein, three inputs namely, buffer-hit-ratio, number of users and database size are extracted from the database management system as sensor inputs that indicate degradation in performance, and key tuning parameters called the effectors are altered (Burlson and Donald 2010) according to the fuzzy rules. The fuzzy rules are framed after a detailed study of impact of each tuning parameter on the response-time of user queries. The proposed self-tuning architecture is based on modified Monitor, Analyze, Plan and Execute (MAPE) feedback control loop framework termed Monitor, Estimate and Execute (MEE). The self-tuning approach using this method has been tested under various workload types. The results have been validated by comparing the performance of the proposed self-tuning system with the workload-analysis-based self-tuning feature of the commercial database system, Oracle 10g. The results show significant improvement in performance under two workload types, namely, TPC-C and TPC-E and user-load variations in the range 2100. The system is also tested under TPC-D workload for the user-load 110. This improved self-tuning helps in simplifying the job of the DBA, and results in cost saving and betters the business prospectus of the enterprise. A novel tuning moderation technique is also presented in this paper, that provides the necessary stability to the system while the tuning parameters are dynamically altered.

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

self-tuning
buffer-hit-ratio
fuzzy inference system
workload-types
tuning-moderation
user-load


Relationship between vortex and sound in under-expanded supersonic impinging jets The study of an under-expanded supersonic jet impinging on a flat plate by using large-eddy simulation is reported. A third-order upwind compact difference and a fourth-order symmetric compact scheme are employed to discretize the nondimensional axisymmetric compressible Favre-filtered Navier-Stokes equations in space, whereas the third-order Runge-Kutta method with the total variation diminishing property is adopted to deal with the temporal discretization. The numerical simulation successfully captures the shock wave and vortex structures with different scales in the flow field. Waves with high and low frequencies traveling forward and reflecting back, and sound sources in different locations can be observed. By comparison with the frequency of the impinging tone from the experiment, it can be deduced that the change of pressure and swirling strength in the shear layer, pressure change on the impinging plate, and vortex merging in the jet shear layer are interdependent with the impinging tone. The effects of nozzle lip thickness on the impinging jet flow field have been investigated. The results show that the values of pressure fluctuation and vortex swirling strength in the shear layer near the nozzle have an extremum with the variation of the nozzle lip thickness. The results provide a theoretical foundation for the design of supersonic nozzles. Copyright (c) 2011 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 B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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

impinging jet
shock wave
vortex structures
compact scheme


a fine-grained taxonomy of tables on the web We propose a classification taxonomy over a large crawl of HTML tables on the Web, focusing primarily on those tables that express structured knowledge. The taxonomy separates tables into two top-level classes: a) those used for layout purposes, including navigational and formatting; and b) those containing relational knowledge, including listings, attribute/value, matrix, enumeration, and form. We then propose a classification algorithm for automatically detecting a subset of the classes in our taxonomy, namely layout tables and attribute/value tables. We report on the performance of our system over a large sample of manually annotated HTML tables on the Web.

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


The gradual covering decay location problem on a network In covering problems it is assumed that there is a critical distance within which the demand point is fully covered, while beyond this distance it is not covered at all. In this paper we define two distances. Within the lower distance a demand point is fully covered and beyond the larger distance it is not covered at all. For a distance between these two values we assume a gradual coverage decreasing from full coverage at the lower distance to no coverage at the larger distance.

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

networks
integer programming
maximal cover problems


CPG model for autonomous decentralized multi-legged robot system - generation and transition of oscillation patterns and dynamics of oscillators A central pattern generator (CPG) model is proposed for the gait-pattern generation mechanism of an autonomous decentralized multi-legged robot system. The topological structure of the CPG is represented as a graph on which two time evolution systems, the Hamilton system and a gradient system, are introduced. The CPG model can generate oscillation patterns depending only on the network topology and can bifurcate different oscillation patterns according to the network energy, which means that the robot can generate gait patterns by connecting legs and transit gait patterns according to such parameters as the desired speed. (C) 2003 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 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

gait pattern
pattern transition
legged robot
autonomous decentralized system


Characteristics of a chromatic dispersion measurement method using the bidirectional modulation of optical intensity modulator We had recently measured a chromatic dispersion of optical fiber and a time delay of chirped fiber grating based on a bidirectional modulation of an optical intensity modulator. In this paper, we analyze characteristics of the chromatic dispersion measurement method using a bidirectional modulation of an optical intensity modulator, and give a detailed explanation about the selection of measurement setup parameters to achieve an accurate measurement. We also propose a modified measurement system to decrease relative intensity noise caused by the bidirectional transmission through a device under test.

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

chromatic dispersion measurement
optical fiber
optical intensity modulator


A multivariate intelligent decision-making model for retail sales forecasting A sales forecasting problem in the retail industry is addressed based on early sales. An effective multivariate intelligent decision-making (MID) model is developed to provide effective forecasts for this problem by integrating a data preparation and preprocessing module, a harmony search-wrapper-based variable selection (HWVS) module and a multivariate intelligent forecaster (MIF) module. The HWVS module selects out the optimal input variable subset from given candidate inputs as the inputs of MIF. The MIF is established to model the relationship between the selected input variables and the sales volumes of retail products, and then utilized to forecast the sales volumes of retail products. Extensive experiments were conducted to validate the proposed MID model in terms of extensive typical sales datasets from real-world retail industry. Experimental results show that it is statistically significant that the proposed MID model can generate much better forecasts than extreme learning machine-based model and generalized linear model do.

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

retail industry
early sales
sales forecasting


Accelerated Cartesian expansion (ACE) based framework for the rapid evaluation of diffusion, lossy wave, and KleinGordon potentials Diffusion, lossy wave, and KleinGordon equations find numerous applications in practical problems across a range of diverse disciplines. The temporal dependence of all three Greens functions are characterized by an infinite tail. This implies that the cost complexity of the spatio-temporal convolutions, associated with evaluating the potentials, scales as O N s 2 N t 2 , where Ns and Nt are the number of spatial and temporal degrees of freedom, respectively. In this paper, we discuss two new methods to rapidly evaluate these spatio-temporal convolutions by exploiting their block-Toeplitz nature within the framework of accelerated Cartesian expansions (ACE). The first scheme identifies a convolution relation in time amongst ACE harmonics and the fast Fourier transform (FFT) is used for efficient evaluation of these convolutions. The second method exploits the rank deficiency of the ACE translation operators with respect to time and develops a recursive numerical compression scheme for the efficient representation and evaluation of temporal convolutions. It is shown that the cost of both methods scales as O(NsNtlog2Nt) O ( N s N t log 2 N t ) . Several numerical results are presented for the diffusion equation to validate the accuracy and efficacy of the fast algorithms developed here.

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

accelerated cartesian expansion (ace)
transient
block-toeplitz
fast multipole methods


threshold behavior of incentives in social networks The advent of large scale online social networks has resulted in a spurt of studies on the user participation in the networks. We consider a query incentive model on social networks, where user's queries are answered through her friendship network and there are `rewards' or `incentives' in the system to answer the queries utilizing ones community. We model the friendship network as a random graph with power-law degree distribution, and show that the reward function exhibits a theoretic threshold behavior on the scaling exponent ?, a network parameter. Specifically, there exists a threshold on ? above which the reward is exponential in the average path length in the network and below the threshold, the reward is proportional to the average path length. We demonstrate this finding on simulated power-law networks and real world data gathered from online social media such as Flickr, Digg, YouTube and Yahoo! Answers.

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

threshold phenomenon
query incentive networks


Manufacturing intelligence to forecast and reduce semiconductor cycle time Semiconductor manufacturing is one of the most complicated production processes with the challenges of dynamic job arrival, job re-circulation, shifting bottlenecks, and lengthy fabrication process. Owing to the lengthy wafer fabrication process, work in process (WIP) usually affects the cycle time and throughput in the semiconductor fabrication. As the applications of semiconductor have reached the era of consumer electronics, time to market has played an increasingly critical role in maintaining a competitive advantage for a semiconductor company. Many past studies have explored how to reduce the time of scheduling and dispatching in the production cycle. Focusing on real settings, this study aims to develop a manufacturing intelligence approach by integrating Gauss-Newton regression method and back-propagation neural network as basic model to forecast the cycle time of the production line, where WIP, capacity, utilization, average layers, and throughput are rendered as input factors for indentifying effective rules to control the levels of the corresponding factors as well as reduce the cycle time. Additionally, it develops an adaptive model for rapid response to change of production line status. To evaluate the validity of this approach, we conducted an empirical study on the demand change and production dynamics in a semiconductor foundry in Hsinchu Science Park. The approach proved to be successful in improving forecast accuracy and realigning the desired levels of throughput in production lines to reduce the cycle time.

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

cycle time
manufacturing intelligence
semiconductor

work in process (wip)
gauss-newton regression
back-propagation neural network


Processing Umami and Other Tastes in Mammalian Taste Buds Neuroscientists are now coming to appreciate that a significant degree of information processing occurs in the peripheral sensory organs of taste prior to signals propagating to the brain. Gustatory stimulation causes taste bud cells to secrete neurotransmitters that act on adjacent taste bud cells (paracrine transmitters) as well as on primary sensory afferent fibers (neurocrine transmitters). Paracrine transmission, representing cellcell communication within the taste bud, has the potential to shape the final signal output that taste buds transmit to the brain. The following paragraphs summarize current thinking about how taste signals generally, and umami taste in particular, are processed in taste buds.

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

serotonin
atp
norepinephrine
synaptic transmission


Geometric characterization and clustering of graphs using heat kernel embeddings In this paper, we investigate the use of heat kernels as a means of embedding the individual nodes of a graph in a vector space. The reason for turning to the heat kernel is that it encapsulates information concerning the distribution of path lengths and hence node affinities on the graph. The heat kernel of the graph is found by exponentiating the Laplacian eigensystem over time. In this paper, we explore how graphs can be characterized in a geometric manner using embeddings into a vector space obtained from the heat kernel. We explore two different embedding strategies. The first of these is a direct method in which the matrix of embedding co-ordinates is obtained by performing a YoungHouseholder decomposition on the heat kernel. The second method is indirect and involves performing a low-distortion embedding by applying multidimensional scaling to the geodesic distances between nodes. We show how the required geodesic distances can be computed using parametrix expansion of the heat kernel. Once the nodes of the graph are embedded using one of the two alternative methods, we can characterize them in a geometric manner using the distribution of the node co-ordinates. We investigate several alternative methods of characterization, including spatial moments for the embedded points, the Laplacian spectrum for the Euclidean distance matrix and scalar curvatures computed from the difference in geodesic and Euclidean distances. We experiment with the resulting algorithms on the COIL database.

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

graph spectra
kernel methods
graph embedding
differential geometry
graph clustering


Energy-to-peak performance controller design for building via static output feedback under consideration of actuator saturation The paper presents a static output feedback controller design approach for seismic-excited structures. An energy-to-peak control performance is used and actuator saturation is taken into consideration. By combining the linear matrix inequality (LMI) technique and the random search results of genetic algorithm (GA), a desirable static output feedback controller can be computed. Two building structures under seismic loads are used to validate the effectiveness of the proposed method in reducing the structural vibration. Simulation results also show that the energy-to-peak performance based controller can well realize the peak response suppression requirement and the static output feedback controller can achieve the same level of control performance as that of a full-state feedback controller.

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

energy-to-peak performance
structural systems
vibration control
genetic algorithms


Input feature extraction for multilayered perceptrons using supervised principal component analysis A method is proposed for constructing salient features from a set of features that are given as input to a feedforward neural network used for supervised learning. Combinations of the original features are formed that maximize the sensitivity of the network's outputs with respect to variations of its inputs. The method exhibits some similarity to Principal Component Analysis, but also takes into account supervised character of the learning task. It is applied to classification problems leading to improved generalization ability originating from the alleviation of the curse of dimensionality problem.

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

feature selection
multilayered perceptron
principal components
saliency


A new approach to vision-based unsupervised learning of unexplored indoor environment for autonomous land vehicle navigation ? A vision-based approach to unsupervised learning of the indoor environment for autonomous land vehicle (ALV) navigation is proposed. The ALV may, without human's involvement, self-navigate systematically in an unexplored closed environment, collect the information of the environment features, and then build a top-view map of the environment for later planned navigation or other applications. The learning system consists of three subsystems: a feature location subsystem, a model management subsystem, and an environment exploration subsystem. The feature location subsystem processes input images, and calculates the locations of the local features and the ALV by model matching techniques. To facilitate feature collection, two laser markers are mounted on the vehicle which project laser light on the corridor walls to form easily detectable line and corner features. The model management subsystem attaches the local model into a global one by merging matched corner pairs as well as line segment pairs. The environment exploration subsystem guides the ALV to explore the entire navigation environment by using the information of the learned model and the current ALV location. The guidance scheme is based on the use of a pushdown transducer derived from automata theory. A prototype learning system was implemented on a real vehicle, and simulations and experimental results in real environments show the feasibility of the proposed approach.

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

unsupervised learning
autonomous land vehicle navigation
model matching
pushdown transducer
environment exploration


Experimental study and modeling of double-surrounding-gate and cylindrical silicon-on-nothing MOSFETs An experimental study and modeling of double-surrounding-gate (DSG) and silicon-on-nothing surrounding-gate (SONSG) MOSFETs are presented. The manufacturing challenges of advanced multiple-gate MOSFETs are discussed; and DSG and SONSG devices are proposed as potential solutions to overcome these fabrication challenges. The analytic general solution to cylindrical (nonlinear) Poissons equation is applied to analyze DSG and SONSG device performance. Numerical issues of solving two coupled implicit transcendental equations to obtain two integration constants are addressed. It is found that under the same boundary conditions, concentration of the induced charge in a DSG MOSFET is comparable to a conventional double-gate MOSFET.

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

poissons equation
implicit transcendental equations

double-surrounding-gate mosfet
silicon-on-nothing mosfet


A solution to the fundamental linear complex-order differential equation This paper provides the solution to the complex-order differential equation, 0 d t q x ( t ) = kx ( t ) + bu ( t ) , where both q and k are complex. The time-response solution is shown to be a series that is complex-valued. Combining this system with its complex conjugate-order system yields the following generalized differential equation, 0 d t 2 Re ( q ) x ( t ) - k 0 d t q x ( t ) - k 0 d t q x ( t ) + k k x ( t ) = p 0 d t q u ( t ) + p 0 d t q u ( t ) - ( k + k ) u ( t ) . The transfer function of this system is p ( s q - k ) - 1 + p ( s q - k ) - 1 , having a time-response 2 ? n = 0 ? t ( n + 1 ) u - 1 Re pk n ? ( ( n + 1 ) q ) cos ( ( n + 1 ) v ln t ) - Im pk n ? ( ( n + 1 ) q ) sin ( ( n + 1 ) v ln t ) . The transfer function has an infinite number of complexconjugate pole pairs. Bounds on the parameters u=Re(q),v=Im(q) u = Re ( q ) , v = Im ( q ) , and k are determined for system stability.

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

fractional calculus
fractional-order systems
fractional-order differential equations
complex-order derivatives
complex-order systems
complex-order differential equations


User mobility support in an urban CDMA-based wireless network A salient feature of wireless networks is the ability to support user roaming. However, user mobility has a profound effect on grade of service (GoS) and quality of service (QoS) provisioning. Code division multiple access (CDMA) is the multiple access technology for the third-generation wireless standard (3G) and is envisioned to be the multiple access technology beyond 3G. CDMA is interference-limited. The signal-to-interference (SIR) ratio, expressible in the form of E-b/I-o, is an important parameter in CDMA systems and has a profound effect on the system capacity. The system capacity in turn affects the call-level GoS of the network layer in terms of new call blocking probability and forced termination probability. The effect of user mobility on (i) degradation in utilization and (ii) excess capacity needed to satisfy the QoS/GoS requirements, in an urban environment, is examined and quantified. A relationship between the link-layer E-b/I-o specification and the call-level GoS parameters in the presence of user mobility is also established. Numerical results which display the linkages between the link-layer QoS and call-level GoS parameters are presented and discussed. This coupling gives a quantification of the link-layer requirement to provision the call-level GoS, in the presence of user mobility.

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

grade of service
quality of service
system capacity
user mobility

resource management
system utilization
wireless communications


IFRP: An Intrusion/Fault Tolerant Routing Protocol for increasing resiliency and reliability in Wireless Sensor Networks Limitations of sensors cause routing and data sending to the base station become one of the challenging issues in Wireless Sensor Networks (WSNs). So far, many methods are proposed for routing in the WSNs, but security is not mentioned in the most of them. Moreover, the proposed secure routings either are used for specific attack or have a high overhead. In this paper, we present a new method for neighbour detection and key management, and introduce a routing called Intrusion/Fault Tolerant Routing Protocol (IFRP). The routing is switched from single path to multipath in the face of malicious behaviour by Local Warden Technique (LWT). Proposed protocol detects and isolates intruder or faulty nodes by utilising LWT and a centralised decision. Simulations show that the IFRP have a superior delivery ratio over the mechanisms with low overhead. Moreover, results illustrate that the method with extra overhead has very low delivery ratio improvement by just 1%.

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

wsn
wireless sensor network
ad hoc
secure routing
intrusion and fault tolerance
routing attacks


Comments on "An analytical algorithm for generalized low-rank approximations of matrices" Low rank approximations of matrices have been widely used in pattern recognition and machine learning. Based on a sequence of matrices, a generalized low rank approximation problem was presented and an iterative scheme was given by Liang and Shi recently proposed an analytical scheme for this approximation problem. In this paper, we identify the weakness in their scheme and prove that their algorithm is incorrect. (C) 2007 Elsevier Ltd. All rights reserved.

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

low rank approximation
analytical algorithm


shopping robots and e-commerce The paper analyzes features, roles and functions of shopbots, comparing them to non-virtual intermediaries. The aim is to understand how they can support and optimize decision making processes and especially decision-making for purchasing.

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


Collaborative, cross-disciplinary learning and co-emergent innovation in eScience teams Collaborative eScience research teams are impeded by difficulties defining problems that provide research opportunities for all participants. Problem formulation occurs early in the collaboration process when the demand for ideas is high. However, cross-disciplinary linkages and integrated conceptual frameworks from which strong interdisciplinary ideas emerge do not evolve until later. The process of co-creating interdisciplinary research ideas is fundamentally a learning problem; participants from different disciplines must learn enough about each others research interests to construct an integrated conceptual framework from which joint problems of interest can be created. However, participants rarely have the conceptual background needed to easily understand research topics in other disciplines; hence methods for enabling rapid learning in these situations are needed. Team interactions that more effectively generate interdisciplinary ideas can be enabled based on a better understanding the process of cross-disciplinary, collaborative learning. This article postulates several models of collaborative learning in these settings and discusses the implications for orchestrating team activities to achieve better outcomes.

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

escience
interdisciplinary research
collaboration


Bipartite multigraphs with expander-like properties This note considers the following combinatorial question: For which integers d d and functions fd f d does there exist, for every large enough v v , a bipartite d d -regular multigraph on 2v 2 v nodes with node sets V V and W W having the following property: For every U U that is a subset of either V V or W W , the cardinality of the set of neighbours of U U is at least fd(|U|) f d ( | U | ) ? Graphs with the above property seem to behave well also with respect to other, more complicated, expander-like properties. We provide results for d d in {5,6,7,8} and give a description of a fairly general methodology for devising computer-assisted proofs for a wide class of mathematical claims using interval arithmetic.

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

expander graphs
probabilistic method
interval arithmetic.


An evolutionary approach to rank class association rules with feedback mechanism In this paper, we propose an evolutionary associative classification method by considering both adjustment of the order of the whole set of rules and refinement of the power of each single rule. We discover an interesting phenomenon that the classification performance could be improved if we import some prior-knowledge to re-rank the association rules, where the prior-knowledge could be some equations generated by combing the support and confidence values with various functions. We make use of Genetic Network Programming to automatically search the equation space for prior-knowledge. In addition to rank the rules by equations globally, we also develop a feedback mechanism to adjust the rules locally, by giving some rewards to good rules and penalties to bad ones. Because the proposed method is based on evolutionary computation, we could gradually refine the power of each rule so that it could affect the classification results more precisely. The experimental results on UCI benchmark datasets show that the proposed method could improve the classification accuracies effectively.

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

genetic network programming
feedback mechanism


A survey: Ant Colony Optimization based recent research and implementation on several engineering domain Ant Colony Optimization (ACO) is a Swarm Intelligence technique which inspired from the foraging behaviour of real ant colonies. The ants deposit pheromone on the ground in order to mark the route for identification of their routes from the nest to food that should be followed by other members of the colony. This ACO exploits an optimization mechanism for solving discrete optimization problems in various engineering domain. From the early nineties, when the first Ant Colony Optimization algorithm was proposed, ACO attracted the attention of increasing numbers of researchers and many successful applications are now available. Moreover, a substantial corpus of theoretical results is becoming available that provides useful guidelines to researchers and practitioners in further applications of ACO. This paper review varies recent research and implementation of ACO, and proposed a modified ACO model which is applied for network routing problem and compared with existing traditional routing algorithms.

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

swarm intelligence
ant colony optimization


Optimal-constrained multicast sub-graph over coded packet networks Network coding is a technique which can be used to improve the performance of multicast communications by performing encoding operations at intermediate nodes. In real-time multimedia communication applications, there are usually several weights associated with links, such as cost, delay, jitter, loss ratio, security, and so on. In this paper, we consider the problem of finding an optimal multicast sub-graph over coded packet networks, where the longest end-to-end weight from the source to each destination does not exceed an upper bound. First, a mixed integer programming model is proposed to formulate the problem which is NP-hard. Then, a column-generation approach is described for this problem, in which the problem is decomposed into a master linear programming problem and several integer programming sub-problems. Moreover, two methods based on linear and Lagrangian relaxation are proposed to compute a tight lower bound of the optimal solution value. Computational results show that the proposed algorithm provides an efficient way for solving the problem, even for relatively large networks.

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

communication networks
network flow optimization


The structure of human serotonin 2c G-protein-coupled receptor bound to agonists and antagonists We used the MembStruk computational procedure to predict the three-dimensional (3D) structure for the serotonin 5-HT2C G-protein-coupled receptor (GPCR). Using this structure, we used the MSCDock computational procedure to predict the 3D structures for bound ligandprotein complexes for agonists such as serotonin and antagonists such as ritanserin, metergoline, and methiothepin. In addition, we predicted the SAR data for a series of psilocybin analogs, both agonists and antagonists. We performed molecular dynamics (MD) on serotonin bound to 5-HT2C and we find the protein and binding site to be stable after 5ns. We find good agreement with the currently known experimental data and we predict a number of new mutations which could be used to validate further our predicted structures. This agreement between theory and experiment suggests that our 3D structure is sufficiently accurate for use in drug design. We also compare a preliminary prediction for 5-HT2B with our prediction for 5-HT2C and find a difference in TM5 that contributes to different serotonin binding modes in 5-HT2B and 5-HT2C.

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

protein structure prediction
binding site prediction
membrane proteins
g-protein-coupled receptors
serotonin receptors


Estimation of infrastructure performance models using state-space specifications of time series models We consider state-space specifications of autoregressive moving average models (ARMA) and structural time series models as a framework to formulate and estimate inspection and deterioration models for transportation infrastructure facilities. The framework provides a rigorous approach to exploit the abundance and breadth of condition data generated by advanced inspection technologies. From a managerial perspective, the framework is attractive because the ensuing models can be used to forecast infrastructure condition in a manner that is useful to support maintenance and repair optimization, and thus they constitute an alternative to Markovian transition probabilities. To illustrate the methodology, we develop performance models for asphalt pavements. Pressure and deflection measurements generated by pressure sensors and a falling weight deflectometer, respectively, are represented as manifestations of the pavements elasticity/load-bearing capacity. The numerical results highlight the advantages of the two classes of models; that is, ARMA models have superior data-fitting capabilities, while structural time series models are parsimonious and provide a framework to identify components, such as trend, seasonality and random errors. We use the numerical examples to show how the framework can accommodate missing values, and also to discuss how the results can be used to evaluate and select between inspection technologies.

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

infrastructure performance modeling
state-space models
time series analysis
missing data
maintenance optimization


Channel equalization for synchronization of chaotic maps Many communication systems applying synchronism of chaotic systems have been proposed as an alternative spread spectrum modulation that improves the level of privacy in data transmission. However, due to the lack of robustness of chaos synchronization, even minor channel imperfections are enough to hinder communication. In this paper, we propose an adaptive equalization scheme based on a modified normalized least-mean-squares (NLMS) algorithm, which enables chaotic synchronization when the communication channel is not ideal. As an example of application, this scheme is used to recover a binary sequence modulated by a chaotic signal generated by the Hnon map. Simulation results show that the modified NLMS can successfully equalize the channel in different scenarios.

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

synchronization of chaotic maps
adaptive equalization

chaos-based communication
non-ideal channels


Targeting Protein Kinase C-alpha (PKC-?) in Cancer with the Phosphorothioate Antisense Oligonucleotide Aprinocarsen Antisense oligonucleotides (ASOs) offer a novel pharmacological platform to develop highly specific drugs. As shown by the clinical development of aprinocarsen, an ASO directed against protein kinase C-alpha (PKC-?), this platform has made a remarkable advance from the bench to the bedside. This review summarizes the rationale of the early development of aprinocarsen and current clinical experience.

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

protein kinase c-alpha
targeted therapies


An approach to solve division-like queries in fuzzy object databases The division operator is well known in the context of fuzzy relational databases. Fuzzy approaches to this operator can be found in the literature to solve flexible queries: these approaches try to compute to which extent each element of a candidate set is connected with a given (fuzzy) set of elements. This kind of queries is also interesting in the framework of fuzzy object databases, where the management of complex objects instead of plain tuples causes additional difficulties. The presence of fuzzily described objects in the database makes necessary louse suitable operators that take into account the resemblance that governs the comparison in the underlying reference universe. In this paper, we propose a method to solve this type of queries founded on the use of fuzzy inclusion operators. We study two different alternatives for the way resemblance is considered and we also analyze the role of cardinality in the process. (C) 2012 Elsevier B.V. All rights reserved.

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

division
flexible queries
fuzzy object databases
inclusion


Supercontinuum pulse measurement by \(\hbox {KNbO}_{3}\) nanoneedle based cross-correlation frequency-resolved optical gating (XFROG) In this paper, we investigate the sum-frequency properties of potassium niobate (\(\hbox {KNbO}_{3}\)) nanoneedles. Based on the results, we achieve a rough Cross-correlation frequency-resolved optical gating (XFROG) measurement of super-continuum pulses, including the pulses time/frequency-dependent intensity. This approach is promising in several aspects: First, due to the nanometer scale, the phase matching constraint can be naturally satisfied over the wide band of SC spectra, and the phase-matching apparatus can be eliminated. Meanwhile, the phase-matching modulation is more straightforward, which makes the measurement system more accessible for common users. Therefore, our \(\hbox {KNbO}_{3}\) nanoneedles based XFROG approach provides a feasible choice for SC pulses estimation.

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

cross-correlation frequency-resolved optical gating (xfrog)


Reconstructing Popov v. Hayashi in a framework for argumentation with structured arguments and Dungean semantics In this article the argumentation structure of the courts decision in the Popov v. Hayashi case is formalised in Prakkens (Argument Comput 1:93124; 2010) abstract framework for argument-based inference with structured arguments. In this framework, arguments are inference trees formed by applying two kinds of inference rules, strict and defeasible rules. Arguments can be attacked in three ways: attacking a premise, attacking a conclusion and attacking an inference. To resolve such conflicts, preferences may be used, which leads to three corresponding kinds of defeat, after which Dungs (Artif Intell 77:321357; 1995) abstract acceptability semantics can be used to evaluate the arguments. In the present paper the abstract framework is instantiated with strict inference rules corresponding to first-order logic and with defeasible inference rules for defeasible modus ponens and various argument schemes. The main techniques used in the formal reconstruction of the case are rule-exception structures and arguments about rule validity. Arguments about socio-legal values and the use of precedent cases are reduced to arguments about rule validity. The tree structure of arguments, with explicit subargument relations between arguments, is used to capture the dependency relations between the elements of the courts decision.

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


An application adaptation layer for wireless sensor networks ? In wireless sensor networks, poor performance or unexpected behavior may be experienced for several reasons, such as trivial deterioration of sensing hardware, unsatisfactory implementation of application logic, or mutated network conditions. This leads to the necessity of changing the application behavior after the network has been deployed. Such flexibility is still an open issue as it can be achieved either at the expense of significant energy consumption or through software complexity. This paper describes an approach to adapt the behavior of running applications by intercepting the calls made to the operating system services and changing their effects at run-time. Customization is obtained through small fragments of interpreted bytecode, called adaptlets, injected into the network by the base station. Differently from other approaches, where the entire application is interpreted, adaptlets are tied only to specific services, while the bulk of the application is still written in native code. This makes our system able to preserve the compactness and efficiency of native code and to have little impact on the overall application performance. Also, applications must not be rewritten because the operating system interfaces are unaffected. The adaptation layer has been implemented in the context of TinyOS using an instruction set inspired to the Java bytecode. Examples that illustrate the programming of the adaptation layer are presented together with their experimental 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

wireless sensor network
middleware
programming support
adaptation of applications


Security requirements for e-government services: a methodological approach for developing a common PKI-based security policy The concept of one-stop on-line government is not science fiction any more. On the contrary, the high reliability and performance of communication links, combined with architectural models that facilitate transparent access to distributed computational and storage resources, propel the development of integrated e-govemment platforms that support increased citizen mobility. The price we have to pay is the complexity introduced in the design of the security mechanisms required for protecting several heterogeneous information systems-each one supporting some of the services offered through the e-govemment integrated environment-and ensuring user privacy. This paper demonstrates that the security services offered by Public Key Infrastructure (PKI) can be employed for fulfilling most of the identified security requirements for an integrated e-government platform. The list of security requirements has been compiled by adopting an organisational framework that facilitates the classification of e-govemment services according to the security requirements they exhibit. The proposed approach has been applied, as a case study, to the e-govemment system 'Webocrat', identifying its security requirements and then designing a PKI-based security architecture for fulfilling them. (C) 2003 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 B I I O O O O O O O O O O B I O O O O O O O O B I O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O

security requirements
public key infrastructure


In-place permuting and perfect shuffling using involutions Every permutation of {1, 2, ... , N} can be written as the product of two involutions. As a consequence, any permutation of the elements of an array can be performed in-place using simultaneous swaps in two rounds of swaps. In the case where the permutation is the k-way perfect shuffle, we develop two methods for efficiently computing the pair of involutions that accomplishes these swaps. The first method works whenever N is a power of k; in this case the time is O(N) and space O (log(2) N). The second method applies to the general case where N is a multiple of k; here the time is O (N log N) and the space is O (log(2) N). If k = 2 the space usage of the first method can be reduced to O (log N) on a machine that has a SADD (population count) instruction. (C) 2013 Elsevier B.V. All rights reserved.

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

algorithms
analysis of algorithms
combinatorial problems
parallel algorithms
involution


Preemptive priority-based algorithms for fuzzy minimal cost flow problem: An application in hazardous materials transportation This paper studies the minimal cost flow problem (MCFP) with fuzzy link costs, say fuzzy MCFP, to understand the effect of uncertain factors in applied shipment problems. With respect to the most possible case, the worst case and the best case, the fuzzy MCFP can be converted into a 3-objective MCFP. Applying a lexicographical ordering on the objective functions of derived problem, two efficient algorithms are provided to find the preemptive priority-based solution(s), namely p-successive shortest path algorithm and p-network simplex algorithm. In both of them, lexicographical comparison is used which is a natural ordering in many real problems especially in hazardous material transportation where transporting through some links jeopardizes people's lives. The presented schemes maintain the network structure of problem and so, they are efficiently implementable. A sample network is also given to illustrate the procedure and to compare the computational experiences with those of previously established works. Finally, the presented approach is applied to find an appropriate plan to transit hazardous materials in Khorasan roads network using annual data of accidents. (C) 2008 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

network design
fuzziness
multi-objective mcfp
risk attitude
pessimistic and optimistic viewpoints


Disjoint paths in symmetric digraphs Given a number of requests ? ? , we propose a polynomial-time algorithm for finding ? ? disjoint paths in a symmetric directed graph. It is known that the problem of finding ??2 ? ? 2 disjoint paths in a directed graph is NP-hard[S. Fortune, J. Hopcroft, J. Wyllie, The directed subgraph homeomorphism problem, Journal of Theoretical Computer Science 10 (2) (1980) 111121]. However, by studying minimal solutions it turns out that only a finite number of configurations are possible in a symmetric digraph. We use Robertson and Seymours polynomial-time algorithm[N. Robertson, P. D. Seymour, Graph minors xiii. The disjoint paths problem, Journal of Combinatorial Theory B (63) (1995) 65110] to check the feasibility of each configuration.

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


Automated compositional proofs for real-time systems We present a framework for formally proving that the composition of the behaviors of the different parts of a complex, realtime system ensures a desired global specification of the overall system. The framework is based on a simple compositional rely/guarantee circular inference rule, plus a methodology concerning the integration of the different parts into a whole system. The reference specification language is the TRIO metric linear temporal logic. The novelty of our approach with respect to existing compositional frameworks - most of which do not deal explicitly with real-time requirements - consists mainly in its generality and abstraction from any assumptions about the underlying computational model and from any semantic characterizations of the temporal logic language used in the specification. Moreover, the framework deals equally well with continuous and discrete time. It is supported by a tool, implemented on top of the proof-checker PVS, to perform deduction-based verification through theorem-proving of modular real-time axiom systems. As an example of application, we show the verification of a real-time version of the old-fashioned but still relevant "benchmark" of the dining philosophers problem. (c) 2007 Elsevier B.V. All rights reserved.

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

formal verification
modular systems
real-time
compositionality
rely/guarantee


A sign matrix based scheme for non-homogeneous PDE's with an analysis of the convergence stagnation phenomenon This work is devoted to the analysis of a finite volume method recently proposed for the numerical computation of a lass of non-homogenous systems of partial differential equations of interest in fluid dynamics. The stability analysis of the proposed scheme leads to the introduction of the sign matrix of the flux jacobian. It appears that this formulation is equivalent to the VFRoe scheme introduced in the homogeneous case and has a natural extension here to non-homogeneous systems. Comparative numerical experiments for the Shallow Water and Euler equations with source terms, and a model,problem of two-phase flow (Ransom faucet) are presented to validate the scheme. The numerical results present a convergence stagnation phenomenon for certain forms of the source term, notably when it is singular. Convergence stagnation as been also shown in the past for other numerical schemes. This issue is addressed in a specific section where an explanation is given with the help of a linear model equation, and a cure is demonstrated.) 2007 Elsevier Inc. All rights reserved.

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

finite volumes
riemann problems
srnh scheme
shallow water equations
two-phase flow


Quantifying local flow direction uncertainty Absolute elevation error in digital elevation models (DEMs) can be within acceptable National Map Accuracy standards, but still have dramatic impacts on field-level estimates of surface water flow direction, particularly in level regions. We introduce and evaluate a new method for quantifying uncertainty in flow direction rasters derived from DEMs. The method utilizes flow direction values derived from finer resolution digital elevation data to estimate uncertainty, on a cell-by-cell basis, in flow directions derived from coarser digital elevation data. The result is a quantification and spatial distribution of flow direction uncertainty at both local and regional scales. We present an implementation of the method using a 10-m DEM and a reference 1-m lidar DEM. The method contributes to scientific understanding of DEM uncertainty propagation and modeling and can inform hydrological analyses in engineering, agriculture, and other disciplines that rely on simulations of surface water flow.

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


Comparison theorems for higher-order neutral delay differential equations In the paper, we combine new generalization of classical Philos and Staikos lemma together with suitable comparison technique to offer new oscillation criteria for \(n\)-th order neutral delay differential equation $$\begin{aligned} \Big (r(t)\left[ z'(t)\right] ^{\gamma }\Big )^{(n-1)} +q(t)x^{\gamma }(\sigma (t))=0. \end{aligned}$$The presented technique essentially simplifies the examination of the higher order differential equations.

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


cache design of a sub-micron cmos system/370 An innovative cache accessing scheme based on high MRU (most recently used) hit ratio [1] is proposed for the design of a one-cycle cache in a CMOS implementation of System/370. It is shown that with this scheme the cache access time is reduced by 30 ~ 35\% and the performance is within 4\% of a true one-cycle cache. This cache scheme is proposed to be used in a VLSI System/370, which is organized to achieve high performance by taking advantage of the performance and integration level of an advanced CMOS technology with half-micron channel length [2]. Decisions on the system partition are based on technology limitations, performance considerations and future extendability. Design decisions on various aspects of the cache organization are based on trace simulations for both UP (uniprocessor) and MP (multiprocessor) configurations.

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

partition organization cache design performance implementation access future multiprocessor scheme

innovating traces aspect simulation systems technologies high-performance configurability timing integrability


Solution of the two dimensional second biharmonic equation with high-order accuracy Purpose - The purpose of this paper is to introduce efficient methods for solving the 2D biharmonic equation with Dirichlet boundary conditions of second kind. This equation describes the deflection of loaded plate with boundary conditions of simply supported plate kind. Also it can be derived from the calculus of variations combined with the variational principle of minimum potential energy. Because of existing fourth derivatives in this equation, introducing high-order accurate methods need to use artificial points. Also solving the resulted linear system of equations suffers from slow convergence when iterative methods are used. This paper aims to introduce efficient methods to overcome these problems. Design/methodology/approach - The paper considers several compact finite difference approximations that are derived on a nine-point compact stencil using the values of the solution and its second derivatives as the unknowns. In these approximations there is no need to define special formulas near the boundaries and boundary conditions can be incorporated with these techniques. Several iterative linear systems solvers such as Krylov subspace and multigrid methods and their combination (with suitable preconditioner) have been developed to compare the efficiency of each method and to design powerful solvers. Findings - The paper finds that the combination of compact finite difference schemes with multigrid method and Krylov iteration methods preconditioned by multigrid have excellent results for the second biharmonic equation, and that Krylov iteration methods preconditioned by multigrid are the most efficient methods. Originality/value - The paper is of value in presenting, via some tables and figures, some numerical experiments which resulted from applying new methods on several test problems, and making comparison with conventional methods.

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


generalizing operational transformation to the standard general markup language In this paper we extend operational transformation to support synchronous collaborative editing of documents written in dialects of SGML (Standard General Markup Language) such as XML and HTML, based on SGML's abstract data model, the grove. We argue that concurrent updates to a shared grove must be transformed before being applied to each replica to ensure consistency. We express grove operations as property changes on positionally-addressed nodes, define a set of transformation functions, and show how to apply an existing generic operational transformation algorithm to achieve this. This result makes synchronous group editing applicable to the modern Web.

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

sgml
web
general
group
paper
operational transformation
language
xml
support
consistency
algorithm
synchronous collaborative editing
generic

synchronization
standardization
computer supported cooperative work
change
sharing
data models
collaboration
abstraction
edit
concurrency
operability
documentation
groves
update


toward real-time image guided neurosurgery using distributed and grid computing Neurosurgical resection is a therapeutic intervention in the treatment of brain tumors. Precision of the resection can be improved by utilizing Magnetic Resonance Imaging (MRI) as an aid in decision making during Image Guided Neurosurgery (IGNS). Image registration adjusts pre-operative data according to intra-operative tissue deformation. Some of the approaches increase the registration accuracy by tracking image landmarks through the whole brain volume. High computational cost used to render these techniques inappropriate for clinical applications.In this paper we present a parallel implementation of a state of the art registration method, and a number of needed incremental improvements. Overall, we reduced the response time for registration of an average dataset from about an hour and for some cases more than an hour to less than seven minutes, which is within the time constraints imposed by neurosurgeons. For the first time in clinical practice we demonstrated, that with the help of distributed computing non-rigid MRI registration based on volume tracking can be computed intra-operatively.

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

grid computing
image registration
distributed computing


Rational quadratic approximation to real algebraic curves An algorithm is proposed to give a global approximation of an implicit real plane algebraic curve with rational quadratic B-spline curves. The algorithm consists of four steps: topology determination, curve segmentation, segment approximation and curve tracing. Due to the detailed geometric analysis, high accuracy of approximation may be achieved with a small number of quadratic segments. The final approximation keeps many important geometric features of the original curve such as the topology, convexity and sharp points. Our method is implemented and experiments show that it may achieve better approximation bound with less segments than previously known methods. We also extend the method to approximate spatial algebraic curves. (C) 2004 Elsevier B.V. All rights reserved.

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


DTRAB: Combating Against Attacks on Encrypted Protocols Through Traffic-Feature Analysis The unbridled growth of the Internet and the network-based applications has contributed to enormous security leaks. Even the cryptographic protocols, which are used to provide secure communication, are often targeted by diverse attacks. Intrusion detection systems (IDSs) are often employed to monitor network traffic and host activities that may lead to unauthorized accesses and attacks against vulnerable services. Most of the conventional misuse-based and anomaly-based IDSs are ineffective against attacks targeted at encrypted protocols since they heavily rely on inspecting the payload contents. To combat against attacks on encrypted protocols, we propose an anomaly-based detection system by using strategically distributed monitoring stubs (MSs). We have categorized various attacks against cryptographic protocols. The MSs, by sniffing the encrypted traffic, extract features for detecting these attacks and construct normal usage behavior profiles. Upon detecting suspicious activities due to the deviations from these normal profiles, the MSs notify the victim servers, which may then take necessary actions. In addition to detecting attacks, the MSs can also trace back the originating network of the attack. We call our unique approach DTRAB since it focuses on both Detection and TRAceBack in the MS level. The effectiveness of the proposed detection and traceback methods are verified through extensive simulations and Internet datasets.

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

encrypted protocol (cryptographic protocol)


Cell trees: An adaptive synopsis structure for clustering multi-dimensional on-line data streams To effectively trace the clusters of recently generated data elements in an on-line data stream, a sibling list and a cell tree are proposed in this paper. Initially, the multi-dimensional data space of a data stream is partitioned into mutually exclusive equal-sized grid-cells. Each grid-cell monitors the recent distribution statistics of data elements within its range. The old distribution statistics of each grid-cell are diminished by a predefined decay rate as time goes by, so that the effect of the obsolete information on the current result of clustering can be eliminated without maintaining any data element physically. Given a partitioning factor h, a dense grid-cell is partitioned into h equal-size smaller grid-cells. Such partitioning is continued until a grid-cell becomes the smallest one called a unit grid-cell. Conversely, a set of consecutive sparse grid-cells can be merged into a single grid-cell. A sibling list is a structure to manage the set of all grid-cells in a one-dimensional data space and it acts as an index for locating a specific grid-cell. Upon creating a dense unit grid-cell on a one-dimensional data space, a new sibling list for another dimension is created as a child of the grid-cell. In such a way, a cell tree is created. By repeating this process, a multi-dimensional dense unit grid-cell is identified by a path of a cell tree. Furthermore, in order to confine the usage of memory space, the size of a unit grid-cell is adaptively minimized such that the result of clustering becomes as accurate as possible at all times. The proposed method is comparatively analyzed by a series of experiments to identify its various characteristics.

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

data mining
grid-based clustering
adaptive memory utilization


Flexible software for condition monitoring, incorporating novelty detection and diagnostics Condition monitoring and machinery fault diagnosis are central to the implementation of efficient maintenance management strategies. They can be based on empirical modelling, which aims at associating measured data to machine conditions. Arguably, different monitoring tasks present different challenges to the maintenance engineer. This paper presents the development of a flexible software solution for condition monitoring, novelty identification and machinery diagnostics, which can easily be customised to a wide range of monitoring scenarios. Its main constituents are a number of independent software modules, such as the fault and symptom tree, the fuzzy classification module, the novelty detection and the neural network diagnostics sub-systems. It is implemented on two different applications, namely machine tool monitoring and gearbox monitoring. (C) 2006 Elsevier B.V. All rights reserved.

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

condition monitoring
fault diagnosis
novelty detection


Topological characterization of neuronal arbor morphology via sequence representation: I - motif analysis The morphology of neurons offers many insights into developmental processes and signal processing. Numerous reports have focused on metrics at the level of individual branches or whole arbors; however, no studies have attempted to quantify repeated morphological patterns within neuronal trees. We introduce a novel sequential encoding of neurite branching suitable to explore topological patterns.

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


rCOS: A refinement calculus of object systems This article presents a mathematical characterization of object-oriented concepts by defining an observation-oriented semantics for a relational object-based language with a rich variety of features including subtypes, visibility, inheritance, type casting, dynamic binding and polymorphism. The language can be used to specify object-oriented designs as well as programs. We present a calculus that supports both structural and behavioural refinement of object-oriented designs. The design calculus is based on the predicate logic in Hoare and He's Unifying Theories of Programming (UTP). (c) 2006 Elsevier B.V. All rights reserved.

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


Optimal repair of degrading computers under asymmetric information and incentive incompatibility This paper presents the optimal repair policy of a firm's fault-tolerant computer system where asymmetric information and incentive incompatibility problems in allocating the computing resources are prevalent. Traditional maintenance optimization theory focuses on optimization models for repair, replacement, and inspection of machines (computers) subject to breakdowns or deterioration, without considering the allocation of such resources. Likewise, performance evaluation literature of fault-tolerant computers concentrates on deriving reliability and availability measures. This paper is a first attempt to jointly examine both the resource allocation and repair problems of a firm's fault-tolerant computer system. This paper presents the optimal repair policy of a firm's computer system in the presence of asymmetric information and incentive incompatibility. It applies the resource allocation model developed by Cheng et al. [Cheng, H. K., Freimer, M., Richmond, W., Sumita, U., Optimal allocation and backup of computer resources under asymmetric information and incentive incompatibility. European Journal of Operational Research, 1992, 91, 411426] to analyze the impact of asymmetric information and incentive incompatibility on the repair policy of a firm's fault-tolerant computer system whose capacity degrades over time. A general methodology is presented for deriving the optimal repair policy for the firm's computer system by integrating the results from the resource allocation problem and the stochastic model describing the degrading capacity behavior of the computer system. The optimal repair policy is demonstrated via numerical results that offer useful insights. In particular, the conventional wisdom of having a largest asymptotic expected computer capacity does not guarantee a desirable long-run minimum cost to the organization.

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

asymmetric information
resource allocation

optimal repair of computer system
stochastic processes


The Research of Differentiated Service and Load Balancing in Web Cluster Differentiated service, as a key solution to meet the heterogenicity of Web clients' QoS requirements, has been widely used to optimize the server utilization without over-providing resources. Based on the relative differentiated service, this paper treats the application of proportional delay as a optimal control problem, and focuses on the cluster-side architecture improvement as well as QoS controller design. A load balancing Web cluster architecture supported differentiated service is proposed and implemented. By system identification and resource optimal control, the front-end dispatcher could adjust the resource quotas assigned to different classes in every single back-end server, and Multi-class based Maximum Idle First load balancing strategy is designed to ensure a fair resource consumption among back-end nodes. As a result, the end-to-end delay is controlled and proportional delay is guaranteed. The experiments demonstrate that no matter using Round-Robin, Least Connection Scheduling or Maximum Idle First load balancing strategy, the proposed resource optimal controller could hold the relationship among different classes. Compared to Round-Robin and Least Connection First Scheduling, Maximum Idle First strategy increases the cluster throughput by 33% and reduces the average delay by 21%.

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

differentiated service
maximum idle first
load balancing


Study of surface bonding imperfection effects on equivalent identified dynamic Youngs and shear moduli using a modal based joint identification method This paper analyses the fault effect on the mechanical properties of structural adhesive. Dynamic characteristics of adhesive for healthy and faulty cases were identified. Adhesive debonding failure as small as 5% of bonding area was successfully detected.

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

dynamic youngs and shear moduli
joint identification

adhesive joint
debond effect
experimental modal analysis


CombNET-III: A support vector machine based large scale classifier with probabilistic framework Several research fields have to deal with very large classification problems, e.g. handwritten character recognition and speech recognition. Many works have proposed methods to address problems with large number of samples, but few works have been done concerning problems with large numbers of classes. CombNET-II was one of the first methods proposed for such a kind of task. It consists of a sequential clustering VQ based gating network (stem network) and several Multilayer Perceptron (MLP) based expert classifiers (branch networks). With the objectives of increasing the classification accuracy and providing a more flexible model, this paper proposes a new model based on the CombNET-II structure. the CombNET-III. The new model, intended for, but not limited to, problems with large number of classes, replaces the branch networks MLP with multiclass Support Vector Machines (SVM). It also introduces a new probabilistic framework that outputs posterior class probabilities, enabling the model to be applied in different scenarios (e.g. together with Hidden Markov Models). These changes permit the use of a larger number of smaller clusters, which reduce the complexity of the final classifiers. Moreover, the use of binary SVM with probabilistic outputs and a probabilistic decoding scheme permit the use of a pairwise output encoding on the branch networks, which reduces the computational complexity of the training stage. The experimental results show that the proposed model outperforms both the previous model CombNET-II and a single multiclass SVM. while presenting considerably smaller complexity than the latter. It is also confirmed that CombNET-III classification accuracy scales better with the increasing number of clusters, in comparison with CombNET-II.

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

support vector machines
probabilistic framework

large scale classification problems
divide-and-conquer


Switchable cantilever fabrication for a novel time-of-flight scanning force microscope We describe a cantilever device for a novel time-of-flight scanning force microscopy (TOF-SFM) concept. The cantilever device consists of a switchable cantilever (SC), a microfabricated extraction electrode, and an Interlocking microstage. It allows quasi-simultaneous topographical and chemical imaging of a sample surface to be performed in the same way as with conventional scanning probe techniques. This is achieved by the micromachined SC with a bimorph actuator that provides a reasonable switching speed. Secondly, a short tip-electrode distance to minimize the ion extraction voltage can be realized by the help of the Interlock type assembling. The measured SC tip deflection is ?100 ?m at 35 mW, corresponding to an estimated heater temperature of ?250C. The maximum switching speed between the two modes is ?50 ms, and the sensitivity ?R/R of an integrated piezoresistive deflection sensor is ?6.710?7/nm. The tipelectrode distance is only 10 mm. The TOF-SFM system is currently being integrated in an ultra-high-vacuum system to perform first experiments.

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

switchable cantilever
scanning force microscopy

atomic imaging
time-of-flight
scanning tunneling microscopy


Context-Aware Uplink Resource Allocation Using Request Header Information for ertPS Services in IEEE 802.16e Networks In this paper, we propose a simple and effective way to improve the quality of service (QoS) of uplink resource allocation for the extended-real-time polling service (ertPS) in IEEE 802.16e broadband wireless networks. The primitive ertPS algorithm determines the amount of resources allocated to a given subscriber station only according to the requested volume in current polling cycles regardless of the knowledge of demand trend. This trend is continuously increasing or declining, which may be incomplete to truly reflect reasonable resource allocation for subscriber stations in different demand tendencies. To cope with this problem, we developed a context-aware ertPS algorithm which gathers statistics on the numbers of request headers of medium access control layer management messages among various subscriber stations, and thus uses the statistical information to enable a dynamic allocation of additional uplink resources to subscriber stations with continuously increasing bandwidth demands. The simulation results show that in comparison with the original ertPS algorithm, the proposed context-aware resource allocation scheme is effective to increase the data throughput as well as to decrease the packet loss rate and packet delay so that the user-perceived QoS can be improved.

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

extended real-time polling service (ertps)


Imaging performance of A-PET: A small animal PET camera The evolution of positron emission tomography (PET) imaging for small animals has led to the development of dedicated PET scanner designs with high resolution and sensitivity. The animal PET scanner achieves these goals for imaging small animals such as mice and rats. The scanner uses a pixelated Anger-logic detector for discriminating 2 x 2 X 10 mm(3) crystals with 19-mm-diameter photomultiplier tubes. With a 19.7-cm ring diameter, the scanner has an axial length of 11.9 cm and operates exclusively in three-dimensional imaging mode, leading to very high sensitivity. Measurements show that the scanner design achieves a spatial resolution of 1.9 mm at the center of the field-of-view. Initially designed with gadolinium orthosilicate but changed to lutetium-yttrium orthosilicate, the scanner now achieves a sensitivity of 3.6% for a point source at the center of the field-of-view with an energy window of 250-665 keV. Iterative image reconstruction, together with accurate data corrections for scatter, random, and attenuation, are incorporated to achieve high-quality images and quantitative data. These results are demonstrated through our contrast recovery measurements as well as sample animal studies.

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

anger detector with gadolinium orthosilicate (gso) or lutetium-yttrium orthosilicate (lyso)

animal positron emission tomography (pet) imaging


Optimization model for handoff-aware channel assignment problem for multi-radio wireless mesh networks Optimal channel assignment (CA) in multi-radio wireless mesh networks is an NP-hard problem for which solutions usually leave several links interfering. Most of these solutions usually consider the overall throughput as the main optimization objective. However, other objectives have to be considered in order to provide better quality wireless connections to non stationary users. In this paper, we propose a multi-objective optimization model that, besides maximizing throughput, improves fairness and handoff experience of mesh clients. In this model, we use the Jains index to maximize users fairness and we allow same-channel assignments to links involved in the same high handoff traffic, thus reducing handoff-triggered re-routing characterized by its high latency. Then, we propose a centralized variable neighborhood search and a Tabu search heuristics to efficiently solve our model as an offline CA process. Moreover, in order to adapt to traffic dynamics caused especially by user handoffs, we propose an online CA scheme that carefully re-assigns channels to interfaces with the purpose of continuously minimizing the re-routing overhead/latency during user handoffs. We further improve this online scheme using load balancing. Simulation results show the good performance of our proposed approach in terms of delay, loss rate, overall throughput and fairness. Particularly, performance results of our online handoff-aware CA show the effectiveness of handoffs not involving path re-routing in decreasing the delay, especially when considering load balancing.

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

network management
wireless communication
wireless mesh network


Asymptotic synchronization of the Colpitts oscillator In this paper we deal with the observer-based asymptotic synchronization problem for a class of chaotic oscillators. Some results based on a differential algebraic approach are used in order to determine the algebraic observability of unknown variables. The strategy consists of proposing a slave system (observer) which tends to follow asymptotically the master system. The methodology is tested in the real-time asymptotic synchronization of the Colpitts oscillator by means of a proportional reduced order observer (PROO) of free-model type.

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

colpitts oscillator
reduced order observer

chaotic systems
real-time asymptotic synchronization


Augmented & Virtual Reality applications in the field of logistics Changing basic conditions in the field of logistics requires intuitive planning methods as well as new ways of supporting and educating the operative staff. VR and AR show a great promise for that.

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

order picking
process planning
augmented reality


QoS-based dissemination of content in Grids This paper proposes a bio-inspired approach tailored to the construction of a Grid information system in which content, specifically metadata descriptors that specify the characteristics of Grid resources, is disseminated and logically reorganized on the Grid. Content management is achieved through the collective activity of a large number of ant-like agents, which perform simple operations at the local level, but together engender an advanced form of swarm intelligence at the global level. Agents travel the Grid through P2P interconnections and use probability functions to (i) replicate resource descriptors and (ii) collect similar descriptors in nearby Grid hosts. Simulation analysis shows that the proposed ARMAP protocol (Ant-based Replication and MApping Protocol) is capable of reducing the entropy of the system and efficiently propagating content. Furthermore, ARMAP allows to enforce the dissemination of descriptors related to high Quality of Service (QoS) resources. The Grid information system built with the proposed protocol enables the use of a semi-informed discovery algorithm which drives query messages towards representative peers that maintain information about high QoS resources having the required characteristics.

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

agents
grid
information system
p2p
swarm intelligence


FUSION OF EXTREME LEARNING MACHINE WITH FUZZY INTEGRAL Extreme learning machine (ELM) is an efficient and practical learning algorithm used for training single hidden layer feed-forward neural networks (SLFNs). ELM can provide good generalization performance at extremely fast learning speed. However, ELM suffers from instability and over-fitting, especially on relatively large datasets. Based on probabilistic SLFNs, an approach of fusion of extreme learning machine (F-ELM) with fuzzy integral is proposed in this paper. The proposed algorithm consists of three stages. Firstly, the bootstrap technique is employed to generate several subsets of original dataset. Secondly, probabilistic SLFNs are trained with ELM algorithm on each subset. Finally, the trained probabilistic SLFNs are fused with fuzzy integral. The experimental results show that the proposed approach can alleviate to some extent the problems mentioned above, and can increase the prediction accuracy.

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

extreme learning machine
fuzzy integral
probabilistic slfns


Performance comparisons of the image quality evaluation techniques in Wireless Multimedia Sensor Networks Recent developments with the integration of new vision capabilities into the wireless sensor devices have resulted in the necessity of investigating the behavior of well known image quality evaluation techniques in Wireless Multimedia Sensor Networks (WMSN). Wireless sensor devices can collect process and evaluate image data with a camera module. These devices can also monitor the image quality in order to take some adaptive precautions at the communications layer protocols and thus guarantee application layer quality requirements. In order to evaluate the transmitted image quality results more accurately, its imperative to analyze the factors which lead to change in behaviors of existing image quality evaluation techniques. In this work, the effect of the transmission distortions, packet size, link and node correlation on the image quality evaluation are highlighted. The success of prevalent image quality metrics is also examined with emphasis on whether these metrics can reflect implicitly the region of interest (ROI) information in an image. Furthermore, a simple metric is proposed to estimate an image quality on the fly by considering the ROI parts of the image and using only the average of the packets and their priority level. This study leads to explore smart ways for the adaptation of the communication protocols to the wireless environment.

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

image quality
roi
region of interest
wmsn
correlation

psnr
wsnr
vif
block based weighted psnr
wireless sensor networks
wsn