Fast and efficient parametric modeling of contact-to-substrate coupling This paper presents two rapid and yet accurate modeling methods for substrate coupling between a device contact and a substrate backplane. We discuss effects of physical parameters and geometrical characteristics of the contact and the substrate on the proposed models. We also derive model expressions for extraction of circuit-model elements of the substrate. Both methods are efficient for speed, memory usage, and adaptable to computer-aided design (CAD) tools for optimization tasks. The accuracy of both methods, the parametric modeling method and the microstrip line approximation method, is validated by comparing with the rigorous simulation data obtained from IE3D. Using the new models, we record a much higher speedup factor and extremely lower memory requirements compared to other published methods. The modeling methods are extended to two-layer structures and the models are applied to spiral inductors for verification purposes. In our research, we have validated the models over a wide range of frequencies up to 20 GHz.

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

device contact
modeling
spiral inductors
substrate coupling


New evidence of discrete scale invariance in the energy dissipation of three-dimensional turbulence: Correlation approach and direct spectral detection We extend the analysis of Ref. 16 showing statistically significant log-periodic corrections to scaling in the moments of the energy dissipation rate in experiments at high Reynolds number (approximate to 2500) of three-dimensional fully developed turbulence. First, we develop a simple variant of the canonical averaging method using a rephasing scheme between different samples based on pairwise correlations-that confirms Zhou and Sornette's previous results. The second analysis uses a simpler local spectral approach and then performs averages over many local spectra. This yields stronger evidence of the existence of underlying log-periodic undulations, with the detection of more than 20 harmonics of a fundamental logarithmic frequency f = 1.434 +/- 0.007 corresponding to the preferred scaling ratio gamma = 2.008 +/- 0.006.

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

discrete scale invariance
turbulence
energy dissipation
canonical averaging


The ISO standard for radiofrequency identification of animals Radiofrequency identification (RFID) is a good way to identify animals. To overcome the problem that systems were not interchangeable, a Working Group of the International Organisation for Standardization (ISO/TC23/SC19/WG3) has defined a standard on the code structure in the transponder and on the technology for the communication between reader and transponder. In the code structure standard ISO 11784, the 64 bits of code are split into three parts: 16 bits for special purposes, of which two have already been assigned and 14 have been reserved for future needs; 10 bits containing a reference to the issuing country or the manufacturer who programmed the transponder; and 38 bits of code containing a serial number. The combination of country/manufacturers code and serial number (bits 1764) form a worldwide unique identification number of the animal. This number can be used to retrieve information on an individual animal. A prerequisite is the existence of a logistical system starting with a database on country or manufacturer level, which redirects queries for information to the right database on a lower level, where the actual information can be found. For some countries such a system may not be attainable in the near future. The principle of the standard on the technical concept ISO 11785 is that two different types of RFID systems (full-duplex, FDX, and half-duplex, HDX) are combined. An FDX transponder sends its telegram during activation by the reader; in the HDX system it responds during a pause after it was charged with energy during activation. A dual adaptive timing protocol was necessary to make the system fast enough. It was verified that the standardised technology could fulfil all the requirements. A method has been described to enhance ISO readers to make them able to read old transponders, already implanted in animals, that are not compatible with the standard.

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


Nonlinear vibration of finitely-electroconductive plate strips in an axial magnetic field The vibrational behavior of geometrically nonlinear, finitely electroconductive, isotropic elastic plate strips immersed in an axial magnetic field is investigated. Kirchhoff hypothesis in conjunction with von-Krmns concept of strain is used to model the mechanical part, while the assumptions proposed by Ambartsumyan et al. are adopted to model the distribution of electric and magnetic disturbances through the plate-strip thickness. A system of nonlinear singular integro-differential equations are obtained, and by applying the Galerkins method, a third order nonlinear ordinary differential equation is derived. The influence of the magnetic field and electroconductivity on the plate-strip vibration is investigated and analytical solutions of the nonlinear fundamental frequency are obtained via the Method of Multiple Scales for two special cases, consisting of weak magnetic field and high electroconductivity. Finally, some pertinent conclusions are provided.

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

plate vibration
finite electroconductivity
magnetoelastic
geometric nonlinearities


Optimal partitioning of groups in selecting the best choice This article deals with the group interview problem, in which each group contains several alternatives and each group of alternatives is presented and evaluated sequentially over time. We derive the optimal selection strategy for the group interview problem with a general utility function. Among the various types of utility function, we focus on the best choice problem, in which our utility is one if we successfully select the best choice and zero otherwise. We derive a simple selection rule called the optimal partitioning strategy in which the decision-maker divides the entire groups into two disjoint sets and, after evaluating the choices in the first set, chooses the relatively best choice available for the first time in the second set. Because the selected choice is not necessarily the absolutely best choice, we also consider the probability distribution of the actual rank of the choice selected under the partitioning strategy. In many managerial decision situations such as buying a car, selling a house, or searching for a job, several alternatives are presented sequentially and an accept-or-reject decision is made immediately after evaluating each alternative. The classical secretary problem and its extensions have been successfully applied to such a sequential search and selection problem. This article deals with a more generalized version of the secretary problem, called the group interview problem, in which several groups of alternatives are presented and evaluated sequentially over time. Based on a stochastic dynamic programming approach, we propose the optimal selection strategy for the group interview problem with various types of the decision-maker's utility function. There are many potential applications of the group interview problem, including consumer search and purchase process, job search problem, sequential assignment of batch jobs, and so on.

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

decision analysis
sequential decision-making
applied probability
optimal stopping rule
stochastic model applications


Optimal classifiers with minimum expected error within a Bayesian framework-Part I: Discrete and Gaussian models In recent years, biomedicine has faced a flood of difficult small-sample phenotype discrimination problems. A host of classification rules have been proposed to discriminate types of pathology, stages of disease and other diagnoses. Typically, these classification rules are heuristic algorithms, with very little understood about their performance. To give a concrete mathematical structure to the problem, recent work has utilized a Bayesian modeling framework based on an uncertainty class of feature-label distributions to both optimize and analyze error estimator performance. The current study uses the same Bayesian framework to also optimize classifier design. This completes a Bayesian theory of classification, where both the classifier error and the estimate of the error may be optimized and studied probabilistically within the model framework. This paper, the first of a two-part study, derives optimal classifiers in discrete and Gaussian models, demonstrates their superior performance over popular classifiers within the assumed model, and applies the method to real genomic data. The second part of the study discusses properties of these optimal Bayesian classifiers. (C) 2012 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 B O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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

bayesian estimation
error estimation
genomics
minimum mean-square estimation
small samples


Anonymity preserving sequential pattern mining The increasing availability of personal data of a sequential nature, such as time-stamped transaction or location data, enables increasingly sophisticated sequential pattern mining techniques. However, privacy is at risk if it is possible to reconstruct the identity of individuals from sequential data. Therefore, it is important to develop privacy-preserving techniques that support publishing of really anonymous data, without altering the analysis results significantly. In this paper we propose to apply the Privacy-by-design paradigm for designing a technological framework to counter the threats of undesirable, unlawful effects of privacy violation on sequence data, without obstructing the knowledge discovery opportunities of data mining technologies. First, we introduce a k-anonymity framework for sequence data, by defining the sequence linking attack model and its associated countermeasure, a k-anonymity notion for sequence datasets, which provides a formal protection against the attack. Second, we instantiate this framework and provide a specific method for constructing the k-anonymous version of a sequence dataset, which preserves the results of sequential pattern mining, together with several basic statistics and other analytical properties of the original data, including the clustering structure. A comprehensive experimental study on realistic datasets of process-logs, web-logs and GPS tracks is carried out, which empirically shows how, in our proposed method, the protection of privacy meets analytical utility.

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


