automated design of operational transconductance amplifiers using reversed geometric programming We present a method for designing operational amplifiers using reversed geometric programming, which is an extension of geometric programming that allows both convex and non-convex constraints. Adding a limited set of non-convex constraints can improve the accuracy of convex equation-based optimization, without compromising global optimality. These constraints allow increased accuracy for critical modeling equations, such as the relationship between gm and I DS . To demonstrate the design methodology, a folded-cascode amplifier is designed in a [0.18]?m technology for varying speed requirements and is compared with simulations and designs obtained from geometric programming.

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

operational transconductance amplifiers
reversed geometric programming


Oscillation theorems for certain nonlinear differential equations of second order We present new oscillation criteria for the second-order nonlinear differential equations. These criteria involve the use of averaging functions. Our theorems are stated in general form; they complement and extend related results known in the literature. Also, the relevance of our results is to show that some of Manojlovic's results contain the superfluous condition. (C) 2004 Elsevier Ltd. All rights reserved.

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


Reduced curvature formulae for surfaces, offset surfaces, curves on a surface and surface intersections ? Reduced curvature formulae are presented, namely, formulae entailing only derivatives of the functions involved in the entity's representation. Reduced curvature formulae are more efficient compared to unreduced formulae. Formulae are presented for curves on a surface and for surface intersection curves, in all representation modes of the surfaces. Formulae are also presented for the normal curvature of offset surfaces and for the curvature of intersection curves of offset surfaces.

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

curvature of intersection curves of surfaces

curvature of intersection curves of offset (parallel) surfaces


Numerical studies of a granular gas in a host medium The nonlinear dissipative Boltzmann equation for an granular gas diffusing in a elastically scattering host medium is investigated and numerically solved by means of direct stochastic simulation. The procedure requires an appropriate treatment of the two collision integrals involved, and of their different features. The algorithm is first tested versus exact results for macroscopic moments worked out in the Maxwellian-pseudo-molecules approximation, and then it is applied to the more realistic collision model of hard spheres for both elastic and inelastic encounters. When collisions with background are dominant, reliability of some hydrodynamic closures is then discussed by comparison of their outputs to the kinetic results achieved by the present DSMC approach.

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


Designing and evaluating a workstation in real and virtual environment: toward virtual reality based ergonomic design sessions This paper adresses the issue of properly designing a digital mock-up (DMU) to be used in an experiment comparing simulated assembly tasks in both real and virtual environments. Motivations and specifications relative to the experiment are reported, and the design process of the DMU is described and illustrated. Recommendations are proposed with a particular focus on specificities relative to the use of a DMU as a support for both manufacturing and virtual reality3D visualisation and interaction. A subjective evaluation of Real (RE), Virtual (VE), and Virtual with Force Feedback (VEF) environments is provided. Results indicate a real sensory and difficulty gap between RE and VEF, whereas a smaller difference was observed between RE and VE. In further improvements of scale-1 (where the objects in VE have the same size as in the real environment), co-localized simulation using haptic devices are warranted to fill in this gap. Results also highlight the impact of cognition and sensory feedback on users feeling and presence sensation. Applications of such numerical designs are presented in the last section, especially focusing on collaborative design sessions. Virtual Reality based evaluation of newly designed workstations will be a way in the future to improve design and user learning processes.

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


a runtime representation for ada variables and types The type and subtype facilities of the Ada programming language permit some subtype information to be determined dynamically. This subtype information requires a runtime representation, and its dynamic nature influences the representation of variables. In this paper, we first review Ada's types and subtypes to identify some of those aspects which affect runtime representation. We then present the particular representation scheme which is used in the CHARRETTE Ada implementation. The scheme is straightforward and consistent in that a variable is represented the same way independently of where it appears, whether it is on the stack, on the heap, or a component of another variable. The design treats Ada's discriminants and discriminant constraints as a form of parameterized types, where the parameterization permits different instances of a type to have different variants and different sizes for array fields. Composition of such parameterized types is supported. We explain how several Ada operations are handled by our particular representation. We briefly discuss some alternative approaches to Ada representation, comparing them to our design.

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

review
affect
dynamic
design
types
parameterization
implementation
representation
paper
runtime
subtype
scheme
component
programming language

variability aspect influence arrays operability consistency constraint informal compositing


A spatial temporal decision framework for adaptation to sea level rise There is a strong link between decision making and environmental stresses. Two dilemmas confront decision makers: how and when to adapt to sea level rise, due to complexities of environmental systems and the changing nature of the decision making process. This process is inherently complex and often involves many stakeholders with conflicting views. Considering the complexity and dynamic nature of coastal systems, this paper introduces a Spatial Temporal Decision framework to assess coastal vulnerability, and the adaptation alternatives to SLR. The STD is based upon a combination of: System Dynamics modelling; Geographical Information Systems modelling; and multicriteria analyses of stakeholders' views using the Analytical Hierarchy Process. For case study analyses, the City of the Gold Coast located in Southeast Queensland, Australia has been selected. The results of the vulnerability assessment indicate that, at the end of a 100 year simulation period, approximately 6% of the landscape in the study area will be gradually inundated over time, with 0.5 cm rise per year. However, the percentage of the vulnerable area leapt to about 34% for Scenario 2, and 56% for Scenario 3, which represent 1 cm and 1.5 cm rise per year. Using the information obtained from vulnerability assessments, three stakeholder groups (Politicians, Experts and Residents) were consulted to determine the goal, criteria and adaptation alternatives for the multicriteria analyses. Analyses of survey data reveal that across the three stakeholder groups, Effectiveness and Sustainability are the criteria of highest priority. (C) 2013 Elsevier Ltd. All rights reserved.

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

decision making
sea level rise
vulnerability
adaptation


A novel hybrid image segmentation method Swarm intelligence algorithms have been extensively used in clustering-based applications, e.g., image segmentation, which is one of the fundamental components in image analysis and pattern recognition domains. Particle swarm optimization (PSO) is among swarm intelligence algorithms that perform based on population and random search. In this paper, a hybrid algorithm based on PSO, \(k\)-means, and learning automata is proposed for image segmentation. Each particle in the proposed method has been equipped with a learning automata (LA). In fact, each particle can either update its position by PSO method or select the next position utilizing \(k\)-means approach in each iteration based on its LA. In other word, the main aim of the hybrid proposed approach was to utilize the efficiency of PSO and \(k\)-mean methods under supervision of LA. The proposed approach along with other comparative studies has been applied for segmenting standard test images. Efficiency of the proposed method has been compared with that of other methods, and experimental results show the superiority proposed algorithm.

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

image segmentation
particle swarm optimization
learning automata


continuous level-of-detail modeling of buildings in 3d city models This paper introduces a concept for representing and modeling buildings in GIS at continuous levels of quality. Buildings are essential objects of virtual 3D city models, which serve as platforms for integrated, urban geoinformation. Existing concepts for the representation of buildings are restricted to a specific level-of-quality such as block models, roof-including models, architectural models, and indoor virtual reality models. The continuous level-of-quality approach unifies the representation of heterogeneous sets of buildings, which occur in most virtual 3D city models. It also leads to a systematic method for the incremental refinement of buildings - an important requirement of the long-term management of virtual city models. In our concept, a building's geometry is structured on a per-floor basis; each floor refers to a floor prototype, which is defined by a ground plan, walls, and wall segments. To specify the appearance projective textures across floors and textures per wall segment are supported. Application-specific data can be associated similar to appearance information. These few components already allow us to express efficiently most common building features. Furthermore, the approach seamlessly integrates into CityGML, an upcoming standard for virtual city model data.

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


