Off-lattice pattern recognition scheme for kinetic Monte Carlo simulations We report the development of a pattern-recognition scheme for the off-lattice self-learning kinetic Monte Carlo (KMC) method, one that is simple and flexible enough that it can be applied to all types of surfaces. In this scheme, to uniquely identify the local environment and associated processes involving three-dimensional (3D) motion of an atom or atoms, space around a central atom is divided into 3D rectangular boxes. The dimensions and the number of 3D boxes are determined by the accuracy with which a process needs to be identified and a process is described as the central atom moving to a neighboring vacant box accompanied by the motion of any other atom or atoms in its surrounding boxes. As a test of this method to we apply it to examine the decay of 3D Cu islands on the Cu(100) and to the surface diffusion of a Cu monomer and a dimer on Cu(111) and compare the results and computational efficiency to those available in the literature.

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

kinetic monte carlo
pattern recognition
surface diffusion

self learning
off lattice
thin film growth


DR-Prolog: A system for defeasible reasoning with rules and ontologies on the Semantic Web Nonmonotonic rule systems are expected to play an important role in the layered development of the Semantic Web. Defeasible reasoning is a direction in nonmonotonic reasoning that is based on the use of rules that may be defeated by other rules. It is a simple, but often more efficient approach than other nonmonotonic rule systems for reasoning with incomplete and inconsistent information. This paper reports on the implementation of a system for defeasible reasoning on the Web. The system 1) is syntactically compatible with RuleML, 2) features strict and defeasible rules, priorities, and two kinds of negation, 3) is based on a translation to logic programming with declarative semantics, 4) is flexible and adaptable to different intuitions within defeasible reasoning, and 5) can reason with rules, RDF, RDF Schema, and (parts of) OWL ontologies.

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


Numerical analysis on the LDMOS with a double epi-layer and trench electrodes We proposed a new lateral double-diffused MOS (LDMOS) structure employing a double p/n epitaxial layer, which is formed on p? substrates. Trenched gate and drain are also employed to obtain uniform and high drift current density. The breakdown voltage and the specific on-resistance of the proposed LDMOS are numerically calculated by using a two-dimensional (2D) device simulator, Medici. The n? drift region and upper p? region of the proposed LDMOS are fully depleted in off-states employing the RESURF technique. The simulation results show that the breakdown voltage is 142V and specific on-resistance is 183m?mm2 when the cell pitch of the LDMOS is 7.5?m. The proposed LDMOS shows better trade-off characteristics than the previous results.

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

ldmos
resurf technique
high drift current density


A matter of time: Applying a datauserstasks design triangle to visual analytics of time-oriented data Increasing amounts of data offer great opportunities to promote technological progress and business success. Visual analytics (VA) aims at enabling the exploration and the understanding of large and complex data sets by intertwining interactive visualization, data analysis, humancomputer interaction, as well as cognitive and perceptual science. We propose a design triangle, which considers three main aspects to ease the design: (1) the characteristics of the data, (2) the users, and (3) the users' tasks. Addressing the particular characteristics of time and time-oriented data focuses the VA methods, but turns the design space into a more complex and challenging one. We demonstrate the applicability of the design triangle by three use cases tackling the time-oriented aspects explicitly. Our design triangle provides a high-level framework, which is simple and very effective for the design process as well as easily applicable for both, researchers and practitioners.

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

visual analytics
interactive visualization

interaction design
temporal data mining
time-oriented data


Corporate valuation, capital structure and risk management: A stochastic DCF approach In this article we discuss a general stochastic framework for designing corporate investment, financing and risk management strategies for financially constrained firms. The strategy entailing the highest benefits for shareholders is considered to be the optimal strategy. This paper focuses on a simulation of present value distributions of the capital positions of a company, explicitly taking into account the risk of fluctuations in future cash flow as well as the risk of insolvency. The present value distribution of equity is used as a central instrument for evaluation of shareholder benefits. Expected present values are also computed. The investment and financing policy of the company pursued at the time of the valuation is reflected in certain global model parameters, which themselves influence the future profit distribution policy of the company. The main parameters are the extent of debt, the annual debt funding requirements, the average earnings power of the company expressed as an expected annual return on total capital and the risk of annual earnings expressed as the standard deviation of the annual return on total capital. An explicit illustration of the volatility risk and default risk seems not only to be a suitable way of illustrating the impact of capital structure on corporate value. Such an depiction may also provide answers to the question of the link between hedging and enterprise value. This paper highlights the fact that investment, finance and hedging strategies should go hand in hand.

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

investment analysis
risk analysis
uncertainty modelling


Multi-objective evolutionary feature selection for instrument recognition in polyphonic audio mixtures Instrument recognition is one of the music information retrieval research topics. This task becomes very challenging if several instruments are played simultaneously because of their varying physical characteristics: inharmonic attack noise, energy development during attackdecaysustainrelease envelope or overtone distribution. In our framework, we treat instrument detection as a machine-learning task based on a large amount of preprocessed audio features with target to build classification models. Since classification algorithms are very sensitive to feature input and the optimal feature set differs from instrument to instrument, we propose to run a multi-objective feature selection procedure before building of classification models. Two objectives are considered for evaluation: classification mean-squared error and feature rate (smaller amount of features stands for reduced costs and decreased risk of overfitting). The analysis of the extensive experimental study confirms that application of an evolutionary multi-objective algorithm is a good choice to optimize feature selection for music instrument identification.

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 O O O O O O O O O O O O O O O O O O O O O O O O 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-objective feature selection
music classification


an efficient power saving mechanism for sleep mode in ieee 802.16e networks In order to reduce the power consumption to extend the lifetime of battery-powered Mobile Stations (MSs), IEEE 802.16e has introduced a sleep mode to decrease the usage of air interface resources of serving Base Stations (BSs). In the sleep mode, MS enters into a sleep cycle after negotiating with serving BS and stops its traffic service temporarily. In order to reduce the energy consumption as well as decrease the packet delay especially in low traffic scenario, this paper proposes a novel power saving algorithm for sleep mode in which the sleep interval is increased in power function each time until a maximum sleep interval threshold is reached. Theoretical analysis and simulation experiments demonstrate that the proposed algorithm can achieve significantly less mean energy consumption and mean response time compared with exponential and linear increase algorithms. Furthermore, this paper analyzes the performance impact of each parameter in the algorithm and presents how to configure the sleep mode parameters.

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

power saving algorithm
response time
sleep mode


Accounting recognition of information as an asset Attempts to recognize 'information' as an asset have led to an increased awareness of why and how this invisible valuable resource does not appear in the financial statements. This paper aims to develop a model based on three-circled sets of criteria for the pre-measurement phase of an asset recognition process. This model should be applicable to all types of assets, but we mainly focus on information as an intangible-based asset. Semi-structured, in-depth interviews and a questionnaire survey were used to provide triangulating perspectives to follow the grounded theory approach and generate artefact-based asset recognition criteria. The generated theory is applied to information as a candidate asset to explain how this invisible resource can be recognized in financial statements.

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

asset-recognition process
intangibles
intellectual capital
knowledge


