A practical discrete-adjoint method for high-fidelity compressible turbulence simulations Methods and computing hardware advances have enabled accurate predictions of complex compressible turbulence phenomena, such as the generation of jet noise that motivates the present effort. However, limited understanding of underlying physical mechanisms restricts the utility of such predictions since they do not, by themselves, indicate a route to design improvements. Gradient-based optimization using adjoints can circumvent the flow complexity to guide designs, though this is predicated on the availability of a sufficiently accurate solution of the forward and adjoint systems. These are challenging to obtain, since both the chaotic character of the turbulence and the typical use of discretizations near their resolution limits in order to efficiently represent its smaller scales will amplify any approximation errors made in the adjoint formulation. Formulating a practical exact adjoint that avoids such errors is especially challenging if it is to be compatible with state-of-the-art simulation methods used for the turbulent flow itself. Automatic differentiation (AD) can provide code to calculate a nominally exact adjoint, but existing general-purpose AD codes are inefficient to the point of being prohibitive for large-scale turbulence simulations. Here, we analyze the compressible flow equations as discretized using the same high-order workhorse methods used for many high-fidelity compressible turbulence simulations, and formulate a practical spacetime discrete-adjoint method without changing the basic discretization. A key step is the definition of a particular discrete analog of the continuous norm that defines our cost functional; our selection leads directly to an efficient RungeKutta-like scheme, though it would be just first-order accurate if used outside the adjoint formulation for time integration, with finite-difference spatial operators for the adjoint system. Its computational cost only modestly exceeds that of the flow equations. We confirm that its accuracy is limited by computing precision, and we demonstrate it on the aeroacoustic control of a mixing layer with a challengingly broad range of turbulence scales. For comparison, the error from a corresponding discretization of the continuous-adjoint equations is quantified to potentially explain its limited success in past efforts to control jet noise. The differences are illuminating: the continuous-adjoint is shown to suffer from exponential error growth in (reverse) time even for the best-resolved largest turbulence scales. Implications for jet noise reduction and turbulence control in general are discussed.

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

adjoint methods
aeroacoustic optimization
high-order methods


Efficient micro immune optimization approach solving constrained nonlinear interval number programming This work investigates a possibility degree-based micro immune optimization approach to seek the optimal solution of nonlinear interval number programming with constraints. Such approach is designed under the guideline of the theoretical results acquired in the current work, relying upon interval arithmetic rules, interval order relation and immune theory. It involves in two phases of optimization. The first phase, based on a new possibility degree approach, assumes searching efficient solutions of natural interval extension optimization. This executes five modules - constraint bound handling, population division, dynamic proliferation, mutation and selection, with the help of a varying threshold of interval bound. The second phase collects the optimal solution(s) from these efficient solutions after optimizing the bounds of their objective intervals, in terms of the theoretical results. The numerical experiments illustrated that such approach with high efficiency performs well over one recent nested genetic algorithm and is of potential use for complex interval number programming.

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

nonlinear programming
interval analysis
optimal-valued interval


A real-time neuro-adaptive controller with guaranteed stability This paper presents a new model reference adaptive neuro-control scheme using feedforward neural networks with momentum back-propagation (MBP) learning algorithm. Training is done on-line to tune the parameters of the neuro-controller that provides the control signal. Noting that pre-learning is not required and the structure of overall system is very simple and straightforward. No additional controller or robustifying signal is required. Tracking performance is guaranteed via Lyapunov stability analysis. Both tracking error and neural network weights remain bounded. An interesting fact about the proposed approach is that it does not require a NN being capable of reconstructing globally model non-linearities.

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

intelligent control
neuro-controllers
adaptive control
multilayer perceptrons


A new automatic mass detection method for breast cancer with false positive reduction Mass localization is a crucial problem in computer-aided detection (CAD) system for the diagnosis of suspicious regions in mammograms. In this paper, a new automatic mass detection method for breast cancer in mammographic images is proposed. Firstly, suspicious regions are located with an adaptive region growing method, named multiple concentric layers (MCL) approach. Prior knowledge is utilized by tuning parameters with training data set during the MCL step. Then, the initial regions are further refined with narrow band based active contour (NBAC), which can improve the segmentation accuracy of masses. Texture features and geometry features are extracted from the regions of interest (ROI) containing the segmented suspicious regions and the boundaries of the segmentation. The texture features are computed from gray level co-occurrence matrix (GLCM) and completed local binary pattern (CLBP). Finally, the ROIs are classified by means of support vector machine (SVM), with supervision provided by the radiologist?s diagnosis. To deal with the imbalance problem regarding the number of non-masses and masses, supersampling and downsampling are incorporated. The method was evaluated on a dataset with 429 craniocaudal (CC) view images, containing 504 masses. Among them, 219 images containing 260 masses are used to optimize the parameters during MCL step, and are used to train SVM. The remaining 210 images (with 244 masses) are used to test the performance. Masses are detected with 82.4% sensitivity with 5.3 false positives per image (FPsI) with MCL, and after active contour refinement, feature analysis and classification, it obtained 1.48 FPsI at the sensitivity 78.2%. Testing on 164 normal mammographic images showed 5.18 FPsI with MCL and 1.51 FPsI after classification. Experiments on mediolateral oblique (MLO) images have also been performed, the proposed method achieved a sensitivity 75.6% at 1.38 FPsI. The method is also analyzed with free response operating characteristic (FROC) and compared with previous methods. Overall, the proposed method is a promising approach to achieve low FPsI while maintaining a high sensitivity.

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

mass detection
breast cancer
local binary pattern
support vector machine


"Distinguishability quantification of fuzzy sets" This paper presents some comments on the above paper regarding the manipulation of Gaussian fuzzy sets and provides two useful generalized formulas for both of similarity and similarity/possibility relationships of Gaussian fuzzy sets with different widths. (c) 2007 Elsevier Inc. 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

similarity measure
possibility measure
distinguishability measure


A method for optimization of the working point of the N-phase (N+1)-wire systems with nonlinear loads Purpose - The paper proposes to deal with the problems concerning the N-phase (N + 1)-wire system with sinusoidal voltage sources and nonlinear loads. In the model of the N-phase voltage source the inner impedance has been included. The problem of the optimization of working conditions of the system is a minimization of RMS value of its line currents as well as their distortions caused by nonlinear loads. Design/methodology/approach - The solution of this problem is based on the frequency domain. It is obtained by means of Lagrange's multipliers and the suitable measurement experiment. Findings - After optimization source currents are sinusoidal with minimized RMS values. After connection of the designed compensator to the system under research the phase currents are equal to determined active currents. Research limitations/implications - This method can be used for some classes of nonlinear loads, i.e. for systems with inertialess (non-reactive) elements, which consume the active power of the basic harmonic of the voltage source and where the currents of the system are periodical. The mentioned power is an additional constraint of the presented minimization. Practical implications - The working point of the system can be obtained by means of the compensator LC, RLC or (RLC,-R). It will always be a linear one and its structure consists of two components: elements with parameters determined for the basic harmonic and the filter for elimination of the higher harmonics caused by nonlinear loads. Originality/value - The presented method has been generalized for N-phase (N + 1)-wire systems.

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

electric current
optimization techniques


