An Auto-tuning Assisted Power-Aware Study of Iris Matching Algorithm on Intels SCC Biometric applications become paramount across private sectors, industry, as well as government agencies. As large amount of data being collected from many different sources, managing such volumes of data and developing efficient and effective large-scale operational solutions have become a concern. For example, real-time identification of individuals with the purpose of allowing or denying them access to specific systems or resource is challenging from the performance point of view. In addition, processing large amounts of data requires a significant amount of energy. The Single-chip Cloud Computer (SCC) is an experimental processor created by Intel Labs. In this paper we employ SCC, which supports different configurations in terms of number of cores, frequency, and voltage settings, to investigate the power-aware computing and performance enhancement of an iris matching algorithm on such many-core architecture. This biometric application contains a large degree of parallelism that can be exploited by porting it onto the SCC. Various metrics such as performance, power, energy, energy delay product (EDP), and power per speedup (PPS) are studied when executing the application under different SCC configurations. We also analyze how the results of these metrics vary as we change different parameters. In the latest stage of this study, we apply an auto-tuning approach based on Differential Evolution (DE) algorithm in an effort to quickly approaching the optimal configuration of the SCC based on the targeted metric. This allows us to traverse only a portion of the search space. Such approach proves to be very useful for energy-related metrics.

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

single-chip cloud computer
iris pattern recognition
biometrics
dynamic voltage and frequency scaling
power-aware computing
many-core processor


An initial evaluation of MathPad(2): A tool for creating dynamic mathematical illustrations MathPad(2) is a pen-based application prototype for creating mathematical sketches. Using a modeless gestural interface, it lets users make dynamic illustrations by associating handwritten mathematics with free-form drawings and provides a set of tools for graphing and evaluating mathematical expressions and solving equations. In this paper, we present the results of an initial evaluation of the MathPad(2) prototype, examining the user interface's intuitiveness and the application's perceived usefulness. Our evaluations are based on both performance and questionnaire results including first attempt gesture performance, interface recall tests, and surveys of user interface satisfaction and perceived usefulness. The results of our evaluation suggest that, although some test subjects had difficulty with our mathematical expression recognizer, they found the interface, in general, intuitive and easy to remember. More importantly, these results suggest the prototype has the potential to assist beginning physics and mathematics students in problem solving and understanding scientific concepts. (c) 2007 Elsevier Ltd. All rights reserved.

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

mathematical sketching
mathematical expression recognition
gestural user interface
user evaluation


The PN-tree: A parallel and distributed multidimensional index Multidimensional indexing is concerned with the indexing of multi-attributed records, where queries can be applied. on some or all of the. attributes. Indexing multi-attributed records is referred to by the term multidimensional indexing because each record is viewed as a point in a multidimensional space with a number of dimensions that is equal to the number of attributes. The values of the point coordinates along each dimension are equivalent to the values of the corresponding attributes. In this paper, the PN-tree, a new index structure for multidimensional spaces, is presented. This index structure is an efficient structure for indexing multidimensional points and is parallel by nature. Moreover, the proposed index structure does not lose its efficiency if it is serially processed or if it is processed using a small number of processors. The PN-tree can take advantage of as many processors as the dimensionality of the space. The PN-tree makes use of B(+)-trees that have been developed and tested over years in many DBMSs. The PN-tree is compared to the Hybrid tree that is known for its superiority among various index structures. Experimental results show that parallel processing of the PN-tree reduces significantly the number of disk accesses involved in the search operation. Even in its serial case, the PN-tree outperforms the Hybrid tree for large database sizes.

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

multi-attributed records
parallel and distributed processing


The extended Zeilberger algorithm with parameters Two hypergeometric terms f(k) and g(k) are said to be similar if the ratio f(k)/g(k) is a rational function of k. For similar hypergeometric terms f(1)(k),...,f(m)(k), we present an algorithm, called the extended Zeilberger algorithm, for deriving a linear relation among the sums F-i = Sigma(k)f(i)(k) (1 <= i <= m) with polynomial coefficients. When the summands f(1)(k),...,f(m)(k) contain a parameter x, we further impose the condition that the coefficients of F-i in the linear relation are x-free. Such linear relations with x-free coefficients can be used to determine the structure relations for orthogonal polynomials and to derive recurrence relations for the connection coefficients between two sequences of orthogonal polynomials. The extended Zeilberger algorithm can be easily adapted to basic hypergeometric terms. As examples, we use the algorithm or its q-analogue to establish linear relations among orthogonal polynomials and to derive recurrence relations with multiple parameters for hypergeometric sums or basic hypergeometric sums. (C) 2011 Elsevier Ltd. 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 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 B I O O 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 B I O O O O O O O O O O O O O O O O O O O O O O

the extended zeilberger algorithm
orthogonal polynomials

zeilberger's algorithm
the gosper algorithm
hypergeometric series


Practical estimation method of the optimal scanning protocol for 180 data acquisition in parallel SPECT imaging We developed a method to select the optimal set of view over 180 before data acquisition. The method uses apriori information based on the attenuation map and an estimated activity map. The method has been verified and evaluated with mathematical and realistic physical phantoms.

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

medical imaging and processing
pi-scheme
180 reconstruction
reducing scanning angle


Enhancement of low quality underwater image through integrated global and local contrast correction A method of integration global and local contrast stretching is proposed to increase underwater image quality. The integrated modification of RGB and HSV color model is applied in the proposed method. Resultant image outperforms the current state-of-the-arts techniques in terms of image details and noise. 300 low contrast underwater images are used in the experiment.

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

underwater image processing
contrast enhancement
color improvement
noise reduction
histogram stretching


Application of fuzzy set theory to the change intervals at a signalized intersection The main object of this paper is to develop a new procedure to calculate the change and clearance intervals of a traffic signal from a rule-based fuzzy logic system. This procedure is based on the theory that the driver's decision making at signalized intersections is based on imprecise or fuzzy information. The procedure requires no analytical or mathematical modeling of the system's phenomena and provides the flexibility for modification to improve the performance of the system. (C) 2002 Elsevier Science B.V. All rights reserved.

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


effect of storage allocation/reclamation methods on parallelism and storage requirements The write after read/write synchronizations (the anti- and output-dependence constraints) inhibit the parallelism exhibited by Fortran programs. These constraints can be avoided by allocating storage for the values generated in a program dynamically, so that multiple values associated with the same variable can co-exist. The additional parallelism obtained by dynamically allocating storage for a subset of variables in a program, and the extra storage required for doing so, are scrutinized for a set of scientific/engineering applications. It is shown that on allocating storage dynamically for all scalar variables in the program, several hundred Fortran statements can be executed concurrently per cycle. On allocating storage dynamically for array elements too, the further increase in parallelism is less than a factor of ten. Finally, if storage is allocated statically for all variables, the available parallelism is usually under 10 Fortran-statements/cycle. The storage required for dynamic allocation can be two orders of magnitude above that required for the execution of the program on a conventional machine.

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

requirements program applications values factor dynamic storage effect allocation

variability
dependencies
method
engine
association
parallel
arrays
constraint
read
storage allocation
writing


