Effect of dimensional parameters on the current of MSM photodetector In this work, we present the influence of dimensional parameters on dark current and photocurrent of the metalsemiconductormetal photodetector (MSM). MSM photodetectors of different sizes have been fabricated on GaAs (NID). The active area of MSM samples varies between 11?m2 and 1010?m2 with equal electrodes spacing and finger widths (l=D) varying between 0.2 and 1?m. The I(V) characterization in inverse and direct polarization in darkness shows good symmetry of curves, which shows the good performance of components and successful fulfillment of the Schottky contacts. The application of laser fiber of incident light power of 16mW at wavelength of 850nm for the illumination of the MSM photodetectors showed the evolution of the photocurrent ranging from 0.75 to 1.81mA, respectively, for 1 to 0.2?m electrodes spacing at 3V and active area S=33?m2. We showed also that variation ranging from 0.45 to 2.5mA, respectively, for S=11?m2 to S=1010?m2 at 3V and 0.3?m electrodes spacing. The resistance of MSM photodetectors obtained evolved proportionally to the electrodes spacing (0.87k? for D=0.2?m and 2.27k? for D=1?m with S=33?m2) and inversely proportional to the surface area (2.02k? for S=11?m2, and 0.56k? for S=1010?m2 with 0.3?m inter electrodes spacing).

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

metalsemiconductormetal (msm)
gallium arsenide (gaas)
schottky contact


A steganographic method for hiding secret data using side match vector quantization To increase the number of the embedded secrets and to improve the quality of the stego-image in the vector quantization (VQ)-based information hiding scheme, in this paper, we present a novel information-hiding scheme to embed secrets into the side match vector quantization (SMVQ) compressed code. First, a host image is partitioned into nonoverlapping blocks. For these seed blocks of the image, VQ is adopted without hiding secrets. Then, for each of the residual blocks, SMVQ or VQ is employed according to the smoothness of the block such that the proper codeword is chosen from the state codebook or the original codebook to compress it. Finally, these compressed codes represent not only the host image but also the secret data. Experimental results show that the performance of the proposed scheme is better than other VQ-based information hiding scheme in terms of the embedding capacity and the image quality. Moreover, in the proposed scheme, the compression rate is better than the compared scheme.

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

steganography
side match vector quantization


Combining 3D flow fields with silhouette-based human motion capture for immersive video In recent years, the convergence of computer vision and computer graphics has put forth a new field of research that focuses on the reconstruction of real-world scenes from video streams. To make immersive 3D video reality, the whole pipeline spanning from scene acquisition over 3D video reconstruction to real-time rendering needs to be researched. In this paper, we describe latest advancements of our system to record, reconstruct and render free-viewpoint videos of human actors. We apply a silhouette-based non-intrusive motion capture algorithm making use of a 3D human body model to estimate the actors parameters of motion from multi-view video streams. A renderer plays back the acquired motion sequence in real-time from any arbitrary perspective. Photo-realistic physical appearance of the moving actor is obtained by generating time-varying multi-view textures from video. This work shows how the motion capture sub-system can be enhanced by incorporating texture information from the input video streams into the tracking process. 3D motion fields are reconstructed from optical flow that are used in combination with silhouette matching to estimate pose parameters. We demonstrate that a high visual quality can be achieved with the proposed approach and validate the enhancements caused by the the motion field step.

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

3d video
human motion capture
optical flow


Modelling of magnetic anisotropy in the finite element method Purpose - The aim of this paper is to present an approach, able to deal with different models for anisotropy in the finite element method, and how it can be integrated in its formulation. Design/methodology/approach - This approach is to apply this to the study of power transformers, in which grain-oriented steel sheets are usually used. In this type of analysis, magnetic characteristics of the steel sheets such as non-linearity and anisotropy, or even the hysteresis, must be taken into account. Findings - The Newton-Raphson method is generally used to solve the system of equations, but it is a CPU-time-consuming task, especially when finite element models and circuit equations are coupled and therefore, time is considered in the analysis. Originality/value - An approach able to deal with different models for anisotropy in the finite element method is 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 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


Circuit implementation of a fully programmable and continuously slope tunable triangular/trapezoidal membership function generator In this article, a fully programmable membership function generator (MFG) is proposed. This MFG is capable of generating triangular, trapezoidal as well as both S-shaped and Z-shaped membership functions simultaneously. Utilizing a differential pair as an analog switch leads to relax the design of fuzzy systems control part. This MFG has the ability of adapting itself with various fuzzy controllers which produce different control voltage ranges. Unlike the available reported literatures, this MFG uses a new analog programmable current mirror (APCM) instead of digitally programmable current mirrors to adjust the slopes of membership functions. Extensive time domain simulations have been carried out using Hspice by level 49 parameters (BSIM3v3) in standard CMOS technology to validate the effective performance of the proposed MFG.

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

continuous slope programmability
trapezoidal mfg
triangular mfg


Two Fast and Robust Modified Gaussian Mixture Models Incorporating Local Spatial Information for Image Segmentation The Gaussian Mixture Model (GMM) with the spatial constraint, e.g. Hidden Markov Random Field (HMRF), has been proven effective for image segmentation. The parameter ? in the HMRF model is used to balance between robustness to noise and effectiveness of preserving the detail of the image. In other words, the determination of parameter ? is, in fact, noise dependent to some degree. In this paper, we propose a simple and effective algorithm to make the traditional Gaussian Mixture Model more robust to noise, with consideration of the relationship between the local spatial information and the pixel intensity value information. The conditional probability of an image pixel is influenced by the probabilities of pixels in its immediate neighborhood to incorporate the spatial and the intensity information. In this case, the parameter ? can be assigned to a small value to preserve image sharpness and detail in non-noise images. Meanwhile, the neighborhood window is used to tolerate the noise for heavy-noised images. Thus, the parameter ? is independent of image noise degree in our model. Furthermore, we propose another algorithm for our modified GMM (MGMM) with the simplification of conditional probability computation (MGMM_S). Finally, our algorithm is not limited to GMM it is general enough so that it can be applied to other distributions based on the construction of the Finite Mixture Model (FMM) technique. Experimental results of synthetic and real images demonstrate the improved robustness and effectiveness of our approach.

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

gaussian mixture model
hmrf
image segmentation

em algorithm
local information
spatial constraints


facts controller for bagasse based cogeneration systems Industrial growth in India and the change in living styles of people in the last two decades have resulted in a steady rise in the demand for power. Consequently, the power sector has registered a phenomenal growth. Despite this growth in power generation capacity, there is always a gap in the demand for power and the power generated. Therefore, In India attempt has been made to generate power by using renewable energy sources and also to implement a suitable co-generation scheme in a sugar factory to generate power for not only meeting the requirements of the sugar factory but also feeding the excess power to the state electricity grid. However the power feed from co-generation systems suffers from power quality problems, especially; voltage sags and voltage swells. This paper presents one such sugar factory based co-generation systems that utilizes 12500 kVA synchronous alternator. The actual system is simulated in MATLAB/Simulink. To examine the dynamic responses of the co-generation system during the fault and other abnormal conditions the simulation is run with and without power electronics based FACTS controller. The results obtained in each case are presented and based on the results analysis the utility of the FACTS controller for power quality improvement of sugar factory based co-generation systems is examined.

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


