The performance evaluation of a grid using Windows PCs In recent years, the demand for computational resources has increased in many fields such as computer graphics. In these fields, grid computing can be used to utilise idle resources efficiently. A grid can be implemented using open source middleware such as the Globus Toolkit. However, current grids do not work well on Windows PCs because the middleware does not provide all of the grid functions for Windows. We have investigated how to construct a Windows grid at a reasonable cost. In this paper, we first show how to construct a Windows grid using the Globus Toolkit. We focus on multicore processors and describe how to use them efficiently in the grid. Next, we present the case of constructing a fully functional Linux grid on Windows PCs using a Virtual Machine (VM). Finally, we propose a remote deployment system for a virtual grid that can deploy a Linux grid on a Windows grid.

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


virtualized games for teaching about distributed systems Complex distributed systems are increasingly important in modern computer science, yet many undergraduate curricula do not give students the opportunity to develop the skill sets necessary to grapple with the complexity of such systems. We have developed and integrated into an undergraduate elective course on parallel and distributed computing a teaching tool that may help students develop these skill sets. The tool uses virtualization to ease the burden of resourcing and configuring complex systems for student study, and creates varied "firefighting" gaming scenarios in which students compete to keep the system up and running in the presence of multiple issues. Preliminary experience indicates that (1) students find the tool engaging and (2) it is a manageable way in which to give students a novel perspective on interaction with complex distributed systems.

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


A CHAOS-BASED SECURE CLUSTER PROTOCOL FOR WIRELESS SENSOR NETWORKS Security mechanisms for wireless sensor networks (WSN) face a great challenge due to the restriction of their small sizes and limited energy. Hence, many protocols for WSN are not designed with the consideration of security. Chaotic cryptosystems have the advantages of high security and little cost of time and space, so this paper proposes a secure cluster routing protocol based on chaotic encryption as well as a conventional symmetric encryption scheme. First, a principal-subordinate chaotic function called N-Logistic-tent is proposed. Data range is thus enlarged as compared to the basic Logistic map and the security is enhanced. In addition, the computation is easier, which does not take much resource. Then, a secure protocol is designed based on it. Most of communication data are encrypted by chaotic keys except the initialization by the base station. Analysis shows that the security of the protocol is improved with a low cost, and it has a balance between resource and security.

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


Triangulation of molecular surfaces Given a molecule, which consists of a set of atoms, a molecular surface is defined for a spherical probe approximating a solvent molecule. Molecular surface is used for both the visualization of the molecule and the computation of various molecular properties such as the area and volume of a protein, which are important for studying problems such as protein docking and folding. In this paper, we present an O(n) O ( n ) time algorithm, in the worst case, for triangulating molecular surface based on the combinatorial information provided by the ? ? -shape of the molecule with n n atoms. The proposed algorithm takes advantage of the concise representation of topology among atoms stored in the ? ? -shape. A molecular surface consists of two parts: a blending surface consisting of blending patches and a (solvent) contact surface consisting of (solvent) contact patches. For each blending patch, the algorithm uses compact masks for the construction of a triangular mesh in O(c?) O ( c ? ) time in the worst case, where c? c ? is the number of point evaluations on the blending patch. For each contact patch, the algorithm uses a template, for each atom type, for the triangulation of the boundary of the atom. Then, the triangular mesh is trimmed off by hyperplanes where each hyperplane corresponds to an arc of the boundary of the contact patch. The triangulation of a contact patch takes O(c?) O ( c ? ) time in the worst case, where c? c ? is the number of point evaluations on the boundary of an atom. Since there are at most O(n) O ( n ) patches, the worst case time complexity is O(n) O ( n ) . The proposed algorithm also handles internal voids and guarantees the watertightness of the produced triangular mesh of a molecular surface. In addition, the level-of-detail is easily achieved as a by-product of the proposed scheme. The proposed algorithm is fully implemented and statistics from experiments are also collected.

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

molecular surface
blending surface
solvent contact surface
triangulation
mesh
watertightness
protein

mask
? ? -shape ? ? ? ? ?
level-of-detail


Osculatory interpolation in the method of fundamental solution for nonlinear Poisson problems The Method of Fundamental Solution (also known as the F-Trefftz method or the singularity method) is an efficient numerical method for the solution of Laplace equation for both two- and three-dimensional problems. In recent years, the method has also been applied for the solution of Poisson equations by finding the particular solution to the nonhomogeneous terms. In general, approximate particular solutions are constructed using the interpolation of the nonhomogeneous terms by the radial basis functions. The method has been validated in recent papers. This paper presents an improvement of the solution procedure for such problems. The improvement is achieved by using radial basis functions called osculatory radial basis functions. Such functions make use of the normal gradient at boundary to obtain improved interpolation. The efficacy of the method is demonstrated for some prototypical nonlinear Poisson problems and for multiple Poisson equations. (C) 2001 Academic Press.

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

radial basis functions
osculatory interpolation

method of fundamental solutions
nonlinear poisson problem
particular solution method
mesh free methods
multiquadrics
hermite interpolation
diffusion-reaction equations
liouville equation


practical morphological antialiasing on the gpu The subject of antialiasing techniques has been actively explored for the past 40 years. The classical approach involves computing the average of multiple samples for each final sample. Graphics hardware vendors implement various refinements of these algorithms. Computing multiple samples (MSAA) can be very costly depending on the complexity of the shading, or in the case of raytracing. Moreover, image-space techniques like deferred shading are incompatible with hardware implementation of MSAA since the lighting stage is decorrelated from the geometry stage. A filter based approach called Morphological Antialiasing (MLAA) was recently introduced [2009]. This technique does not need multiple samples and can efficiently be implemented on CPU using vector instructions. However, this filter is not linear and requires deep branching and image-wise knowledge which can be very inefficient on graphics hardware. We introduce an efficient adaptation of the MLAA algorithm running flawlessly on medium range GPUs.

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


TACO-miner: An ant colony based algorithm for rule extraction from trained neural networks Extracting classification rules from data is an important task of data mining and gaining considerable more attention in recent years. In this paper, a new meta-heuristic algorithm which is called as TACO-miner is proposed for rule extraction from artificial neural networks (ANN). The proposed rule extraction algorithm actually works on the trained ANNs in order to discover the hidden knowledge which is available in the form of connection weights within ANN structure. The proposed algorithm is mainly based on a meta-heuristic which is known as touring ant colony optimization (TACO) and consists of two-step hierarchical structure. The proposed algorithm is experimentally evaluated on six binary and n-ary classification benchmark data sets. Results of the comparative study show that TACO-miner is able to discover accurate and concise classification rules.

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

data mining
artificial neural networks
ant colony optimization
classification rules


Facebook effects on social distress: Priming with online social networking thoughts can alter the perceived distress due to social exclusion Priming with social networking sites (SNS) may boost felt relatedness. Subliminal SNS primes can reduce the distress of social exclusion. Thinking about the unavailability of SNS may increase social exclusion distress. Heavy users are more susceptible to the priming effect of SNS on perceived distress.

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

online social networking
perceived distress
priming
social exclusion