Hierarchical control of traffic signals using Q-learning with tile coding Multi-agent systems are rapidly growing as powerful tools for Intelligent Transportation Systems (ITS). It is desirable that traffic signals control, as a part of ITS, is performed in a distributed model. Therefore agent-based technologies can be efficiently used for traffic signals control. For traffic networks which are composed of multiple intersections, distributed control achieves better results in comparison to centralized methods. Hierarchical structures are useful to decompose the network into multiple sub-networks and provide a mechanism for distributed control of the traffic signals.

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

hierarchical control
traffic signals
tile coding


Mostly concurrent garbage collection revisited The mostly concurrent garbage collection was presented in the seminal paper of Boehm et al. With the deployment of Java as a portable, secure and concurrent programming language, the mostly concurrent garbage collector turned out to be an excellent solution for Java's garbage collection task. The use of this collector is reported for several modern production Java Virtual Machines and it has been investigated further in academia. In this paper, we present a modification of the mostly concurrent collector, which improves the throughput, the memory footprint, and the cache behavior of the collector without foiling the other good qualities (such as short pauses and high scalability). We implemented our solution on the IBM production JVM and obtained a performance improvement of up to 26.7%, a reduction in the heap consumption by up to 13.4%, and no substantial change in the (short) pause times. The modified algorithm was subsequently incorporated into the IBM production JVM.

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

languages
algorithms
concurrent garbage collection
incremental garbage collection


Complementation of rational sets on countable scattered linear orderings In a preceding paper (Bruyere and Carton, automata on linear orderings, MFCS'01), automata have been introduced for words indexed by linear orderings. These automata are a generalization of automata for finite, infinite, bi-infinite and even transfinite words studied by Buchi. Kleene's theorem has been generalized to these words. We prove that rational sets of words on countable scattered linear orderings are closed under complementation using an algebraic approach.

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

automata on linear orderings
complementation


batch codes and their applications A batch code encodes a string x into an m-tuple of strings, called buckets , such that each batch of k bits from x can be decoded by reading at most one (more generally, t) bits from each bucket. Batch codes can be viewed as relaxing several combinatorial objects, including expanders and locally decodable codes. We initiate the study of these codes by presenting some constructions, connections with other problems, and lower bounds. We also demonstrate the usefulness of batch codes by presenting two types of applications: trading maximal load for storage in certain load-balancing scenarios, and amortizing the computational cost of private information retrieval (PIR) and related cryptographic protocols.

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

applications
storage
types
demonstrate
cost
strings
locally decodable codes
private information retrieval

scenario
present
lower bound
use
distributed storage
computation
object
cryptographic protocol
read
connection
coding
information retrieval
load balancing


Human-aware planning for robots embedded in ambient ecologies We address the issue of humanrobot cohabitation in smart environments. In particular, the presence of humans in a robots work space has a profound influence on how the latter should plan its actions. We propose the use of human-aware planning, an approach in which the robot exploits the capabilities of a sensor-rich environment to obtain information about the (current and future) activities of the people in the environment, and plans its tasks accordingly. Here, we formally describe the planning problem behind our approach, we analyze its complexity and we detail the algorithm of our planner. We then show two application scenarios that could benefit from the techniques described. The first scenario illustrates the applicability of human-aware planning in a domestic setting, while the second one illustrates its use for a robotic helper in a hospital. Finally, we present a five hour-long test run in a smart home equipped with real sensors, where a cleaning robot has been deployed and where a human subject is acting. This test run in a real setting is meant to demonstrate the feasibility of our approach to humanrobot interaction.

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

human-aware planning
planning under uncertainty
planning in intelligent environments


Fast training procedure for ViolaJones type object detectors using Laplacian clutter models This paper presents a fast training strategy for the ViolaJones (VJ) type object-detection systems. The VJ object- detection system, popular for its high accuracy at real-time testing speeds, has a drawback that it is slow to train. A face detector, for example, can take days to train. In content-based image retrieval (CBIR), where search needs to be performed instantaneously, VJs long training time is not affordable. Therefore, VJs method is hardly used for such applications. This paper proposes two modifications to the training algorithm of VJ-type object detection systems which reduces the training time to the order of seconds. Firstly, Laplacian clutter (non-object) models are used to train the weak classifier, thus eliminating the need to read and evaluate thousands of clutter images. Secondly, the training procedure is simplified by removing the time-consuming AdaBoost-based feature selection procedure. An object detector, trained with 500 images, approximately takes 2s for training in a conventional 3GHz machine. Our results show that the accuracy of the detector, built with the proposed approach, is inferior to that of VJ for difficult object class such as frontal faces. However, for objects with lesser degree of intra-class variations such as hearts, state-of-the-art accuracy can be obtained. Importantly, for CBIR applications, the fast testing speed of the VJ type object detector is maintained.

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

haar-like features
laplacian distribution


an improved tdoa positioning method using pattern matching for cdma networks In this paper, an improved time difference of arrival (TDOA) positioning method using pattern matching (PM) is proposed to achieve a high positioning accuracy of mobile station (MS) in CDMA networks where GPS is not satisfactory. Iterative TDOA method is used for its high accuracy and good robustness. Since the performance of iteration method depends highly on the initial estimation, the proposed method uses the location information from PM to estimate initial value. There is no need to change the hardware of MS. PM's results and other data such as received signal value, time delay are measured by using diagnostic monitoring (DM) software in real environment. The results show that proposed method can provide a better accuracy and outperforms a conventional PM algorithm.

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


A model for the classification and survey of clock synchronization protocols in WSNs Clock synchronization in wireless sensor networks (WSNs) assures that sensor nodes have the same reference clock time. This is necessary not only for various WSN applications but also for many system level protocols for WSNs such as MAC protocols, and protocols for sleep scheduling of sensor nodes. Clock value of a node at a particular instant of time depends on its initial value and the frequency of the crystal oscillator used in the sensor node. The frequency of the crystal oscillator varies from node to node, and may also change over time depending upon many factors like temperature, humidity, etc. As a result, clock values of different sensor nodes diverge from each other and also from the real time clock, and hence, there is a requirement for clock synchronization in WSNs. Consequently, many clock synchronization protocols for WSNs have been proposed in the recent past. These protocols differ from each other considerably, and so, there is a need to understand them using a common platform. Towards this goal, this survey paper categorizes the features of clock synchronization protocols for WSNs into three types, viz. structural features, technical features, and global objective features. Each of these categories has different options to further segregate the features for better understanding. The features of clock synchronization protocols that have been used in this survey include all the features which have been used in existing surveys as well as new features such as how the clock value is propagated, when the clock value is propagated, and when the physical clock is updated, which are required for better understanding of the clock synchronization protocols in WSNs in a systematic way. This paper also gives a brief description of a few basic clock synchronization protocols for WSNs, and shows how these protocols fit into the above classification criteria. In addition, the recent clock synchronization protocols for WSNs, which are based on the above basic clock synchronization protocols, are also given alongside the corresponding basic clock synchronization protocols. Indeed, the proposed model for characterizing the clock synchronization protocols in WSNs can be used not only for analyzing the existing protocols but also for designing new clock synchronization protocols.

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

clock synchronization techniques
internal clock synchronization
external clock synchronization


Regression analysis of experiments with complex confounding patterns guided by the alias matrix Resolution III experiments with complex confounding patterns, often called main effect plans. Their main effects are partially confounded with two-factor interactions rather than being either independent or completely aliased, as they are in regular designs that are constructed from a defining relation. It is possible to detect some two-factor interactions, from experiments with complex confounding patterns if only a few of the factors are active. The partial confounding of interactions with main effects in these experiments allows one to estimate interactions with regression analysis. Recent papers have shown how the interactions can be detected using repeated runs of stepwise regression, or computationally intensive Bayesian methods. This paper shows that, with a short list of candidate interactions, the important interactions can be detected efficiently by a single pass of all subsets regression. The short list of candidates interactions for the all subsets regression are selected with regard to their potential for contributing to the value of the large estimated effects calculated from the data. The potential is determined by summing coefficients in the alias matrix. This paper reviews the concept of the alias matrix, and defines the alias plot that can be obtained from the alias matrix. The alias plot provides simple graphic for viewing the potential contribution of interactions to large estimated effects. The interactions identified on the alias plot, along with main effects, are used as candidates in an all subsets regression analysis of data from partially confounded experiments. The resulting strategy allows exploration of a wide range of the potential model space, can reveal several plausible models for the data if they exist, and can be completed using standard statistical software. Examples are presented.

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


Lane departure warning for mobile devices based on a fuzzy representation of images The use of driver assistance systems is a current trend in the car industry. However, most driver assistance systems require the use of multiple sensors, increasing the cost of their implementation in cars and making them inaccessible to many users. In this paper, we present an efficient Lane Departure Warning system for mobile devices, which is real-time, accurate and accessible to most users. On the one hand, the accuracy of the system relies on Line Detection based on Hough Transforms, a combination that has proven to be reliable for this goal in many approaches. On the other hand, the reduction of the computational time, to achieve real-time processing, is due mainly to a proposed fuzzy representation of images. Finally, we also present various tests that show that the system proposed runs at up to 20 FPS on a mobile device (with a dual-core CPU at 1.0 GHz) with a resolution of 320 240 px .

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

fuzzy image
hough transform
image processing
lane detection
android
intelligent transportation system
driver assistant


A fuzzy optimization method for multicriteria decision making: An application to reservoir flood control operation This paper presents a fuzzy optimization method based on the concept of ideal and anti-ideal points to solve multi-criteria decision making problems under fuzzy environments. The quantitative criteria values of each alternative are represented by triangular fuzzy numbers, and its qualitative counterparts and the weight of each criterion are described by linguistic terms, which can also be expressed as triangular fuzzy numbers in the proposed method. With the definition of fuzzy ideal and anti-ideal weight distances, an objective function is constructed to derive the optimal evaluation for each alternative denoted by a fuzzy membership degree. The ranking of alternatives and the best one can be determined directly on the basis of the fuzzy membership degrees without a need to compare fuzzy numbers. The evaluation process is simple and easy to use in practice. A case study of reservoir flood control operation is given to demonstrate the proposed methods effectiveness.

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

multiple criteria analysis
linguistic value
triangular fuzzy number
ideal and anti-ideal points


System-level performance analysis for designing on-chip communication architectures This paper presents a novel system-level performance analysis technique to support the design of custom communication architectures for system-on-chip integrated circuits. Our technique fills a gap in existing techniques for system-level performance analysis, which are either too slow to use in an iterative communication architecture design framework (e,g,, simulation of the complete system) or are not accurate enough to drive the design of the communication architecture (e,g,, techniques that perform a "static" analysis of the system performance). Our technique is based on a hybrid trace-based performance-analysis methodology in which an initial cosimulation of the system is performed with the communication described in an abstract manner (e,g,, as events or abstract data transfers). An abstract set of traces are extracted from the initial cosimulation containing necessary and sufficient information about the computations and communications of the system components, The system designer then specifies a communication architecture by: 1) selecting a topology consisting of dedicated as well as shared communication channels (shared buses) interconnected by bridges; 2) mapping the abstract communications to paths in the communication architecture; and 3) customizing the protocol used for each channel. The traces extracted in the initial step are represented as a communication analysis graph (CAG) and an analysis of the CAG provides an estimate of the system performance as well as various statistics about the components and their communication, Experimental results indicate that our performance-analysis technique achieves accuracy comparable to complete system simulation tan average error of 1.88%) while being over two orders of magnitude faster.

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