multi-antenna cognitive radio for broadband access in 4g-wlans This paper focuses on the competitively optimal power-control, signal-shaping and interference mitigation for wireless mesh networks composed by Multiple-Antenna noncooperative transmit terminals and a base station affected by spatially colored Multi-Access Interference (MAI). The target is the competitive maximization of the information throughput of the uplink of each link active over the network. For this purpose, the MAI-impairednetwork is modelled as a noncooperative strategic game.Specifically, the main contribution of this paper may be sosummarized. First, we consider power-control, signal-shaping and interference mitigation algorithms allowing the implementation of asynchronous Space-Division Multiple Access (SDMA) strategies able to guarantee the competitive maximization of the users' rate under both Quality of Service (QoS) guaranteed and QoS contracted accesspolicies. Second, we give evidence that the developed SDMAoutperforms (in terms of aggregate throughput) the conventional orthogonal ones, specially in operating scenarios affected by strong MAI. The proposed access scheme can be considered as an Active Networking strategy where the nodes try to "sense" the channel and to access according to a space-division policy.

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

competitive optimality
game theory
power allocation
active networks
multiple antennas


Face detection from cluttered images using a polynomial neural network Automatic detection of human faces from cluttered images is important for face recognition and security applications. This problem is challenging due to the multitude of variations and the confusion between face and background regions. This paper proposes a new face detection method using a polynomial neural network (PNN). To locate the human faces in an image, the local regions in multiscale sliding windows are classified by the PNN to two classes, namely, face and non-face. The PNN takes as inputs the binomials of the projection of the local image onto a feature subspace learned by principal component analysis (PCA). We investigated the influence of PCA on either the face samples or the pooled face and non-face samples. In addition, we integrate the distance from the feature subspace into the PNN to improve the detection performance. In experiments on images with complex backgrounds, the proposed method has produced promising results in terms of high detection rate and low false positive rate.

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

face recognition
face detection
polynomial neural network

pattern classification
feature extraction


Prediction of 13C NMR Chemical Shift Sum Using Topological Indices: Role of Recently Introduced Balaban F and G Indices Present paper deals with the examination of Balaban F and G indices for estimating 13C NMR chemical shift sums of alkanes. Set of 66 alkanes were used for this purpose, which have been divided into training set (50 compounds) and test set (16 compounds). The results have shown that Balaban G Index along with connectivity indices yields the best model. The model is analyzed for the defect due to colinearity using Ridge parameters. The most appropriate model is a three-parametric model found containing \(^{1}\chi\), \(^{2}\chi\), and G as correlating parameters. The results have been critically examined based on variety of statistical parameters.

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

css
connectivity index
szeged index
padmakarivan index
regression analysis
ridge statistics


Application of Cascade Hand Detection for Touchless Interaction in Virtual Design This paper proposes a method for robust hand detection for interactive touchless display using cascade classifier technique. A hardware system comprising a transparent display, two video cameras and a projector is assembled to generate on-display-surface object images for touchless display. A well-trained cascade of boosted classifiers is applied to detect the position of the hand in the object image. Using this method, accurate and robust hand detection for touchless display can be achieved. The detected hand trajectory information can be converted into mouse and keyboard inputs for interactive control and manipulation in virtual applications like virtual assembly and virtual design. [DOI: 10.1115/1.3615972]

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

hand detection
touchless display
cascade classifier
virtual assembly


NUMA-Aware Memory Manager with Dominant-Thread-Based Copying GC We propose a novel online method of identifying the preferred NUMA nodes for objects with negligible overhead during the garbage collection time as well as object allocation time. Since the number of CPUs (or NUMA nodes) is increasing recently, it is critical for the memory manager of the runtime environment of an object-oriented language to exploit the low latency of local memory for high performance. To locate the CPU of a thread that frequently accesses an object, prior research uses the runtime information about memory accesses as sampled by the hardware. However, the overhead of this approach is high for a garbage collector. Our approach uses the information about which thread can exclusively access an object, or the Dominant Thread (DoT). The dominant thread of an object is the thread that often most accesses an object so that we do not require memory access samples. Our NUMA-aware GC performs DoT based object copying, which copies each live object to the CPU where the dominant thread was last dispatched before GC. The dominant thread information is known from the thread stack and from objects that are locked or reserved by threads and is propagated in the object reference graph. We demonstrate that our approach can improve the performance of benchmark programs such as SPECpower_ssj2008, SPECjbb2005, and SPECjvm2008. We prototyped a NUMA-aware memory manager on a modified version of IBM Java VM and tested it on a cc-NUMA POWER6 machine with eight NUMA nodes. Our NUMA-aware GC achieved performance improvements up to 14.3% and 2.0% on average over a JVM that only used the NUMA-aware allocator. The total improvement using both the NUMA-aware allocator and GC is up to 53.1% and 10.8% on average.

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


predicting remote versus collocated group interactions using nonverbal cues This paper addresses two problems: Firstly, the problem of classifying remote and collocated small-group working meetings, and secondly, the problem of identifying the remote participant, using in both cases nonverbal behavioral cues. Such classifiers can be used to improve the design of remote collaboration technologies to make remote interactions as effective as possible to collocated interactions. We hypothesize that the difference in the dynamics between collocated and remote meetings is significant and measurable using speech activity based nonverbal cues. Our results on a publicly available dataset - the Augmented Multi-Party Interaction with Distance Access (AMIDA) corpus - show that such an approach is promising, although more controlled settings and more data are needed to explore the addressed problems further.

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

nonverbal behavior
characterizing small groups


Fuzzy relation equations and reduction of fuzzy automata We show that the state reduction problem for fuzzy automata is related to the problem of finding a solution to a particular system of fuzzy relation equations in the set of all fuzzy equivalences on its set of states. This system may consist of infinitely many equations, and finding its non-trivial solutions may be a very difficult task. For that reason we aim our attention to some instances of this system which consist of finitely many equations and are easier to solve. First, we study right invariant fuzzy equivalences, and their duals, the left invariant ones. We prove that each fuzzy automaton possesses the greatest right (resp. left) invariant fuzzy equivalence, which provides the best reduction by means of fuzzy equivalences of this type, and we give an effective procedure for computing this fuzzy equivalence, which works if the underlying structure of truth values is a locally finite residuated lattice. Moreover, we show that even better reductions can be achieved alternating reductions by means of right and left invariant fuzzy equivalences. We also study strongly right and left invariant fuzzy equivalences, which give worse reductions than right and left invariant ones, but whose computing is much easier. We give an effective procedure for computing the greatest strongly right (resp. left) invariant fuzzy equivalence, which is applicable to fuzzy automata over an arbitrary complete residuated lattice. (C) 2009 Elsevier Inc. All rights reserved.

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

fuzzy automaton
fuzzy equivalence
state reduction
complete residuated lattice

factor fuzzy automaton
fuzzy relation equation
right invariant fuzzy equivalence
alternate reduction


Neural network based recognition of smoke signatures from lidar signals The automatic recognition of smoke signatures in lidar signals collected during very small-scale experimental forest. res using neural-network algorithms was studied. An algorithm for pre-processing of raw lidar signals is proposed, which selects suspicious backscattering peaks and makes them unbiased and scale independent. The resulting patterns can be successfully classified as corresponding to alarm or no-alarm conditions by a neural-network algorithm based on a simple one-neuron structure (perceptron). In the case of an alarm, the pre-processing algorithm provides the location of the smoke plume. Five algorithms selected from the literature, and one that was specially developed, all with learning rate adaptation, were used for training the perceptron. Their efficiencies and statistical properties were compared. The best perceptron classifier presented an efficiency of 97% in the classification of smoke-signature patterns and a false alarm rate of 0.9%.

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

backpropagation fire generalisation laser misdetections