Biomolecular realizations of a parallel architecture for solving combinatorial problems A coherent approach to the problem of carrying out computations in aqueous solution is provided. The conceptual level of the presentation provides for many different molecular realizations to be explored in the future. Several possibilities are suggested. Our initial implementations have provided wet lab prototype computations for two of the classical NP complete graph theoretic problems: the maximum independent set problem and the minimum dominating set problem. A wet lab prototype computation is in progress for the determination of the satisfiability of sets of disjunctive clauses.

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

molecular computing
dna computing
aqueous computing
biocomputing
nanotechnology
flush memory


MaZda-A software package for image texture analysis MaZda, a software package for 2D and 3D image texture analysis is presented. It provides a complete path for quantitative analysis of image textures, including computation of texture features, procedures for feature selection and extraction, algorithms for data classification, various data visualization and image segmentation tools. initially, MaZda was aimed at analysis of magnetic resonance image textures. However, it revealed its effectiveness in analysis of other types of textured images, including X-ray and camera images. The software was utilized by numerous researchers in diverse applications. It was proven to be an efficient and reliable tool for quantitative image analysis, even in more accurate and objective medical diagnosis. MaZda was also successfully used in food industry to assess food product quality. MaZda can be downloaded for public use from the Institute of Electronics, Technical University of Lodz webpage. (c) 2008 Elsevier Ireland Ltd. All rights reserved.

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

texture analysis
data classification
image segmentation


posture monitoring and improvement for laptop use Both Repetitive Stress Injuries and laptop use have increased. The poor ergonomic design of laptops has the potential to create or exacerbate existing RSI. We propose a persuasive Attentive User Interface which provides feedback in order to improve user neck posture. This system measures the angle of the user.s neck and determines the quality of his/her neck posture. We then provide exercises to strengthen the neck and improve the user.s posture. We performed a study which showed an increase in neck comfort among our system.s users. The study demonstrated the potential of our system, which should be further tested.

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


Linear coordination method for fuzzy multi-objective linear programming problems with convex polyhedral membership functions A fuzzy multi-objective decision-making with nonlinear membership functions is proposed in this paper by assuming that the decision maker has a fuzzy goal for each objective function. The fuzzy goals can be quantified by convex polyhedral membership functions, which are expressed by linguistic terms. The concept of the convex cone is used to formulate a normalized convex polyhedral penalty function, which can also be considered conversely as a convex polyhedral membership function. The most desirable value of membership functions are selected to be reference membership values of achievement of convex polyhedral membership functions that can be viewed as the extension of the idea of reference point method. The formulated model can be solved by existing linear programming solvers and can find the satisficing solution for the decision maker, which can be derived efficiently from among an M-Pareto optimal solution set together with the trade-off rates between the membership functions. The proposed model uses convex polyhedral membership functions to represent vague aspirations of the decision maker. It enriches the existing satisficing methods for fuzzy multi-objective linear programming in. a more practical way with the effective method based on convex cone.

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

linear coordination
fuzzy goals
linguistic terms
convex polyhedral membership functions

multi-objective linear programming
m-pareto optimal solutions


A study on multi-dimensional products of graphs and hybrid logics In this work, we address some issues related to products of graphs and products of modal logics. Our main contribution is the presentation of a necessary and sufficient condition for a countable and connected graph to be a product, using a property called intransitivity. We then proceed to describe this property in a logical language. First, we show that intransitivity is not modally definable and also that no necessary and sufficient condition for a graph to be a product can be modally definable. Then, we exhibit a formula in a hybrid language that describes intransitivity. With this, we get a logical characterization of products of graphs of arbitrary dimensions. We then use this characterization to obtain two other interesting results. First, we determine that it is possible to test in polynomial time, using a model-checking algorithm, whether a finite connected graph is a product. This test has cubic complexity in the size of the graph and quadratic complexity in its number of dimensions. Finally, we use this characterization of countable connected products to provide sound and complete axiomatic systems for a large class of products of modal logics. This class contains the logics defined by product frames obtained from Kripke frames that satisfy connectivity, transitivity and symmetry plus any additional property that can be defined by a pure hybrid formula. Most sound and complete axiomatic systems presented in the literature are for products of a pair of modal logics, while we are able, using hybrid logics, to provide sound and complete axiomatizations for many products of arbitrary dimensions. (C) 2011 Elsevier B.V. All rights reserved.

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

products of graphs
intransitivity
products of modal logics
axiomatic systems


A Markovian Approach to Multipath Data Transfer in Overlay Networks The use of multipath routing in overlay networks is a promising solution to improve performance and availability of Internet applications, without the replacement of the existing TCP/IP infrastructure. In this paper, we propose an approach to distribute data over multiple overlay paths that is able to improve Quality of Service (QoS) metrics, such as the data transfer time, loss, and throughput. By using the Imbedded Markov Chain technique, we demonstrate that the system under analysis, observed at specific instants, possesses the Markov property. We therefore cast the data distribution problem into the Markov Decision Process (MDP) framework, and design a computationally efficient algorithm named Online Policy Iteration (OPI), to solve the optimization problem on the fly. The proposed approach is applied to the problem of multipath data distribution in various wired/wireless network scenarios, with the objective of minimizing the data transfer time as well as the delay and losses. Through both intensive ns-2 simulations with data collected from real heterogeneous networks and experiments over real networks, we show the superior performance of the proposed traffic control mechanism in comparison with two classical schemes, that are Weighted Round Robin and Join the Shortest Queue.

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

multipath data transfer
overlay networks
heterogeneous networks


Arterial hemodynamic analysis on non-enhanced magnetic resonance angiogram using optical flow Peripheral arterial disease (PAD) is one of the reasons caused to the lower extremity atherosclerotic disease. Its diagnosis is needed to obtain much kind of the information of vascular morphology as well as the blood flow information based on hemodynamics. The diagnosis of the PAD using magnetic resonance imaging (MRI) equipment without contrast medium is available as a useful visual screening in clinical practice. In this paper, we propose a novel method for visualizing hemodynamics to arterial images obtained by a non-contrast enhanced magnetic resonance angiography (MRA) based on the LucasKanade optical flow with the image pyramid processing, and satisfied experimental results are obtained.

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

pad
lucaskanade optical flow
image pyramid processing


Scalarization of Set-Valued Optimization Problems with Generalized Cone Subconvexlikeness in Real Ordered Linear Spaces In real ordered linear spaces, an equivalent characterization of generalized cone subconvexlikeness of set-valued maps is firstly established. Secondly, under the assumption of generalized cone subconvexlikeness of set-valued maps, a scalarization theorem of set-valued optimization problems in the sense of ?-weak efficiency is obtained. Finally, by a scalarization approach, an existence theorem of ?-global properly efficient element of set-valued optimization problems is obtained. The results in this paper generalize and improve some known results in the literature.

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

generalized cone subconvexlikeness
scalarization

set-valued map
?-weakly efficient solution
?-global properly efficient solution


