structure-aware sampling on data streams The massive data streams observed in network monitoring, data processing and scientific studies are typically too large to store. For many applications over such data, we must obtain compact summaries of the stream. These summaries should allow accurate answering of post hoc queries with estimates which approximate the true answers over the original stream. The data often has an underlying structure which makes certain subset queries, in particular range queries, more relevant than arbitrary subsets. Applications such as access control, change detection, and heavy hitters typically involve subsets that are ranges or unions thereof. Random sampling is a natural summarization tool, being easy to implement and flexible to use. Known sampling methods are good for arbitrary queries but fail to optimize for the common case of range queries. Meanwhile, specialized summarization algorithms have been proposed for rangesum queries and related problems. These can outperform sampling giving fixed space resources, but lack its flexibility and simplicity. Particularly, their accuracy degrades when queries span multiple ranges. We define new stream sampling algorithms with a smooth and tunable trade-off between accuracy on range-sum queries and arbitrary subset-sum queries. The technical key is to relax requirements on the variance over all subsets to enable better performance on the ranges of interest. This boosts the accuracy on range queries while retaining the prime benefits of sampling, in particular flexibility and accuracy, with tail bounds guarantees. Our experimental study indicates that structure-aware summaries can drastically improve range-sum accuracy with respect to state-of-the-art stream sampling algorithms and outperform deterministic methods on range-sum queries and hierarchical heavy hitter queries.

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

approximate query processing
varopt
structure-aware sampling


Metric learning for sequences in relational LVQ Metric learning constitutes a well-investigated field for vectorial data with successful applications, e.g. in computer vision, information retrieval, or bioinformatics. One particularly promising approach is offered by low-rank metric adaptation integrated into modern variants of learning vector quantization (LVQ). This technique is scalable with respect to both data dimensionality and the number of data points, and it can be accompanied by strong guarantees of learning theory. Recent extensions of LVQ to general (dis-)similarity data have paved the way towards LVQ classifiers for non-vectorial, possibly discrete, structured objects such as sequences, which are addressed by classical alignment in bioinformatics applications. In this context, the choice of metric parameters plays a crucial role for the result, just as it does in the vectorial setting. In this contribution, we propose a metric learning scheme which allows for an autonomous learning of parameters (such as the underlying scoring matrix in sequence alignments) according to a given discriminative task in relational LVQ. Besides facilitating the often crucial and problematic choice of the scoring parameters in applications, this extension offers an increased interpretability of the results by pointing out structural invariances for the given task.

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

metric learning
dissimilarity data
relational lvq


A new recombination lower bound and the minimum perfect phylogenetic forest problem Understanding recombination is a central problem in population genetics. In this paper, we address an established computational problem in this area: compute lower bounds on the minimum number of historical recombinations for generating a set of sequences (Hudson and Kaplan in Genetics 111, 147-164, 1985; Myers and Griffiths in Genetics 163, 375-394, 2003; Gusfield et al. in Discrete Appl. Math. 155, 806-830, 2007; Bafna and Bansal in IEEE/ACM Trans. Comput. Biol. Bioinf. 1, 78-90, 2004 and in J. Comput. Biol. 13, 501-521, 2006; Song et al. in Bioinformatics 421, i413-i244, 2005). In particular, we propose a new recombination lower bound: the forest bound. We show that the forest bound can be formulated as the minimum perfect phylogenetic forest problem, a natural extension to the classic binary perfect phylogeny problem, which may be of interests on its own. We then show that the forest bound is provably higher than the optimal haplotype bound (Myers and Griffiths in Genetics 163, 375-394, 2003), a very good lower bound in practice (Song et al. in Bioinformatics 421, i413-i422, 2005). We prove that, like several other lower bounds (Bafna and Bansal in J. Comput. Biol. 13, 501-521, 2006), computing the forest bound is NP-hard. Finally, we describe an integer linear programming (ILP) formulation that computes the forest bound precisely for certain range of data. Simulation results show that the forest bound may be useful in computing lower bounds for low quality data.

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

lower bound on the minimum number of recombination


A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem This paper deals with a general job shop scheduling problem with multiple constraints, coming from printing and boarding industry. The objective is the minimization of two criteria, the makespan and the maximum lateness, and we are interested in finding an approximation of the Pareto frontier. We propose a fast and elitist genetic algorithm based on NSGA-II for solving the problem. The initial population of this algorithm is either randomly generated or partially generated by using a tabu search algorithm, that minimizes a linear combination of the two criteria. Both the genetic and the tabu search algorithms are tested on benchmark instances from flexible job shop literature and computational results show the interest of both methods to obtain an efficient and effective resolution method.

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

scheduling
general job shop
tabu search
genetic algorithm
bicriteria


RBFFCA: A hybrid pattern classifier using radial basis function and fuzzy cellular automata A hybrid learning algorithm, termed as RBFFCA, for the solution of classification problems with real valued inputs is proposed. It comprises an integration of the principles of radial basis function (RBF) and fuzzy cellular automata (FCA). The FCA has been evolved through genetic algorithm (GA) formulation to perform pattern classification task. The versatility of the proposed hybrid scheme is illustrated through its application in diverse fields. Simulation results conducted on benchmark database show that the hybrid pattern classifier achieves excellent performance both in terms of classification accuracy and learning efficiency. Extensive experimental results supported with analytical formulation establish the effectiveness of RBFFCA based pattern classifier and prove it as an efficient and cost-effective alternative for the classification problem.

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

cellular automata
radial basis function
genetic algorithm
pattern classification


finding sparse cuts locally using evolving sets A local graph partitioning algorithm finds a set of vertices with small conductance (i.e.~a sparse cut) by adaptively exploring a large graph G, starting from a specified vertex. For the algorithm to be local, its complexity must be bounded in terms of the size of the set it outputs, with at most a weak dependence on n, the number of vertices in G. Previous local partitioning algorithms find sparse cuts using random walks and personalized PageRank. In this paper, we introduce a randomized local partitioning algorithm that finds a sparse cut by simulating the volume-biased evolving set process , which is a Markov chain on sets of vertices. We prove that for any set of vertices A that has conductance at most ?, and for at least half of the starting vertices in A, our algorithm will output (with probability at least half) a set of conductance O(? 1/2 log 1/2 n). The complexity of a local partitioning algorithm is measured by its work/volume ratio, which is the ratio between the computational complexity of the algorithm on a given run, and the volume of the set output. We prove that for our algorithm, the expected value of the work/volume ratio is polylognoparen(? -1/2 ). The best previous local partitioning algorithm, due to Andersen, Chung, and Lang, has the same approximation guarantee but a larger work/volume ratio of polylognoparen(? -1 ). As an application of our local partitioning algorithm, we construct a fast algorithm for finding balanced cuts. The resulting algorithm takes as input a graph and a fixed value of ?, has complexity polylog{m+n? -1/2 ), and returns a cut with conductance O(? 1/2 log 1/2 n) and volume at least v ? /2, where v ? is the volume of the largest set in the graph with conductance at most ?.

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


A minimal energy tracking method for non-radially symmetric solutions of coupled nonlinear Schrodinger equations We aim at developing methods to track minimal energy solutions of time-independent m-component coupled discrete nonlinear Schrodinger (DNLS) equations. We first propose a method to find energy minimizers of the 1-component DNLS equation and use it as the initial point of the m-component DNLS equations in a continuation scheme. We then show that the change of local optimality occurs only at the bifurcation points. The fact leads to a minimal energy tracking method that guides the choice of bifurcation branch corresponding to the minimal energy solution curve. By combining all these techniques with a parameter-switching scheme, we successfully compute a non-radially symmetric energy minimizer that can not be computed by existing numerical schemes straightforwardly. (C) 2009 Elsevier Inc. All rights reserved.

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