On Guess and Determine Cryptanalysis of LFSR-Based Stream Ciphers In this paper, the complexity of applying a guess and determine attack to so-called Linear Feedback Shift register (LFSR)-based stream ciphers is analyzed. This family of stream ciphers uses a single or several LFSR and a filtering function F : GF(2)(n) -> GF(2)(m) to generate the blocks of m >= 1 keystream bits at the time. In difference to a classical guess and determine attack, a method based on guessing certain bits in order to determine the remaining secret key/state bits, our approach efficiently takes advantage of the reduced preimage space for relatively large in and at the same time employing the design structure of the cipher. Several variations of the algorithm are derived to circumvent the sensitivity of attack to the input data, n,m and the key length. In certain cases, our attack outperforms classical Algebraic attacks [10]; these being considered as one of the most efficient cryptanalyst tools for this type of ciphers. A superior performance of our attack over algebraic attacks is demonstrated in case the filtering function belongs to the extended Maiorana-McFarland class.

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

algebraic attacks
stream ciphers
guess and determine

algebraic immunity
annihilators
linear feedback shift register (lfsr)
filtering generator
nonlinear combiner
boolean function
filter state guessing attack


Non-Darcy flow in disordered porous media: A lattice Boltzmann study It is well known that the Darcy law is insufficient for describing high-rate flows in porous media. However, it is still an open problem to establish a universal form for the nonlinear correction to Darcy law. In this work, we will investigate numerically the non-Darcy effect on incompressible flows through disordered porous media. Numerical simulations at pore-scale level are carried out with the Reynolds number varying from 0.02 to 30, which covers the Darcy and non-Darcy flow regimes. Three regimes are identified for flow through porous media, i.e., a linear Darcy regime at vanishing Reynolds number, a cubic transitional or weak inertial regime at low but finite Reynolds number, and a quadratic Forchheimer or strong inertial regime at larger Reynolds numbers. Finally, a general correlation is proposed to include the non-Darcy effect, as an extension to the common empirical expressions. (C) 2010 Elsevier Ltd. All rights reserved.

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


Automatic classification of block-shaped parts based on their 2D projections This paper presents a classification scheme for 3D block-shaped parts. A part is block-shaped if the contours of its orthographic projections are all rectangles, A block-shaped part is classified based on its partitioned view-contours, which are the result of partitioning the contours of its orthographic projections by visible or invisible projected line;segments. The regions and their adjacency in a partitioned view-contour are first converted to a graph, then to a reference tree, and finally to a vector form, with which a back-propagation neural network classifier can be trained and applied. The proposed back-propagation neural network classifier is in a cascaded structure and has advantages that each network can be limited to a small size and trained independently. Based on the classification results on their partitioned view-contours, parts are grouped into families that can be in one of the three levels of similarity. Extensive empirical tests have been performed; the pros and cons of the approach are also investigated. (C) 1999 Elsevier Science Ltd. All rights reserved.

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

part classification
block-shaped parts
neural networks


INFORMATION DIFFUSION IN FACEBOOK-LIKE SOCIAL NETWORKS UNDER INFORMATION OVERLOAD Research on social networks has received remarkable attention, since many people use social networks to broadcast information and stay connected with their friends. However, due to the information overload in social networks, it becomes increasingly difficult for users to find useful information. This paper takes Facebook-like social networks into account, and models the process of information diffusion under information overload. The term view scope is introduced to model the user information-processing capability under information overload, and the average number of times a message appears in view scopes after it is generated is proposed to characterize the information diffusion efficiency. Through theoretical analysis, we find that factors such as network structure and view scope number have no impact on the information diffusion efficiency, which is a surprising result. To verify the results, we conduct simulations and provide the simulation results, which are consistent with the theoretical analysis results perfectly.

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

information diffusion
information overload


a comparison of two input methods for keypads on mobile devices Two mobile device text entry methods were evaluated. The well-known Multitap method was compared to our RollPad method on a new device utilizing a tactile touchpad in place of a keypad. RollPad was well liked by participants. KSPC (keystrokes per character) was significantly lower: 1.42 compared to 2.13 with Multitap. However, no significant difference was found in error rates or entry speed, with speed measured at about 7.3 wpm for both methods.

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

place
text entry
character
method
input
device
mobile devices

tactile feedback
tactiles
phone keypad
errors
comparisons
participant


Dynamics of the urban lightscape The manifest importance of cities and the advent of novel data about them are stimulating interest in both basic and applied urban science (Bettencourt et al., 2007 [4]; Bettencourt, 2013 [3]). A central task in this emerging field is to document and understand the pulse of the city in its diverse manifestations (e.g., in mobility, energy use, communications, economics) both to define the normal state against which anomalies can be judged and to understand how macroscopic city observables emerge from the aggregate behavior of many individuals (Louail, 2013 [9]; Ferreira et al., 2013 [6]). Here we quantify the dynamics of an urban lightscape through the novel modality of persistent synoptic observations from an urban vantage point. Established astronomical techniques are applied to visible light images captured at 0.1Hz to extract and analyze the light curves of 4147 sources in an urban scene over a period of 3 weeks. We find that both residential and commercial sources in our scene exhibit recurring aggregate patterns, while the individual sources decorrelate by an average of one hour after only one night. These highly granular, stand-off observations of aggregate human behavior which do not require surveys, in situ monitors, or other intrusive methodologies have a direct relationship to average and dynamic energy usage, lighting technology, and the impacts of light pollution. They may also be used indirectly to address questions in urban operations as well as behavioral and health science. Our methodology can be extended to other remote sensing modalities and, when combined with correlative data, can yield new insights into cities and their inhabitants.

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

urban imaging
visible light observations
time series
image processing
pattern recognition


Enterprise architecture patterns for business process support analysis The field of enterprise architectures lacks architecture patterns that would support analysis of a given enterprise architecture, comparison of different enterprise architecture solutions and provide guidelines for development of a target enterprise architecture based on the analysis of existing enterprise architecture. In this paper, we focus on business process support analysis using information derived from enterprise architecture description. We give a systematic overview of important aspects. We establish and formally define foundational enterprise architecture patterns for business process support analysis. They are implementation independent and enable more efficient qualitative architecture analysis of business process support, which is the basis for achieving more optimal business operation. We have defined the patterns using the standard enterprise architecture language ArchiMate. They are formalized in a way that enables their implementation in enterprise architecture tools. This is an important characteristic that allows for efficient work by automatic detection of different, more or less suitable, architecture structures. We have derived the patterns based on real-world enterprise architecture descriptions and have used and verified them in enterprise architecture analysis and planning projects for four large organizations. The enterprise architecture analysis patterns address an important research issue in the field of enterprise architectures that has so far not been systematically researched.

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

enterprise architecture
business process support analysis
business process

enterprise architecture pattern
business object


Automatic security assessment for next generation wireless mobile networks Wireless networks are more and more popular in our life, but their increasing pervasiveness and widespread coverage raises serious security concerns. Mobile client devices potentially migrate, usually passing through very light access control policies, between numerous and heterogeneous wireless environments, bringing with them software vulnerabilities as well as possibly malicious code. To cope with these new security threats the paper proposes a new active third party authentication, authorization and security assessment strategy in which, once a device enters a new Wi-Fi environment, it is subjected to analysis by the infrastructure, and if it is found to be dangerously insecure, it is immediately taken out from the network and denied further access until its vulnerabilities have been fixed. The security assessment module, that is the fundamental component of the aforementioned strategy, takes advantage from a reliable knowledge base containing semantically-rich information about the mobile node under examination, dynamically provided by network mapping and configuration assessment facilities. It implements a fully automatic security analysis framework, based on AHP, which has been conceived to be flexible and customizable, to provide automated support for real-time-execution of complex security/risk evaluation tasks which depends on the results obtained from different kind of analysis tools and methodologies. Encouraging results have been achieved utilizing a proof-of-concept model based on current technology and standard open-source networking tools.

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