OPTIMUS:online persistent tracking and identification of many users for smart spaces A smart space, which is embedded with networked sensors and smart devices, can provide various useful services to its users. For the success of a smart space, the problem of tracking and identification of smart space users is of paramount importance. We propose a system, called Optimus, for persistent tracking and identification of users in a smart space, which is equipped with a camera network. We assume that each user carries a smartphone in a smart space. A camera network is used to solve the problem of tracking multiple users in a smart space and information from smartphones is used to identify tracks. For robust tracking, we first detect human subjects from images using a head detection algorithm based on histograms of oriented gradients. Then, human detections are combined to form tracklets and delayed track-level association is used to combine tracklets to build longer trajectories of users. Last, accelerometers in smartphones are used to disambiguate identities of trajectories. By linking identified trajectories, we show that the average length of a track can be lengthened by over six times. The performance of the proposed system is evaluated extensively in realistic scenarios.

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

tracking
identification
smart space
smartphone
camera network


asynchronous control of discrete event simulation Traditionally, discrete-event simulations have been controlled in a synchronous manner. The synchronization is achieved through a data-structure, normally referred to as an events-list. Manipulations on this list can often be very expensive and can thus detract from the attractiveness of simulation as a problem-solving tool. An alternative to this situation is asynchronous simulation which has found considerable exposure in the literature of distributed simulation. Asynchronous simulations do not always process events in their natural order of occurrence. As a result the events-list and the associated costs may be eliminated. This paper explores the possibilities for asynchronous control of traditional simulations. It lays down the requirements for an effective asynchronous algorithm, and proposes a framework for simulations with such an algorithm.

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

requirements
discrete event simulation
framework
order
simulation
synchronization
tool
process
algorithm
paper
control

situated
association
event
asynchronicity
data structures
distributed simulation
effect


Clinical Perspectives for the Use of Melatonin as a Chronobiotic and Cytoprotective Agent The circadian time system involves periodic gene expression at the cellular level, synchronized by a hierarchically superior structure located in the hypothalamic suprachiasmatic nuclei. Treatment of circadian rhythm disorders has led to the development of a new type of agent called chronobiotics among which melatonin is the prototype. In elderly insomniacs, melatonin treatment decreased sleep latency and increased sleep efficiency, particularly slow-wave sleep. The effect of melatonin on sleep is the consequence of increasing sleep propensity (by augmenting the amplitude of circadian clock oscillation via MT1 receptors) and of synchronizing the circadian clock via MT2 receptors. Daily melatonin production decreases with age and in several pathologies, attaining its lowest values in Alzheimer's disease (AD) patients. About 45% of AD patients have disruptions in their sleep and sundowning agitation. Generally, melatonin treatment decreases sundowning in AD patients and reduced variability of sleep onset time. Both open and controlled studies have indicated a significant decrease of cognitive deterioration in AD patients treated with melatonin. The mechanisms accounting for the possible therapeutic effect of melatonin in AD patients may be manifold. On one hand, melatonin treatment promotes slow-wave sleep in the elderly and could be beneficial by augmenting the restorative phases of sleep. On the other hand, melatonin protects neurons against ?-amyloid toxicity. By its combined chronobiotic and cytoprotective properties melatonin provides an innovative neuroprotective strategy to reduce the cost of lifetime treatment of some neuropsychiatric disorders.

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

aging
insomnia
alzheimer's disease
neuroprotection


foundations of schema mapping management In the last few years, a lot of attention has been paid to the specification and subsequent manipulation of schema mappings, a problem which is of fundamental importance in metadata management. There have been many achievements in this area, and semantics have been defined for operators on schema mappings such as composition and inverse. However, little research has been pursued towards providing formal tools to compare schema mappings, in terms of their ability to transfer data and avoid storing redundant information, which has hampered the development of foundations for more complex operators as many of them involve these notions. In this paper, we address the problem of providing foundations for metadata management by developing an order to compare the amount of information transferred by schema mappings. From this order we derive several other criteria to compare mappings, we provide tools to deal with these criteria, and we show their usefulness in defining and studying schema mapping operators. More precisely, we show how the machinery developed can be used to study the extract and merge operators, that have been identified as fundamental for the development of a metadata management framework. We also use our machinery to provide simpler proofs for some fundamental results regarding the inverse operator, and we give an effective characterization for the decidability of the well-known schema evolution problem.

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

model management
data exchange
data integration


Smart components-based servo pneumatic actuation systems Pneumatic drives are the most widely used form of industrial actuation system. However, research in relevant areas is very limited, often carried out, if at all, in isolated environments. There is a lack of strategic thinking and tools, which can enable developments to go forward in an efficient manner. In recognising the advancements in PC-technology, fieldbus systems, microprocessors and computing technologies, the authors advocate the concept of smart components-based servo pneumatic actuation systems. The paper expands on the components-based nature of pneumatic drive systems to identify design templates for smart valves, smart sensors, smart actuators, etc. The development of components-based pneumatic drive systems is considered in the context of a recently completed UK EPSRC funded research project on high speed servo-pneumatic actuation, addressing issues such as simulation tools, algorithm development, sizing, tuning, installation and commissioning. A high speed pneumatically-driven gantry pick-and-place handling system with novel design features is presented to demonstrate the capability and attributes of pneumatic drives for more sophisticated applications.

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

pneumatics
servo actuators
control
components-based