Shape-Direction-Adaptive Lifting-Based Discrete Wavelet Transform for Arbitrarily Shaped Segments in Image Compression In this paper, a new lifting-based shape-direction-adaptive discrete wavelet transform (SDA-DWT) which can be used for arbitrarily shaped segments is proposed. The SDA-DWT contains three major techniques; the lifting-based DWT, the adaptive directional technique, and the concept of object-based compression in MPEG-4. With SDA-DWT, the number of transformed coefficients is equal to the number of pixels in the arbitrarily shaped segment image, and the spatial correlation across sub-bands is well preserved. SDA-DWT also can locally adapt its filtering directions according to the texture orientations to improve eneryg compaction for images containing non-horizontal or non-vertical edge textures. SDA-DWT can be applied to any application that is wavelet based and the lifing technique provides much flexibility for hardware implementation. Experimental results show that, for still object images with rich orientation textures. SDA-DWT outperforms SA-DWT up to 5.88 dB in PSNR under 2.15-bpp (bit/onject pixel) condition, and reduces the bit-budget up tio 14.0%.

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

set-partitioning embedded block coder (speck)


a scalable front-end architecture for fast instruction delivery In the pursuit of instruction-level parallelism, significant demands are placed on a processor's instruction delivery mechanism. Delivering the performance necessary to meet future processor execution targets requires that the performance of the instruction delivery mechanism scale with the execution core. Attaining these targets is a challenging task due to I-cache misses, branch mispredictions, and taken branches in the instruction stream. To further complicate matters, a VLSI interconnect scaling trend is materializing that further limits the performance of front-end designs in future generation process technologies.To counter these challenges, we present a fetch architecture that permits a faster cycle time than previous designs and scales better with future process technologies. Our design, called the Fetch Target Buffer, is a multi-level fetch block-oriented predictor. We decouple the FTB from the instruction fetch and decode pipelines to afford it the fastest clock possible. Through cycle-based simulation and circuit-level delay analysis, we find that our multi-level FTB design is capable of delivering instructions 25\% faster than the best single-level BTB-based pipeline configuration. Moreover, we show that our design scales better to future process technologies than traditional single-level designs.

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

task generation simulation scale analysis performance design delay pipeline processor technologies architecture instruction clock process interconnect core future decode

challenge
streams
scalability
timing
instruction-level parallelism
buffers
cache
configurability
blocking
circuits


A note on on-line scheduling with partial information We consider a variant of on-line scheduling, where partial information on future jobs is known beforehand. Assume that the last job will be the longest (with the longest execution time). We provide the best possible on-line algorithms with competitive ratios root2 and 3/2, respectively, for m = 2 and 3, where m. is the number of machines. (C) 2002 Elsevier Science Ltd. All rights reserved.

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

machine scheduling
competitive analysis
on-line algorithm


robust position-based routing in wireless ad hoc networks with unstable transmission ranges Several papers showed how to perform routing in ad hoc wireless networks based on the positions of the mobile hosts. However, all these protocols are likely to fail if the transmission ranges of the mobile hosts vary due to natural or man-made obstacles or weather conditions. These protocols may fail because in routing either some connections are not considered which effectively results in disconnecting the network, or the use of some connections causes livelocks. In this paper, we describe a robust routing protocol that tolerates up to roughly 40\% of variation in the transmission ranges of the mobile hosts. More precisely, our protocol guarantees message delivery in a connected adhoc network whenever the ratio of the maximum transmission range to the minimum transmission range is at most ?2.

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

network
routing
ad hoc networks
use
message
variation
wireless networks
paper
robust

mobility
wireless ad hoc networks
routing protocol
connection
posit


Double U-Slots Patch Antenna for Tri-Band Wireless Systems A compact microstrip patch antenna with two U-slots shape is presented. Detailed simulation and experimental investigation are conducted to understand the behavior of the two U-slots. The proposed antenna generates three resonant frequencies at 2.7, 3.3, and 5.3 GHz. It can, therefore, be used in Worldwide Interoperability for Microwave Access compliant communication equipment. The proposed antenna has two U-slot shaped and two bridge elements to connect both shapes together to adapt the structure to the desired interest operating frequency. A comprehensive parametric study has been applied to understand the effect of each U-slot on the antenna's performance. Moreover, the current distribution for the three bands is investigated to give further understanding of the antenna behavior. The proposed antenna is verified experimentally and the simulated and measured results are in good agreement. (C) 2010 Wiley Periodicals. Inc Int J RF and Microwave CAE 20 279-285, 2010

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

double u-slot
small antenna
u-shape antenna
wimax antenna
u-slot


compiler-generated communication for pipelined fpga applications In this paper, we describe a set of compiler analyses and an implementation that automatically map a sequential and un-annotated C program into a pipelined implementation, targeted for an FPGA with multiple external memories. For this purpose, we extend array data-flow analysis techniques from parallelizing compilers to identify pipeline stages, required inter-pipeline stage communication, and opportunities to find a minimal program execution time by trading communication overhead with the amount of computation overlap in different stages. Using the results of this analysis, we automatically generate application-specific pipelined FPGA hardware designs. We use a sample image processing kernel to illustrate these concepts. Our algorithm finds a solution in which transmitting a row of an array between pipeline stages per communication instance leads to a speedup of 1.76 over an implementation that communicates the entire array at once.

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

fpgas
rapid prototyping
pipelining
high-level and architectural synthesis


matching independent global constraints for composite web services Service discovery employs matching techniques to select services by comparing their descriptions against user constraints. Semantic-based matching approaches achieve higher recall than syntactic-based ones (as they employ ontological reasoning mechanisms to match syntactically heterogeneous descriptions). However, semantic-based approaches still have problems (e.g. lack of scalability as an exhaustive search is often performed to located services conforming to constraints). This paper proposes two approaches that deal with the problem of scalability/performance for composite service location. First, services are indexed based on the values they assign to their restricted attributes (the attributes restricted by a given constraint). Then, services that assign "conforming values" to those attributes are combined to form composite services. The first proposed approach extends a local optimisation technique to perform the latter, since identifying such values is NP-hard. However, this approach returns false negatives since the local optimisation technique does not consider all the values. Hence, a second approach that derives conforming values using domain rules is defined. The used rules are returned with each composite service so that a user can understand the context in which it is retrieved. Results obtained from the experiments that varied the number of available services demonstrate that the performance of the local optimisation-based approach is 76\% better than existing semantic-based approaches and recall is 98\% higher than syntactic-based approaches.

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


An improved quantum-inspired evolutionary algorithm for coding resource optimization based network coding multicast scheme This paper investigates how to minimize the required coding resources in network-coding-based multicast scenarios. An evolutionary algorithm (MEQEA) is proposed to address the above problem. Based on quantum-inspired evolutionary algorithm (QEA), MEQEA introduces multi-granularity evolution mechanism which allows different chromosomes, at each generation, to have different rotation angle step values for update. In virtue of this mechanism, MEQEA significantly improves its capability of exploration and exploitation, since its optimization performance is no longer overly dependant upon the single rotation angle step scheme shared by all chromosomes. MEQEA also presents an adaptive quantum mutation operation which is able to prevent local search efficiently. Simulations are carried out over a number of network topologies. The results show that MEQEA outperforms other heuristic algorithms and is characterized by high success ratio, fast convergence, and excellent global-search capability.

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