Performance of data networks with random links We investigate simplified models of computer data networks and examine how the introduction of additional random links influences the performance of these networks. In general, the impact of additional random links on the performance of the network strongly depends on the routing algorithm used in the network. Significant performance gains can be achieved if the routing is based on 'geometrical distance' or shortest path reduced table routing. With shortest path full table routing degradation of performance is observed. (C) 1999 IMACS/Elsevier Science B.V. All rights reserved.

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

routing algorithms
network topology
network performance
congestion


Improved manufacturability of ZrO2 MIM capacitors by process stabilizing HfO2 addition A broad compositional range of the dielectric material Zr1?xHfxO2 was evaluated with respect to its applicability in DRAM storage capacitors. The paper reports on phase composition, crystallization behavior, and electrical properties of the mixed system in planar metal-insulator-metal (MIM) capacitors. Admixture of HfO2 into ZrO2 proved to stabilize the deposition process at high temperatures without degrading the dielectric properties of the film. Compared to pure ZrO2 the 3040% HfO2 containing films showed improved scalability (capacitance equivalent thickness 0.73nm at 8*10?9A/cm2) as well as improved reliability.

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

hafnium zirconate
high-k
metal-insulator-metal
capacitor
ald
hafnium
zirconium


Trend-surface analysis of morphometric parameters: A case study in southeastern Brazil Trend-surface analysis was carried out on data from morphometric parameters isobase and hydraulic gradient. The study area, located in the eastern border of Quadriltero Ferrfero, southeastern Brazil, presents four main geomorphological units, one characterized by fluvial dissection, two of mountainous relief, with a scarp of hundreds of meters of fall between them, and a flat plateau in the central portion of the fluvially dissected terrains. Morphometric maps were evaluated in GRASS-GIS and statistics were made on R statistical language, using the spatial package. Analysis of variance (ANOVA) was made to test the significance of each surface and the significance of increasing polynomial degree. The best results were achieved with sixth-order surface for isobase and second-order surface for hydraulic gradient. Shape and orientation of residual maps contours for selected trends were compared with structures inferred from several morphometric maps, and a good correlation is present.

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

r statistical language
analysis of variance

trend-surface analysis
morphometric analysis
geographic information systems
grass-gis


USING RULE STRUCTURE TO EVALUATE THE COMPLETENESS OF RULE-BASED SYSTEM TESTING: A CASE STUDY Rule-based systems are typically tested using a set of inputs which will produce known outputs. However, one does not know how thoroughly the software has been exercised. Traditional test-coverage metrics do not account for the dynamic data-driven flow of control in rule-based systems. Our literature review found that there has been little prior work on coverage metrics for rule-based systems. This paper proposes test-coverage metrics for rule-based systems derived from metrics defined by prior work, and presents an industrial scale case study. We conducted a case study to evaluate the practicality and usefulness of the proposed metrics. The case study applied the metrics to a system for computational fluid-dynamics models based on a rule-based application framework. These models were tested using a regression-test suite. The data-flow structure built by the application framework, along with the regression-test suite, provided case-study data. The test suite was evaluated against three kinds of coverage. The measurements indicated that complete coverage was not achieved, even at the lowest level definition. Lists of rules not covered provided insight into how to improve the test suite. The case study illustrated that structural coverage measures can be utilized to measure the completeness of rule-based system testing.

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

rule-based
loci
scientific computing
software engineering


ENTERPRISE FRAMEWORKS FOR DATA INTENSIVE WEB APPLICATIONS: AN END-USER DEVELOPMENT, MODEL BASED APPROACH This paper investigates enterprise frameworks in the context of data intensive web applications, and proposes an approach that integrates the paradigms of End User Development and Model Based development. An enterprise framework denotes a reusable, semi-complete application "skeleton" that can be easily adapted to produce custom software products in a specific business sector. Traditionally, it is conceived as a tool for expert software developers. In contrast, we propose to regard enterprise frameworks as tools that enable domain experts to develop for data intensive web applications in a given field without the need of technological training or support by expert programmers. We propose the adoption of a model-driven process for framework-enabled development, based on conceptual models that are appropriate for the framework domain and domain experts can understand, adapt, and customize. We discuss requirements for and benefits of combining the two paradigms, and exemplify our approach presenting CHEF, an enterprise framework for data-intensive multichannel web applications in the domain of cultural heritage and cultural tourism. CHEF has been developed in the context of a wide international initiative called MEDINA and has been intensively evaluated in this and other projects.

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

data intensive web application
web model
web design
end-user development
meta design


Meromorphic functions sharing one finite set Let f and g be two nonconstant meromorphic functions. If Theta(infinity, f) + Theta(infinity, g) > 3/2, then there exists a set S with seven elements such that E(S, f) = E(S, g) implies f equivalent to g. (C) 2003 Elsevier Science Ltd. All rights reserved.

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

meromorphic function
sharing set
unicity


On the nucleolus of neighbor games Assignment problems are well-known problems in practice. We mention house markets, job markets, and production planning. The games of interest in this paper, the neighbor games, arise from a special class of assignment problems. We focus on the nucleolus [D. Schmeidler, SIAM J. Appl. Math. 17 (1969) 11631170], one of the most prominent core solutions. A core solution is interesting with respect to neighbor games because it divides the profit of an optimal matching in a stable manner. This paper establishes a polynomial bounded algorithm of quadratic order in the number of players for calculating the nucleolus of neighbor games.

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


anomalous window discovery through scan statistics for linear intersecting paths (sslip) Anomalous windows are the contiguous groupings of data points. In this paper, we propose an approach for discovering anomalous windows using Scan Statistics for Linear Intersecting Paths (SSLIP). A linear path refers to a path represented by a line with a single dimensional spatial coordinate marking an observation point. Our approach for discovering anomalous windows along linear paths comprises of the following distinct steps: (a) Cross Path Discovery: where we identify a subset of intersecting paths to be considered, (b) Anomalous Window Discovery: where we outline three order invariant algorithms, namely SSLIP, Brute Force-SSLIP and Central Brute Force-SSLIP, for the traversal of the cross paths to identify varying size directional windows along the paths. For identifying an anomalous window we compute an unusualness metric, in the form of a likelihood ratio to indicate the degree of unusualness of this window with respect to the rest of the data. We identify the window with the highest likelihood ratio as our anomalous window, and (c) Monte Carlo Simulations: to ascertain whether this window is truly anomalous and not just a random occurrence we perform hypothesis testing by computing a p-value using Monte Carlo Simulations. We present extensive experimental results in real world accident datasets for various highways with known issues(code and data available from [27], [21]). Our results show that our approach indeed is effective in identifying anomalous traffic accident windows along multiple intersecting highways.

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

anomalous window discovery
intersecting paths


The Nornet Edge platform for mobile broadband measurements We present Nornet Edge (NNE), a dedicated infrastructure for measurements and experimentation in mobile broadband networks. NNE is unprecedented in size, consisting of more than 400 measurement nodes geographically distributed all over Norway. Each measurement node is a Linux-based embedded computer, and is connected to multiple mobile broadband providers. In addition, NNE includes an extensive backend system for deploying and managing experiments and collecting data. NNE makes it possible to run long-term measurement experiments to assess and compare quality and performance across different network operators on a national scale. Particular focus is put on allowing experiments to run in parallel on multiple network connections, and on collecting rich context information related to the experiments. In this paper we give a detailed presentation of NNE, and describe three different measurement experiments that illustrate how the infrastructure can be used. We also provide a roadmap for further development of NNE.

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

nornet edge
mobile broadband
measurements


