A hybrid model for sharing information between fuzzy, uncertain and default reasoning models in multi-agent systems This paper develops a hybrid model which provides a unified framework for the following four kinds of reasoning: 1) Zadeh's fuzzy approximate reasoning; 2) truth-qualification uncertain reasoning with respect to fuzzy propositions; 3) fuzzy default reasoning (proposed, in this paper, as an extension of Reiter's default reasoning); and 4) truth-qualification uncertain default reasoning associated with fuzzy statements (developed in this paper to enrich fuzzy default reasoning with uncertain information). Our hybrid model has the following characteristics: 1) basic uncertainty is estimated in terms of words or phrases in natural language and basic propositions are fuzzy; 2) uncertainty, linguistically expressed, can be handled in default reasoning; and 3) the four kinds of reasoning models mentioned above and their combination models will be the special cases of our hybrid model. Moreover, our model allows the reasoning to be performed in the case in which the information is fuzzy, uncertain and partial. More importantly, the problems of sharing the information among heterogeneous fuzzy, uncertain and default reasoning models can be solved efficiently by using our model. Given this, our framework can be used as a basis for information sharing and exchange in knowledge-based multi-agent systems for practical applications such as automated group negotiations. Actually, to build such a foundation is the motivation of this paper.

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

fuzzy reasoning
linguistic truth
expert system
knowledge-based system
agent
automated negotiation


Comparative evaluation of motor unit architecture models We present a statistical evaluation and comparison of the simulation outcomes of nine different motor unit architecture modeling approaches, which derive from combinations of four motor unit territory placement algorithms with two innervation pattern algorithms (one of the combinations allows for a double approach). We test how well the outcomes of these models agree with well-established physiological principles. Our results show that algorithms based on independent and uniformly distributed territory placement always lead to an unwanted edge effect consisting in a decay of the number of overlapping motor unit territories toward the edge of the muscle cross section. This edge effect interferes with the properties of the simulated motor units. On the other hand, controlled placement of motor units, so as to minimize the spatial variance of muscle fiber density (MFD), can result in simulated motor units which better reflect the empirical evidence currently available about motor unit architecture.

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

muscle model
muscle architecture
emg simulation
model evaluation


Joint equalization and coding for on-chip bus communication In this paper, we propose using joint equalization and coding to improve on-chip communication speeds by signaling at rates beyond the rate governed by resistance-capacitance (RC) delay of the interconnect. Operating beyond the RC limit introduces inter-symbol interference (ISI). We mitigate the effects of ISI by employing equalization. The proposed equalizer employs a variable threshold inverter whose switching threshold is modified as a function of past output of the bus. We demonstrate even higher speedups by combining equalization with crosstalk avoidance coding. Specifically, simulation results for a 10-mm 32-bit bus in 0.13-mu m CMOS technology show that 1.28 X speedup is achievable by equalization alone and 2.30 X speedup is achievable by joint equalization and coding.

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

coding
crosstalk avoidance
delay
equalization

interconnection networks
on-chip buses
system-on-chip (soc)


garbage collection for multicore numa machines Modern high-end machines feature multiple processor packages, each of which contains multiple independent cores and integrated memory controllers connected directly to dedicated physical RAM. These packages are connected via a shared bus, creating a system with a heterogeneous memory hierarchy. Since this shared bus has less bandwidth than the sum of the links to memory, aggregate memory bandwidth is higher when parallel threads all access memory local to their processor package than when they access memory attached to a remote package. This bandwidth limitation has traditionally limited the scalability of modern functional language implementations, which seldom scale well past 8 cores, even on small benchmarks. This work presents a garbage collector integrated with our strict, parallel functional language implementation, Manticore, and shows that it scales effectively on both a 48-core AMD Opteron machine and a 32-core Intel Xeon machine.

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


Joint Source-Channel Coding Excess Distortion Exponent for Some Memoryless Continuous-Alphabet Systems We investigate the joint source-channel coding (JSCC) excess distortion exponent E(J) (the exponent of the probability of exceeding a prescribed distortion level) for some memoryless communication systems with continuous alphabets. We first establish upper and lower bounds for E(J) for systems consisting of a memoryless Gaussian source under the squared-error distortion fidelity criterion and a memoryless additive Gaussian noise channel with a quadratic power constraint at the channel input. A necessary and sufficient condition for which the two bounds coincide is provided, thus exactly determining the exponent. This condition is observed to hold for a wide range of source-channel parameters. As an application, we study the advantage in terms of the excess distortion exponent of JSCC over traditional tandem (separate) coding for Gaussian systems. A formula for the tandem exponent is derived in terms of the Gaussian source and Gaussian channel exponents, and numerical results show that JSCC often substantially outperforms tandem coding. The problem of transmitting memoryless Laplacian sources over the Gaussian channel under the magnitude-error distortion is also carried out. Finally, we establish a lower bound for E(J) for a certain class of continuous source-channel pairs when the distortion measure is a metric.

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

continuous memoryless sources and channels

memoryless gaussian and laplacian sources

tandem separate source and channel coding


pairwise sequence comparison for fitness evaluation in evolutionary structural software testing Evolutionary algorithms are among the metaheuristic search methods that have been applied to the structural test data generation problem. Fitness evaluation methods play an important role in the performance of evolutionary algorithms and various methods have been devised for this problem. In this paper, we propose a new fitness evaluation method based on pairwise sequence comparison also used in bioinformatics. Our preliminary study shows that this method is easy to implement and produces promising results.

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

automated software test data generation
pairwise sequence alignment
search-based software engineering


communities of everyday practice and situated elderliness as an approach to co-design for senior interaction In the co-design project Senior Interaction a public care unit, university researchers, industrial partners, and senior citizens are working together to design living labs applying digital concepts that can strengthen social networks and interaction among seniors. When approaching people who we envisioned to be the future users we realized that almost nobody among the people between 55 and 75 years old identified themselves as 'elderly' or 'senior citizens', we realized that users are never just 'out there'. Instead they tend to refer to 'the others' or even to their own parents. Rather than using biological age, institutional categories or similar formal ways to group the people that we imagine as the future users, we suggest to talk about situated elderliness. By associating elderliness not to all encompassing life circumstances but to certain everyday contexts we can turn our attention towards what we call communities of everyday practice that defines these contexts.

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

recruiting participants
design laboratory
communities of everyday practices
co-design


Fault-tolerant control of electric vehicles with in-wheel motors using actuator-grouping sliding mode controllers Fault-tolerant control of electric vehicles is studied. A modified sliding mode control (SMC) is proposed. Three SMC control laws for different control targets are designed. Actuator-grouping SMC method is proposed.

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

yaw rate control
side-slip angle control
fault-tolerant control
electric vehicle
in-wheel motors


Interpreting the semantics of GD&T specifications of a product for tolerance analysis ? STEP models are not capable for interpreting the product data semantics automatically. We discussed mapping of STEP models to OWL-based ontology. Products GD&T information mapped from STEP to OWL-based models. Implementations have been carried out in Protg using NISTs OntoSTEP plug-in. Ontology based model is used to interpret GD&T semantics for tolerance analysis.

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

product modeling
express
owl
semantic
gd&t