Fractal curves to improve the reversible data embedding for VQ-indexes based on locally adaptive coding The VQ reversible data embedding technology allows an original VQ coding to be completely restored after the extraction of embedded data. In this paper, we propose a new reversible scheme based on locally adaptive coding for VQ-compressed images. The fractal Hilbert curve is applied to replace the traditional trace of processing the VQ index table. The VQ index table is pre-processed to create a fractal Hilbert curve. Following the curve to process the VQ index table can get better compression rates in the data embedding procedure. Besides, compared to Chang et al.s scheme, which compressed the inputted VQ index value only when the to-be-embedded bit b is 0, our method performs compressing operations in both cases that the to-be-embedded bits b are 0 and 1. The experimental results show that the proposed method has the best compression rate and the highest embedding capacity compared with other reversible VQ embedding methods.

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

reversible embedding
lossless embedding
vector quantization
fractal curve
image compression
index residual value coding


A self-calibration method for capacitance mismatch in SAR ADC with split-capacitor DAC A self-calibration method to calibrate the nonlinearity due to capacitance mismatch in successive approximation register (SAR) analog-to-digital converter (ADC) is presented. It focuses on calibrating the most significant bit (MSB) array in the split-capacitor main DAC (split-MDAC) by using a calibration DAC (CDAC) that contains multiple sub-CDACs. Every bit in MSB array has its corresponding sub-CDAC in CDAC, which enhances the calibration efficiency. To verify the calibration method, a 14 bit, 500kS/s SAR ADC is implemented, and it is manufactured in 0.35?m 2P4M CMOS process. The measured results show that the proposed calibration method can assist this SAR ADC to achieve better static and dynamic performance, and its ENOB is improved from 9 bit to 11.98 bit at Nyquist input frequency.

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

split-dac
self-calibration
calibration dac array


automatic consistency assessment for query results in dynamic environments Queries are convenient abstractions for the discovery of information and services, as they offer content-based information access. In distributed settings, query semantics are well-defined, e.g., they often satisfy ACID transactional properties. In a dynamic network setting, however, achieving transactional semantics becomes complex due to the openness and unpredictability. In this paper, we propose a query processing model for mobile ad hoc and sensor networks suitable for expressing a wide range of query semantics; the semantics differ in the degree of consistency with which results reflect the state of the environment during execution. We introduce several distinct notions of consistency and formalize them. A practical contribution of this paper is a protocol for query processing that automatically assesses and adaptively provides an achievable degree of consistency given the state of the operational environment throughout its execution. The protocol attaches an assessment of the achieved guarantee to returned query results, allowing precise reasoning about a query with a range of possible semantics.

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


Soft computing techniques in parameter identification and probabilistic seismic analysis of structures The objective of this paper is to investigate the efficiency of soft computing methods, in particular methodologies based on neural networks, when incorporated into the solution of computationally intensive engineering problems. Two types of applications have been considered, namely parameter (flaw) identification and probabilistic seismic analysis of structures. Artificial neural networks (ANNs) based metamodels are used in order to replace the time-consuming repeated structural analyses. The back-propagation algorithm is employed for training the ANN, using data derived from selected analyses. The trained ANN is then used to predict the values of the necessary data. The numerical tests demonstrate the computational advantages of the proposed methodologies.

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

artificial neural networks
probabilistic seismic analysis

simulation
inverse problems
structural identification


multimodal person independent recognition of workload related biosignal patterns This paper presents an online multimodal person independent workload classification system using blood volume pressure, respiration measures, electrodermal activity and electroencephalography. For each modality a classifier based on linear discriminant analysis is trained. The classification results obtained on short data frames are fused using weighted majority voting. The system was trained and evaluated on a large training corpus of 152 participants, exposed to controlled and uncontrolled scenarios for inducing workload, including a driving task conducted in a realistic driving simulator. Using person dependent feature space normalization, we achieve a classification accuracy of up to 94\% for discrimination of relaxed state vs. high workload.

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

pattern recognition
digital signal processing
mental workload


Imposing tree-based topologies onto self organizing maps The beauty of the Kohonen map is that it has the property of organizing the codebook vectors, which represent the data points, both with respect to the underlying distribution and topologically. This topology is traditionally linear, even though the underlying lattice could be a grid, and this has been used in a variety of applications [23], [35]and[40]. The most prominent efforts to render the topology to be structured involves the Evolving Tree (ET) due to Pakkanen et al. [36], and the Self-Organizing Tree Maps (SOTM) due to Guan et al. [18], among others. In this paper we propose a strategy, the Tree-Based Topology-Oriented SOM (TTOSOM) by which we can impose an arbitrary, user-defined, tree-like topology onto the codebooks. Such an imposition enforces a neighborhood phenomenon which is based on the user-defined tree, and consequently renders the so-called bubble of activity to be drastically different from the ones defined in the prior literature. The map learned as a consequence of training with the TTOSOM is able to infer both the distribution of the data and its structured topology interpreted via the perspective of the user-defined tree. The TTOSOM also reveals multi-resolution capabilities, which are helpful for representing the original data set with different numbers of points, and this can be obtained without the necessity of recomputing the whole tree. The ability to extract an skeleton, which is a stick-like representation of the image in a lower dimensional space, is discussed as well. These properties has been confirmed by our experimental results on a variety of data sets.

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

hierarchical som
kohonen maps
topology-based self-organization


Informal communication support media for encouraging knowledge-sharing and creation in a community In this paper, we propose a new approach to support information-sharing and activation of human networks in an organization. In this approach, someone who wants to know about something displays "what I want to know" on a large screen in a public space to let other people see it. This allows other people near the display to find out what he/she is interested in. If a person who knows about that sees the display by chance, they can talk about it on the spot in a face-to-face manner. Thus, smooth information-sharing can be achieved through spontaneous informal communications, and "know-who" knowledge is gradually accumulated. Based on experiments using a prototype system, we confirmed that this approach is effective for information-sharing and activating human networks.

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

knowledge-sharing
knowledge creation
human network
adventitious encounters
benefit principle


Reflexive democracy: creating actionable knowledge through regional development coalitions This article seeks to develop a new theory of reflexive democracy, based on practical cases of action research in regional development, with particular reference to regional development coalitions. Reflexive democracy is located in the context of the debate on Scandinavian worklife, emphasising knowledge, dialogue, and legitimacy.

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

action research
dialogue
reflexive democracy
regional development coalitions


Uncertainty management in multiobjective hydro-thermal self-scheduling under emission considerations A stochastic multiobjective framework is proposed for short-term Hydro-Thermal Self Scheduling (HTSS) for electricity markets. The generating units contingencies and price uncertainty are explicitly considered in the stochastic programming of HTSS. The roulette wheel mechanism and Lattice Monte-Carlo Simulation are employed for random multiperiod scenario generation. HTSS problem is formulated using linearized multiobjective programming while maximizing expected profits and minimizing expected emission of GENCOs. The modified augmented ?-constraint method is implemented to generate Pareto optimal solutions.

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

stochastic programming
price uncertainty

hydro-thermal self scheduling
generating unit contingency
multiobjective mathematical programming