Aggregate-level demand management in evacuation planning Without successful large-scale regional evacuations, threats such as hurricanes and wild-fires can cause a large loss of life. In this context, automobiles are oftentimes an essential transportation mode for evacuations, but the ensuing traffic typically overwhelms the roadway capacity and causes congestion on a massive scale. Congestion leads to many problems including longer, costlier, and more stressful evacuations, lower compliance rates, and increased risk to the population. Supply-based strategies have traditionally been used in evacuation planning, but they have been proven to be insufficient to reduce congestion to acceptable levels. In this paper, we study the demand-based strategies of aggregate-level staging and routing to structure the evacuation demand, both with and without congestion. We provide a novel modeling framework that offers strategic flexibility and utilizes a lexicographic objective function that represents a hierarchy of relevant evacuation-based goals. We also provide insights into the nature and effect of network bottlenecks. We compare our model with and without congestion in relation to tractability, normative optimality, and robustness under demand uncertainty. We also show the effectiveness of using demand-based strategies as opposed to using the status quo that involves a non-staged or simultaneous evacuation process. Effective solution procedures are developed and tested using hypothetical problem instances as well as using a larger study based on a portion of coastal Virginia, USA.

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


RONoC: A Reconfigurable Architecture for Application-Specific Optical Network-on-Chip Optical Network-on-Chip (ONoC) is a promising emerging technology, which can solve the bottlenecks faced by electrical on-chip interconnection. However, the existing proposals of ONoC are mostly built on fixed topologies, which are not flexible enough to support various applications. To make full use of the limited resource and provide a more efficient approach for resource allocation, RONoC (Reconfigurable Optical Network-on-Chip) is proposed in this letter. The topology can be reconfigured to meet the requirement of different applications. An 8x8 nonblocking router is also designed, together with the communication mechanism. The simulation results show that the saturation load of RONoC is 2 times better than mesh, and the energy consumption is 25% lower than mesh.

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

reconfiguration
optical network-on-chip
application-specific
optical router


Reality based modeling and simulation of gallbladder shape deformation using variational methods Accurate soft tissue deformation modeling is important for realistic surgical simulation. The aim of this study is to develop a reality-based gallbladder model and to determine material constants that represent gallbladder wall mechanical properties.

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

tissue deformation
modeling
simulation
variational methods


Asymptotically Optimal Merging on ManyCore GPUs We propose a family of algorithms for efficiently merging on contemporary GPUs, so that each algorithm requires O(m log(n/m + 1)) element comparisons, where m and n are the sizes of the input sequences with m <= n. According to the lower bounds for merging all proposed algorithms are asymptotically optimal regarding the number of necessary comparisons. First we introduce a parallely structured algorithm that splits a merging problem of size 2(l) into 2(i) subproblems of size 2(l-i), for some arbitrary i with (0 <= i <= l). This algorithm represents a merger for i = 1 but it is rather inefficient in this case. The efficiency is boosted by moving to a two stage approach where the splitting process stops at some predetermined level and transfers control to several parallely operating block-mergers. We formally prove the asymptotic optimality of the splitting process and show that for symmetrically sized inputs our approach delivers up to 4 times faster runtimes than the thrust: :merge function that is part of the Thrust library. For assessing the value of our merging technique in the context of sorting we construct and evaluate a MergeSort on top of it. In the context of our benchmarking the resulting MergeSort clearly outperforms the MergeSort implementation provided by the Thrust library as well as Cederman's GPU optimized variant of QuickSort.

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


The Finite Patch Method: a nodal equation method based on FEM The recently developed (Finite) Patch Method is introduced. In these equations for a patch of finite elements are rearranged to obtain a patch matrix E. This provides equations for corner, edge and interior nodes of a domain, which are then solved by relaxation. The method is similar to the classical FDM except that FEM is used to form equations and thus equations for boundary nodes are automatically included. The method is applied to potential and plane stress problems and problems including line elements and irregular boundaries.

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

finite difference method
finite element method
potential problems
rectangular basis
triangular basis


Segmentation-based multi-class semantic object detection In this paper we study the problem of the detection of semantic objects from known categories in images. Unlike existing techniques which operate at the pixel or at a patch level for recognition, we propose to rely on the categorization of image segments. Recent work has highlighted that image segments provide a sound support for visual object class recognition. In this work, we use image segments as primitives to extract robust features and train detection models for a predefined set of categories. Several segmentation algorithms are benchmarked and their performances for segment recognition are compared. We then propose two methods for enhancing the segments classification, one based on the fusion of the classification results obtained with the different segmentations, the other one based on the optimization of the global labelling by correcting local ambiguities between neighbor segments. We use as a benchmark the Microsoft MSRC-21 image database and show that our method competes with the current state-of-the-art.

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


Analysis of parametrically excited laminated composite joined conical-cylindrical shells The dynamic instability analysis of a joined conical and cylindrical shell subjected to periodic in-plane load is investigated using C-0 two-noded sheer flexible shell element. The formulation is based on first-order shear deformation theory. The present model accounts for in-plane and rotary inertia effects. The instability regions are determined based on the principle of Bolotin's method. The boundaries of the principal instability region obtained here are conveniently represented in the non-dimensional excitation frequency - non-dimensional load amplitude plane. The influence of various parameters such as orthotropicity, cone angle, lay-up, combinations of different sections, thickness ratio, circumferential wave number, static load, and external pressure on the dynamic stability regions of cross-ply laminates is brought out. (C) 2000 Elsevier Science Ltd. All rights reserved.

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

instability
laminates
external pressure
periodic

conical-cylindrical
in-plane load
finite element


Colorization of CT images to improve tissue contrast for tumor segmentation Segmenting tumors from grayscale medical image data can be difficult due to the close intensity values between tumor and healthy tissue. This paper presents a study that demonstrates how colorizing CT images prior to segmentation can address this problem. Colorizing the data a priori accentuates the tissue density differences between tumor and healthy tissue, thereby allowing for easier identification of the tumor tissue(s). The method presented allows pixels representing tumor and healthy tissues to be colorized distinctly in an accurate and efficient manner. The associated segmentation process is then tailored to utilize this color data. It is shown that colorization significantly decreases segmentation time and allows the method to be performed on commodity hardware. To show the effectiveness of the method, a basic segmentation method, thresholding, was implemented with and without colorization. To evaluate the method, False Positives (FP) and False Negatives (FN) were calculated from 10 datasets (476 slices) with tumors of varying size and tissue composition. The colorization method demonstrated statistically significant differences for lower FP in nine out of 10 cases and lower FN in five out of 10 datasets.

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


The zoo of tree spanner problems ? Tree spanner problems have important applications in network design, e.g. in the telecommunications industry. Mathematically, there have been considered quite a number of max-stretch tree spanner problems and of average stretch tree spanner problems. We propose a unified notation for 20 tree spanner problems, which we investigate for graphs with general positive weights, with metric weights, and with unit weights. This covers several prominent problems of combinatorial optimization. Having this notation at hand, we can clearly identify which problems coincide. In the case of unweighted graphs, the formally 20 problems collapse to only five different problems. Moreover, our systematic notation for tree spanner problems enables us to identify a tree spanner problem whose complexity status has not been solved so far. We are able to provide an NP-hardness proof. Furthermore, due to our new notation of tree spanner problems, we are able to detect that an inapproximability result that is due to Galbiati [On minmax cycle bases, in: P. Eades, T. Takaoka (Eds.), ISAAC, Lecture Notes in Computer Science, vol. 2223, Springer, Berlin, 2001, pp. 116123; On finding cycle bases and fundamental cycle bases with a shortest maximal cycle, Inform. Process. Lett. 88(4) (2003) 155159] in fact applies to the classical max-stretch tree spanner problem. We conclude that the inapproximability factor for this problem thus is 2-? 2 - ? , instead of only 1 + 5 2 ? 1.618 according to Peleg and Reshef [A variant of the arrow distributed directory with low average complexity, in: J. Wiedermann, P. van Emde Boas, M. Nielsen (Eds.), ICALP, Lecture Notes in Computer Science, vol. 1644, Springer, Berlin, 1999, pp. 615624].

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