multicast
network coding
evolutionary algorithm


Empirical Evaluation of Wireless Localization when Using Multiple Antennas We show that signal strength variability can be reduced by employing multiple low-cost antennas at fixed locations. We further explore the impact of this reduction on wireless localization by analyzing a representative set of algorithms ranging from fingerprint matching, to statistical maximum likelihood estimation, to threshold bounding of signal fingerprints, and to multilateration. Using an indoor wireless testbed, we provide experimental evaluation of the localization performance under multiple antennas. We found that in nearly all cases the performance of localization algorithms improved when using multiple antennas. Specifically, the median and the 90th percentile error can be reduced up to 70 percent. Additionally, we found that multiple antennas improve the localization stability significantly, up to 100 percent improvement, when there are small-scale three-dimensional movements of a mobile device around a given location.

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

indoor localization
received signal strength
multipath fading effect
ieee 802.11
ieee 802.15.4
signal-to-distance propagation model
accuracy


lock elision for read-only critical sections in java It is not uncommon in parallel workloads to encounter shared data structures with read-mostly access patterns, where operations that update data are infrequent and most operations are read-only. Typically, data consistency is guaranteed using mutual exclusion or read-write locks. The cost of atomic update of lock variables result in high overheads and high cache coherence traffic under active sharing, thus slowing down single thread performance and limiting scalability. In this paper, we present SOLERO (Software Optimistic Lock Elision for Read-Only critical sections) , a new lock implementation called for optimizing read-only critical sections in Java based on sequential locks. SOLERO is compatible with the conventional lock implementation of Java. However, unlike the conventional implementation, only critical sections that may write data or have side effects need to update lock variables, while read-only critical sections need only read lock variables without writing them. Each writing critical section changes the lock value to a new value. Hence, a read-only critical section is guaranteed to be consistent if the lock is free and its value does not change from the beginning to the end of the read-only critical section. Using Java workloads including SPECjbb2005 and the HashMap and TreeMap Java classes, we evaluate the performance impact of applying SOLERO to read-mostly locks. Our experimental results show performance improvements across the board, often substantial, in both single thread speed and scalability over the conventional lock implementation (mutual exclusion) and read-write locks. SOLERO improves the performance of SPECjbb2005 by 3-5\% on single and multiple threads. The results using the HashMap and TreeMap benchmarks show that SOLERO outperforms the conventional lock implementation and read-write locks by substantial multiples on multi-threads.

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

synchronization
just-in-time compiler
optimization
monitor


A rock-paper-scissors evolutionary algorithm for the TDMA broadcast scheduling problem In wireless ad-hoc networks, the broadcast scheduling problem (BSP) is commonly viewed as a well-known NP-complete combinatorial optimization problem. The purpose of the BSP is to achieve a transmission schedule with collision-free time slots in a time division multiple access ad-hoc network. The transmission schedule is optimized by minimizing the frame length of the node transmissions and maximizing the utilization of the shared channel. In this work, we propose a new evolutionary algorithm to solve the BSP by adopting the rock-paper-scissors dynamics found in natural systems. We use three types of species with strategies of different levels of intensification and diversification to simulate the rock-paper-scissors dynamics. Based on this evolutionary game, in which the success of one species relies on the behavior of others, the dynamic coexistence of three species can be achieved to control the balance between intensification and diversification. The experimental results demonstrate that our algorithm is efficient and effective at solving large instances of the BSP. (C) 2013 Elsevier Ltd. All rights reserved.

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

broadcast scheduling problem
time division multiple access
evolutionary algorithm

optimum transmission schedule
rock-paper-scissors


A gesture recognition system with retina-V1 model and one-pass dynamic programming ? Dynamic Programming (DP) algorithm has been studied from 1940s and successfully applied to pattern recognition fields such as continuous speech recognition, hand writing recognition, gesture recognition and so on. In this paper, we propose a novel hand gesture recognition system which includes three kinds of image processing: skin area segmentation, motion estimation by a retina-V1 model, and a gesture discrimination algorithm of One-Pass Dynamic Programming (One-Pass DP). A HSV-RGB filter is used to extract skin area in the color image, and the simple motion of hand area is estimated in eight directions by a retina-V1 model which is a computational model of primary visual cortex. Then the motions are used to compose 40 basic templates of gestures. In other words, hand gestures are considered as combinations of templates of simple motions, and One-Pass DP is used to recognize the pattern of gestures. Experiments dealt with individual and compound gestures were executed by online processing, and the results confirmed the effectiveness of the proposed system.

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


Hardness of robust network design The authors settle the complexity status of the robust network design problem in undirected graphs. The fact that the flow-cut gap in general graphs can be large, poses some difficulty in establishing a hardness result. Instead, the authors introduce a single-source version of the problem where the flow-cut gap is known to be one. They then show that this restricted problem is coNP-Hard. This version also captures, as special cases, the fractional relaxations of several problems including the spanning tree problem, the Steiner tree problem, and the shortest path problem. (C) 2007 Wiley Periodicals, Inc.

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


Approximating Rank-Width and Clique-Width Quickly Rank-width was defined by Oum and Seymour [ 2006] to investigate clique-width. They constructed an algorithm that either outputs a rank-decomposition of width at most f(k) for some function f or confirms that rank-width is larger than k in time O(vertical bar V vertical bar(9) log vertical bar V vertical bar) for an input graph G = (V, E) and a fixed k. We develop three separate algorithms of this kind with faster running time. We construct an O(vertical bar V vertical bar(4))-time algorithm with f(k) = 3k + 1 by constructing a subroutine for the previous algorithm; we avoid generic algorithms minimizing submodular functions used by Oum and Seymour. Another one is an O(vertical bar V vertical bar(3))-time algorithm with f(k) = 24k, achieved by giving a reduction from graphs to binary matroids; then we use an approximation algorithm for matroid branch-width by Hlineny [2005]. Finally we construct an O(vertical bar V vertical bar(3))-time algorithm with f(k) = 3k - 1 by combining the ideas of the two previously cited papers.

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

approximation algorithms
branch-width
clique-width
rank-width


Prediction, context, and competition in visual recognition Perception is substantially facilitated by top-down influences, typically seen as predictions. Here, we outline that the process is competitive in nature, in that sensory input initially activates multiple possible interpretations, or perceptual hypotheses, of its causes. This raises the question of how the selection of the correct interpretation from among those multiple hypotheses is achieved. We first review previous findings in support of such a competitive nature of perceptual processing, and then propose which neural regions might provide a platform for rising and using expectations to resolve this competition. Specifically, we propose that it is the rapid extraction and top-down dissemination of a global context signal from the frontal cortices, particularly the orbitofrontal cortex, that affords the quick and reliable resolution of the initial competition among likely alternatives toward a singular percept.

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

perceptual hypothesis
perceptual task
top-down
object recognition
biased competition


Localized feature selection for clustering In clustering, global feature selection algorithms attempt to select a common feature subset that is relevant to all clusters. Consequently, they are not able to identify individual clusters that exist in different feature subspaces. In this paper, we propose a localized feature selection algorithm for clustering. The proposed algorithm computes adjusted and normalized scatter separability for individual clusters. A sequential backward search is then applied to find the optimal (maybe local) feature subsets for each cluster. Our experimental results show the need for feature selection in clustering and the benefits of selecting features locally.

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