Understanding the role of electronic trading and inter-organisational cooperation and coordination A conceptual matrix framework Purpose - This paper aims to examine the relationship between cooperation and inter-organisational coordination in the supply chain. There is much literature debate over the nature of electronic trading enabled cooperation and coordination in the supply chain. The paper examines the major concepts associated with inter-organisational cooperation in social network literature such as collaboration and partnership and how this is affected by changing forms of coordination (market and hierarchy) governance. Design/methodology/approach - Seminal literatures about how electronic market and hierarchy coordination mechanisms have changed over time are examined. While some evidence from interviewing companies is used in conjunction with literature to inform discuss the workings of a matrix framework, the discussion remains essentially conceptual. Findings - A conceptual cooperation and coordination matrix outlines four quadrant forms of cooperation relative to evolving electronic markets and hierarchy coordination contexts, namely; "collaboration", "partnership", "dominance" and "autonomous". The matrix depicts and describes subtle differences in these forms of cooperation. Collaboration involves a low degree of vertical integration and a high number of trading :partners transacting on short-term contracts. Partnering involves a higher degree of inter-firm linkage with fewer stable partners on a medium to long-term basis. Dominance is characterised as a traditional form of hierarchical inter-firm linkage with a high degree of vertical integration. The autonomous organisation specialises in the production and delivery of major super brands which in the case of information based products can be sold directly to the customer. Originality/value - The contribution is a discussion analysis and new matrix framework depicting forms of cooperation relative to market and hierarchy coordination contexts in the supply chain. This is useful for understanding theoretical interplay between different forms of inter-firm cooperation and complex supply chain inter-dependencies that utilise information technology.

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

electronic commerce
hierarchical control
supply chain management


Constructing Labeling Schemes through Universal Matrices Let f be a function on pairs of vertices. An f-labeling scheme for a family of graphs F labels the vertices of all graphs in F such that for every graph G. F and every two vertices u, v is an element of G, f (u, v) can be inferred by merely inspecting the labels of u and v. The size of a labeling scheme is the maximum number of bits used in a label of any vertex in any graph in F. This paper illustrates that the notion of universal matrices can be used to efficiently construct f-labeling schemes. Let F(n) be a family of connected graphs of size at most n and let C(F, n) denote the collection of graphs of size at most n, such that each graph in C(F, n) is composed of a disjoint union of some graphs in F(n). We first investigate methods for translating f-labeling schemes for F(n) to f-labeling schemes for C(F, n). In particular, we show that in many cases, given an f-labeling scheme of size g(n) for a graph family F(n), one can construct an f-labeling scheme of size g(n)+ log log n+ O(1) for C(F, n). We also show that in several cases, the above mentioned extra additive term of log log n+ O(1) is necessary. In addition, we show that the family of n-node graphs which are unions of disjoint circles enjoys an adjacency labeling scheme of size log n + O(1). This illustrates a non-trivial example showing that the above mentioned extra additive term is sometimes not necessary. We then turn to investigate distance labeling schemes on the class of circles of at most n vertices and show an upper bound of 1.5 logn + O(1) and a lower bound of 4/3 logn - O(1) for the size of any such labeling scheme.

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

labeling schemes
distance
adjacency
universal matrices


Threshold Group Testing on Inhibitor Model In classical group testing, one is given a population N and an unknown subset D subset of N of positive items, and the goal is to determine D by testing subsets of N. Threshold group testing is a generalization of classical group testing, where the outcome of a group test is determined by the number of positive items in the test. In group testing on inhibitor model, inhibitors are the third type of item that dictate the test outcome to be negative regardless of how many positives are in the test. The threshold group testing on k-inhibitor model is a natural combination of threshold group testing and inhibitor model. In this article, we provide nonadaptive algorithms to conquer the threshold group testing on k-inhibitor model where error-tolerance is considered. Furthermore, we provide a two-stage algorithm to identify all inhibitors and find a g-approximate set.

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

nonadaptive algorithm
pooling design
threshold group testing


Analysis of musculoskeletal systems in the AnyBody Modeling System This paper reviews the simulation software the AnyBody Modeling System, which was originally developed by the authors. AnyBody is capable of analyzing the musculoskeletal system of humans or other creatures as rigid-body systems. The paper introduces the main features of the system; in particular, the inverse dynamic analysis that resolves the fundamental indeterminacy of the muscle configuration. In addition to the musculoskeletal system, a model can comprise external objects, loads, and motion specifications, thereby providing a complete set of the boundary conditions for a given task. The paper also describes the basic ideas of structured model development in AnyBody.

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

musculoskeletal models
muscles
multibody dynamics
inverse dynamics


Developing speech input for virtual reality applications A reality based interaction approach An input device should be natural and convenient for a user to transmit information to a computer, and should be designed from an understanding of the task to be performed and the interrelationship between the task and the device from the perspective of the user In order to investigate the potential of speech input as a reality based interaction device, this paper presents the findings of a study that investigated speech input in a VR application Two independent user trials were combined within the same experimental design to evaluate the commands that users employed when they used free speech in which they were not restricted to a specific vocabulary The study also investigated when participants were told they were either talking to a machine (e g a speech recognition system) or instructing another person to complete a VR based task Previous research has illustrated that when users are limited to a specific vocabulary, this can alter the interaction style employed The findings from this research illustrate that the interaction style users employ are very different when they are told they are talking to a machine or another person Using this knowledge, recommendations can be drawn for the development of speech Input vocabularies for future VR applications (C) 2010 Elsevier Ltd All rights reserved

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

virtual reality
speech input
reality based interaction


Arrow categories Goguen categories were introduced as a suitable categorical description of L-fuzzy relations, i.e., of relations taking values from an arbitrary complete Brouwerian lattice L instead of the unit interval [0, 1] of the real numbers. In this paper we want to study the algebraic structures derived from Goguen categories by replacing its second-order axiom by some weaker versions. (C) 2009 Elsevier B.V. All rights reserved.

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

goguen category
fuzzy relation
dedekind category


A mathematical model of vascular tumor treatment by chemotherapy From the viewpoint of biological stoichiometry, a mathematical model of vascular tumor treatment with chemotherapy techniques is proposed utilizing a system of delayed differential equations representing the change in mass of healthy cells, competing parenchyma cells, chemotherapy, and the number of blood vessels within the tumor. In the absence of treatment, mathematical analysis of the model equations with regard to invariance of nonnegativity, boundedness of solutions, nature of equilibria, permanence, and global stability are analyzed. It is shown that the system can be permanent, but whenever the boundary equilibrium is stable, the interior equilibrium of the system cannot be globally stable for at least small values of time delay. Further, in this case, persistence cannot occur at least for small values of the time delay. Necessary and sufficient conditions for Hopf bifurcation to occur are also obtained by using the time delay as a bifurcation parameter. Finally, based on all these qualitative behaviors of the model, a continuous treatment for tumor growth is considered. The analysis is carried out both analytically and numerically. (c) 2005 Elsevier Ltd. All rights reserved.

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

vascular tumor
stoichiometry
permanence
hopf bifurcation


EVOLVING SMALL-BOARD GO PLAYERS USING COEVOLUTIONARY TEMPORAL DIFFERENCE LEARNING WITH ARCHIVES We apply Coevolutionary Temporal Difference Learning (CTDL) to learn small-board Go strategies represented as weighted piece counters. CTDL is a randomized learning technique which interweaves two search processes that operate in the intra-game and inter-game mode. Intra-game learning is driven by gradient-descent Temporal Difference Learning (TDL), a reinforcement learning method that updates the board evaluation function according to differences observed between its values for consecutively visited game states. For the inter-game learning component, we provide a coevolutionary algorithm that maintains a sample of strategies and uses the outcomes of games played between them to iteratively modify the probability distribution, according to which new strategies are generated and added to the sample. We analyze CTDL's sensitivity to all important parameters, including the trace decay constant that controls the lookahead horizon of TDL, and the relative intensity of intra-game and inter-game learning. We also investigate how the presence of memory (an archive) affects the search performance, and find out that the archived approach is superior to other techniques considered here and produces strategies that outperform a handcrafted weighted piece counter strategy and simple liberty-based heuristics. This encouraging result can be potentially generalized not only to other strategy representations used for small-board Go, but also to various games and a broader class of problems, because CTDL is generic and does not rely on any problem-specific knowledge.

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