Hamilton-connectivity and cycle-embedding of the Mobius cubes The recently introduced interconnection network, the Mobius cube, is an important variant of the hypercube. This network has several attractive properties compared with the hypercube. In this paper, we show that the n-dimensional Mobius cube M-n is Hamilton-connected when n greater than or equal to 3. Then, by using the Hamilton-connectivity of M-n, we also show that any cycle of length l (4 less than or equal to l less than or equal to 2(n)) can be embedded into M-n with dilation 1 (n greater than or equal to 2). It is a fact that the n-dimensional hypercube Q(n) does not possess these two properties. (C) 2002 Elsevier Science B.V. All rights reserved.

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

interconnection networks
embedding
hamilton-connectivity


Cycle structure of random permutations with cycle weights We investigate the typical cycle lengths, the total number of cycles, and the number of finite cycles in random permutations whose probability involves cycle weights. Typical cycle lengths and total number of cycles depend strongly on the parameters, while the distributions of finite cycles are usually independent Poisson random variables.Copyright 2012 Wiley Periodicals, Inc. Random Struct. Alg., 44, 109-133, 2014

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

random permutations
cycle weights
cycle structure


An approach for computing tight numerical bounds on renewal functions This method computes tight lower & upper bounds for the renewal function. It is based on Riemann-Stieltjes integration, and provides bounds for solving certain renewal equations used in the study of availability. An error analysis is given for the numerical bounds when inter-renewal time distributions are sufficiently smooth. Three examples are explored that demonstrate the accuracy of these computed numerical bounds.

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

renewal equation
riemann-stieltjes integral


Parameter synthesis of higher kinematic pairs We describe a parameter synthesis algorithm for planar mechanical systems comprised of higher kinematic pairs in which each part translates along a fixed axis or rotates around a fixed point. This is an important class of systems and is not addressed by prior synthesis research. Kinematic function is computed from the CAD models of the parts and is represented graphically as configuration spaces. Design flaws appear as incorrectly shaped contact curves, as incorrectly placed intersection points, and as incorrect curve sequences. The designer reshapes the faulty curves with the keyboard mouse. The synthesis algorithm computes new parameter values that realize the changes without harmful side effects, using a novel form of constrained optimization. The algorithm has been tested on industrial applications.

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

kinematic synthesis
higher pair
configuration space


A study of two penalty-parameterless constraint handling techniques in the framework of MOEA/D Penalty functions are frequently employed for handling constraints in constrained optimization problems (COPs). In penalty function methods, penalty coefficients balance objective and penalty functions. However, finding appropriate penalty coefficients to strike the right balance is often very hard. They are problems dependent. Stochastic ranking (SR) and constraint-domination principle (CDP) are two promising penalty functions based constraint handling techniques that avoid penalty coefficients. In this paper, the extended/modified versions of SR and CDP are implemented for the first time in the multiobjective evolutionary algorithm based on decomposition (MOEA/D) framework. This led to two new algorithms, CMOEA/D-DE-SR and CMOEA/D-DE-CDP. The performance of these new algorithms is tested on CTP-series and CF-series test instances in terms of the HV-metric, IGD-metric, and SC-metric. The experimental results are compared with NSGA-II, IDEA, and the three best performers of CEC 2009 MOEA competition, which showed better and competitive performance of the proposed algorithms on most test instances of the two test suits. The sensitivity of the performance of proposed algorithms to parameters is also investigated. The experimental results reveal that CDP works better than SR in the MOEA/D framework.

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

constrained multiobjective optimization
constraint-domination principle
moea/d


Comparative Visualization for Parameter Studies of Dataset Series This paper proposes comparison and visualization techniques to carry out parameter studies for the special application area of dimensional measurement using 3D X-ray computed tomography (3DCT). A dataset series is generated by scanning a specimen multiple times by varying parameters of an industrial 3DCT device. A high-resolution series is explored using our planar-reformatting-based visualization system. We present a novel multi-image view and an edge explorer for comparing and visualizing gray values and edges of several datasets simultaneously. Visualization results and quantitative data are displayed side by side. Our technique is scalable and generic. It can be effective in various application areas like parameter studies of imaging modalities and dataset artifact detection. For fast data retrieval and convenient usability, we use bricking of the datasets and efficient data structures. We evaluate the applicability of the proposed techniques in collaboration with our company partners.

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

parameter visualization
industrial computed tomography
multiple dataset visualization


Thermal characterization of materials for double patterning Among the different possibilities for sub-40nm half-pitch devices, double patterning (DP) is one of the most promising candidates. This paper is related to the double imaging approach where the first lithographic step is followed by a resist curing to avoid any degradation of the pattern during the upper-layer resist patterning. In this paper we develop a methodology based on thermal analysis measurements to demonstrate the existence of an optimal curing temperature. The results are in good agreements with the lithographic observations showing that thermal characterization of the resist is a complementary source of information for the DP process. Moreover, we were able to provide valuable information on the evolution of the properties of the resist occurring during the curing step and some directions for next generation curing resists.

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

thermal analysis
double patterning
curing


Towards criteria for selecting approximation functions in the Dual Reciprocity Method Since the publication of a book about the Dual Reciprocity Method in 1992 there has been much research into the development of approximation functions employed with this method, and many new functions have been proposed. Given this wealth of new functions, it is important for engineers to be able to identify an adequate function for a given problem. Unfortunately, most authors, in proposing functions for use in DRM compare results principally with the r function used in the book mentioned above, and which is now considered to be that which has the worst performance. In view of this six examples are solved here using a wide range of functions and the results obtained with each function compared with the aim of establishing some guidelines for selecting the function.

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

dual reciprocity
approximation functions

comparative error
linear and quadratic elements


a benchmark for best view selection of 3d objects The best view selection corresponds to the task of automatically selecting the most representative view of a 3D model. In this paper, we describe a benchmark for evaluation of best view selection algorithms. The benchmark consists of the preferred views of 68 3D models provided by 26 human subjects. The data was collected using a web-based subjective experiment where the users were asked to select the most informative view of a 3D model. We provided a quantitative evaluation measure based on this ground truth data, and compared the performances of seven best view selection algorithms.

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


Location-based QoS enhanced dynamic carrier allocation over multi-cell environments It is well known that high multi-user and multi-carrier diversity gains can be achieved via the use of DCA (Dynamic Channel Allocation). However, there is no framework for analyzing the system performance of DCA algorithms over multi-cell environments. This paper presents a numerical analysis for measuring the performance gain for various DCA algorithms. Based on the analysis, an LQE (Location-based QoS Enhanced) DCA algorithm is proposed, in which a higher priority is assigned to users in the outer region for fairness by exploiting multi-carrier diversity. In the inner region, each carrier is allocated to a user with the best channel gain for higher throughput by exploiting multi-user diversity. In the simulation, we demonstrate that the proposed DCA algorithm is very effective from the perspective of fairness and throughput.

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

dynamic carrier allocation
dynamic channel allocation

ofdm
multi-user diversity
multi-carrier diversity


A bit-parallel algorithm for searching multiple patterns with various lengths We present an extension of a bit-parallel algorithm for fast string search. The algorithm maximizes the stability of search throughput for multiple patterns of different lengths. Bit and data parallelism are exploited via AVX2 and OpenMP, respectively. Rapid identification of matching patterns is realized by a data padding scheme that regularizes control flow. Stable search throughput is achieved for arbitrary text and patterns that fit into a word.

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