clustering
feature selection
scatter separability


A review of diffusion tensor magnetic resonance imaging computational methods and software tools In this work we provide an up-to-date short review of computational magnetic resonance imaging (MRI) and software tools that are widely used to process and analyze diffusion-weighted MRI data. A review of different methods used to acquire, model and analyze diffusion-weighted imaging data (DWI) is first provided with focus on diffusion tensor imaging (DTI). The major preprocessing, processing and post-processing procedures applied to DTI data are discussed. A list of freely available software packages to analyze diffusion MRI data is also provided.

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

diffusion spectrum imaging
diffusion kurtosis
quantification
tractography
segmentation
connectivity
brain mapping
dsi
dki
q-ball
hydi
atlas
afni
icbm
tbss
vba
spm
freesurfer
fsl
dti software


Entropy based region reducing genetic algorithm for reliability redundancy allocation in interval environment We present multi-objective genetic algorithm on reliability redundancy problem. We employ entropy constraint for system stability on redundancy allocation problem. We consider imprecise nature of the problem with interval form of model parameters. We show Pareto optimal solutions of redundancy allocation problem. We present graphical discussion on change of system for system parameters.

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

genetic algorithm
reliability
redundancy
entropy


VLSI design of memory-efficient, high-speed baseline MQ coder for JPEG 2000 The embedded block coding with optimized truncation (EBCOT) algorithm is the heart of the JPEG 2000 image compression system. The MQ coder used in this algorithm restricts throughput of the EBCOT because there is very high correlation among all procedures to be performed in it. To overcome this obstacle, a high throughput MQ coder architecture is presented in this paper. To accomplish this, we have studied the number of rotations performed and the rate of byte emission in an image. This study reveals that in an image, on an average 75.03% and 22.72% of time one and two shifts occur, respectively. Similarly, about 5.5% of time two bytes are emitted concurrently. Based on these facts, a new MQ coder architecture is proposed which is capable of consuming one symbol per clock cycle. The throughput of this coder is improved by operating the renormalization and byte out stages concurrently. To reduce the hardware cost, synchronous shifters are used instead of hard shifters. The proposed architecture is implemented on Stratix FPGA and is capable of operating at 145.9MHz. Memory requirement of the proposed architecture is reduced by a minimum of 66% compared to those of the other existing architectures. Relative figure of merit is computed to compare the overall efficiency of all architectures which show that the proposed architecture provides good balance between the throughput and hardware cost.

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

embedded block coding with optimized truncation (ebcot)


Protein Allergenicity in Mice Food allergy is an important and common health issue, and there is therefore a need to identify and characterize the sensitizing potential of novel food proteins. Approaches currently used include consideration of structural similarity to, or amino acid sequence homology with, known human allergens; immunologic (generally serologic) cross-reactivity with known allergens; and the measurement of resistance to proteolytic digestion in a simulated gastric fluid. Although these methods provide information that contributes to safety assessment, they do not provide a direct evaluation of the ability of a novel protein to cause allergic sensitization. For this reason considerable interest exists in the design and evaluation of suitable animal models that may provide a more holistic assessment of allergenic potential. The experimental strategy we have adopted is to measure allergenic activity as a function of the ability of proteins to provoke IgG and IgE antibody responses in BALB/c strain mice, a strain that is known to favor immune responses of the quality required for allergic sensitization. To date, emphasis has focused on the characterization of humoral immune responses induced following systemic exposure of mice (by intraperitoneal administration) to the test material. Under these conditions it has been found that proteins known to be associated with food allergy in humans (including peanut proteins and ovalbumin) elicit both specific IgG and IgE antibody responses, measured using enzyme-linked immunosorbant and homologous passive cutaneous anaphylaxis assays, respectively. In contrast, other proteins derived from foods believed to exhibit little or no allergenic potential (such as those derived from the potato), although immunogenic in BALB/c mice (measured as a function of IgG antibody production), either failed to induce IgE antibody responses at all or were associated with only low-grade IgE production at relatively high test concentrations. In comparative analyses, exposure of BALB/c mice to proteins by gavage was found to be less sensitive and discriminatory with respect to the induction of IgE. Experience to date indicates that the inherent sensitizing potential of novel food proteins can be evaluated on the basis of antibody responses stimulated by parenteral exposure of BALB/c strain mice.

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

protein allergenicity
ovalbumin
passive cutaneous anaphylaxis
igg antibody
ige antibody
human allergens

genetically modified crop plants
peanut agglutinin


Image denoising and decomposition with total variation minimization and oscillatory functions In this paper, we propose a new variational model for image denoising and decomposition, witch combines the total variation minimization model of Rudin, Osher and Fatemi from image restoration, with spaces of oscillatory functions, following recent ideas introduced by Meyer. The spaces introduced here are appropriate to model oscillatory patterns of zero mean, such as noise or texture. Numerical results of image denoising, image decomposition and texture discrimination are presented, showing that the new models decompose better a given image, possible noisy, into cartoon and oscillatory pattern of zero mean, than the standard ones. The present paper develops further the models previously introduced by the authors in Vese and Osher ( Modeling textures with total variation minimization and oscillating patterns in image processing, UCLA CAM Report 02-19, May 2002, to appear in Journal of Scientific Computing, 2003). Other recent and related image decomposition models are also discussed.

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

functional minimization
partial differential equations
texture modeling


On computational study of embodiment: Some remarks and an example Eco-grammar (EG-) systems are proposed as an example of a suitable formal framework for the study of some of the computationally relevant properties of the behavior of collections of embodied agents - called herds in this article sharing a common environment, and acting in it in simple ways.

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

computatrion
agent
emergence
grammar system


Combinatorics of geometrically distributed random variables: run statistics For words of length n, generated by independent geometric random variables, we consider the mean and variance, and thereafter the distribution of the number of runs of equal letters in the words. In addition, we consider the mean length of a run as well as the length of the longest run over all words of length n. (C) 2002 Elsevier Science B.V. All rights reserved.

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

generating function
limiting distribution
quasi-power theorem


SRLG Failure Localization in Optical Networks We introduce the concepts of monitoring paths (MPs) and monitoring cycles (MCs) for unique localization of shared risk linked group (SRLG) failures in all-optical networks. An SRLG failure causes multiple links to break simultaneously due to the failure of a common resource. MCs (MPs) start and end at the same (distinct) monitoring location(s). They are constructed such that any SRLG failure results in the failure of a unique combination of paths and cycles. We derive necessary and sufficient conditions on the set of MCs and MPs needed for localizing any single SRLG failure in an arbitrary graph. When a single monitoring location is employed, we show that a network must be (kappa + 2)-edge connected for localizing all SRLG failures, each involving up to links. For networks that are less than (kappa + 2)-edge connected, we derive necessary and sufficient conditions on the placement of monitoring locations for unique localization of any single SRLG failure of up to links. We use these conditions to develop an algorithm for determining monitoring locations. We show a graph transformation technique that converts the problem of identifying MCs and MPs with multiple monitoring locations to a problem of identifying MCs with a single monitoring location. We provide an integer linear program and a heuristic to identify MCs for networks with one monitoring location. We then consider the monitoring problem for networks with no dedicated bandwidth for monitoring purposes. For such networks, we use passive probing of lightpaths by employing optical splitters at various intermediate nodes. Through an integer linear programming formulation, we identify the minimum number of optical splitters that are required to monitor all SRLG failures in the network. Extensive simulations are used to demonstrate the effectiveness of the proposed monitoring technique.