dynamic access control
active networks
analytic hierarchy process
multiple criteria decision analysis
nomadic computing
security audit
ubiquitous networking


Storage space allocation to maximize inter-replenishment times Given a set of storage spaces and a set of products, with specific space requirements and demand rates, we find the optimal product assignment that will lead to the longest time before any product is depleted. When demand rates are known with certainty, the assignment is found through the solution of a maxmin integer program. When demand rates are stochastic with a common law, the assignment is found by solving an integer programme the objective of which is a non-homogeneous partial difference equation of first order. Unlike what common rules of thumb would dictate, our results show that the proportion of spaces assigned to a product is not necessarily equal to its demand frequency. Numerical computations show that employing the latter policy would result in inter-replenishment times that are about 24% shorter than the optimal solution.

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

integer programming
inter-replenishment times
stochastic demand


Numerical modeling of traffic-induced ground vibration Ground vibrations due to road traffic constitute a major environmental problem. This paper presents a numerical model for the analysis and prediction of the ground vibrations due to the road traffic. A car model with four degrees of freedom is used for the determination of the load due to the road traffic. The load is then introduced in a 3D finite difference model for the determination of the traffic-induced ground vibrations. The numerical model is validated using field data. Numerical analyses show that both the amplitude and frequency of the traffic-induced vibrations are mainly affected by the vehicle speed, the road unevenness and the vehicle suspension system. Some recommendations are suggested for the reduction of these vibrations.

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

traffic
vehicle
vibration
numerical model
road unevenness


critical slicing for software fault localization Developing effective debugging strategies to guarantee the reliability of software is important. By analyzing the debugging process used by experienced programmers, we have found that four distinct tasks are consistently performed: (1) determining statements involved in program failures, (2) selecting suspicious statements that might contain faults, (3) making hypotheses about suspicious faults (variables and locations), and (4) restoring program state to a specific statement for verification. This research focuses support for the second task, reducing the search domain for faults, which we refer to as fault localization. We explored a new approach to enhancing the process of fault localization based on dynamic program slicing and mutation-based testing. In this new approach, we have developed the technique of Critical Slicing to enable debuggers to highlight suspicious statements and thus to confine the search domain to a small region. The Critical Slicing technique is partly based on "statement deletion" mutant operator of the mutation-based testing methodology. We have explored properties of Critical Slicing, such as the relationship among Critical Slicing, Dynamic Program Slicing, and Executable Static Program Slicing; the cost to construct critical slices; and the effectiveness of Critical Slicing. Results of experiments support our conjecture as to the effectiveness and feasibility of using Critical Slicing for fault localization.This paper explains our technique and summarizes some of our findings. From these, we conclude that a debugger equipped with our proposed fault localization method can reduce human interaction time significantly and aid in the debugging of complex software.

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

faults
task
static program slicing
critical slicing
human interaction
fault localization
program slicing
paper
failures
search
software
research
method
strategies
methodology
region
reliability
testing
dynamic
verification
process
support
debugging
cost

experience
timing
slice
locality
select
variability
relationships
locatability
mutation
mutation analysis
operability
complexity
critic
effect
dynamic program slicing
programmer


M-CLIQUES: Modified CLIQUES key agreement for secure multicast In secure multicast applications, members may join or leave frequently and key management is one of the most challenging problems. In this research, we proposed a modified CLIQUES key management protocol. It was the modification of CLIQUES that consisted of two stages: Static CLIQUES and Hierarchical CLIQUES. In Static CLIQUES, a static group controller was used to distribute the partial keys to group members. Compared with traditional CLIQUES, the Static CLIQUES was more secure for key storage, less complex, less processing requirement in the user machine, and easier to provide member privacy protection. In Hierarchical CLIQUES, a hierarchical structure was employed to support larger size of group members. Our experiments showed that the modified CLIQUES protocol was more scalable than CLIQUES. Also, it required less processing power than the Key Tree-Based approaches.

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

gc
sgc
partial key set
interval-based re-keying
static cliques
hierarchical cliques


BCOOPL: A language for controlling component interactions This paper introduces BCOOPL, which stands for Basic Concurrent Object-Oriented Programming Language. BCOOPL was designed to support component-based development. In particular, it focuses on the specification of weakly-coupled components and the specification of interaction sequences between them. BCOOPL supports two design patterns directly. The built-in observer design pattern encourages the construction of weakly-coupled components. Its support for the mediator design pattern allows to govern the interactions between those components. These language features cater for the design and implementation of flexible systems in which specifications of individual component behavior is separated from specifications of component interactions. A high level overview of BCOOPL's key concepts is given, which are exemplified by means of a process control example.

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

language support for coordination control


A directed hypergraph model for random time dependent shortest paths ? We consider routing problems in dynamic networks where arc travel times are both random and time dependent. The problem of finding the best route to a fixed destination is formulated in terms of shortest hyperpaths on a suitable time-expanded directed hypergraph. The latter problem can be solved in linear time, with respect to the size of the hypergraph, for several definitions of hyperpath length. Different criteria for ranking routes can be modeled by suitable definitions of hyperpath length. We also show that the problem becomes intractable if a constraint on the route structure is imposed.

O O O O O B O O B I O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 programming
time-dependent
directed hypergraphs


An estimate on the convergence of MKZ-Bezier operators The point wise approximation properties of the MKZ-Bezier operators M(n,alpha)(f, x) for alpha >= 1 have been studied in [X.M. Zeng, Rates of approximation of bounded variation functions by two generalized Meyer-Konig-Zeller type operators, Comput. Math. Appl. 39 (2000) 1-13]. The aim of this paper is to study the pointwise approximation of the operators M(n,alpha)(f, x) for the other case 0 < alpha < 1. By means of some new estimate techniques and a result of Guo and Qi [S. Guo, Q. Qi, The moments for the Meyer-Konig and Zeller operators, Appl. Math. Lett. 20 (2007) 719-722], we establish an estimate formula on the rate of convergence of the operators M(n,alpha)(f. x) for the case 0 < alpha < 1. (c) 2008 Elsevier Ltd. All rights reserved.

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

rate of convergence
pointwise approximation

mkz-bezier operators
lebesgue-stieltjes integral
holder inequality


Organic light-emitting diodes with a nanostructured TiO2 layer at the interface between ITO and NPB layers Organic light-emitting diodes (OLEDs) with a nanostructured TiO2 layer at the interface between indium tin oxide and a-naphtylphenyliphenyl diamine layers were fabricated using a vacuum evaporation method. The nanostructured TiO2 layer was achieved by the SolGel method. Compared to the different thickness of the buffer layer, the OLEDs with the 6 nm buffer layer showed the highest efficiency. The enhancements in efficiency result from an improved balance of hole and electron injections and a more homogeneous adhesion of the buffer layer inserted.

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

organic light-emitting diode
brightness
the tunneling effect


A performance study of general-purpose applications on graphics processors using CUDA Graphics processors (GPUs) provide a vast number of simple, data-parallel, deeply multithreaded cores and high memory bandwidths. GPU architectures are becoming increasingly programmable, offering the potential for dramatic speedups for a variety of general-purpose applications compared to contemporary general-purpose processors (CPUs). This paper uses NVIDIAs C-like CUDA language and an engineering sample of their recently introduced GTX 260 GPU to explore the effectiveness of GPUs for a variety of application types, and describes some specific coding idioms that improve their performance on the GPU. GPU performance is compared to both single-core and multicore CPU performance, with multicore CPU implementations written using OpenMP. The paper also discusses advantages and inefficiencies of the CUDA programming model and some desirable features that might allow for greater ease of use and also more readily support a larger body of applications.

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