communication architectures
performance analysis

bus architectures
on-chip communication
simulation trace
system-on-chip


Leak detection in gas pipeline networks using an efficient state estimator. Part-I: Theory and simulations Dynamic simulation models can be used along with flow and pressure measurements, for on-line leak detection and identification in gas pipeline networks. In this two part paper, a methodology is proposed for detecting and localizing leaks occurring in gas pipelines. The main features of the proposed methodology are: (i) it is applicable to both single pipelines and pipeline networks and (ii) it considers non-ideal gas mixtures. In order to achieve the desired computational efficiency for on-line deployment, an efficient state estimation technique based on a transfer function model, previously developed by the authors, is embedded in a hypothesis testing framework. In Part-I of this paper, a detailed description of the methodology is presented, and its performance is evaluated using simulations on two illustrative pipeline systems. The proposed method is shown to perform satisfactorily even with noisy measurements and during transient conditions, provided there is sufficient redundancy in the measurements. (C) 2010 Elsevier Ltd. All rights reserved.

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

gas pipeline networks
leak detection
dynamic simulation
state estimation
transfer function


Bezel gloss and glare Two studies were performed to examine whether reflections in the glossy surround of computer displays gave rise to ergonomic problems of reduced visual performance or discontent. The approach taken was not to assess whether or not problems were present under typical environmental conditions, which would risk missing problems, but rather was to determine conditions under which problems did exist. Once this was done, it was then possible to evaluate whether the gloss of commercially available products would be acceptable or unacceptable in more normal surroundings. In the first study, visual performance was assessed by evaluating sensitivity to contrast when five different screen surrounds (bezels) were used. All six of the participants showed a decrease in sensitivity when the reflection of a lamp, of luminance 1000 times that of a typical fluorescent lamp, was seen in a mirror-like surround. When a black glossy surround was used, a tiny decrement was seen for two older participants, who were past the UK retirement age, but not for the other four pre-retirement age participants. No decrement was detected when a light silver-grey glossy surround was used. When the lamp luminance was reduced by a factor of 100 (but was still 10 times higher than that of a typical fluorescent lamp) no decrement was seen in the performance of any of the participants, even when the mirror-like surround was used. In the second study, assessments were made of the displays on five different subjective scales following the reading of text for 20min. Eight surrounds were used, three of which were identical in every respect, apart from the glossiness of their bezels. Variation in acceptability was found amongst the surrounds, and both a shiny mirror-like surround and glossy black surround were considered to be unacceptable overall. However, the comparison between the three identical displays revealed no significant differences in acceptability, and we conclude that gloss per se does not give rise to ergonomic problems in acceptability unless there is a very high contrast between the reflection and the surround.

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


Subroutines for some plasma surface interaction processes: physical sputtering, chemical erosion, radiation enhanced sublimation, backscattering and thermal evaporation A suite of FORTRAN subroutines/functions to generate data using empirical formulas for physical sputtering of monoatomic targets for any elemental incident ion (atom), chemical erosion of graphite, Radiation Enhanced Sublimation (RES) of graphite, the number and energy backscattering coefficients for any elemental incident ion (atom) on a compound target and thermal evaporation of graphite is presented. Since chemical erosion, RES and thermal evaporation depend on the surface temperature of graphite, a subroutine implementing the 1-D heat diffusion equation to determine the temperature of any plasmafacing graphite surface is implemented. As an example to illustrate the use of these subroutines/functions, a simple model for the erosion of a plasma-facing surface, consisting of a simple collisionless sheath model, a 1-dimensional steady state heat diffusion model and 0-dimensional steady state particle balance at the target is developed and a sample listing of the program is presented. (C) 2004 Elsevier B.V. All rights reserved.

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

