An efficient data-distribution mechanism in a Processor-in-Memory (PIM) architecture applied to motion estimation In general, the main purpose of using Processor-in-Memory (PIM) modules is to dramatically increase the Data-Level Parallelism (DLP) and avoid the limited issue rate of current systems (even when they include SIMD extensions) caused by the limited data bandwidth and functional units. Our approach is to divide the PIM module into hundreds of smaller pieces so that each of these smaller PIMs can execute motion estimation for a group of macro blocks in a parallel fashion. We also design the logic in each PIM to execute in a highly pipelined fashion so that even more parallelism can be exploited. The main contribution of this paper is the presentation of architectural techniques that can be used in the PIM module to overcome the addressing and data sharing overhead when these smaller PIMs are used. Our architectural techniques have been applied to motion estimation. Indeed, it has been reported that motion estimation takes the majority of the execution time of MPEG encoding and it has been researched by many because of its importance in MPEG encoding. With our paradigm and techniques, the host processor can be relieved from the most computationally demanding and data-intensive portions of the workload, which should therefore yield a significant performance gain. Indeed, we observed (when 512 of these smaller PIMs were used) a reduction in the number of memory accesses by a factor of up to 2,034 times. At the same time, the performance improved by a multiplicative factor as high as 439 times.

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


Distinguishing paintings from photographs We addressed the problem of automatically differentiating photographs of real scenes from photographs of paintings. We found that photographs differ from paintings in their color, edge, and texture properties. Based on these features, we trained and tested a classifier on a database of 6000 paintings and 6000 photographs. Using single features results in ?7080% correct discrimination performance, whereas a classifier using multiple features exceeds 90% correct discrimination.

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

color edges
image classification
image features
image databases
neural networks
photorealism


Low Dit HfO2/Al2O3/In0.53Ga0.47As gate stack achieved with plasma-enhanced atomic layer deposition First demonstration of high-k/In0.53Ga0.47As gate stack formed by PEALD. Optical and electrical characterization of Al2O3 and HfO2 materials formed by PEALD. Competitive Dit achieved with HF and with (NH4)2S surface preparations.

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

in0.53ga0.47as
high-k dielectrics
interface traps
plasma
passivation


Estimation of the population spectrum with replicated time series A random sample of r objects from a certain population is considered, measuring for each of them and at the same time points a stationary process Xi(t) whose spectral distribution is absolutely continuous. Each spectral density function fi(?) may be considered as a realization of a stationary process R(?), for which a population spectrum f(?) is defined as E[R(?)]. Thus, r time series are available to estimate the population spectrum f(?). It is well known that when a single time series is analysed, the periodogram is a poor estimate of the spectral density. However, when using replicated time series, the average periodogram behaves adequately as an estimate of the population spectrum if the number of objects is large. The asymptotic properties of the average periodogram are analysed and confidence intervals for the population spectrum are constructed. An alternative bootstrap method is proposed for the estimation of the population spectrum and the asymptotic validity, in the sense of Bickel and Freedman, is proved when the number of objects is large. Replicated time series simulated from a moving average process with random coefficients and confidence intervals are constructed for the population spectrum using the bootstrap approach. These intervals are compared with the intervals obtained by means of the asymptotic properties of the average periodogram.

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

replicated time series
average periodogram
bootstrap


Software process improvement success factors for small and medium Web companies: A qualitative study The context of this research is software process improvement (SPI) in small and medium Web companies. The primary objective of this paper is to identify software process improvement (SPI) success factors for small and medium Web companies. To achieve this goal, we conducted semi-structured, open-ended interviews with 21 participants representing 11 different companies in Pakistan, and analyzed the data qualitatively using the Glaserian strand of grounded theory research procedures. The key steps of these procedures that were employed in this research included open coding, focused coding, theoretical coding, theoretical sampling, constant comparison, and scaling up. An initial framework of key SPI success factors for small and medium Web companies was proposed, which can be of use for small and medium Web companies engaged in SPI. The paper also differentiates between small and medium Web companies and analyzes crucial SPI requirements for companies operating in the Web development domain. The results of this work, in particular the use of qualitative techniques allowed us to obtain rich insight into SPI success factors for small and medium Web companies. Future work comprises the validation of the SPI success factors with small and medium Web companies.

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

software process improvement
success factors
grounded theory
small and medium web companies


A survey of power and energy efficient techniques for high performance numerical linear algebra operations A thorough survey of energy efficient techniques for linear algebra operations. A complete list of valuable research efforts. A deeply review of all aspects of feasible solutions. Detailed discussion and comprehensive comparison. Thought-provoking directions of future research are provided.

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

power and energy
performance
numerical linear algebra


Application of spectral decomposition algorithm for mapping water quality in a turbid lake (Lake Kasumigaura, Japan) from Landsat TM data The remote sensing of Case 2 water has been far less successful than that of Case 1 water, due mainly to the complex interactions among optically active substances (e.g.,phytoplankton, suspended sediments, colored dissolved organic matter, and water) in the former. To address this problem, we developed a spectral decomposition algorithm (SDA), based on a spectral linear mixture modeling approach. Through a tank experiment, we found that the SDA-based models were superior to conventional empirical models (e.g.using single band, band ratio, or arithmetic calculation of band) for accurate estimates of water quality parameters. In this paper, we develop a method for applying the SDA to Landsat-5 TM data on Lake Kasumigaura, a eutrophic lake in Japan characterized by high concentrations of suspended sediment, for mapping chlorophyll-a (Chl-a) and non-phytoplankton suspended sediment (NPSS) distributions. The results show that the SDA-based estimation model can be obtained by a tank experiment. Moreover, by combining this estimation model with satellite-SRSs (standard reflectance spectra: i.e.,spectral end-members) derived from bio-optical modeling, we can directly apply the model to a satellite image. The same SDA-based estimation model for Chl-a concentration was applied to two Landsat-5 TM images, one acquired in April 1994 and the other in February 2006. The average Chl-a estimation error between the two was 9.9%, a result that indicates the potential robustness of the SDA-based estimation model. The average estimation error of NPSS concentration from the 2006 Landsat-5 TM image was 15.9%. The key point for successfully applying the SDA-based estimation model to satellite data is the method used to obtain a suitable satellite-SRS for each end-member.

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

spectral decomposition algorithm
remote sensing


Temporal reasoning for decision support in medicine Handling time-related concepts is essential in medicine. During diagnosis it can make a substantial difference to know the temporal order in which some symptoms occurred or for how long they lasted. During prognosis the potential evolutions of a disease are conceived as a description of events unfolding in time. In therapy planning the different steps of treatment must be applied in a precise order, with a given frequency and for a certain span of time in order to be effective. This article offers a survey on the use of temporal reasoning for decision support-related tasks in medicine. Key publications of the area, mainly circumscribed to the latest two decades, are reviewed and classified according to three important stages of patient treatment requiring decision support: diagnosis, prognosis and therapy planning/management. Other complementary publications, like those on time-centered information storage and retrieval, are also considered as they provide valuable support to the above mentioned three stages. Key areas are highlighted and used to organize the latest contributions. The survey of previous research is followed by an analysis of what can still be improved and what is needed to make the next generation of decision support systems for medicine more effective. It can be observed that although the area has been considerably developed, there are still areas where more research is needed to make time-based systems of widespread use in decision support-related areas of medicine. Several suggestions for further exploration are proposed as a result of the survey.

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