graphics processors
gpu
cuda
openmp
multicore

gpgpu
parallel programming
heterogeneous computing organizations
manycore


Students' appraisal of emotional and relational experience whilst collaborating online using text based communication The impacts that the lack of physical cues and non-verbal cues of emotional expression has on the student learning experience in text based online environments were targeted separately in this study. A questionnaire was constructed with separate items for non-verbal cues of emotional expression and cues to physical identity. The survey also included questions about students' previous experience with technology and collaboration, and their motivations for undertaking the course. Views about their interactions with other students were also sought. The responses of 256 students who had undertaken a text based online course where collaboration was a mandatory requirement were collected and subsequently analysed using cluster analysis. Four distinct cohorts of students were identified. Using a conceptual approach borrowed from neuroscience, modularity, it has been possible to encapsulate the effects of three distinct aspects of collaborating in text based online contexts, lack of cues to physical identity, lack of cues to emotional expression and interaction experience. These aspects were analysed alongside the student profiles for each of the four cohorts. The findings indicate that the external factors that an individual student brings to a learning context can impact on the learning experience. Neuroscientifically based knowledge that is relevant for the findings of the survey are identified and considered in terms of the questions raised from an interdisciplinary perspective. (C) 2009 Elsevier Ltd. All rights reserved.

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

emotion
online interaction
computer mediated communication


Bridging objects and relations: a mediator for an OO front-end to RDBMSs An object-oriented paradigm is established as the leading approach for developing non-traditional applications, such as GIS or multimedia systems. On the other hand, relational databases have dominated the area of data processing in the past decade. These two trends motivate the research on integrating OO applications with relational databases. This paper presents our approach to the symbiosis of the OO and relational data models, which is built into GinisNT, a scalable OO GIS framework based on an OO-to-relational mapping algorithm. The mapping algorithm transforms classes and objects into relations and tuples, and vice versa, instantiates objects from relational databases. The methodology presented here is extremely efficient, as has been proved by a number of applications developed in GinisNT, and is at the same time cost efficient, as it builds upon existing platforms.

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

oo-to-relational mapping algorithm
object-oriented model
relational model


Detection of a Non-Pathogenic Variant of Anaplasma phagocytophilum in Ixodes ricinus from La Rioja, Spain Abstract: Our aim was to identify variants of Anaplasma phagocytophilum 16S rRNA gene sequences among products amplified from Ixodes ricinus collected in La Rioja, Spain. A. phagocytophilum AP-variant 1, reported as non-pathogenic, was detected in 12 samples (two adults and ten nymphs). This finding could justify the low incidence of human anaplasmosis in our area, despite the high prevalence of A. phagocytophilum in ticks.

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

anaplasma phagocytophilum
human anaplasmosis
ixodes ricinus
ticks
spain


Inventor team size as a predictor of the future citation impact of patents Forward citations are widely recognized as a useful measure of the impact of patents upon subsequent technological developments. However, an inherent characteristic of forward citations is that they take time to accumulate. This makes them valuable for retrospective impact evaluations, but less helpful for prospective forecasting exercises. To overcome this, it would be desirable to have indicators that forecast future citations at the time a patent is issued. In this paper, we outline one such indicator, based on the size of the inventor teams associated with patents. We demonstrate that, on average, patents with eight or more co-inventors are cited significantly more frequently in their first 5years than peer patents with fewer inventors. This result holds true across technologies, assignee type, citation source (examiner versus applicant), and after self-citations are accounted for. We hypothesize that inventor team size may be a reflection of the amount of resources committed by an organization to a given innovation, with more researchers attached to innovations regarded as having particular promise or value.

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


Model detection for functional polynomial regression A functional polynomial regression model which includes the functional linear model and functional quadratic model as two special cases is considered. In functional polynomial regression, one must balance the costs and benefits of using more parameters in the model. The method of model detection to determine which orders of the polynomial are significant in functional polynomial regression is developed. The proposed methods can identify the true model consistently and have good prediction performances. Numerical studies clearly confirm our theories.

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

functional principal components
adaptive group lasso
consistency


The interdependent security problem in the defense industrial base: An agent-based model on social network This paper extends the Kunreuther and Heal game-theoretic model of the interdependent security problem by applying the model to an empirically based network environment. The scale-free network is derived from the contract-based organization of the defense industry. Theft of knowledge in this industry could have an impact on both economic and national security. However, imperfect information in the IT security market and the interdependent nature of the investment decision create the potential for underinvestment or overinvestment. An agent-based modeling technique demonstrates that social network topology may influence policy measures designed to induce tipping and cascading in cyber security investments. Published by Elsevier B.V.

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

scale-free network
cyber espionage
critical infrastructure


Lifting/descending processes for polynomial zeros The recently proposed Chebyshev-like lifting map for the zeros of a univariate polynomial was motivated by its applications to splitting a univariate polynomial p(z) numerically into factors, which is a major step of some most efficient algorithms fur approximating polynomial zeros, We complement the Chebyshev-like lifting process by a descending process, decrease the estimated computational cost of performing the algorithm, demonstrate its correlation to Graeffe's lifting/descending process, and generalize lifting from Graeffe's and Chebyshev-like maps to any fixed rational map of the zeros of the input polynomial. (C) 2000 Academic Press.

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

numerical splitting a polynomial into factors


Synchronization based on mixture alignment for sound source separation in wireless acoustic sensor networks We study the effects of misalignment over BSS algorithms in WASN. A theoretical synchronization relaxes the constraint over the time frame length. Two novel alignment methods are inspired in the theoretical synchronization. The proposed methods synchronize the mixtures with a reduced transmission bandwidth.

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

speech separation
short-term log-energy
wireless acoustic sensor network


SEPARABILITY: A NEW APPROACH FROM THE CONIC STRUCTURE OF POSITIVE OPERATORS We exploit the cone structure of unnormalized quantum states to reformulate the separability problem. Firstly a convex combination of every quantum state rho in terms of a state C(rho) with the same rank and another one E(rho) with lower rank is perfomed, with weights 1 - lambda(rho) and lambda(rho), respectively. Secondly a scalar lambda(rho)* is computed. Then rho is separable if, and only if, lambda(rho) <= lambda(rho)*. The computation of lambda(rho)* has been undergone under the simplest choice for C(rho) as a product matrix and E(rho) being a pure state, valid for any bipartite and multipartite system in arbitrary dimensions. A necessary condition is also formulated when E(rho) is not pure in the bipartite case.

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


an association analysis approach to biclustering The discovery of biclusters, which denote groups of items that show coherent values across a subset of all the transactions in a data set, is an important type of analysis performed on real-valued data sets in various domains, such as biology. Several algorithms have been proposed to find different types of biclusters in such data sets. However, these algorithms are unable to search the space of all possible biclusters exhaustively. Pattern mining algorithms in association analysis also essentially produce biclusters as their result, since the patterns consist of items that are supported by a subset of all the transactions. However, a major limitation of the numerous techniques developed in association analysis is that they are only able to analyze data sets with binary and/or categorical variables, and their application to real-valued data sets often involves some lossy transformation such as discretization or binarization of the attributes. In this paper, we propose a novel association analysis framework for exhaustively and efficiently mining "range support" patterns from such a data set. On one hand, this framework reduces the loss of information incurred by the binarization- and discretization-based approaches, and on the other, it enables the exhaustive discovery of coherent biclusters. We compared the performance of our framework with two standard biclustering algorithms through the evaluation of the similarity of the cellular functions of the genes constituting the patterns/biclusters derived by these algorithms from microarray data. These experiments show that the real-valued patterns discovered by our framework are better enriched by small biologically interesting functional classes. Also, through specific examples, we demonstrate the ability of the RAP framework to discover functionally enriched patterns that are not found by the commonly used biclustering algorithm ISA. The source code and data sets used in this paper, as well as the supplementary material, are available at http://www.cs.umn.edu/vk/gaurav/rap.

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