physical sputtering
chemical erosion
thermal evaporation of graphite

plasma surface interactions
radiation enhanced sublimationt
heat diffusion in graphite
backscattering coefficient


Learning support professionals: the changing role of subject specialists in UK academic libraries This article discusses the changing role of librarians in a higher education sector that is having to adapt to a new social and educational agenda. Many converged library and computing services have been created and this has speeded the process of change for librarians, particularly those who are working as subject specialists. Such librarians, particularly those working in hybrid teams with information professionals from different skill backgrounds are having to acquire expertise and undertake tasks that only tenuously relate to the training they received at the start of their careers. Their work increasingly takes them away from those others in the same profession who undertake more traditional work. A brief list of organisations that can offer training and help for these new professionals is given along with the current UK initiatives for developing support for learning and teaching from the information community.

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

academic libraries
subject specialists
training


on testing cache-coherent shared memories Sequential consistency is the most-widely used correctness condition for multiprocessor memory systems. High-performance shared memory multiprocessors such as the Kendall Square KSR1, the Stanford DASH, and the MIT Alewife employ a variety of techniques to improve memory system performance while providing sequential consistency. Primary among them is the use of caches at each processor, kept coherent by protocols implemented in hardware. We study the problem of testing shared memory multiprocessors to determine if they are indeed providing a sequentially consistent memory. We present a series of results for testing an execution of a shared memory under scenarios that exploit the cache-coherence protocol. In addition to reads and writes to the shared memory, we consider the more powerful read-modify-write, load-reserved, and store-conditional operations available in many cache-coherent multiprocessors. Finally, we consider linearizability, another well-known correctness condition for shared memories. Linearizability imposes additional restrictions on the shared memory, beyond that of sequential consistency; we show that these restrictions are useful in testing such memories.

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

processor
shared memory
use
exploit
memory system
correctness
performance
linearizability
hardware
consistency
caches
multiprocessor

sharing
cache coherence
scenario
cache
test
shared memory multiprocessors
high-performance
operability
memorialized
read
writing
coherence
sequential consistency


Identification of single nucleotide polymorphisms from the transcriptome of an organism with a whole genome duplication The common ancestor of salmonid fishes, including rainbow trout (Oncorhynchus mykiss), experienced a whole genome duplication between 20 and 100 million years ago, and many of the duplicated genes have been retained in the trout genome. This retention complicates efforts to detect allelic variation in salmonid fishes. Specifically, single nucleotide polymorphism (SNP) detection is problematic because nucleotide variation can be found between the duplicate copies (paralogs) of a gene as well as between alleles.

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


A new approach to static output feedback stabilization of linear dynamic systems The topic of this study is output feedback control of linear control system with output. Use of condensed forms of the linear system under static output feedback (SOF) control is made to derive sufficient conditions for stabilization. A minimal-order control-free observer is presented.

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

linear matrix inequality
indefinite riccati matrix equation


Auto-Tuning and Fractional Order Controller Implementation on Hardware in the Loop System The paper deals with the design of an auto-tuning fractional order proportional-integrative-derivative controllers and its implementation on hardware in the loop simulator for the real-time control of unknown plants. The proposed procedure can be applied to systems with delay and order greater than one, once specifications on cross-over frequency and phase margin are given. The auto-tuning procedure consists of two phases: the first one dedicated to the identification of the process at the desired cross-over frequency and the second one to determine all the parameters of the fractional order proportional-integrative-derivative controllers. The obtained controller ensures an iso-damping response of the plant. Experimental results are given to confirm the effectiveness of the proposed approach and show that the requirements are totally met for the system to be controlled.

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

fractional order systems
auto tuning
robust control
iso-damping control


Robust model-based signal analysis and identification ? We describe and evaluate a model-based scheme for feature extraction and model-based signal identification which uses likelihood criteria for edge detection. Likelihood measures from the feature identification process are shown to provide a well behaved measure of signal interpretation confidence. We demonstrate that complex, transient signals, from one of 6 classes, can reliably be identified at signal to noise ratios of 2 and that identification does not fail until the signal to noise ratio has reached 1. Results show that the loss in identification performance resulting from the use of a heuristic, rather than an exhaustive, search strategy is minimal.

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

signal interpretation
signal identification

model based
maximum likelihood
machine learning
robust methods


scheduling for h.264 video traffic over geo satellite networks The provision of acceptable Quality-of-Service (QoS) for integrated multimedia traffic over a geosynchronous earth orbit (GEO) satellite network demands the existence of a well-designed Medium Access Control (MAC) protocol. This paper proposes a new dynamic satellite bandwidth allocation technique (Predictive Resource Reservation Access, PRRA) which is based on accurate H.264 video traffic prediction. Our scheme is shown to provide very good throughput and delay results, when compared with other efficient schemes from the literature and with an "ideal" satellite bandwidth allocation scheme.

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

traffic modeling
geo satellites
h.264 video


desat1 and the Evolution of Pheromonal Communication in Drosophila The evolution of communication is a fundamental biological problem. The genetic control of the signal and its reception must be tightly coadapted, especially in interindividual sexual communication. However, there is very little experimental evidence for tight genetic linkage connecting the emission of a signal and its reception. In Drosophila melanogaster, desat1 is the first known gene that simultaneously affects the emission and the perception of sex pheromones. Our experiments show that both aspects of pheromonal communication (the emission and the perception of sex pheromones) depend on distinct genetic control and may result from tissue-specific expression of different transcripts, all coding for the same desaturase. Therefore, and given the high conservation of its coding region, the pleiotropic activity of the desat1 gene may have arisen from an evolutionary process that shaped its regulatory regions.

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


Total flowtime in no-wait flowshops with separated setup times An important class of scheduling problems is characterized by a no-wait constraint where the jobs have to be processed continuously without waiting between or on consecutive machines. This constraint of no-waiting arises from the characteristics of the processing technology itself. Considering setup times separate from processing times of the jobs forms another important class of scheduling problems. This is particularly important when the ratio of the setup time to the processing time is non-negligible. This paper addresses a scheduling problem which falls in the combined category of no-wait and separate setup times. The performance measure considered is the total flowtime. This paper addresses the two-machine no-wait flowshop problem where the setup time of a job is separated from its processing time. The performance measure considered is the total flowtime. An elimination criterion is developed and optimal solutions are obtained for two special cases. For the generic case, a heuristic algorithm is provided. Computational experience shows that the algorithm yields good solutions.

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


Research and development in geo-information generalisation and multiple representation This paper analyses the difficulty in fulfilling the user requirements related to geo-information generalisation. Despite the fact that this is a long-standing research topic, the results are not satisfactory and therefore there is a very active research community trying to better meet the expectations of the users, both at the side of the geo-information producers and at the side of the geo-information users. It is argued that part of the difficulties are due to the fact that the generalization problem is not specified formally enough. Therefore, currently the most important benchmark for the generalization software is the work of human cartographers doing manual generalization, supported by automated tools, and includes subjective aspects such as taste, resulting into artistic solutions. So, a very important, intermediate, research goal is formalizing the generalization problem. In addition, the expectations of the users are growing over the past years and will continue to do so in the future: faster updates propagated between different scales, ever growing size of geo-information, support for vario-scale (instead of just multiple fixed scales), integration of formal semantics and computational geometry techniques, support for 3D representations, and so on. This paper identifies the current state of the art and provides descriptions of further research and development directions in generalisation.

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