temporal reasoning
diagnosis
prognosis
therapy planning


Active learning for social image retrieval using Locally Regressive Optimal Design In this paper, we propose a novel active learning algorithm, called Locally Regressive Optimal Design (LROD), to improve the effectiveness of relevance feedback-based social image retrieval. Our algorithm assumes that for each data point, the label values of both this data point and its neighbors can be well estimated using a locally regressive function. Specifically, we adopt a local linear regression model to predict the label value of each data point in a local patch. The regularized local model predication error of the local patch is defined as our local loss function. Then, a unified objective function is proposed to minimize the summation of these local loss functions over all the data points, so that an optimal predicated label value can be assigned to each data point. Finally, we embed it into a semi-supervised learning framework to construct the final objective function. Experiment results on MSRA-MM2.0 database demonstrate the efficiency and effectiveness of the proposed algorithm for relevance feedback-based social image retrieval.

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

active learning
optimal design
social image retrieval


Differential-algebraic cryptanalysis of reduced-round of Serpent-256 Differential cryptanalysis is a general cryptanalytic tool that makes use of differentials over some rounds of a cipher, combined with some key bit guesses of one or two rounds. This paper introduces a new cryptanalysis strategy of block ciphers named differential-algebraic cryptanalysis. The idea of differential-algebraic cryptanalysis is to find a differential with high probability and build the multivariable system equations for the last few rounds. The subkey values of the last few rounds can be obtained by filtering the solutions of system equations instead of guessing all possible subkey values. We use the differential-algebraic cryptanalysis to break 8-round Serpent-256. Our attack can recover the 256-bit key with 283 chosen plaintexts, 2(180.4) 8-round Serpent-256 encryptions and 2(176.7) bytes memory. Compared with the previous differential cryptanalysis results, both the data complexity and the time complexity are reduced, but the memory requirements are increased. The time complexity and the memory requirements are very close, and a time-memory tradeoff is exploited.

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

differential-algebraic cryptanalysis
serpent
solving equations


Learning to Adapt Web Information Extraction Knowledge and Discovering New Attributes via a Bayesian Approach This paper presents a Bayesian learning framework for adapting information extraction wrappers with new attribute discovery, reducing human effort in extracting precise information from unseen Web sites. Our approach aims at automatically adapting the information extraction knowledge previously learned from a source Web site to a new unseen site, at the same time, discovering previously unseen attributes. Two kinds of text-related clues from the source Web site are considered. The first kind of clue is obtained from the extraction pattern contained in the previously learned wrapper. The second kind of clue is derived from the previously extracted or collected items. A generative model for the generation of the site-independent content information and the site-dependent layout format of the text fragments related to attribute values contained in a Web page is designed to harness the uncertainty involved. Bayesian learning and expectation-maximization (EM) techniques are developed under the proposed generative model for identifying new training data for learning the new wrapper for new unseen sites. Previously unseen attributes together with their semantic labels can also be discovered via another EM-based Bayesian learning based on the generative model. We have conducted extensive experiments from more than 30 real-world Web sites in three different domains to demonstrate the effectiveness of our framework.

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

wrapper adaptation
web mining
text mining
machine learning


Derivation and implementation of a semantic GIS data model informed by principles of cognition The purpose of this research is to develop a new kind of semantic GIS data model that is better able to represent users conceptual models of geographic domains than the conventional vector and raster data models. To this end, I look to the principles of cognition, how humans represent geographic information in their minds, to inform the development of this semantic data model. A three-stage methodology for the derivation and implementation of the semantic data model is presented. First, a conceptual framework of geographic cognition is developed. This framework incorporates principles of cognitive categorization and top-down and bottom-up information processing. Second, by replacing those elements of cognition with their database representation counterparts, often drawing from the object-oriented modeling paradigm, a semantic data model is derived. Finally, a prototype implementation of the semantic data model is presented using the Java programming language and the object-oriented database Poet as a development platform. This implementation utilizes a rule-based approach for representing categorical information and for the extraction of semantic entities from observational data.

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

semantic representation
data modelling
knowledge discovery
object-oriented gis


Shared quantum control via sharing operation on remote single qutrit Two qubit-operation-sharing schemes (Zhang and Cheung in J. Phys. B 44:165508, 2011) are generalized to the qutrit ones. Operations to be shared are classified into three different classes in terms of different probabilities (i.e, 1/3, 2/3 and 1). For the latter two classes, ten and three restricted sets of operations are found out, respectively. Moreover, the two generalized schemes are amply compared from four aspects, namely, quantum and classical resource consumption, necessary-operation complexity, success probability and efficiency. It is found that the second scheme is overall more optimal than the first one as far as three restricted sets of operations are concerned. Moreover, the experimental feasibility of our schemes is confirmed with respect to the nowaday technique.

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

quantum operation sharing
generalized bell state
restricted sets of qutrit operations


Web-based information for pregnant women and new mothers with type 1 diabetes- a description of the development process This paper describes the process of developing specifically designed web-based maternity information for women with type 1 diabetes.

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

pregnancy
support
website
participatory design


Text quality metrics for visual display units:: I. Methodological aspects A comparison of four experimental variables to measure the visual quality of text on visual display units (VDUs) is discussed. Scaled visual comfort is considered to be the most relevant psychological attribute. Visual performance, saccade length and fixation pauses during a search task approximating closely to reading are under the present conditions highly correlated with visual comfort if luminance contrast is the independent variable. All four variables are found to be satisfactory with respect to sensitivity, but it is argued that comfort scaling and the measurement of visual performance will probably suffice. Only small differences between subjects are found, suggesting that in the future a standard observer is feasible. The advantage of a print reference is argued.

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

visual performance
visual comfort
scaling
luminance contrast


An improved algorithm for support vector clustering based on maximum entropy principle and kernel matrix ? The support vector clustering (SVC) algorithm consists of two main phases: SVC training and cluster assignment. The former requires calculating Lagrange multipliers and the latter requires calculating adjacency matrix, which may cause a high computational burden for cluster analysis. To overcome these difficulties, in this paper, we present an improved SVC algorithm. In SVC training phase, an entropy-based algorithm for the problem of calculating Lagrange multipliers is proposed by means of Lagrangian duality and the Jaynes maximum entropy principle, which evidently reduces the time of calculating Lagrange multipliers. In cluster assignment phase, the kernel matrix is used to preliminarily classify the data points before calculating adjacency matrix, which effectively reduces the computing scale of adjacency matrix. As a result, a lot of computational savings can be achieved in the improved algorithm by exploiting the special structure in SVC problem. Validity and performance of the proposed algorithm are demonstrated by numerical experiments.

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

support vector clustering
maximum entropy
adjacency matrix
kernel matrix


Modeling thick composite laminate and sandwich structures with linear viscoelastic damping The paper describes the modeling of thick composite laminate and sandwich plates and beams with linear viscoelastic treatments. A discrete laminate model (DLM) is described, validated and compared to numerical spectral finite elements method (SFEM), finite element method (FEM) and experimental results. The DLM approach assumes each layer as thick laminate with orthotropic orientation, rotational inertia and transversal shearing, membrane and bending deformations. First order shear deformation theory is used. The equation of motion is developed following a wave approach based on discrete layer description. It handles symmetrical and asymmetrical layouts of unlimited number of transversal incompressible layers. Next, dilatational (symmetric mode) motion along the cores thickness is considered to complete the DLM solution when applied to the case of symmetric sandwich structures with soft and thick core. The model is compared to a second approach employing spectral finite elements. The latter handles composite laminated plates and beams with orthotropic orientation. It is shown that both approaches estimate accurately the propagating wave solutions of laminated structures. Using these solutions, the input mobility and the mechanical impedance are computed. The two models are successfully compared to classical finite elements as well as to experimental results for different boundary conditions. Moreover, the equivalent damping loss factor of composite laminate plates with viscoelastic treatment is addressed and the influence of the heading direction is 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 modeling
composite structures
viscoelastic materials