tree spanner
fundamental cycle bases
complexity
combinatorial optimization


On a FeasibleInfeasible Two-Population (FI-2Pop) genetic algorithm for constrained optimization: Distance tracing and no free lunch We explore data-driven methods for gaining insight into the dynamics of a two-population genetic algorithm (GA), which has been effective in tests on constrained optimization problems. We track and compare one population of feasible solutions and another population of infeasible solutions. Feasible solutions are selected and bred to improve their objective function values. Infeasible solutions are selected and bred to reduce their constraint violations. Interbreeding between populations is completely indirect, that is, only through their offspring that happen to migrate to the other population. We introduce an empirical measure of distance, and apply it between individuals and between population centroids to monitor the progress of evolution. We find that the centroids of the two populations approach each other and stabilize. This is a valuable characterization of convergence. We find the infeasible population influences, and sometimes dominates, the genetic material of the optimum solution. Since the infeasible population is not evaluated by the objective function, it is free to explore boundary regions, where the optimum is likely to be found. Roughly speaking, the No Free Lunch theorems for optimization show that all blackbox algorithms (such as Genetic Algorithms) have the same average performance over the set of all problems. As such, our algorithm would, on average, be no better than random search or any other blackbox search method. However, we provide two general theorems that give conditions that render null the No Free Lunch results for the constrained optimization problem class we study. The approach taken here thereby escapes the No Free Lunch implications, per se.

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

constrained optimization
blackbox search
no free lunch


Location of critical three-dimensional non-spherical failure surface by NURBS functions and ellipsoid with applications to highway slopes At present, location of critical three-dimensional failure surfaces is mainly limited to spherical shape due to the various difficulties in performing global optimization for general non-spherical failure surface. Non-spherical failure surface is however the most general and critical shape that should be considered in slope stability analysis. This paper introduces a practical way in using NURBS surface and ellipsoidal surface to simulate a three-dimensional sliding surface. Numerical examples have indicated that the present proposal is effective in application and the critical failure surfaces as determined for 2 specially designed problems are also reasonable. The authors have also applied the optimization search to a curved highway slope and have obtained the relation between curvature of slope and the minimum factors of safety of slope.

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


Perspectives on tight junction research The tight junction connects neighboring epithelial or endothelial cells. As a general function, it seals the paracellular pathway and thus prevents back-leakage of just transported solutes and water. However, not all tight junctions are merely tight: some tight junction proteins build their own transport pathways by forming channels selective for small cations, anions, or water. Two families of tight junction proteins have been identified, claudins (27 members in mammals) and tight junction-associated MARVEL proteins ((TAMPs) occludin, tricellulin, and MarvelD3); an additional, structurally different, junction protein is junction adhesion molecule (JAM). Besides classification by genetic or molecular kinship, classification of tight junction proteins has been suggested according to permeability attributes. Recent studies describe specific cis and trans interactions and manifold physiologic regulations of claudins and TAMPs. In many inflammatory and infectious diseases they are found to be altered, for example, causing adversely increased permeability. Currently, attempts are being made to alter the paracellular barrier for therapeutic interventions or for transiently facilitating drug uptake. This overview concludes with a list of open questions and future topics in tight junction research.

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

paracellular channel
claudin
inflammatory bowel disease


A deformation-aware hierarchical framework for shape-preserving editing of static and time-varying mesh data The hierarchical representation is built by a deformation-aware simplification. The shape features are iteratively preserved using a set of rigid transformations. The spacetime deformation, deformation transfer and shape interpolation are addressed.

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

shape-preserving editing
static and time-varying mesh data
deformation-aware simplification
rigid transformation


On binary resilient functions Using a lifting formula for the coefficients of Boolean functions, we characterize binary resilient functions as binary matrices with certain row or column intersection properties. We give some new constructions of binary resilient functions based on this characterization. In particular, we show that the incidence matrix of a Steiner system can be used to construct binary resilient functions.

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

boolean function
correlation-immune function
design
resilient function
orthogonal array


a versatile large-scale multimodal vr system for cultural heritage visualization We describe the development and evaluation of a large-scale multimodal virtual reality simulation suitable for the visualization of cultural heritage sites and architectural planning. The system is demonstrated with a reconstruction of an ancient Greek temple in Messene that was created as part of a EU funded cultural heritage project (CREATE). The system utilizes a CAVE-like theatre consisting of head-tracked user localization, a haptic interface with two arms, and 3D sound. The haptic interface was coupled with a realistic physics engine allowing users to experience and fully appreciate the effort involved in the construction of architectural components and their changes through the ages. Initial user-based studies were carried out, to evaluate the usability and performance of the system. A simple task of stacking blocks was used to compare errors and timing in a haptics-enabled system with a haptics-disabled system. In addition, a qualitative study of the final system took place while it was installed in a museum.

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

multimodal interfaces
virtual heritage
haptics


transparent replication for fault tolerance in distributed ada 95 In this paper we present the foundations of RAPIDS ("Replicated Ada Partitions In Distributed Systems"), an implementation of the PCS supporting the transparent replication of partitions in distributed Ada 95 using semi-active replication. The inherently non-deterministic executions of multi-tasked partitions are modeled as piecewise deterministic histories. I discuss the validity and correctness of this model of computation and show how it can be used for efficient semi-active replication. The R APIDS prototype ensures that replicas of a partition all go through the same history and are hence consistent.

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

piecewise determinism
semi-active replication
group communication


an adaptive multi-criteria vertical handover framework for heterogeneous networks Future wireless Internet is expected to consist of various heterogeneous wireless access networks with different properties to support different type of services. In order to improve the accuracy of the vertical handover decision for such heterogeneous networks, this paper proposes an adaptive multi-criteria vertical handover framework. This framework focuses on several main aspects of a vertical handover. It is able to trigger a handover intelligently and make a handover decision effectively and adaptively.

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


Brain-like Computing Based on Distributed Representations and Neurodynamics A key to overcoming the limitations of classical artificial intelligence and to deal well with enormous amounts of information might be brain-like computing in which distributed representations of information are processed by dynamical systems without using symbols. We present a, method for such computing. We constructed an inference system using a non monotone neural network, which is a kind of recurrent neural network with continuous-time dynamics. This system deduces a conclusion according to state transitions of the network in which knowledge is embedded as trajectory attractors. It has the powerful ability of analogical reasoning without special treatment for exceptional knowledge. We also propose a method of linking different neurodynamical systems and show that two mutually interacting systems can process complex spatiotemporal patterns.

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

nonmonotone neural network
selective desensitization
brain-like information processing