biclustering
range support
microarray data
association analysis


Exploring new tensegrity structures via mixed integer programming A tensegrity structure is a prestressed pin-jointed structure consisting of continuously connected tensile members (cables) and disjoint compressive members (struts). Many classical tensegrity structures are prestress stable, i.e., they are kinematically indeterminate but stabilized by introducing prestresses. This paper presents a procedure for generating various prestress stable tensegrity structures. This method is based on truss topology optimization and does not require connectivity relation of cables and struts of a tensegrity structure to be known in advance. Unlike the conventional form-finding methods, the locations of nodes are fixed throughout optimization. The optimization problem with the constraints expressing the definition of tensegrity structure, kinematical indeterminacy, and symmetry of configurations is formulated as a mixed integer linear programming (MILP) problem. Numerical experiments demonstrate that various tensegrity structures can be generated from one given initial structure by solving the presented MILP problems by using a few control parameters.

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

tensegrity
topology optimization
integer programming
symmetry


Flow level performance analysis of a multi-service system supporting elastic and adaptive services We consider a multi-rate loss system where two types of non-peak allocated traffic flows receive service. Both elastic and adaptive flows are associated with a peak- and a minimum bandwidth requirement and they tolerate bandwidth compression while in service. The holding time of elastic flows depends on their received throughput, while the holding time of the adaptive flows is insensitive to that. Unfortunately, while this system is Markovian under quite non-restrictive assumptions (that are often used in the literature), it is not reversible. We propose a method whereby the approximation of this system by a reversible system is possible. We derive recursive formulas for determining the occupancy distribution and the mean number of flows in the system. By using a continuous approximation of the discrete state space, we also derive an explicit formula for the average throughputs that is independent of the size of the state space. The recursive formulas and the continuous approximation together provide a powerful tool for the performance analysis of this quite general system in the sense that they allow the calculation of the blocking probabilities and the mean throughputs in medium and large systems as well.

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

bandwidth sharing objectives
multi-rate loss models
markov reward models


A statistical framework for picture reconstruction using 2D AR models This paper presents a framework for Filling In missing gaps in images and particularly patches with texture. The algorithm can also be used as a fallback mode in treating missing data for video sequence reconstruction. The underlying idea is to construct a parametric model of the p.d.f. of the texture to be re-synthesised and then draw samples from that p.d.f. to create the resulting reconstruction. A Bayesian approach is used to articulate 2D Autoregressive Models as generative models for texture (using the Gibbs sampler) given surrounding boundary conditions. A fast implementation is presented that iterates between pixelwise updates and blockwise parametric model estimation. The novel ideas in this paper are joint parameter estimation and fast, efficient texture reconstruction using linear models.

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

video reconstruction
statistical interpolation
texture synthesis
image reconstruction
image restoration
gibbs sampling
bayesian inference


Characterization of stray light of ArF lithographic tools: Modeling of power spectral density of an optical pupil Stray light (also called flare) in optical lithography is unwanted scattered light and is characterized by power spectral density (PSD) of an optical pupil. The PSD is evaluated on commercial dry and wet (immersion) ArF (193nm) lithographic scan tools by means of a modified disappearing pad test (so-called Kirk test). Doughnut-type pads are suggested for this disappearing pad test, which verifies that double ABC and fractal PSD describe the measured stray light better than Gaussian PSD both in the dry and the wet tools. The evaluated PSD is confirmed by the measurements of printed features on wafer.

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

point spread function (psf) of scattering


Distributed forensics and incident response in the enterprise Remote live forensics has recently been increasingly used in order to facilitate rapid remote access to enterprise machines. We present the GRR Rapid Response Framework (GRR), a new multi-platform, open source tool for enterprise forensic investigations enabling remote raw disk and memory access. GRR is designed to be scalable, opening the door for continuous enterprise wide forensic analysis. This paper describes the architecture used by GRR and illustrates how it is used routinely to expedite enterprise forensic investigations.

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

remote forensics
digital forensics
information security
malware
memory forensics
distributed computing


Field strength computation at edges in nonlinear magnetostatics Magnetostatic problems including iron components can be solved by a nonlinear indirect volume integral equation. Its unknowns are scalar field sources. They are evaluated iteratively. In doing so the integral representation of fields has to be calculated At edges singularities occur. Following a method to calculate the field strength on charged surfaces a way out is 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

magnetic fields
integral equations
nonlinear control systems
vectors


adaptive random testing through iterative partitioning revisited Recently, Adaptive Random Testing through Iterative Partitioning (IP-ART) has been proposed as a random testing method that is more effective than pure Random Testing. Besides this, it is supposed to be equally effective as very good random testing techniques, namely Distance-Based Adaptive Random Testing and Restricted Random Testing, while only having between linear and quadratic runtime. In the present paper, it is investigated what influence the ratio of width and height of a rectangular input domain has on the effectiveness of various Adaptive Random Testing methods. Based on our findings, an improved version of IP-ART is proposed. The effectiveness of the new method is also analyzed for various ratios of width and height of the input domain.

O B I O O O O O O B I O O O O O O O O O B I O O O O O O O B I O O O O O O O O O O O O B I O O O O B I O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O 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 case selection
adaptive random testing


A numerical study on 2-D compressive wave propagation in rock masses with a set of joints along the radial direction normal to the joints An explosion in a borehole or an accidental explosion in a tunnel will generate a two-dimensional (2-D) compressive wave that travels through the surrounding rock mass. For the problem of 2-D compressive wave propagation in a rock mass with parallel joints in the radial direction normal to the joints, parametric studies on the transmission ratio and the maximum rebound ratio are performed in universal distinct element code. The variation of the transmission ratio with the ratio of joint spacing to wavelength is generalized into a characteristic curve, which can be used as a prediction model for estimating the transmission ratio. The relationship between the maximum rebound ratio and the influence factors is obtained in charts. The charts can be used as a prediction model for estimating the maximum rebound ratio. The proposed prediction models for estimating the transmission ratio and the maximum rebound ratio are applied to a field explosion test, Mandai test in Singapore. The minimum possible values of peak particle velocity (PPV) at the monitoring points are estimated by using the proposed prediction model for estimating the transmission ratio along the radial direction normal to the joints. On the other hand, the maximum possible values of PPV are estimated by using the proposed prediction model for estimating the maximum rebound ratio along the same radial direction. The comparison shows a good agreement between the field-recorded PPVs and the estimated range of PPVs given by the minimum possible PPVs and the maximum possible PPVs at the monitoring points in Mandai test. The good agreement between the estimated and field-recorded values validates the proposed prediction models for estimating peak particle velocity in a rock mass with a set of joints due to application of a compressive wave at the boundary of a tunnel or a borehole.

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

transmission ratio
maximum rebound ratio
field explosion test


Heuristics for two-dimensional strip packing problem with 90 rotations Proposes a constructive phase based on the greedy placement and a partial tree search phase based on the backtracking strategy. Proposes a new sorting rule for all candidate placements based on the definition of action space in a greedy constructive phase. Attained highly competitive results in comparison with the state-of-the-art algorithms in the literature.

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