Fabrication of diamond-like carbon-based two-dimensional photonic crystals A process for fabricating DLC-based two-dimensional photonic crystals is developed. Plasma chemical vapor deposition was used to deposit a DLC layer. The feasibility of DLC-based photonic crystals is theoretically investigated. A DLC photonic crystal was successfully fabricated using the developed process.

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

diamond-like carbon
refractive index
electron-beam lithography
inductively coupled plasma etching


Energy-efficient geographic multicast routing for error-prone wireless sensor networks Recent studies have shown that it is of paramount importance to take into account the error-prone nature of wireless links when designing routing protocols for wireless sensor networks (WSNs). We propose a new protocol called localized energy-efficient multicast algorithm (LEMA). By using a function to locally estimate file energy due to retransmissions. LEMA is able to deal with the inherent errors of WSN. This allows LEMA to find energy-efficient paths to multiple destinations. Our simulation results show that LEMA is able to outperform even well-known centralized heuristics Such as minimum incremental power (MIP) and shortest path tree (SPT) based on energy, while still achieving a high packet delivery ratio (PDR). Copyright (C) 2007 John Wiley & Sons, Ltd.

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


An integrated inference architecture for machine tools design involving complex knowledge This paper describes the inference architecture of an intelligent CAD system that is to be used for the design of machine tools in which a complex and large amount of knowledge is used. In order to investigate the issue of handling huge and complex knowledge, the design knowledge for the machine tools design is categorised into four types and inference methods for them are identified respectively; original design problems are decomposed into several modules of design processes and finally into sub-problems with the four types of knowledge as the basic elements in a top-down manner. We demonstrate the implementation of the architecture with the result on the machining centre design.

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


User-guided volumetric approximation using swept sphere volumes for physically based animation We present an efficient, user-guided volumetric approximation algorithm, specifically designed for physically based animation. Our method combines automatic and interactive segmentation methods to give users an intuitive and easy way to approximate 3D meshes. Our approach first constructs the simplified medial axis transform of the input mesh object, and segments the medial axis into parts in terms of swept sphere volumes using a region growing method. Then, we decompose the object surface into regions based on the mapping between the segmented medial axis and the object surface. Each segmented region is approximated with a swept sphere volume. These decomposed surface regions can be interactively refined further by splitting and/or merging using a sketch-based input. Experimental results show that our approach produces good volumetric approximation results for different types of object shapes. Moreover, rigid-body dynamics simulation based on our volumetric approximation provides a visually pleasing result. Copyright (C) 2012 John Wiley & Sons, Ltd.

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

volumetric approximation
swept sphere volumes


Identifying malignant transformations in recurrent low grade gliomas using high resolution magic angle spinning spectroscopy The objective of this study was to determine whether metabolic parameters derived from ex vivo analysis of tissue samples are predictive of biologic characteristics of recurrent low grade gliomas (LGGs). This was achieved by exploring the use of multivariate pattern recognition methods to generate statistical models of the metabolic characteristics of recurrent LGGs that correlate with aggressive biology and poor clinical outcome. Statistical models were constructed to distinguish between patients with recurrent gliomas that had undergone malignant transformation to a higher grade and those that remained grade 2. The pattern recognition methods explored in this paper include three filter-based feature selection methods (chi-square, gain ratio, and two-way conditional probability), a genetic search wrapper-based feature subset selection algorithm, and five classification algorithms (linear discriminant analysis, logistic regression, functional trees, support vector machines, and decision stump logit boost). The accuracy of each pattern recognition framework was evaluated using leave-one-out cross-validation and bootstrapping. The population studied included fifty-three patients with recurrent grade 2 gliomas. Among these patients, seven had tumors that transformed to grade 4, twenty-four had tumors that transformed to grade 3, and twenty-two had tumors that remained grade 2. Image-guided tissue samples were obtained from these patients using surgical navigation software. Part of each tissue sample was examined by a pathologist for histological features and for consistency with the tumor grade diagnosis. The other part of the tissue sample was analyzed with ex vivo nuclear magnetic resonance (NMR) spectroscopy. Distinguishing between recurrent low grade gliomas that transformed to a higher grade and those that remained grade 2 was achieved with 96% accuracy, using areas of the ex vivo NMR spectrum corresponding to myoinositol, 2-hydroxyglutarate, hypo-taurine, choline, glycerophosphocholine, phosphocholine, glutathione, and lipid. Logistic regression and decision stump boosting models were able to distinguish between recurrent gliomas that transformed to a higher grade and those that did not with 100% training accuracy (95% confidence interval [93100%]), 96% leave-one-out cross-validation accuracy (95% confidence interval [87100%]), and 96% bootstrapping accuracy (95% confidence interval [9597%]). Linear discriminant analysis, functional trees, and support vector machines were able to achieve leave-one-out cross-validation accuracy above 90% and bootstrapping accuracy above 85%. The three feature ranking methods were comparable in performance. This study demonstrates the feasibility of using quantitative pattern recognition methods for the analysis of metabolic data from brain tissue obtained during the surgical resection of gliomas. All pattern recognition techniques provided good diagnostic accuracies, though logistic regression and decision stump boosting slightly outperform the other classifiers. These methods identified biomarkers that can be used to detect malignant transformations in individual low grade gliomas, and can lead to a timely change in treatment for each patient.

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

pattern recognition
spectroscopy
malignant transformation
tumor grade


Interactive translation prediction versus conventional post-editing in practice: a study with the CasMaCat workbench We conducted a field trial in computer-assisted professional translation to compare interactive translation prediction (ITP) against conventional post-editing (PE) of machine translation (MT) output. In contrast to the conventional PE set-up, where an MT system first produces a static translation hypothesis that is then edited by a professional (hence post-editing), ITP constantly updates the translation hypothesis in real time in response to user edits. Our study involved nine professional translators and four reviewers working with the web-based CasMaCat workbench. Various new interactive features aiming to assist the post-editor/translator were also tested in this trial. Our results show that even with little training, ITP can be as productive as conventional PE in terms of the total time required to produce the final translation. Moreover, translation editors working with ITP require fewer key strokes to arrive at the final version of their translation.

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

interactive translation prediction
field trial


A Profile-Based Multimedia Sharing Scheme With Virtual Community, Based on Personal Space in a Ubiquitous Computing Environment For ubiquitous computing environments, an important parameter is whether all the components in the specific environment can connect with one another. Given this capability, we can share various kinds of content across mobile terminals. This paper introduces an effective scheme to manage multimedia sharing based on specially designed profiles and a virtual community. A virtual community is defined as any specific group of users connected for a common interest. Specifically the proposed scheme consists of two layers, i.e., a community construction layer and a multimedia sharing layer, based on personal spaces, which are responsible for constructing and managing the multimedia sharing community. The community construction layer, which is designed to be run on the mobile terminals, provides an effective way to find community members simultaneously, based on specially designed profiles, such as a user profile and an abstract profile. The multimedia sharing layer is responsible for sharing multimedia content, and is constructed as a specially designed scheme based on locality. The proposed scheme provides an effective multimedia sharing mechanism within a community. Simulation results show that the number of messages and the time required for community member discovery is reduced by 32% and 73%, respectively, in comparison with the conventional DHT-based scheme. The approach also reduces the time to exchange content by 50% with respect to the same baseline.

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

community computing
p2p network
user/community profile