MoRaRo: Mobile router-assisted route optimization for network mobility (NEMO) support The IETF (Internet Engineering Task Force) has developed a Network Mobility (NEMO) basic support protocol by extending the operation of Mobile IPv6 to provide uninterrupted Internet connectivity to the communicating nodes of mobile networks. The protocol uses a mobile router (MR) in the mobile network to perform prefix scope binding updates with its home agent (HA) to establish a bi-directional tunnel between the HA and MR. This solution reduces location-update signaling by making network movements transparent to the mobile nodes behind the MR. However, delays in data delivery and higher overheads are likely to occur because of sub-optimal routing and multiple encapsulation of data packets. To resolve these problems, we propose a mobile router-assisted route optimization (MoRaRo) scheme for NEMO support. With MoRaRo, a mobile node performs route optimization with a correspondent node only once, at the beginning of a session. After that the MR performs route optimization on behalf of all active mobile nodes when the network moves. The virtue of this scheme is that it requires only slight modification of the implementation of the NEMO basic support protocol at local entities such as the MR and mobile nodes of the mobile network, leaving entities in the core or in other administrative domains untouched. MoRaRo enables a correspondent node to forward packets directly to the mobile network without any tunneling, thus reducing packet delay and encapsulation overheads in the core network. To enable the scheme to be evaluated, we present the results of both theoretical analysis and simulation.

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

network mobility
nemo basic support protocol
moraro


When is trust not enough? The role of perceived privacy of communication tools in comfort with self-disclosure In what circumstances might privacy concerns about new communication tools like instant messaging help predict the degree to which people feel comfortable communicating via these new communication tools? The current study examined whether topic intimacy and perceived privacy predict levels of comfort with disclosure, and whether these associations are moderated by overall levels of trust and frequency of technology use. Participants reported on the degree to which they would feel comfortable discussing each of 32 topics (e.g., times when I felt that I was in love) using 10 different communication tools. Topic and tool interacted, such that the privacy of the communication tool was related to disclosure comfort only for intimate topics. Privacy concerns were more important to less frequent technology users, and topic intimacy mattered most to participants with low levels of trust. Results are discussed in terms of implications for extending models of disclosure to the selection of new communication tools.

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


Androgen receptor binding affinity of pesticide "active" formulation ingredients. QSAR evaluation by COREPA method The COREPA approach for identifying the COmmon REactivity PAttern of biologically similar chemicals was employed to upgrade the recently derived affinity pattern for high androgen receptor (AR) binding affinity. The training set consisted of 28 steroidal and nonsteroidal ligands whose AR binding affinity was determined in competitive binding assays (in terms of pK(i)). The interatomic distances between nucleophilic sites and their charges providing distinct and non-overlapping integral patterns for active and inactive chemicals were assumed that it was related with the endpoint, which was under study. These stereoelectronic characteristics were used to predict pKi values of pesticide "active" formulation ingredients in an attempt to identify chemicals with potential AR binding affinity.

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


Improving protocol robustness in ad hoc networks through cooperative packet caching and shortest multipath routing A mobile ad hoc network is an autonomous system of infrastructure-less, multihop, wireless mobile nodes. Reactive routing protocols perform well in this environment due to their ability to cope quickly against topological changes. This paper proposes a new routing protocol named CHAMP (CacHing And Multiple Path) routing protocol. CHAMP uses cooperative packet caching and shortest multipath routing to reduce packet loss due to frequent route failures. We show through extensive simulation results that these two techniques yield significant improvement in terms of packet delivery, end-to-end delay and routing overhead. We also show that existing protocol optimizations employed to reduce packet loss due to frequent route failures, namely local repair in AODV and packet salvaging in DSR, are not effective at high mobility rates and high network traffic.

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


SESQUILINEAR MORITA EQUIVALENCE AND ORTHOGONAL SUM OF ALGEBRAS WITH ANTIAUTOMORPHISM We define a notion of Morita equivalence between algebras with antiautomorphisms such that two equivalent algebras have the same category of sesquilinear forms. This generalizes the Morita equivalence of algebras with involutions defined by Frohlich and Mc Evett [5], and their categories of E-hermitian forms. For two Morita equivalent algebras with involution, with an additional technical property (which is true for central simple algebras), we define a new algebra with antiautomorphism, called the orthogonal sum, which generalizes the usual notion of orthogonal sum of forms. We explore the invariants of this sum.

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

central simple algebras
involutions
sesquilinear forms


Application of the Laplace transform dual reciprocity boundary element method in the modelling of laser heat treatments The Laplace Transform Dual Reciprocity Boundary Element Method (LTDRM or LT-DRBEM) provides with an alternative numerical technique to finite difference (FDM) or finite element methods (FEM) for solving transient diffusion problems. With this method, solutions are calculated directly at any specific time thus avoiding the use of time-stepping schemes. Besides, domain integrals are removed from the problem formulation. In this work we study the applicability of the LT-DRBEM method for laser heat treatment modelling purposes. A simple model was developed based on a two dimensional transient heat conduction equation, in which the laser beam is included as a heat flux boundary condition of gaussian shape. Results corresponding to a stationary and a moving beam are presented and discussed. Non-linear formulations of the problem as those given by temperature dependent material properties are also considered. Good accuracy results were obtained for the stationary beam approach, whereas severe limitations were found for the moving beam case.

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


Assessing the impact of integrating business planning and IS planning One of the key elements of strategic planning for information systems (IS) is the integration of IS planning (ISP) and business planning (BP). Although this issue has received significant attention in recent years, empirical research focusing specifically on it is still relatively sparse. Here, BP-ISP integration is considered in four ways (administrative, sequential, reciprocal, and full integration), reflecting various degrees of BP-ISP integration. The relationships between these and organizational impact (measured in terms of the extent of ISP problems and the extent of IS contributions to organizational performance) are investigated through the analysis of data gathered in a ''matched pair'' field survey of business planners and IS executives. The results empirically validate the importance of BP-ISP integration, since it was found to have a significant positive relationship with IS contributions to organization performance and a significant negative relationship to the extent of ISP problems.

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

alignment
information systems planning
is planning problems
performance impact


GEMMA A Grid environment for microarray management and analysis in bone marrow stem cells experiments Microarray techniques are successfully used to investigate thousands gene expression profiling in a variety of genomic analyses such as gene identification, drug discovery and clinical diagnosis, providing a large amount of genomic data for the overall research community. A Grid based Environment for distributed Microarray data Management and Analysis (GEMMA) is being built. This platform is planned to provide shared, standardized and reliable tools for managing and analyzing biological data related to bone marrow stem cell cultures, in order to maximize the results of distributed experiments. Different microarray analysis algorithms may be offered to the end-user, through a web interface. A set of modular and independent applications may be published on the portal, and either single algorithms or a combination of them might be invoked by the user, through a workflow strategy. Services may be implemented within an existing Grid computing infrastructure to solve problems concerning both large datasets storage (data intensive problem) and large computational times (computing intensive problem). Moreover, experimental data annotation may be collected according to the same rules and stored through the Grid portal, by using a metadata schema, which allows a comprehensive and replicable sharing of microarray experiments among different researchers. The environment has been tested, so far, as regards performance results concerning Grid parallelization of a microarray based gene expression analysis. First results show a very promising speedup ratio.

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