visual speech analysis and synthesis with application to mandarin speech training This paper presents a novel vision-based speech analysis system STODE which is used in spoken Chinese training of oral deaf children. Its design goal is to help oral deaf children overcome two major difficulties in speech learning: the confusion of intonations for spoken Chinese characters and timing errors within different words and characters. It integrates such capabilities as real-time lip tracking and feature extraction, multi-state lip modeling, Time-delay Neural Network (TDNN) for visual speech analysis. A desk-mounted camera tracks users in real-time. At each frame, region of interest is identified and key information is extracted. The preprocessed acoustic and visual information are then fed into a modular TDNN and combined for visual speech analysis. Confusion of intonations for spoken Chinese characters can be easily identified, and timing error within words and characters also can be detected using a DTW (Dynamic Time Warping) algorithm. For visual feedback we have created an artificial talking head directly cloned from user's own images to generate correct outputs showing both correct and wrong ways of pronunciation. This system has been successfully used for spoken Chinese training of oral deaf children in cooperation with Nanjing Oral School under grants from National Natural Science Foundation of China.

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


Energy-efficient and cost-effective web API invocations with transfer size reduction for mobile mashup applications Recently, the proliferation of smartphones and the extensive coverage of wireless networks have enabled numerous mobile users to access Web resources with smartphones. Mobile mashup applications are very attractive to smartphone users due to specialized services and user-friendly GUIs. However, to offer new services through the integration of Web resources via Web API invocations, mobile mashup applications suffer from high energy consumption and long response time. In this paper, we propose a proxy system and two techniques to reduce the size of data transfer, thereby enabling mobile mashup applications to achieve energy-efficient and cost-effective Web API invocations. Specifically, we design an API query language that allows mobile mashup applications to readily specify and obtain desired information by instructing a proxy to filter unnecessary information returned from Web API servers. We also devise an image multi-get module, which results in mobile mashup applications with smaller transfer sizes by combining multiple images and adjusting the quality, scale, or resolution of the images. With the proposed proxy and techniques, a mobile mashup application can rapidly retrieve Web resources via Web API invocations with lower energy consumption due to a smaller number of HTTP requests and responses as well as smaller response bodies. Experimental results show that the proposed proxy system and techniques significantly reduce transfer size, response time, and energy consumption of mobile mashup applications.

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

mobile mashup applications
web api
transfer size reduction
smartphones


System simulation of mixed-signal multi-domain microsystems with piecewise linear models We present a component-based multi-level mixed-signal design and simulation environment for microsystems spanning the domains of electronics, mechanics, and optics. The environment provides a solution to the problem of accurate modeling and simulation of multi-domain devices at the system level. This is achieved by partitioning the system into components that are modeled, by analytic expressions: These expressions are reduced via linearization into regions of operation for each element of the component and. solved with modified nodal analysis in the frequency domain, which guarantees convergence. Feedback among components is managed by a discrete event simulator sending composite signals between components. For electrical, and mechanical components, interaction is via physical connectivity while optical signals are modeled using complex scalar wavefronts, providing the accuracy necessary to model micro-optical components. Simulation speed vs. simulation accuracy can be tuned by controlling the granularity of the regions of operation of the devices, sample density of the optical wavefronts, or the time steps of the discrete event simulator. The methodology is specifically optimized for loosely coupled systems of complex components such as are found in multi-domain microsystems.

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


Good match exploration using triangle constraint This paper presents a novel method for addressing the problem of finding more good feature pairs between images, which is one of the most fundamental tasks in computer vision and pattern recognition. We first select matched features by Bi-matching as seed points, then organize these seed points by adopting the Delaunay triangulation algorithm. Finally, triangle constraint is used to explore good matches. The experimental evaluation shows that our method is robust to most geometric and photometric transformations including rotation, scale change, blur, viewpoint change, JPEG compression and illumination change, and significantly improves both the number of correct matches and the matching score. And the application on estimating the fundamental matrix for a pair of images is also shown. Both the experiments and the application demonstrate the robust performance of our method.

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

triangle constraint
matching score
number of correct matches


A Self-Organizing Defect Tolerant SIMD Architecture The continual decrease in transistor size (through either scaled CMOS or emerging nanotechnologies) promises to usher in an era of tera to peta-scale integration but with increasing defects. Regardless of fabrication methodology (top-down or bottom-up), defect-tolerant architectures are necessary to exploit the full potential of future increased device densities. This article explores a defect-tolerant SIMD architecture (SOSA) that self-organizes a large number of limited capability nodes with high defect rates into SIMD processing elements. Simulation results show that SOSA matches or exceeds the performance of conventional systems for moderate to large problems, but with lower power density.

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

design
reliability
self-organizing
data parallel
bit-serial
defect tolerance
dna
nanocomputing


Biomedic Organizations: An intelligent dynamic architecture for KDD The application of information technology in the field of biomedicine has become increasingly important over the last several years. This study presents the Intelligent Biomedic Organizations (IBOs) model, an intelligent dynamic architecture for knowledge discovery in biomedical databases. It involves an organizational model specially designed to support medical personnel in their daily tasks and to establish an innovative intelligent system to make classifications and predictions with huge volumes of information. IBO is based on a multi-agent architecture with Web service integration capability. The core of the system is a type of agent that integrates a novel strategy based on a case-based planning mechanism for automatic reorganization. This agent proposes a new reasoning agent model, where the complex processes are modeled as external services. In this sense, the agents act as coordinators of Web services that implement the four stages of the case-based planning cycle. The multi-agent system has been implemented in a real scenario to classify leukemia patients, and the classification strategy includes services such as a novel ESOINN neural network and statistical methods to analyze patient data. The results obtained are presented within this paper and demonstrate the effectiveness of the proposed organizational model.

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

multi-agent system
case-based reasoning
microarray
case-based planning


Analysis of the two-particle controlled interacting quantum walks We have recently proposed the two-particle controlled interacting quantum walks for building quantum Hash schemes (Li et al. Quantum Inf Proc, 2012. doi:10.?1007/?s11128-012-0421-8). In this paper, we adopt the mutual information, the measurement-induced disturbance and the quantum mutual information to measure the classical correlation, the quantum correlation and the total correlation between two particles respectively. Our conclusion is that the correlation between the particles of the two-particle controlled interacting quantum walks is similar to that of the two-particle interacting quantum walks. It is superb for keeping the quantum Hash scheme safe.

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


Evaluating a color-based active basis model for object recognition ? Wu and coworkers introduced an active basis model (ABM) for object recognition in 2010, in which the learning algorithm tends to sketch edges in textures. A grey-value local power spectrum was used to find a common template and deformable templates from a set of training images and to detect an object in new images by template matching. In this paper, we propose a color-based active basis model (color-based ABM for short), which incorporates color information. We adopt the framework of Wu et al. in the learning, detection, and classification of the color-based ABM. However, in order to improve the performance in object recognition, we modify the framework of Wu et al. by using different color-based features in both the learning and template matching algorithms. In this color-based ABM approach, two types of learning (i.e., supervised learning and unsupervised learning) are also explored. Moreover, the usefulness of the color-based ABM for practical object recognition in computer vision applications is demonstrated and its significant improvement in recognizing objects is reported.

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

object recognition
active basis model
local power spectrum


Searching for nonlinear feedback shift registers with parallel computing The numerical verification of conjecture of Chan et al. (FSE?94) up to order n=29 n = 29 . Enumeration of all one term quadratic m -sequences up to order n=21 n = 21 . Finding new NLFSRs generating modified de Bruijn sequences up to order n=31 n = 31 . Application of parallel computing to the above search problems. Calculations of linear complexities of the found sequences up to order n=26 n = 26 .

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