Non-approximability results for scheduling problems with minsum criteria We provide several non-approximability results for deterministic scheduling problems whose objective is to minimize the total job completion time. Unless P = NP, none of the problems under consideration can be approximated in polynomial time within arbitrarily good precision. Most of our results are derived by APX-hardness proofs. We show that, whereas scheduling on unrelated machines with unit weights is polynomially solvable, the problem becomes APX-hard if release dates or weights are added. We further show APX-hardness for scheduling in flow shops, job shops, and open shops. We also investigate the problems of scheduling on parallel machines with precedence constraints and unit processing times, and two variants of the latter problem with unit communication delays; for these problems we provide lower bounds on the worst-case behavior of any polynomial-time approximation algorithm through the gap-reduction technique.

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

scheduling
precedence constraints
communication delays
approximation algorithm

unrelated parallel machines
open shop
flow shop
approximation scheme
worst-case analysis
non-approximability
l-reduction
gap-reduction
apx-hardness


Theoretical and experimental investigation of chaperone effects on soluble recombinant proteins in Escherichia coli: effect of free DnaK level on temperature-induced recombinant streptokinase production Modeling and analysis of genetic networks have become increasingly important in the investigation of cellular processes. The genetic networks involved in cellular stress response can have a critical effect on the productivity of recombinant proteins. In this work, it was found that the temperature-inducible expression system for the production of soluble recombinant streptokinase in Escherichia coli resulted in a lower productivity compared to the chemically-induced system. To investigate the effect of the induced cellular response due to temperature up-shift a model-based approach is adopted. The role played by the major molecular chaperone teams DnaKDnaJGrpE and GroELGroES on the productivity of recombinant streptokinase was experimentally determined. Based on these investigations, a detailed mechanistic mathematical model was developed for the cellular response during the temperature-induced recombinant streptokinase production. The model simulations were found to have a good qualitative agreement with the experimental results. The mechanistic mathematical model was validated with the experiments conducted on a ?32 mutant strain. Detailed analysis of the parameter sensitivities of the model indicated that the level of free DnaK chaperone in the cell has the major effect on the productivity of recombinant streptokinase during temperature induction. Analysis of the model simulations also shows that down regulation or selective redirection of the heat shock proteins could be a better way of manipulating the cellular stress response than overexpression or deletion. In other words, manipulating the system properties resulting from the interaction of the components is better than manipulating the individual components. Although our results are specific to a recombinant protein (streptokinase) and the expression system (E.coli), we believe that such a systems-biological approach has several advantages over conventional experimental approaches and could be in principle extended to bigger genetic networks as well as other recombinant proteins and expression systems.

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

dnak chaperone
temperature induction
soluble recombinant streptokinase
cellular stress response
escherichia coli


A decision support system for meanvariance analysis in multi-period inventory control We develop a methodology to track meanvariance solutions in inventory control. We call this methodology Variance Retentive Stochastic Dynamic Programming. We develop a heuristic (RiskTrackr) to construct risk-reward efficient frontiers. We use RiskTrackr as a decision support tool.

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

stochastic dynamic programming
meanvariance analysis

risk-reward heuristic
efficient frontier analysis
inventory management


Gradient Estimation for a Class of Systems with Bulk Services: A Problem in Public Transportation This article presents a comparison of different gradient estimators for the sensitivity of waiting times in a bulk server system. Inspired by a transportation network, our model is that of a bursty arrival process that waits at a "platform" until the server is available (representing a train or bus ready for departure). At the departure epochs, all waiting passengers leave at once. The departure process is assumed to be a renewal process and, based on a limiting result, the interdeparture times are approximated by truncated normal random variables. The interarrival times are assumed to be identically and independently distributed (i.i.d.), with a general distribution of bounded density. We are interested in calculating the sensitivities of the total cumulative waiting time of all passengers with respect to the interdeparture times. For this general model where neither the interarrival times nor the interdeparture times are exponential, there is no analytical formula available. However, the estimation of such sensitivities is an important problem for flow control in such networks. We establish a Smoothed Perturbation Analysis (SPA), a Measure-Valued Differentiation (MVD), and a Score Function (SF) estimator, including numerical experiments.

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

score function
smoothed perturbation analysis

bulk servers
measure-valued differentiation
sensitivity analysis


Heuristics for the single source capacitated multi-facility Weber problem The Single Source Capacitated Multi-facility Weber Problem (SSCMWP) is concerned with locating I capacitated facilities in the plane to satisfy the demand off customers with the minimum total transportation cost of a single commodity such that each customer satisfies all its demand from exactly one facility. The SSCMWP is a non-convex optimization problem and difficult to solve. In the SSCMWP, customer locations, customer demands and facility capacities are known a priori. The transportation costs are proportional to the distance between customers and facilities. We consider both the Euclidean and rectilinear distance cases of the SSCMWP. We first present an Alternate Location and Allocation type heuristic and its extension by embedding a Very Large Scale Neighborhood search procedure. Then we apply a Discrete Approximation approach and propose both lower and upper bounding procedures for the SSCWMP using a Lagrangean Relaxation scheme. The proposed heuristics are compared with the solution approaches from the literature. According to extensive computational experiments on standard and randomly generated test sets, we can say that they yield promising performance. (C) 2013 Elsevier Ltd. All rights reserved.

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

location-allocation
single source transportation
vlsn search


User-centric knowledge representations based on ontology for AEC design collaboration Fostering collaboration in the AEC (Architecture/Engineering/Construction) field is difficult, due to the differing educational and disciplinary backgrounds of the participants. Current approaches to managing such collaboration in the AEC industry often fail to overcome the disciplinary differences among the participants, resulting in cost overruns, missed schedules, and diminished satisfaction of the clients or society. Their failure is due to the lack of understanding of the nature of multi-disciplinary design and the lack of tools that can support them. The primary objective of this research is to establish a suitable model for machine-mediated collaboration. In contrast to the monolithic model, which is insensitive to changes, we propose to develop a distributed and flexible model, where each domain of expertise retains its own data in the form most appropriate for its needs, and where ontology-based, intelligent filters translate neutral design data into domain-specific ones. The filtered data appear semantically-rich to the participant, even when it was generated by another participant. To verify the feasibility of the proposed filter-based communication model, we developed and tested a prototype. The result of the prototype test demonstrates that the proposed model can enable designers from different disciplines participating in an AEC project to better understand the dynamic process of design and achieve a high level of shared understanding.

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

information filtering
knowledge representation
domain ontology
building information model (bim)
ontology modeling


Redox and Lewis acid-base activities through an electronegativity-hardness landscape diagram Chemistry is the science of bond making and bond breaking which requires redistribution of electron density among the reactant partners. Accordingly acid-base and redox reactions form cardinal components in all branches of chemistry, e.g., inorganic, organic, physical or biochemistry. That is the reason it forms an integral part of the undergraduate curriculum all throughout the globe. In an electronegativity (chi)- hardness (eta) landscape diagram the diagonal chi = eta line separates reducing agents from oxidizing agents as well as Lewis acids from Lewis bases. While electronegativity is related to the degree of electron transfer between two reactants, hardness is related to the resistance to that process. Accordingly the electronegativities of oxidizing agents/Lewis acids are generally greater than the corresponding hardness values and the reverse is true for reducing agents/Lewis bases. Electrophiles and nucleophiles are also expected to follow similar trends.

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

conceptual density functional theory
oxidizing agent
reducing agent
reactivity descriptors


Further Functorial Properties of the Reticulation In this article we prove a set of preservation properties of the reticulation functor for residuated lattices, namely preservation of subalgebras, finite direct products, quotients, inductive limits and Boolean powers.

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