Accuracy and stability of a set of free-surface time-domain boundary element models based on B-splines An analysis is given for the accuracy and stability of some perturbation-based time-domain boundary element models (BEMs) with B-spline basis functions, solving hydrodynamic free-surface problems, including forward speed effects. The spatial convergence rate is found as a function of the order of the B-spline basis. It is shown that for all the models examined the mixed implicit-explicit Euler time integration scheme is correct to second order. Stability diagrams are found for models based on B-splines of orders third through to sixth for two different time integration schemes. The stability analysis can be regarded as an extension of the analysis by Vada and Nakos [Vada T, Nakos DE. Time marching schemes for ship motion simulations. In Proceedings of the gth International Workshop on Water Waves and Floating Bodies, St. John's, Newfoundland, Canada, 1993; 155-158] to include B-splines of orders higher than three (piecewise quadratic polynomials) and to include finite water depth and a current at an oblique angle to the model grid. Copyright (C) 2000 John Wiley & Sons, Ltd.

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

boundary element model
b-splines
higher-order basis functions
three-dimensional
time-domain


hierarchies for semantic classes We show that for any constant a, ZPP/b(n) strictly contains ZPTIME(n a )/b(n) for some b(n) = O(log n log log n). Our techniques are very general and give the same hierarchy for all common semantic time classes including RTIME, NTIME ? coNTIME, UTIME, MATIME, AMTIME and BQTIME.We show a stronger hierarchy for RTIME: For every constant c, RP/1 is not contained in RTIME(n c )/(log n) 1/2c . To prove this result we first prove a similar statement for NP by building on Zk's proof of the nondeterministic time hierarchy.

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


alternative custodians for congestion control in delay tolerant networks We approach the problem of handling storage congestion at store-and-forward (DTN) nodes by migrating stored data to neighbors. The proposed solution includes a set of algorithms to determine which messages should be migrated to which neighbors and when. It also includes an extension to the DTN custody transfer mechanism enabling a "pull" form of custody transfer where a custodian may request custody of a message from another custodian. This approach allows us to decouple the problem of storage allocation among a relatively proximal group of storage nodes from the overall problem of path selection across a larger network. Doing so admits the possibility of localized routing loops for some messages which has been shown to be desirable for avoiding some head-of-line blocking problems. We select eligible storage neighbors using a function of available storage and incident link characteristics. Using simulation, we evaluate this approach and show how migrating custodian storage in this fashion can improve message completion rate by as much as 48\% for some storage-constrained DTN networks.

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


Clinical Utility of Array CGH for the Detection of Chromosomal Imbalances Associated with Mental Retardation and Multiple Congenital Anomalies Microarray-based comparative genomic hybridization (array CGH) has revolutionized clinical cytogenetics, as it provides a relatively quick method to scan the genome for gains and losses of chromosomal material with significantly higher resolution and greater clinical yield than was previously possible. A number of different array CGH platforms have emerged and are being used successfully in the diagnostic setting. In the past few years, these new methodologies have led to the identification of novel genomic disorders in patients with developmental delay/mental retardation and/or multiple congenital anomalies (DD/MR/MCA) as well as the discovery that each individual carries inherited copy number variations (CNV) whose contributions to genetic variation and complex disease are not yet well understood. Although array CGH is currently being used as an adjunct test to standard karyotype analysis, it is likely to become the genetic test of choice, especially in cases of idiopathic MR/MCA.

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

array comparative genomic hybridization (cgh)


Electron mobility in selectively Si-doped GaAs/NAl0.3Ga0.7As quantum well heterostructures with super-flat interfaces grown on (411)A GaAs substrates by molecular beam epitaxy Reduced roughness of GaAs/Al0.3Ga0.7As heterointerfaces formed on (411)A substrates by Molecular Beam Epitaxy (MBE) was confirmed by measuring Two Dimensional Electron Gas (2DEG) mobility in selectively Si doped GaAs/NAl0.3Ga0.7As Quantum Well (QW) structures with 4, 6, 8, or 50-nm thick GaAs wells. Below a QW thickness (Lw) of 8 nm, the 2DEG mobility at 15 K was mainly determined by interface roughness scattering and rapidly decreases with decreasing well thickness. The 2DEG in the (411)A selectively doped QW sample with Lw=4 nm has 34% higher mobility (?=32?500 cm2/Vs) at 15 K than that of the (100) sample simultaneously grown (24?200 cm2/Vs). Every (411)A sample with Lw?8 nm has 2434% higher 2DEG mobility than the (100) sample simultaneously grown. This result indicates that smoother GaAs/Al0.3Ga0.7As interfaces were realized on the (411)A substrates. The (411)A sample with the 50-nm thick well shows 84% higher 2DEG mobility than the (100) sample simultaneously grown and its mobility is not determined by interface roughness scattering but ionized impurity scattering, which may suggest that MBE growth of GaAs and AlGaAs on the (411) GaAs substrates reduces unintentional impurity incorporation.

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

selectively si doped gaas/nalgaas quantum well


Rapid Physarum Algorithm for shortest path problem A heuristic method is proposed to make a bio-inspired algorithm, called as Physarum Algorithm, more efficient. We have demonstrated the efficiency of the proposed Rapid Physarum Algorithm on a variety of networks. The proposed Rapid Physarum Algorithm greatly decreases the time consumption of this bio-inspired mathematic model.

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

rapid physarum algorithm
shortest path problem


A rate control scheme for adaptive real-time applications in IP networks with lossy links and long round trip times Currently there is no control for real-time traffic sources in IP networks. This is a serious problem because real-time traffic can not only congest the network but can also cause unfairness and starvation of TCP traffic. However, it is not possible to apply current solutions for Internet to the networks with high bandwidth-delay products and high bit error rates. The channel errors may result in inaccurate congestion control decisions and unnecessary rate throttles leading to severe performance degradation. This problem is amplified in the links with high bandwidth-delay products, since the link is inefficiently utilized for a very long time until the unnecessary rate throttle is recovered. In this paper, a new Rate Control Scheme, RCS, is introduced for real-time interactive applications in networks with high bandwidth-delay products and high bit error rates. RCS is based on the concept of using dummy packets to probe the availability of network resources. Dummy packets are treated as low priority packets and consequently they do not affect the throughput of actual data traffic. Therefore, RCS requires all the routers in the connection path to support some priority policy. A new algorithm is also proposed to improve the robustness of the RCS to temporal signal loss conditions. The delay-bound considerations for real-time traffic sources using RCS rate control scheme are also investigated. Simulation experiments show that in environments with high bandwidth-delay products and high bit error rates, RCS achieves high throughput performance without penalizing TCP connections.

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

flow control
high bandwidth-delay products
real-time protocols


hypertext and the new oxford english dictionary An alternative to manual composition of hypertext databases is conversion from existing texts. Such conversion often requires careful analysis of the text document in order to determine how best to represent its structure. We illustrate some of the issues of conversion with an analysis of the Oxford English Dictionary.

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

documentation database conversation compositing dictionaries


Multiphase segmentation using an implicit dual shape prior: Application to detection of left ventricle in cardiac MRI Novel segmentation algorithm is presented incorporating shape prior. Segmentation algorithm is developed in a variational framework using level sets. The prior uses the anatomical shape similarity between endo- and epicardium. Their dissimilarity is modeled following a Gaussian distribution.

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

shape analysis
implicit shape prior
level set function
magnetic resonance imaging
cardiac disease


Configurable communication middleware for clusters with multiple interconnections High performance scientific and engineering applications running on clusters have different communication requirements. Current cluster configurations typically provide multiple network interfaces per node and multiple interconnections among nodes. However, transport protocols such as TCP do not utilize existing multiple network interfaces to enhance communication performance. This paper introduces a new configurable communication model utilizing multiple interconnections. The model adds mechanisms to manage and enhance the overall communication performance of clusters. These configurations include the use of parallel message transfers, the separation of the transfer channels between small messages and large messages, and load balancing among the channels. The main advantages of the model are: (1) providing a flexible, enhanced network infrastructure, (2) hiding the technical details of the heterogeneous network resources from the applications, and (3) providing an easy and flexible way to extend the network capacities for specific nodes. To illustrate the advantages and performance enhancements of the model, a prototype was implemented to experimentally evaluate the cluster network performance, which showed considerable gains.

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

cluster computing
multiple networks
configurable networking


Tweeting the terror: modelling the social media reaction to the Woolwich terrorist attack Little is currently known about the factors that promote the propagation of information in online social networks following terrorist events. In this paper we took the case of the terrorist event in Woolwich, London in 2013 and built models to predict information flow size and survival using data derived from the popular social networking site Twitter. We define information flows as the propagation over time of information posted to Twitter via the action of retweeting. Following a comparison with different predictive methods, and due to the distribution exhibited by our dependent size measure, we used the zero-truncated negative binomial (ZTNB) regression method. To model survival, the Cox regression technique was used because it estimates proportional hazard rates for independent measures. Following a principal component analysis to reduce the dimensionality of the data, social, temporal and content factors of the tweet were used as predictors in both models. Given the likely emotive reaction caused by the event, we emphasize the influence of emotive content on propagation in the discussion section. From a sample of Twitter data collected following the event (N=427,330) we report novel findings that identify that the sentiment expressed in the tweet is statistically significantly predictive of both size and survival of information flows of this nature. Furthermore, the number of offline press reports relating to the event published on the day the tweet was posted was a significant predictor of size, as was the tension expressed in a tweet in relation to survival. Furthermore, time lags between retweets and the co-occurrence of URLS and hashtags also emerged as significant.

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

social network analysis
information propagation
information spreading
sentiment analysis
opinion mining
predictive models


a system architecture for the extension of structured information spaces by coordinated cscw services The World Wide Web is an emerging platform for information systems; however established system architectures for web systems focus mainly on the creation and storage of consistent hypermedia information structures and on the efficient distribution of the resulting documents. The interaction between the information users is seldom supported. As many application scenarios profit greatly from human interaction, the paper presents a platform- and application-independent generic system architecture designed to extend existing web-based information systems by coordinated services for human interaction. One prototype implementation of the architecture supports user awareness and human interaction on corporate web sites.

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

group interaction
web-based human interaction


rapid computation of distance estimators from nucleotide and amino acid alignments Distance estimators are needed as input for popular distance based phylogenetic reconstruction methods such as UPGMA and neighbour-joining. Computation of these takes O ( n 2 l ) time for n sequences with length l which is usually fast compared to reconstructing a phylogenetic tree of n taxa. However, with the introduction of fast search heuristics for distance based phylogenetic reconstruction methods, the computation of distance estimators has become a bottleneck especially for long sequences. Elias et al. have shown how distance estimators can be computed efficiently from unaligned nucleotide sequences using vectorisation of code. In this paper we extend their method to allow efficient computation of distance estimators from aligned nucleotide and amino acid sequences using vectorisation of code and parallelisation on both CPUs and GPUs. Experiments are presented which show an increase in performance of up to 36x and 8x relative to the naive approach when computing distance estimators from nucleotides and amino acids alignments respectively.

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

parallelization
gpu
vectorization
phylogenetic distance estimator
phylogenetic inference


On the query complexity of finding a local maximum point We calculate the minimal number of queries sufficient to find a local maximum point of a function on a discrete interval, for a model with M parallel queries, M greater than or equal to 1. Matching upper and lower bounds are obtained. The bounds are formulated in terms of certain Fibonacci type sequences of numbers. (C) 2002 Elsevier Science 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

computational complexity
decision trees
local maximum search
fibonacci numbers


Damage detection and quantification using transmissibility Structures experience various types of loads along their lifetime, which can be either static or dynamic and may be associated to phenomena of corrosion and chemical attack, among others. As a consequence, different types of structural damage can be produced; the deteriorated structure may have its capacity affected, leading to excessive vibration problems or even possible failure. It is very important to develop methods that are able to simultaneously detect the existence of damage and to quantify its extent. In this paper the authors propose a method to detect and quantify structural damage, using response transmissibilities measured along the structure. Some numerical simulations are presented and a comparison is made with results using frequency response functions. Experimental tests are also undertaken to validate the proposed technique.

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

damage
transmissibility
frequency response functions


An analysis of an incentive problem considering non-monetary utility The present paper describes a new approach to the agency model, which is a cybernetic model designed to analyze the situation in which an economic actor (the principal) controls the behavior of another actor (the agent), by including the factor of non-monetary utility (intrinsic motivation). The new model addresses an incentive problem in an organization. An organization is considered to be a system constituted by the principal and the agent. Two state variables of this system, namely productivity and intrinsic motivation, are the focus of the present study. The effect of these variables on how to offer incentive is analyzed. The following results were obtained: when productivity is high and the strength of intrinsic motivation and uncertainty of output are low, organizations should introduce performance-based incentive system.

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


Model net: A representation of the static structure of modelbase Model net proposed in this paper is a kind of directed graph used to represent and analyze the static structure of a modelbase. After the formal definition of the model net was given, a construction algorithm is introduced. Then, two simplification algorithms are put forward to show how this approach can reduce the computational complexity of model composition for a specific decision problem. In succession, a model composition algorithm is worked out based on the simplification algorithms. As a result, this algorithm is capable of finding out all the candidate composite models for a specific decision problem. Finally, several advantages of the model net are discussed briefly.

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

model management system
decision support system


HTN: A new hierarchical interconnection network for massively parallel computers Interconnection networks usually suffer from Little's Law: low cost implies low performance and high performance is obtained high cost. However, hierarchical interconnection networks provide high performance at low cost by exploring the locality that exists in communication patterns of massively parallel computers. In this paper, we propose a new hierarchical interconnection network, called Hierarchical Torus Network (HTN). This network reduces the number of vertical links in 3D stacked implementation while maintaining good network features. This paper addresses the architectural details of the HTN, and explores aspects such as the network diameter, average distance, bisection width, peak number of vertical links, and VLSI layout area of the HTN as well as for several commonly used networks for parallel computers. It is shown that the HTN possesses several attractive features including small diameter, small average distance, small number of wires, a particularly small number of vertical links, and economic layout area.

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

hierarchical network
network performance
and layout area


Understanding the impact of rapid releases on software quality Many software companies are shifting from the traditional multi-month release cycle to shorter release cycles. For example, Google Chrome and Mozilla Firefox release new versions every 6 weeks. These shorter release cycles reduce the users waiting time for a new release and offer better feedback and marketing opportunities to companies, but it is unclear if the quality of the software product improves as well, since developers and testers are under more pressure. In this paper, we extend our previous empirical study of Mozilla Firefox on the impact of rapid releases on quality assurance with feedback by Mozilla project members. The study compares crash rates, median uptime, and the proportion of pre- and post-release bugs in traditional releases with those in rapid releases, and we also analyze the source code changes made by developers to identify potential changes in the development process. We found that (1) with shorter release cycles, users do not experience significantly more pre- or post-release bugs (percentage-wise) and (2) bugs are fixed faster, yet (3) users experience these bugs earlier during software execution (the program crashes earlier). Increased integration activity and propagation of harder bugs to later versions account for some of these findings. Overall, our case study suggests that a clear release engineering process with thorough automation is one of the major challenges when switching to rapid releases.

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


A cognitive tool for teaching the addition/subtraction of common fractions: a model of affordances The aim of this research is to devise a cognitive tool for meeting the diverse needs of learners for comprehending new procedural knowledge. A model of affordances on teaching fraction equivalence for developing procedural knowledge for adding/subtracting fractions with unlike denominators was derived from the results of a case study of an initial prototype of a graphical partitioning model. Offering affordances in our model makes available profitable spaces for learners to interact in ways that meet their needs. This model of affordances was evaluated by a pre-test-post-test control group design to study the performance of the experimental group in learning with the model. Results of the study indicated that the model afforded learners, with various abilities for learning, knowledge of fraction equivalence. The key for mediating the generation of procedural knowledge for adding/subtracting fractions with unlike denominators in working with our cognitive tool was the concept of fraction equivalence and the capability of computing this. (c) 2004 Elsevier Ltd. All rights reserved.

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

evaluation of cal systems
applications in subject areas
improving classroom teaching
teaching/learning strategies
elementary education


Using affective parameters in a content-based recommender system for images There is an increasing amount of multimedia content available to end users. Recommender systems help these end users by selecting a small but relevant subset of items for each user based on her/his preferences. This paper investigates the influence of affective metadata (metadata that describe the user's emotions) on the performance of a content-based recommender (CBR) system for images. The underlying assumption is that affective parameters are more closely related to the user's experience than generic metadata (e.g. genre) and are thus more suitable for separating the relevant items from the non-relevant. We propose a novel affective modeling approach based on users' emotive responses. We performed a user-interaction session and compared the performance of the recommender system with affective versus generic metadata. The results of the statistical analysis showed that the proposed affective parameters yield a significant improvement in the performance of the recommender system.

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

content-based recommender system
emotion induction
iaps
item profile
machine learning
user profile
valence-arousal-dominance


3d scans of as-built street scenes for virtual environments The purpose of this research is to build digital urban models by as-built environmental 3D scan data. Scans were made of a street and surrounding buildings for 5.5 km through the center of Taipei, Taiwan. A 3D long-range laser scanner was used to record buildings, landscapes, and open spaces. The scan tolerance was controlled in 4 mm/50 m. The final urban information creates a precise description of objects in a virtual environment with colors and textures feasible for internet browsing, infrastructure dimensioning, and construction monitoring. A 3D representation of scan noise, in terms of pedestrian pattern in front of Taipei Metro, was conducted to illustrate the response of human flow to obstacles.

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


SAW sensor based on highly sensitive nanoporous palladium thin film for hydrogen detection Surface acoustic wave sensors (SAWSs) with nanoporous palladium (Pd) sensing material for hydrogen (H2) detection are reported. We fabricated sensors with a stable and fast response and with a high sensitivity for detecting H2 even at room temperature (RT). The fabricated sensors were delay line type (quartz substrate, ?70MHz central frequency). The nanoporous sensitive layer was directly deposited onto a quartz substrate using the picosecond laser ablation method. X-ray diffraction (XRD) and scanning electron microscopy (SEM) were employed to investigate the influence of different experimental conditions, such as laser power density and inert gas pressure, on the morphological proprieties of Pd thin films. The sensor performance (sensitivity, detection limit, and response time) at RT, for H2 concentrations in synthetic air between 0.008% and 2% were studied. We obtained a sensitivity and detection limit of 0.31Hz/ppm and 48ppm, respectively, for RT operation. The response time was between 15 and 44s for H2 concentrations between 0.2% and 0.8% in synthetic air.

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

hydrogen sensor
nanoporous film
pulsed laser deposition


Incremental volume rendering using hierarchical compression We present a new algorithm here for efficient incremental rendering of volumetric datasets. The primary goal of this algorithm is to give average workstations the ability to efficiently render volume data received over relatively low bandwidth network links in such a way that rapid user feedback is maintained Common limitations of workstation rendering of volume data include: large memory overheads, the requirement of expensive rendering hardware, and high speed processing ability. The rendering algorithm presented here overcomes these problems by making use of the efficient Shear-Warp Factorisation method which does not require specialised graphics hardware. However the original Shear-Warp algorithm suffers from a high memory overhead and does not provide for incremental rendering which is required should rapid user feedback be maintained. Our algorithm represents the volumetric data using a hierarchical data structure which provides for the incremental classification and rendering of volume data. This exploits the multiscale nature of the octree data structure. The algorithm reduces the memory footprint of the original Shear-Warp Factorisation algorithm by a factor of more than hue, while maintaining good rendering performance. These factors make our octree algorithm more suitable for implementation on average desktop workstations for the purposes of interactive exploration of volume models over a network. Results from tests using typical volume datasets will be presented which demonstrate the ability of the algorithm to achieve high rendering rates for both incremental rendering and standard rendering while reducing the runtime memory requirements.

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


Semantics-preserving design of embedded control software from synchronous The design of embedded controllers is experiencing a growth in complexity as embedded systems increase their functionality while they become ubiquitous in electronic appliances, cars, airplanes, etc. As requirements become more challenging, mathematical models gain importance for mastering complexity. Among the different computational models proposed, synchronous models have proved to be the most widely used for control dominated applications. While synchronous models simplify the way of dealing with concurrency by decoupling functional and timing aspects, their software implementation on multitasking and multiprocessor platforms is far from straightforward, because of the asynchronous nature of most industrial software platforms. Known solutions in the literature either restrict the solution space or focus on special cases. We present a method for preserving the synchronous semantics through buffer-based intertask communication mechanisms, grounded on an abstraction of the target platform. This allows us to deal with any task set and, most importantly, being independent of the implementation, to explore the design space effectively.

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

software design methodologies
protection mechanisms
embedded software design


An Online Optimization Approach for Control and Communication Codesign in Networked Cyber-Physical Systems Networked cyber-physical systems (NCPS), where control and communication are closely integrated, have been envisioned to have a large number of high-impact applications. In this paper, a joint optimization framework is presented, which combines the objective of control as well as other relevant system objectives and constraints such as communication errors, delays and the limited capabilities (e.g., energy capacities) of devices. The problem is solved by an online optimization approach, which consists of a communication protocol and a simulated annealing based control algorithm. Meanwhile, by taking into account the communication cost, we optimize the control intervals by integrating two kinds of acceptances, i.e., cyber and physical acceptances, into the control algorithm. Numerical results show the effectiveness of the proposed approach.

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

control interval
networked cyber-physical systems (ncps)
wireless communication


subliminal wiretapping Subliminal Wiretapping is a subtly interactive artwork that utilizes random number generation modified through mind-matter effects to supply a continuous stream of words. Frequent, personal connections emerge from participants interpreting the stream as the words appear.

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

listen
automatic writing
rng
random event generator
reg
random number generator
psyleron
ouija
wiretap
mind-matter
subtle


An improved algorithm for kernel principal component analysis Kernel principal component analysis (KPCA), introduced by Scholkopf et al., is a nonlinear generalization of the popular principal component analysis (PCA) via the kernel trick. KPCA has shown to be a very powerful approach of extracting nonlinear features for classification and regression applications. However, the standard KPCA algorithm (Scholkopf et al., 1998, Neural Computation 10, 1299-1319) may suffer from computational problem for large scale data set. To overcome these drawbacks, we propose an efficient training algorithm in this paper, and show that this approach is of much more computational efficiency compared to the previous ones for KPCA.

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

eigenvalue decomposition
feature extraction


Curve reconstruction based on an interval B-spline curve Curve reconstruction that generates a piece of centric curve from a piece of planar strip-shaped point cloud is a fundamental problem in reverse engineering. In this paper, we present a new curve-reconstruction algorithm based on an interval B-spline curve. The algorithm constructs a rectangle sequence approximating the point cloud using a new data clustering technique, which facilitates the determination of curve order implied in the shape of the point cloud. A quasicentric point sequence and two pieces of boundary point sequences are then computed, based on which a piece of interval B-spline curve representing the geometric shape of the point cloud is constructed. Its centric curve is the final reconstructed curve. The whole algorithm is intuitive, simple, and efficient, as demonstrated by experimental results.

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

point cloud
curve reconstruction
reverse engineering


The stability of the deterministic Skorokhod problem is undecidable The Skorokhod problem arises in studying reflected Brownian motion (RBM) and the associated fluid model on the non-negative orthant. This problem specifically arises in the context of queueing networks in the heavy traffic regime. One of the key problems is that of determining, for a given deterministic Skorokhod problem, whether for every initial condition all solutions of the problem staring from the initial condition are attracted to the origin. The conditions for this attraction property, called stability, are known in dimension up to three, but not for general dimensions. In this paper we explain the fundamental difficulties encountered in trying to establish stability conditions for general dimensions. We prove the existence of dimension \(d_0\) such that stability of the Skorokhod problem associated with a fluid model of an RBM in dimension \(d\ge d_0\) is an undecidable property, when the starting state is a part of the input. Namely, there does not exist an algorithm (a constructive procedure) for identifying stable Skorokhod problem in dimensions \(d\ge d_0\).

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


Monotonic solutions of Urysohn integral equation on unbounded interval In this paper, we investigate a nonlinear Urysohn integral equation on unbounded interval. We show that under some assumptions that the equation has monotonic solutions belonging to the space of functions being Lebesgue integrable on unbounded interval. The main tool used in our study is the technique associated with measures of weak noncompactness and measures of noncompactness in strong sense. (C) 2004 Elsevier Ltd. All rights reserved.

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

measure of noncompactness
compactness in measure
weak sequential continuity


Neuroanatomical asymmetries and handedness in chimpanzees (Pan troglodytes): a case for continuity in the evolution of hemispheric specialization Many historical and contemporary theorists have proposed that population-level behavioral and brain asymmetries are unique to humans and evolved as a consequence of human-specific adaptations such as language, tool manufacture and use, and bipedalism. Recent studies in nonhuman animals, notably primates, have begun to challenge this view. Here, I summarize comparative data on neuroanatomical asymmetries in the planum temporale (PT) and inferior frontal gyrus (IFG) of humans and chimpanzees, regions considered the morphological equivalents to Broca's and Wernicke's areas. I also review evidence of population-level handedness in captive and wild chimpanzees. When similar methods and landmarks are used to define the PT and IFG, humans and chimpanzees show similar patterns of asymmetry in both cortical regions, though humans show more pronounced directional biases. Similarly, there is good evidence that chimpanzees show population-level handedness, though, again, the expression of handedness is less robust compared to humans. These results stand in contrast to reported claims of significant differences in the distribution of handedness in humans and chimpanzees, and I discuss some possible explanations for the discrepancies in the neuroanatomical and behavioral data.

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


metamodel-based tool integration with moflon Nowadays, a typical software development process involves many developers which participate in the development process by using a wide variety of development tools. As a consequence, the data representing the project as a whole is distributed over different development tools. For the purpose of consistency, maintainability, and traceability it is an essential task to be aware of the relationships between semantic equivalent data in different tool repositories. The Real-Time Systems Lab at the Technische Universitt Darmstadt performs research in the area of tool and metamodel integration to provide solutions to overcome this gap. In this demonstration we present the metamodeling framework MOFLON that addresses these issues by bringing together the latest OMG standards with graph transformations and triple graph grammars. Using MOFLON, developers can generate code for specific tools needed to perform analysis and transformation on one development tool or to incrementally integrate data of different modeling tools.

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

model transformation
triple graph grammar
model-driven software development


making cluster applications energy-aware Power consumption has become a critical issue in large scale clusters. Existing solutions for addressing the servers' energy consumption suggest "shrinking" the set of active machines, at least until the more power-proportional hardware devices become available. This paper demonstrates that leveraging the sleeping state, however, may lead to unacceptably poor performance and low data availability if the distributed services are not aware of the power management's actions. Therefore, we present an architecture for cluster services in which the deployed services overcome this problem by actively participating in any action taken by the power management. We propose, implement, and evaluate modifications for the Hadoop Distributed File System and the MapReduce clone that make them capable of operating efficiently under limited power budgets.

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


MILP formulations and an Iterated Local Search Algorithm with Tabu Thresholding for the Order Batching Problem We consider the Order Batching Problem (OBP). We propose MILP formulations for three OBP variants. We suggest an efficient local search procedure. We report computational experiments on randomly generated instances.

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

warehouse management
mixed integer linear programming


Mismatch modeling and simulation - A comprehensive approach This article describes a comprehensive approach to mismatch simulation and modeling as needed for integrated circuit design. Local device mismatch as well as global process variations and parameter correlations are regarded. A method for mismatch modeling based on spatial frequencies is described, which enables to overcome insufficiencies of the first order models. Measurement results are presented to demonstrate the achieved modeling precision. All models and methods mentioned here are commercially available in the simulation tool GAME (General Analysis of Mismatch Effects) which is used in the semiconductor industry since 1998.

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

mismatch simulation modeling correlations


Differential Space-Time Modulation Using DAPSK Over Rician Fading Channels This paper studies differential space-time modulation using diversity-encoded differential amplitude and phase shift keying (DAPSK) for the multiple-input multiple-output (MIMO) system over independent but not identically distributed (inid) time-correlated Rician fading channels. An asymptotic maximum likelihood (AML) receiver is developed for differentially detecting diversity-encoded DAPSK symbol signals by operating on two consecutive received symbol blocks sequentially. Based on Beaulieus convergent series, the bit error probability (BEP) upper bound is analyzed for the AML receiver over inid time-correlated Rician fading channels. Particularly, an approximate BEP upper bound of the AML receiver is also derived for inid time-invariant Rayleigh fading channels with large received signal-to-noise power ratios. By virtue of this approximate bound, a design criterion is developed to determine the appropriate diversity encoding coefficients for the proposed DAPSK MIMO system. Numerical and simulation results show that the AML receiver for diversity-encoded DAPSK is nearly optimum when the average received signal-to-noise power ratios are high and the channel is heavily correlated fading and can provide better error performance than conventional noncoherent MIMO systems when the effect of non-ideal transmit power amplification is taken into account.

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

differential amplitude and phase shift keying (dapsk)


Saliency Density and Edge Response Based Salient Object Detection We propose a novel threshold-free salient object detection approach which integrates both saliency density and edge response. The salient object with a well-defined boundary can be automatically detected by our approach. Saliency density and edge response maximization is used as the quality function to direct the salient object discovery. The global optimal window containing a salient object is efficiently located through the proposed saliency density and edge response based branch-and-bound search. To extract the salient object with a well-defined boundary, the Grab Cut method is applied, initialized by the located window. Experimental results show that our approach outperforms tilt methods only using saliency or edge response and achieves a comparable performance with the best state-of-the-art method, while being without any threshold or multiple iterations of GrabCut.

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

maximum saliency density and edge response


contemporary domestic infrastructures and technology design In this proposal, I describe my examination of two contemporary domestic infrastructures. Specifically, I am investigating whether we need to surface more information about these systems to make them intelligible to end-users. I describe my empirical research to date and the design of two technology probes which I will use to learn more how home infrastructure affects domestic technology design.

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


Relational learning helps in three-way classification of Alzheimer patients from structural magnetic resonance images of the brain Magnetic resonance imaging (MRI) has emerged as an important tool to identify intermediate biomarkers of Alzheimers disease (AD) due to its ability to measure regional changes in the brain that are thought to reflect disease severity and progression. In this paper, we set out a novel pipeline that uses volumetric MRI data collected from different subjects as input and classifies them into one of three classes: AD, mild cognitive impairment (MCI) and cognitively normal (CN). Our pipeline consists of three stages(1) a segmentation layer where brain MRI data is divided into clinically relevant regions; (2) a classification layer that uses relational learning algorithms to make pairwise predictions between the three classes; and (3) a combination layer that combines the results of the different classes to obtain the final classification. One of the key features of our proposed approach is that it allows for domain experts knowledge to guide the learning in all the layers. We evaluate our pipeline on 397 patients acquired from the Alzheimers Disease Neuroimaging Initiative and demonstrate that it obtains state-of-the-art performance with minimal feature engineering.

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

statistical relational learning
fmri prediction
biomedical applications
ensemble methods


Performance and cost analysis of the Supernova factory on the Amazon AWS cloud Today, our picture of the Universe radically differs from that of just over a decade ago. We now know that the Universe is not only expanding as Hubble discovered in 1929, but that the rate of expansion is accelerating, propelled by mysterious new physics dubbed "Dark Energy". This revolutionary discovery was made by comparing the brightness of nearby Type Ia supernovae (which exploded in the past billion years) to that of much more distant ones (from up to seven billion years ago). The reliability of this comparison hinges upon a very detailed understanding of the physics of the nearby events. To further this understanding, the Nearby Supernova Factory (SNfactory) relies upon a complex pipeline of serial processes that execute various image processing algorithms in parallel on similar to 10 TBs of data. This pipeline traditionally runs on a local cluster. Cloud computing [ Above the clouds: a Berkeley view of cloud computing, Technical Report UCB/EECS-2009-28, University of California, 2009] offers many features that make it an attractive alternative. The ability to completely control the software environment in a cloud is appealing when dealing with a community developed science pipeline with many unique library and platform requirements. In this context we study the feasibility of porting the SNfactory pipeline to the Amazon Web Services environment. Specifically we: describe the tool set we developed to manage a virtual cluster on Amazon EC2, explore the various design options available for application data placement, and offer detailed performance results and lessons learned from each of the above design options.

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

cloud computing
aws cloud
supernova factory


Learning rates for Q-learning In this paper we derive convergence rates for Q-learning. We show an interesting relationship between the convergence rate and the learning rate used in Q-learning. For a polynomial learning rate, one which is 1/t(omega) at time t where omega epsilon ( 1/2, 1), we show that the convergence rate is polynomial in 1/(1-gamma), where g is the discount factor. In contrast we show that for a linear learning rate, one which is 1/t at time t, the convergence rate has an exponential dependence on 1/(1-gamma). In addition we show a simple example that proves this exponential behavior is inherent for linear learning rates.

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

reinforcement learning
q-learning
stochastic processes
convergence bounds


Effect of numerical integration on meshless methods In this paper, we present the effect of numerical integration on meshless methods with shape functions that reproduce polynomials of degree k?1 k ? 1 . The meshless method was used on a second order Neumann problem and we derived an estimate for the energy norm of the error between the exact solution and the approximate solution from the meshless method under the presence of numerical integration. This estimate was obtained under the assumption that the numerical integration scheme satisfied a form of Greens formula. We also indicated how to obtain numerical integration schemes satisfying this property.

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

galerkin methods
quadrature
error estimates


A bi-objective approach for shortest-path network interdiction In the literature, solution approaches to the shortest-path network interdiction problem have been developed for optimizing a single figure-of-merit of the network configuration when considering limited amount of resources available to interdict network links. This paper presents a newly developed evolutionary algorithm that allows approximating the optimal Pareto set of network interdiction strategies when considering bi-objective shortest path problems. Thus, the paper considers the concurrent optimization of two objectives: (1) maximization of shortest-path length and (2) minimization of interdiction strategy cost. Also, the paper considers the transformation of the first objective into the minimization of the most reliable path reliability. To solve these multi-objective optimization problems, an evolutionary algorithm has been developed. This algorithm is based on Monte Carlo simulation, to generate potential network interdiction strategies, graph theory to analyze strategies' shortest path or most reliable path and, an evolutionary search driven by the probability that a link will appear in the optimal Pareto set. Examples for different sizes of networks and network behavior are used throughout the paper to illustrate and validate the approach. (c) 2010 Elsevier Ltd. All rights reserved.

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

network interdiction
evolutionary
optimization
reliability


Design of an autonomous intelligent Demand-Side Management system using stochastic optimisation evolutionary algorithms Demand-Side Management systems aim to modulate energy consumption at the customer side of the meter using price incentives. Current incentive schemes allow consumers to reduce their costs, and from the point of view of the supplier play a role in load balancing, but do not lead to optimal demand patterns. In the context of charging fleets of electric vehicles, we propose a centralised method for setting overnight charging schedules. This method uses evolutionary algorithms to automatically search for optimal plans, representing both the charging schedule and the energy drawn from the grid at each time-step. In successive experiments, we optimise for increased state of charge, reduced peak demand, and reduced consumer costs. In simulations, the centralised method achieves improvements in performance relative to simple models of non-centralised consumer behaviour.

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

evolutionary algorithms
electric vehicles

demand-side management systems
peak-to-average ratio
electricity costs
smart grid time-of-use pricing


Using cost to control instrumentation overhead We present a new data collection cost system that provides programmers with feedback about the impact data collection is having on their application. We allow programmers to define the level of perturbation their application can tolerate, and then regulate the amount of instrumentation to ensure that the threshold is not exceeded. Our approach is unique in that the type of data gathered remains constant; instead, we regulate when data are collected. This permits programmers to trade speed of isolation of a performance problem for less application perturbation. We implemented this cost system in the Paradyn Performance Tools and present several case studies demonstrating the accuracy of the cost system. (C) 1998-Elsevier Science B.V. All rights reserved.

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

perturbation
overhead
data collection
paradyn performance tools


Parameter identification for industrial robots with a fast and robust trajectory design approach We propose a fast, robust trajectory design for use in parameter identification. Computation time for our design is approximately 1/20 the time for prominent, existing methods. We estimate the dynamic parameters for a 6 DOF robot, the Staubli Tx-90, which has not previously been identified, to our knowledge. The RMS errors of the torque prediction were small (< 24 Nm).

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


dftatom: A robust and general Schrodinger and Dirac solver for atomic structure calculations A robust and general solver for the radial Schrodinger, Dirac, and Kohn-Sham equations is presented. The formulation admits general potentials and meshes: uniform, exponential, or other defined by nodal distribution and derivative functions. For a given mesh type, convergence can be controlled systematically by increasing the number of grid points. Radial integrations are carried out using a combination of asymptotic forms, Runge-Kutta, and implicit Adams methods. Eigenfunctions are determined by a combination of bisection and perturbation methods for robustness and speed. An outward Poisson integration is employed to increase accuracy in the core region, allowing absolute accuracies of 10(-8) Hartree to be attained for total energies of heavy atoms such as uranium. Detailed convergence studies are presented and computational parameters are provided to achieve accuracies commonly required in practice. Comparisons to analytic and current-benchmark density-functional results for atomic number Z = 1-92 are presented, verifying and providing a refinement to current benchmarks. An efficient, modular Fortran 95 implementation, dftatom, is provided as open source, including examples, tests, and wrappers for interface to other languages; wherein particular emphasis is placed on the independence (no global variables), reusability, and generality of the individual routines.

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

electronic structure
schrodinger equation
dirac equation
kohn-sham equations
density functional theory
shooting method


A model of associative learning in the mushroom body The mushroom body is a prominent invertebrate neuropil strongly associated with learning and memory. We built a high-level computational model of this structure using simplified but realistic models of neurons and synapses, and developed a learning rule based on activity dependent pre-synaptic facilitation. We show that our model, which is consistent with mushroom body Drosophila data and incorporates Aplysia learning, is able to both acquire and later recall CS-US associations. We demonstrate that a highly divergent input connectivity to the mushroom body and strong periodic inhibition both serve to improve overall learning performance. We also examine the problem of how synaptic conductance, driven by successive training events, obtains a value appropriate for the stimulus being learnt. We employ two feedback mechanisms: one stabilises strength at an initial level appropriate for an association; another prevents strength increase for established associations.

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


Approximating the distribution function of risk ? We consider the multiplicative risk function, R = ? i = 1 p x i a i , where xi x i 's are positive random variables, independent but not identically distributed. We discuss and compare the simulated distribution of Sp=ln(R) S p = ln ( R ) with several asymptotic approximations. We discuss the shortcomings of Monte Carlo (MC) simulation, normal approximation, and Edgeworth expansion, and use the saddlepoint approximation to compute the cumulative distribution function (CDF) of Sp S p . An Edgeworth expansion and a saddlepoint approximation for the independent, but not identically distributed random variables is discussed. The accuracies of the above approximations are illustrated for computing the CDF of a hazard index for specified chemicals in consumed fish. An application considers replacement of estimated CDF in the inner loop of a two-dimensional MC strategy to study variability and uncertainty with a saddlepoint approximation.

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

series approximations
saddlepoint method
multiplicative risk model
monte carlo simulation
two-dimensional monte carlo


Performance of KNN and SVM classifiers on full word Arabic articles This paper reports a comparative study of two machine learning methods on Arabic text categorization. Based on a collection of news articles as a training set, and another set of news articles as a testing set, we evaluated K nearest neighbor (KNN) algorithm, and support vector machines (SVM) algorithm. We used the full word features and considered the tf.idf as the weighting method for feature selection, and CHI statistics as a ranking metric. Experiments showed that both methods were of superior performance on the test corpus while SVM showed a better micro average F1 and prediction time.

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

arabic text categorization
full word features
chi statistics
knn
svm


A methodological approach to the formal specification of real-time systems by transformation of UML-RT design models By following a methodological approach, introduced in a previous work, a correct system specification in terms of CSP+T process algebra is systematically obtained from the UML-RT model of a real-time software system. Among other contributions, this article aims at integrating collaboration diagrams into our approach to facilitate the specification of capsules in UML-RT design models. Thus, an improved systematic transformation procedure for deriving a correct and complete formal system specification of real-time systems is established here. Temporal requirements integration in the design and system specification stages of a real-time system is also addressed, so that the approach now opens up the possibility of carrying out scheduling and dependability analysis at the design phase of the system development life cycle for hard real-time systems. The article also discusses a practical application to present a systematic transformation from a UML-RT model of a well known manufacturing-industry paradigmatic case, the "Production Cell". (c) 2006 Elsevier B.V. All rights reserved.

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

csp plus t
real-time software systems
uml-rt


Design and control of a climbing robot based on hot melt adhesion Hot melt adhesion (HMA) provides up to 150 N / cm 2 shear force for climbing robot locomotion. HMA can be used to enable a robot to climb on different materials in the environment. Investigation of HMA thermoplasticity for climbing robot locomotion. Design and control of a climbing robot platform (body size 16cm and weight 0.6kg). Demonstration and analysis of climbing robot locomotion at 0.17m/min.

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

mechanism design
motion control
climbing robots
smart materials for robots


Escape planning in realistic fire scenarios with Ant Colony Optimisation An emergency requiring evacuation is a chaotic event, filled with uncertainties both for the people affected and rescuers. The evacuees are often left to themselves for navigation to the escape area. The chaotic situation increases when predefined escape routes are blocked by a hazard, and there is a need to re-think which escape route is safest. This paper addresses automatically finding the safest escape routes in emergency situations in large buildings or ships with imperfect knowledge of the hazards. The proposed solution, based on Ant Colony Optimisation, suggests a near optimal escape plan for every affected person considering dynamic spread of fires, movability impairments caused by the hazards and faulty unreliable data. Special focus in this paper is on empirical tests for the proposed algorithms. This paper brings together the Ant Colony approach with a realistic fire dynamics simulator, and shows that the proposed solution is not only able to outperform comparable alternatives in static and dynamic environments, but also in environments with realistic spreading of fire and smoke causing fatalities. The aim of the solutions is usage by both individuals, such as from a personal smartphone of one of the evacuees, or for emergency personnel trying to assist large groups from remote locations.

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

ant colony optimisation
swarm intelligence


document-oriented heterogeneous business process integration through collaborative e-marketplace In this paper, we studied the semantic consistency maintenance issue between heterogeneous contexts, that is, how a firm' business process of one e-marketplace can be transformed to another firm's business process of another e-marketplace in a semantically consistent way. The proposed solution of this paper uses XML Product Map (XPM) of collaborative concept to represent semantically consistent business processes, and adopts common action concept pool and XPM documents to design heterogeneous business processes that are suitable for heterogeneous business process transformation. We motivated the approach with a real-world PVC poncho trade problem and explained it in architecture of collaborative process design and automatic service provision. We reported the implementation specification within a hybrid human-agent framework, where four layers of system modules are specified. The approach is evaluated based on a new semantic impact chain method particularly for evaluating concept consistency in meaning representation between heterogeneous contexts of business processes.

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

collaborative concept exchange
copex
collaborative process exchange
electronic marketplace
collaborative document exchange
conex
codex


TOPAZO 4.0 - A new version of a computer program for evaluation of deconvoluted and realistic observables atr LEP 1 and LEP 2 The program TOPAZO was developed for computing a variety of physical observables which are related to the e(+)e(-) annihilation into fermion pairs and to the large angle Bhabha scattering around the Z resonance. Among them the Z parameters or pseudo-observables, the deconvoluted cross sections and those dressed with QED radiation, and finally the forward-backward asymmetries; The calculations are performed both for a completely inclusive experimental setup and for a realistic one, i.e. a setup with cuts on the acollinearity angle, on the energy of the outgoing fermions or on their invariant mass and angular acceptance. The new version, 4.0, includes several innovative features; First of all, the most important new capabilities since previous versions are electroweak, QCD and QED correction factors that are relevant at the Z resonance in the light of the present experimental accuracy. Among them, the effect of the next-to-leading O(alpha(2)m(2),) corrections, the radiative corrections to the hadronic decay of the Z, providing complete corrections of O(alpha alpha(s)) to Gamma (Z --> q (q) over bar) with q = u, d, s, c, and b, and leading O(alpha(3)) QED corrections. Secondly, the program has been upgraded to cover two-fermion final states at LEP 2 energies, where some of the assumptions made for earlier versions are no longer valid. In particular, to this aim all the electroweak radiative corrections relevant far from the Z peak have been added for s-channel processes, e.g, purely weak boxes, next-to-leading O(alpha(2)) and leading O(alpha(3)) QED corrections. (C) 1999 Published by Elsevier Science B.V.

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

bhabha scattering
lep
electroweak
qed corrections
radiative corrections
deconvoluted and realistic observables

extrapolated and realistic experimental setup


Intelligent computer aided design, analysis, optimization, and improvement of thermodynamic systems An intelligent computer aided instruction (ICAI) software to aid teaching, design. and optimization of thermodynamic systems is presented, The concept of articulate virtual laboratory (AVL), the role of design, the ICAI software, and the use of AVL at the US Naval Academy are described. An example is used to demonstrate that using the ICAI software is indeed an effective method to analyze and improve thermodynamic systems design. (C) 2002 Wiley Periodicals, Inc.

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


Practical authenticated encryption scheme based on the elliptic curve cryptosystem Encryption and decryption techniques can generally protect the confidentiality of communication delivered over networks, and the digital signature technique can be used to authenticate messages. These techniques-encryption, decryption and digital signature-are integrated in a new authenticated encryption scheme based on the elliptic curve cryptosystern, to achieve the confidentiality and authenticity of information. Moreover, the elliptic curve cryptosystem involves few operations and a short key, so the overheads of operation and communication are greatly reduced as compared to other systems, enabling the proposed scheme to be applied effectively in a network environment. (C) 2003 Elsevier B.V. All rights reserved.

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

authenticated encryption scheme
elliptic curve cryptosystem