Studying knowledge management in information systems research: Discourses and theoretical assumptions In information systems, most research on knowledge management assumes that knowledge has positive implications for organizations. However, knowledge is a double-edged sword: while too little might result in expensive mistakes, too much might result in unwanted accountability. The purpose of this paper is to highlight the lack of attention paid to the unintended consequences of managing organizational knowledge and thereby to broaden the scope of IS-based knowledge management research. To this end, this paper analyzes the IS literature on knowledge management. Using a framework developed by Deetz (1996), research articles published between 1990 and 2000 in six IS journals are classified into one of four scientific discourses. These discourses are the normative, the interpretive, the critical, and the dialogic. For each of these discourses, we identify the research focus, the metaphors of knowledge, the theoretical foundations, and the implications apparent in the articles representing it. The metaphors of knowledge that emerge from this analysis are knowledge as object, asset, mind, commodity, and discipline. Furthermore, we present a paper that is exemplary of each discourse. Our objective with this analysis is to raise IS researchers' awareness of the potential and the implications of the different discourses in the study of knowledge and knowledge management.

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


Adaptive thresholding of sequences with locally variable strength This paper addresses, via thresholding, the estimation of a possibly sparse signal observed subject to Gaussian noise. Conceptually, the optimal threshold for such problems depends upon the strength of the underlying signal. We propose two new methods that aim to adapt to potential local variation in this signal strength and select a variable threshold accordingly. Our methods are based upon an empirical Bayes approach with a smoothly variable mixing weight chosen via either spline or kernel based marginal maximum likelihood regression. We demonstrate the excellent performance of our methods in both one and two-dimensional estimation when compared to various alternative techniques. In addition, we consider the application to wavelet denoising where reconstruction quality is significantly improved with local adaptivity.

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

kernel smoothing
locally adaptive
spline smoothing
wavelets


EFFICIENCY ANALYSIS OF THE TIME-SHUFFLING METHOD FOR THE EVOLUTION OF AGENT BEHAVIOR We have analyzed the effectiveness and the efficiency of a time-shuffling method applied to an evolutionary algorithm scheme in order to optimize the behavior of autonomous agents in a multi-agent system. The multi-agent system is modeled as cellular automata (CA) because of the inherent parallelism of the model, which suits well the requirements of a system of autonomous moving agents with a local view. The task of the agents is the all-to-all communication, i. e., all agents shall communicate their initially mutually exclusive information to all other agents. The agents' uniform behavior is defined by a finite-state machine, which is evolved by a genetic algorithm (GA). 20 different initial two-dimensional environments were defined as a training set, 10 of them with border, 10 with cyclic wrap-around. The state machine was evolved (1) directly by a GA for all 20 environments, and (2) indirectly by two separate GAs for the 10 environments with border and the 10 environments with wrap-around, with a subsequent time-shuffling technique in order to integrate the good abilities from both of the separately evolved state machines. The time-shuffling technique alternates two state machines periodically. The results show that time-shuffling two separately evolved state machines is effective and much more efficient than the direct application of the GA.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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
time-shuffling
multi-objective optimization


Finite element analysis of the steel quenching process: Temperature field and solid-solid phase change This paper deals with a finite element analysis of the steel quenching process; regarding the transient temperature field and the thermally induced solid-solid phase transformations. All the process steps, i.e. heating, holding, and cooling, have been considered, modeling both the austenite formation and decomposition and taking into account nucleation and growth processes. The final hardness distribution into the quenched sample has been predicted according to the rule of mixtures, taking into account the chemical composition of the processing material, the final distribution of each phase and the local cooling rate. (C) 2009 Elsevier Ltd. All rights reserved.

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

quenching process
finite element analysis
temperature
phase change


Computation of unsteady flows with moving boundaries using body fitted curvilinear moving grids An algorithm is proposed for the computation of unsteady incompressible laminar flows involving moving boundaries using body-fitted coordinates. It is shown analytically and numerically that if the non-conservative form of equations (only suitable for incompressible flows) is utilized, a uniform flow field when substituted in the transport equations does not lead to any spurious terms. Therefore, computation of incompressible flows on moving or deforming grids with this methodology would eliminate any consideration like the geometrical conservation law. The results of the bench mark cases show that the procedure is quite robust and yields accurate 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

fluidstructure interaction
fsi
geometrical conservation law (gcl)
body-fitted grids


SME ERP system sourcing strategies: a case study Purpose - The purpose of this paper is to identify ERP system sourcing strategies available to SMEs and to provide insights from a case study of the practices applied and decisions made by an SME in using a hybrid of sourcing resources to implement the successful conversion of their legacy ERP system to a new information technology (IT) environment. Design/methodology/approach - This research is a case study utilizing various data sources including face-to-face interviews, informal conversations, and e-mails with members of the case company. Company software applications and documents were examined and employees were observed in action. The analysis compares characteristics of the client-vendor relationship of the case company with findings from relevant outsourcing literature. Findings - This case study identified, among others, the following practices that were critical to the case company in their outsourcing endeavors: attending networking events for SMEs, obtaining formal contract for ownership of intellectual property, utilizing local vendor contact point for communication with offshore contact point, and utilizing vendor's skill-set for specialized resources. Practical implications - This case study relates practice with theory, providing a reference for both academia and practitioners. Originality/value - The decision making and practices described in this paper provide insights that may be useful to organizations considering IT software implementations. ERP systems are increasingly more affordable for SMEs and offshore outsourcing is becoming more accessible; therefore, SMEs considering these options may benefit from Kanebridge's experience.

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

manufacturing resource planning
small to medium-sized enterprises


Valid inequalities for the single-item capacitated lot sizing problem with step-wise costs This paper presents a new class of valid inequalities for the single-item capacitated lot sizing problem with step-wise production costs (LS-SW). Constant sized batch production is carried out with a limited production capacity in order to satisfy the customer demand over a finite horizon. A new class of valid inequalities we call mixed flow cover, is derived from the existing integer flow cover inequalities by a lifting procedure. The lifting coefficients are sequence independent when the batch sizes (V) and the production capacities (P) are constant and when V divides P. When the restriction of the divisibility is removed, the lifting coefficients are shown to be sequence independent. We identify some cases where the mixed flow cover inequalities are facet defining. We propose a cutting plane algorithm for different classes of valid inequalities introduced in the paper. The exact separation algorithm proposed for the constant capacitated case runs in polynomial time. Computational results show the efficiency of the new class mixed flow cover compared to the existing methods.

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

flow cover inequalities
cutting plane algorithm


A way of updating the density function for the design of the drum Designing an acoustic drum can be categorized into a class of eigenvalue optimization problems in the structural engineering area. In this paper, we propose an algorithm that is based on the Gteaux derivative of the objective function with respect to the density functions and analyze our algorithm in detail. In the algorithm, we deal with the geometry constraint by exchanging the densities of two domains occupied by two kinds of different materials. Finally we apply this algorithm to some practical examples frequently used by the researchers and present some numerical results to show its feasibility, stability and efficiency.

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

finite element method
shape optimization
the weight


A framework of an intelligent quality function deployment (IQFD) for discrete assembly environment This research work provides the methodology for the development of intelligent quality function deployment (IQFD) application in the discrete parts, assembly environment. The paper is composed of the background of QFD, related research work review and points for developing in assembly environment. Then, the paper describes about the needs of development on intelligent QFD due to uncertainty on the available human experts in product development and expansion. The paper applied the proposed methodology on the case study of the personal computer assembly. IQFD was developed in Microsoft Excel environment with the Visual Basic language. (C) 2003 Elsevier Science Ltd. All rights reserved.

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