Application of Richardson extrapolation for multi-dimensional advection equations A CrankNicolson type scheme, which is of order two with respect to all independent variables, is used in the numerical solution of multi-dimensional advection equations. Normally, the order of accuracy of any numerical scheme can be increased by one when the well-known Richardson Extrapolation is used. It is proved that in this particular case the order of accuracy of the combined numerical method, the method consisting of the CrankNicolson scheme and the Richardson Extrapolation, is not three but four.

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

richardson extrapolation
order of accuracy

multi-dimensional advection
cranknicolson numerical scheme


Lyapunov stability analysis of turbine-generator including shaft system A novel approach based on the Lyapunov decompositionaggregation method is developed to analyze shaft stability in power systems. The power system including the turbine-generator shaft, flux decay and voltage regulator is decomposed to two isolated subsystems: mechanical subsystem and electrical subsystem. The mechanical subsystem is converted to a standard Lure control system that is analyzed by an improved Lure Lyapunov function. The stability of the power system at the equilibrium points is discussed in detail. The stable operation region of the system is obtained. Case study demonstrates the effectiveness of the proposed method. This study has shown the potential benefits and validity of Lyapunov direct method in the shaft torsional oscillation analysis.

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

shaft torsional oscillation
lure control system
lyapunov function


towards mobility as a network control primitive In the near future, the advent of large-scale networks of mobile agents autonomously performing long-term sensing and communication tasks will be upon us. However, using controlled node mobility to improve communication performance is a capability that the mobile networking community has not yet investigated. In this paper, we study mobility as a network control primitive. More specifically, we present the first mobility control scheme for improving communication performance in such networks. Our scheme is completely distributed, requiring each node to possess only local information. Our scheme is self-adaptive, being able to transparently encompass several modes of operation, each respectively improving power efficiency for one unicast flow, multiple unicast flows, and many-to-one concast flows. We provide extensive evaluations on the feasibility of mobility control, showing that controlled mobility can improve network performance in many scenarios. This work constitutes a novel application of distributed control to networking in which underlying network communication serves as input to local control rules that guide the system toward a global objective.

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

communication
network
mobility
input
performance
paper
control
power efficiency
flow
distributed
future
rules
global
scheme

scenario
applications
communities
large-scale
mobile agent
object
mobility control
informal
mobile network
evaluation
locality
routing
network performance
adapt
systems
self-configuration in ad hoc networks
senses


An object-oriented parallel programming language for distributed-memory parallel computing platforms In object-oriented programming (OOP) languages, the ability to encapsulate software concerns of the dominant decomposition in objects is the key to reaching high modularity and loss of complexity in large scale designs. However, distributed-memory parallelism tends to break modularity, encapsulation, and the functional independence of objects, since parallel computations cannot be encapsulated in individual objects, which reside in a single address space. For reconciling object-orientation and distributed-memory parallelism, this paper introduces OOPP (Object-Oriented Parallel Programming), a style of OOP where objects are distributed by default. As an extension of C++, a widespread language in HPC, the PObC++ language has been designed and prototyped, incorporating the ideas of OOPP. (C) 2013 Elsevier B.V. All rights reserved.

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

object-oriented programming languages
parallel programming languages
parallel programming techniques
high performance computing


Semiautomatic construction of isobase surfaces: A case study from the central Western Carpathians The analysis of isobase surfaces extends possibilities of morphostructural research. A semi-automated method was developed to replace manual construction of isobase surfaces. The analysis runs in a server environment, everyone can try it in web browser using own data. A comparison with the manually constructed isobase surfaces successfully verified the algorithm's 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

digital terrain model
isobase surface
automatic construction
geomorphological information system
server processing


Pattern recognition techniques for the emerging field of bioinformatics: A review The emerging field of bioinformatics has recently created much interest in the computer science and engineering communities. With the wealth of sequence data in many public online databases and the huge amount of data generated from the Human Genome Project, computer analysis has become indispensable. This calls for novel algorithms and opens up new areas of applications for many pattern recognition techniques. In this article, we review two major avenues of research in bioinformatics, namely DNA sequence analysis and DNA microarray data analysis. In DNA sequence analysis, we focus on the topics of sequence comparison and gene recognition. For DNA microarray data analysis, we discuss key issues such as image analysis for gene expression data extraction, data pre-processing, clustering analysis for pattern discovery and gene expression time series data analysis. We describe current methods and show how computational techniques could be useful in these areas. It is our hope that this review article could demonstrate how the pattern recognition community could have an impact on the fascinating and challenging area of genomic research.

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

bioinformatics
dna sequence analysis
gene recognition
dna microarray
gene expression time series

dna sequence comparison
gene expression data analysis
gene expression clustering
gene regulation


A robust two-phase heuristic algorithm for the truck scheduling problem in a resource-constrained crossdock This paper studies truck scheduling in a resource-constrained crossdock. The problem decides on the sequence of incoming and outgoing trucks at the dock doors of the crossdocking terminal, subject to the availability of crossdock resources including dock doors and material handling systems. The resources are assumed non-preemptive making it necessary to address the feasibility of the problem before its optimality as it might be entrapped in deadlock and no feasible solution is produced. The paper thus aims at developing an algorithmic approach capable of establishing solution feasibility for truck scheduling problem instances of various types and difficulty levels which at the same time can be readily implemented in an industrial setting. The proposed approach is a two-phase heuristic algorithm where in the first phase, a heuristic search is deployed to construct a feasible sequence of trucks for the assignment to dock doors and in the second, a rule-based heuristic is used to assign each sequenced truck to a proper dock door, subject to a limited number of forklifts, such that significant savings in the truck schedule length are achieved. Extensive experiments are conducted to evaluate the efficiency of the algorithm in terms of deadlock avoidance and solution quality. The evaluation is carried out against the solutions generated by the exact mathematical model of the problem and a constructive heuristic developed for a similar truck scheduling problem. Experimental results demonstrate that the proposed algorithm is robust in avoiding deadlock and generates feasible solutions for the instances where the other two approaches cannot. Furthermore, significant improvement in the solution quality is achieved by augmenting the algorithm to a re-starting heuristic.

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

crossdocking
truck scheduling
feasibility


Some formulae to calculate the entropies of the image fuzzy sets In this paper, we introduce a simple new method on calculating the entropy of the image fuzzy set gotten by the extension principle without calculating its membership function.

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

membership functions
measure of fuzziness


Fine grained sampling of residue characteristics using molecular dynamics simulation In a fine-grained computational analysis of protein structure, we investigated the relationships between a residue's backbone conformations and its side-chain packing as well as conformations. To produce continuous distributions in high resolution, we ran molecular dynamics simulations over a set of protein folds (dynameome). In effect, the dynameome dataset samples not only the states well represented in the PDB but also the known states that are not well represented in the structural database. In our analysis, we characterized the mutual influence among the backbone ?,? angles with the first side-chain torsion angles (?1) and the volumes occupied by the side-chains. The dependencies of these relationships on side-chain environment and amino acids are further explored. We found that residue volumes exhibit dependency on backbone 2 structure conformation: side-chains pack more densely in extended ?-sheet than in ?-helical structures. As expected, residue volumes on the protein surface were larger than those in the interior. The first side-chain torsion angles are found to be dependent on the backbone conformations in agreement with previous studies, but the dynameome dataset provides higher resolution of rotamer preferences based on the backbone conformation. All three gauche?, gauche+, and trans rotamers show different patterns of ?,? dependency, and variations in ?1 value are skewed from their canonical values to relieve the steric strains. By demonstrating the utility of dynameomic modeling on the native state ensemble, this study reveals details of the interplay among backbone conformations, residue volumes and side-chain conformations.

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 B O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 dynamics simulation
dynameome
backbone conformation
rotamer