A Problem Solving Environment for interactive modelling of multiway data A prototype Problem Solving Environment (PSE) is presented for problems in interactive modelling of multiway data. Multiway data result from measurements as a function of two or more independent variables. The PSE comprises a parameter estimation loop and a model adjustment loop. The model can be specified hierarchically using mathematically described building blocks which encapsulate the model assumptions. A typical case study of three-way data illustrates the need for interactive model adjustment. Requirements for interactive problem solving are discussed. Copyright (c) 2005 John Wiley & Sons, Ltd.

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

problem solving environment
interactive modelling
multiway data
parameter estimation


Optimal power flow of a wind-thermal generation system We propose a new approach to solve the OPF problem of a wind-thermal power system. Transformer tap settings and shunt capacitor capacities affect losses and costs. A wind-thermal power system requires extra up/down spinning reserves. The installation capacity of a wind generation system should be limited. Wind generation system affects the voltage distribution and transmission losses.

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

wind generation system
optimal power flow

spinning reserve
particle swarm optimization


tapping into the vibe of the city using vibn, a continuous sensing application for smartphones We present VibN, a mobile sensing application deployed at large scale through the Apple App Store and the Android Market. VibN has been built to determine " what's going on " around the user in real-time by exploiting multiple sensor feeds. The application allows its users to explore live points of interest of the city by presenting real-time hotspots from sensor data. Each hotspot is characterized by a demographics breakdown of inhabitants and a list of short audio clips. The audio clips augment traditional microblogging methods by allowing users to automatically and manually provide rich audio data about their locations. VibN also allows one to browse historical points of interest and view how locations in a city evolve over time. Additionally, VibN automatically determines a user's personal points of interest, which are a means for building a user's breadcrumb diary of locations where they have spent significant amount of time. In this paper, we present the design, evaluation, and results from the large scale deployment of VibN through the popular Apple App Store and Android Market.

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


Mistreatment-resilient distributed caching ? The distributed partitioning of autonomous, self-aware nodes into cooperative groups, within which scarce resources could be effectively shared for the benefit of the group, is increasingly emerging as a hallmark of many newly-proposed overlay and peer-to-peer applications. Distributed caching protocols in which group members cooperate to satisfy local requests for objects is a canonical example of such applications. In recent work of ours we identified mistreatment as a potentially serious problem for nodes participating in such cooperative caching arrangements. Mistreatment materializes when a nodes access cost for fetching objects worsens as a result of cooperation. To that end, we outlined an emulation-based framework for the development of mistreatment-resilient distributed selfish caching schemes. Under this framework, a node opts to participate in the group only if its individual access cost is less than the one achieved while in isolation. In this paper, we argue against the use of such static all or nothing approaches which force an individual node to either join or not join a cooperative group. Instead, we advocate the use of a smoother approach, whereby the level of cooperation is tied to the benefit that a node begets from joining a group. To that end, we propose a distributed and easily deployable feedback-control scheme which mitigates mistreatment. Under our proposed adaptive scheme, a node independently emulates its performance as if it were acting in a greedy local manner and then adapts its caching policy in the direction of reducing its measured access cost below its emulated greedy local cost. Using control-theoretic analysis, we show that our proposed scheme converges to the minimal access cost, and indeed outperforms any static scheme. We also show that our scheme results in insignificant degradation to the performance of the caching group under typical operating scenaria.

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

service overlay networks
peer-to-peer networks
control theory
performance evaluation


Distortion minimization with fast local search for fractal image compression Optimal fractal image coding is an NP-hard combinatorial optimization problem, which consists of finding in a finite set of contractive affine mappings one whose unique fixed point is closest to the original image. Current fractal image schemes are based on a greedy suboptimal algorithm known as collage coding. In a previous paper. Hamzaoui, Hartenstein, and Saupe proposed a local search algorithm that iteratively improves an initial solution found by collage coding. For a standard fractal scheme based on quadtree image partitions, peak-signal-to-noise ratio (PSNR) gains are up to 0.8 dB. However, the algorithm is time-consuming because it involves many iteration steps, each of which requires the computation of the fixed point of an affine mapping. In this paper, we provide techniques that drastically reduce the complexity of the algorithm. Moreover, we show that the algorithm is also successful with a state-of-the-art fractal scheme based on highly adaptive image partitions. (C) 2001 Elsevier Science.

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

fractal image compression
combinatorial optimization
local search


Comparative analysis on margin based feature selection algorithms Feature evaluation and selection is an important preprocessing step in classification and regression learning. As large quantity of irrelevant information is gathered, selecting the most informative features may help users to understand the task, and enhance the performance of the models. Margin has been widely accepted and used in evaluating feature quality these years. A collection of feature selection algorithms were developed using margin based loss functions and various search strategies. However, there is no comparative research conducted to study the effectiveness of these algorithms. In this work, we compare 14 margin based feature selections from the viewpoints of reduction capability, classification performance of reduced data and robustness, where four margin based loss functions and three search strategies are considered. Moreover, we also compare these techniques with two well-known margin based feature selection algorithms ReliefF and Simba. The derived conclusions give some guidelines for selecting features in practical applications.

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


Diffusion front capturing schemes for a class of Fokker-Planck equations: Application to the relativistic heat equation In this research work we introduce and analyze an explicit conservative finite difference scheme to approximate the solution of initial-boundary value problems for a class of limited diffusion Fokker-Planck equations under homogeneous Neumann boundary conditions We show stability and positivity preserving property under a Courant-Friedrich-Lewy parabolic time step restriction We focus on the relativistic heat equation as a model problem of the mentioned limited diffusion Fokker-Planck equations We analyze its dynamics and observe the presence of a singular flux and an implicit combination of nonlinear effects that include anisotropic diffusion and hyperbolic transport We present numerical approximations of the Solution of the relativistic heat equation for a set of examples in one and two dimensions including continuous initial data that develops jump discontinuities in finite time We perform the numerical experiments through a class of explicit high order accurate conservative and stable numerical schemes and a semi-implicit nonlinear Crank-Nicolson type scheme (C) 2009 Elsevier Inc. All rights reserved.

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

relativistic heat equation
conservative finite difference scheme


Numerical and experimental analysis of pure aluminium shear panels with welded stiffeners In the field of passive seismic protection of framed buildings shear panels can be effectively applied as hysteretic devices. Recently, a wide experimental and numerical study has been undertaken at the University of Naples in order to investigate the behaviour of aluminium alloy stiffened shear panels. Test results show that the proposed system is characterised by a large energy dissipation capacity and therefore is suitable to be used for seismic protection of new and existing framed buildings. To simulate the hysteretic behaviour of the systems, according to the experimental tests, a refined FEM model has been set up. The comparison between experimental and numerical results shows that the adopted model is reliable enough to well interpret a number of important behavioural phenomena in terms of the main global features of the system.

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

dissipative systems
seismic control
shear buckling
steel frames