coupled nonlinear schrodinger equations
minimal energy

continuation method
ground states
non-radially symmetric solutions


A New Mathematical Formulation and a Heuristic for the Maximum Disjoint Set Covers Problem to Improve the Lifetime of the Wireless Sensor Network One of the critical issues in wireless sensor network is the lifetime of the network. Since each sensor is equipped with a limited amount of battery capacity, efficient management of the battery powers is important to prolong the lifetime of the network. One possible network management scheme is to partition the sensors into disjoint sets, so that sensors in each of the disjoint sets can completely cover the targets. Then these sets are activated successively. As a result, the larger the number of disjoint sets, the longer the lifetime of the network. In this paper, we propose a new BIP formulation and a new heuristic algorithm to find such disjoint sets. Compared with the previous researches, our formulation may be used to find an optimal solution much faster than the previous formulation and our heuristic is capable of finding good quality solutions quite fast.

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

wireless sensor network
maximum disjoint set covers
mathematical formulation
heuristic


rollback sometimes works...if filtered We introduce a new parallel discrete event simulation algorithm called filtered rollback. It is a combination of the Time Warp and bounded lag simulation algorithms introduced previously. The "filter" postpones event processing in some subsystems in favor of safer simulation. The filter may be tuned by the simulationist; at one extreme the algorithm is conservative, i.e., free from rollback, and at the other extreme the algorithm is purely optimistic, i.e., relying exclusively on rollback. We prove that rollback cascading, wherein a "chain reaction" of secondary and higher generation rollbacks appear in the simulation, can be bounded by an appropriate tuning. The tuning achieves a trade-off between the two extremes which yields an efficient and scalable algorithm. Our method of proof uses a representation of the rollback cascading as a tree and models such a tree as a Galton-Watson branching process on which an additional structure is defined, a random walk with a barrier.

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

barrier
discrete event simulation
warp
tree
generation
structure
method
simulation
parallel
process
tuning
representation
algorithm

efficiency
scalability
timing
event processes
model
filtering
combinational
random walks