residue volume
side-chain packing
ramachandran plot


A strategy for blood vessels segmentation based on the threshold which combines statistical and scale space filter - Application to the study of angiogenesis This paper presents a strategy for segmenting blood vessels based on the threshold, which combines statistics and scale space filter. By incorporating statistical information, the strategy is capable of reducing over-segmentation. We propose a two-stage strategy which involves: (1) optimal selection of window size and (2) optimal selection of scale.We compared our strategy to two commonly used thresholding techniques. Experimental results showed that our method is much more robust and accurate. Our strategy suggested a modification to Otsu's method. In this application the important information to be extracted from images is only the number of blood vessels present in the images. The proposed segmentation technique is tested on manual segmentation, where segmentation errors less than 3% were observed. The work presented in this paper is a part of a global image analysis process. Therefore, these images will be subject to a further morphometrical analysis in order to diagnose and predict automatically malign tumors. (c) 2006 Published by Elsevier Ireland Ltd.

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

thresholding method
image segmentation
angiogenesis process


A novel watermarking method for software protection in the cloud With the rapid development of cloud computing, software applications are shifting onto cloud storage rather than remaining within local networks. Software distributions within the cloud are subject to security breaches, privacy abuses, and access control violations. In this paper, we identify an insider threat to access control which is not completely eliminated by the usual techniques of encryption, cryptographic hashes, and access-control labels. We address this threat using software watermarking. We evaluate our access-control scheme within the context of a Collaboration-oriented Architecture, as defined by The Jericho Forum. Copyright 2011 John Wiley & Sons, Ltd.

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

cloud computing
software protection
watermarking


Detection of temporal lobe epilepsy using support vector machines in multi-parametric quantitative MR imaging Measuring regional asymmetry is fundamental for optimal classification results. DTI derived measures seem to be more informative than T2 maps for classification of TLE patients. Best classification accuracy for left TLE was 100% and for right TLE was 88.9%. Most of the discriminative features belong to the temporal lobes. The right TLE group is difficult to distinguish from controls. Possible factors are pathology heterogeneity and a limited sample size.

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

dti
support vector machines
tle
epilepsy

mri
despot
fa
md
quantitative imaging
feature selection
mrmr
anova
machine learning
svm
roi
pca


active integrity constraints In this paper we deal with inconsistent databases and propose a logic framework that allows specifying sets of actions which should be performed to make databases consistent (repairs). The motivation of this work stems from the observation that in repairing a database it is natural to express among a set of update operations, the (preferred) actions which should be performed to repair the database. We introduce (conditioned) active integrity constraints , a simple and powerful form of active rules with declarative semantics, well suited for computing database repairs and consistent answers. We first consider a "prescriptive" semantics where the allowed actions are those specified by the constraints. Under such a semantics the existence of repairs and consistent answers is not guaranteed. Thus, we also investigate the class of universally quantified constraints under a different semantics where actions are interpreted as preference conditions on the set of possible repairs ("preferable" semantics). Under such a semantics every database with integrity constraints admits repairs and consistent answers. We show that (conditioned) active integrity constraints can be rewritten into disjunctive Datalog programs with classical negation and that (preferred) repairs can be derived through the computation of (preferred) disjunctive stable models. We study the complexity of computing repairs and consistent answers and show that active integrity constraints can also be used to express hard problems.

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


Modeling stakeholders for information systems design processes In the software engineering area, stakeholders play a significant role in requirements elicitation and validation. Moreover, all the project management is integrally affected by stakeholders perspectives and their participation. This effect is strengthened when projects involve several organizations. Thus, a clear and explicit representation of the stakeholders and their attributes is required in order to achieve their effective management. The integration of this representation with other models capturing the knowledge of engineering design processes can be of great utility in software development projects. In this sense, this article describes the construction of an integrated model for representing stakeholders in information systems design processes. This proposal considers diverse attributes related to stakeholders and gives information for performing quantitative calculations about their interest and influence over the project. Thus, more inclusive experiences of the information systems development can be supported, even more if contexts with the participation of several organizations are considered.

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

information system design processes
stakeholders modeling


tolerance: An R Package for Estimating Tolerance Intervals The tolerance package for R provides a set of functions for estimating and plotting tolerance limits. This package provides a wide-range of functions for estimating discrete and continuous tolerance intervals as well as for estimating regression tolerance intervals. An additional tool of the tolerance package is the plotting capability for the univariate and regression settings as well as for the multivariate normal setting. The tolerance package's capabilities are illustrated using simulated data sets. Formulas used for the estimation procedures are also presented.

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

acceptance limit
coverage
k factor
nonlinear regression
nonparametric regression
tolerance interval


Robust Image Deblurring With an Inaccurate Blur Kernel Most existing nonblind image deblurring methods assume that the blur kernel is free of error. However, it is often unavoidable in practice that the input blur kernel is erroneous to some extent. Sometimes, the error could be severe, e. g., for images degraded by nonuniform motion blurring. When an inaccurate blur kernel is used as the input, significant distortions will appear in the image recovered by existing methods. In this paper, we present a novel convex minimization model that explicitly takes account of error in the blur kernel. The resulting minimization problem can be efficiently solved by the so-called accelerated proximal gradient method. In addition, a new boundary extension scheme is incorporated in the proposed model to further improve the results. The experiments on both synthesized and real images showed the efficiency and robustness of our algorithm to both the image noise and the model error in the blur kernel.

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

accelerated proximal gradient (apg) method


Proposition of a space-filling curve family with Hilbert curve comparable locality preserving Space-filling curves are widely used in many fields of computer science in which the locality preserving is often seen as the criterion to select the curve type working in an application. This is why the Hilbert curve, as the best locality preserving curve, is mainly used. However, are there other curves who preserve the locality as well as to the Hilbert curve ? In this paper; we propose a flexible method for constructing a family of multidimensional space-filling curves whose locality preserving level is comparable or better than that of the Hilbert curve. Comparative experimental tests tend to confirm these results. Note that the evidence on the validity of our proposal is advanced, its implementation is illustrated through numerous examples.

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

space-filling curve
fractal
primitive pattern
generalization


web-based intuitive and effective design of symmetric tiles This paper presents a new approach for intuitive and effective design of periodic symmetric tiles. We observe that planar graphs can effectively represent symmetric tiles and graph drawing provides an intuitive paradigm for designing symmetric tiles. Moreover, based on our theoretical work to represent hexagonal symmetry by rectangular symmetry, we are able to present all symmetric tiles as graphs embedded on a torus and based on simple modulo operations. This approach enables us to develop a simple and efficient algorithm, which has been implemented in Java. By using this software, designers, architects and artists can create interesting symmetric tiles directly on the web. We also have designed a few examples of symmetric tiles to show the effectiveness of the approach.

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