Shape equilibrium constraint: a strategy for stress-constrained structural topology optimization In topology optimization of a continuum, it is important to consider stress-related objective or constraints, from both theoretical and application perspectives. It is known that the problem is challenging. Although remarkable achievements have been made with the SIMP (Solid Isotropic Material with Penalization) framework, a number of critical issues are yet to be fully resolved. In the paper, we present an approach of a shape equilibrium constraint strategy with the level-set/X-FEM framework. We formulate the topology optimization problem under (spatially-distributed) stress constraints into a shape equilibrium problem of active stress constraint. This formulation allows us to effectively handle the stress constraint, and the intrinsic non-differentiability introduced by local stress constraints is removed. The optimization problem is made into one of continuous shape-sensitivity and it is solved by evolving a coherent interface of the shape equilibrium concurrently with shape variation in the structural boundary during a level-set evolution process. Several numerical examples in two dimensions are provided as a benchmark test of the proposed shape equilibrium constraint strategy for minimum-weight and fully-stressed designs and for designs with stress constraint satisfaction.

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

topology optimization
shape equilibrium constraint

local stress constraint
level set method
extended finite element method (x-fem)


Self-formation in microelectronics The external formation of integrated circuits based on lithographic processes is not the only possible method for manufacturing electron devices, either integrated circuits or photovoltaic cells. Planar technology, based on external formation, requires a certain sequence of interactions between the structured medium and the object being formed, in which the configuration of the region to be formed and its position are defined by the structure of the media and their alignment with the object. By contrast, in self-formation the interaction between an object to be formed and its chaotic medium is controlled by the object structure itself, and it is this interaction that changes the object's structure, leading to its increasing complexity. Three kinds of self-formation can be used in manufacturing: self-formation, based on a certain sequential interaction between an object and chaotic media; development, which requires only a single chaotic medium; and reproduction, which involves a developing object generating primary objects. All these cases represent self-formation of artificial systems. Simpler patterns of self-formation have already led to various patents and technologies, while more complex ones may be applied in the future. The following article attempts to define the necessary and sufficient conditions for self-formation.

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

development
reproduction
microelectronics
artificial systems


On the discrete maximum principle for the beltrami color flow We analyze the discrete maximum principle for the Beltrami color flow. The Beltrami flow can display linear as well as nonlinear behavior according to the values of a parameter beta, which represents the ratio between spatial and color distances. In general, the standard schemes fail to satisfy the discrete maximum principle. In this work we show that a nonnegative second order difference scheme can be built for this flow only for small beta, i.e. linear-like diffusion. Since this limitation is too severe, we construct a novel finite difference scheme, which is not nonnegative and satisfies the discrete maximum principle for all values of beta. Numerical results support the analysis.

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

nonlinear parabolic differential equations


A tight analysis of the Katriel- Bodlaender algorithm for online topological ordering Katriel and Bodlaender [Irit Katriel, Hans L. Bodlaender, Online topological ordering, ACM Transactions on Algorithms 2 (3) (2006) 364-379] modify the algorithm proposed by Alpern et al. [Bowen Alpern, Roger Hoover, Barry K. Rosen, Peter F. Sweeney, F. Kenneth Zadeck, Incremental evaluation of computational circuits, in: Proceedings of the First Annual ACM-SIAM, Symposium on Discrete Algorithms (SODA), 1990, pp. 32-42] for maintaining the topological order of the n nodes of a directed acyclic graph while inserting m edges and prove that their algorithm runs in O (min{m(3/2) log n, m(3/2) + n(2) log n}) time and has an ohm(m(3/2))) lower bound. In this paper, we give a tight analysis of their algorithm by showing that it runs in time theta(m(3/2) + mn(1/2) log n)(1). (c) 2007 Elsevier B.V. All rights reserved.

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

algorithms
topological order
tight analysis


A hybrid SOM-BPN approach to lot output time prediction in a wafer fab Output time prediction is a critical task to a wafer fab (fabrication plant). To further enhance the accuracy of wafer lot output time prediction, the concept of input classification is applied to the back propagation network (BPN) approach in this study by pre-classifying input examples with the self-organization map (SOM) classifier before they are fed into the BPN. Examples belonging to different categories are then learned with different BPNs but with the same topology. Production simulation is also applied in this study to generate test examples. According to experimental results, the prediction accuracy of the proposed methodology was significantly better than those of three existing approaches, case-based reasoning (CBR), BPN without example classification, and evolving fuzzy rules (EFR), in most cases by achieving a 13-46% (and an average of 30%) reduction in the root-mean-squared-error (RMSE) over the comparison basis - BPN without example classification.

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

back propagation network
output time prediction
wafer fab


Real time face and mouth recognition using radial basis function neural networks This paper presents a method for automatic real time face and mouth recognition using radial basis function neural networks (RBFNN). The proposed method uses the motion information to localize the face region, and the face region is processed in YC(r)C(b) color space to determine the locations of the eyes. The center of the mouth is determined relative to the locations of the eyes. Facial and mouth features are extracted using multiscale morphological erosion and dilation operations, respectively. The facial features are extracted relative to the locations of the eyes, and mouth features are extracted relative to the locations of the eyes and mouth. The facial and mouth features are given as input to radial basis function neural networks. The RBFNN is used to recognize a person in video sequences using face and mouth modalities. The evidence from face and mouth modalities are combined using a weighting rule, and the result is used for identification and authentication. The performance of the system using facial and mouth features is evaluated in real time in the laboratory environment, and the system achieves a recognition rate (RR) of 99.0% and an equal error rate (EER) of about 0.73% for 50 subjects. The performance of the system is also evaluated for XM2VTS database, and the system achieves a recognition rate (RR) of 100% an equal error rate (EER) of about 0.25% for 50 subjects. (c) 2008 Elsevier Ltd. All rights reserved.

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

multiscale morphological dilation and erosion operations


Shape analysis in a functional language by using regular languages ? Shape analysis is concerned with the compile-time determination of the shape the heap may take at runtime, meaning by this the pointer chains that may happen within, and between, the data structures built by the program. This includes detecting alias and sharing between the program variables. Functional languages facilitate somehow this task due to the absence of variable updating. Even though, sharing and aliasing are still possible. We present an abstract interpretation-based analysis computing precise information about these relations. In fact, the analysis gives an information more precise than just the existence of sharing. It informs about the paths through which this sharing takes place. This information is critical in order to get a modular analysis and not to lose precision when calling an already analysed function. The motivation for the analysis in our case is the need of knowing at compile time which variables are at risk of containing dangling pointers at runtime, in a language with explicit memory disposal primitives. The main innovation with respect to the literature is the use of regular languages to specify the possible pointer paths from a variable to its descendants. This additional information makes the analysis much more precise while still being affordable in terms of efficiency. We have implemented it and give convincing examples of its precision.

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

functional languages
shape analysis
regular languages

abstract interpretation
points-to analysis


Tree inclusion problems Given two trees (a target T and a pattern P) and a natural number w, window embedded subtree problems consist in deciding whether P occurs as an embedded subtree of T and/or finding the number of size (at most) w windows of T which contain pattern P as an embedded subtree. P is an embedded subtree of T if P can be obtained by deleting some nodes from T (if a node v is deleted, all edges adjacent to v are also deleted, and outgoing edges are replaced by edges going from the parent of v (if it exists) to the children of v). Deciding whether P is an embedded subtree of T is known to be NP-complete. Our algorithms run in time O(vertical bar T vertical bar 2(2 vertical bar P vertical bar)) where vertical bar T vertical bar (resp. vertical bar P vertical bar) is the size of T (resp. P).

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