combinatorial optimization
deterministic algorithm


on-chip power supply noise and its implications on timing We address two problems of assessing the influence of power- supply variations on timing analysis. We present a method to assign a supply-dependent hold margin; and we describe a method to accurately characterize logic gates for the sen- sitivity of delay on supply-voltage variations. We use a com- mercial microcontroller as a design example.

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


Object-oriented construction of a multigrid electronic-structure code with Fortran 90 We describe the object-oriented implementation of a higher-order finite-difference density-functional code in Fortran 90. Object-oriented models of grid and related objects are constructed and employed for the implementation of an efficient one-way multigrid method we have recently proposed for the density-functional electronic-structure calculations. Detailed analysis of performance and strategy of the one-way multigrid scheme will be presented. (C) 2000 Elsevier Science B.V. All rights reserved.

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

electronic structure
density-functional theory
object-oriented programming
fotran 90
scientific computing


Study on gas kinetic unified algorithm for flows from rarefied transition to continuum The modified BGK equation adapted to various flow regimes can be presented by the aid of the basic characteristics on molecular movement and collision approaching to equilibrium. The discrete velocity ordinate method is developed and applied to the velocity distribution function to remove its continuous dependency on the velocity space, and then the velocity distribution function equation is cast into hyperbolic conservation law form with nonlinear source terms. Based on the unsteady time-splitting method and the non-oscillatory, containing no free parameters, and dissipative (NND) scheme, the gas kinetic finite difference second-order scheme is constructed for the computation of the discrete velocity distribution functions. The mathematical model on the interaction of molecules with solid surface is studied and used in the numerical method. Four types of numerical quadrature rules, such as the modified GaussHermite formula, the composite NewtonCotes integration method, the GaussLegendre numerical quadrature rule, and the Golden Section number-theoretic integral method, are developed and applied to the discretized velocity space to evaluate the macroscopic flow parameters at each point in the physical space. As a result, a unified simplified gas kinetic algorithm is established for the flows from rarefied transition to continuum regime. Based on analyzing the inner parallel degree of the unified algorithm, the parallel strategy adapted to the gas kinetic numerical algorithm is studied, and then the HPF parallel processing software for the unified algorithm is developed. To test the present method, the one-dimensional shock-tube problems, the flows past two-dimensional circular cylinder, and the flows around three-dimensional sphere and spacecraft shape with various Knudsen numbers are simulated. The computational results are found in high resolution of the flow fields and good agreement with the theoretical, DSMC, NS, and experimental results.

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

kinetic theory of gases
boltzmann model equation
discrete ordinate method
time-splitting method
nnd finite difference scheme
rarefied gas flow
continuum flow


Dependency-Free Parallel Progressive Meshes The constantly increasing complexity of polygonal models in interactive applications poses two major problems. First, the number of primitives that can be rendered at real-time frame rates is currently limited to a few million. Secondly, less than 45 million triangleswith vertices and normalcan be stored per gigabyte. Although the rendering time can be reduced using level-of-detail (LOD) algorithms, representing a model at different complexity levels, these often even increase memory consumption. Out-of-core algorithms solve this problem by transferring the data currently required for rendering from external devices. Compression techniques are commonly used because of the limited bandwidth. The main problem of compression and decompression algorithms is the only coarse-grained random access. A similar problem occurs in view-dependent LOD techniques. Because of the interdependency of split operations, the adaption rate is reduced leading to visible popping artefacts during fast movements. In this paper, we propose a novel algorithm for real-time view-dependent rendering of gigabyte-sized models. It is based on a neighbourhood dependency-free progressive mesh data structure. Using a per operation compression method, it is suitable for parallel random-access decompression and out-of-core memory management without storing decompressed data.

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

level of detail algorithms
real-time rendering
data compression


Verifying trace equivalence of a shared-memory-style communication system This paper describes a formal verification for a shared-memory-style communication system. We first describe two versions (i.e. abstract and concrete) of the communication system based on an I/O-automaton, which is a formal system for distributed algorithms. Then, we prove the concrete version can perform all the external operations of the abstract version. This result, together with a former result [3], leads to the equivalence of the two versions. The proof is done by Larch theorem prover, and is the ever largest case study using I/O-automata.

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


Alternative DRM formulations In this paper, we present two DRM formulations. For a pseudo-Poisson equation, if the right-hand side is a linear operation on the dependent variable, we can derive a new DRM formulation. In comparison with the traditional DRM formulation for the same equation, the proposed approach is much easier and more efficient. For the axisymmetric Poisson equation, we construct a DRM formulation by using the linear axisymmetric radial basis function. The particular solution involved is obtained in a closed form, and thus speeds up the evaluation of the particular solution. Three numerical examples demonstrate the accuracy and efficiency of these formulations.

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

pseudo-poisson equation
dual reciprocity method


On the Expressiveness of Implicit Provenance in Query and Update Languages Information describing the origin of data, generally referred to as provenance, is important in scientific and curated databases where it is the basis for the trust one puts in their contents. Since such databases are constructed using operations of both query and update languages, it is of paramount importance to describe the effect of these languages on provenance. In this article we study provenance for query and update languages that are closely related to SQL, and compare two ways in which they can manipulate provenance so that elements of the input are rearranged to elements of the output: implicit provenance, where a query or update only provides the rearranged output, and provenance is provided implicitly by a default provenance semantics; and explicit provenance, where a query or update provides both the output and the description of the provenance of each component of the output. Although explicit provenance is in general more expressive, we show that the classes of implicit provenance operations expressible by query and update languages correspond to natural semantic subclasses of the explicit provenance queries. One of the consequences of this study is that provenance separates the expressive power of query and update languages. The model is also relevant to annotation propagation schemes in which annotations on the input to a query or update have to be transferred to the output or vice versa.

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

reliability
theory
nested relational calculus
nested update language
conservativity


Automated Abstractions for Contract Validation Pre/postcondition-based specifications are commonplace in a variety of software engineering activities that range from requirements through to design and implementation. The fragmented nature of these specifications can hinder validation as it is difficult to understand if the specifications for the various operations fit together well. In this paper, we propose a novel technique for automatically constructing abstractions in the form of behavior models from pre/postcondition-based specifications. Abstraction techniques have been used successfully for addressing the complexity of formal artifacts in software engineering; however, the focus has been, up to now, on abstractions for verification. Our aim is abstraction for validation and hence, different and novel trade-offs between precision and tractability are required. More specifically, in this paper, we define and study enabledness-preserving abstractions, that is, models in which concrete states are grouped according to the set of operations that they enable. The abstraction results in a finite model that is intuitive to validate and which facilitates tracing back to the specification for debugging. The paper also reports on the application of the approach to two industrial strength protocol specifications in which concerns were identified.

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


Low-rank representation for 3D hyperspectral images analysis from map perspective A novel framework jointing the maximum a posteriori (MAP) model and low-rank representation (LRR) is proposed. The use of LRR can model feature selectivity and obtain a more compact and discriminative representation. The use of MAP model facilities us to exploit the connectivity of adjacent pixels in hyperspectral data.

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

3d hyperspectral data
semantic analysis
segmentation
markov random field (mrf)
low-rank representation (lrr)
maximum a posteriori (map)
remote sensing


On Finite Convergence of Iterative Methods for Variational Inequalities in Hilbert Spaces In a Hilbert space, we study the finite termination of iterative methods for solving a monotone variational inequality under a weak sharpness assumption. Most results to date require that the sequence generated by the method converges strongly to a solution. In this paper, we show that the proximal point algorithm for solving the variational inequality terminates at a solution in a finite number of iterations if the solution set is weakly sharp. Consequently, we derive finite convergence results for the gradient projection and extragradient methods. Our results show that the assumption of strong convergence of sequences can be removed in the Hilbert space case.

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