integrated vlsi cad systems at digital equipment corporation This paper presents an overview of the experience at Digital Equipment Corporation's LSI plant with VLSI IC CAD systems. Digital's VLSI CAD group has been involved in the development and use of two generations of VLSI CAD systems, and the paper will discuss these experiences, emphasizing some of the trade-offs in the selection of the individual tools as well as the design of the kernel and data manager parts of the systems. The development of the first generation system and tools occurred in parallel with a major multi-chip IC design project 13 and in conjunction with the evolution of a major silicon (NMOS) process for Digital. While a great deal was salvaged from this severe learning experience (and note that all the IC's were nevertheless successfully completed), many aspects of the tools and system needed a complete overhaul for our next generation of IC's. We are now entering the phase of utilizing the results of this second generation custom MOS CAD system development. In parallel, we embarked on a separate and yet ultimately complementary development - that of a set of semi-custom CAD systems and associated tools. These too are now just being exploited to the full by Digital's VLSI IC design community. Our first generation ( N )MOS custom system, based around the CHAS kernel, was used to design over 12 large IC's (including 32-bit microprocessors). We are now developing a second generation kernel data manager to replace CHAS, as well as semi-custom systems supporting gate array, standard cell and polycell (macrocell) capabilities.

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

generation
use
evolution
design
project
experience
group
paper
system development
standard cell
capabilities
systems
parallel
custom
data
process
learning
tools

communities association developer arrays management select digitize aspect integrability completeness


Business data mining a machine learning perspective The objective of this paper is to inform the information systems (IS) manager and business analyst about the role of machine learning techniques in business data mining. Data mining is a fast growing application area in business. Machine learning techniques are used for data analysis and pattern discovery and thus can play a key role in the development of data mining applications. Understanding the strengths and weaknesses of these techniques in the context of business is useful in selecting an appropriate method for a specific application. The paper, therefore, provides an overview of machine learning techniques and discusses their strengths and weaknesses in the context of mining business data. A survey of data mining applications in business is provided to investigate the use of learning techniques. Rule induction (RI) was found to be most popular, followed by neural networks (NNs) and case-based reasoning (CBR). Most applications were found in financial areas, where prediction of the future was a dominant task category.

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


Quantitative structure-activity relationship (QSAR) studies of quinolone antibacterials against M-fortuitum and M-smegmatis using theoretical molecular descriptors The incidence of tuberculosis infections that are resistant to conventional drug therapy has risen steadily in the last decade. Several of the quinolone antibacterials have been examined as inhibitors of M. tuberculosis infection as well as other mycobacterial infections. However, not much has been done to examine specific structure-activity relationships of the quinolone antibacterials against mycobacteria. The present paper describes quantitative structure-activity relationship modeling for a series of antimycobacterial compounds. Most of the antimycobacterial compounds do not have sufficient physicochemical data, and thus predictive methods based on experimental data are of limited use in this situation. Hence, there is a need for the development of quantitative structure-activity relationship (QSAR) models utilizing theoretical molecular descriptors that can be calculated directly from molecular structures. Descriptors associated with chemical structures of N-1 and C-7 substituted quinolone derivatives as well as 8-substituted quinolone derivatives with good antimycobacterial activities against M. fortuitum and M. smegmatis have been evaluated. Ridge regression (RR), Principal component regression (PCR), and partial least squares (PLS) regression were used, comparatively, to develop predictive models for antibacterial activity, based on the activities of the above compounds. The independent variables include topostructural, topochemical and 3-D geometrical indices, which were used in a hierarchical fashion in the model-development process. The predictive ability of the models was assessed by the cross-validated R-2. Comparison of the relative effectiveness of the various classes of molecular descriptors in the regression models shows that the easily calculable topological indices explain most of the variance in the data.

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

quinolone derivatives
theoretical molecular descriptors
ridge regression
partial least squares


improving wcag for elderly web accessibility The increase of aging people and the possibilities that are extended to the Internet users have led studies into improvement of web accessibility solutions for older people [30]. Most older adults present some decline in their cognitive, visual, hearing and motor skills [13]. Nowadays, however, the Web faces new technological challenges that extend the initial idea of cross-platform and inter-operational nature of the HTML and HTTP. The challenges are posed as accessibility barriers and consider the skills, capabilities, culture, languages, disabilities, among other characteristics related to the user as a human being, in contrast to the hardware and software requirements previously addressed. The human characteristics of the challenge can be seeing as the ultimate barrier of the initial Web requirements of cross-platform and inter-operational environment, and goes towards social inclusion of people whatever differences they might present in the Web. In this paper we propose the establishment of a new set of success criteria that address older users accessibility into the normative document of WCAG 2.0. The proposed recommendations were identified from a composition of usability studies with real older users and were tested for different scenarios.

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


informing the design of the future urban landscape This workshop will identify emerging themes that will impact on the design of the urban environment, through exploration of the boundaries between the virtual and physical worlds. Participants in the workshop will collaborate in a practical exercise designed to act as a stimulus for thought concerning the nature of the products and services that will populate the urban landscape in the near future. The outcome of the workshop will be the identification and description of a series of issues that designers and technologists will have to address as they shape the interactions within the media-rich urban landscape. This will form the basis of new collaborative networks with the aim of taking this technological design research agenda further.

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


Citation-based analysis of literature: a case study of technology acceptance research Individual adoption of technology is crucial for the success of technology implementation and has thus attracted much attention from researchers. Recent advances in citation-based analysis have been suggested as being efficient for analyzing knowledge dissemination within scientific disciplines. This article presents a case that examines the technology acceptance research through the newly developed citation-based approach, in particular main path analysis and edge-betweenness clustering analysis. Based on the citation network constructed from a total of 1555 journal articles from the period 1989 to 2014, the most critical 50 citations were identified and used as the basis to map the major knowledge flow in technology acceptance research. In addition, edge-betweenness based clustering was used to classify the citation network into coherent groups. As a result, five distinct research fronts were identified, namely e-learning, mobile-commerce, e-health, e-tourism, and technology post-acceptance research. This case study highlights the theoretical development trajectories, and identifies the most active research fronts of technology acceptance research, providing a research-based platform for further scholarly discussions.

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

technology acceptance research
main path analysis
citation network
case study


Application of support vector regression for the prediction of concrete strength The compressive strength of concrete is a commonly used criterion in producing concrete. However, the test on the compressive strength is complicated and time-consuming. More importantly, since the test is usually performed 28 days after the placement of the concrete at the construction site, it is too late to make improvements if unsatisfactory test results are incurred. Therefore, an accurate and practical strength estimation method that can be used before the placement of concrete is highly desirable. In this study, the estimation of the concrete strength is performed using support vector regression (SVR) based on the mix proportion data from two ready-mixed concrete companies. The estimation performance of the SVR is then compared with that of neural network (NN). The SVR method has been found to be very efficient in estimation accuracy as well as computation time, and very practical in terms of training rather than the explicit regression analyses and the NN techniques.

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

strength prediction
support vector regression (svr)
concrete mix proportion data
kernel function


Generating efficient tiled code for distributed memory machines Tiling can improve the performance of nested loops on distributed memory machines by exploiting coarse-grain parallelism and reducing communication overhead and frequency. Tiling calls for a compilation approach that performs first computation distribution and then data distribution, both possibly on a skewed iteration space. This paper presents a suite of compiler techniques for generating efficient SPMD programs to execute rectangularly tiled iteration spaces on distributed memory machines. The following issues are addressed: computation and data distribution, message-passing code generation, memory management and optimisations, and global to local address translation. Methods are developed for partitioning arbitrary iteration spaces and skewed data spaces. Techniques for generating efficient message-passing code for both arbitrary and rectangular iteration spaces are presented. A storage scheme for managing both local and nonlocal references is developed, which leads to the SPMD code with high locality of references. Two memory optimisations are given to reduce the amount of memory usage for skewed iteration spaces and expanded arrays, respectively. The proposed compiler techniques are illustrated using a simple running example and finally analysed and evaluated based on experimental results on a Fujitsu AP1000 consisting of 128 processors.

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

nested loops
tiling
distributed memory
machines
spmd
memory optimisations


Adapting transformations to metamodel changes via external transformation composition Evolution is inherent to software systemsbecause of the rapid improvement of technologies and business logic. As a software development paradigm, model driven engineering (MDE) is also affected by this problem. More concretely, being metamodels the cornerstone of MDE, their evolution impacts the rest of software artefacts involved in a development process, i.e., models and transformations. The influence over models has been tackled and partially solved in previous works. This paper focuses on the impact over transformations. We propose an approach to adapt transformations by means of external transformation composition. That is, we chain impacted transformations to particular adaptation transformations which deal with either refactoring/destruction changes or construction changes. Our approach semi-automatically generates such transformations by using the AtlanMod matching language, a DSL to define model matching strategies. To provide with a proof of concept for our proposal, we adapt transformations written in terms of object-relational database metamodels when such metamodels evolve in time.

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

model-driven engineering
metamodel evolution
transformation adaptation


Evidence for circulatory benefits of resveratrol in humans Impairments of endothelial function, which can be assessed noninvasively by flow-mediated dilation (FMD) of the brachial artery, contribute to the development of cardiovascular disease. Associations between FMD and cognition suggest a vascular component in the loss of cognitive function. Certain vasoactive nutrients that have been shown to improve FMD may also have the potential to enhance cerebral perfusion and cognition. Preclinical studies show that trans-resveratrol can enhance nitric oxide bioavailability, thereby increasing endothelium-dependent vasodilation. We have now shown that acute administration of resveratrol elicits dose-dependent increases of FMD with greater potency than other vasoactive nutrients and that this benefit is sustained following regular consumption. We describe the potential implications of this vasodilator benefit of resveratrol and its role in enhancing cerebrovascular and cognitive functions.

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

flow-mediated dilation
human
vasodilator responsiveness
trans-resveratrol


A concurrent engineering approach to design for assembly DFA (Design for Assembly) is important in that it potentially can reduce the estimated 15-70% of manufacturing cost that is attributable to assembly. Besides the reduction in cost, DFA promises additional benefits in increased quality, increased reliability, and shorter manufacturing time. While there has been considerable interest in DFA, the research that has been reported in this area tends to suffer from a considerable handicap, namely that the work reported focuses primarily on DFA, without taking the other Concurrent Engineering (CE) aspects associated with the product fully into account. Therefore it is quite possible, for example, to use DFA approaches to redesign a product so that it is a good design from the perspective of assembly but where the redesign is difficult, time consuming or expensive to manufacture or test. Part of the difficulty in including perspectives, other than that of assembly, is the resulting complexity caused by the multitude of different considerations that have to be taken into account. This paper aims to address this problem by developing a methodology that models the different considerations as an abstracted network, called a CE-Nets. The CE-Nets, a variant of Petri Nets, only uses that information which is pertinent to DFA and therefore substantially reduces the problem of complexity. The basis of CE-Nets is described in the paper and an example is given. The CE-Nets approach offers three main potential advantages. First, it offers the potential of including other CE perspectives in a DFA system, without undue complexity. Second, it is a graphical approach that allows users to examine the interaction between different considerations. Third, it applies a mathematical mechanism to the problem, with the potential of being relatively straightforward to computerize.

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

concurrent engineering
design for assembly
petri nets
cost


property testing in hypergraphs and the removal lemma Property testers are efficient, randomized algorithms which recognize if an input graph (or other combinatorial structure) satisfies a given property or if it is "far" from exhibiting it.Generalizing several earlier results, Alon and Shapira showed thathereditary graph properties are testable (with one-sided error). In this paper we prove the analogous result for hypergraphs.This result is an immediate consequence of a (hyper)graph theoretic statement, which is an extension of the so-called removal lemma. The proof of this generalization relies on the regularity method for hypergraphs.

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

removal lemma
property testing
hypergraphs


A Prediction-based Energy-conserving Approximate Storage and Query Processing Schema in Object-Tracking Sensor Networks Energy efficiency is one of the most critical issues in the design of wireless sensor networks. In object-tracking sensor networks, the data storage and query processing should be energy-conserving by decreasing the message complexity. In this paper, a Prediction-based Energy-conserving Approximate StoragE schema (P-EASE) is proposed, which can reduce the query error of EASE by changing its approximate area and adopting predicting model without increasing the cost. In addition, focusing on reducing the unnecessary querying messages, P-EASE enables an optimal query algorithm to taking into consideration to query the proper storage node, i.e., the nearer storage node of the centric storage node and local storage node. The theoretical analysis illuminates the correctness and efficiency of the P-EASE. Simulation experiments are conducted under semi-random walk and random waypoint mobility. Compared to EASE, P-EASE performs better at the query error, message complexity, total energy consumption and hotspot energy consumption. Results have shown that P-EASE is more energy-conserving and has higher location precision than EASE.

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

data dissemination
location query
object-tracking sensor networks


Persistent Net-AMI for Microgrid Infrastructure Using Cognitive Radio on Cloud Data Centers We address the potential for a truly universal set of integrated wireless communication services, energy management, and control services for a next-generation of National Institute of Standards and Technology microgrid standards. Our approach uses cloud computing data center as the central communication and optimization infrastructure supporting a cognitive radio network of AMI meters which we label netbook advance metering infrastructure (Net-AMI). The Net-AMI is a novel low cost infrastructure of AMI meters that operate akin to netbooks with wireless transceiver that access to cloud data center energy services, cognitive radio services, and wireless communication services. Access occurs via cognitive radios channels. We claim that this solution solves the important problem in smart grid systems of how to develop an extensible, persistent, smart grid information network with a lifespan equivalent to that of most power systems (20-30 years). By persistence, we imply always operable, entirely software upgradeable, and independent of cellular networks. Our system is extensible and can easily handle thousands of variations in power systems, communication protocols, control, and energy optimization protocols. We formulate necessary link analysis and optimum scheduling of downlink and uplink Net-AMI packets in a multiuser cognitive radio environment.

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

cloud data center
cognitive radio
smart grid
wireless

netbook advance metering infrastructure (net-ami)


Decomposition of nitrous oxide on carbon nanotubes In this work, we have suggested the possibility of using carbon nanotubes to remove toxic gas. By taking an advantage of the density functional theory, we have investigated the decomposition of nitrous oxide (N2O) on the sidewalls of the perfect and the StoneWales defect armchair (5,5)-SWNTs at the B3LYP/6-31G(d) level of theory. There are two reaction mechanisms proposed: stepwise and concerted pathways. Our calculations predict that the former route is kinetically favored on both the perfect and defect SWNTs with barrier heights of the rate-determining steps of 37.23 and 34.38kcal/mol for the perfect and the defect systems, respectively. In the second pathway, the decomposition of nitrous oxide gas takes place in a single step with higher reaction barriers of 48.60 and 40.27kcal/mol on the sidewalls of the perfect and the defect SWNTs, respectively. Moreover, we also demonstrated that an encapsulation of electron rich species, such as chloride anion, inside the channel of the SWNT can boost up the reaction rate of the N2O decomposition on the SWNT. The chloride ion supplies excess electrons to the SWNT for transferring to the N2O molecule causing lower reaction barriers in the reaction pathways.

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

nitrous oxide
decomposition
carbon nanotubes
encapsulation


Two-phase porous media flows with dynamic capillary effects and hysteresis: Uniqueness of weak solutions In this paper, we obtain the uniqueness of weak solutions for a two phase flow model in a porous medium. A particularity of the model is that the dynamic effects and hysteresis are included in the capillary pressure. To prove the uniqueness, we define an auxiliary elliptic system.

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

dynamic capillary pressure
two-phase flow
weak solution


An improved genetic programming technique for the classification of Raman spectra The aim of this study is to evaluate the effectiveness of genetic programming relative to that of more commonly-used methods for the identification of components within mixtures of materials using Raman spectroscopy. A key contribution of the genetic programming technique proposed in this research is that it explicitly aims to optimise the certainty levels associated with discovered rules, so as to minimize the chance of misclassification of future samples.

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


Operational space synchronization of two robot manipulators through a virtual velocity estimate Two robot manipulators are synchronized in a leader-follower scheme where only joint position measurements of the leader are available. A virtual manipulator is designed to provide a velocity estimate of the unknown leader velocity to the control law of the follower. The closed-loop errors are shown to be uniformly globally practically asymptotically stable.

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


Local tomography based on grey model This paper studied region-of-interest (ROI) problem of computed tomography. It is necessary to use almost local projection data to reduce radiation exposure or time in medical imaging when only a small part of the patient's body needs to be viewed. Improving the quality of reconstructed ROI and reducing radiation exposure are our aims. However, the traditional local tomography algorithm has difficulty in reconstructing the ROI due to significant truncation artifacts. In this paper, a new grey model based method is reported for ROI image reconstruction from truncated projection data. By using grey model, the proposed method can extrapolate the truncated projection data, and reconstruct the ROI from a set of its projections. As a result, about 75% of full projection data are saved, as compared with other traditional approachs, in reconstructing a local region of 32 pixels in radius in an image of 256256 pixels. Experimental results show that the proposed method exhibits more saving in exposure as compared with other local tomography algorithms and results in better quality of the reconstructed image.

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

region of interest (roi)
filter matrices
wavelet


SLIMP:

Strong

laser

interaction

model

package

for

atoms

and

molecules

We

present

the

SLIMP

package,

which

provides

an

efficient

way

for

the

calculation

of

strong-field

ionization

rate

and

high-order

harmonic

spectra

based

on

the

single

active

electron

approximation.

The

initial

states

are

taken

as

single-particle

orbitals

directly

from

output

files

of

the

general

purpose

quantum

chemistry

programs

GAMESS,

Firefly

and

Gaussian.

For

ionization,

the

molecular

AmmosovDeloneKrainov

theory,

and

both

the

length

gauge

and

velocity

gauge

KeldyshFaisalReiss

theories

are

implemented,

while

the

Lewenstein

model

is

used

for

harmonic

spectra.

Furthermore,

it

is

also

efficient

for

the

evaluation

of

orbital

coordinates

wavefunction,

momentum

wavefunction,

orbital

dipole

moment

and

calculation

of

orbital

integrations.

This

package

can

be

applied

to

quite

large

basis

sets

and

complex

molecules

with

many

atoms,

and

is

implemented

to

allow

easy

extensions

for

additional

capabilities.

Program

title:

SLIMP

Catalogue

identifier:

Program

summary

Program

obtainable

from:

CPC

Program

Library,

Queens

University,

Belfast,

N.

Ireland

Licensing

provisions:

Standard

CPC

licence,

No.

of

lines

in

distributed

program,

including

test

data,

etc.:

No.

of

bytes

in

distributed

program,

including

test

data,

etc.:

Distribution

format:

tar.gz

Programming

language:

Fortran

Computer:

All

computers

with

a

Fortran

compiler

supporting

at

least

Fortran

Operating

system:

All

operating

systems

with

such

a

compiler.

The

makefile

depends

on

a

Unix-like

system

and

needs

modification

under

Windows.

RAM:

Memory

requirement

depends

on

the

size

of

the

molecules

and

the

number

of

basis

functions.

For

instance,

about

RAM

is

required

for

N

molecules

with

the

acc-pvqz

basis

set

basis

functions).