O B I O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 monitoring
shared risk link group (srlg) failure


Managing the Replaceability of Web Services Using Underlying Semantics In the context of web services, service replaceability refers to the ability of substituting one service for another. With the bloom of service-oriented computing, the effective management of service replaceability is important to make the applications unaffected once the requested service cannot work. This work studies the quantitative aspect of the replaceability of web services. FCA (Formal Concept Analysis) method is applied to reveal the pairwise replaceable relationship among web services. A novel structure, called RSLattice, is proposed to index web services on the basis of the underlying semantics, and the replaceability among services at the operation level is represented accurately. It ensures that the services having mutual replaceability are organized in the same path of RSLattice. Based on this property, we can greatly reduce the search space when retrieving the replaceable services in RSLattice. Experimental evaluation shows that RSLattice is an efficient and flexible structure for service replaceability management.

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 B I O O O O O O O O O O O O O O B I O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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
data organization
data structure
semantic matching
web-based applications


Free-Viewpoint Video of Human Actors Using Multiple Handheld Kinects We present an algorithm for creating free-viewpoint video of interacting humans using three handheld Kinect cameras. Our method reconstructs deforming surface geometry and temporal varying texture of humans through estimation of human poses and camera poses for every time step of the RGBZ video. Skeletal configurations and camera poses are found by solving a joint energy minimization problem, which optimizes the alignment of RGBZ data from all cameras, as well as the alignment of human shape templates to the Kinect data. The energy function is based on a combination of geometric correspondence finding, implicit scene segmentation, and correspondence finding using image features. Finally, texture recovery is achieved through jointly optimization on spatio-temporal RGB data using matrix completion. As opposed to previous methods, our algorithm succeeds on free-viewpoint video of human actors under general uncontrolled indoor scenes with potentially dynamic background, and it succeeds even if the cameras are moving.

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

free-viewpoint video
markerless performance capture


Quantification of biofilm on flooring surface using image classification technique The deteriogenic biofilms on the outdoor-exposed surfaces of concrete structures impair the structural integrity and esthetic quality. There is a growing need for precise and reliable methods to assess the bio-deterioration in concrete structures and identify the extent of biodeposition. This study proposes statistical image analysis method and application of the neural network classification approach to quantify bio-depositories on flooring surface that is exposed to outdoor environment. The results yield percentages of various bio-depositories on the sample.

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

concrete
image classification
quantification


A non-iterative linear inverse solution for the block approach in EIT Electrical impedance tomography (EIT) is a simple, economic and healthy technique to capture images from the internal area of the body. Although EIT is cheaper and smaller than other imaging systems and requires no ionizing radiation, the resolution associated with this technique is intrinsically limited and the image reconstruction algorithms proposed up to now are not efficient enough. In addition to low resolution EIT is an ill-posed inverse problem. Block method in EIT is based on electrical properties of materials and used to enhance image resolution and also to improve the reconstruction algorithm. Recently an inverse solution for EIT based on block method has been developed, however, this method uses non-linear algorithm. The present article provides a non-iterative linear inverse solution for the block approach on EIT. Using linear equations in this new approach provides a fast algorithm and the ability to solve complicated block problems. We have assumed that the subject has a 2D rectangular shape and is made up of identical fixed size blocks and all of the particles of each block have the same electrical conductivities. It is shown by computer simulations that this linear reconstruction algorithm employing the block method results in an accurate identification.

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

inverse problem
electrical impedance tomography

computer modelling
computational method
numerical solution


Theoretical comparison between the Gini Index and Information Gain criteria Knowledge Discovery in Databases (KDD) is an active and important research area with the promise for a high payoff in many business and scientific applications. One of the main tasks in KDD is classification. A particular efficient method for classification is decision tree induction. The selection of the attribute used at each node of the tree to split the data ( split criterion) is crucial in order to correctly classify objects. Different split criteria were proposed in the literature ( Information Gain, Gini Index, etc.). It is not obvious which of them will produce the best decision tree for a given data set. A large amount of empirical tests were conducted in order to answer this question. No conclusive results were found. In this paper we introduce a formal methodology, which allows us to compare multiple split criteria. This permits us to present fundamental insights into the decision process. Furthermore, we are able to present a formal description of how to select between split criteria for a given data set. As an illustration we apply the methodology to two widely used split criteria: Gini Index and Information Gain.

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

classification
gini index
information gain
theoretical comparison


application of a perceptual speech quality metric in power control of umts In this paper, the use of a real-time perceptual speech quality metric (RTPSQM) in power control of the Universal Mobile Telecommunication System (UMTS) is investigated. It is shown that with this approach the efficiency of the power control techniques in UMTS is improved. In particular, the average Signal-to-Interference Ratio (SIR) target can be reduced by the proposed RTPSQM-based power control compared to the conventional algorithm while keeping the perceptual quality in the desired range. This benefit can be large for particular shadowing profiles

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

perceptual speech quality
power control
umts


OTseeker helps library and allied health professionals to find quality evidence efficiently Background:? Research is essential for evidence-based practice yet many health professionals do not have enough time to find research. Studies relevant to occupational therapists can be particularly difficult to find. Most search engines are broad and return a large number of irrelevant articles. Occupational Therapy Systematic Evaluation of Evidence (OTseeker) is an occupational therapy database available at http://www.otseeker.com. Developed by Australian occupational therapists, the resource aims to increase access to research and support clinical decision making. This discipline-specific database contains pre-appraised information from a variety of sources and decreases the time required to locate best evidence.

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

bibliographic
databases
education
evidence-based medicine
students


Formalisations and applications of BPMN We present two formalisations of the Business Process Modelling Notation (BPMN). In particular, we introduce a semantic model for BPMN in the process algebra CSP; we then study an augmentation of this model in which we introduce relative timing information, allowing one to specify timing constraints on concurrent activities. By exploiting CSP refinement, we are able to show some relationships between the timed and the untimed models. We then describe a novel empirical studies' model, and the transformation to BPMN, allowing one to apply our formal semantics for analysing different kinds of workflows. To provide a better facility for describing behaviour specification about a BPMN diagram, we also present a pattern-based approach using which a workflow designer could specify properties which could otherwise be difficult to express. Our approach is specifically designed to allow behavioural properties of BPMN diagrams to be mechanically verified via automatic model checking as provided by the FDR tool. We use two examples to illustrate our approach. (C) 2009 Elsevier B.V. All rights reserved.

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

business process
csp
model checking
refinement
semantics
workflow


Negatively correlated firing: the functional meaning of lateral inhibition within cortical columns Lateral inhibition is a well documented aspect of neural architecture in the main sensory systems. Existing accounts of lateral inhibition focus on its role in sharpening distinctions between inputs that are closely related. However, these accounts fail to explain the functional role of inhibition in cortical columns, such as those in V1, where neurons have similar response properties. In this paper, we outline a model of position tracking using cortical columns of integrate-and-fire and Hodgkin-Huxley-type neurons which respond optimally to a particular location, to show that negatively correlated firing patterns arise from lateral inhibition in cortical columns and that this provides a clear benefit for population coding in terms of stability, accuracy, estimation time and neural resources.

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

inhibition
population coding
position tracking