variational inequality
proximal point algorithm

weak sharp
metric projection
gradient projection method
extragradient method
hilbertspace


Low threshold and tunable all-optical switch using two-photon absorption in array of nonlinear ring resonators coupled to MZI In this paper a novel structure based on MachZehnder Interferometer (MZI) and an array of nonlinear ring resonators for all-optical switching including very low threshold, fast and all-optically tunable is presented. In this proposal, an array including N ring resonators is coupled to one arm of MZI to introduce the required nonlinear phase shift to switching. Also, two-photon absorption phenomenon is used and will be proposed as another alternative for manipulation of optical switching properties. The proposed idea needs small chip area (?1/N ? 1 / N traditional cases) for implementation. We show that the switching threshold intensity can be decreased with increase of N , decrease of the coupling coefficient and increase of the two-photon absorption coefficient. In this structure with traditional optical fibers with the low nonlinear index of refractions ( 10 - 18 m 2 / W ) and using an array including 15 ring resonators with 6mm diameter for each rings only 3mW for the switching threshold power is required. Also, using erbium-doped fiber for implementation of the rings with the high nonlinear index of refractions ( 10 - 15 m 2 / W ) and five ring resonators including 0.3mm diameter, the switching threshold power can be reduced to ?W ? W level. If the nonzero two-photon absorption coefficient is considered, the switching threshold will be very smaller than the above-mentioned values. We show that with changing the optical amplifier gain the switching threshold can be tuned. So, the proposal can be used as a functional block for the integrated optical switch with very small and tunable threshold.

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

switching threshold
mzi
nonlinear ring resonators

fast optical switch
tunable all-optical switch
two-photon absorption


Note on coloring of double disk graphs The coloring of disk graphs is motivated by the frequency assignment problem. In 1998, Malesi?ska et al. introduced double disk graphs as their generalization. They showed that the chromatic number of a double disk graph \(G\) is at most \(33\,\omega (G) - 35\), where \(\omega (G)\) denotes the size of a maximum clique in \(G\). Du et al. improved the upper bound to \(31\,\omega (G) - 1\). In this paper we decrease the bound substantially; namely we show that the chromatic number of \(G\) is at most \(15\,\omega (G) - 14\).

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

disk graph
frequency assignment problem
chromatic number


Distributed multilevel optimization for complex structures Optimization problems concerning complex structures with many design variables may entail an unacceptable computational cost. This problem can be reduced considerably with a multilevel approach: A structure consisting of several components is optimized as a whole (global) as well as on the component level. In this paper, an optimization method is discussed with applications in the assessment of the impact of new design considerations in the development of a structure. A strategy based on fully stressed design is applied for optimization problems in linear statics. A global model is used to calculate the interactions (e.g., loads) for each of the components. These components are then optimized using the prescribed interactions, followed by a new global calculation to update the interactions. Mixed discrete and continuous design variables as well as different design configurations are possible. An application of this strategy is presented in the form of the full optimization of a vertical tail plane center box of a generic large passenger aircraft. In linear dynamics, the parametrization of the component interactions is problematic due to the frequency dependence. Hence, a modified method is presented in which the speed of component mode synthesis is used to avoid this parametrization. This method is applied to a simple test case that originates from noise control.

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

multilevel optimization
component mode synthesis


Validation of SDL-based architectural design models using communication-based coverage criteria As the capability to automatically generate code from different models becomes more sophisticated, it is critical that these models be adequately tested for quality assurance prior to code generation. Although simulation-based black-box testing strategies exist for these models, it is important that we also employ white-box testing strategies similar to those used to test implementation code to further validate the quality of these models. We apply coverage testing to architectural design models represented by SDL, a Specification and Description Language. Our previous study defined a methodology for automatic test generation with respect to two structural-based criteria, all-node and all-edge, for each individual SDL process. In this paper, we present new coverage criteria such as n-step-message-transfer and senderreceiver-round-trip, aiming at the communication between different SDL processes. A test generator using innovative backward tracking and forward validation has been implemented to support these criteria, guiding test generation to detect bugs which could not be revealed by test cases generated only with respect to the all-node and all-edge criteria. The results of our case study support the feasibility of using our test generator to create test cases satisfying the proposed communication-based criteria.

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

sdl (specification and description language)


Kernel Self-optimized Locality Preserving Discriminant Analysis for feature extraction and recognition We propose Kernel Self-optimized Locality Preserving Discriminant Analysis (KSLPDA) for feature extraction and recognition. The procedure of KSLPDA is divided into two stages, i.e., one is to solve the optimal expansion of the data-dependent kernel with the proposed kernel self-optimization method, and the second is to seek the optimal projection matrix for dimensionality reduction. Since the optimal parameters of data-dependent kernel are achieved automatically through solving the constraint optimization equation, based on maximum margin criterion and Fisher criterion in the empirical feature space, KSLPDA works well on feature extraction for classification. The comparative experiments show that KSLPDA outperforms PCA, LDA, LPP, supervised LPP and kernel supervised LPP.

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

kernel self-optimized locality preserving discriminant analysis


The automatic solution of partial differential equations using a global spectral method A spectral method for solving linear partial differential equations (PDEs) with variable coefficients and general boundary conditions defined on rectangular domains is described, based on separable representations of partial differential operators and the one-dimensional ultraspherical spectral method. If a partial differential operator is of splitting rank 2, such as the operator associated with Poisson or Helmholtz, the corresponding PDE is solved via a generalized Sylvester matrix equation, and a bivariate polynomial approximation of the solution of degree (nx,ny) ( n x , n y ) is computed in O((nxny)3/2) O ( ( n x n y ) 3 / 2 ) operations. Partial differential operators of splitting rank ?3 are solved via a linear system involving a block-banded matrix in O ( min ? ( n x 3 n y , n x n y 3 ) ) operations. Numerical examples demonstrate the applicability of our 2D spectral method to a broad class of PDEs, which includes elliptic and dispersive time-evolution equations. The resulting PDE solver is written in Matlab and is publicly available as part of Chebfun. It can resolve solutions requiring over a million degrees of freedom in under 60 seconds. An experimental implementation in the Julia language can currently perform the same solve in 10 seconds.

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


Relations Between Redundancy Patterns of the Shannon Code and Wave Diffraction Patterns of Partially Disordered Media The average redundancy of the Shannon code, R-n, as a function of the block length n, is known to exhibit two very different types of behavior, depending on the rationality or irrationality of certain parameters of the source: It either converges to 1/2 as n grows without bound, or it may have a nonvanishing, oscillatory, (quasi-) periodic pattern around the value 1/2 for all large n. In this paper, we make an attempt to shed some insight into this erratic behavior of R-n, by drawing an analogy with the realm of physics of wave propagation, in particular, the elementary theory of scattering and diffraction. It turns out that there are two types of behavior of wave diffraction patterns formed by crystals, which are correspondingly analogous to the two types of patterns of R-n. When the crystal is perfect, the diffraction intensity spectrum exhibits very sharp peaks, a.k.a. Bragg peaks, at wavelengths of full constructive interference. These wavelengths correspond to the frequencies of the harmonic waves of the oscillatory mode of R-n. On the other hand, when the crystal is imperfect and there is a considerable degree of disorder in its structure, the Bragg peaks disappear, and the behavior of this mode is analogous to the one where R-n is convergent.

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

