Study on generation and sharing of on-demand global seamless data-Taking MODIS NDVI as an example By applying advanced Geospatial Data Abstraction Library (GDAL) and BigTIFF technology in a Geographical Information System (GIS) with Service Oriented Architecture (SOA), this study has derived global datasets using tile-based input data and implemented Virtual Web Map Service (VWMS) and Virtual Web Coverage Service (VWCS) to provide software tools for visualization and acquisition of global data. Taking MODIS Normalized Difference Vegetation Index (NDVI) as an example, this study proves the feasibility, efficiency and features of the proposed approach. (C) 2012 Elsevier Ltd. All rights reserved.

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


Interconnection Network Simulation Using Traces of MPI Applications This paper addresses the utilization of traces taken from MPI applications to do simulation-based performance studies of parallel computing systems. Different mechanisms to capture traces are discussed, pointing out important limitations of some of them. One of these limitations is the invisibility of message interchanges in collective operations, which is circumvented modifying a trace-capturing library. During a simulation, trace records must be simulated in causal order, to fully comply with application semantics. Alternatives to follow this order, and the risks of not following it, are presented and discussed. The techniques introduced in this paper have been implemented in an in-house developed simulation environment, which is used in two example studies to show its usefulness: an evaluation of alternatives for interconnection network design, and a performance prediction study in which traces from one machine are used to estimate the execution times of applications running in a different machine.

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

traces of parallel applications
message passing interface


Laslett's transform for the Boolean model in R-d Consider a stationary Boolean model X with convex grains in R-d and let any exposed lower tangent point of X be shifted towards the hyperplane N-0 = {x is an element of R-d : x(1) = 0} by the length of the part of the segment between the point and its projection onto the No covered by X. The resulting point process in the halfspace (the Laslett's transform of X) is known to be stationary Poisson and of the same intensity as the original Boolean model. This result was first formulated for the planar Boolean model (see N. Cressie [3]) although the proof based on discretization is partly heuristic and not complete. Starting from the same idea we present a rigorous proof in the d-dimensional case. As a technical tool equivalent characterization of vague convergence for locally finite integer valued measures is formulated. Another proof based on the martingale approach was presented by A. D. Barbour and V. Schmidt [1].

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


A multiscale method for distributed parameter estimation with application to reservoir history matching A method for multiscale parameter estimation with application to reservoir history matching is presented. Starting from a given fine-scale model, coarser models are generated using a global upscaling technique where the coarse models are tuned to match the solution of the fine model. Conditioning to dynamic data is done by history-matching the coarse model. Using consistently the same resolution both for the forward and inverse problems, this model is successively refined using a combination of downscaling and history matching until model-matching dynamic data are obtained at the finest scale. Large-scale corrections are obtained using fast models, which, combined with a downscaling procedure, provide a better initial model for the final adjustment on the fine scale. The result is thus a series of models with different resolution, all matching history as good as possible with this grid. Numerical examples show that this method may significantly reduce the computational effort and/or improve the quality of the solution when achieving a fine-scale match as compared to history-matching directly on the fine scale.

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

parameter estimation
history matching
multiscale


application-level graphic streaming channel Scene Graph APIs are used to interact at the application level with a 2D or 3D scene. Examples of such APIs are the External Authoring Interface for VRML scenes or the MPEG-J scene graph API for MPEG-4 scenes. In theory, a remote or local application could interact with the scene using these APIs. But in practice, the application is running in the scene player as a java applet or MPEGlet. This paper shows how a remote scene graph API can be implemented by defining a new graphic streaming channel at the application level. We describe a simple and compact communication protocol corresponding to this streaming channel and give some results of use of this channel. A comparison between EAI and MPEG-J scene graph is also presented.

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

remote access to scene graph
mpeg-j
external application interface (eai)
mpeg-4


A compelling argument for the gravity p-median model The p-median model is used to locate P facilities to serve a geographically distributed population. Conventionally, it is assumed that the population always travels to the nearest facility. Drezner and Drezner, 2006andDrezner and Drezner, 2007 re-estate three arguments on why this assumption might be incorrect, and they introduce the gravity p-median model to relax the assumption. We favor the gravity p-median model, but we note that in an applied setting, the three arguments are incomplete. In this communication, we point at the existence of a fourth compelling argument for the gravity p-median model.

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

travel time
spatial aggregation
multi-purpose trips


Natural perception in dynamic stereoscopic augmented reality environments Notwithstanding the recent diffusion of the stereoscopic 3D technologies for the development of powerful human computer interaction systems based on augmented reality environment, with the conventional approaches an observer freely moving in front of a 3D display could experience a misperception of the depth and of the shape of virtual objects. Such distortions can cause eye fatigue and stress for entertainment applications, and they can have serious consequences in scientific and medical fields, where a veridical perception of the scene layout is required. We propose a novel technique to obtain augmented reality systems capable to correctly render 3D virtual objects to an observer that changes his/her position in the real world and acts in the virtual scenario. By tracking the positions of the observers eyes, the proposed technique generates the correct virtual view points through asymmetric frustums, thus obtaining the correct left and right projections on the screen. The natural perception of the scene layout is assessed through three experimental sessions with several observers.

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

eyes and head tracking
depth perception
stereoscopic virtual reality
moving viewer


a parallel processor architecture for graphics arithmetic operations Interactive 3D graphics applications require significant arithmetic processing to handle complex models, particularly if realistic rendering techniques are used. Current semiconductor technology cannot provide the necessary performance without some form of multi-processing.This paper describes a graphics processor architecture which can be configured with an arbitrary number of identical processors operating in parallel. Each of the parallel processors can be programmed identically as if it were a single processor system, substantially simplifying software development and allowing complex rendering functions to take advantage of the multiple processors. The architecture described is able to achieve extremely high performance while allowing the price/performance of the system to be optimized for a given application.Techniques are described for handling graphics command distribution, sequencing of commands which must be processed in order, parallel processing of graphics primitive picking, and handling inquiry (read-back) commands.

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

processor
order
applications
parallel processing
rendering
parallel
software development
architecture
performance
3d
graphics
paper

interaction
systems
technologies
price
high-performance
operability
process
graphic processor
complexity
distributed
model
read
sequence


A Unified Methodology for Scheduling in Distributed Cyber-Physical Systems A distributed cyber-physical system (DCPS) may receive and induce energy-based interference to and from its environment. This article presents a model and an associated methodology that can be used to (i) schedule tasks in DCPSs to ensure that the thermal effects of the task execution are within acceptable levels, and (ii) verify that a given schedule meets the constraints. The model uses coarse discretization of space and linearity of interference. The methodology involves characterizing the interference of the task execution and fitting it into the model, then using the fitted model to verify a solution or explore the solution space.

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

design
management
performance
theory
verification
abstract heat flow model
thermal management
thermal awareness
cyber-physical systems
sustainable computing
green computing


Routing in Self-Organizing Nano-Scale Irregular Networks The integration of novel nanotechnologies onto silicon platforms is likely to increase fabrication defects compared with traditional CMOS technologies. Furthermore, the number of nodes connected with these networks makes acquiring a global defect map impractical. As a result, on-chip networks will provide defect tolerance by self-organizing into irregular topologies. In this scenario, simple static routing algorithms based on regular physical topologies, such as meshes, will be inadequate. Additionally, previous routing approaches for irregular networks assume abundant resources and do not apply to this domain of resource-constrained self-organizing nano-scale networks. Consequently, routing algorithms that work in irregular networks with limited resources are needed. In this article, we explore routing for self-organizing nano-scale irregular networks in the context of a Self-Organizing SIMD Architecture (SOSA). Our approach trades configuration time and a small amount of storage for reduced communication latency. We augment an Euler path-based routing technique for trees to generate static shortest paths between certain pairs of nodes while remaining deadlock free. Simulations of several applications executing on SOSA show our proposed routing algorithm can reduce execution time by 8% to 30%.

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