Color picture watermarking correlating two constituent planes for immunity to random geometric distortion Digital watermarks on pictures must have the ability to survive various image processing operations while not causing degradation of picture quality. Random geometric distortion is one of the most difficult kinds of image processing for a watermark to survive, and this problem has become a central issue in watermarking research. Previous methods for dealing with random geometric distortion have been based on searches, special water-mark patterns, learning, or additional data such as original pictures. Their use, however, is accompanied by large computational overhead or by operational inconvenience. This paper therefore proposes a method based on embedding watermark patterns in two of the three color planes constituting a color picture so that these two planes have a specific covariance. The detection of the embedded information is based on the covariance between these two planes. Random geometric distortion distorts all the constituent color planes of a picture in the same way and thus does not affect the covariance between any two. The covariance-based detection is therefore immune to the distortion. The paper clarifies that detection error would occur whenever the inherent covariance (the covariance in the original picture) overrides the covariance made by watermarking. The two constituent planes having the minimum inherent covariance are therefore selected and their inherent covariance is reduced by shifting one of them and using a noise-reduction preprocess. Experimental evaluations using StirMark confirmed that 64 bits embedded in 256 x 256-pixel pictures can be correctly detected without using searches, special patterns, learning, or additional data.

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

digital picture
survivability
stirmark attack


selective path profiling Recording dynamic information for only a subset of program entities can reduce monitoring overhead and can facilitate efficient monitoring of deployed software. Program entities, such as statements, can be monitored using probes that track the execution of those entities. Monitoring more complicated entities, such as paths or definition-use associations, requires more sophisticated techniques that track not only the execution of the desired entities but also the execution of other entities with which they interact. This paper presents an approach for monitoring subsets of one such program entity---acyclic paths in procedures. Our selective path profiling algorithm computes values for probes that guarantee that the sum of the assigned value along each acyclic path (path sum) in the subset is unique; acyclic paths not in the subset may or may not have unique path sums. The paper also presents the results of studies that compare the number of probes required for subsets of various sizes with the number of probes required for profiling all paths, computed using Ball and Larus' path profiling algorithm. Our results indicate that the algorithm performs well on many procedures by requiring only a small percentage of probes for monitoring the subset.

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

value
software
values
path profiling
dynamic
algorithm
paper

select
probe
static analysis
use
efficiency
procedure
association
definition
dynamic analysis
tracking
monitor
profiles
informal
records


Unveiling \({\pi }\)-tangle and quantum phase transition in the one-dimensional anisotropic XY model In this paper, the relationship between \({\pi }\)-tangle and quantum phase transition (QPT) is investigated by employing the quantum renormalization-group method in the one-dimensional anisotropic XY model. The results show that all the 1-tangles increase firstly and then decrease with the anisotropy parameter \(\gamma \) increasing, and the CoffmanKunduWootters monogamy inequality is always tenable for this system. The entanglements status of subsystems depends on its site position, and this proposition can be generalized to a multipartite system. Meanwhile, with the increasing of the size of the system, the \({\pi }\)-tangle decreases slowly and tends to a fixed value finally. Additionally, it exhibits a QPT and a maximum value for the next-nearest-neighbor entanglement at the critical point in our model, which is different from the case of two-body system. After several iterations of the renormalization, the quantum entanglement measure can develop two saturated values, which are associated with two different phases: spin-fluid phase and the Nel phase. To gain further insight, the nonanalytic and scaling behaviors of \({\pi }\)-tangle have also been analyzed in detail.

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

quantum entanglement
quantum phase transition


A new optimization method: Dolphin echolocation Echolocation ability of dolphins is mimicked to develop a new optimization method. Dolphin echolocation (DE) takes advantages of different meta-heuristics rules. DE outperforms many existing methods. DE leads to excellent results with low computational efforts.

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

meta-heuristic
optimal design
trusses
frames


Parameterised boolean equation systems Boolean equation system are a useful tool for verifying formulas from modal mu-calculus on transition systems (see [Mader, Lecture Notes in Computer Science, Vol. 1019, 1995, pp. 72-88] for an excellent treatment). We are interested in an extension of boolean equation systems with data. This allows to formulate and prove a substantially wider range of properties on much larger and even infinite state systems. In previous works [Groote and Mateescu, Lecture Notes in Computer Science, Vol. 1548, 1999, pp. 74-90; Groote and Willemse, Sci. Comput. Program., 2005] it has been outlined how to transform a modal formula and a process, both containing data, to a so-called parameterised boolean equation system, or equation system for short. In this article we focus on techniques to solve such equation systems. We introduce a new equivalence between equation systems, because existing equivalences are not compositional. We present techniques similar to Gau beta elimination as outlined in [Mader, Lecture Notes in Computer Science, Vol. 1019, 1995, pp. 72-88] that allow to solve each equation system provided a single equation can be solved. We give several techniques for solving single equations, such as approximation (known), patterns (new) and invariants (new). Finally, we provide several small but illustrative examples of verifications of modal mu-calculus formulas on concrete processes to show the use of the techniques. (c) 2005 Elsevier B.V. All rights reserved.

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

parameterised boolean equation systems
infinite state systems

first order modal mu-calculus
model checking


Some problems on factorizations with constraints in bipartite graphs Let G=(X,Y,E(G)) be a bipartite graph with vertex set V(G)=X?Y and edge set E(G) and let g and f be two non-negative integer-valued functions defined on V(G) such that g(x)?f(x) for each x?V(G). A (g,f)-factor of G is a spanning subgraph F of G such that g(x)?dF(x)?f(x) for each x?V(F); a (g,f)-factorization of G is a partition of E(G) into edge-disjoint (g,f)-factors. In this paper it is proved that every bipartite (mg+m?1,mf?m+1)-graph has (g,f)-factorizations randomly k-orthogonal to any given subgraph with km edges if k?g(x) for any x?V(G) and has a (g,f)-factorization k-orthogonal to any given subgraph with km edges if k?1?g(x) for any x?V(G) and that every bipartite (mg,mf)-graph has a (g,f)-factorization orthogonal to any given m-star if 0?g(x)?f(x) for any x?V(G). Furthermore, it is shown that there are polynomial algorithms for finding the desired factorizations and the results in this paper are in some sense best possible.

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

(g
f)-factor
orthogonal factorization
algorithm


Artificial neural network for prediction of air flow in a single rock joint In this paper, an attempt has been made to evaluate and predict the air flow rate in triaxial conditions at various confining pressures incorporating cell pressure, air inlet pressure, and air outlet pressure using artificial neural network (ANN) technique. A three-layer feed forward back propagation neural network having 3-7-1 architecture network was trained using 37 data sets measured from laboratory investigation. Ten new data sets were used for the, validation and comparison of the air flow rate by ANN and multi-variate regression analysis (MVRA) to develop more confidence on the proposed method. Results were compared based on coefficient of determination (CoD) and mean absolute error (MAE) between measured and predicted values of air flow rate. It was found that CoD between measured and predicted air flow rate was 0.995 and 0.758 by ANN and MVRA, respectively, whereas MAE was 0.0413 and 0.1876.

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