However,

the

SF

molecules

require

RAM

with

the

same

basis

set

basis

functions).

Classification:

Nature

of

problem:

In

modeling

of

atoms

and

molecules

subjected

to

intense

laser

pulses,

there

is

a

general

need

for

the

calculation

of

theoretical

models.

However,

the

application

of

these

models

requires

the

effective

evaluation

of

orbital

coordinates

wavefunction,

momentum

wavefunction,

orbital

dipole

moment

or

calculation

of

orbital

integrations.

This

package

provides

an

efficient

way

for

these

calculations

directly

from

the

output

files

of

the

widely

used

GAMESS,

Firefly

and

Gaussian

programs.

Solution

method:

The

molecular

orbital

is

constructed

from

a

linear

combination

of

atomic

orbitals,

which

is

further

expanded

with

Cartesian

gaussian

type

orbitals

(GTO).

The

orbital

momentum

wavefunction

and

dipole

moment

can

be

constructed

with

the

Fourier

transformed

GTOs.

Orbital

integrations

rely

on

the

elementary

integrations

of

GTOs.

These

results

are

used

directly

as

input

in

the

subsequent

models

calculations.

Restrictions:

Current

implementation

supports

the

S,

P

L,

D,

F

and

G

types,

of

GTOs.

Here

L