Switched-current circuits test using pseudo-random method A built in Pseudo-Random sequence testing for testing embedded switched-current filters is described in this paper. The generation approach of Pseudo-Random sequence and the match for z functions of switched-current filters is analyzed and calculated. Taking into account of the connection between special structural problems and CMOS's parameters in switched current circuits such as the drain-gate capacitance C-dg, gate-source capacitance C-gs and transconductance gm., a integrated fault model for testing is constituted. A 6-order switched-current low-pass filter has been tested based on catastrophic and parametric fault models. The technique does not intrude into the actual design of the switched-current blocks, Pseudo-Random sequence generated from existing digital hardware and analogue output pins are not required.

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


Convergent innovation for sustainable economic growth and affordable universal health care: innovating the way we innovate This paper introduces convergent innovation (CI) as a form of meta-innovationan innovation in the way we innovate. CI integrates human and economic development outcomes, through behavioral and ecosystem transformation at scale, for sustainable prosperity and affordable universal health care within a whole-of-society paradigm. To this end, CI combines technological and social innovation (including organizational, social process, financial, and institutional), with a special focus on the most underserved populations. CI takes a modular approach that convenes around roadmaps for real world changea portfolio of loosely coupled complementary partners from the business community, civil society, and the public sector. Roadmaps serve as collaborative platforms for focused, achievable, and time-bound projects to provide scalable, sustainable, and resilient solutions to complex challenges, with benefits both to participating partners and to society. In this paper, we first briefly review the literature on technological innovation that sets the foundations of CI and motivates its feasibility. We then describe CI, its building blocks, and enabling conditions for deployment and scaling up, illustrating its operational forms through examples of existing CI-sensitive innovation.

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

convergent innovation
agriculture
vulnerability
industrialization
collaborative interdependence


dependency-aware reordering for parallelizing query optimization in multi-core cpus The state of the art commercial query optimizers employ cost-based optimization and exploit dynamic programming ( DP ) to find the optimal query execution plan ( QEP ) without evaluating redundant sub-plans. The number of alternative QEP s enumerated by the DP query optimizer can increase exponentially, as the number of joins in the query increases. Recently, by exploiting the coming wave of multi-core processor architectures, a state of the art parallel optimization algorithm [14], referred to as PDP sva , has been proposed to parallelize the "time-consuming" DP query optimization process itself. While PDP sva significantly extends the practical use of DP to queries having up to 20-25 tables, it has several limitations: 1) supporting only the size-driven DP enumerator, 2) statically allocating search space, and 3) not fully exploiting parallelism. In this paper, we propose the first generic solution for parallelizing any type of bottom-up optimizer, including the graph-traversal driven type, and for supporting dynamic search allocation and full parallelism. This is a challenging problem, since recently developed, state of art DP optimizers such as DP cpp [21] and DP hyp [22] are very difficult to parallelize due to tangled dependencies in the join pairs they generate. Unless the solution is very carefully devised, a lot of synchronization conflicts are bound to occur. By viewing a serial bottom-up optimizer as one which generates a totally ordered sequence of join pairs in a streaming fashion, we propose a novel concept of dependency-aware reordering , which minimizes waiting time caused by dependencies of join pairs. To maximize parallelism, we also introduce a series of novel performance optimization techniques: 1) pipelining of join pair generation and plan generation; 2) the synchronization-free global MEMO; and 3) threading across dependencies. Through extensive experiments with various query topologies, we show that our solution supports any type of bottom up optimization, achieving linear speedup for each type. Despite the fact that our solution is generic, due to sophisticated optimization techniques, our generic parallel optimizer outperforms PDP sva tailored to size-driven enumeration. Experimental results also show that our solution is much more robust than PDP sva with respect to search space allocation.

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


LOGICAL CHARACTERIZATION OF RECOGNIZABLE SETS OF POLYNOMIALS OVER A FINITE FIELD The ring of integers and the ring of polynomials over a finite field share a lot of properties. Using a bounded number of polynomial coefficients, any polynomial can be decomposed as a linear combination of powers of a non-constant polynomial P playing the role of the base of the numeration. Having in mind the theorem of Cobham from 1969 about recognizable sets of integers, it is natural to study P-recognizable sets of polynomials. Based on the results obtained in the Ph.D. thesis of the second author, we study the logical characterization of such sets and related properties like decidability of the corresponding first-order theory.

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

recognizable set
first-order logic
polynomial over a finite field
cobham's theorem


Nested splitting conjugate gradient method for matrix equation AXB = C and preconditioning In this paper, we present a nested splitting conjugate gradient (NSCG) iteration method for solving a class of matrix equations with nonsymmetric coefficient matrices. This method is actually inner/outer iterations, which employs a CG-like method as inner iteration to approximate each outer iterate, while each outer iteration is induced by a convergent and symmetric positive definite splitting of the coefficient matrices. Convergence conditions of this method are studied in depth and numerical experiments show the efficiency of this method. Moreover, we show that the use of the quasi-Hermitian splitting as a pre-conditioner can induce an accurate, robust and effective preconditioned Krylov subspace method. (C) 2013 Elsevier Ltd. All rights reserved.

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

conjugate gradient
matrix equations
preconditioning


workload-adaptive process tuning strategy for power-efficient multi-core processors As more devices are integrated with technology scaling, reducing the power consumption of both high-performance and low-power processors has become the first-class design constraint. Reducing power consumption while satisfying required performance is critical for increasing the operating time of mobile devices and lowering the operating cost of offices and data centers. Meanwhile, dynamic voltage and frequency scaling (DVFS) and clock-gating (CG) techniques have been widely used for two of the most powerful techniques to reduce the power consumption of such processors. Depending on performance and power demands, a processor runs at various performance and power states to trade power with performance. In this paper, we propose process tuning strategy to minimize the average power consumption of multi-core processors that use the DVFS and CG techniques, while providing the same maximum performance. The proposed optimization method incorporates with workload characteristics of commercial high-performance and low-power multi-core processors. The experimental results show that our optimized 32nm technologies for workstation, mobile, and server multi-core processors minimize the average power by up to 13, 18, and 9\%, respectively.

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

multi-core processor
process parameter tuning


Theoretical studies on the interaction of partial agonists with the 5-HT2A receptor A series of 51 5-HT2A partial agonistic arylethylamines (primary or benzylamines) from different structural classes (indoles, methoxybenzenes, quinazolinediones) was investigated by fragment regression analysis (FRA), docking and 3D-QSAR approaches. The data, pEC(50) values and intrinsic activities (E-max) on rat arteries, show high variability of pEC(50) from 4 to 10 and of E-max from 15 to 70%. FRA indicates which substructures affect potency or intrinsic activity. The high contribution of halogens in para position of phenethylamines to pEC(50) points to a specific hydrophobic pocket. Other results suggest the significance of hydrogen bonds of the aryl moiety for activation and the contrary effect of benzyl groups on affinity (increasing) and intrinsic activity (decreasing). Results from fragment regression and data on all available mutants were considered to derive a common binding site at the rat 5-HT2A receptor. After generation and MD simulations of a receptor model based on the beta(2)-adrenoceptor structure, typical derivatives were docked, leading to the suggestion of common interactions, e.g., with serines in TM3 and TM5 and with a cluster of aromatic amino acids in TM5 and TM6. The whole series was aligned by docking and minimization of the complexes. The pEC(50) values correlate well with Sybyl docking energies and hydrophobicity of the aryl moieties. With this alignment, CoMFA and CoMSIA approaches based on a training set of 36 and a test set of 15 compounds were performed. The correlation of pEC(50) with steric, electrostatic, hydrophobic and H-bond acceptor fields resulted in sufficient fit (q (2): 0.75-0.8, r (2): 0.92-0.95) and predictive power (r (pred) (2) : 0.85-0.88). The important interaction regions largely reflect the patterns provided by the putative binding site. In particular, the fit of the aryl moieties and benzyl substituents to two hydrophobic pockets is evident.

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