air flow
cell pressure
air inlet pressure
air outlet pressure
back propagation neural network


Computing Steerable Principal Components of a Large Set of Images and Their Rotations We present here an efficient algorithm to compute the Principal Component Analysis (PCA) of a large image set consisting of images and, for each image, the set of its uniform rotations in the plane. We do this by pointing out the block circulant structure of the covariance matrix and utilizing that structure to compute its eigenvectors. We also demonstrate the advantages of this algorithm over similar ones with numerical experiments. Although it is useful in many settings, we illustrate the specific application of the algorithm to the problem of cryo-electron microscopy.

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

edics category: tec-prc image and video processing techniques


Learning DFA from simple examples Efficient learning of DFA is a challenging research problem in grammatical inference. It is known that both exact and approximate (in the PAC sense) identifiability of DFA is hard. Pitt has posed the following open research problem: "Are DFA PAC-identifiable if examples are drawn from the uniform distribution, or some other known simple distribution ?" (Pitt, in Lecture Notes in Artificial Intelligence, 397, pp. 18-44, Springer-Verlag, 1989). We demonstrate that the class of DFA whose canonical representations have logarithmic Kolmogorov complexity is efficiently PAC learnable under the Solomonoff Levin universal distribution (m). We prove that the class of DFA is efficiently learnable under the PACS (PAC learning with simple examples) model (Denis, D'Halluin & Gilleron, STACS'96-Proceedings of the 13th Annual Symposium on the Theoretical Aspects of Computer Science, pp. 231-242, 1996) wherein positive and negative examples are sampled according to the universal distribution conditional on a description of the target concept. Further, we show that any concept that is learnable under Gold's model of learning from characteristic samples, Goldman and Mathias' polynomial teachability model, and the model of learning from example based queries is also learnable under the PACS model.

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

dfa inference
exact identification
characteristic sets
collusion


energy-efficient mobile video management using smartphones Mobile devices are increasingly popular for the versatile capture and delivery of video content. However, the acquisition and transmission of large amounts of video data on mobile devices face fundamental challenges such as power and wireless bandwidth constraints. To support diverse mobile video applications, it is critical to overcome these challenges. We present a design framework that brings together several key ideas to enable energy-efficient mobile video management applications. First, we leverage off-the-shelf smartphones as mobile video sensors. Second, concurrently with video recordings we acquire geospatial sensor meta-data to describe the videos. Third, we immediately upload the meta-data to a server to enable low latency video search. This last step allows for very energy-efficient transmissions, as the sensor data sets are small and the bulky video data can be uploaded on demand, if and when needed. We present the design, a simulation study, and a preliminary prototype of the proposed system. Experimental results show that our approach substantially prolongs the battery life of mobile devices while only slightly increasing the search latency

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


Automating Relatively Complete Verification of Higher-Order Functional Programs We present an automated approach to relatively completely verifying safety (i.e., reachability) property of higher-order functional programs. Our contribution is two-fold. First, we extend the refinement type system framework employed in the recent work on (incomplete) automated higher-order verification by drawing on the classical work on relatively complete "Hoare logic like" program logic for higher-order procedural languages. Then, by adopting the recently proposed techniques for solving constraints over quantified first-order logic formulas, we develop an automated type inference method for the type system, thereby realizing an automated relatively complete verification of higher-order programs.

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

relative completeness
higher-order programs
software model checking


A backtracking search tool for constructing combinatorial test suites Combinatorial testing is an important testing method. It requires the test cases to cover various combinations of parameters of the system under test. The test generation problem for combinatorial testing can be modeled as constructing a matrix which has certain properties. This paper first discusses two combinatorial testing criteria: covering array and orthogonal array, and then proposes a backtracking search algorithm to construct matrices satisfying them. Several search heuristics and symmetry breaking techniques are used to reduce the search time. This paper also introduces some techniques to generate large covering array instances from smaller ones. All the techniques have been implemented in a tool called EXACT (EXhaustive seArch of Combinatorial Test suites). A new optimal covering array is found by this tool. (C) 2008 Elsevier Inc. All rights reserved.

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

combinatorial testing
covering array
orthogonal array


A New On-chip Signal Generator for Charge-Based Capacitance Measurement Circuit In this paper, a new on-chip signal generator for charge-based capacitance measurement (CBCM) circuit is proposed. As compared to conventional circuits that use two input off-chip clock signals or on-chip delay cells, the proposed circuit uses an I/Q splitter and an AND function to obtain 1/2 and 1/8 duty cycle signals, hence reduces the potential mismatch between these two clock signals. The proposed circuit makes it possible to use higher input frequency in measurement. As a result, smaller capacitance can be measured using the same measurement facilities without the loss of accuracy. Implemented in a standard 180nm CMOS process, the proposed signal generator only occupies 40?m??18?m while consuming less than 60?W at an input frequency of 100MHz. Simulation and measurement results suggest that the CBCM measuring circuits with proposed signal generator achieves the same accuracy as compared to conventional circuits while the requirement of measurement facilities can be considerably relaxed.

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

signal generator
capacitance measurement

cmos circuits
cmos technology
device characterization


detecting similar java classes using tree algorithms Similarity analysis of source code is helpful during development to provide, for instance, better support for code reuse. Consider a development environment that analyzes code while typing and that suggests similar code examples or existing implementations from a source code repository. Mining software repositories by means of similarity measures enables and enforces reusing existing code and reduces the developing effort needed by creating a shared knowledge base of code fragments. In information retrieval similarity measures are often used to find documents similar to a given query document. This paper extends this idea to source code repositories. It introduces our approach to detect similar Java classes in software projects using tree similarity algorithms. We show how our approach allows to find similar Java classes based on an evaluation of three tree-based similarity measures in the context of five user-defined test cases as well as a preliminary software evolution analysis of a medium-sized Java project. Initial results of our technique indicate that it (1) is indeed useful to identify similar Java classes, (2)successfully identifies the ex ante and ex post versions of refactored classes, and (3) provides some interesting insights into within-version and between-version dependencies of classes within a Java project.

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

tree
software evolution
reuse
software repositories
examples
analysis
context
project
paper
evaluation
software
dependencies
development environment
test
code
support
similarity
repositories
knowledge base
query
information retrieval

help
mining software repositories
developer
user
sharing
fragmentation
implementation
version
source-code
change analysis
algorithm
documentation
tree similarity measures
similarity measure
class


Odor source localization using a mobile robot in outdoor airflow environments with a particle filter algorithm This paper discusses odor source localization (OSL) using a mobile robot in an outdoor time-variant airflow environment. A novel OSL algorithm based on particle filters (PF) is proposed. When the odor plume clue is found, the robot performs an exploratory behavior, such as a plume-tracing strategy, to collect more information about the previously unknown odor source. In parallel, the information collected by the robot is exploited by the PF-based OSL algorithm to estimate the location of the odor source in real time. The process of the OSL is terminated if the estimated source locations converge within a given small area. The Bayesian-inference-based method is also performed for comparison. Experimental results indicate that the proposed PF-based OSL algorithm performs better than the Bayesian-inference-based OSL method.

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

odor source localization
mobile robot
particle filter