H-matrix methods for linear and quasi-linear integral operators appearing in population balances In population dynamics, the source term of breakage and the sink term of coagulation are often described by linear and quasi-linear operators, respectively. These operators are characterised by their kernel functions. Naive discretisation leads to full matrices and therefore to quadratic complexity O(n(2)), if n denotes the number of degrees of freedom. For several popular kernel functions, e.g. the modified Smoluchowski kernel, an efficient treatment is introduced using the ideas of H-matrices. This approach leads to linear complexity O(n). (C) 2006 Elsevier Ltd. All rights reserved.

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

population dynamics
breakage
coagulation

population balance equation
dispersion
agglomeration
aggregation
coalescence
h-matrix
fast methods
integral operator


Face recognition algorithm using vector quantization codebook space information processing We propose a novel information-processing algorithm called Vector Quantization (VQ) codebook space information processing. Based on this algorithm, we have developed a very simple yet highly reliable face recognition method called VQ histogram method. General codebook consisting of 33 low-frequency patterns for VQ processing is created by theoretical method. Codevector referred (or matched) count histogram, which is obtained by VQ processing of facial image, is utilized as a very effective personal feature value. By applying appropriate low pass filtering to facial image and VQ processing, useful features for face recognition can be extracted. Experimental results show recognition rate of 95.6 % for 40 persons' 400 images of publicly available AT&T database containing variations in lighting, posing, and expressions. By combining multiple low pass filtering procedures, recognition rate increases up to 97 % or higher. After considering the essence of the VQ histogram method, moreover, we also have developed another face recognition method called Adjacent Pixel Intensity, Difference Quantization (AP1DQ) Histogram Method, which is simpler and more efficient in feature extraction than the former. Experimental results show an equivalent recognition rate of 95.7 % to VQ histogram method. By utilizing the table look-up (TLU) method in the quantization step, the total recognition processing time is reduced to only 3 1 msec.

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

adjacent pixel intensity difference quantization (apidq)


Simulation technologies for health sciences curriculum In this paper we discuss the main elements of an approach to teach simulation discipline in a small university with an interdisciplinary specialization in pharmaceutics, biology, health sciences, and computer science which are combined into a health sciences curriculum. We analyze existing ways to teach simulation courses and identify the specificity and goals within our approach. We propose the content of a simulation course sequence for the mentioned type of university. It includes three units: general simulation methodology, case studies, and building of real simulation models. The proposed new approach reinforces the problem-solving skills of students and their opportunities to conduct applied research. We implemented the proposed approach in a simulation course sequence and we successfully conducted student research projects.

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

health science curriculum
education
simulation technology
interdisciplinary approach
problem-solving skills reinforcement


Oscillation for a class of neutral parabolic differential equations Some sufficient conditions are established for the oscillation of a class of neutral parabolic differential equations of the form, partial derivative N(u(x, t) - Sigma(k=1)(r) lambda(k)u (x, t - rho(k)))/partial derivative t(N) -a(t)Delta + Sigma(i=1)(n) p(i) (x, t) u(x, t - sigma(i)) - Sigma(j=1)(m) q(j) (x, t) u (x, t - tau(j)) +h(t) f(u(x, t - r1), ..., u(x, t - r(1))) = 0, (x, t) is an element of Omega x [t0, + infinity) equivalent to G, t(0) is an element of R+, where N is an odd number, Omega is a bounded domain in R-M with a smooth boundary partial derivative Omega, and Delta is the Laplacian operation with three different boundary conditions. We obtained some new oscillatory conditions for the odd-order neutral parabolic differential equation. To some extent, our results are new oscillatory conditions, and extended some oscillatory results of some references. (c) 2005 Elsevier Ltd. All rights reserved.

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

oscillation
neutral
parabolic
differential equation


lazy argument passing in java rmi Though often criticized for its inherent synchronization overhead and coupling, the remote method invocation (RMI) paradigm remains one of the most popular abstractions for building distributed applications. Many authors have suggested ways to overcome its drawbacks focusing mostly on the invoker's perspective, for example by multiplexing invocations to replicated server objects, through "future" return values, or even by prohibiting return values altogether. The more global perspective, and in particular the invokee side, has conversely only received little attention. In this paper we take a fresh look at the RMI paradigm, elaborating on argument passing semantics. We identify three lazy ways of passing arguments by value, differing by the moment at which the transfer of the arguments synchronizes with the execution of the method body. We present a preliminary library implementation of our argument passing semantics in Java RMI, and illustrate their individual benefits through examples. We characterize analytically and empirically application scenarios which benefit from lazy argument passing.

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

java
lazy
future
argument passing
invocation


A patient-specific finite element methodology to predict damage accumulation in vertebral bodies under axial compression, sagittal flexion and combined loads Due to the inherent limitations of DXA, assessment of the biomechanical properties of vertebral bodies relies increasingly on CT-based finite element (FE) models, but these often use simplistic material behaviour and/or single loading cases. In this study, we applied a novel constitutive law for bone elasticity, plasticity and damage to FE models created from coarsened pQCT images of human vertebrae, and compared vertebral stiffness, strength and damage accumulation for axial compression, anterior flexion and a combination of these two cases. FE axial stiffness and strength correlated with experiments and were linearly related to flexion properties. In all loading modes, damage localised preferentially in the trabecular compartment. Damage for the combined loading was higher than cumulated damage produced by individual compression and flexion. In conclusion, this FE method predicts stiffness and strength of vertebral bodies from CT images with clinical resolution and provides insight into damage accumulation in various loading modes.

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


Evolutionary plantographics This letter describes an evolutionary system for creating lifelike three-dimensional plants and flowers, our main goal being the facilitation of producing realistic plant imagery. With these two goals in mind-ease of generation and realism-we designed the plant genotype and the genotype-to-phenotype mapping. Diversity in our system comes about through two distinct processes-evolution and randomization-allowing the creation not only of single plants but of entire gardens and forests. Thus, we are able to readily produce natural-looking artificial scenes.

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

computer graphics
evolutionary algorithms
robot shaping


A direct evaluation of stress intensity factors using the Extended Dual Boundary Element Method We introduce an alternative method in computational fracture mechanics to evaluate Stress Intensity Factors (SIFs) directly using the Extended Dual Boundary Element Method (XBEM) for 2D problems. Like other enrichment approaches, the new approach is able to yield accurate results on coarse discretisations, and the enrichment increases the problem size by only two degrees of freedom per crack tip. The BEM equations formed by collocation at nodes are augmented by two additional equations that enforce continuity of displacement at the crack tip. The enrichment approach provides the values of SIFs KI and KII directly in the solution vector and without any need for postprocessing such as the J-integral. Numerical examples are used to compare the accuracy of these directly computed SIFs to J-integral processing of both conventional and enriched boundary element approximations.

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

enriched bem
extended bem
stress intensity factors (sif)


Multi-population methods in unconstrained continuous dynamic environments: The challenges The multi-population method has been widely used to solve unconstrained continuous dynamic optimization problems with the aim of maintaining multiple populations on different peaks to locate and track multiple changing peaks simultaneously. However, to make this approach efficient, several crucial challenging issues need to be addressed, e.g., how to determine the moment to react to changes, how to adapt the number of populations to changing environments, and how to determine the search area of each population. In addition, several other issues, e.g., communication between populations, overlapping search, the way to create populations, detection of changes, and local search operators, should be also addressed. The lack of attention on these challenging issues within multi-population methods hinders the development of multi-population based algorithms in dynamic environments. In this paper, these challenging issues are comprehensively analyzed by a set of experimental studies from the algorithm design point of view. Experimental studies based on a set of popular algorithms show that the performance of algorithms is significantly affected by these challenging issues on the moving peaks benchmark.

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