A PTAS for the Multiple Subset Sum Problem with different knapsack capacities We present a PTAS for the Multiple Subset Sum Problem (MSSP) with different knapsack capacities. This is the selection of items from a given ground set and their assignment to a given number of knapsacks such that the sum of the item weights in every knapsack does not exceed its capacity and the total sum of the weights of the packed items is as large as possible. Our result generalizes the PTAS for the special case in which all knapsack capacities are identical [1]. (C) 2000 Elsevier Science B.V. All rights reserved.

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


Early stage intercalation of doxorubicin to DNA fragments observed in molecular dynamics binding simulations The intercalation mode between doxorubicin (an anticancer drug) and two 6-base-pair DNA model fragments (d(CGATCG)2 and d(CGTACG)2) has been well studied by X-ray crystallography and NMR experimental methods. Yet, the detailed intercalation pathway at molecular level remains elusive. In this study, we conducted molecular dynamics binding simulations of these two systems using AMBER DNA (parmbsc0) and drug (GAFF) force fields starting from the unbound state. We observed outside binding (minor groove binding or end-binding) in all six independent binding simulations (three for each DNA fragment), followed by the complete intercalation of a drug molecule in two simulations (one for each DNA fragment). First, our data directly supported that the minor groove binding is the dominant pre-intercalation step. Second, we observed that the opening and flipping of a local base pair (A3T10 for d(CGATCG)2 and C1G12 for d(CGTACG)2) in the two intercalation trajectories. This locally cooperative flippingintercalation mechanism was different from the previously proposed riseinsertion mechanism by which the distance between two neighboring intact base pairs increases to create a space for the drug insertion. Third, our simulations provided the first set of data to support the applicability of the AMBER DNA and drug force fields in drugDNA atomistic binding simulations. Implications on the kinetics pathway and drug action are also discussed.

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


Aggressive Runtime Leakage Control Through Adaptive Light-Weight V-th Hopping With Temperature and Process Variation The increasing leakage power consumption and stringent thermal constraint necessitate more aggressive leakage control techniques. Power gating and body biasing are widely used for standby leakage control. Their large energy overhead for performing mode transition is the major obstacle for more aggressive leakage control. Temperature and process variation (TV/PV) further magnify the overhead problem, leading to so-called "corner case leakage control" problem. Light-weight V-th hopping (LW-VH) is a candidate technique to tackle the energy overhead problem. This paper demonstrates the application of LW-VH on microarchitectural- and RTL-level idleness exploitation with adaptive control techniques for TV/PV compensation. Adaptive LW-VH shows 30% average saving on total CPU leakage at microarchitectural level, and 4% to 15% leakage saving at RTL level. By combining all the techniques proposed in this paper, a three-tier aggressive leakage control system is introduced to fully exploit idleness at all levels.

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

body biasing
corner case leakage control
power gating


DMOS, a generic document recognition method: application to table structure analysis in a general and in a specific way We will show in this paper one of the numerous interests of designing a generic recognition system, i.e. the possibility of producing either general or specific systems. We propose the Description and Modification of Segmentation (DMOS) method, which is made of a new grammatical language (Enhanced Position Formalism-EPF) and an associated parser able to deal with noise. From an EPF description of a kind of document structure, a new recognition system is produced by compilation. This method has been successfully used to produce recognition systems on musical scores, mathematical formulae and even tennis courts in videos. This DMOS generic method separates knowledge from program. Therefore, for a same kind of document like table structures, it is possible to define with EPF, more or less specific descriptions to produce more or less specific recognition systems. For example, we have been able to produce a general recognition system of table structures. It can recognize the hierarchical organization of a table made with rulings, whatever the number/size of column/rows and the deep of the hierarchy contents in it, as soon as the document has a not too bad quality (no missing rulings for example). We will present the way the description is done using EPF to be general enough to recognize very different table organizations. With the same DMOS generic method, we have also been able to easily define a specific recognition system of the table structure of quite damaged military forms of the 19th century. This specific description was necessary to compensate some missing informations concerning the table structure of those military forms, due to a very bad quality or hidden part of the table. This system has been successfully validated on 88,745 images, showing that this DMOS generic method can be used at an industrial level.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 table recognition
archives document
grammar
generic system
structured documents


Updates with disjunctive information: From syntactical and semantical perspectives The possible models approach is a classical minimal change semantics for knowledge base update, which provides an exclusive interpretation for disjunctive information in updates. It has been recognized that the exclusive interpretation for disjunction may be problematic under some circumstances. In this paper, we investigate inclusive interpretations for disjunctions in updates from both syntactical and semantical viewpoints. In particular, we propose two approaches for disjunctive update-the minimal change with exceptions (MCE) and the minimal change with maximal disjunctive inclusions (MCD). Both approaches provide inclusive interpretations for disjunctions in updates, though the first is syntax-based and the second is model-theoretic. We then characterize the MCE and MCD in terms of alternative minimal change criteria and relate them to traditional Katsuno and Mendelzon's update postulates.

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

knowledge base update
disjunctive information
minimal change


Cancer Preventive Effect of Morinda citrifolia (Noni) Morinda citrifolia (Noni) has been extensively used in folk medicine by Polynesians for over 2,000 years. It has been reported to have broad therapeutic effects, including anticancer activity, in both clinical practice and laboratory animal models. The mechanism for these effects remains unknown. The hypothesis that Morinda citrifolia possesses a cancer preventive effect at the initiation stage of carcinogenesis was studied. Our preliminary data indicated that 10% Tahitian Noni Liquid Dietary Supplement or Tahitian Noni Juice (TNJ), made from Morinda citrifolia fruit by Morinda Inc, in drinking water for one week was able to prevent DMBA-DNA adduct formation. The levels of DMBA-DNA adducts were reduced by 30% in the heart, 41% in the lung, 42% in the liver, and 80% in the kidney of female SD rats. Even more dramatic results were obtained in male C57 BL-6 mice

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

tahitian noni liquid dietary supplement or tahitian noni

juice (tnj)
cancer prevention
12-dimethylbenz(a)anthrancene (dmba)
dna adducts
lipid hydroperoxide (lpo)
superoxide anion radical (sar)
tetrazolium nitroblue (tnb)
antioxidant


Tissue Engineering The issues that should be considered as part of the design and evaluation of tissue engineering constructs with respect to their targeted clinical application are reviewed. This paper provides a general framework for the process of bringing tissue-engineering constructs from the laboratory bench to the patient's bedside, rather than presenting a detailed review of the engineering or biologic principles or mechanisms that are necessary for successful tissue engineering. Many of the principles are animated by using examples from current studies being developed in my laboratory or those of my collaborators. In all likelihood, multiple solutions or approaches will be found that lead to successful tissue-engineering constructs. The focus here is on the identification of critical parameters to be considered rather than specific design solutions. The review is therefore organized to reflect feasible sequences of activities formulated to take tissue engineering from concept to clinical reality.

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