Application of an engineering algorithm with software code (C4.5) for specific ion detection in the chemical industries The development of an on-line computer-based classification system for the automatic detection of different ions, existing in different solutions, is addressed using a machine learning algorithm. Different parameters (current, mass and resistance) were collected simultaneously. Then these laboratory measurements are used by an algorithm software as a logged data file, resulting in to inducing a decision tree. Later, a systematic software is designed based on the rules derived from this decision tree, to recognise the type of unknown solution used in the experiment. This is a new approach to data acquisition in chemical industries involving conducting polymers.

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

online data processing
real time ion recognition


Aspect-oriented model-driven code generation: A systematic mapping study Model-driven code generation is being increasingly applied to enhance software development from perspectives of maintainability, extensibility and reusability. However, aspect-oriented code generation from models is an area that is currently underdeveloped. In this study we provide a survey of existing research on aspect-oriented modeling and code generation to discover current work and identify needs for future research. A systematic mapping study was performed to find relevant studies. Classification schemes have been defined and the 65 selected primary studies have been classified on the basis of research focus, contribution type and research type. The papers of solution proposal research type are in a majority. All together aspect-oriented modeling appears being the most focused area divided into modeling notations and process (36%) and model composition and interaction management (26%). The majority of contributions are methods. Aspect-oriented modeling and composition mechanisms have been significantly discussed in existing literature while more research is needed in the area of model-driven code generation. Furthermore, we have observed that previous research has frequently focused on proposing solutions and thus there is need for research that validates and evaluates the existing proposals in order to provide firm foundations for aspect-oriented model-driven code generation.

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

aspect-oriented software development
model-driven engineering
systematic map


Control policies for single-stage production systems with perishable inventory and customer impatience We consider problems of inventory and admission control for make-to-stock production systems with perishable inventory and impatient customers. Customers may balk upon arrival (refuse to place orders) and renege while waiting (withdraw delayed orders) during stockouts. Item lifetimes and customer patience times are random variables with general distributions. Processing, setup, and customer inter-arrival times are however assumed to be exponential random variables. In particular, the paper studies two models. In the first model, the system suspends its production when its stock reaches a safety level and can resume later without incurring any setup delay or cost. In the second model, the system incurs setup delays and setup costs; during stockouts, all arriving customers are informed about anticipated delays and either balk or place their orders but cannot withdraw them later. Using results from the queueing literature, we derive expressions for the system steady-state probabilities and performance measures, such as profit from sales and costs of inventory, setups, and delays in filling customer orders. We use these expressions to find optimal inventory and admission policies, and investigate the impact of product lifetimes and customer patience times on system performance.

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

perishable inventory
customer impatience
admission control

queueing systems
make-to-stock production
lead time estimation


Super connectivity of line graphs The super connectivity kappa' and the super edge-connectivity lambda' are more refined network reliability indices than connectivity K and edge-connectivity lambda. This paper shows that for a connected graph G with order at least four rather than a star and its line graph L(G), kappa'(L(G)) = lambda' (G) if and only if G is not super-lambda'. As a consequence, we obtain the result of Hellwig et al. [Note on the connectivity of line graphs, Inform. Process. Lett. 91 (2004) 7] that K(L(G)) = lambda' (G). Furthermore, the authors show that the line graph of a super-lambda' graph is super-lambda if the minimum degree is at least three. (c) 2005 Elsevier B.V. All rights reserved.

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

super edge-connectivity
super-lambda '
lambda '-connected
combinatorial problems


Image Guided Reconstruction of Un-sampled Data: A Filling Technique for Cultural Heritage Models Cultural Heritage (CH) is one of the major fields of application of 3D scanning technologies. In this context, one of the main limitations perceived by the practitioners is the uncompleteness of the sampling. Whenever we scan a complex artifact, the produced sampling usually presents a large number of unsampled regions. Many algorithmic solutions exist to close those gaps (from specific hole-filling algorithms to the drastic solution of using water-tight reconstruction methods). Unfortunately, adding patches over un-sampled regions is an issue in CH applications: if the 3D model should be used as a master document over the shape (and status) of the artwork, informed CH curators usually do not accept that an algorithm is used to guess portions of a surface. In this paper, we present a low-cost setup and related algorithms to reconstruct un-sampled portions of the 3D models by inferring information about the real shape of the missing region from photographs. Data needed to drive the surface completion process are obtained by coupling a calibrated pattern of laser diodes to a digital camera. Thus, we are proposing a simple active acquisition device (based on consumer components and more flexible than standard 3D scanning devices) to improve selectively the sampling produced by a standard 3D scanning device. After acquiring one or more images with the laser-enhanced camera, an almost completely automatic process analyzes the image/s in order to extract the pattern, to estimate the laser projector intersections over the surface and determining coordinates of those points (using the consolidated triangulation approach). Then, the gathered geometric data are used to steer the hole filling in order to obtain a patch which is coherent with the real shape of the object. A series of tests on real objects proves that our method is able to recover geometrical features that cannot be reconstructed using state-of-the-art methods. Consequently, it can be used to obtain complete 3D models without creating plausible but false 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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


RECURSIVE FORM OF GENERAL LIMITED MEMORY VARIABLE METRIC METHODS In this report we propose a new recursive matrix formulation of limited memory variable metric methods. This approach can be used for an arbitrary update from the Broyden class (and some other updates) and also for the approximation of both the Hessian matrix and its inverse. The new recursive formulation requires approximately 4mn multiplications and additions per iteration, so it is comparable with other efficient limited memory variable metric methods. Numerical experiments concerning Algorithm 1, proposed in this report, confirm its practical efficiency.

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

unconstrained optimization
large scale optimization
limited memory methods
variable metric updates
algorithms


Mobile Sampling of Sensor Field Data Using Controlled Broadcast Mobile objects can be used to gather samples from a sensor field. Civilian vehicles or even human beings equipped with proper wireless communication devices can be used as mobile sinks that retrieve sensor-data from sampling points within a large sensor field. A key challenge is how to gather the sensor data in a manner that is energy efficient with respect to the sensor nodes that serve as sources of the sensor data. In this paper, an algorithmic technique called Band-based Directional Broadcast is introduced to control the direction of broadcasts that originate from sensor nodes. The goal is to direct each broadcast of sensor data toward the mobile sink, thus reducing costly forwarding of sensor data packets. The technique is studied by simulations that consider energy consumption and data deliverability.

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

sensor data sampling
mobile object
sensor networks


Conservative motion of a discrete, dodecahedral gyroscope A gyroscope is simulated as a discrete, rigid body in rotation by introduction of a molecular mechanics type formulation. The model incorporates the popular engineering lumped mass technique, so that molecules are aggregated into particles at the vertices. The conservative dynamical differential equations are solved numerically in such a fashion that all the system invariants continue to be invariants. A variety of examples are described and discussed, revealing precession and nutation. (C) 2002 Elsevier Science Ltd. All rights reserved.

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


performativity in design and evaluation of sounding interactive commodities This paper discusses the relevance of performativity and the need for improvisational methods in sound design for interactive commodities. Both the impact on design methods and on the evaluation of experience prototypes are investigated. Several sound design techniques are proposed that help to exploit performativity and improvisation without compromising on sonic elaboration. In particular, a combination of Foley and realtime control of multisamples and sound processing was used. The analysis of several prototypes which were created in workshop settings, partially in collaboration with industry, provides further insights on the impact of performativity on sonic interaction design and evaluation.

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