coevolution
small-board go
exploration vs. exploitation


Sequential and parallel algorithms for global minimizing functions with lipschitzian derivatives In this paper, sequential and parallel algorithms using derivatives for solving unconstrained one-dimensional global optimization problems are described. Sufficient conditions of convergence to all global minimizers are established for both methods. Parallel algorithm conditions, which guarantee significant speed up in comparison to the sequential version of the method, are presented. The sequential method is numerically compared with the algorithms of Breiman and Cutler, Pijavskii, and Strongin on a set of 20 test functions taken from literature. We also present results of numerical experiments illustrating the performance of the parallel method. All experiments have been executed on the parallel computer ALLIANT FX/80. (C) 1999 Elsevier Science Ltd. All rights reserved.

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

global optimization
parallel algorithms
convergence
speed up


Modular invariants for layered object structures Classical specification and verification techniques support invariants for individual objects whose fields are primitive values, but do not allow sound modular reasoning about invariants involving more complex object structures. Such non-trivial object structures are common, and occur in lists, hash tables, and whenever systems are built in layers. A sound and modular verification technique for layered object structures has to deal with the well-known problem of representation exposure and the problem that invariants of higher layers are potentially violated by methods in lower layers; such methods cannot be modularly shown to preserve these invariants. We generalize classical techniques to cover layered object structures using a refined semantics for invariants based on an ownership model for alias control. This semantics enables sound and modular reasoning. We further extend this ownership technique to even more expressive invariants that gain their modularity by imposing certain visibility requirements. (c) 2006 Elsevier B.V. All rights reserved.

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

modular verification
ownership
visibility

invariant
object-oriented programming
jml


A region-based fuzzy feature matching approach to content-based image retrieval This paper proposes a fuzzy logic approach, UFM(unified feature matching), for region-basedimage retrieval. In our retrieval system, an image is represented by a set of segmented regions, each of which is characterized by a fuzzy feature (fuzzy set) reflecting color, texture, and shape properties. As a result, an image is associated with a family of fuzzy features corresponding to regions. Fuzzy features naturally characterize the gradual transition between regions (blurry boundaries) within an image and incorporate the segmentation-related uncertainties into the retrieval algorithm. The resemblance of two images is then defined as the overall similarity between two families of fuzzy features and quantified by asimilarity measure, UFM measure, which integrates properties of all the regions in the images. Compared with similarity measures based on individual regions and on all regions with crisp-valued feature representations, the UFM measure greatly reduces the influence of inaccurate segmentation and provides a very intuitive quantification. The UFM has been implemented as a part of our experimental SIMPLIcity image retrieval system. The performance of the system is illustrated using examples from an image database of about 60,000 general-purpose images.

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

content-based image retrieval
image classification
similarity measure
fuzzified region features
fuzzy data analysis


Alternating decision tree algorithm for assessing protein interaction reliability This paper presents a machine learning approach for assessing the reliability of proteinprotein interactions in a high-throughput dataset. We use an alternating decision tree algorithm to distinguish true interacting protein pairs from noisy high-throughput data using various biological attributes of interacting proteins. The alternating decision tree algorithm is used both for identifying discriminating biological features that could be used for assessing protein interaction reliability and for constructing a classifier to identify true positive interacting pairs. Experimental results show that the proposed approach has a good performance in distinguishing true interacting protein pairs from noisy proteinprotein interaction data. Moreover, our alternating decision tree classifier supplemented with domain knowledge may be helpful to understand the biological conditions in connection with interacting protein pairs.

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

alternating decision tree algorithm
machine learning
proteinprotein interaction
reliability


A saturation method for the modal mu-calculus over pushdown systems We present an algorithm for computing directly the denotation of a modal mu-calculus formula chi over the configuration graph of a pushdown system. Our method gives the first extension of the saturation technique to the full modal mu-calculus. Finite word automata are used to represent sets of pushdown configurations. Starting from an initial automaton, we perform a series of automaton manipulations which compute the denotation by recursion over the structure of the formula. We introduce notions of under-approximation (soundness) and over-approximation (completeness) that apply to automaton transitions rather than runs. Our algorithm is relatively simple and direct, and avoids an immediate exponential blow up. Finally, we show experimentally that the direct algorithm is more efficient than via a reduction to parity games. (C) 2010 Elsevier Inc. All rights reserved.

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

modal mu-calculus
winning regions
global model checking
saturation methods


An evolutionary algorithm to optimize the microphone array configuration for speech acquisition in vehicles Speech enhancement with microphone arrays depends on the array configuration. A tailored evolutionary algorithm is proposed to optimize the array configuration. A car model is proposed, based on real measurements of background noise. Optimized arrays perform much better than common linear arrays.

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

microphone array
speech enhancement
speech acquisition


Combining diagnosis and treatment using ASBRU Traditionally, diagnosis and treatment have been seen as two distinct tasks. Consequently, most approaches to computer supported health care focus on one of the two-mostly on diagnosis or rather on the interpretation of measurements which is much better understood and formalised. However, in practice diagnosis and treatment overlap and influence each other in many ways. Combinations range from repeatedly going through the diagnosis-treatment loop over a period of time to permanent monitoring of the patients' health condition as it is done in intensive care units. In this article we describe how to model these combinations using the clinical protocol-representation language ASBRU. It implements treatment steps in a hierarchy of skeletal, time-oriented plans. Diagnosis can either be described in a declarative way in the conditions, under which treatment steps are taken or it can be modelled explicitly as plans of their own right. We demonstrate our approach using examples taken from the American Association of Paediatricians' guideline for the treatment of hyperbilirubinemia in the new-born. (C) 2002 Elsevier Science Ireland Ltd. All rights reserved.

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

guideline diagnosis hyperbilirubinemia asbru

protocol-based care
treatment management
asgaard


Ordering graphs with index in the interval ( 2 , 2 + 5 ) The index of a graph is the largest eigenvalue (or spectral radius) of its adjacency matrix. We consider the problem of ordering graphs by the index in the class of connected graphs with a fixed order n and index belonging to the interval ( 2 , 2 + 5 ) . For any fixed n (provided that n is not too small), we order a significant portion of graphs whose indices are close to the end points of the above interval.

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


Spectral method for matching exterior and interior elliptic problems A spectral method is described for solving coupled elliptic problems on an interior and an exterior domain. The method is formulated and tested on the two-dimensional interior Poisson and exterior Laplace problems, whose solutions and their normal derivatives are required to be continuous across the interface. A complete basis of homogeneous solutions for the interior and exterior regions, corresponding to all possible Dirichlet boundary values at the interface, are calculated in a preprocessing step. This basis is used to construct the influence matrix which serves to transform the coupled boundary conditions into conditions on the interior problem. Chebyshev approximations are used to represent both the interior solutions and the boundary values. A standard Chebyshev spectral method is used to calculate the interior solutions. The exterior harmonic solutions are calculated as the convolution of the free-space Greens function with a surface density; this surface density is itself the solution to an integral equation which has an analytic solution when the boundary values are given as a Chebyshev expansion. Properties of Chebyshev approximations insure that the basis of exterior harmonic functions represents the external near-boundary solutions uniformly. The method is tested by calculating the electrostatic potential resulting from charge distributions in a rectangle. The resulting influence matrix is well-conditioned and solutions converge exponentially as the resolution is increased. The generalization of this approach to three-dimensional problems is discussed, in particular the magnetohydrodynamic equations in a finite cylindrical domain surrounded by a vacuum.

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