design
performance
self-organizing
data parallel
dna
nanocomputing


applying test-driven code search to the reuse of auxiliary functionality Software developers spend considerable effort implementing auxiliary functionality used by the main features of a system ( e.g . compressing/decompressing files, encryption/decription of data, scaling/rotating images). With the increasing amount of open source code available on the Internet, time and effort can be saved by reusing these utilities through informal practices of code search and reuse. However, when this type of reuse is performed in an ad hoc manner, it can be tedious and error-prone: code results have to be manually inspected and extracted into the workspace. In this paper we introduce the use of test cases as an interface for automating code search and reuse and evaluate its applicability and performance in the reuse of auxiliary functionality. We call our approach Test-Driven Code Search (TDCS). Test cases serve two purposes: (1) they define the behavior of the desired functionality to be searched; and (2) they test the matching results for suitability in the local context. We present CodeGenie, an Eclipse plugin that performs TDCS using a code search engine called Sourcerer. Our evaluation presents evidence of the applicability and good performance of TDCS in the reuse of auxiliary functionality.

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

test-first
software reuse
source code search
tdd


on strip packing with rotations We present an asymptotic fully polynomial time approximation scheme for two-dimensional strip packing with rotations. In this problem, a set of rectangles need to be packed into a rectangle (strip) of fixed width and minimum height, and these rectangles can be rotated by 90. Additionally, we present a simple asymptotic polynomial time approximation scheme, and give an improved algorithm for two-dimensional bin packing with rotations.

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

strip packing
rotations
approximation scheme


Structure and reaction based evaluation of synthetic accessibility De novo design systems provide powerful methods to suggest a set of novel structures with high estimated binding affinity. One deficiency of these methods is that some of the suggested structures could be synthesized only with great difficulty. We devised a scoring method that rapidly evaluates synthetic accessibility of structures based on structural complexity, similarity to available starting materials and assessment of strategic bonds where a structure can be decomposed to obtain simpler fragments. These individual components were combined to an overall score of synthetic accessibility by an additive scheme. The weights of the scoring function components were calculated by linear regression analysis based on accessibility scores derived from medicinal chemists. The calculated values for synthetic accessibility agree with the values proposed by chemists to an extent that compares well with how chemists agree with each other.

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


using uncertainty in reputation methods to enforce cooperation in ad-hoc networks This paper gives an approach to reputation computation that incorporates "uncertainty" based on subjective logic. Uncertainty can arise when a node joins the network and thus has no history, or when a node's behavior changes in a way that is not clearly malicious, but at least suspicious. This uncertainty indicates when a node evaluating the reputation rating of another node should poll its neighbors for recommendations, because its local opinion is not sufficiently well-informed.The uncertainty based algorithm has several parameters and the computed reputation depends on these parameters. To evaluate the effectiveness of the uncertainty based method and to determine the effect of the parameters on the reputation computations, we have implemented a simulation infrastructure for the behavior of ad-hoc networks using the uncertainty based scheme. The simulator can also use other previously proposed mechanisms for reputation computation. The simulator is used to determine optimal parameters for the various schemes and how well each scheme a) ensures cooperative nodes receive service when requested, and b) throttles the ability of free-loading (malicious) nodes to consume service without contributing. The simulations show that the reputation computation that incorporates uncertainty provides superior recognition of "malicious" behavior in a variety of ad-hoc network situations. These initial results are sufficiently promising to motivate continuing study of reputation computations incorporating uncertainty to additional models of malicious behavior and a broader range of network behaviors.

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

cooperation
uncertainty
subjective logic
reputation