bone graft substitute
gene-activated matrix


Distinct element method analysis of a retaining wall using a steel frame and fill materials A technique is developed to clearly establish the shear resistance of a cellular structure, retaining wall composed of a steel frame and fill materials with both continuous and discontinuous characteristics. To overcome the limitation of the existing analysis approach based on continuum mechanics, in which the shear behavior and interaction between the frames and fill material of this type of structure are difficult to describe, this paper introduces displacement incremental analysis into the distinct element method. The results obtained by using the proposed approach are compared with experimental results to verify its accuracy. The results show an internal friction angle of fill materials and overburdening load are major factor determining the shear resistance of a retaining wall with a cellular structure type. From the results of the parametric study on the shear behavior of this type of structure, this paper also proposes a shear resistance moment-shear displacement formula for designing a retaining wall with a cellular structure type.

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

retaining wall
cellular structure
shear resistance
fill materials


Water bath temperature control with a neural fuzzy inference network Although multilayered backpropagation neural networks (BPNN) have demonstrated high potential in the nonconventional branch of adaptive control, its long training time usually discourages their applications in industry. Moreover, when they are trained on-line to adapt to plant variations, the overtuned phenomenon usually occurs. To overcome the weakness of the BPNN, we propose a neural fuzzy inference network (NFIN) in this paper suitable for adaptive control of practical plant systems in general, and for adaptive temperature control of a water bath system in particular. The NFIN is inherently a modified TSK (Takagi-Sugeno-Kang)-type fuzzy rule-based model possessing neural network's learning ability. In contrast to the general adaptive neural fuzzy networks, where the rules should be decided in advance before parameter learning is performed, there are no rules initially in the NFIN. The rules in the NFIN are created and adapted as on-line learning proceeds via simultaneous structure and parameter identification. The NFIN has been applied to a water bath temperature control system. As compared to the BPNN under the same training procedure, the control results show that not only can the NFIN greatly reduce the training time and avoid the overtuned phenomenon, but the NFIN also has perfect regulation ability. (C) 2000 Elsevier Science 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

neural fuzzy network
backpropagation network
tsk fuzzy rules
recursive least square
structure/parameter learning
similarity measure


Heat-and-run: Leveraging SMT and CMP to manage power density through the operating system Power density in high-performance processors continues to increase with technology generations as scaling of current, clock speed, and device density outpaces the downscaling of supply voltage and thermal ability of packages to dissipate heat. Power density is characterized by localized chip hot spots that can reach critical temperatures and cause failure. Previous architectural approaches to power density have used global clock gating, fetch toggling, dynamic frequency scaling, or resource duplication to either prevent heating or relieve overheated resources in a superscalar processor Previous approaches also evaluate design technologies where power density is not a major problem and most applications do not overheat the processor Future processors, however are likely to be chip multiprocessors (CMPs) with simultaneously-multithreaded (SMT) cores. SMT CMPs pose unique challenges and opportunities for power density. SMT and CMP increase throughput and thus on-chip heat, but also provide natural granularities for managing power-density. This paper is the first work to leverage SMT and CMP to address power density. We propose heat-and-run SMT thread assignment to increase processor-resource utilization before cooling becomes necessary by co-scheduling threads that use complimentary resources. We propose heat-and-run CMP thread migration to migrate threads away from overheated cores and assign them to free SMT contexts on alternate cores, leveraging availability of SMT contexts on alternate CMP cores to maintain throughput while allowing overheated cores to cool. We show that our proposal has an average of 9% and up to 34% higher throughput than a previous superscalar technique running the same number of threads.

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


Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones SeDuMi is an add-on for MATLAB, which lets you solve optimization problems with linear, quadratic and semidefiniteness constraints. It is possible to have complex valued data and variables in SeDuMi. Moreover, large scale optimization problems are solved efficiently, by exploiting sparsity. This paper describes how to work with this toolbox.

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

symmetric cone
semidefinite programming
second order cone programming
self-duality


Assessing the likelihood of recurrence during RNA evolution in vitro Recurrence is the possibility of resulting in the same endpoint multiple times when a living system is allowed to evolve repeatedly starting from a given initial point. This concept is of concern to both evolutionary theoreticians and molecular biologists who use nucleic acid selection techniques to mimic biotic and computorial processes in the test tube. Using the continuous in vitro evolution methodology, many replicate experimental evolutionary lineages with populations of catalytic RNA were performed to gain insight into the parameters that could affect recurrence. The likelihood that the same genotype will result in parallel trials of an evolution experiment in vitro depends on several factors, including the phenotype under selection, the size and composition of the initial diverse pool of nucleic acids used in the experiment, the degree of mutation possible during the experiment, the shape of the fitness landscape through which the population evolves, and the strategies used to invoke selection and to search the landscape, among others. By considering these factors, it can be predicted that recurrence is more likely when a small, wild-type-based starting pool is used with efficient selection and search strategies involving little online mutagenesis within a rugged adaptive landscape with a strong local optimum. The recurrence experiments performed here on the 150-nucleotide ligase ribozyme demonstrate that it repeatedly jumps from one peak in a fitness landscape to another, apparently hurdling a deep fitness valley. These predictions can and should be tested by additional multiple replicates of actual evolution experiments in the laboratory.

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

recurrence
rna
in vitro evolution
fitness landscape


SOLVING FUZZY ASSEMBLY-LINE BALANCING PROBLEM WITH GENETIC ALGORITHMS Assembly-line balancing problem is known as one of difficult combinatorial optimization problems. This problem has been solved with linear programming, dynamic programming approaches, but unfortunately these approaches do not lead to efficient algorithms. Recently, genetic algorithm has been recognized as an efficient and usefull procedure for solving large and hard combinatorial optimization problems, such as scheduling problems, travelling salesman problems, transportation problems, and so on. Fuzzy sets theory is frequently used to represent uncertainty of information. In this paper, to treat the data of real-world problems we use a fuzzy number to represent the processing time and show that we can get a good performance in solving this problem using genetic algorithms.

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

assembly-line balancing problem
fuzzy numbers


Optimal Message-Driven Implementations of Omega with Mute Processes We investigate the complexity of algorithms in message-driven models. In such models, events in the computation can only be caused by message receptions, but not by the passage of time. Hutle and Widder [2005a] have shown that there is no deterministic message-driven self-stabilizing implementation of the eventually strong failure detector and thus Omega in systems with uncertainty in message delays and channels of unknown capacity using only bounded space. Under stronger assumptions it was shown that even the eventually perfect failure detector can be implemented in message-driven systems consisting of at least f + 2 processes (f being the upper bound on the number of processes that crash during an execution). In this article we show that f + 2 is in fact a lower bound in message-driven systems, even if nonstabilizing algorithms are considered. This contrasts time-driven models where f + 1 is sufficient for failure detector implementations. Moreover, we investigate algorithms where not all processes send message, that is, are active, but some (in a predetermined set) remain passive. Here, we show that the f + 2 processes required for message-driven systems must be active, while in time-driven systems it suffices that f processes are active. We also provide message-driven implementations of Omega. Our algorithms are efficient in the sense that not all processes have to send messages forever, which is an improvement to previous message-driven failure detector implementations.

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

reliability
theory
fault tolerance
message-driven distributed algorithm
unreliable failure detectors