influence matrix
spectral method
harmonic functions

chebyshev polynomials
boundary integral method
magnetohydrodynamics
greens functions
laplaces equation
exterior problem


The making of global standards in the GIS of the 21st century The global information society has undergone dramatic development in the 90s. The rapid growth in mobile telecommunications and internet business is living proof of a radical change in today's information society and infrastructure. The next emerging phases in this development chain are the continued increase in total mobility with wideband data services. For fixed networks, capacity increase is essential; the new broadband ATM network will be needed to meet bandwidth-hungry end-user applications. In this rapidly changing development phase, traditional standardization organizations and bodies are facing new challenges and increasing demands from both society and industry. Initiatives for new systems and solutions are today specified and agreed upon in market driven cooperation bodies such as the IETF (Internet Engineering Task Force), ATM Forum, DVB, etc. The role of standardization organisations has developed primarily into the provision of documentation, maintenance and version updates. A large number of ad hoc forums present a risk however. It may be problematic for these different bodies to understand the whole picture of interfaces to other existing standards. Another equally important issue for them is the overall understanding of end-user needs. Business opportunities and market development on the other hand, are demanding fast and practical solutions with equal access to all market players. The main challenge in the future development of next generation mobile standard lies in the question: are we able to create and agree upon a global standard? The Global System for Mobile Communication, GSM, is a good example of an excellent cooperation in standardization work. Many strengthsopen interfaces, true international roaming with a well-developed terminal markethave made GSM the most successful communications system in the world. This will enable a natural migration path towards next generation mobile technology. To fulfil the subscriber needs, GSM today offers the widest range and variety of services. Currently, (June 97) more than 44 million people use GSM phones with services offered by more than 230 operators in well over 100 countries in all continents, increasing by 2 million users each month at present. By the year 2000, there will be more than 200 million GSM subscribers. New business opportunities and markets will open when customer-driven applications in the networks are growing. Enhancement of new services such as electronic payment systems and personalized multimedia are crucial in building the next generation global information society.

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

the global system for mobile communication

third generation wireless telecommunications


Self-Stabilization in Dynamic Networks A self-stabilizing protocol is a protocol that achieves its intended behavior regardless of the initial configuration (i.e., global state). Thus, a self-stabilizing protocol is adaptive to any number and any type of topology changes of networks: after the last topology change occurs, the protocol starts to converge to its intended behavior. This advantage makes self-stabilizing protocols extremely attractive for designing highly dependable distributed systems on dynamic networks. While conventional self-stabilizing protocols require that the networks remain static during convergence to the intended behaviors, some recent works undertook the challenge of realizing self-stabilization in dynamic networks with frequent topology changes. This paper introduces some of the challenges as a new direction of research in self-stabilization.

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


A manifold flattening approach for anchorless localization We present a new method for anchorless localization of mobile nodes in wireless networks using only measured distances between pairs of nodes. Our method relies on the completion of the Euclidean distance matrix, followed by multidimensional scaling in order to compute the relative locations of the nodes. The key element of novelty of our algorithm is the method of completing the Euclidean distance matrix, which consists of gradually inferring the unknown distances, such as to align all nodes on a k-hyperplane, where typically k is 2 or 3. Our method leads to perfect anchorless localization for noise-free range measurements, if the network is sufficiently connected. We introduce refinements to the algorithm to make it robust to noisy and outlier range measurements. We present results from several localization tests, using both simulated data and experimental results measured using a large indoor network deployment of our WASP platform. Our results show improvements in localization using our algorithm over previously published techniques.

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

anchorless localization
manifold flattening

euclidean distance matrix completion
network connectivity factor
mobile ad hoc network
sensor network


A cross entropy algorithm for the Knapsack problem with setups In this article we propose a new metaheuristic-based algorithm for the Integer Knapsack Problem with Setups. This problem is a generalization of the standard Integer Knapsack Problem, complicated by the presence of setup costs in the objective function as well as in the constraints. We propose a cross entropy based algorithm, where the metaheuristic scheme allows to relax the original problem to a series of well chosen standard Knapsack problems, solved through a dynamic programming algorithm. To increase the computational effectiveness of the proposed algorithm, we use a turnpike theorem, which sensibly reduces the number of iterations of the dynamic algorithm. Finally, to testify the robustness of the proposed scheme, we present extensive computational results. First, we illustrate the step-by-step behavior of the algorithm on a smaller, yet difficult, problem. Subsequently, to test the solution quality of the algorithm, we compare the results obtained on very large scale instances with the output of a branch and bound scheme. We conclude that the proposed algorithm is effective in terms of solution quality as well as computational time.

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

knapsack problem
dynamic programming
cross entropy

combinatorial optimization
metaheuristics
scheduling


Initialization by selection for wavelet network training We present an original initialization procedure for the parameters of feedforward wavelet networks, prior to training by gradient-based techniques. It takes advantage of wavelet frames stemming from the discrete wavelet transform, and uses a selection method to determine a set of best wavelets whose centers and dilation parameters are used as initial values for subsequent training. Results obtained for the modeling of two simulated processes are compared to those obtained with a heuristic initialization procedure, and the effectiveness of the proposed method is demonstrated.

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

initializing parameters
nonlinear static modeling


Primary trastuzumab resistance: new tricks for an old drug Trastuzumab is the first Food and Drug Administration (FDA)-approved therapeutic targeting a HER-family receptor tyrosine kinase (HER2/ErbB2/neu). Although trastuzumab is effective in the treatment of HER2-positive breast cancer, a substantial proportion of patients will not respond to trastuzumab-based regimens (primary resistance), and those who do respond will often lose clinical benefits (i.e., secondary resistance). Although multiple mechanisms underlying the development of secondary trastuzumab resistance have been identified, few studies have specifically examined the basis of primary trastuzumab resistance. Here, we review these studies, which together demonstrate that trastuzumab induces phenotypic changes in tumor cells, even when they are not growth inhibited by trastuzumab, including changes in gene expression. These changes have important clinical implications, including the sensitization of malignant cells to other therapeutic drugs. In light of these observations, we propose that the conventional definition of resistance as it pertains to trastuzumab and, perhaps, to other targeted therapeutics, may require revision. The results of these studies will be useful in informing the direction of future basic and clinical research focused on overcoming primary trastuzumab resistance.

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

breast cancer
targeted therapeutics
primary resistance


Cross-cultural and cognitive issues in the implementation of new technology: focus on group support systems and Bulgaria Over 40 per cent of technology implementation attempts in the United States (US) fail. These failures often are the result of human (rather than technological) problems. The consequences of implementers installing in one country equipment designed in another should be even more problematic and ubiquitous, as technology designers continue to move into international markets. A cognitive model of cross-cultural implementation is tested, using a US-designed group support system (GSS) and groups of Bulgarian and US university students. Bulgarians were expected to be less critical of the technology due to cultural responses to power and authority (i.e., less likely to challenge authority) and therefore less successful in adapting to the technology. However, results suggest that the Bulgarian students may in fact be more likely to challenge authority than their US counterparts. As hypothesized, Power Distance mediates some of the effects between culture and satisfaction with the GSS. (C) 1998 Elsevier Science B.V.

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

bulgaria
united states
group support systems
technology implementation
power distance