Three hydrolases and a transferase: Comparative analysis of active-site dynamics via the BioSimGrid database Comparative molecular dynamics (MD) simulations enable us to explore the conformational dynamics of the active sites of distantly related enzymes. We have used the BioSimGrid (http://www.biosimgrid.org) database to facilitate such a comparison. Simulations of four enzymes were analyzed. These included three hydrolases and a transferase, namely acetylcholinesterase, outer-membrane phospholipase A, outer-membrane protease T, and PagP (an outer-membrane enzyme which transfers a palmitate chain from a phospholipid to lipid A). A set of 17 simulations were analyzed corresponding to a total of ?0.1?s simulation time. A simple metric for active-site integrity was used to demonstrate the existence of clusters of dynamic conformational behaviour of the active sites. Small (i.e. within a cluster) fluctuations appear to be related to the function of an enzymatically active site. Larger fluctuations (i.e. between clusters) correlate with transitions between catalytically active and inactive states. Overall, these results demonstrate the potential of a comparative MD approach to analysis of enzyme function. This approach could be extended to a wider range of enzymes using current high throughput MD simulation and database methods.

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

biomolecular simulation
data mining
catalytic triad
conformational change


A streamlined, cost-effective database approach to manage requirements traceability Requirements traceability offers many benefits to software projects, and it has been identified as critical for successful development. However, numerous challenges exist in the implementation of traceability in the software engineering industry. Some of these challenges can be overcome through organizational policy and procedure changes, but the lack of cost-effective traceability models and tools remains an open problem. A novel, cost-effective solution for the traceability tool problem is proposed, prototyped, and tested in a case study using an actual software project. Metrics from the case study are presented to demonstrate the viability of the proposed solution for the traceability tool problem. The results show that the proposed method offers significant advantages over implementing traceability manually or using existing commercial traceability approaches.

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

software requirements management
requirement engineering
software requirements
traceability tools


A Quality-Aware Optimizer for Information Extraction A large amount of structured information is buried in unstructured text. Information extraction systems can extract structured relations from the documents and enable sophisticated, SQL-like queries over unstructured text. Information extraction systems are not perfect and their output has imperfect precision and recall (i.e., contains spurious tuples and misses good tuples). Typically, an extraction system has a set of parameters that can be used as "knobs" to tune the system to be either precision- or recall-oriented. Furthermore, the choice of documents processed by the extraction system also affects the quality of the extracted relation. So far, estimating the output quality of an information extraction task has been an ad hoc procedure, based mainly on heuristics. In this article, we show how to use Receiver Operating Characteristic (ROC) curves to estimate the extraction quality in a statistically robust way and show how to use ROC analysis to select the extraction parameters in a principled manner. Furthermore, we present analytic models that reveal how different document retrieval strategies affect the quality of the extracted relation. Finally, we present our maximum likelihood approach for estimating, on the fly, the parameters required by our analytic models to predict the runtime and the output quality of each execution plan. Our experimental evaluation demonstrates that our optimization approach predicts accurately the output quality and selects the fastest execution plan that satisfies the output quality restrictions.

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 B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 experimentation measurement performance


power variance analysis breaks a masked asic implementation of aes To obtain a better trade-off between cost and security, practical DPA countermeasures are not likely to deploy full masking that uses one distinct mask bit for each signal. A common approach is to use the same mask on several instances of an algorithm. This paper proposes a novel power analysis method called Power Variance Analysis (PVA) to reveal the danger of such implementations. PVA uses the fact that the side-channel leakage of parallel circuits has a big variance when they are given the same but random inputs. This paper introduces the basic principle of PVA and a series of PVA experiments including a successful PVA attack against a prototype RSL-AES implemented on SASEBO-R.

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


A White-Box Encryption Algorithm for Computing with Mobile Agents A white-box encryption algorithm is proposed for computing using a mobile agent protected with time-limited black box security. Block matrix multiplication on finite fields and secure addition with randomly generated input and output transformation generates a set of tables that hide the key. Thus, the algorithm is a countermeasure against the threat that could compromise the key in a white-box attack context and provides secure data encryption by computing with encrypted functions. The size of implementation of this algorithm is small and suitable for migrating from one host to another as a part of a mobile agent.

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


Entanglement of formation for a class of special quantum states The entanglement of formation for a class of high-dimensional quantum mixed states is investigated. A special kind of D-computable states is defined and the lower bound of entanglement of formation for a large class of density matrices whose decompositions lie in these D-computable quantum states is obtained. Moreover we present a kind of construction for this special state which is defined by a class of special matrices with two non-zero different eigenvalues and the other eigenvalues are zero. Making use of the D-computable we construct a class of bound entangled states.

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


augmenting oai-pmh repository holdings using search engine apis In this poster, we give the preliminary results of our project to acquire Atmospheric Science Data Center (ASDC) project-related web resources, not with focused crawling, but by using the search engine (SE) APIs directly. We aggregate the results and create archive-ready complex objects.

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

science
search engine
web
aggregate
project
data center

crawl
object
digital libraries
complexity
search engine api
repositories
repository enhancement
archival
resource


Algorithm for adaptively smoothing the log-periodogram We use the principle of minimum cross entropy (MCE) to build a non-parametric adaptive algorithm for smoothing the log-transformed periodogram, and construct an optimal estimate for the spectral density function of a process. We show that this estimate minimizes the cross-entropy with the log-transformed spectral density function of the process. The method is non-parametric and performs very well for the case of processes having rapidly changing spectra that exhibits a variable order of smoothness. The algorithm is locally based on linearly approximating the information present in the process, and uses this approximation to allow the bandwidth of the spectral window in the smoothed log-periodogram to vary. We extend the algorithm empirically for better application to processes having mixed, narrow-band spectra. Comparisons with other currently used procedures are performed through the means of simulated examples.

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

adaptively smoothed log-periodogram
non-parametric estimate
minimum cross-entropy
spectral lines


Collaboration among mobile agents for efficient energy allocation in mobile grid The use of mobile devices in grid environments may have two interaction aspects: devices are considered as users of grid resources or as grid resources providers. Due to the limitation constraints on energy and processing capacity of mobile devices, their integration into the Grid is difficult. In this paper, we investigate the cooperation among mobile devices to balance the energy consumption and computation workloads. Mobile devices can have different roles such as buyer devices and seller devices. In the mobile grid, the energies of mobile devices are uneven, energy-poor devices can exploit other devices with spare energy. Our model consists of two actors: A buyer device agent represents the benefits of mobile buyer device that intends to purchase energy from other devices. A seller device agent represents the profits of mobile seller device that is willing to sell spare energy to other devices. The objective of optimal energy allocation in mobile grid is to maximize the utility of the system without exceeding the energy capacity, expense budget and the deadline. A collaboration algorithm among mobile agents for efficient energy allocation is proposed. In the simulation, the performance evaluation of collaboration algorithm among mobile agents is conducted.

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


temperature-aware processor frequency assignment for mpsocs using convex optimization The increasing processing capability of Multi-Processor Systems-on-Chips (MPSoCs) is leading to an increase in chip power dissipation, which in turn leads to significant increase in chip temperature. An important challenge facing the MPSoC designers is to achieve the highest performance system operation that satisfies the temperature and power consumption constraints. The frequency of operation of the different processors and the application workload assignment play a critical role in determining the performance, power consumption and temperature profile of the MPSoC. In this paper, we propose novel convex optimization based methods that solve this important problem of temperature-aware processor frequency assignment, such that the total system performance is maximized and the temperature and power constraints are met. We perform experiments on several realistic SoC benchmarks using a cycle-accurate FPGA-based thermal emulation platform, which show that the systems designed using our methods meet the temperature and power consumption requirements at all time instances, while achieving maximum performance.

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


Robust vertex p-center model for locating urgent relief distribution centers This work locates urgent relief distribution centers (URDCs) on a given set of candidate sites using a robust vertex p-center (RVPC) model. This model addresses uncertain travel times, represented using fixed intervals or ranges instead of probability distributions, between URDCs and affected areas. The objective of locating a predetermined number (p) of URDCs is to minimize worst-case deviation in maximum travel time from the optimal solution. To reduce the complexity of solving the RVPC problem, this work proposes a property that facilitates identification of the worst-case scenario for a given set of URDC locations. Since the problem is NP-hard, a heuristic framework is developed to efficiently obtain robust solutions. Then, a specific implementation of the framework, based on simulated annealing, is developed to conduct computational experiments. Experimental results show that the proposed heuristic is effective and efficient in obtaining robust solutions of interest. This work examines the impact of the degree of data uncertainty on the selected performance measures and the tradeoff between solution quality and robustness. Additionally, this work demonstrates the applicability of the proposed model to natural disasters based on a real-world instance. The result is compared with that obtained by a scenario-based, two-stage stochastic model. This work contributes significantly to the growing body of literature applying robust optimization approaches to emergency logistics.

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

emergency logistics
data uncertainty
robust optimization


Computer simulation of electron energy state spin-splitting in nanoscale InAs/GaAs semiconductor quantum rings In this paper, we model and computationally investigate the effect of spin-orbit interaction on the electron energy spectra for nanoscale semiconductor quantum rings. Our three-dimensional mathematical model considers the effective one-electron band Hamiltonian, the energy- and position-dependent electron effective mass approximation, and the spin-dependent Ben Daniel-Duke boundary conditions. The nonlinear iterative method is applied to solve the corresponding nonlinear eigenvalue problem, which converges monotonically for all energy states. Physically, it is found that the spin-dependent boundary conditions lead to a spin-splitting of the electron energy states with non-zero angular momentum in nanoscale InAs/GaAs quantum rings. The spin-splitting is strongly dependent upon the dimension of the explored quantum ring and is dominated by the inner radius, the base radius, and the height of the quantum ring. Under zero magnetic fields, the spin-splitting energy is decreased when the radius is increased. Meanwhile, it is greater than that of the InAs/GaAs quantum dot and demonstrates an experimentally measurable quantity (up to 2 meV) for relatively small semiconductor quantum rings. (C) 2012 Elsevier Ltd. 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 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 B I I O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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

quantum rings
energy spectra
nonlinear eigenvalue problem
nonlinear iterative method

semiconductor nanostructure
inas/gaas
spin-orbit interaction
nonlinear schrodinger equation
monotone convergence


bit-level optimization for high-level synthesis and fpga-based acceleration Automated hardware design from behavior-level abstraction has drawn wide interest in FPGA-based acceleration and configurable computing research field. However, for many high-level programming languages, such as C/C++, the description of bitwise access and computation is not as direct as hardware description languages, and high-level synthesis of algorithmic descriptions may generate suboptimal implementations for bitwise computation-intensive applications. In this paper we introduce a bit-level transformation and optimization approach to assisting high-level synthesis of algorithmic descriptions. We introduce a bit-flow graph to capture bit-value information. Analysis and optimizing transformations can be performed on this representation, and the optimized results are transformed back to the standard data-flow graphs extended with a few instructions representing bitwise access. This allows high-level synthesis tools to automatically generate circuits with higher quality. Experiments show that our algorithm can reduce slice usage by 29.8\% on average for a set of real-life benchmarks on Xilinx Virtex-4 FPGAs. In the meantime, the clock period is reduced by 13.6\% on average, with an 11.4\% latency reduction.

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

fpga
bit-level optimization
high-level synthesis


some resources for teaching concurrency With the increasing emphasis on exploiting concurrency efficiently and correctly, the lack of suitable pedagogical material for teaching concurrency is a growing problem. In this paper, we summarize a recently concluded class as well as some independent projects in the area of concurrency and multi-core computing that offer some insights to address this problem. We examine background papers, the teaching of low level concurrency, and the teaching of threading and message passing. The use of dynamic formal verification tools in a class setting is discussed in some detail. We conclude with a summary of pedagogical material being assembled, including exercises from a popular textbook on MPI solved using our dynamic verifier ISP. Our observation is that the teaching of concurrency is greatly facilitated by the use of dynamic push-button formal verification tools that can handle non-trivial concurrent programs. Given the growing number of publications on how to teach concurrency as well as employ new programming approaches, our work addresses the somewhat neglected topic of using modern dynamic formal verification methods within the context of widely used concurrency approaches and libraries.

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

pthreads
memory models
education
multi-core
computer science education
dynamic verification


A comparative approach to the economic modelling of a large-scale wave power scheme Conversion of marine energy sources, including ocean waves and tidal currents, into electricity is a rapidly developing industry. Although many technologies have been proposed and some have generated electricity at full scale, it is difficult to predict which technology will be economic at large scales of installation. Several studies have been conducted which estimate the cost of electricity on the basis of schematic designs. However, each study represents a best estimate of the future cost based on current design details and direct comparison between the results of these studies is not straightforward. A methodology for directly comparing different wave energy concepts and potential locations would be beneficial to aid investment decisions. In this study we describe how the established data envelopment analysis technique could be employed for this purpose. The developed model is employed to rank the efficacy with which several types of conceptual and prototype wave energy conversion technologies generate electricity from the wave energy resource available at UK and US sites.

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


Intelligent Dynamic Bandwidth Allocation Algorithm in Upstream EPONs An upstream access scheme for Ethernet passive optical networks, called the intelligent fuzzy-logic-based dynamic bandwidth allocation algorithm (IFLDBA) has been proposed. The algorithm provides the allotment of bandwidth between optical network units (ONUs) and within ONUs. Fuzzy logic is used to improve the bandwidth allocation within each ONU. We compare the IFLDBA algorithm with the existing broadcast polling algorithm. The results show that IFLDBA has bandwidth utilization of up to 21% better and lower delay than the broadcast polling algorithm.

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

fuzzy logic
dynamic bandwidth allocation

ethernet passive optical network
fairness


Synergizing in Cyberinfrastructure Development This paper investigates the work of creating infrastructure, using as a case study the development of cyberinfrastructure for metagenomics research. Specifically, the analysis focuses on the role of embeddedness in infrastructure development. We expand on the notion of human infrastructure to develop the concepts of synergizing, leveraging, and aligning, which denote the active processes of creating and managing relationships among people, organizations, and technologies in the creation of cyberinfrastructure. This conceptual lens highlights how embeddedness is not only an important result of infrastructure development, but is also a precursor that can act as both a constraint and a resource for development activities.

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

cyberinfrastructure synergizing leveraging aligning infrastructure metagenomics


Intelligent prediction of the stress-strain response of intact and jointed rocks An application of Artificial Neural Networks for predicting the stress-strain response of jointed rocks under different confining pressures is presented in this paper. Rocks of different compressive strength with different joint properties (frequency, orientation and strength of joints) are considered in this study. The database for training the neural network is formed from the results of triaxial compression tests on different intact and jointed rocks with different joint properties tested at different confining pressures reported by various researchers in the literature. The network was trained using a three-layered network with the feed-forward back propagation algorithm. About 85% of the data was used for training and the remaining 15% was used for testing the network. Results from the analyses demonstrated that the neural network approach is effective in capturing the stress-strain behaviour of intact rocks and the complex stress-strain behaviour of jointed rocks. A single neural network is demonstrated to be capable of predicting the stress-strain response of different jointed rocks, whose intact strength varies from 11.32 MPa to 123 MPa, spacing of joints varies from 10 cm to 100 cm. and confining pressures range from 0 to 13.8 MPa. (C) 2010 Elsevier Ltd. All rights reserved.

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

intact rocks
jointed rocks
triaxial compression
prediction


Bounded robust control of nonlinear systems using neural network-based HJB solution In this paper, a Hamilton-Jacobi-Bellman (HJB) equation-based optimal control algorithm for robust controller design is proposed for nonlinear systems. The HJB equation is formulated using a suitable nonquadratic term in the performance functional to tackle constraints on the control input. Utilizing the direct method of Lyapunov stability, the controller is shown to be optimal with respect to a cost functional, which includes penalty on the control effort and the maximum bound on system uncertainty. The bounded controller requires the knowledge of the upper bound of system uncertainty. In the proposed algorithm, neural network is used to approximate the solution of HJB equation using least squares method. Proposed algorithm has been applied on the nonlinear system with matched and unmatched type system uncertainties and uncertainties in the input matrix. Necessary theoretical and simulation results are presented to validate proposed algorithm.

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

robust control
hjb equation
system uncertainty
lyapunov stability


Comparative tests of solution methods for signal-controlled road networks In this paper, we consider a signal-controlled road network with link capacity expansions. This network design problem can be formulated as a constrained optimization subject to equilibrium flows. A projected Quasi-Newton method is proposed to find good local optimal solutions. Numerical calculations are conducted using a real data road network and large-scale grid networks.

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

signal-controlled road network
projected quasi-newton method


Optimized search over the Gabor dictionary for note decomposition and recognition ? Performing real-time note detection of multiple audio sources, such as guitar signals, is a difficult task due to the complex nature of these signals. For instance, guitar notes are close in pitch and the harmonic overtones of each note are strongly interlaced, thus preventing standard filtering techniques. In order to accomplish note detection, a harmonic matching pursuit algorithm has been used to decompose an audio signal in terms of elementary waveforms called harmonic atoms. These atoms are derived from the standard matching pursuit algorithm, and are part of an extended and overcomplete Gabor dictionary. In this paper, the search over Gabor dictionary is optimized by using signal modeling of the guitar signal in order to pre-calculate a parameter set; therefore avoiding a costly search over the extended Gabor dictionary. The parameter set defined for the proposed algorithm includes time-location, decay rate, frequency, scale and phase, which are calculated at the onset of each note played. This optimized algorithm is demonstrated through synthesized and real guitar signal examples. Considerable computational savings of this proposed algorithm over the harmonic matching pursuit algorithm are achieved.

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

harmonic matching pursuit
optimized search


a programming language framework for designing user interfaces Programming Language researchers increasingly recognize that a high proportion of application development costs involve the interface with users of the application, including various dialogues, input formats, error checking, help and explanation messages, and the like. They also increasingly recognize that maintenance costs tend to overshadow development costs. These two factors even multiply their adverse effects: as the user needs evolve, it is the interface with a system which generally requires the most maintenance. The user relationship is even said to account for about 60 percent of the maintenance problem [Lientz and Swanson 81]. Surprisingly, few programming language constructs are designed to address the area of user interface design. On the contrary, traditional programming language constructs are strongly oriented towards improving programmers' effectiveness in developing the algorithmic and data manipulation aspects of an application. A programmer is basically left to reinvent each time the required procedures to deal with user commands and inputs.

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

help
framework
input
interfaces
application development
account
user
users
language
maintenance
data
manipulation
programmer
explanation

applications
developer
addressing
timing
errors
dialogue
aspect
research
relationships
systems
procedure
factor
message
user interface
effect
user interface design
programming language


Coevolutionary makespan optimisation through different ranking methods for the fuzzy flexible job shop In this paper we tackle a variant of the flexible job shop scheduling problem with uncertain task durations modelled as fuzzy numbers, the fuzzy flexible job shop scheduling problem or FfJSP in short. To minimise the schedule's fuzzy makespan, we consider different ranking methods for fuzzy numbers. We then propose a cooperative coevolutionary algorithm with two different populations evolving the two components of a solution: machine assignment and task relative order. Additionally, we incorporate a specific local search method for each population. The resulting hybrid algorithm is then evaluated on existing benchmark instances, comparing favourably with the state-of-the-art methods. The experimental results also serve to analyse the influence in the robustness of the resulting schedules of the chosen ranking method.

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

flexible job shop scheduling
robustness
local search
coevolutionary algorithm

ranking of fuzzy numbers
fuzzy processing times


Design of two step deterministic interleaver for turbo codes The performance and design of a deterministic interleaver for short frame turbo codes is considered in this paper. The main characteristic of this class of deterministic interleaver is that their algebraic design selects the best permutation generator such that the points in smaller subsets of the interleaved output are uniformly spread over the entire range of the information data frame. It is observed that the interleaver designed in this manner improves the minimum distance of first few spectral lines of minimum distance spectrum. Finally we introduce a circular shift in the permutation function to reduce the correlation between the parity bits corresponding to the original and interleaved data frames to improve the decoding capability of MAP decoder. The design is focused on combining good permutations with de-correlation property. Our solution to design a deterministic interleaver outperforms the semi-random interleavers and the deterministic interleavers reported in the literature. (c) 2007 Elsevier Ltd. All rights reserved.

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

interleavers
minimum distance
turbo codes

parallel concatenated convolutional codes


7-DOF Haptic device and interface design In this study, the developed 7-DOF haptic device (HaP-7) and its virtual reality interface are presented. The design issues, design constraints, and alternative design configurations are discussed and the potential advantages of the HaP-7 are put forward. The kinematic model of the proposed device looks like a simplified human arm kinematic model. The redundant characteristic of the device provides larger workspace and allows for appropriate posture selection for the purposes of maximization of the rigidity, transparency and stability, while minimizing the inertia and power consumption in addition to the singularity and obstacle avoidance optimization.

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

haptic device design
force feedback
visual feedback


Reducing the impact of model scale on simulated, gridded switchgrass yields Simple accuracy assessment and uncertainty reduction for gridded simulations. Meteorological inputs drive scale-dependent trends in yield bias and error. Biases can vary across scale by as much as 31% of observed regional mean. Model uncertainty associated with scale causes bias in regional mean yield values. This uncertainty can be reduced by bias-correction of model outputs.

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


Edge-to-edge measurement-based distributed network monitoring Continuous monitoring of a network domain poses several challenges. First, routers of a network domain need to be polled periodically to collect statistics about delay, loss, and bandwidth. Second, this huge amount of data has to be mined to obtain useful monitoring information. This increases the overhead for high speed core routers, and restricts the monitoring process from scaling to a large number of flows. To achieve scalability, polling and measurements that involve core routers should be avoided. We design and evaluate a distributed monitoring scheme that uses only edge-to-edge measurements, and scales well to large network domains. In our scheme, all edge routers form an overlay network with their neighboring edge routers. The network is probed intelligently from nodes in the overlay to detect congestion in both directions of a link. The proposed scheme involves only edge routers, and requires significantly fewer number of probes than existing monitoring schemes. Through analytic study and a series of experiments, we show that the proposed scheme can effectively identify the congested links. The congested links are used to capture the misbehaving flows that are violating their service level agreements, or attacking the domain by injecting excessive traffic.

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

network security
quality of service
denial of service


evaluating the suitability of a measurement repository for statistical process control Software organizations have increased their interest on software process improvement (SPI). In high maturity levels, SPI involves implementing statistical process control (SPC), which requires measures and data that are suitable for this context. However, this has been pointed in the literature as one of the main obstacles for a successful implementation of SPC in SPI efforts. This paper presents an instrument for evaluating the suitability of measurement repositories in order to support software organizations implementing SPC.

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

statistical process control
high maturity
measurement


Cop-robber guarding game with cycle robber-region A cop-robber guarding game is played by the robber-player and the cop-player on a graph G with a partition R and C of the vertex set. The robber-player starts the game by placing a robber (her pawn) on a vertex in R, followed by the cop-player who places a set of cops (her pawns) on some vertices in C. The two players take turns in moving their pawns to adjacent vertices in G. The cop-player moves the cops within C to prevent the robber-player from moving the robber to any vertex in C. The robber-player wins if it gets a turn to move the robber onto a vertex in C on which no cop situates, and the cop-player wins otherwise. The problem is to find the minimum number of cops that admits a winning strategy to the cop-player. It has been shown that the problem is polynomially solvable if R induces a path, whereas it is NP-complete if R induces a tree. In this paper, we show that the problem remains NP-complete even if R induces a 3-star and that the problem is polynomially solvable if R induces a cycle. (c) 2010 Elsevier B.V. All rights reserved.

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

pursuit-evasion games
graph algorithm
path covering
np-complete
cop-robber game


Binary join trees for computing marginals in the Shenoy-Shafer architecture We describe a data structure called binary join trees that is useful in computing multiple marginals efficiently in the Shenoy-Shafer architecture. We define binary join trees, describe their utility, and describe a procedure for constructing them. (C) 1997 Elsevier Science Inc.

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

local computation
fusion algorithm
binary join trees


Low-power high-speed class-AB buffer amplifiers for liquid-crystal display signal driver application Two types of low-power, high-speed, but with a large input dynamic range and output swing class-AB output buffer amplifiers which are suitable for the liquid-crystal display signal driver application are proposed. The driving capabilities of the circuits are achieved by adding comparators which sense the rising and falling edges of the input waveform and then turn on an auxiliary driving transistor to help charging/discharging the output load. The auxiliary driving transistors stay at "off" in the stable state, thus drawing no static power. Hence, the buffers draw little current during static but have an improved driving capability during transients. They are demonstrated in a 0.6 mum CMOS technology. The measured data do show that the proposed output buffer circuits are very suitable for the application of liquid-crystal display signal driver.

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

class-ab output buffer amplifier
liquid-crystal display


Cation-pi interaction in potassium-polyene complexes and the fate of potassium ion: A theoretical study Ab initio studies have been done at B3LYP/6-31G* level of theory to determine the structural changes on the substitution of potassium to odd-numbered all-trans conjugated polyenes ranging from C-5 to C-13. The results show that potassium is always positioned in the form of K+ above an odd carbon other than the terminal carbons and that the stablest structural isomer is the one with K+ lying above the central odd carbon. If a central odd carbon does not exist (as in C-11-system), then K+ will be positioned above the odd carbon nearest to the central carbon to achieve maximum stability. The difference in the binding energies of the isomers is generally small and it becomes insignificantly small as the carbon chain length increases so that under suitable conditions K+ ion may be made to move between the ends of the polyene. The metal-polyene complexes are seen to have a considerably reduced HOMO-LUMO gap. Further, the interaction of potassium with the polyene not only caused a total rearrangement of the bond lengths, bond angles and dihedral angles, but also induced a bend (warping) to the polyenic fragment that pockets K+. The structural changes and stability of the metal-polyene complexes are explained in terms of electrostatic interaction and cation-pi cloud interaction. (c) 2007 Elsevier Inc. All rights reserved.

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

polyenes
potassium
electrostatic interaction

computational studies
warping of carbon skeleton
cation-pi interaction


Evaluation of rule interestingness measures in medical knowledge discovery in databases We discuss the usefulness of rule interestingness measures for medical KDD through experiments using clinical datasets, and, based on the outcomes of these experiments, also consider how to utilize these measures in postprocessing. We first conducted an experiment to compare the evaluation results derived from a total of 40 various interestingness measures with those supplied by a medical expert for rules discovered in a clinical dataset on meningitis. We calculated and compared the performance of each interestingness measure to estimate a medical experts interest using f-measure and correlation coefficient. We then conducted a similar experiment for hepatitis. The comprehensive results of experiments on meningitis and hepatitis indicate that the interestingness measures, accuracy, chi-square measure for one quadrant, relative risk, uncovered negative, and peculiarity, have a stable, reasonable performance in estimating real human interest in the medical domain. The results also indicate that the performance of interestingness measures is influenced by the certainty of a hypothesis made by the medical expert, and that the combinational use of interestingness measures will contribute to support medical experts to generate and confirm their hypotheses through humansystem interaction.

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


Global sense of risk: Media reporting on scientific studies and potential risks of mobile phones A high sense of risk is characteristic of modern societies. During recent decades, increasing risk awareness has caused consumers to become more prudent. Consumer policy has become more cautious and governmental security and regulatory institutions function on behalf of citizens. Politically aware non-governmental organisations are ready to take up new risk issues and a vigilant media is monitoring, reporting and even amplifying modern dangers and public fears. Sophisticated risk analyses of menaces to humans are constantly being produced, and reflective individuals are eager to adapt their way of life according to the latest guidelines produced by the government, the media and science. The focus of this paper is the recent worldwide worry over the risks of the low-frequency electric and magnetic fields of mobile Phones and their base stations. This study of international media reports on the safety and health issues related to mobile phones (N = 732) indicates that the content of media reports varies, between Europe, Asia and North-America, and that the same research results are given different emphases in different newspapers. This paper also examines the complex reciprocal relationships subsisting between the different actors and institutions amplifying and playing down the individual and collective sense of risk.

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


Shuffle and scattered deletion closure of languages We introduce and study the notion of shuffle residual of a language L: the set containing the words whose shuffle with L is completely included in L. Several properties and a characterization of the shuffle residual of a language are obtained. The shuffle closure of a language L (the smallest language that is shuffle closed and contains L) is investigated. Moreover, conditions for the existence of maximal languages whose shuffle residual equals a given language are obtained. The paper also considers an operation dual to shuffle, namely scattered deletion: the scattered deletion of a word w from u consists of the words obtained by sparsely deleting from u the letters of w. in the order in which they appear in w. The scattered deletion residual and scattered deletion closure of a language are defined and studied. Finally, relationships and interdependencies between shuffle, scattered deletion, and other insertion and deletion operations are obtained. (C) 2000 Elsevier Science B.V. All rights reserved.

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

shuffle closure
shuffle residual
insertion and deletion operations

shuffle operation
maximal shuffle residual
rss-type laguage


identification of process improvement methodologies with application in information security The purpose of this paper is to review the capabilities of the Six Sigma and Lean Enterprise methodologies, and provide an illustration how the capabilities can be delivered under a uniform structure such as Lean Six Sigma. STOPE will then be reviewed along with the mapping to ISO/IEC 17799. Finally, the planned release of ISO/IEC 27004 and the applicability of Lean and Six Sigma methodologies will be discussed.

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


Pattern recognition in airflow recordings to assist in the sleep apnoeahypopnoea syndrome diagnosis This paper aims at detecting sleep apnoeahypopnoea syndrome (SAHS) from single-channel airflow (AF) recordings. The study involves 148 subjects. Our proposal is based on estimating the apnoeahypopnoea index (AHI) after global analysis of AF, including the investigation of respiratory rate variability (RRV). We exhaustively characterize both AF and RRV by extracting spectral, nonlinear, and statistical features. Then, the fast correlation-based filter is used to select those relevant and non-redundant. Multiple linear regression, multi-layer perceptron (MLP), and radial basis functions are fed with the features to estimate AHI. A conventional approach, based on scoring apnoeas and hypopnoeas, is also assessed for comparison purposes. An MLP model trained with AF and RRV selected features achieved the highest agreement with the true AHI (intra-class correlation coefficient=0.849). It also showed the highest diagnostic ability, reaching 92.5% sensitivity, 89.5% specificity and 91.5% accuracy. This suggests that AF and RRV can complement each other to estimate AHI and help in SAHS diagnosis.

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

sleep apnoeahypopnoea syndrome
airflow
respiratory rate variability
pattern recognition


Privacy preserving data mining: A noise addition framework using a novel clustering technique During the whole process of data mining (from data collection to knowledge discovery) various sensitive data get exposed to several parties including data collectors, cleaners, preprocessors, miners and decision makers. The exposure of sensitive data can potentially lead to breach of individual privacy. Therefore, many privacy preserving techniques have been proposed recently. In this paper we present a framework that uses a few novel noise addition techniques for protecting individual privacy while maintaining a high data quality. We add noise to all attributes, both numerical and categorical. We present a novel technique for clustering categorical values and use it for noise addition purpose. A security analysis is also presented for measuring the security level of a data set.

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

privacy preserving data mining
clustering categorical values
noise addition
data mining


On the evaluation of gridification effort and runtime aspects of JGRIM applications Nowadays, Grid Computing has been widely recognized as the next big thing in distributed software development. Grid technologies allow developers to implement massively distributed applications with enormous demands for resources such as processing power, data and network bandwidth. Despite the important benefits Grid Computing offers, contemporary approaches for Grid-enabling applications still force developers to invest much effort into manually providing code to discover and access Grid resources and services. Moreover, the outcome of this task is usually software that is polluted by Grid-aware code, as a result of which the maintainability suffers. In a previous article we presented JGRIM, a novel approach to easily gridify Java applications. In this paper, we report a detailed evaluation of JGRIM that was conducted by comparing it with Ibis and ProActive, two platforms for Grid development. Specifically, we used these three platforms for gridifying the k k -Nearest Neighbor algorithm and an application for restoring panoramic images. The results show that JGRIM simplifies gridification without resigning performance for these applications.

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


An O(n(2)) algorithm for detecting communities of unbalanced sizes in large scale social networks In the study of complex networks, a network is said to have community structure if it divides naturally into groups of nodes with dense connections within groups and only sparser connections between them [1]. Community structures are quite common in real networks. Social networks often include community groups based on common location, interests, occupation, etc. One of the most widely used methods for community detection is modularity maximization [2]. Modularity is a function that measures the quality of a particular division of a network into communities. But in [3], it is shown that communities that maximize the modularity are certainly groupings of smaller communities that need to be studied. In this work, we define a new function that qualifies a partition. We also present an algorithm that optimizes this function in order to find, within a reasonable time, the partition with the best measure of quality and which does not ignore small community. (C) 2012 Elsevier B.V. All rights reserved.

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

social networks
community detection
modularity maximization


inquiry-based active learning in introductory programming courses We have developed an innovative online tool for teaching introductory programming courses with the goals of engaging students in learning to program and increasing students' learning confidence. This system provides an online runtime environment that supports Java online compilation, execution, and verification with either Java console, GUI, or Web-based programs. In addition, the system can also support a synchronous, in-class, and instructor-led setting with instant assessment as well as an asynchronous, off-class, self-paced, and independent-study supplemental environment.

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

automated assessment
collaborative learning


Optimized polygonal approximation by dominant point deletion An algorithm for polygonal approximation based on dominant point (DP) deletion is presented in this paper. The algorithm selects an initial set of DPs and starts eliminating them one by one depending upon the error associated with each DP. The associated error value is based on global measure. A local optimization of few neighboring points is performed after each deletion. Although the algorithm does not guarantee an optimal solution, the combination of local and global optimization is expected to produce optimal results. The algorithm is extensively tested on various shapes with varying number of DPs and error threshold. In general, optimal results were observed for about 96% of the times. A good comparative study is also presented in this paper

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

polygonal approximation
associated error value

dominant points
dp table
optimal algorithm


Convex cost flow. Adaptation of network simplex algorithm Starting from the optimality test in Network Simplex Algorithm with linear objective function and the way of keeping a convex function defined on integer numbers, is proposed an adaptation of the algorithm mentioned above. The main topics in this article are related to the way of finding optimality conditions in the convex model, together with a description of the adapted algorithm.

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

convex programming
combinatorial optimization


towards automatic feature vector optimization for multimedia applications We systematically evaluate a recently proposed method for unsupervised discrimination power analysis for feature selection and optimization in multimedia applications. A series of experiments using real and synthetic benchmark data is conducted, the results of which indicate the suitability of the method for unsupervised feature selection and optimization. We present an approach for generating synthetic feature spaces of varying discrimination power, modeling main characteristics from real world feature vector extractors. A simple, yet powerful visualization is used to communicate the results of the automatic analysis to the user.

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

visualization
method
benchmark
analysis
discrimination power
data
feature
user

communication
self-organizing map
power model
vectorization
optimality
space
feature vectors
experience
power
feature selection
evaluation
multimedia application


performance specification of software components Component-based software engineering is concerned with predictability in both functional and performance behavior, though most formal techniques have typically focused their attention on the former. Reasoning about the (functional or performance) behavior of a component-based system must be compositional in order to be scalable. Compositional performance reasoning demands that components include performance specifications, in addition to descriptions of functional behavior. Unfortunately, as explained in this paper, classical techniques and notations for performance analysis are either unsuitable or unnatural to capture performance behaviors of generic software components. They fail to work in the presence of parameterization and layering. The paper introduces elements of a compositional approach to performance analysis using a detailed example. It explains that performance specification problems are so basic that there are unresolved research issues to be tackled even for the simplest reusable components. These issues must be tackled by any practical proposal for sound performance reasoning. Only then will software developers be able to engineer new systems by choosing and assembling components that best fit their performance (time and space) requirements.

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

generic objects
time &amp
space analysis
storage management
data structures


An elicitation instrument for operationalising GQM+Strategies (GQM+S-EI) A recent approach for measurement program planning, GQM+Strategies, provides an important extension to existing approaches linking measurements and improvement activities to strategic goals and ways to achieve these goals. There is a need for instruments aiding in eliciting information from stakeholders to use GQM+Strategies. The success of GQM+Strategies highly depends on accurately identifying goals, strategies and information needs from stakeholders. The research aims at providing an instrument (called GQM+S-EI), aiding practitioners to accurately elicit information needed by GQM+Strategies (capturing goals, strategies and information needs). The research included two phases. In the first phase, using action research method, the GQM+S-EI was designed in three iterations in Ericsson AB. Thereafter, a case study was conducted to evaluate whether the information elicited with the designed instrument following the defined process was accurate and complete. We identified that the industry requires elicitation instruments that are capable to elicit information from stakeholders, not having to know about the concepts (e.g. goals and strategies). The case study results showed that our proposed instrument is capable of accurately and completely capturing the needed information from the stakeholders. We conclude that GQM+S-EI can be used for accurately and completely eliciting the information needed by goal driven measurement frameworks. The instrument has been successfully transferred to Ericsson AB for measurement program planning.

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

goal driven measurement
action research
case study

goal elicitation
strategy elicitation
information need
gqm+strategies


Routing and wavelength assignment for exchanged hypercubes in linear array optical networks The issue of routing and wavelength assignment for realizing exchanged hypercubes on linear array is addressed. A lower bound of the minimum number of required wavelengths is derived. An embedding scheme, which can achieve the optimal wavelength assignment, is proposed. An optimal wavelength assignment algorithm that uses 2s+t?1+?2t/3? 2 s + t ? 1 + ? 2 t / 3 ? wavelengths is proposed.

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

routing and wavelength assignment
linear array

interconnection networks
exchanged hypercube
congestion


An Explicit Nonlinear Mapping for Manifold Learning Manifold learning is a hot research topic in the field of computer science and has many applications in the real world. A main drawback of manifold learning methods is, however, that there are no explicit mappings from the input data manifold to the output embedding. This prohibits the application of manifold learning methods in many practical problems such as classification and target detection. Previously, in order to provide explicit mappings for manifold learning methods, many methods have been proposed to get an approximate explicit representation mapping with the assumption that there exists a linear projection between the high-dimensional data samples and their low-dimensional embedding. However, this linearity assumption may be too restrictive. In this paper, an explicit nonlinear mapping is proposed for manifold learning, based on the assumption that there exists a polynomial mapping between the high-dimensional data samples and their low-dimensional representations. As far as we know, this is the first time that an explicit nonlinear mapping for manifold learning is given. In particular, we apply this to the method of locally linear embedding and derive an explicit nonlinear manifold learning algorithm, which is named neighborhood preserving polynomial embedding. Experimental results on both synthetic and real-world data show that the proposed mapping is much more effective in preserving the local neighborhood information and the nonlinear geometry of the high-dimensional data samples than previous work.

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

nonlinear dimensionality reduction (ndr)


Saliency detection with color contrast based on boundary information and neighbors Object-level saliency detection is significant in many computer vision tasks. In this paper, we propose a novel saliency detection model based on color contrast and image boundaries. The saliency of an image is defined as the contrast between the image elements (regions) and image boundaries elements (regions). We consider the saliency in two-stage procedure rather than in one stage. First of all, according to the definition of saliency, we take four boundaries of image into consideration respectively to obtain a combination coarse saliency map. Furthermore, a new energy function based on the coarse saliency map is proposed, which takes the coarse saliency map as input to yield the final full resolution saliency map. Experimental results on two public datasets demonstrate that the proposed model performs better than the state-of-the-art methods.

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

color contrast
energy function
saliency map


Nonintersecting subspaces based on finite alphabets Two subspaces of a vector space are here called "nonintersecting" if they meet only in the zero vector. Motivated by the design of noncoherent multiple-antenna communications systems, we consider the following question. How many pairwise nonintersecting M-t-dimensional subspaces of an m-dimensional vector space V over a field F can be found, if the generator matrices for the subspaces may contain only symbols from a given finite alphabet A C F? The most important case is when F is the field of complex numbers 0; then M-t is the number of antennas. If A = F = GF(q) it is shown that the number of nonintersecting subspaces is at most (q(m) - 1)/(q(Mt) - 1), and that this bound can be attained if and only if m is divisible by Mt. Furthermore, these subspaces remain nonintersecting when "lifted" to the complex field. It follows that the finite field case is essentially completely solved. In the case when F = C only the case Mt = 2 is considered. It is shown that if A is a PSK-configuration, consisting of the 2(r) complex roots of unity, the number of nonintersecting planes is at least 2(r(m-2)) and at most 2(r(m-1)-1) (the lower bound may in fact be the best that can be achieved).

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

multiple-antenna communications
noncoherent systems
space-time codes


FEMBEM-coupling and structuralacoustic sensitivity analysis for shell geometries Passive noise control by modification of structural geometry moves more and more into the field of vision for designers. This structuralacoustic optimization shows high potential in minimization of radiated noise especially for thin shell geometries. Since computer systems have been enhanced dramatically in recent years numerical simulation of structural vibration and acoustic field was accelerated significantly. But still the sensitivity analysis represents the bottle neck in computational efforts of gradient-based optimization. Furthermore, the coupling between FE and BE analysis in structuralacoustic simulation of large scale models will occur as an additional challenge because of non-matching meshes. In this paper, a fast method for computation of sensitivities of acoustic properties with respect to shell geometry is presented. Therefore, a concept to parameterize the structural geometry is explained. Additionally, the coupling procedure is simplified to reduce computational effort. Finally, this method is applied to an academic example. The sensitivity of the sound pressure at an internal point of an oblique box is investigated, when one side of this six-sided box is geometrically modified.

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

acoustic optimization
fembem-coupling
fluidstructure-interaction
shape optimization
gradient-based optimization


Calculation of electronic structure of a spherical quantum dot using a combination of quantum genetic algorithm and Hartree-Fock-Roothaan method The electronic structure of Quantum Dot (QD), GaAs/AlxGa1-xAs, has been investigated by using a combination of Quantum Genetic Algorithm (QGA) and Hartree-Fock-Roothaan (HFR) method. One-electron system with an on-center impurity is considered by assuming a spherically symmetric confining potential of finite depth. The ground and excited state energies of one-electron QD were calculated depending on the dot radius and stoichiometric ratio. Expectation values of energy were determined by using the HFR method along with Slater-Type Orbitals (STOs) and QGA was used for the wave-functions optimization. In addition, the effect of the size of the basis set on the energy of QD was investigated. We also calculated the binding energy for a dot with finite confining potential. We found that the impurity binding energy increases for the finite potential well when the dot radius decreases. For the finite potential well, the binding energy reaches a peak value and then diminishes to a limiting value corresponding to the radius for which there are no bound states in the well. Whereas in previous study, in Ref. 40, for the infinite potential well, we found that the impurity binding energy increases as the dot radius decreases.

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

electronic structure of spherical quantum dot


Image contour based on context aware in complex wavelet domain Active contours are used in the image processing application including edge detection, shape modeling, medical image-analysis, detectable object boundaries, etc. Shape is one of the important features for describing an object of interest. Even though it is easy to understand the concept of 2D shape, it is very difficult to represent, define and describe it. In this paper, we propose a new method to implement an active contour model using Daubechies complex wavelet transform combined with B-Spline based on context aware. To show the superiority of the proposed method, we have compared the results with other recent methods such as the method based on simple discrete wavelet transform, Daubechies complex wavelet transform and Daubechies complex wavelet transform combined with B-Spline.

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

daubechies complex wavelet transform
active contour


MEPAR-miner: Multi-expression programming for classification rule mining Classification and rule induction are two important tasks to extract knowledge from data. In rule induction, the representation of knowledge is defined as IF-THEN rules which are easily understandable and applicable by problem-domain experts. In this paper, a new chromosome representation and solution technique based on Multi-Expression Programming (MEP) which is named as MEPAR-miner (Multi-Expression Programming for Association Rule Mining) for rule induction is proposed. Multi-Expression Programming (MEP) is a relatively new technique in evolutionary programming that is first introduced in 2002 by Oltean and Dumitrescu. MEP uses linear chromosome structure. In MEP, multiple logical expressions which have different sizes are used to represent different logical rules. MEP expressions can be encoded and implemented in a flexible and efficient manner. MEP is generally applied to prediction problems; in this paper a new algorithm is presented which enables MEP to discover classification rules. The performance of the developed algorithm is tested on nine publicly available binary and n-ary classification data sets. Extensive experiments are performed to demonstrate that MEPAR-miner can discover effective classification rules that are as good as (or better than) the ones obtained by the traditional rule induction methods. It is also shown that effective gene encoding structure directly improves the predictive accuracy of logical IF-THEN rules.

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

classification rules
evolutionary programming

data mining
multi-expression programming


when objects collide experiences with reusing multiple class hierarchies Well-designed reusable class libraries are often incompatible due to architectural mismatches such as error-handling and composition conventions. We identify five pragmatic dimensions along which combinations of subsystems must match, and present detailed examples of conflicts resulting from mismatches. Examples are drawn from our experiences of integrating five subsystem-level class hierarchies into an object-oriented hypertext platform. We submit that effective reuse will require that these pragmatic decisions be explicitly identified in descriptions of reusable software. Such descriptions will enable developers to identify and combine subsystems whose architectures are compatible.

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

hypertext software reuse platform examples hierarchies libraries class

pragmatics conflict developer architecture matching object experience object-oriented effect errors reusability compositing


On a wind-driven, double-gyre, quasi-geostrophic ocean model: Numerical simulations and structural analysis The main objectives of this paper are to adapt an efficient and accurate spectral-projection method for a wind-driven, double-gyre, mid-latitude, quasi-geostrophic ocean model, and to study the double-gyre phenomenon from numerical and structural analysis points of view. A number of numerical simulations are carried out and their structural stability and structural transition/bifurcation are investigated using a new dynamical systems theory of two-dimensional incompressible hows, (C) 1999 Academic Press.

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

double-gyre
quasi-geostrophic
wind-driven ocean circulation
spectral-projection method
structural bifurcation


The application of behavioral features model to road traffic modeling and analysis The presented study deals with an object-relation mental model of drivers reasoning. The model stands on logic positions and brings a degree of logical proving into advanced microscopic models of road traffic. The future improvement of microscopic simulation is possible only by improvement of driver's behavior models, applying mental models of human drivers. The works are based on many sources: robotics, mathematical logic, cognitive science, computer science (ontologies, object oriented representation), and psychological researches from the fields of mental capacity, human problem solving, etc.

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

mental models
object oriented representation
features
microscopic simulation


process modelling using petri nets This paper discusses the reasons, which impose Petri nets as a conceptual standard for modelling and analysis of workflow. Petri nets notation is used for representation of the main routing constructs as weft as for the workflow process description. The correspondence of Petri-net-based model and graph model is demonstrated.

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

routing constructs
workflow
process modelling