indicates

the

diffuse

basis.

However,

the

extension

to

higher

order

basis

is

straight-forward.

This

package

supports

the

versions

of

GAMESS

(US,

Firefly

and

Gaussian

(both

and

For

older

versions,

mild

modifications

on

the

reading

formats

may

be

necessary

in

the

modules.

Running

time:

The

running

time

depends

on

the

size

of

the

molecules,

the

number

of

basis

functions,

and

most

importantly,

on

the

problem

to

which

this

package

has

been

employed.

Typically

for

a

single-processor

PC-type

computer

it

can

vary

between

a

few

seconds

and

days.

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

strong-field ionization
hhg
orbital wavefunction
orbital integration


Simulation-based transfer function modeling for transient analysis of general queueing systems This paper is concerned with characterizing the transient behavior of general queueing systems, which is widely known to be notoriously difficult. The objective is to develop a statistical methodology, integrated with extensive offline simulation and preliminary queueing analysis, for the estimation of a small number of transfer function models (TFMs) that quantify the inputoutput dynamics of a general queueing system. The input here is the time-varying arrival rate of jobs to the system; the time-dependent output performances include the departure rate of jobs and the mean of the work in process (i.e., number of jobs in the system). The resulting TFMs are difference equations, like the discrete approximations of the ordinary differential equations provided by an analytical approach, while possessing the high fidelity of simulation. Our method is expected to overcome the shortcomings of the existing transient analysis approaches, i.e., the computational burden of simulation and the lack of fidelity of analytical queueing models.

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

metamodeling
discrete event simulation
design of experiments


A novel optimization algorithm inspired by the creative thinking process Creative thinking, which plays an essential role in the progress of human society, has an outstanding problem-solving ability. This paper presents a novel creativity-oriented optimization model (COOM) and algorithm (COOA) inspired by the creative thinking process. At first, COOM is constructed by simplifying the procedure of creative thinking while retaining its main characteristics. And then, COOA is presented for continuous optimization problems. It is a realization of COOM. As a new nature-inspired algorithm, COOA is different from other similar algorithms in terms of the basic principle, mathematical formalization and properties. Features of the COOM and the corresponding algorithm include a powerful processing ability for the complex problems, namely high-dimensional, highly nonlinear and random problems. The proposed approach also has the advantages in terms of the higher intelligence, effectiveness, parallelism and lower computation complexity. The properties of COOA, including convergence and parallelism, are discussed in detail. The numerous simulations on the CEC-2013 real-parameter optimization benchmark functions problems have shown the effectiveness and parallelism of the proposed approach.

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


The dynamics of delayed regulation model under period-2 perturbation The dynamics is investigated on the delayed regulation model under period-a perturbation described as x(t + 1) = {A + (-1)(t)e}x(t){1 - x(t - 1)},t = 1,2,3... The e-dependences of the bifurcation points are analyzed through usual stability analysis of fixed point and periodic solution, however one of them is derived through the stability analysis of the "virtual" period-2 solution.

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

period-2 perturbation
virtual period-2 solution


Distributed timeslot allocation with crossed slots in CDMA-TDD systems Code division multiple access system with time division duplex (CDMA-TDD) is a promising solution to cope with traffic asymmetry of downlink (DL) and uplink (UL) in multimedia services. When a rate of asymmetry is different in each cell, CDMA-TDD system may employ crossed slots, where a timeslot is used for different links in cells. However, it may suffer from base station (BS)-to-BS and mobile station (MS)-to-MS interference problem. Zone division scheme is an efficient way to tackle the crossed slot interference by dividing a cell into inner and outer zones and restricting communication in crossed slots only to inner zone. In this paper, we propose distributed crossed slot resource allocation with zone division in multi-cell CDMA-TDD system. Two conditions for crossed Slot resource allocation are defined and the bound on the size of inner zone is analyzed mathematically based oil the conditions. Relationship between the capacity of crossed slot and the size of inner zone is also analyzed. Then. numerical results of the mathematical analysis are presented: showing that the proposed crossed slot allocation is effective for traffic asymmetry problem. Copyright (C) 2009 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 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 B I 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 B I O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O

cdma-tdd
distributed resource allocation


A complete problem for statistical zero knowledge We present the first complete problem for SZK, the class of promise problems possessing statistical zero-knowledge proofs (against an honest verifier). The problem, called STATISTICAL DIFFERENCE, is to decide whether two efficiently samplable distributions are either statistically close or far apart. This gives a new characterization of SZK that makes no reference to interaction or zero knowledge. We propose the use of complete problems to unify and extend the study of statistical zero knowledge. To this end, we examine several consequences of our Completeness Theorem and its proof, such as: A way to make every (honest-verifier) statistical zero-knowledge proof very communication efficient, with the prover sending only one bit to the verifier (to achieve soundness error 1/2). Simpler proofs of many of the previously known results about statistical zero knowledge, such as the Fortnow and Aiello-Hastad upper bounds on the complexity of. SZK and Okamoto's result that SZK is closed under complement. Strong closure properties of SZK that amount to constructing statistical zero-knowledge proofs for complex assertions built out of simpler assertions already shown to be in SZK. New results about the various measures of "knowledge,complexity," including a collapse in the hierarchy corresponding to knowledge complexity in the "hirit" sense. Algorithms for manipulating the statistical difference between efficiently samplable distributions, including transformations that "polarize" and "reverse" the statistical relationship between a pair of distributions.

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

knowledge complexity
statistical difference
zero knowledge


Project dynamics and emergent complexity This paper presents a theoretical analysis of project dynamics and emergent complexity in new product development (NPD) projects subjected to the management concept of concurrent engineering. To provide a comprehensive study, the complexity frameworks, theories and measures that have been developed in organizational theory, systematic engineering design and basic scientific research are reviewed. For the evaluation of emergent complexity in NPD projects, an information-theory quantitytermed effective measure complexity (EMC)is selected from a variety of measures, because it can be derived from first principles and therefore has high construct validity. Furthermore, it can be calculated efficiently from dynamic generative models or purely from historical data, without intervening models. The EMC measures the mutual information between the infinite past and future histories of a stochastic process. According to this principle, it is particularly interesting to evaluate the time-dependent complexity in NPD and to uncover the relevant interactions. To obtain analytical results, a model-driven approach is taken and a vector autoregression (VAR) model of cooperative work is formulated. The formulated VAR model provided the foundation for the calculation of a closed-form solution of the EMC in the original state space. This solution can be used to analyze and optimize complexity based on the models independent parameters. Moreover, a transformation into the spectral basis is carried out to obtain more expressive solutions in matrix form. The matrix form allows identification of the surprisingly few essential parameters and calculation of two lower complexity bounds. The essential parameters include the eigenvalues of the work transformation matrix of the VAR model and the correlations between components of performance fluctuations.

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

emergent complexity
new product development
cooperative work
project dynamics
effective measure complexity


APPROXIMATION ALGORITHMS FOR THE EUCLIDEAN TRAVELING SALESMAN PROBLEM WITH DISCRETE AND CONTINUOUS NEIGHBORHOODS In the Euclidean traveling salesman problem with discrete neighborhoods, we are given a set of points P in the plane and a set of n connected regions (neighborhoods), each containing at least one point of P. We seek to find a tour of minimum length which visits at least one point in each region. We give (i) an O(alpha)-approximation algorithm for the case when the regions are disjoint and alpha-fat, with possibly varying size; (ii) an O(alpha(3))-approximation algorithm for intersecting alpha-fat regions with comparable diameters. These results also apply to the case with continuous neighborhoods, where the sought TSP tour can hit each region at any point. We also give (iii) a simple O(log n)- approximation algorithm for continuous non-fat neighborhoods. The most distinguishing features of these algorithms are their simplicity and low running-time complexities.

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

euclidean tsp
group steiner tree
connected neighborhoods
fat objects
packing lemmas


Groupware: a strategic analysis and implementation The term groupware is widely used but not clearly defined. Due to ongoing rapid developments, a consistent definition of the term has proved elusive. However, there is a good reason to view groupware as a technology that addresses the vast areas of collaboration, human-computer interaction, and human-human interaction through digital media to bring substantial improvement and transformation to organizations. This paper analyzes the definitions, implementation, and management of groupware. The focus is on the strategic considerations rather than technical solutions. Factors that contribute to the future development of groupware are also discussed.

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


context-parametric polykinded types Generic Haskell is a language extension of Haskell for polytypic programming. Constrained types are parametric algebraic types with at least one argument constrained by type-class membership. We explain Generic Haskell, discuss the relevance of constrained types, and show that they are not supported by Generic Haskell. We propose context-parametric polykinded types as a solution, thereby making polytypic functions generic on a larger class of types. Our proposal entails an extension to the Generic Haskell compiler, not the language, and is therefore transparent to the generic programmer.

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

polytypic programming
polykinded types
generic haskell
constrained types


Fibrinogen: Evolution of the Structure-Function Concept Coagulation of blood is such an evident phenomenon that its observation can be traced back to earliest historical times. The great philosophers and physicians of antiquity discussed and provided interesting explanations. However, it was not until the end of the seventeenth century that the structural component of the blood clot was described by Malpighi as a white fibrous substance. In the middle of the nineteenth century this was identified as a constituent of pathological thrombi and given the name fibrin. At about that time its precursor in blood, fibrinogen, was isolated in a highly purified form by Hammarsten who suggested that, preceding fibrin formation, activation of fibrinogen by thrombin occurred by limited proteolysis. The activation mechanism was eventually clarified in the 1950s. It was shown to proceed in two discrete steps, by removal of low molecular weight activation peptides. Ferry postulated, based on physicochemical observations, that the activated molecules aligned in a half-staggered fashion to form polymers. The rapid post-war development of biochemical technology permitted evaluation of the primary structure of fibrinogen. With that followed identification of molecular domains in the activated fibrinogen molecules that participate in polymer formation, crosslinking of polymeric structures, and domains for cellular attachment. Crystallization of fragments and, recently, of the entire molecule has confirmed and extended this knowledge. Lately, it has also been possible to obtain detailed information on the architecture of the fiber network in the fibrin gel. The gel structure is primarily determined by the initial rate of fibrinogen activation, but without infringement of this primary rule, several factors in blood may modulate the structure. Fibrinogen and fibrin play important roles in normal hemostasis, wound healing, and pathological processes, such as thrombosis and atherosclerosis.

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


An Efficient Implementation of the Rainflow Counting Algorithm for Life Consumption Estimation In many reliability design and model-based health management applications where load profiles are variable and unpredictable, it is desirable to have efficient cycle counting methods to identify equivalent full and half cycles within the irregular load profile. Conventional cycle-based lifetime models can then be applied directly to provide information about the life consumption of the products. The use of an off-line rainflow algorithm is a common solution for arbitrary loads, but it cannot be applied in real time in its original form. This paper presents an in-line coding algorithm which uses a stack-based implementation, and a recursive algorithm to pick out the equivalent full and half cycles of the irregular load profile. The method can be integrated easily within time-domain or serial data applications to generate equivalent full and half cycles as they occur. Thus it is of particular significance for life estimation in real-time applications where use of the traditional implementations of the counting algorithm is impractical. In comparison with the off-line traditional rainflow method, the on-line method doesn't require any knowledge of the time history of the load profile because it processes each minimum or maximum when it occurs. Therefore, it provides a more efficient cycle counting method using less memory storage, and making more efficient use of computational resources within the real-time environment.

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

cycle counting
life estimation
rainflow algorithm
real time


Finding dependent and independent components from related data sets: A generalized canonical correlation analysis based method In this paper, we consider an extension of independent component analysis (ICA) and blind source separation (BSS) techniques to several related data sets. The goal is to separate mutually dependent and independent components or source signals from these data sets. This problem is important in practice, because such data sets are common in real-world applications. We propose a new method which first uses a generalization of standard canonical correlation analysis (CCA) for detecting subspaces of independent and dependent components. For two data sets, this reduces to using standard CCA. Any ICA or BSS method can then be used for final separation of these components. The proposed method performs well for difficult synthetic data sets containing different types of source signals. It provides interesting and meaningful results for real-world robot grasping data and functional magnetic resonance imaging (fMRI) data. The method is straightforward to implement and computationally not too demanding. The proposed method clearly improves the separation results of several well-known ICA and BSS methods compared with the situation in which CCA or generalized CCA is not used. Not only are the signal-to-noise ratios of the separated sources often clearly higher, but our method also helps these ICA and BSS methods to separate sources that they alone cannot separate.

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

independent component analysis
blind source separation
canonical correlation analysis
functional magnetic resonance imaging


experiences using a hands-free interface Hands-free interfaces could be the best choice for Human-Computer Interaction (HCI) for people with physical disabilities that are not capable of using traditional input devices. Once a first prototype is developed in the laboratory taking into account design and usability requirements, real users is what finally categorize an interface as useful or not. Therefore, an evaluation of our interface with users with cerebral palsy and multiple sclerosis has been carried out during a project of 9 months long. This paper presents a vision-based user interface designed to achieve computer accessibility together with the validation and evaluation of its human computer interaction issues such as usability and accessibility.

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


Reaching condition for variable-structure output feedback controller using a search technique The aim of this paper is to establish the reaching condition for a variable-structure output feedback controller based on Genetic Algorithms (GA). The design of the variable-structure controller using output feedback provides a technique to compute matrix parameters and guarantees the reaching conditions for a general class of linear systems. A combination of both a modified control law and a simple search technique based on the GA approach is proposed to obtain a good dynamic response. The proposed method is computationally simple and tractable, and guarantees a sliding motion along the switching surface. The efficacy of the theoretical results is illustrated by considering a linearized model of an aircraft control problem.

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

reaching condition
output feedback controller
search technique


statically locating web application bugs caused by asynchronous calls Ajax becomes more and more important for web applications that care about client side user experience. It allows sending requests asynchronously, without blocking clients from continuing execution. Callback functions are only executed upon receiving the responses. While such mechanism makes browsing a smooth experience, it may cause severe problems in the presence of unexpected network latency, due to the non-determinism of asynchronism. In this paper, we demonstrate the possible problems caused by the asynchronism and propose a static program analysis to automatically detect such bugs in web applications. As client side Ajax code is often wrapped in server-side scripts, we also develop a technique that extracts client-side JavaScript code from server-side scripts. We evaluate our technique on a number of real-world web applications. Our results show that it can effectively identify real bugs. We also discuss possible ways to avoid such bugs.

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


Degraded Compound Multi-Receiver Wiretap Channels We study the degraded compound multi-receiver wiretap channel (DCMRWC). DCMRWC consists of two groups of users and a group of eavesdroppers, where, if we pick an arbitrary user from each group of users and an arbitrary eavesdropper, they satisfy a certain Markov chain. We study two different communication scenarios for this channel. In the first scenario, the transmitter wants to send a confidential message to users in the first (stronger) group and a different confidential message to users in the second (weaker) group, where both messages need to be kept confidential from the eavesdroppers. For this scenario, we assume that there is only one eavesdropper. We obtain the secrecy capacity region for the discrete memoryless channel model, the parallel channel model, and the Gaussian parallel channel model. For the Gaussian multiple-input multiple-output (MIMO) channel model, we obtain the secrecy capacity region when there is only one user in the second group. In the second scenario we study, the transmitter sends a confidential message to users in the first group which needs to be kept confidential from the second group of users and the eavesdroppers. Moreover, the transmitter sends a different confidential message to users in the second group which needs to be kept confidential only from the eavesdroppers. For this scenario, we do not put any restriction on the number of eavesdroppers. As in the first scenario, we obtain the secrecy capacity region for the discrete memoryless channel model, the parallel channel model, and the Gaussian parallel channel model. For the Gaussian MIMO channel model, we establish the secrecy capacity region when there is only one user in the second group.

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

gaussian multiple-input multiple-output (mimo) compound wiretap channels


Dynamical behaviors of Cohen-Grossberg neural networks with discontinuous activation functions In this paper, we discuss dynamics of Cohen-Grossberg neural networks with discontinuous activations functions. We provide a relax set of sufficient conditions based on the concept of Lyapunov diagonally stability (LDS) for Cohen-Grossberg networks to be absolutely stable. Moreover, under certain conditions we prove that the system is exponentially stable globally or convergent globally in finite time. Convergence rate for global exponential convergence and convergence time for global convergence in finite time are also provided. (c) 2004 Elsevier Ltd. All rights reserved.

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

cohen-grossberg neural networks
differential inclusions
set-valued map
filippov solution
lyapunov diagonally stable
global stability


Precise pupil contour detection based on minimizing the energy of pattern and edge We propose a new method to precisely detect pupil contours in face images. Pupil contour detection is necessary for various applications using face images. It is, however, difficult to detect pupils precisely because of their weak edges or lack of edges. The proposed method is based on minimizing the energy of pattern and edge. The basic idea of this method is that the energy, which consists of the pattern and the edge energy, has to be minimized. An efficient search method is also introduced to overcome the underlying problem of efficiency in energy minimization methods. "Guide patterns" are introduced for this purpose. Moreover, to detect pupils more precisely we use an ellipse model as pupil shape in this paper. Experimental results show the effectiveness of the proposed method.

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

pupil contour detection
edge
energy minimization


Design of an efficient framework for fast prototyping of customized human-computer interfaces and virtual environments for rehabilitation Rehabilitation is often required after stroke, surgery, or degenerative diseases. It has to be specific for each patient and can be easily calibrated if assisted by human-computer interfaces and virtual reality. Recognition and tracking of different human body landmarks represent the basic features for the design of the next generation of human-computer interfaces. The most advanced systems for capturing human gestures are focused on vision-based techniques which, on the one hand, may require compromises from realtime and spatial precision and, on the other hand, ensure natural interaction experience. The integration of vision-based interfaces with thematic virtual environments encourages the development of novel applications and services regarding rehabilitation activities. The algorithmic processes involved during gesture recognition activity, as well as the characteristics of the virtual environments, can be developed with different levels of accuracy. This paper describes the architectural aspects of a framework supporting real-time vision-based gesture recognition and virtual environments for fast prototyping of customized exercises for rehabilitation purposes. The goal is to provide the therapist with a tool for fast implementation and modification of specific rehabilitation exercises for specific patients, during functional recovery. Pilot examples of designed applications and preliminary system evaluation are reported and discussed. (C) 2013 Elsevier Ireland Ltd. All rights reserved.

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

rehabilitation gesture recognition
human-computer interfaces
time-of-flight camera
depth map


Minimizing total weighted flow time of a set of jobs with interval processing times We consider a single-machine scheduling problem with each job having an uncertain processing time which can take any real value within each corresponding closed interval before completing the job. The scheduling objective is to minimize the total weighted flow time of all n jobs, where there is a weight associated with each job. We establish the necessary and sufficient condition for the existence of a job permutation which remains optimal for any possible realizations of these n uncertain processing times. We also establish the necessary and sufficient condition for another extreme case that for each of then n! job permutations there exists a possible realization of the uncertain processing times that this permutation is uniquely optimal. Testing each of the conditions takes polynomial time in terms of the number n of jobs. We develop precedence-dominance relations among the n jobs in dealing with the general case of this uncertain scheduling problem. In case there exist no precedence-dominance relations among a subset of n jobs, a heuristic procedure to minimize the maximal absolute or relative regret is used for sequencing such a job subset. Computational experiments for randomly generated instances with n jobs (5 <= n <= 1000) show that the established precedence-dominance relations are quite useful in reducing the total weighted flow time. (C) 2009 Elsevier Ltd. All rights reserved.

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

single-machine scheduling
uncertainty
domination


Extended Kantorovich method for static analysis of moderately thick functionally graded sector plates In this paper, an iterative procedure based on the extended Kantorovich method (EKM) is presented to gain highly accurate solution for bending of moderately thick functionally graded (FG) fully clamped sector plates. Effective mechanical properties of the sector plates assumed to be defined by a power law distribution. The governing equations, using First Order Shear Deformation Theory (FSDT), include five second order partial differential equations in terms of displacements and rotations. Successive application of the EKM converts the governing partial differential equations (PDEs) to two sets of five ordinary differential equations (ODEs) in terms of r and theta. These ODE systems are then solved iteratively which shows very fast convergence. It is shown that how the same method and formulation can be used for solid sector and rectangular plates. It is also demonstrated that the method is very fast convergent as three to four iterations are enough to obtain final results with desired accuracy. Predictions for fully clamped FG sector plates are compared with finite element code ANSYS, which show close agreement. Comparison of the results for rectangular plates shows good agreement with existing literature. (C) 2010 IMACS. Published by Elsevier B.V. All rights reserved.

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

extended kantorovich method
fully clamped sector plates

bending analysis
functionally graded material


Incremental Unsupervised-Learning of Appearance Manifold with View-Dependent Covariance Matrix for Face Recognition from Video Sequences We propose an appearance manifold with view-dependent covariance matrix for face recognition from video sequences in two learning frameworks: the supervised-learning and the incremental unsupervised-learning. The advantages of this method are, first, the appearance manifold with view-dependent covariance matrix model is robust to pose changes and is also noise invariant, since the embedded covariance matrices are calculated based on their poses in order to learn the samples' distributions along the manifold. Moreover, the proposed incremental unsupervised-learning framework is more realistic for real-world face recognition applications. It is obvious that it is difficult to collect large amounts of face sequences under complete poses (from left sideview to fight sideview) for training. Here, an incremental unsupervised-learning framework allows us to train the system with the available initial sequences, and later update the system's knowledge incrementally every time an unlabelled sequence is input. In addition, we also integrate the appearance manifold with view-dependent covariance matrix model with a pose estimation system for improving the classification accuracy and easily detecting sequences with overlapped poses for merging process in the incremental unsupervised-learning framework. The experimental results showed that, in both frameworks, the proposed appearance manifold with view-dependent covariance matrix method could recognize faces from video sequences accurately.

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

view-dependent covariance matrix
incremental learning
video-based face recognition
eigenspace


Independence of certain quantities indicating subword occurrences When words are characterized in terms of numerical quantities, awkward considerations due to the noncommutativity of words are avoided. The numerical quantity investigated in this paper is \w\(u), the number of occurrences of a word u as a (scattered) subword of a word w. Parikh matrices recently introduced have these quantities as their entries. According to the main result in this paper, no entry in a Parikh matrix, no matter how high the dimension, can be computed in terms of the other entries. Consequences concerning various inference problems between numbers \w\(u) themselves, as well as of the word w from these numbers, are obtained. (C) 2006 Elsevier B.V. All rights reserved.

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

scattered subword
number of subwords
independence of subwords
ambiguity


wireless, collaborative virtual sensors for thermal comfort Monitoring building performance data for energy-efficiency is an increasing market in which especially wireless sensor networks benefit from their easy installation in existing buildings. Nonetheless, large scale installations are still hampered by sheer installation costs. This paper introduces a virtual sensor approach that utilizes available information in a collaborative network to compute new sensor data. An example is provided in which the approach estimates the thermal comfort with only low-cost temperature sensors in most rooms.

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

artificial neural networks
collaborative sensor networks


Production of isopropyl palmitate in a catalytic distillation column: Comparison between experimental and simulation studies Fatty acid esterification is increasingly realized as a reactive distillation (RD) process because of its formation being affected by the chemical equilibrium. The reactive distillation column performance for the production of isopropyl palmitate by esterification of the palmitic acid with isopropanot has been studied in the present research. The reaction was catalyzed in the presence of zinc acetate supported on functionalized silica gel catalyst. The process parameters such as total feed flow rate, reboiler temperature, palmitic acid feed composition, palmitic acid feed temperature, molar ratio of isopropanol feed to palmitic acid feed and reflux ratio were studied experimentally in the catalytic distillation column. Two types of models were used for the simulation of catalytic distillation column. These were (a) equilibrium stage model and (b) rate-based model. The predictions from the rate-based model matched with the experimental results qualitatively and quantitatively. The simulation study was also carried out to determine the effects of other important parameters and design factors such as the column pressure, distillate to feed ratio, feed location, catalyst weight, height of reactive zone and height of separation zones. A technically optimized RD process for the production of isopropyl palmitate has been proposed on the basis of the experimental and simulated data. (c) 2006 Elsevier Ltd. All rights reserved.

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

reactive distillation
fatty acid esterification
isopropyl palmitate
experimental
simulation


Discrete adjoint sensitivity analysis for fluid flow topology optimization based on the generalized lattice Boltzmann method A discrete adjoint sensitivity analysis for fluid flow topology optimization based on the lattice Boltzmann method (LBM) with multiple-relaxation-times (MRT) is developed. The lattice Boltzmann fluid solver is supplemented by a porosity model using a Darcy force. The continuous transition from fluid to solid facilitates a gradient based optimization process of the design topology of fluidic channels. The adjoint LBM equation, which is used to compute the gradient of the optimization objective with respect to the design variables, is derived in moment space and found to be as simple as the original LBM. The moment based spatial momentum derivatives used to express the discrete objective functional (cost function) have the advantage that the local stress tensor is a local quantity avoiding the numerical computation of gradients of the discrete velocity field. This is particularly useful if dissipation is a design criterion as demonstrated in this paper. The method is validated by a detailed comparison with results obtained by Borrvall et al. for Stokes flow. While their approach is only valid for Stokes flow (i.e. very low Reynolds numbers) our approach in its present form can in principle be applied for flows of different Reynolds numbers just like the NavierStokes equation based approaches. This point is demonstrated with a bending pipe example for various Reynolds numbers.

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

lattice boltzmann method
topology optimization


Evolutionarydevelopmental perspectives on immune system interactions among the pregnant woman, placenta, and fetus, and responses to sexually transmitted infectious agents A balance has evolved over deep time between the various immune systems of the triad that is linked together for a short period: the pregnant woman, the fetus, and the placenta. This balance is affected by, and helps to determine, the immune responses to maternal infectious agents that may be transmitted to the fetus/infant transplacentally, intrapartum, or via breast milk. This review identifies newer evolutionary concepts and processes related particularly to the human placenta, innate and adaptive immune systems involved in tolerance, and in responses to sexually transmitted infectious (STI) agents that may be pathogenic to the fetus/infant at different gestational periods and in the first year of life. An evolutionarydevelopmental (EVO-DEVO) perspective has been applied to the complexities within, and among, the different actors and their beneficial or deleterious outcomes. Such a phylogenetic and ontogenic approach has helped to stimulate several basic questions and suggested possible explanations and novel practical interventions.

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

pregnant woman
placenta
immune systems
sti agents


A framework of social media engagement: Case studies with food and consumer organisations in the UK and Ireland Social media engagement has potential to improve organisational responsiveness. We develop a framework based on case studies with UK and Irish organisations. The framework facilitates a more interactive and proactive view of responsiveness. Social interactions, content strategies and information sources are key elements.

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

social media
organisational responsiveness
consumer organisations

stakeholder engagement
food communication


Formal translation from fuzzy EER model to fuzzy XML model XML has been the de facto standard of data representation and exchange over the Web. In addition, fuzzy data are inherent in the real-world applications. Although fuzzy information has been extensively investigated in the context of relational database model, the classical relational database model and its fuzzy extension to date do not satisfy the need of modeling and processing complex objects with imprecision and uncertainty on the Web. Based on fuzzy sets, this paper concentrates on fuzzy information modeling in the EER (enhanced entity-relationship or extended entity-relationship) model and the fuzzy XML model. In particular, the formal approach to mapping the fuzzy EER model to the fuzzy DTD (document type definition) model is developed.

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


Solidfluid diffuse interface model in cases of extreme deformations Diffuse interface methods have been recently proposed and successfully used for accurate compressible multi-fluid computations Abgrall [1]; Kapila et al. [20]; Saurel et al. [30]. These methods deal with extended systems of hyperbolic equations involving a non-conservative volume fraction equation and relaxation terms. Following the same theoretical frame, we derive here an Eulerian diffuse interface model for elastic solid-compressible fluid interactions in situations involving extreme deformations. Elastic effects are included following the Eulerian conservative formulation proposed in Godunov [16], Miller and Colella [23], Godunov and Romenskii [17], Plohr and Plohr [27] and Gavrilyuk et al. [14]. We apply first the Hamilton principle of stationary action to derive the conservative part of the model. The relaxation terms are then added which are compatible with the entropy inequality. In the limit of vanishing volume fractions the Euler equations of compressible fluids and a conservative hyperelastic model are recovered. It is solved by a unique hyperbolic solver valid at each mesh point (pure fluid, pure solid and mixture cell). Capabilities of the model and methods are illustrated on various tests of impacts of solids moving in an ambient compressible fluid.

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

diffuse solidfluid interfaces
shocks
hyperelasticity
riemann problem
godunov type methods


Recurrence Relationships for the Mean Number of Faces and Vertices for Random Convex Hulls This paper studies the convex hull of n random points in R(d). A recently proved topological identity of the author is used in combination with identities of Efron and Buchta to find the expected number of vertices of the convex hull yielding a new recurrence formula for all dimensions d. A recurrence for the expected number of facets and (d - 2)- faces is also found, this analysis building on a technique of Renyi and Sulanke. Other relationships for the expected count of i-faces (1 <= i < d) are found when d <= 5, by applying the Dehn-Sommerville identities. A general recurrence identity (see (3) below) for this expected count is conjectured.

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

sylvester's problem
random geometry
faces of polytopes