Privacy preserving sub-feature selection based on fuzzy probabilities The feature selection addresses the issue of developing accurate models for classification in data mining. The aggregated data collection from distributed environment for feature selection makes the problem of accessing the relevant inputs of individual data records. Preserving the privacy of individual data is often critical issue in distributed data mining. In this paper, it proposes the privacy preservation of individual data for both feature and sub-feature selection based on data mining techniques and fuzzy probabilities. For privacy purpose, each party maintains their privacy as the instruction of data miner with the help of fuzzy probabilities as alias values. The techniques have developed for own database of data miner in distributed network with fuzzy system and also evaluation of sub-feature value included for the processing of data mining task. The feature selection has been explained by existing data mining techniques i.e., gain ratio using fuzzy optimization. The estimation of gain ratio based on the relevant inputs for the feature selection has been evaluated within the expected upper and lower bound of fuzzy data set. It mainly focuses on sub-feature selection with privacy algorithm using fuzzy random variables among different parties in distributed environment. The sub-feature selection is uniquely identified for better class prediction. The algorithm provides the idea of selecting sub-feature using fuzzy probabilities with fuzzy frequency data from data miners database. The experimental result shows performance of our findings based on real world data set.

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

distributed data mining
fuzzy probabilities
privacy
feature selection


Case-based Planning of Treatment of Infants with Respiratory Failure We discuss medical treatment planning in the context of case-based planning, where plans (of treatment) are treated as complex decisions. A plan for a particular Case is Constructed from known plans for similar training examples. In order to evaluate and improve the prediction quality of complex decisions, we use a method for approximation of similarity measure between plans. The method makes it possible to transform the acquired domain knowledge about similarities of plans. expressed by medical experts in natural language, to a low level language understandable by the system. To accomplish this task, we developed a method for approximation of the ontology of concepts expressed by medical experts. We present two applications of the ontology approximation, namely, for approximation of similarity between patient histories and for approximation of compatibility of patient histories with planned therapies. Next. we use these concept approximations to define two measures on which are based two methods for (plan) therapy prediction. The article includes results of experiments with these methods performed on medical data obtained from Neonatal Intensive Care Unit, First Department of Pediatrics, Polish-American Institute of Pediatrics, Collegium Medicum. Jagiellonian University, Krakow. Poland. The experiments are pertained to the identification of infants' death risk caused by respiratory failure.

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

ontology of concepts
respiratory failure
ontology approximation

automated planning
rough sets
similarity relation approximation


Eolo: software for the automatic on-line treatment and analysis of GPS data for environmental monitoring ? Geodetic measurements based on GPS satellite technology allow monitoring of the state of deformation with great precision. Geodetic studies through GPS have proven to be of strategic importance in risk evaluation of various phenomena such as landslides, volcanoes, earthquakes or for the evaluation of the stability of large structures (dykes, bridges, etc.). For control and surveillance purposes, continuous monitoring with real-time acquisition and analysis of data is required. We have developed a software, called Eolo, which allows the management of data from a GPS network using automatic acquisition. The software is the fruit of 5 years experience of working with continuous GPS and has been designed with a modular object-based structure to be extremely flexible and adaptable to different needs. The software allows treatment of raw data, their storage in a database, calculation of the main strain parameters, and the visualisation of all the results. In this sense the software is a powerful tool in the field of environmental monitoring with GPS geodetic techniques. The software is in use for the continuous monitoring of active Sicilian volcanoes.

ground deformation
geodetic continuous monitoring
gps data automatic analysis


Study of factors affecting the hardness of ball bonds in copper wire bonding Copper wire bonding has gained popularity due to its economic advantage and superior electrical performance. However, copper is harder than gold, and replacing gold wire with copper wire introduces hardness related issues. This article reports investigations of the properties including microhardness of the copper balls bonded using ?25.4-?m copper wire and different combinations of electronic-flame-off (EFO) current and firing time settings with forming gas (5%H2 and 95%N2) as the inert cover gas. FABs with an identical diameter, obtained under different EFO firing conditions, were ball bonded with the same wire bonding parameters established using design of experiments. Microhardness tests were then performed on the cross-section of the bonded balls. The study revealed that ultrasonic generator current is the most significant factor to increase the bonded mashed ball diameter, ball shear and shear per unit area and to decrease the ball height. The microhardness of bonded copper balls is related to the EFO parameters, with FABs obtained by higher EFO current being softer. The lower hardness is attributed to the higher maximum temperature during the FAB melting state.

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


Improved digital watermark robustness against translation and/or cropping of an image area Watermarking methods that employ orthogonal transformations are very robust against non-geometrical modifications such as lossy compression, but attaining robustness against image translation or cropping is difficult. This report describes a watermarking method that increases robustness against geometrical modifications such as image translation and cropping by embedding watermark data in the frequency component of an image and detecting that data by considering the phase difference of the coefficients that results from translation of the image. Experimental results demonstrate the robustness of this method against both non-geometrical image changes and image translation and cropping.

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

image processing
orthogonal transform
spread spectrum
copyright protection


An energy and memory-efficient distributed self-reconfiguration for modular sensor/robot networks Self-reconfiguration for mobile microrobots currently needs a positioning system and a map of the target shape. Traditional positioning solutions, such as GPS or multilateration are not applicable in the micro-world, and maps sharing does not scale. In the literature, if we want a self-reconfiguration of microrobots to a target shape that consists of millions of positions, each microrobot should have a memory capacity of at least million positions. Therefore, this is not scalable. In this paper, nodes do not record any position. We present self-reconfiguration methods where nodes are unaware of their positions and where they do not have the final coordinates of each microrobot. In other words, nodes do not store the coordinates that build the target shape. Therefore, memory usage for each node is hugely reduced to \(O(1)\) and communications are limited to neighboring nodes. These algorithms aim to improve the logical topology of a set of microrobots by restructuring their physical topology. To that end, we consider here the case of restructuring a set of microrobots from a chain to a square and we study two algorithms: the first algorithm ensures the connectivity of the network at the end of the algorithm, where the second guarantees the connectivity of the network through the execution time. The paper presents both analytical and experimental assessments of the algorithms performances using the declarative language \(Meld\) and executed under the Dynamic Physical Rendering Simulator (DPRSim).

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

distributed algorithm
self-reconfiguration
energy-efficiency
mobility
mems microrobot


Enforcing secured ECG transmission for realtime telemonitoring: A joint encoding, compression, encryption mechanism Realtime telemonitoring of critical, acute and chronic patients has become increasingly popular with the emergence of portable acquisition devices and IP enabled mobile phones. During telemonitoring, enormous physiological signals are transmitted through the public communication network in realtime. However, these physiological signals can be intercepted with minimal effort, since existing telemonitoring practise ignores the privacy and security requirements. In this paper, to achieve end-to-end security, we first proposed an encoding method capable of securing Electrocardiogram (ECG) data transmission from an acquisition device to a mobile phone, and then from a mobile phone to a centralised medical server by concealing cardiovascular details as well as features in ECG data required to identify an individual. The encoding method not only conceals cardiovascular condition, but also reduces the enormous file size of the ECG with a compression ratio of up to 3.84, thus making it suitable in energy constrained small acquisition devices. As ECG data transfer faces even greater security vulnerabilities while traversing through the public Internet, we further designed and implemented 3 phase encoding-compression-encryption mechanism on mobile phones using the proposed encoding method and existing compression and encryption tools. This new mechanism elevates the security strength of the system even further. Apart from higher security, we also achieved higher compression ratio of up to 20.06, which will enable faster transmission and make the system suitable for realtime telemonitoring. Copyright (C) 2008 John Wiley & Sons, Ltd.

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