interactive commodities
sonic interaction design


Interference detection and optimal tool selection in 3-axis NC machining of free-form surfaces This paper presents a systematic tool-path generation methodology which incorporates interference detection and optimal tool selection for machining free-form surfaces on 3-axis CNC machines using ball-end cutters. In this method, the global and local interference is first detected and prevented, and then the optimal tools in terms of machining time are selected and tool paths are generated. A system of five algorithms is developed to determine the interference area. On the basis of these algorithms, the machining time of each available tool is estimated by considering tool size, scallop height, and accessible surface area. Finally, the combination of tools which possesses the minimum overall machining time is selected as the optimal tool sizes. Our case study has demonstrated the validity of the proposed methodology and algorithms.

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

optimal tool selection
interference detection


AUTOMATED DESIGN OF DIAGNOSTIC SYSTEMS This research effort represents an inquiry into an important problem of automated acquisition, indexing, retrieval, and effective use of knowledge in diagnostic tasks. Its specific goal is to develop an incremental concept formation system which will automate both the design and use of diagnostic knowledge-based systems by a novice. The adopted approach to this problem is based on the modified family resemblance and contrast model theories, as well as a context-sensitive, distributed probabilistic representation of learned concepts. These ideas have been implemented in the INC2 system. The system is evaluated in terms of its prediction accuracy in the domains of breast cancer, primary tumor, and audiology cases.

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

classification
unsupervised learning
knowledge acquisition


Robust Height Estimation of Moving Objects From Uncalibrated Videos This paper presents an approach for video metrology. From videos acquired by an uncalibrated stationary camera, we first recover the vanishing line and the vertical point of the scene based upon tracking moving objects that primarily lie on a ground plane. Using geometric properties of moving objects, a probabilistic model is constructed for simultaneously grouping trajectories and estimating vanishing points. Then we apply a single view mensuration algorithm to each of the frames to obtain height measurements. We finally fuse the multiframe measurements using the least median of squares (LMedS) as a robust cost function and the Robbins-Monro stochastic approximation (RMSA) technique. This method enables less human supervision, more flexibility and improved robustness. From the uncertainty analysis, we conclude that the method with auto-calibration is robust in practice. Results are shown based upon realistic tracking data from a variety of scenes.

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

stochastic approximation
video metrology

em algorithm
motion information
vanishing point


Linked Data and multimedia: the state of affairs Linked Data is a way of exposing and sharing data as resources on the Web and interlinking them with semantically related resources. In the last three years significant amounts of data have been generated, increasingly forming a globally connected, distributed data space. For multimedia content, metadata are a key factor for efficient management, organization, and retrieval. However, the relationship between multimedia and Linked Data has been rarely studied, leading to a lack of mutual awareness and, as a consequence thereof, technological deficiencies. This article introduces the basic concepts of Linked Data in the context of multimedia metadata, and discusses techniques to generate, expose, discover, and consume Linked Data. It shows that a large amount of data sources exist, which are ready to be exploited by multimedia applications. The benefit of Linked Data in two multimedia-related applications is discussed and open research issues are outlined with the goal of bringing the research fields of multimedia and Linked Data closer together in order to facilitate mutual benefit.

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


Quantum Property Testing of Group Solvability Testing efficiently whether a finite set Gamma with a binary operation . over it, given as an oracle, is a group is a well-known open problem in the field of property testing. Recently, Friedl, Ivanyos and Santha have made a significant step in the direction of solving this problem by showing that it is possible to test efficiently whether the input (Gamma, .) is an abelian group or is far, with respect to some distance, from any abelian group. In this paper, we make a step further and construct an efficient quantum algorithm that tests whether (Gamma, .) is a solvable group, or is far from any solvable group. More precisely, the number of queries used by our algorithm is polylogarithmic in the size of the set Gamma.

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


Model sparsity and brain pattern interpretation of classification models in neuroimaging Interest is increasing in applying discriminative multivariate analysis techniques to the analysis of functional neuroimaging data. Model interpretation is of great importance in the neuroimaging context, and is conventionally based on a brain map derived from the classification model. In this study we focus on the relative influence of model regularization parameter choices on both the model generalization, the reliability of the spatial patterns extracted from the classification model, and the ability of the resulting model to identify relevant brain networks defining the underlying neural encoding of the experiment. For a support vector machine, logistic regression and Fisher's discriminant analysis we demonstrate that selection of model regularization parameters has a strong but consistent impact on the generalizability and both the reproducibility and interpretable sparsity of the models for both ?2 ? 2 and ?1 ? 1 regularization. Importantly, we illustrate a trade-off between model spatial reproducibility and prediction accuracy. We show that known parts of brain networks can be overlooked in pursuing maximization of classification accuracy alone with either ?2 ? 2 and/or ?1 ? 1 regularization. This supports the view that the quality of spatial patterns extracted from models cannot be assessed purely by focusing on prediction accuracy. Our results instead suggest that model regularization parameters must be carefully selected, so that the model and its visualization enhance our ability to interpret the brain.

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

neuroimaging
classification
regularization
sparsity
model interpretation

pattern analysis
machine learning
kernel methods
npairs resampling


a color graphics system for i.c. mask design and analysis In view of the continuing requirement for good interactive tools in the area of computer aided design, an advanced high-resolution monochrome and color, mini-computer controlled, graphics display has been designed and built. Considering the particular area of integrated circuit mask design, the ability to produce filled, color coordinated shapes extends the designer's interpretation of displayed layouts to a level not previously available with conventional graphics displays. Apart from this welcome improvement in interpretation, the hardware structure of the display provides the system designer with a tool which is potentially far more powerful than existing displays. This factor has been used to implement a comprehensive system to design MOS IC layouts in a detailed manner at the device level. A resulting program is described which is capable of deriving the node table, transistor parameters and parasitic effects for a MOS circuit displayed on the graphics monitor. The output format of this program is in a form suitable for direct input to a general circuit analysis program. The algorithms which use a topological mapping approach are shown to have possible execution time benefits over previous methods while maintaining the overwhelming advantage of user interaction. The relationship of this approach to more automated systems is also treated.

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

color use input analysis design tool direct general graphics interaction structure systems factor interpretation device hardware display monitor tools

requirements
computation
layout
map
timing
shape
automation
relationships
method
user interaction
algorithm
effect
integrability
circuits


Convex hull representation of the deterministic bipartite network interdiction problem We consider a version of the stochastic network interdiction problem modeled by Morton et al. (IIE Trans 39:314, 2007) in which an interdictor attempts to minimize a potential smugglers chance of evasion via discrete deployment of sensors on arcs in a bipartite network. The smuggler reacts to sensor deployments by solving a maximum-reliability path problem on the resulting network. In this paper, we develop the (minimal) convex hull representation for the polytope linking the interdictors decision variables with the smugglers for the case in which the smugglers origin and destination are known and interdictions are cardinality-constrained. In the process, we propose an exponential class of easily-separable inequalities that generalize all of those developed so far for the bipartite version of this problem. We show how these cuts may be employed in a cutting-plane fashion when solving the more difficult problem in which the smugglers origin and destination are stochastic, and argue that some instances of the stochastic model have facets corresponding to the solution of NP-hard problems. Our computational results show that the cutting planes developed in this paper may strengthen the linear programming relaxation of the stochastic model by as much as 25%.

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