Global registration of large collections of range images with an improved Optimization-on-a-Manifold approach ? Goal: new approach to enable global registration of large collections of point sets. We consider an optimization-on-a-manifold for global registration of multiple scans. We evidence computational and convergence issues in the original approach. We propose computationally effective correspondence update and other improvements. Results: better accuracy compared to state-of-the-art, good computational performance.

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

3d scanning
correspondence selection
newton-type optimization
differential geometry


A note on Toyota's goal of sequencing mixed models on an assembly line Toyota's goal of sequencing mixed models on an assembly line is to keep the constant usage of every part used in the assembly line. This goal is a good way of fitting the just-in-rime concept in Toyota's production system. In all of Toyota's goal oriented studies a consideration which has not been explained explicitly in the literature is that all the parts of a given product are assumed to be used at the epoch of just this unit into the assembly line. This treatment is equivalent to an assumption of a single workstation assembly line with zero length. For an assembly line with multiple workstations, however, it is clear that the parts of a given product are used at different epochs subsequent to originally feeding this unit into it. This note discusses Toyota's goal of sequencing mixed models on an assembly line with multiple workstations. The sequencing problem is formulated based on defining the ideal usage rate of a part as the requirement for the part per time period. A modified goal chasing algorithm is proposed for solving this sequencing problem. An example is given to illustrate the methodology. (C) 1999 Elsevier Science Ltd. All rights reserved.

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


Faster replacement paths algorithms in case of edge or node failure for undirected, positive integer weighted graphs ? In this paper, we study the following replacement paths problem for undirected graphs in case of edge or node failures. In the edge failure problem, for each edge e on a shortest st s t path in G , we are required to find a shortest st s t path in G?e G ? e . In the node failure problem, for each node v on a shortest st s t path, we need to report a shortest st s t path in G?v G ? v . In the detour critical problem, for each edge (u,v) ( u , v ) on a shortest st s t path, we have to report a shortest ut u t path in G?(u,v) G ? ( u , v ) .

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


Exploring fault types, detection activities, and failure severity in an evolving safety-critical software system Many papers have been published on analysis and prediction of software faults and/or failures, but few established the links from software faults (i.e., the root causes) to (potential or observed) failures and addressed multiple attributes. This paper aims at filling this gap by studying types of faults that caused software failures, activities taking place when faults were detected or failures were reported, and the severity of failures. Furthermore, it explores the associations among these attributes and the trends within releases (i.e., pre-release and post-release) and across releases. The results are based on the data extracted from a safety-critical NASA mission, which follows an evolutionary development process. In particular, we analyzed 21 large-scale software components, which together constitute over 8,000 files and millions of lines of code. The main insights include: (1)only a few fault types were responsible for the majority of failures pre-release and post-release, and across releases. Analysis and testing activities detected the majority of failures caused by each fault type. (2)The distributions of fault types differed for pre-release and post-release failures. (3)The percentage of safety-critical failures was small overall, and their relative contribution increased on-orbit. (4)Both post-release failures and safety-critical failures were more heavily associated with coding faults than with any other type of faults. (5)Components that experienced high number of failures in one release were not necessarily among high failure-prone components in the subsequent release. (6)Components that experienced more failures pre-release were more likely to fail post-release, overall and for each release.

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

fault type
failure severity
evolutionary development

software quality assurance
detection activity


Automatic correction of level set based subvoxel precise centerlines for virtual colonoscopy using the colon outer wall Virtual colonoscopy (VC) is becoming a more prevalent method to detect and diagnose colorectal cancer. An essential component of using VC to detect cancerous polyps, especially in conjunction with computer-aided diagnosis, is the accurate calculation of the centerline of the colon. While the colon is often modeled as a simple cylinder, the amount of colonic distention may vary between patients and within the same patient often causing loops and multiple disconnected segments to be present in the colon segmentation. These variations have caused previous centerline algorithms to fail to capture a complete and accurate centerline for all colons. We have developed an automatic method to determine from a computed tomography (CT) VC a subvoxel precise centerline that is accurate even in cases of over-distended or under-distended colons. In this algorithm, the loops in the colon caused by over-distention are detected and removed when the centerline calculation is performed. Also, a newly developed method for the detection and segmentation of the outer wall of the colon is used to connect collapsed portions of the colon where the lumen segmentation fails to produce a continuous centerline. These two methods allow for a complete and accurate centerline to be calculated in uniformly distended colons as well as in colons containing segments which are over-distended and/or under-distended. We have demonstrated successfully the effectiveness of our algorithm on 50 cases, 25 of which resulted in erroneous solutions by previous centerline algorithms due to variability in the colon distention.

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


2D spiral pattern recognition with possibilistic measures The main task for a 2D spiral recognition algorithm is to learn to discriminate between data distributed on two distinct strands in the xy plane. This problem is of critical importance since it incorporates temporal characteristics often found in real-time applications, i.e. the spiral coils with time. Previous work with this benchmark has witnessed poor results with statistical methods such as discriminant analysis and tedious procedures for better results with neural networks. This paper describes a fuzzy approach which outperforms previous work in terms of the recognition rate and the speed of recognition. The paper presents the new approach and results with the validation and test sets. The results show that it is possible to solve the spiral problem in a relatively small amount of time with the fuzzy approach (up to 100% correct classification on the validation and test set; 77.2% correct classification with cross-validation using the leave-one-out method).

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

possibilistic reasoning
spiral data
fuzzy membership


Sociomateriality and boundary objects in information systems development Information systems (IS) development is a complex organisational activity involving multiple stakeholders who interact with various artefacts in order to facilitate understanding and cooperation across diverse knowledge domains. A considerable body of work has analysed such artefacts as boundary objects, focusing on their interpretive flexibility across communities of practice. Increasing interest in the materiality of organisational practices directs attention to how such objects result from the performance of sociomaterial relations. This paper draws on these two strands of research to complement the analysis of project-related artefacts as boundary objects with a sociomaterial perspective on such objects and the practices within which they are constituted. The contribution of this combined approach is illustrated using the findings of a longitudinal case study of IS development. We trace the production and use of a prototype, the various people and practices with which it was associated, the multiple sociomaterial configurations that constituted it as a boundary object, and the social and material consequences of its use. The utilisation of sociomateriality as a theoretical lens enables us to further our understanding of how project-related artefacts act as boundary objects, and in doing so, constitute IS development as a sociomaterial practice. European journal of Information Systems (2012) 21, 570-586. doi:10.1057/ejis.2012.20; published online 10 April 2012

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

artefacts
boundary objects
is development
sociomateriality


Smooth twin support vector regression Twin support vector regression (TSVR) was proposed recently as a novel regressor that tries to find a pair of nonparallel planes, i.e., ?-insensitive up- and down-bounds, by solving two related SVM-type problems. However, it may incur suboptimal solution since its objective function is positive semi-definite and the lack of complexity control. In order to address this shortcoming, we develop a novel SVR algorithm termed as smooth twin SVR (STSVR). The idea is to reformulate TSVR as a strongly convex problem, which results in unique global optimal solution for each subproblem. To solve the proposed optimization problem, we first adopt a smoothing technique to convert the original constrained quadratic programming problems into unconstrained minimization problems, and then use the well-known NewtonArmijo algorithm to solve the smooth TSVR. The effectiveness of the proposed method is demonstrated via experiments on synthetic and real-world benchmark datasets.