multi-population optimization
evolutionary dynamic optimization
particle swarm optimization


Toward an oscillation-free, mass conservative, Eulerian-Lagrangian transport model Ten numerical schemes to reduce spurious oscillations in transport simulations were implemented and tested in a Eulerian-Lagrangian control-volume finite element model. The schemes included both new and existing flux-corrected transport (FCT) algorithms and nonlinear filters. The ability of the methods to eliminate numerical oscillations while preserving mass and minimizing the introduction of numerical diffusion was compared in 2D tests of varying complexity. The application of local mass correction algorithms was shown to be vital to avoid the introduction of mass errors by FCT. While none of the methods emerged as optimal for all cases, a new FCT method with a local mass correction scheme and a nonlinear filter can be recommended as the best approaches in general. The method of choice depends on the problem being solved, in particular on the concentration gradients and on the grid resolution. (C) 2002 Elsevier Science (USA).

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

flux-corrected transport methods
transport equation


A technique for elimination of reflected rays from antenna measurements performed in echoic environment The paper describes a technique for analyzing antenna measurements and removing reflected components present in measurements performed in echoic environments. The method is based on digital signal processing methods, and frequency-domain measurements are used to design a discrete-time, finite impulse response digital filter using least-squares methods. The frequency response of the filter is equal to the transmission coefficient measurements performed in an anechoic chamber. In order to verify the method, processed measurements of mutual coupling between stacked patch antennas were compared to the computer simulations of anechoic response, and a very close agreement was achieved.

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

time-gating
broadband antennas
reflections
digital filtering
least-squares methods


Towards efficient data distribution on computational desktop grids with BitTorrent Datacentric applications are still a challenging issue for large-scale distributed computing systems. The emergence of new protocols and software for collaborative content distribution over the Internet offers a new opportunity for efficient and fast delivery of a high volume of data. This paper presents an evaluation of the BitTorrent protocol for computational desktop grids. We first present a prototype of a generic subsystem dedicated to data management and designed to serve as a building block for any desktop grid system. Based on this prototype we conduct experiments to evaluate the potential of BitTorrent compared to a classical approach based on FTP data server. The preliminary results obtained with a 65-node cluster measure the basic characteristics of BitTorrent in terms of latency and bandwidth and evaluate the scalability of BitTorrent for the delivery of large input files. Moreover, we show that BitTorrent has a considerable latency overhead compared to FTP but clearly outperforms FTP when distributing large files or files to a high number of nodes. Tests on a synthetic application show that BitTorrent significantly increases the communication/computation ratio of the applications eligible to run on a desktop grid system.

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

desktop grid
collaborative content distribution
bittorrent