bragg peaks
diffraction
disorder
redundancy
scattering
shannon code

hendricks-teller model
lossless source coding


The continuous artificial bee colony algorithm for binary optimization This paper introduces an ABC variant to solve binary optimization problems. The performance of the proposed method is investigated on well-known UFLPs. The proposed method is compared with the ABC variants and PSO variants. The experimental results show that the proposed algorithm is an alternative tool for binary optimization.

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

artificial bee colony
binary optimization

conversion of continuous values
uncapacitated facility location problem


Cloud identity management security issues & solutions: a taxonomy Cloud computing systems represent one of the most complex computing systems currently in existence. Current applications of Cloud involve extensive use of distributed systems with varying degree of connectivity and usage. With a recent focus on large-scale proliferation of Cloud computing, identity management in Cloud based systems is a critical issue for the sustainability of any Cloud-based service. This area has also received considerable attention from the research community as well as the IT industry. Numerous Cloud Identity Management Systems (IDMSs) have been proposed so far; however, most of those systems are neither widely accepted nor considered highly reliable due to their constraints in terms of scope, applicability and security. In order to achieve reliability and effectiveness in IDMs for Cloud, further extensive research needs to be carried out to critically examine Cloud based IDMSs and their level of security.

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

cloud computing security
assessment criteria
idms taxonomy


Two simultaneous operating regimes in an Erbium doped-fiber laser A Multiwavelength laser beam is proposed with paired arrayed waveguide gratings. We demonstrate two operating regime of Erbium doped-fiber tunable and simultaneous. One of regimes is active mode-locking at stable 10GHz, the other is CW. Others operation regimes of fiber lasers may be proposed within this configuration.

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

high repetition rate active mode-locking


Cell formation using fuzzy relational clustering algorithm Cellular manufacturing is a useful way to improve overall manufacturing performance. Group technology is used to increase the productivity for manufacturing high quality products and improving the flexibility of manufacturing systems. Cell formation is an important step in group technology. It is used in designing good cellular manufacturing systems. The key step in designing any cellular manufacturing system is the identification of part families and machine groups for the creation of cells that uses the similarities between parts in relation to the machines in their manufacture. There are two basic procedures for cell formation in group technology. One is part-family formation and the other is machine-cell formation. In this paper, we apply a fuzzy relational data clustering algorithm to form part families and machine groups. A real data study shows that the proposed approach performs well based on the grouping efficiency proposed by Chandrasekharan and Rajagopalan. (C) 2011 Elsevier Ltd. All rights reserved.

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

cellular manufacturing systems
cell formation

frc algorithm
dissimilarity matrix
mixed-variable data


reverse engineering of object oriented code During software evolution, programmers devote most of their effort to the understanding of the structure and behavior of the system. For Object-Oriented code, this might be particularly hard, when multiple, scattered objects contribute to the same function. Design views offer an invaluable help, but they are often not aligned with the code, when they are not missing at all.This tutorial describes some of the most advanced techniques that can be employed to reverse engineer several design views from the source code. The recovered diagrams, represented in UML (Unified Modeling Language), include class, object, interaction (collaboration and sequence), state and package diagrams. A unifying static code analysis framework used by most of the involved algorithms is presented at the beginning of the tutorial. A single running example is referred all over the presentation. Trade-offs (e.g., static vs. dynamic analysis), limitations and expected benefits are also discussed.

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

object oriented programming
diagram recovery


Accurate Multiple View 3D Reconstruction Using Patch-Based Stereo for Large-Scale Scenes In this paper, we propose a depth-map merging based multiple view stereo method for large-scale scenes which takes both accuracy and efficiency into account. In the proposed method, an efficient patch-based stereo matching process is used to generate depth-map at each image with acceptable errors, followed by a depth-map refinement process to enforce consistency over neighboring views. Compared to state-of-the-art methods, the proposed method can reconstruct quite accurate and dense point clouds with high computational efficiency. Besides, the proposed method could be easily parallelized at image level, i.e., each depth-map is computed individually, which makes it suitable for large-scale scene reconstruction with high resolution images. The accuracy and efficiency of the proposed method are evaluated quantitatively on benchmark data and qualitatively on large data sets.

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


Strain effects on the band gap and work function of zigzag single-walled carbon nanotubes and graphene: A comparative study First-principles local density functional calculation of the electronic structure and work function of zigzag single-wall carbon nanotubes (SWCNTs) and graphene under strain are presented. We found that there is a small circumference strain even for unstrained zigzag SWCNTs that release the curvature energy of the tube. Therefore, we propose that there are two effects contributing to the opening of the band gap of unstrained (3q 3 q , 0) SWCNTs: the electron transfer enhancement effect and the circumference strain effect. We show that the band gap and work function of strained zigzag SWCNTs can be successfully estimated from the band structure and work function of strained graphene based on the zone folding method with circumference strain effect. The circumference strain effect is crucial to obtain a correct result. The rate of change of the band gap with respect to the strain for zigzag SWCNTs is almost independent of the value of the strain and the radius of the tube.

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


a fair e-cash payment scheme based on credit A new fair e-cash payment scheme based on credit is present in this paper. In the scheme, an overdraft credit certificate is issued to user by bank. Using the overdraft credit certificate, user can produce e-cash himself to pay in exchanges. Merchant can verify the e-cash received from user. Bank can make a fair dispute resolution when there is a dissension between user and merchant. It can avoid the problem of partition e-cash for changes, prevent from reusing e-cash and faking e-cash. It fits justice, anonymity, non-deny and impartiality.

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


AVD-total-colouring of complete equipartite graphs ? An AVD-total-colouring of a simple graph G G is a mapping ?:V(G)?E(G)?C ? : V ( G ) ? E ( G ) ? C , C C a set of colours, such that: (i) for each pair of adjacent or incident elements x,y?V(G)?E(G) x , y ? V ( G ) ? E ( G ) , ?(x)??(y) ? ( x ) ? ? ( y ) ; (ii) for each pair of adjacent vertices x,y?V(G) x , y ? V ( G ) , sets {?(x)}?{?(xv):xv?E(G),v?V(G)} { ? ( x ) } ? { ? ( x v ) : x v ? E ( G ) , v ? V ( G ) } and {?(y)}?{?(yv):yv?E(G),v?V(G)} { ? ( y ) } ? { ? ( y v ) : y v ? E ( G ) , v ? V ( G ) } are distinct. The AVD-total-chromatic number , ? a ? ( G ) , is the smallest number of colours for which G G admits an AVD-total-colouring. In 2005, Zhang etal. conjectured that ? a ? ( G ) ? ? ( G ) + 3 for any simple graph G G . In this article this conjecture is verified for any complete equipartite graph. Moreover, if G G is a complete equipartite graph of even order, then it is shown that ? a ? ( G ) = ? ( G ) + 2 .

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


Communications directed by bound types in Linda: Presentation and formal model Linda is an elegant parallel and distributed programming model. It is based on a shared associative memory, structured in tuples. We show in this paper that this model suffers from the false matching phenomenon. We explain under which conditions this problem occurs, we examine the solutions already proposed to solve it, and we show why they are not sufficient. In this framework, our goal is to propose an extension to the Linda model in order to eliminate the false matching phenomenon. This model-Linda with bound types or B-Linda-suitable for modern programming paradigms, adds an extended-type notion into the basic Linda model. It is first introduced in an informal manner, then we present an implementation of it. Some formal aspects are specified in the appendix: The definition of the model's elements and operational semantics.

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

asynchronous parallelism
distributed shared memory
distributed application
type
directed communication
type scope