ecg encryption
joint encryption - compression
mobile healthcare
ecg encoding
secured telemonitoring


Multiscale theory for linear dynamic processes - Part 2. Multiscale model predictive control (MS-MPC) A multiscale framework, defined in a time-scale domain, offers significant advantages in designing and deploying model predictive control (MPC). The resulting multiscale MPC (MS-MPC) allows variable prediction and control horizons, which are adjusted in real-time in conjuction with the actual external disturbances that affect process behavior and the characteristics of model uncertainty generated in the Course of feedback control, and call overcome the theoretical and practical hurdles of fixed-horizon classical MPC. In addition, MS-MPC call incorporate, naturally, richer descriptions of external disturbances and model uncertainties over several distinct temporal scales (ranges of frequencies) and call accommodate, naturally and optimally, measurements at Multiple sampling intervals and control actions at multiple rates. MS-MPC is based oil the multiscale framework of analysis established in Part 1 of this series. It employs a wavelet-based transformation of states, inputs and Outputs from the time-domain to a time-scale domain, and multiscale process models oil homogeneous binary trees, which define the time-scale domain. Finally, MS-MPC is better suited to handle input and Output constraints over varying lengths of time. A series of numerical examples will illustrate the MS-MPC approach and its advantages in designing and deploying feedback process control systems. (C) 2007 Published by Elsevier Ltd.

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

multiscale linear dynamic systems
multiscale control
multiscale estimation


Expansion of 3D face sample set based on genetic algorithm 3D face database is an important data platform for model training and algorithm design. As these works are mainly based on statistical learning, the coverage of training set has a great impact on algorithm performance. However it is a tedious process to obtain a 3D face sample. So the capacities of current 3D face databases are relatively insufficient. To solve this problem, we present a framework to augment existing 3D databases based on Genetic Algorithm. First the prototypical face samples are divided into patches. Then the new face samples are generated by assembling randomly selected patches. Under the guidance of the genetic algorithm, we can perform a number of the generating works at a time. The experiment results show that the proposed method has good performance on face data expansion.

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

sample expansion
surface deformation
texture stitching


Random forest based lung nodule classification aided by clustering An automated lung nodule detection system can help spot lung abnormalities in CT lung images. Lung nodule detection can be achieved using template-based, segmentation-based, and classification-based methods. The existing systems that include a classification component in their structures have demonstrated better performances than their counterparts. Ensemble learners combine decisions of multiple classifiers to form an integrated output. To improve the performance of automated lung nodule detection, an ensemble classification aided by clustering (CAC) method is proposed. The method takes advantage of the random forest algorithm and offers a structure for a hybrid random forest based lung nodule classification aided by clustering. Several experiments are carried out involving the proposed method as well as two other existing methods. The parameters of the classifiers are varied to identify the best performing classifiers. The experiments are conducted using lung scans of 32 patients including 5721 images within which nodule locations are marked by expert radiologists. Overall, the best sensitivity of 98.33% and specificity of 97.11% have been recorded for proposed system. Also, a high receiver operating characteristic (ROC) Az of 0.9786 has been achieved.

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

lung images
ensemble classification
classification aided by clustering


Exact solution of the robust knapsack problem We consider an uncertain variant of the knapsack problem in which the weight of the items is not exactly known in advance, but belongs to a given interval, and an upper bound is imposed on the number of items whose weight differs from the expected one. For this problem, we provide a dynamic programming algorithm and present techniques aimed at reducing its space and time complexities. Finally, we computationally compare the performances of the proposed algorithm with those of different exact algorithms presented so far in the literature for robust optimization problems.

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

knapsack problem
robust optimization
dynamic programming


Modelling and analyzing adaptive self-assembly strategies with Maude ? Building adaptive systems with predictable emergent behavior is a difficult task and it is becoming a critical need. The research community has accepted the challenge by introducing approaches of various nature: from software architectures to programming paradigms and analysis techniques. Our white-box conceptual approach to adaptive systems based on the notion of control data promotes a clear distinction between the application and the adaptation logic. In this paper we propose a concrete instance of our approach based on (i) a neat identification of control data; (ii) a hierarchical architecture that provides the basic structure to separate the adaptation and application logics; (iii) computational reflection as the main mechanism to realize the adaptation logic; (iv) probabilistic rule-based specifications and quantitative verification techniques to specify and analyze the adaptation logic. We show that our solution can be naturally realized in Maude, a Rewriting Logic based framework, and illustrate our approach by specifying, validating and analyzing a prominent example of adaptive systems: robot swarms equipped with self-assembly strategies.

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

reflective russian dolls
statistical model checking
pvesta


20nm Line/space patterns in HSQ fabricated by EUV interference lithography An evaluation of hydrogen silsesquioxane (HSQ) for EUV lithography is presented. The effects of bake temperature and developer concentration on the ultimate resolution, sensitivity and contrast are investigated. It is demonstrated that HSQ as a negative-tone photoresist provides patterns with half-pitches as small as 20nm with EUV interference lithography. SEM micrographs show that the low line-edge roughness of the patterns is accompanied with the high-quality cross-sectional profiles. This high resolution and pattern quality are achieved through development in high-concentration developers for long development times, which is in line with previous results obtained with e-beam lithography.

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

euv lithography
photoresist
contrast
sensitivity
high resolution


Location of slaughterhouses under economies of scale ? The facility location problem described in this paper comes from an industrial application in the slaughterhouse industry of Norway. Investigations show that the slaughterhouse industry experiences economies of scale in the production facilities. We examine a location-allocation problem focusing on the location of slaughterhouses, their size and the allocation of animals in the different farming districts to these slaughterhouses. The model is general and has applications within other industries that experience economies of scale. We present an approach based on linearization of the facility costs and Lagrangean relaxation. We also develop a greedy heuristic to find upper bounds. We use the method to solve a problem instance for the Norwegian Meat Co-operative and compare our results to previous results achieved using standard branch-and-bound in commercial software.

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

integer programming
non-linear programming
branch-and-bound


Settlement analysis of piles with rectangular cross sections in multi-layered soils A method of settlement analysis for axially loaded piles with rectangular cross section embedded in a multi-layered soil medium is presented. The differential equations governing the displacements of the pilesoil system are obtained using variational principles. Closed-form solutions for pile deflection and axial force along the pile shaft are then produced by using the method of initial parameters. The input parameters needed for the analysis are only the pile geometry and the elastic constants of the soil and pile.

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

pile
settlement analysis
rectangular cross section


Customer requirement management in product development: A review of research issues The importance of customer requirement management in product development has been well-recognized in both academia and industry alike. This article provides a comprehensive review of the state-of-the-art research in this field. Customer requirement management entails various issues related to requirement elicitation, analysis, and specification, as well as the requirement management process. With respect to a holistic view of customer requirement management, key challenges and future research directions are identified.

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

customer engineering
product definition
product design
customer relationship management


L1-norm based discriminative spatial pattern for single-trial EEG classification Spatial filtering provides an efficient method for single-trial EEG classification and has been widely used in EEG-based brain computer interfaces. However, scalp-recorded EEG signals are usually very noisy since they could be contaminated by various outliers, such as EOG or EMG artifacts. The outliers may seriously distort the performance of spatial filters. To solve this problem, we propose a new robust spatial filtering algorithm, namely DSP-L1, which is L1-norm based discriminative spatial pattern (DSP). Compared with the conventional DSP, DSP-L1 takes advantage of the robust L1-norm modeling that expects to perform better in suppressing the effect of outliers. Computationally, an iterative approach is introduced to find the spatial filters of DSP-L1. Experimental results on two EEG data sets of motor movements demonstrate the efficiency of the proposed method.

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