e-Records in health - Preserving our future Introduction: Papyrus manuscripts nearly 2000 years old, can still be read, but documents composed on a Wang or other word processor just 30 years ago are gone forever. Standards and formats used for storing and accessing information are constantly changing, and the required hardware or software will likely be obsolete or no longer exist in the near future. Purpose: To understand how to urgently address the data preservation issue as we migrate to greater use of e-records, in particular 'lifetime' electronic health records (EHR's), as our primary, perhaps sole, e-record. In principle, these dynamic and critical health data must be preserved and capable of real-time access on a 7/24/365 basis for perhaps 125 years. Without forethought, only a small fraction of the data currently stored within any healthcare jurisdiction will survive for more than a decade or so, or be exchangeable between jurisdictions. The situation will only be compounded as EHR's become ubiquitous. Approach: The literature was reviewed to identify data preservation issues and potential solutions, and guide development of policy recommendations to minimise the impact of this potentially catastrophic system failure. These recommendations are directed at the practice, program, and decision-making levels, and in both the public and private sectors. Conclusion: Data preservation poses a critical barrier to e-health and future healthcare systems. At this time broad awareness of data preservation issues is poor. This paper offers policy recommendations to stimulate debate and development of suitable strategies. (C) 2006 Published by Elsevier Ireland 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 B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 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

e-health
e-records
information storage and retrieval
telemedicine
health policy


wiki credibility enhancement Wikipedia has been very successful as an open encyclopedia which is editable by anybody. However, the anonymous nature of Wikipedia means that readers may have less trust since there is no way of verifying the credibility of the authors or contributors. We propose to automatically transfer external information about the authors from outside Wikipedia to Wikipedia pages. This additional information is meant to enhance the credibility of the content. For example, it could be the education level, professional expertise or affiliation of the author. We do this while maintaining anonymity. In this paper, we present the design and architecture of such system together with a prototype.

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


A Polynomial-Time Algorithm to Find von Neumann-Morgenstern Stable Matchings in Marriage Games This paper considers von Neumann-Morgenstern (vNM) stable sets in marriage games. Ehlers (Journal of Economic Theory 134: 537-547, 2007) showed that if a vNM stable set exists in a marriage game, the set is a maximal distributive lattice of matchings that includes all core matchings. To determine what matchings form a vNM stable set, we propose a polynomial-time algorithm that finds a man-optimal matching and a woman-optimal matching in a vNM stable set of a given marriage game. This algorithm also generates a modified preference profile such that a vNM stable set is obtained as the core of a marriage game with the modified preference profile. It is well known that cores of marriage games are nonempty. However, the nonemptiness of cores does not imply the existence of a vNM stable set. It is proved using our algorithm that there exists a unique vNM stable set for any marriage game.

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

matching problem
stable matching
von neumann-morgenstern stable set


Fingerprint matching by thin-plate spline modelling of elastic deformations This paper presents a novel minutiae matching method that describes elastic distortions in fingerprints by means of a thin-plate spline model, which is estimated using a local and a global matching stage. After registration of the fingerprints according to the estimated model, the number of matching minutiae can be counted using very tight matching thresholds. For deformed fingerprints, the algorithm gives considerably higher matching scores compared to rigid matching algorithms, while only taking on a P-III machine. Furthermore, it is shown that the observed deformations are different from those described by theoretical models proposed in the literature.

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

minutiae matching
elastic deformations
registration

fingerprint verification
thin-plate spline models


A linear programming model for determining ordered weighted averaging operator weights with maximal Yager's entropy It has a wide attention about the methods for determining OWA operator weights. At the beginning of this dissertation, we provide a briefly overview of the main approaches for obtaining the OWA weights with a predefined degree of orness. Along this line, we next make an important generalization of these approaches as a special case of the well-known and more general problem of calculation of the probability distribution in the presence of uncertainty. All these existed methods for dealing these kinds of problems are quite complex. In order to simplify the process of computation, we introduce Yager's entropy based on Minkowski metric. By analyzing its desirable properties and utilizing this measure of entropy, a linear programming ( LP) model for the problem of OWA weight calculation with a predefined degree of orness has been built and can be calculated much easier. Then, this result is further extended to the more realistic case of only having partial information on the range of OWA weights except a predefined degree of orness. In the end, two numerical examples are provided to illustrate the application of the proposed approach. (C) 2009 Elsevier Ltd. All rights reserved.

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

measures of information
linear objective programming


A flexible and dynamic algorithm for assessment and optimization of utility sectors This paper presents a flexible and dynamic algorithm for total assessment, ranking, and optimization of utility sectors. Data envelopment analysis (DEA), corrected ordinary least square (COLS), and stochastic frontier analysis (SFA) are employed for assessment and ranking purpose. The proposed algorithm is flexible due to utilizing both constant return to scale (CRS) and variable return to scale (VRS) DEA models. One-way analysis of variance (ANOVA) is applied to test the equality of the results obtained by DEA, COLS, and SFA models in terms of mean efficiency scores. In this regard, if all the three methods reveal equal performance, the DEA model (either CRS or VRS) with higher efficiency score is selected for optimization purpose. Otherwise, through Duncans multiple range test (DMRT), the method with the highest efficiency score is selected and then, using Spearman correlation test, the DEA model with higher correlation with the selected method is identified and applied for optimization of the utility sectors. The proposed algorithm is dynamic due to simultaneous application of deterministic (i.e. DEA and COLS) and stochastic (i.e. SFA) methods in order to improve the ranking and optimization of utility sectors. Two real case studies are considered in order to illustrate the applicability and usefulness of the proposed algorithm in assessment, ranking, and optimization of the utility sectors.

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

assessment
optimization
data envelopment analysis
stochastic frontier analysis

utility sector
corrected ordinary least squares


Regularity Issue of the Navier-Stokes Equations Involving the Combination of Pressure and Velocity Field We establish some regularity criteria for the incompressible Navier-Stokes equations in a bounded three-dimensional domain concerning the quotients of the pressure, the velocity field and the pressure gradient.

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


Obtaining the optimal configuration of high-radix Combined switches We describe an alternative (C-switches) for building high-radix switches. We define a methodology for determining the optimal configuration of C-switches. We apply three search techniques to every C-switch in the network. Application of our methodology to a case study and several traffic patterns. We run a performance evaluation to confirm the efficiency of the considered algorithms.

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

parallel computing systems
interconnection networks
high-radix switches
search algorithms


Economic perspectives on integrating early child stimulation with nutritional interventions There is a strongly held view that a narrow window exists for effective nutritional interventions and a widely known stylized depiction of age-dependent economic rates of returns to investments in cognitive and socioemotional development. Both indicate critical periods in early life. Moreover, the fact that both the physical and cognitive development of a child in these early years are highly dependent on childcare practices and on the characteristics of the caregivers motivates an interest in finding effective means to enhance stimulation in the context of nutritional programs, or vice versa. Nevertheless, there is relatively little evidence to date on how to align integrated interventions to these age-specific patterns and how to undertake benefitcost analyses for integrated interventions. Thus, many core questions need further consideration in order to design integrated nutritional and stimulation programs. This paper looks at some of these questions and provides some guidelines as to how the economic returns from joint nutrition and stimulation programs might be estimated.

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


web caching using access statistics We consider the problem of caching web pages with the objective of minimizing latency of access. Demands for web domains/pages are computed using access statistics; the frequency with which these statistics change is considerably longer than the frequency of page requests. We model caches as being constrained by total size and total number of ports: each cache can handle only a limited request rate and can store only a limited number of domains (eg. modelling bounded update traffic). When the caches have fixed locations, we present a constant factor approximation to the optimum average latency while exceeding capacity constraints by a logarithmic factor. We demonstrate improved results in the special case where no replication of pages is allowed. In the alternate model where we are allowed to place our own caches in the network for a cost, we produce a constant approximation to the weighted sum of cost and average latency. Finally, we consider several other variants of the problem which might arise in practice.

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

network place cache statistics latency replication factor web approximation size demonstrate case access model traffic caches cost update change

paging
locatability
web page
domain
capacities
object
constraint
web caches
practical


Is the social use of media for seeking connectedness or for avoiding social isolation? Mechanisms underlying media use and subjective well-being This study provides a resolution for two contrasting hypotheses around media use, the augmentation and the displacement hypotheses. To do this, we conducted an online survey of 300 Korean adults examining the relationships among the social use of media, face-to-face communication, social isolation, connectedness, and subjective well-being. The results indicate that connectedness, not avoiding social isolation, mediates the effects of the social use of media on subjective well-being. On the other hand, both connectedness and avoiding social isolation mediate the effects of face-to-face communication on subjective well-being. These results suggest that the social use of media is limited to seeking connectedness to others, whereas face-to-face communication can facilitate avoiding social isolation as well as seeking connectedness, which can explain why the two contrasting hypothesis, the augmentation and the displacement hypotheses, can be right. In the domain of seeking connectedness, media can augment face-to-face communication. On the other hand, in the domain of avoiding social isolation, media may displace face-to-face communication.

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

media use
connectedness
social isolation

face-to-face communication
subjective well-being


Energy efficiency optimisation of wastewater treatment: Study of ATAD The aim of this paper is to minimise the energy requirement of autothermal thermophilic aerobic digestion (ATAD). To this end, a dynamic ATAD model is presented and assessed. A global sensitivity analysis was performed to identify the operating conditions with the strongest impact on the energy requirements, and thus to choose the most promising optimisation variables. The latter turned out to be the aeration flowrate, the reaction time, and the sludge flowrate. The optimisation problem was formulated following the sequential approach for dynamic optimisation, due to the discontinuous nature of ATAD. The problem was implemented in MATLAB (R) and solved for two case studies using the eSS algorithm, a global scatter search method that alternates with local algorithms (in our case fmincon) to refine the best solutions. The two selected full-scale case studies include a single-stage and a two-stage system. For the former, a 22% improvement of the energy requirement was achieved after optimisation, and 18% for the latter. Despite its advantages and common use in other fields, optimisation is still relatively rare in wastewater engineering. In the light of the high, rising cost of wastewater treatment, optimisation should become the norm when it comes to design and operation of wastewater treatment plants. (C) 2011 Elsevier Ltd. All rights reserved.

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

wastewater treatment
atad
energy efficiency
dynamic optimisation
sensitivity analysis


Optimization of cutting process by GA approach The paper proposes a new optimization technique based on genetic algorithms (GA) for the determination of the cutting parameters in machining operations. In metal cutting processes, cutting conditions have an influence on reducing the production cost and time and deciding the quality of a final product. This paper presents a new methodology for continual improvement of cutting conditions with GA. It performs the following: the modification of recommended cutting conditions obtained from a machining data, learning of obtained cutting conditions using neural networks and the substitution of better cutting conditions for those learned previously by a proposed GA. Experimental results show that the proposed genetic algorithm-based procedure for solving the optimization problem is both effective and efficient, and can be integrated into an intelligent manufacturing system for solving complex machining optimization problems.

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

optimization
cutting parameters
manufacturing


Enhanced Compressed Sensing Recovery With Level Set Normals We propose a compressive sensing algorithm that exploits geometric properties of images to recover images of high quality from few measurements. The image reconstruction is done by iterating the two following steps: 1) estimation of normal vectors of the image level curves, and 2) reconstruction of an image fitting the normal vectors, the compressed sensing measurements, and the sparsity constraint. The proposed technique can naturally extend to nonlocal operators and graphs to exploit the repetitive nature of textured images to recover fine detail structures. In both cases, the problem is reduced to a series of convex minimization problems that can be efficiently solved with a combination of variable splitting and augmented Lagrangian methods, leading to fast and easy-to-code algorithms. Extended experiments show a clear improvement over related state-of-the-art algorithms in the quality of the reconstructed images and the robustness of the proposed method to noise, different kind of images, and reduced measurements.

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