O O B I I O B I I O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 regression
nonparallel planes


Existences of solutions to a certain class of functional optimization problems The paper studies the optimization problem of a certain class of nonlinear functionals. Based on different constrains and initial conditions, several models are considered. The existences of the optimal solutions to these models are obtained using the method of converting an optimization problem on the infinite dimensional space to one on a finite dimensional space.

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


A GIS-based database management application for agroforestry planning and tree selection Agroforestry (the deliberate growing of trees or shrubs in rural lands) is being promoted in the United States as an alternative resource management system that can bring landowners economic benefits and provide environmental services such as reduced soil erosion, improved water quality and wildlife habitat. Landowners, farmers and extension agents need to be better informed about different agroforestry opportunities and potential tree species. The Florida Agroforestry Decision Support System (FADSS) was designed to aid in the dissemination of such information. FADSS utilizes a geographical information system (GIS) enabling the user to select a location of interest which is linked to spatial data on climate and soils characteristics for the state of Florida. The application also incorporates a database of over 500 trees and 50 tree attributes, forming a relational database. The application structure consists primarily of building database queries using Standard Query Language (SQL). SQL queries are constructed during run-time based on spatial parameters of a selected location, the type of agroforestry system desired, and production and management criteria provided by the user. Experts were interviewed to help develop queries used to select trees and other agroforestry species. Being a prototype, the application is built with a modular and flexible framework in which spatial data of different scales and/or regions as well as plant data may be easily incorporated. Among the major limitations encountered during the development of FADSS with major implications on future agroforestry decision support systems was the current lack of tree information relevant to agroforestry and the lack of research involving the assessment of suitable trees and their characteristics. (C) 2000 Elsevier Science B.V. All rights reserved.

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

agroforestry
decision support system
geographical information system


Generalized analysis of MU-MISO time reversal-based systems over correlated multipath channels with estimation error In this letter, we analyze the performance of multi-user multiple-input single-output time reversal (MU MISO TR)-based systems in a generalized framework. The considered propagation is correlated in both the space and the frequency domains, and channel estimation errors (CEEs) at the transmitter side are also taken into account. We derive a novel average signal-to-interference-plus-noise (SINR) formula in closed-form for TR-based systems. This formula is based on the exact expressions of the expectations of the powers of the desired signal, the inter-symbol interference (ISI) and the inter-user interference (IUI) components. These expressions allow us to reveal, for the first time, properties of time reversal which remained unknown up to now. More precisely, CEE has no influence on the ISI in terms of average power, whereas it degrades the power of the desired message-bearing signal. Moreover, irrespective of the central tap, the other taps of the IUI are independent from the effects of both inter-user correlation and CEE. Our analytical results are validated in both ultra-wideband and conventional broadband channels. Finally, these results are numerically compared to previous works.

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

time reversal
broadband
sinr
correlation


Peripheral Circadian Oscillators The lives of plants, animals, and human beings are all regulated by circadian clocks. In mammals, 24-hour rhythms of physiology and behavior are directed by a master clock in the suprachiasmatic nucleus (SCN) of the brain hypothalamus, which in turn entrains slave oscillators of similar molecular composition in most cells of the body. These peripheral clocks are interesting not only because they control many aspects of circadian physiology, but also because they are model systems through which we understand how the SCN regulates complex behavior. To this end, peripheral oscillators have been exploited both biochemically to understand the proteins that make up biological clocks, and genetically to decipher the ways in which individual differences in human chronotype might arise.

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


Applying ethnography in the analysis and support of expertise in engineering design Whilst many contemporary studies of design have claimed to be using ethnographic methods, the techniques which have been employed often diverge from the characteristics of pure ethnography as used in traditional anthropological and sociological research. We argue that this is entirely appropriate for applied ethnography that is conducted in pursuit of explicit design goals. In this paper, we explore the relationship between pure and applied ethnography, and their use in cognitive and social research. We also discuss how the outcomes of applied ethnography can be applied to i) the design of a computer-based design support tool and ii) the development of controlled experimental studies that retain sufficient ecological validity to capture realistic design expertise. We additionally argue that objectivity in empirical studies of design can be obtained only by triangulating observations across methodologies that embrace both ethnographic and laboratory-based traditions.

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

design tools
design rationale
research methods


IP packet size entropy-based scheme for detection of DoS/DDoS attacks Denial of service (DoS) attacks have become one of the most serious threats to the Internet. Enabling detection of attacks in network traffic is an important and challenging task. However, most existing volume-based schemes can not detect short-term attacks that have a minor effect on traffic volume. On the other hand, feature-based schemes are not suitable for real-time detection because of their complicated calculations. In this paper, we develop an IP packet size entropy (IPSE)-based DoS/DDoS detection scheme in which the entropy is markedly changed when traffic is affected by an attack. Through our analysis, we find that the IPSE-based scheme is capable of detecting not only long-term attacks but also short-term attacks that are beyond the volume-based schemes' ability to detect. Moreover, we test our proposal using two typical Internet traffic data sets from DARPA and SINET, and the test results show that the IPSE-based detection scheme can provide detection of DoS/DDoS attacks not only in a local area network (DARPA) and but also in academic backbone network (SINET).

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

denial of service attack
network security
attack detection


A Godunov-type fractional semi-implicit method based on staggered grid for dam-break modeling A semi-implicit finite volume model based upon staggered grid is presented for solving shallow water equation. The model employs a time-splitting scheme that uses a predictor-corrector method for the advection term. The fluxes are calculated based on a Riemann solver in the prediction step and a downwind scheme in the correction step. A simple TVD scheme is employed for shock capturing purposes in which the Minmond limiter is used for flux functions. As a consequence of using staggered grid, an ADI method is adopted for solving the discretized equations for 2-D problems. Several 1-D and 2-D flows have been modeled with satisfactory results when compared with analytical and experimental test cases. The model is also capable of simulating supercritical as well as subcritical flow. Copyright (C) 2010 John Wiley & Sons, Ltd.

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

dam break
semi-implicit
godunov-type solution
time splitting method


Image-based field monitoring of Cercospora leaf spot in sugar beet by robust template matching and pattern recognition An image-based foliar disease monitoring on a single leaf scale is proposed. OCM based robust foliage tracking against various changes in open field. Novel feature of L?, a?, EntropyDensity for classifying CLS from soil background. Promising for automatic CLS progress observation in real field.

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

foliar disease monitoring
template matching
pattern recognition

image processing
machine learning
sugar beets


HMI education for HIMs1 This paper analyses the curricula of the four Australian university programs for health information managers (HIMs) in relation to their coverage of health and medical informatics (HMI). The overlap between HIMs and HMIs should be increased through exchange of information at conferences such as this as well as communication and co-operation between the Schools of HIM and those offering health informatics related training at other Australian universities.

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

health information managers
health and medical informatics
education


Contraction, robustness, and numerical path-following using secant maps Secant type methods are useful for finding zeros of analytic equations that include polynomial systems. This paper Droves new results concerning contraction and robustness theorems for secant maps. It is also shown that numerical path-following using secant maps has the same order of complexity that numerical path-following using Newton's map to approximate a zero. Such an algorithm was implemented and some numerical experiments are displayed. (C) 2000 Academic Press.

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

regula falsi
secant method
newton method
approximate zero
contraction map
alpha-theory
homotopy method