Scalable Metadata Management Through OSD plus Devices We present the design and implementation of both an enhanced new type of OSD device, the OSD+ device, and a metadata cluster based on it. The new OSD+ devices support data objects and directory objects. Unlike "data" objects, present in a traditional OSD, directory objects store file names and attributes, and support metadata-related operations. By using OSD+ devices, we show how the metadata cluster of the Fusion Parallel File System (FPFS) can effectively be managed by all the servers in a system, improving the performance, scalability and availability of the metadata service. We also describe how a directory with millions of files, and accessed by thousands of clients at the same time, is efficiently distributed across several servers to provide high IOPS rates. The performance of our metadata cluster based on OSD+s has been evaluated and compared with that achieved by Lustre. The results show that our proposal obtains a better throughput than Lustre when both use a single metadata server, easily getting improvements of more than 60-80%, and that the performance scales with the number of OSD+s. They also show that FPFS is able to provide a sustained throughput of more than 70,000 creates per second, and more than 120,000 stats per second, for huge directories on a cluster with just 8 OSD+s.

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

metadata cluster
osd
fusion parallel file system
scalability


k-farthest-neighbors-based concept boundary determination for support vector data description Support vector data description (SVDD) is very useful for one-class classification. However, it incurs high time complexity in handling large scale data. In this paper, we propose a novel and efficient method, named K-Farthest-Neighbors-based Concept Boundary Detection (KFN-CBD for short), to improve the SVDD learning efficiency on large datasets. This work is motivated by the observation that SVDD classifier is determined by support vectors (SVs), and removing the non-support vectors (non-SVs) will not change the classifier but will reduce computational costs. Our approach consists of two steps. In the first step, we propose the K-farthest-neighbors method to identify the samples around the hyper-sphere surface, which are more likely to be SVs. At the same time, a new tree search strategy of M-tree is presented to speed up the K-farthest neighbor query. In the second step, the non-SVs are eliminated from the training set, and only the identified boundary samples are used to train the SVDD classifier. By removing the non-SVs, the training time of SVDD can be substantially reduced.Extensive experiments have shown that KFN-CBD achieves around 6 times speedup compared to the standard SVDD, and obtains the comparable classification quality as the entire dataset used.

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


Variegated competing peer-to-peer systems with selfish peers Thanks to years of research and development, current peer-to-peer (P2P) networks are anything but a homogeneous system from a protocol perspective. Specifically, even for the same P2P system (e.g., BitTorrent), a large number of protocol variants have been designed based on game theoretic considerations with the objective to gain performance advantages. We envision that such variants could be deployed by selfish participants and interact with the original prescribed protocol as well as among them. Consequently, a meta-strategic situationjudicious selection of different protocol variantswill emerge. In this work, we propose the usage of population games, evolutionary and learning dynamics in the study of node coevolution for selfish protocol selection, and, most importantly, its impact on system performance. We apply our models and algorithms to P2P systems and draw on extensive simulations to characterize the dynamics of selfish protocol selection. In particular, our proposed distributed algorithms outperform others in terms of download rate. We believe that evolution patterns identified in our study will shed light on both further theoretical study and the design of next generation distributed systems.

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

algorithms design
population coevolution
node rationality


A note on channel performance under consignment contract with revenue sharing Wang et al. [Y. Wang, L. Jiang, Z.J. Shen, Channel performance under consignment contract with revenue sharing. Management Science 50 (2004), 3447] indicate that a decentralized supply chain cannot be perfectly coordinated. This note provides a cooperative game model that implements profit sharing between the manufacturer and the retailer to achieve their cooperation. When the manufacturer and the retailer are assumed to be risk-neutral, under a very mild restriction on the demand distribution function, the cooperative game model can achieve its unique equilibrium solution in iso-price-elastic or linear demand case. Under the revenue sharing agreement attached with the equilibrium payment scheme, the decentralized supply chain can be perfectly coordinated.

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


Some subsets of points in the plane associated to truncated ReedMuller codes with good parameters We gives some examples of subsets of points in the projective plane associated to truncated generalized projective ReedMuller codes with good parameters, of dimensions 6 and 10 over GF(7) GF ( 7 ) , GF(8) GF ( 8 ) and GF(9) GF ( 9 ) .

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

arcs in finite plane
bzout's theorem
generalized reedmuller codes


Power Optimization With Power Islands Synthesis With the migration to Deep Sub-Micron process technologies, the power consumption of a circuit has come to the forefront of concerns, and as a result, the power has become a critical design parameter. This paper presents a novel high-level synthesis methodology, called Power Islands Synthesis, that eliminates the spurious switching activity and the leakage in a great portion of the resulting circuit by partitioning it into islands. Each island is a cluster of logic whose power can be controlled independently from the rest of the circuit and hence can be completely powered down when all of the logic it contains is idling. The partitioning is done in such a way that the components with maximally overlapping lifetimes are placed on the same island. By powering down an island during its idle cycles, the following occur: 1) The spurious switching that results from the broadcast to idle components is silenced and 2) the power consumption due to leakage in inactive components is eliminated. Experiments conducted on several synthesis benchmarks implemented at the layout level with a 65-nm process technology and simulated using a transistor-level simulator showed power savings ranging from 5% to 20% due to our methodology. The reported savings were entirely from the power down of combinational elements (functional resources) of the data path.

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

partitioning
power islands
power optimization
spurious switching activity

behavioral synthesis
clustering
dynamic power
high level synthesis
leakage power
power islands synthesis


exposing digital video forgery by ghost shadow artifact In the digital multimedia era, it is increasingly important to ensure the integrity and authenticity of the vast volumes of video data. A novel approach is proposed for detecting video forgery based on ghost shadow artifact in this paper. Ghost shadow artifact is usually introduced when moving objects are removed by video inpainting. In our approach, ghost shadow artifact is accurately detected by inconsistencies of the moving foreground segmented from the video frames and the moving track obtained from the accumulative frame differences, thus video forgery is exposed. Experiments show that our approach achieves promising results in video forgery detection.

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

digital tampering
digital video forensics


High-fidelity C/C++ code transformation As software systems become increasingly massive, the advantages of automated transformation tools are clearly evident. These tools allow the machine to both reason about and manipulate high-level source code. They enable off-loading of mundane and laborious programming tasks from human developer to machine, thereby reducing cost and development time frames. Although there has been much work in software transformation, there still exist many hurdles in realizing this technology in a commercial domain. From our own experience, there are two significant problems that must be addressed before transformation technology can be usefully applied in a commercial setting. These are: (1) Avoiding disruption of the style (i.e., layout and commenting) of source code and the introduction of any undesired modifications that can occur as a side effect of the transformation process. (2) Correct automated handling of C preprocessing and the presentation of a semantically correct view of the program during transformation. Many existing automated transformation tools require source to be manually modified so that preprocessing constructs can be parsed. The real semantic of the program remains obscured resulting in the need for complicated analysis during transformation. Many systems also resort to pretty printing to generate transformed programs, which inherently disrupts coding style. In this paper we describe our own C/C++ transformation system, Proteus, that addresses both these issues. It has been tested on millions of lines of commercial CIC++ code and has been shown to meet the stringent criteria laid out by Lucent's own software developers. (C) 2007 Published by Elsevier B.V.

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

source transformations high-fidelity preprocessing


VirtualKnotter: Online virtual machine shuffling for congestion resolving in virtualized datacenter ? Our measurements on production datacenter traffic together with recently-reported results (Kandula et al.) [1] suggest that datacenter networks suffer from long-lived congestion caused by core network oversubscription and unbalanced workload placement. In contrast to traditional traffic engineering approaches that optimize flow routing, in this paper, we explore the opportunity to address the continuous congestion via optimizing VM placement in virtualized datacenters. To this end, we present VirtualKnotter to reduce congestion with controllable VM migration traffic as well as low migration time, which includes an online VM placement algorithm and an efficient VM migration scheduling algorithm. Our evaluation with both real and synthetic traffic patterns shows that VirtualKnotter performs close to the baseline algorithm in terms of link unitization, with only 510% migration traffic of the baseline algorithm. Furthermore, VirtualKnotter decreases link congestion time by 53% for the production datacenter traffic.

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