voices of customer
analytical hierarchy process
neural network


Transformation frameworks and their relevance in universal design Music, engineering, mathematics, and many other disciplines have established notations for writing their documents. Adjusting these notations can contribute to universal access by helping to address access difficulties, such as disabilities, cultural backgrounds, or restrictive hardware. Tools that support the programming of such transformations can also assist by allowing the creation of new notations on demand, which is an under-explored option in the relief of educational difficulties. This paper reviews some programming tools that can be used to effect such transformations. It also introduces a tool, called 4DML, which allows the programmer to create a model of the desired result, from which the transformation is derived.

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


High-Accuracy Sub-Pixel Registration for Noisy Images Based on Phase Correlation This paper proposes a high-accuracy sub-pixel registration framework based on phase correlation for noisy images. First we introduce a denoising module, where the edge-preserving filter is adopted. This strategy not only filters off the noise but also preserves most of the original image signal. A confidence-weighted optimization module is then proposed to fit the linear phase plane discriminately and to achieve sub-pixel shifts. Experiments demonstrate the effectiveness of the combination of our modules and improvements of the accuracy and robustness against noise compared to other sub-pixel phase correlation methods in the Fourier domain.

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

sub-pixel
edge-preserving filter
confidence-weighted optimization


Is there power in PowerPoint? A field test of the efficacy of PowerPoint on memory and recall of religious sermons The purpose of this study was to determine if the use of PowerPoint as an information communication tool would enhance recall of information presented in a non-classroom field setting. We examined the effect of PowerPoint on the recall of information presented in religious sermons. Three test conditions were examined: (1) PowerPoint slides containing words only, (2) slides containing visual images only, and (3) slides containing both words and visual images, along with a control condition in which information was presented without the use of the PowerPoint slides. In addition, we tested the type of information recall: information about the slides, information about the slide content, and general recall of information from the sermon. While there were limited differences in recall based on the treatment conditions and the type of information being recalled, overall the use of the PowerPoint slides did not appear to have a significant effect on subjects ability to recall information. We conclude that greater effort must be made to understand the effects of PowerPoint presentations on human memory and cognition.

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

powerpoint
memory
recall
field setting
religious sermons


Developing a computerized data collection and decision support system for cancer pain management Contemporary nursing practice needs reengineering to deliver its,service effectively and efficiently. Using computer technology to support clinicians' decision making may be a parsimonious way to provide high-quality, patient-centered, efficient care. The process of developing the PAINReportlt and PAINConsultN system is described, and the results of two pilot studies in which the system was tested are summarized. The feasibility of using the system to assess pain and provide decision support for clinicians is demonstrated. The findings show PAINReportlt to be promising as an effective, efficient way for patients to report their pain. Whether PAINConsultN is an effective answer to cancer pain management barriers warrants further evaluation with larger samples. The advantages of using the system, as compared with use of the traditional pain management process, are discussed.

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

decision support system
pain management
computer


Aligning the economic modeling of software reuse with reuse practices In contrast to current practices where software reuse is applied recursively and reusable assets are tailored trough parameterization or specialization, existing reuse economic models assume that (i) the cost of reusing a software asset depends on its size and (ii) reusable assets are developed from scratch. The contribution of this paper is that it provides modeling elements and an economic model that is better aligned with current practices. The functioning of the model is illustrated in an example. The example also shows how the model can support practitioners in deciding whether it is economically feasible to apply software reuse recursively.

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

reuse economic model
composition
variation


High order ADI method for solving unsteady convectiondiffusion problems We propose a high order alternating direction implicit (ADI) solution method for solving unsteady convectiondiffusion problems. The method is fourth order in space and second order in time. It permits multiple use of the one-dimensional tridiagonal algorithm with a considerable saving in computing time, and produces a very efficient solver. It is shown through a discrete Fourier analysis that the method is unconditionally stable for 2D problems. Numerical experiments are conducted to test its high accuracy and to compare it with the standard second-order PeacemanRachford ADI method and the spatial third-order compact scheme of Noye and Tan.

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

unsteady convectiondiffusion equation
high order compact scheme
stability


Optimal algorithms for two group testing problems, and new bounds on generalized superimposed codes Two variants of the well-known group testing problem are considered. In the first variant a finite set of items O and an unknown subset P subset of O are given, and one wants to identify the set P by asking the least number of questions of the form "Is |Q boolean AND P| = 1?", where Q subset of O. This problem naturally arises in the design of efficient contention resolution algorithms for certain random multiple-access communication systems [Berger et al. "Random multiple-access communication and group testing," IEEE Trans. Commun., vol. 32, no. 7, pp. 769-779, 1984]. In the second variant of the problem, the answer to the question "Is |Q boolean AND P| = 1?" is correctly YES if |Q boolean AND P| = 1 and NO if |Q boolean AND P| = 0", and it is left to a (possibly malicious) adversary otherwise. This model was introduced in [Damaschke, "Randomized group testing for mutually obscuring defectives," Inf. Process. Lett., vol. 67, pp. 131-135, 1998], in the context of chemical compound testing. In this correspondence several algorithms for these group testing problems are presented, trying to optimize different measures of performance: The overall number of tests performed by the algorithm, the number of stages in which tests can be arranged, and the decoding complexity of identifying the elements of P from tests outcomes. Some of the given algorithms are optimal with respect to more than one of the above criteria. Instrumental to the results presented in the correspondence are new and improved bounds on certain generalization of superimposed codes introduced in [Dyachkov and Rykov, "A generalization of superimposed codes and its application to the multiple-access channel," in Proc. 1984 IEEE Int. Symp. Inf. Theory, pp. 62-64], [De Bonis and Vaccaro, "Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels' " Theoretic. Comput. Sci., vol. 306, no. 1-3, pp. 223-243, 2003] a result that it is believed to be of independent interest.

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


On the convexity of the multiplicative potential and penalty functions and related topics It is well known that a function f of the real variable x is convex if and only if (x, y) --> yf(y(-1)x), y > 0 is convex. This is used to derive a recursive proof of the convexity of the multiplicative potential function. In this paper, we obtain a conjugacy formula which gives rise, as a corollary, to a new rule for generating new convex functions From old ones. In particular, it allows to extend the aforementioned property to functions ol the form (x, y) --> g(y)f(g(y)(-1)x) and provides a new tool for the study of the multiplicative potential and penalty functions.

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


Composable Thermal Modeling and Simulation for Architecture-Level Thermal Designs of Multicore Microprocessors Efficient temperature estimation is vital for designing thermally efficient, lower power and robust integrated circuits in nanometer regime. Thermal simulation based on the detailed thermal structures no longer meets the demanding tasks for efficient design space exploration. The compact and composable model-based simulation provides a viable solution to this difficult problem. However, building such thermal models from detailed thermal structures was not well addressed in the past. In this article, we propose a new compact thermal modeling technique, called ThermComp, standing for thermal modeling with composable modules. ThermComp can be used for fast thermal design space exploration for multicore microprocessors. The new approach builds the composable model from detailed structures for each basic module using the finite difference method and reduces the model complexity by the sampling-based model order reduction technique. These composable models are then used to assemble different multicore architecture thermal models and realized into SPICE-like netlists. The resulting thermal models can be simulated by the general circuit simulator SPICE. ThermComp tries to preserve the accuracy of fine-grained models with the speed of coarse-grained models. Experimental results on a number of multicore microprocessor architectures show the new approach can easily build accurate thermal systems from compact composable models for fast architecture thermal analysis and optimization and is much faster than the existing HotSpot method with similar accuracy.

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