R&D dynamics and scientific breakthroughs in HIV/AIDS drugs development: the case of Integrase Inhibitors Transformations and applications of scientific knowledge into new technologies are usually complex interactive processes. Is it possible to detect, from bibliographic information alone, structural alterations and significant events within these processes that may indicate breakthrough discoveries? In this empirical study we focus on R&D processes leading to HIV/AIDS medicines called Integrase Inhibitors. Where scientific progress and discoveries are reflected in research papers, patents signify inventions and technological achievements. Our temporal analysis of distinctive events in this R&D area, tracing trends within both bibliographic information sources, is driven by three bibliometric indicators: (1) contributions of bridging researchers who are also inventors, (2) key papers that subject experts in the field considered milestones in the research process, and (3) the multidisciplinary impact of those papers. The main results indicate that a combination of key papers, bridging researchers and multidisciplinary impact might help track potential Charge type breakthrough developments.

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

bridging researchers
scientific breakthroughs


Instance Chains: Type Class Programming Without Overlapping Instances Type classes have found a wide variety of uses in Haskell programs, from simple overloading of operators (such as equality or ordering) to complex invariants used to implement type-safe heterogeneous lists or limited subtyping. Unfortunately, many of the richer uses of type classes require extensions to the class system that have been incompletely described in the research literature and are not universally accepted within the Haskell community. This paper describes a new type class system, implemented in a prototype tool called ilab, that simplifies and enhances Haskell-style type-class programming. In ilab, we replace overlapping instances with a new feature, instance chains, allowing explicit alternation and failure in instance declarations. We describe a technique for ascribing semantics to type class systems, relating classes, instances, and class constraints (such as kind signatures or functional dependencies) directly to a set-theoretic model of relations on types. Finally, we give a semantics for ilab and describe its implementation.

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

type classes
overlapping instances
haskell

design
languages
qualified types
fucntional dependencies


Two-stage classification of respiratory sound patterns The classification problem of respiratory sound signals has been addressed by taking into account their cyclic nature, and a novel hierarchical decision fusion scheme based on the cooperation of classifiers has been developed. Respiratory signals from three different classes are partitioned into segments, which are later joined to form six different phases of the respiration cycle. Multilayer perceptron classifiers classify the parameterized segments from each phase and decision vectors obtained from different phases are combined using a nonlinear decision combination function to form a final decision on each subject. Furthermore a new regularization scheme is applied to the data to stabilize training and consultation.

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

auscultation
respiratory sounds
feature extraction
multistage classification


End-to-End Service Support for Mashups We propose a service-oriented approach to generate and manage mashups. The proposed approach is realized using the Mashup Services System (MSS), a novel platform to support users to create, use, and manage mashups with little or no programming effort. The proposed approach relieves users from programming-intensive, error-prone, and largely nonreusable output process for creating and maintaining mashups. We describe the overall design of MSS and discuss and evaluate its main enabling technologies.

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

web 2.0
infrastructure
life-cycle management


Two conflict potentials during IS development Within the context of human functioning, this study proposes two conflict potentials that possibly occur during IS development users substantive dissension and emotional hostility. Results show that negative outcomes from the process are not due to the conflict between users and developers, but rather are linked to the two potentials. That is, the construct for conflict potential is distinct from the construct for conflict itself. Our results also indicate that the negative effects of user substantive dissension may be ameliorated by user participation. We qualify the results by pointing out that societal and environmental differences between the Taiwanese sample population and analogous populations from countries with more developed information industries may affect some key factors.

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

conflict potentials
emotional hostility
substantive dissension
is development


Evaluating Performance of Law Enforcement Personnel during a Stressful Training Scenario Police trainees who were ready to graduate from the Federal Law Enforcement Training Center (FLETC) volunteered to participate in an exercise designed to evaluate their survivability. In a highly stressful interactive scenario, which included a hostage situation, performance was evaluated for a range of responses, including

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

law enforcement
stressful training
performance


Generation of broadside transition-fault test sets that detect four-way bridging faults Generation of n-detection test sets is typically done for a single fault model. This paper investigates the generation of n-detection test sets by pairing each fault of a target fault model with n faults of a different fault model. Tests are generated such that they detect both faults of a pair. To facilitate test generation, the faults included in a single pair are selected such that they have overlapping requirements for their detection. The advantage of this approach is that it ensures the detection of additional faults that would not be targeted during the n-detection test generation process for a single fault model. Experimental results with transition faults as the first fault model and four-way bridging faults as the second fault model are presented.

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

bridging faults
test generation
transition faults


A Split-Based Incremental Deterministic Automata Minimization Algorithm We here study previous results due to Hopcroft and Almeida et al. to propose an incremental split-based deterministic automata minimization algorithm whose average running-time does not depend on the size of the alphabet. The experimentation carried out shows that our proposal outperforms the algorithms studied whenever the automata have more than a (quite small) number of states and symbols.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 automata
dfa minimization
incremental minimization


performance characterization of decentralized algorithms for replica selection in distributed object systems Designers of distributed systems often rely on replicas for increased robustness, scalability, and performance. Replicated server architectures require some technique to select a target replica for each client transaction. In this paper, we use simulation to characterize performance (response time, selection error, probability of server overload) for four common replica-selection algorithms (random, greedy, partitioned, weighted) when applied in a decentralized form to client queries in a distributed object system deployed on a local network. We introduce two new selection algorithms (balanced and balanced-partitioned) that give improved performance over the more common algorithms. We find the weighted algorithm performs best among the common algorithms and the balanced algorithm performs best among all those we considered. Our findings should help designers of distributed object systems to make informed decisions when choosing among available replica-selection algorithms.

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

replica selection
distributed object systems


Decentralized Delayed-State Information Filter (DDSIF): A new approach for cooperative decentralized tracking This paper presents a decentralized data fusion approach to perform cooperative perception with data gathered from heterogeneous sensors, which can be static or carried by robots. In particular, a decentralized delayed-state information filter (DDSIF) is described, in which full-state trajectories (that is, delayed states) are considered to fuse the information. This approach allows obtaining an estimation equal to that provided by a centralized system and reduces the impact of communication delays and latency in the estimation. The sparseness of the information matrix maintains the communication overhead at a reasonable level. The method is applied to cooperative tracking, and some results in disaster management scenarios are shown. In this kind of scenario, the target might move in both open-field and indoor areas, so the fusion of data provided by heterogeneous sensors is beneficial. The paper also shows experimental results with real data and integrating several sources of information.

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


Object detection using image reconstruction with PCA In this paper, we present an object detection system and its application to pedestrian detection in still images, without assuming any a priori knowledge about the image. The system works as follows: in a first stage a classifier examines each location in the image at different scales. Then in a second stage the system tries to eliminate false detections based on heuristics. The classifier is based on the idea that Principal Component Analysis (PCA) can compress optimally only the kind of images that were used to compute the principal components (PCs), and that any other kind of images will not be compressed well using a few components. Thus the classifier performs separately the PCA from the positive examples and from the negative examples; when it needs to classify a new pattern it projects it into both sets of PCs and compares the reconstructions, assigning the example to the class with the smallest reconstruction error. The system is able to detect frontal and rear views of pedestrians, and usually can also detect side views of pedestrians despite not being trained for this task. Comparisons with other pedestrian detection systems show that our system has better performance in positive detection and in false detection rate. Additionally, we show that the performance of the system can be further improved by combining the classifier based on PCA reconstruction with a conventional classifier using a Support Vector Machine.

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