link congestion
vm placement
vm migration
datacenter


A new family of Newton-type iterative methods with and without memory for solving nonlinear equations In this paper, we present a new family of two-step iterative methods for solving nonlinear equations. The order of convergence of the new family without memory is four requiring three functional evaluations, which implies that this family is optimal according to Kung and Traubs conjecture Kung and Traub (J Appl Comput Math 21:643651, 1974). Further accelerations of convergence speed are obtained by varying a free parameter in per full iteration. This self-accelerating parameter is calculated by using information available from the current and previous iteration. The corresponding R-order of convergence is increased form 4 to \(\frac{5+\sqrt{17}}{2}\approx 4.5616, \frac{5+\sqrt{21}}{2}\approx 4.7913\) and 5. The increase of convergence order is attained without any additional calculations so that the family of the methods with memory possesses a very high computational efficiency. Another advantage of the new methods is that they remove the severe condition \(f^{\prime }(x)\) in a neighborhood of the required root imposed on Newtons method. Numerical comparisons are made to show the performance of our methods, as shown in the illustration examples.

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

iterative methods with memory
optimal order
r-order convergence
root-finding
65h05
65b99


Convergence acceleration using the residual shape technique when solving structure-acoustic coupling with the Patch Transfer Functions method The forced response of the structure water-filled cavity system is investigated from the Patch Transfer Functions method. In such a case, a poor convergence of the PTF method is observed when using standard mode expansion to build the cavity-PTF. To improve its convergence and maintain the advantages of sub-structuring, residual shapes are introduced in the cavity-PTF computation, which is the new material of this article. This technique is successfully applied on numerical examples, highlighting the interest of such an approach, especially in heavy fluid. (C) 2010 Elsevier Ltd. All rights reserved.

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


Convolutional codes over groups The basic algebraic structure theory of convolutional codes and their trellises is developed simultaneously for codes over groups, rings, and fields. The first part, which covers fundamental notions such as minimality and observability, is semi tutorial in that most definitions are already standard (within the modern behavioral theory), as are some of the formally stated results. However, some of the pivotal results-emphasizing the role of observability as the basic well-behavedness condition for codes-are new, and several previous results are given simplified proofs, The usefulness of the behavioral approach even for convolutional codes over fields is demonstrated by a new minimality test for encoders as well as by the straightforward derivation of some known minimality criteria for generator matrices from the basic minimality criteria for group trellises, The second part of the paper deals with issues that are specific to codes over rings and groups. The main result is a concise characterization-the first such-of those groups that can appear as the branch group of any group trellis, It is further shown how such groups are ''presented'' by shift registers. A new large class of noncommutative convolutional codes is also given.

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

group codes
linear systems
coded modulation


A data-integrated simulation model to forecast ground-level ozone concentration Elevated ground-level ozone is hazardous to peoples health and destructive to the environment. This research develops a novel data-integrated simulation to forecast ground-level ozone (SIMGO) concentration based on a real data set collected from seven monitoring sites in the Dallas-Fort Worth area between January 1, 2005 and December 31, 2007. Tree-based models and kernel density estimation (KDE) were utilized to extract important knowledge from the data for building the simulation. Classification and Regression Trees (CART), data mining tools for prediction and classification, were used to develop two tree structures in order to forecast ground-level ozone based on factors such as solar radiation and outdoor temperature. Kernel density estimation is used to estimate continuous distributions for the ground-level ozone concentration for seven days in advance. One week forecasts obtained from SIMGO for different months of a year is presented.

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


computing in coq with infinite algebraic data structures Computational content encoded into constructive type theory proofs can be used to make computing experiments over concrete data structures. In this paper, we explore this possibility when working in Coq with chain complexes of infinite type (that is to say, generated by infinite sets) as a part of the formalization of a hierarchy of homological algebra structures.

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

formal methods
program verification
theorem proving
computer algebra


Examining the impact of computer-mediated social networks on individual consumerism environmental behaviors CMSNs influence ones awareness and intention in protecting the environment. Message cues from influential actors in CMSNs support environmental consumerism. Opportunities exist to influence individuals to protect the environment. Important to examine technologys impact on individual environmental responsibility.

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

sustainability
computer-mediated social networks


Estimation of flexible needle deflection in layered soft tissues with different elastic moduli The estimation of needle deflection when the needle interacts with biological tissue is challenging in needle steering. Most previous studies have used homogeneous tissue models to estimate the deflection of a needle. However, biological tissue typically has a layered structure with variable mechanical properties and geometric features. In this study, we propose a needle deflection model with a double-layered elastic medium. Each layer possesses distinct mechanical properties, which result in inconsistent degrees of friction force on the needle surface, needle-cutting force, and forces caused by the stiffness of the elastic medium. The model uses the RayleighRitz method to analytically estimate the needle deflection. To validate the model, needle steering experiments were performed using double-layered tissue phantoms and porcine tissues. The experimental results revealed that changes in reaction force at the needle base occurred when the needle passed through the boundary between the two layers. The mean absolute error between the estimated and measured needle tip trajectory was 0.880.30mm for the double-layered tissue phantom and 1.850.73mm for the porcine tissue. These results are comparable with previous studies of homogeneous tissue. The proposed model could improve needle steering in biological tissues, which consist of multiple layers.

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


Algorithm 902: GPOPS, A MATLAB Software for Solving Multiple-Phase Optimal Control Problems Using the Gauss Pseudospectral Method An algorithm is described to solve multiple-phase optimal control problems using a recently developed numerical method called the Gauss pseudospectral method. The algorithm is well suited for use in modern vectorized programming languages such as FORTRAN 95 and MATLAB. The algorithm discretizes the cost functional and the differential-algebraic equations in each phase of the optimal control problem. The phases are then connected using linkage conditions on the state and time. A large-scale nonlinear programming problem (NLP) arises from the discretization and the significant features of the NLP are described in detail. A particular reusable MATLAB implementation of the algorithm, called GPOPS, is applied to three classical optimal control problems to demonstrate its utility. The algorithm described in this article will provide researchers and engineers a useful software tool and a reference when it is desired to implement the Gauss pseudospectral method in other programming languages.

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

languages
optimal control
nonlinear programming
phases

algorithms
dynamic optimization
nonlinear optimization
computational methods


Uniform approximations for the M/G/1 queue with subexponential processing times This paper studies the asymptotic behavior of the steady-state waiting time, W(infinity), of the M/G/1 queue with Subexponential processing times for different combinations of traffic intensities and overflow levels. In particular, we provide insights into the regions of large deviations where the so-called heavy-traffic approximation and heavy-tail asymptotic hold. For queues whose service time distribution decays slower than e(-root t) we identify a third region of asymptotics where neither the heavy-traffic nor the heavy-tail approximations are valid. These results are obtained by deriving approximations for P(W(infinity) > x) that are either uniform in the traffic intensity as the tail value goes to infinity or uniform on the positive axis as the traffic intensity converges to one. Our approach makes clear the connection between the asymptotic behavior of the steady-state waiting time distribution and that of an associated random walk.

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

m/g/1 queue
subexponential distributions
heavy traffic
heavy tails
cramer series