design
composable
multicore
thermal modeling


Runge-Kutta discontinuous Galerkin method using WENO limiters II: Unstructured meshes In [J. Qiu, C.-W. Shu, Runge-Kutta discontinuous Galerkin method using WENO limiters, SIAM Journal on Scientific Computing 26 (2005) 907-929], Qiu and Shu investigated using weighted essentially non-oscillatory (WENO) finite volume methodology as limiters for the Runge-Kutta discontinuous Galerkin (RKDG) methods for solving nonlinear hyperbolic conservation law systems on structured meshes. In this continuation paper, we extend the method to solve two-dimensional problems on unstructured meshes, with the goal of obtaining a robust and high order limiting procedure to simultaneously obtain uniform high order accuracy and sharp, nonoscillatory shock transition for RKDG methods. Numerical results are provided to illustrate the behavior of this procedure. (C) 2008 Elsevier Inc. All rights reserved.

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

runge-kutta discontinuous galerkin method


A non-parametric approach to shape reconstruction from planar point sets through Delaunay filtering ? A fully automatic algorithm using the structural properties of Delaunay triangles. External boundary as well as an internal hole detection have been addressed. Demonstrate the efficacy with varying point set densities and distributions. Theoretical guarantee of the algorithm has been presented.

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

delaunay triangulation
relaxed gabriel graph
? ? -shape ? ? ? ? ?


Soft computing for feature analysis With an introduction to soft computing we discuss how the three main ingredients, fuzzy logic, neural networks and genetic algorithms can play significant roles in the design of successful pattern recognition systems. Then we concentrate only on one aspect of pattern recognition, feature analysis, and discuss various methods using fuzzy logic, neural networks and genetic algorithms for feature ranking, selection and extraction including structure preserving dimensionality reduction. Finally, the methods are illustrated with both real and synthetic data. (C) 1999 Elsevier Science B.V. All rights reserved.

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

soft computing
dimensionality reduction
feature ranking

feature selection
connectionist models
feature attenuators


Modelling urban transportation emissions: role of GIS In the development of methodology that can assist the decision-making process for reducing vehicle emissions in urban areas, the benefit of using geographic information systems (GIS) in enhancing the reliability of data is indeed significant. There are other positive features that could be used to enhance analyses and to prepare information in support of decision-making. These include: visualization of analysis results, improved communication with decision-makers, new analytical tools for testing transport technology innovations and investigating travel behaviour. This paper reports the methodological framework that is required for analysing the emission implications of measures that are intended to reduce vehicle emissions in urban transportation. A case study of the National Capital Region (NCR) Canada is used for illustration purposes. The overall framework for urban transportation planning, including emissions estimation, is introduced. The role of GIS is highlighted in terms of enhancing the reliability of data. Methodologies are noted that serve as an interface between travel analysis and emissions estimation. An emissions calculator is described that enables the estimation of air quality pollutants and greenhouse gas emissions. Finally, results of selected scenarios are presented.

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

gis
urban transportation
vehicle emissions
planning


Scheduling of inventory releasing jobs to minimize a regular objective function of delivery times In this note we provide new complexity and algorithmic results for scheduling inventory releasing jobs, a new class of single machine scheduling problems proposed recently by Boysen et al. We focus on tardiness related criteria, while known results are concerned with inventory levels between fixed delivery points. Our interest is motivated by the fact that deciding whether a feasible schedule exists is NP-hard in the strong sense, provided that all delivery deadlines are fixed, and there are no restrictions on the amount of products released by the jobs, nor on the job processing times. We will establish NP-hardness results, or provide polynomial or pseudo-polynomial time algorithms for various special cases, and describe a fully polynomial approximation scheme for one of the variants with the maximum tardiness criterion.

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

machine scheduling
inventory
approximation scheme


Design, fabrication, and preliminary characterization of a novel MEMS bionic vector hydrophone According to the auditory principle of fish's lateral line organ, a novel microelectromechanical systems (MEMS) bionic vector hydrophone used for obtaining vector information of underwater sound field is introduced in this paper. It is desirable that the application of MEMS-based piezoresistive effect and bionics structure may improve the low-frequency sensitivity of the vector hydrophone as well as its miniaturization. The bionic structure consists of two parts: high-precision four-beam microstructure and rigid plastic cylinder which is fixed at the center of the microstructure. The piezoresistor located at the beam is simulated to the hair cell of lateral line and the rigid plastic cylinder is simulated to stereocilia. When the plastic cylinder is stimulated by sound, the piezoresistor transforms the resultant strain into a differential voltage output signal via the Wheatstone bridge circuit. Microfabrication technology has been employed for the fabrication of the microstructure and measurement results are given. The experiment results show that the receiving sensitivity of the hydrophone is ?197.7dB (0dB=1V/?Pa). The novel hydrophone not only possesses satisfactory directional pattern as well as miniature structure, but also has good low-frequency characteristics, and satisfies the requirements for low-frequency acoustic measurement.

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


INPUT-STATE-OUTPUT REPRESENTATIONS AND CONSTRUCTIONS OF FINITE SUPPORT 2D CONVOLUTIONAL CODES Two-dimensional convolutional codes are considered, with code-words having compact support indexed in N(2) and taking values in F(n), where F is a finite field. Input-state-output representations of these codes are introduced and several aspects of such representations are discussed. Constructive procedures of such codes with a designed distance are also presented.

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

systems theory
input-state-output representations


a multi-class preemptive priority cognitive radio system with random interruption discipline Cognitive radio system has been studied intensively. It is usually described as a multiserver queue with preemptive multiclass priority queueing system. Segal (1968) has studied a multiserver system with preemptive priority in which customers of higher priorities can preempt customers with lower priorities according to their arriving order. That is, customers with lower priorities are ejected according to the shortest time in service. In many applications, however, it is reasonable to study the system where customers of lower priorities are preempted randomly in spite of their arriving order. In this paper, we investigate such a multiserver Markovian queueing model with K priority classes with preemptive priorities and random preemptive discipline. We derive recurrence relations for the moments of the lifetime distribution of customers of lower priorities and present a numerical method of computing the solution. Finally, the moments of the lifetime distribution are compared numerically for the random interrupted system and the ordinal system.

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

preemptive priority
moments
lifetime distribution
cognitive radio
random preemptive discipline


A graph distance metric based on the maximal common subgraph Error-tolerant graph matching is a powerful concept that has various applications in pattern recognition and machine vision. In the present paper, a new distance measure on graphs is proposed. It is based on the maximal common subgraph of two graphs. The new measure is superior to edit distance based measures in that no particular edit operations together with their costs need to be defined. It is formally shown that the new distance measure is a metric. Potential algorithms for the efficient computation of the new measure are discussed.

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

distance measure
maximal common subgraph
metric

error-tolerant graph matching
graph edit distance


general parallel computation can be performed with a cycle-free heap We argue that a powerful and general programming model for parallel computation exists that honors the principles of modular software construction, but disallows the formation of heap cycles. We believe this cycle-free Frame and Heap model can be used as the basis for a new species of computer systems that satisfies all principles of modular software construction and offers performance and programmability beyond what is possible within the limitations of today's computer system technology.

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

functional programming languages
nondeterminate merge
heap storage management
stream processing