object detection
pedestrian detection
principal component analysis


DSA-Mesh: a distributed security architecture for wireless mesh networks Wireless Mesh Networks (WMNs) have emerged recently as a technology for next-generation wireless networking. They consist of mesh routers and clients, where mesh routers are almost static and form the backbone of WMNs. WMNs provide network access for both mesh and conventional clients. In this paper, we propose DSA-Mesh, a fully distributed security architecture that provides access control for mesh routers as well as a key distribution scheme that supports layer-2 encryption to ensure security and data confidentiality of all communications that occur in the backbone of the WMN. DSA-Mesh exploits the routing capabilities of mesh routers: after connecting to the access network as generic wireless clients, new mesh routers authenticate to a key management service (consisting of several servers) implemented using threshold cryptography, and obtain a temporary key that is used both to prove their credentials to neighbor nodes and to encrypt all the traffic transmitted on wireless backbone links. A key feature in the design of DSA-Mesh is its independence from the underlying wireless technology used by network nodes to form the backbone. Furthermore, DSA-Mesh enables seamless mobility of mesh routers. Since it is completely distributed, DSA-Mesh permits to deploy automatically and incrementally large WMNs, while increasing, at the same time, the robustness of the system by eliminating the single point of failure typical of centralized architectures. DSA-Mesh has been implemented in Network Simulator, and extensive simulations have been performed in large-scale network scenarios, comparing it to a static key approach and to a centralized architecture where a single key server is deployed. Numerical results show that our proposed architecture considerably increases the WMN security and reliability, with a negligible impact on the network performance, thus representing an effective solution for wireless mesh networking. Copyright (C) 2010 John Wiley & Sons, Ltd.

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

security
threshold cryptography
wireless mesh networks

authentication
session secret distribution


Characterizing the NP-PSPACE gap in the satisfiability problem for modal logic There has been a great deal of work on characterizing the complexity of the satisfiability and validity problem for modal logics. In particular, Ladner showed that the satisfiability problem for all logics between K and S4 is PSPACE-hard, while for S5 it is NP-complete. We show that it is negative introspection, the axiom -K-p double right arrow K-K-p, that causes the gap: if we add this axiom to any modal logic between K and S4, then the satisfiability problem becomes NP-complete. Indeed, the satisfiability problem is NP-complete for any modal logic that includes the negative introspection axiom.

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

euclidean property
k5
pspace
np
knowledge representation


image recognition for digital libraries The interpretation of natural scenes, generally so obvious and effortless for humans, still remains a challenge in computer vision. To allow the search of image-based documents in digital libraries, we propose to design classifiers able to annotate images with keywords. First, we propose an image representation appropriate for scene description. Images are segmented into regions, and then indexed according to the presence of given region types. Second, we propound a classification scheme designed to separate images in the descriptor space. This is achieved by combining feature selection and kernel-method-based classification

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

scene analysis
image segmentation
kernel-method
image classification
clustering


Autonomous aggregation in location aware ad hoc wireless networks Gossip-based epidemic protocols are used to aggregate data in distributed systems. This fault-tolerant approach neither require maintenance of any global network state nor knowledge of network structure. However, although gossip-based aggregation algorithms scale well for graphs with good expansion, their efficiency for sparse graphs is unexamined. In this paper, we analyze the feasibility and efficiency of a gossip aggregation protocol in wireless networks with low expansion. We propose a modification of the existing aggregation algorithm for use in locality-aware, sparse, and static wireless networks. Our protocol terminates autonomously, uses less bandwidth than the original version, and removes the need for the leader election process while counting network nodes. Aggregates are calculated only over nodes placed in the vicinity, and nodes communicate only with their immediate neighbors by using a wireless broadcast. We evaluate our approach by simulation on sparse, irregular graphs with low expansion for the simplified system model. Furthermore, we analytically assess the worst-case convergence time of this protocol for sparse wireless networks and also for the simplified system model. The proposed protocol can be used in the monitoring and alarming applications in wireless networks. Copyright (c) 2012 John Wiley & Sons, Ltd.

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

distributed algorithms
wireless ad hoc networks
wireless sensor networks


Optimum design of unbraced steel frames to LRFD-AISC using particle swarm optimization Particle Swarm method based optimum design algorithm for unbraced steel frames is presented. The Particle Swarm method is a numerical optimization technique that simulates the social behavior of birds, fishes and bugs. In nature fish school, birds flock and bugs swarm not only for reproduction but for other reasons such as finding food and escaping predators. Similar to birds seek to find food, the optimum design process seeks to find the optimum solution. In the particle swarm optimization each particle in the swarm represents a candidate solution of the optimum design problem. In the optimum design algorithm presented the design constraints are imposed in accordance with LRFD-AISC (Load and Resistance Factor Design, American Institute of Steel Construction). In the design of beam-column members the combined strength constraints are considered that take into account the lateral torsional buckling of the member. The algorithm developed selects optimum W sections for beams and columns of unbraced frame from the list of 272 W-sections list. This selection is carried out such that design constraints imposed by the LRFD are satisfied and the minimum frame weight is obtained. The efficiency of the algorithm is demonstrated considering a number of design examples. (C) 2011 Civil-Comp Ltd and Elsevier Ltd. All rights reserved.

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

minimum weight
steel frame
combinatorial optimization
swarm intelligence
particle swarm optimizer


Optimal design of the renewable energy map of Greece using weighted goal-programming and data envelopment analysis Renewable energy forms have been widely used in the past decades highlighting a green shift in energy production. An actual reason behind this turn to renewable energy production is EU directives which set the Unions targets for energy production from renewable sources, greenhouse gas emissions and increase in energy efficiency. All member countries are obligated to apply harmonized legislation and practices and restructure their energy production networks in order to meet EU targets. Towards the fulfillment of 202020 EU targets, in Greece a specific strategy which promotes the construction of large scale Renewable Energy Source plants is promoted. In this paper, we present an optimal design of the Greek renewable energy production network applying a 01 Weighted Goal Programming model, considering social, environmental and economic criteria. In the absence of a panel of experts Data Envelopment Analysis (DEA) approach is used in order to filter the best out of the possible network structures, seeking for the maximum technical efficiency. Super-Efficiency DEA model is also used in order to reduce the solutions and find the best out of all the possible. The results showed that in order to achieve maximum efficiency, the social and environmental criteria must be weighted more than the economic ones.

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

renewable energy
goal programming
data envelopment analysis
energy production


Mining association rules on significant rare data using relative support Recently, data mining, a technique to analyze the stored data in large databases to discover potential information and knowledge, has been a popular topic in database research. In this paper, we study the techniques discovering the association rules which are one of these data mining techniques. And we propose a technique discovering the association rules for significant rare data that appear infrequently in the database but are highly associated with specific data. Furthermore, considering these significant rare data, we evaluate the performance of the proposed algorithm by comparing it with other existing algorithms for discovering the association rules.

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

data mining
potential information
association rules
significant rare data