What makes a great journal great in the sciences? Which came first, the chicken or the egg? The paper is concerned with analysing what makes a great journal great in the sciences, based on quantifiable Research Assessment Measures (RAM). Alternative RAM are discussed, with an emphasis on the Thomson Reuters ISI Web of Science database (hereafter ISI). Various ISI RAM that are calculated annually or updated daily are defined and analysed, including the classic 2-year impact factor (2YIF), 5-year impact factor (5YIF), Immediacy (or 0-year impact factor (0YIF)), Eigenfactor, Article Influence, C3PO (Citation Performance Per Paper Online), h-index, Zinfluence, PI-BETA (Papers IgnoredBy Even The Authors), Impact Factor Inflation (IFI), and three new RAM, namely Historical Self-citation Threshold Approval Rating (H-STAR), 2 Year Self-citation Threshold Approval Rating (2Y-STAR), and Cited Article Influence (CAI). The RAM data are analysed for the 6 most highly cited journals in 20 highly-varied and well-known ISI categories in the sciences, where the journals are chosen on the basis of 2YIF. The application to these 20 ISI categories could be used as a template for other ISI categories in the sciences and social sciences, and as a benchmark for newer journals in a range of ISI disciplines. In addition to evaluating the 6 most highly cited journals in each of 20 ISI categories, the paper also highlights the similarities and differences in alternative RAM, finds that several RAM capture similar performance characteristics for the most highly cited scientific journals, determines that PI-BETA is not highly correlated with the other RAM, and hence conveys additional information regarding research performance. In order to provide a meta analysis summary of the RAM, which are predominantly ratios, harmonic mean rankings are presented of the 13 RAM for the 6 most highly cited journals in each of the 20 ISI categories. It is shown that emphasizing THE impact factor, specifically the 2-year impact factor, of a journal to the exclusion of other informative RAM can lead to a distorted evaluation of journal performance and influence on different disciplines, especially in view of inflated journal self citations.

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

immediacy
eigenfactor
article influence
c3po
zinfluence
ifi


Optimal design of aircraft structures with damage tolerance requirements Damage tolerance analysis (DTA) was considered in the global design optimization of an aircraft wing structure. Residual strength and fatigue life requirements, based on the damage tolerance philosophy, were investigated as new design constraints. The global/local finite element approach allowed local fatigue requirements to be considered in the global design optimization. AFGROW fatigue crack growth analysis provided a new strength criterion for satisfying damage tolerance requirements within a global optimization environment. Initial research with the ASTROS program used this damage tolerance constraint to optimize cracked skin panels on the lower wing of a fighter/attack aircraft. For an aerodynamic and structural model of this type of aircraft, ASTROS simulated symmetric and asymmetric maneuvers during the optimization. Symmetric maneuvers, without underwing stores, produced the highest stresses and drove the optimization of the inboard lower wing skin. Asymmetric maneuvers, with underwing stores, affected the optimum thickness of the outboard hard points. Subsequent design optimizations included DTA and von Mises stress constraints simultaneously. In the configuration with no stores, the optimization was driven by the DTA constraint and, therefore, DTA requirements can have an active role to play in preliminary aircraft design.

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

aircraft structures
damage tolerance analysis
optimization
afgrow
astros


Tantalum carbide and nitride diffusion barriers for Cu metallisation The reactions in the Si/TaC/Cu and Si/Ta2N/Cu metallisation systems were investigated by X-ray diffraction, Rutherford backscattering, scanning electron microscope and the transmission electron microscopy. The results were then combined with the assessed ternary SiTaC, TaCCu, SiTaN and TaNCu phase diagrams. It was found that both barriers ultimately failed due to diffusion of Cu through the barrier and accompanied formation of Cu3Si at temperatures higher than 725C. However, in the TaC barriers the formation of amorphous TaOx layer with significant amounts of C took place at the TaC/Cu interface already at 600C. Similar behaviour at low temperatures was also noted in the Ta2N barriers.

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

phase diagrams
diffusion barriers
tantalum carbide


AN ALGORITHM FOR SOLVING RULE SETSBASED BILEVEL DECISION PROBLEMS Bilevel decision addresses the problem in which two levels of decision makers each tries to optimize their individual objectives under certain constraints, and to act and react in an uncooperative and sequential manner. Given the difficulty of formulating a bilevel decision problem by mathematical functions, a rule setsbased bilevel decision (RSBLD) model was proposed. This article presents an algorithm to solve a RSBLD problem. A case-based example is given to illustrate the functions of the proposed algorithm. Finally, a set of experiments is analyzed to further show the functions and the effectiveness of the proposed algorithm.

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

decision-making model
rule sets
bilevel decision making
optimization algorithm


MRAG-I2D: Multi-resolution adapted grids for remeshed vortex methods on multicore architectures We present MRAG-I2D,1 an open source software framework, for multiresolution simulations of two-dimensional, incompressible, viscous flows on multicore architectures. The spatiotemporal scales of the flow field are captured by remeshed vortex methods enhanced by high order average-interpolating wavelets and local time-stepping. The multiresolution solver of the Poisson equation relies on the development of a novel, tree-based multipole method. MRAG-I2D implements a number of HPC strategies to map efficiently the irregular computational workload of wavelet-adapted grids on multicore nodes. The capabilities of the present software are compared to the current state-of-the-art in terms of accuracy, compression rates and time-to-solution. Benchmarks include the inviscid evolution of an elliptical vortex, flow past an impulsively started cylinder at Re = 40 40 000 and simulations of self-propelled anguilliform swimmers. The results indicate that the present software has the same or better accuracy than state-of-the-art solvers while it exhibits unprecedented performance in terms of time-to-solution.

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

wavelets
adapted grids
multicore architectures

local time-stepping
remeshing
multipole methods
bluff-body flows


Ripplet domain non-linear filtering for speckle reduction in ultrasound medical images The paper presents a new method for speckle reduction in ultrasound medical images. The proposed method combines the bilateral filter and ripplet thresholding to remove the speckles in ultrasound images. The proposed method provides better performance for despeckling of ultrasound images compared to several existing methods.

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

discrete ripplet transform
non-linear bilateral filter


Greenhouse air temperature predictive control using the particle swarm optimisation algorithm The particle swarm optimisation algorithm is proposed as a new method to design a model-based predictive greenhouse air temperature controller subject to restrictions. Its performance is compared with the ones obtained by using genetic and sequential quadratic programming algorithms to solve the constrained optimisation air temperature control problem. Controller outputs are computed in order to optimise future behaviour of the greenhouse environment, regarding set-point tracking and minimisation of the control effort over a prediction horizon of 1h with 1-min sampling period, for a greenhouse located in the north of Portugal. Since the controller must be able to predict the greenhouse environmental conditions over the specified time interval, it is necessary to use mathematical models that describe the greenhouse climate, as well as to predict the outside weather. These requirements are met by using auto regressive models with exogenous inputs and time series auto-regressive models to simulate the inside and outside climate conditions, respectively. These models have time variant parameters and so, recursive identification techniques are applied to estimate their values in real-time. The models employ data from the climate inside and outside the greenhouse, as well as from the control inputs. Simulations with the proposed methodology to design the model-based predictive air temperature controller are presented. The results indicate a better efficiency of the particle swarm optimisation algorithm as compared with the efficiencies obtained with a genetic algorithm and a sequential quadratic programming method.

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

agriculture
model predictive control
particle swarm optimisation algorithms