an extended cooperative transaction model for xml In many application areas, for example in design or media production processes, several authors have to work cooperatively on the same project. Thereby, a frequently used data format is XML. In this paper, we address the special requirements of cooperative working on shared XML graph structures, such as early visibility of updates, multi-directional information flow, and parallel working. Since most existing transaction models are hardly applicable, we present a novel transaction model based on multi-level transactions and dynamic actions that meets these requirements. Additional advantages of this model are appropriate concepts for transaction synchronization and resolution of conflicts.

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

cooperation
dynamic action
tree operations
acta


Partially-latinized designs An interchange optimization algorithm to construct partially-latinized designs is described. The objective function is a weighted linear combination of up to five functions, each of which corresponds to a blocking factor of the required design. Nested simulated annealing is used to address local optima problems. The average efficiency factors of the generated designs are assessed against theoretical upper bounds.

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

a-optimality
average efficiency factor
interchange algorithm
latinized designs
(m,s)-optimality
resolvable designs
row-column designs


Gaining understanding of multivariate and multidimensional data through visualization High dimensionality is a major challenge for data visualization. Parameter optimization problems require an understanding of the behaviour of the objective function in the n-dimensional space around the optimumthis is multidimensional visualization and is the traditional domain of scientific visualization. Large data tables require us to understand the relationship between attributes in the tablethis is multivariate visualization and is an important aspect of information visualization. Common to both types of high-dimensional visualization is a need to reduce the dimensionality for display. In this paper we present a uniform approach to the filtering of both multidimensional and multivariate data, to allow extraction of data subject to constraints on their position or value within an n-dimensional window, and on choice of dimensions for display. A simple example of understanding the trajectory of solutions from an optimization algorithm is giventhis involves a combination of multidimensional and multivariate data.

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


distributing streaming media content using cooperative networking In this paper, we discuss the problem of distributing streaming media content, both live and on-demand, to a large number of hosts in a scalable way. Our work is set in the context of the traditional client-server framework. Specifically, we consider the problem that arises when the server is overwhelmed by the volume of requests from its clients. As a solution, we propose Cooperative Networking (CoopNet) , where clients cooperate to distribute content, thereby alleviating the load on the server. We discuss the proposed solution in some detail, pointing out the interesting research issues that arise, and present a preliminary evaluation using traces gathered at a busy news site during the flash crowd that occurred on September 11, 2001.

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

news
framework
traces
research
streaming media
live
crowd
flash
context
paper
evaluation
server

network
point
contention
content distribution networks
scalability
multiple description coding
cooperation
client-server
peer-to-peer networks


Multilayer Neural Network with threshold neurons In this paper, a new architecture of Multilayer Neural Network (MNN) with on-chip learning for effective hardware implementation is proposed. To reduce the circuit size, threshold function is used as neuron's activating function and simplified back-propagation algorithm is employed to provide on-chip learning capability. The derivative of the activating function is modified to improve the rate of successful learning. The learning performance of the proposed architecture is tested by system-level simulations. Simulation results show that the modified derivative function improves the rare of successful learning and that the proposed MNN has a good generalization capability. Furthermore, the proposed architecture is implemented on field programmable gate array (FPGA). Logic-level simulation and preliminary experiment are conducted to test the on-chip learning mechanism.

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


M-matrix-based delay-range-dependent global asymptotical stability criterion for genetic regulatory networks with time-varying delays This paper is concerned with the problem of global asymptotical stability for a class of delayed genetic regularity networks (GRNs), where the time delays belong to given intervals and assumed to be time-varying. By choosing an appropriate and novel Lyapunov functional and utilizing M-matrix theory, we derive an M-matrix-based delay-range-dependent sufficient condition under which the class of considered GRNs has unique nonnegative equilibrium point which is globally asymptotically stable. The sufficient condition given here is to check whether a constructed constant matrix is a nonsingular M-matrix. This can be easily done, since there are more than 50 equivalent conditions of nonsingular M-matrix, and hence the stability criterion obtained in this paper is different from existing ones in the form of linear matrix inequality (LMI). Finally, several examples and their simulations are presented to show the effectiveness of the proposed approach.

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

delayed genetic regularity networks
global asymptotical stability
equilibrium point


An improved high-voltage IGBT-based half-bridge DC/DC converter for railway applications Purpose - The paper presents the findings of an R&D project connected to the development of 50 kW auxiliary power supply for the high-voltage DC-fed commuter trains. The aim was to introduce a new generation power converter utilizing high-voltage insulated gate bibolar transistor (IGBT) modules, which can outpace the predecessors in terms of efficiency and power density, i.e. to provide more power for smaller volumetric space. Design/methodology/approach - For development of the proposed converter, mathematical analysis and computer simulations were used. The software intended for simulations is Ansoft Simplorer, which is a mixed-technology simulator for electrical, electromechanical, power electronic systems and drive applications. For the verification of theoretical results the full-scale laboratory prototype of the proposed converter was developed and tested. Findings - Thanks to increased switching frequency and current-doubler rectifier (CDR) implemented in the proposed converter, the power dissipation of the isolation transformer was reduced by 30 percent as compared to earlier designs. Moreover, the 27 and 24 percent reductions in rectifier and inductor losses, respectively, led to approximately 1 percent efficiency rise of the proposed converter in comparison with its predecessors. Also, the proposed three-level topology outpaces the two-level one by more than 20 percent in terms of power density. Practical implications - The proposed converter topology is aimed for the high-voltage DC trains. With small modifications it also can be used in trams, trolleybuses as well as in some industrial applications. Originality/value - The paper presents the novel DC/DC converter topology with 3.3 kV IGBT-based three-level neutral point clamped inverter, high-frequency isolation transformer and the CDR.

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

electric converters
cost-effectiveness
process efficiency


A three-tier middleware architecture supporting bidirectional location tracking of numerous mobile nodes under legacy WSN environment In the mobile asset management services applicable to warehouse, hospital, etc. a low-cost and practical bidirectional location tracking of mobile asset is one of the most important technical issue must be solved. Due to the complexity and heavy traffic of the legacy location-awareness techniques, simultaneous locationing and tracking of numerous mobile nodes in real-time is not easy. To address this problem, we propose the three-tier middleware architecture called uMATI (ubiquitous Mobile Asset Tracking Infra). In the uMATI, all nodes (stationary and mobile) commonly use the IEEE 802.15.4 MAC protocol to guarantee the compatibility with the legacy wireless sensor network (WSN) despite of mobile-stationary nodes co-existence network. To solve the bidirectional tracking in spite of the free mobility of the numerous mobile nodes, we firstly suggest a simple bidirectional location protocol called BLIDx (bidirectional location ID exchange) and its implementation into both the mobile and stationary nodes. In addition, to prevent the traffic overflow due to the concentration of excessive mobile nodes into a single location, we propose adding a specially designed stationary node called virtual sink (VS) node and installing related middleware components into the node. Results from the experimental evaluation prove that the proposed architecture enhanced the practicability by effectively supporting the mobility and managing the traffic in the real-time mobile asset tracking applications.

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

real-time location system
bidirectional mobile asset tracking
mobile-stationary co-existence wsn
middleware of wireless sensor network