A DNA-based data hiding technique with low modification rates In 2010, Shiu et al. proposed three DNA-based reversible data hiding schemes with high embedding capacity. However, their schemes were not focused on DNA modification rate or the expansion problem. Therefore, we propose a novel reversible data hiding scheme based on histogram technique to solve the weaknesses of Shiu et al.s schemes. The proposed scheme transforms the DNA sequence into a binary string and then combines several bits into a decimal integer. These decimal integers are used to generate a histogram. Afterwards, the proposed scheme uses a histogram technique to embed secret data. The experimental results show that the modification rate of our proposed scheme is 69% lower than that of Shiu et al.s schemes for the same embedding capacity. In addition, the length of the DNA sequence remains unchanged in the proposed scheme.

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


Network environ theory, simulation, and EcoNet 2.0 We introduce and codify the mathematics of Ecological Network Analysis (ENA) in general and Network Environ Analysis (NEA) in particular used by the web-based simulation software EcoNet 2.0. Where ecosystem complexity continues to drive an increasingly vast environmental modeling effort, ENA and NEA represent maturation, in part, of the compartment modeling approach. Compartment modeling mathematically represents compartment storages with both internal-connecting and external-environmental flows as ordinary differential equations. ENA and NEA expand these mathematics into complex systems analysis and corresponding network theory. EcoNet was developed to facilitate the mathematical modeling, to enhance the overall presentation, and to improve the subsequent long-term progress of ENA and NEA systems analysis. Thus, as a continuing enhancement to the overall understanding, but more importantly, to the future growth of environmental modeling associated with ENA and NEA, we derive and summarize the canonical mathematics of ENA, NEA, and EcoNet, which facilitates their future use.

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

network environ analysis
ecological network analysis
econet

compartment analysis
simulation and ecological modeling


Autonomous decentralized high-speed processing technology and the application in an integrated IC card fixed-line and wireless system There is "Processing speed improvement of the automatic fare collection gate (AFC gate)" as one of the important problems to correspond to the passengers getting on and off in high density transportation at the peak. On the other hand, reliability is indispensable to handle the ticket that is the note. Therefore, the ticket system that has both highspeed processing and high reliability is necessary and indispensable. For the passenger's convenience improvement and maintenance cost reduction, wireless IC card ticket system is hoped. However, the high-speed processing and the high reliability are ambivalent at this system because of wireless communications between an IC card and an AFC gate; the faster the AFC gate processes the ticket, the poorer the reliability gets. In this thesis, it proposes the autonomous decentralized processing technology to meet high-speed processing in wireless IC ticket system and the requirement of high reliability. "IC card" "AFC" and "Central server" are assumed to be an autonomous system. It proposes "Decentralized algorithm of the fare calculation by IC card and the AFC" to achieve high-speed processing. Moreover, "Autonomous, decentralized consistency technology" in each subsystem is shown for high-reliability. In addition, to make these the effective one, "Wireless communication area enhancing technology (touch & going method)" and "Command system for the data high speed processing" are shown. These technologies are introduced into the Suica system of East Japan Railway and the effectiveness has been proven.

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

decentralized adjustment making technology


Analysis of Gingival Crevicular Fluid as Applied to the Diagnosis of Oral and Systemic Diseases Gingival crevicular fluid (GCF), a serum transudate or inflammatory exudate, can be collected from the gingival crevice surrounding the teeth. As such, the fluid reflects the constituents of serum, the cellular response in the periodontium, and contributions from the gingival crevice. The study of GCF has focused on defining the pathophysiology of periodontal disease, and identification of a potential diagnostic test for active periodontitis. The majority of markers that have been identified as potential candidates for such a test are measures of inflammation (i.e., prostaglandin E2 (PGE2), neutrophil elastase, and the lysosomal enzyme ?-glucuronidase). Further, analysis of inflammatory markers in GCF may assist in defining how certain systemic disorders (e.g., diabetes mellitus) can modify periodontal disease, and how periodontal disease/periodontal inflammation can influence certain systemic disorders (i.e., cardiovascular/cerebrovascular diseases). Methodological concerns related to the collection and analysis of GCF are important factors that need to be considered when studying GCF. Practical concerns argue against the widespread clinical application of GCF as an adjunct to periodontal diagnosis. Rather, analysis of GCF-derived mediators in saliva may serve as a means of rapid screening for periodontal disease

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

gingival crevicular fluid
diagnosis
periodontal disease


AppAdapt: Opportunistic Application Adaptation in Presence of Hardware Variation In this work, we propose a method to reduce the impact of process variations by adapting the application's algorithm at the software layer. We introduce the concept of hardware signatures as the measured post manufacturing hardware characteristics that can be used to drive software adaptation across different die. Using H. 264 encoding as an example, we demonstrate significant yield improvements (as much as 30% points at 0% hardware overdesign), a reduction in overdesign (by as much as 8% points at 80% yield) as well as application quality improvements (about 2.0 dB increase in average peak-signal-to-noise ratio at 70% yield). Further, we investigate implications of limited information exchange (i.e., signature quantization) on yield and quality. We conclude that hardware-signature-based application adaptation is an easy and inexpensive (to implement), better informed (by actual application requirements) and effective way to manage yield-cost-quality tradeoffs in application-implementation design flows.

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

hardware-software interface
manufacturing yield
process variation


semi-supervised spam filtering using aggressive consistency learning A graph based semi-supervised method for email spam filtering, based on the local and global consistency method, yields low error rates with very few labeled examples. The motivating application of this method is spam filters with access to very few labeled message. For example, during the initial deployment of a spam filter, only a handful of labeled examples are available but unlabeled examples are plentiful. We demonstrate the performance of our approach on TREC 2007 and CEAS 2008 email corpora. Our results compare favorably with the best-known methods, using as few as just two labeled examples: one spam and one non-spam.

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


Applications of a variational multiscale method for large eddy simulation of turbulent flows on moving/deforming unstructured grids In this paper, the three-level formulation of a variational multiscale (VMS) large eddy simulation (LES) method for compressible flow computations [B. Koobus, C. Farhat, A variational multiscale method for the large eddy simulation of compressible turbulent flows on unstructured meshesapplication to vortex shedding, Comput. Methods Appl. Mech. Eng. 193 (2004) 13671384; C. Farhat, A. Rajasekharan, B. Koobus, A dynamic variational multiscale method for large eddy simulations on unstructured meshes, Comput. Methods Appl. Mech. Eng. 195 (2006) 16671691] is extended for applications involving moving/deforming grids. A consistent method to improve the VMS-LES method by computing the small scale Smagorinsky constant ( C s ? ) dynamically [C. Farhat, A. Rajasekharan, B. Koobus, A dynamic variational multiscale method for large eddy simulations on unstructured meshes, Comput. Methods Appl. Mech. Eng. 195 (2006) 16671691; A. Rajasekharan, Variationally consistent multiscale formulations and ALE time integrators for large eddy simulation of turbulent flows on dynamic grids, Ph.D. Dissertation, Stanford University, 2008] as the flow develops (dynamic VMS-LES) is also extended for dynamic grid applications. Two applications of VMS-LES for the simulation of separated flow over moving NACA-0012 extruded airfoil is then presented. The first application involves a qualitative simulation exploring the KnollerBetz effect [K.D. Jones, C.M. Dohring, M.F. Platzer, Experimental and computational investigation of the KnollerBetz effect, AIAA J. 36(7) (1998) 12401246] of the heaving airfoil at high Strouhal number. The second application is that of the pitching airfoil undergoing dynamic stall. The results predicted by the dynamic VMS-LES method are compared to those obtained with other turbulence models and to experimental data and it is found that the dynamic VMS-LES performs better than the other considered static and dynamic LES models.

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

compressible turbulent flows
dynamic les
unstructured meshes
variational multiscale

agglomeration
variational germano's identity


Support measures for graph data* The concept of support is central to data mining. While the definition of support in transaction databases is intuitive and simple, that is not the case in graph datasets and databases. Most mining algorithms require the support of a pattern to be no greater than that of its subpatterns, a property called anti-monotonicity, or admissibility. This paper examines the requirements for admissibility of a support measure. Support measures for mining graphs are usually based on the notion of an instance graph---a graph representing all the instances of the pattern in a database and their intersection properties. Necessary and sufficient conditions for support measure admissibility, based on operations on instance graphs, are developed and proved. The sufficient conditions are used to prove admissibility of one support measurethe size of the independent set in the instance graph. Conversely, the necessary conditions are used to quickly show that some other support measures, such as weighted count of instances, are not admissible.

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


Efficient design exploration based on module utility selection In this paper, we present a design exploration framework, called WIZARD, which aims at finding module selections that will lead to superior designs while considering scheduling and resource binding under latency and power constraints. The framework contains two phases: choosing the resource configuration, and determining a module binding for each resource. We introduce a powerful model called an acceptability function which models design objectives, based on tradeoffs among different design constraints as well as a user's willingness to accept a design. Module utility measure cooperating with inclusion scheduling is the key to the success of our method. The utility of a module reflects the usefulness of the module based on the acceptability function, Inclusion scheduling is an algorithm to provide information for determining the number of functional units as well as module usefulness. We also present a heuristic which modifies module utility values based on the given acceptability function until they lead to superior selections. Many experiments on well-known benchmarks show the effectiveness of the approach when the obtained module selections are compared with the results from enumerating all module selections, as well as other schemes such as MSSR and PSGA.

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

design space exploration
fuzzy logic
high-level synthesis
resource allocation


embedded software development on top of transaction-level models Early embedded SW development with transaction-level models has been broadly promoted to improve SoC design productivity. But the proposed APIs only provide low-level read/write operations via a TLM interconnect. SW developers have to implement platform-specific communication procedures and handshake protocols to access HW functions, which requires a deep understanding of both the HW interfaces and the TLM fabric used. In this paper, we propose our concept of hardware procedure calls (HPC) with which HW services are provided to SW processes as remote methods on top of transaction-level communication. To this end, a lightweight HPC protocol is presented, and we propose a method to generate the infrastructure for HPC communication from a straightforward input description. Our experiments show that with HPC, embedded SW development is considerably made easier, and that also the effort to create the transaction-level model itself is reduced.

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

systemc
middleware
hardware-software communication


RSA-based Password-Authenticated Key Exchange, revisited The RSA-based Password-Authenticated Key Exchange (PAKE) protocols have been proposed to realize both mutual authentication and generation of secure session keys where a client is sharing his/her password only with a server and the latter should generate its RSA public/private key pair (e, n), (d, n) every time due to the lack of PKI (Public-Key Infrastructures). One of the ways to avoid a special kind of off-line (so called e-residue) attacks in the RSA-based PAKE protocols is to deploy a challenge/response method by which a client verifies the relative primality of e and phi(n) interactively with a server. However, this kind of RSA-based PAKE protocols did not give any proof of the underlying challenge/response method and therefore could not specify the exact complexity of their protocols since there exists another security parameter, needed in the challenge/response method. In this paper, we first present an RSA-based PAKE (RSA-PAKE) protocol that can deploy two different challenge/response methods (denoted by Challenge/Response Method1 and Challenge/Response Method2). The main contributions of this work include: (1) Based on the number theory, we prove that the Challenge/Response Method1 and the Challenge/Response Method2 are secure against e-residue attacks for any odd prime e; (2) With the security parameter for the on-line attacks, we show that the RSA-PAKE protocol is provably secure in the random oracle model where all of the off-line attacks are not more efficient than on-line dictionary attacks; and (3) By considering the Hamming weight of e and its complexity in the RSA-PAKE protocol, we search for primes to be recommended for a practical use. We also compare the RSA-PAKE protocol with the previous ones mainly in terms of computation and communication complexities.

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

password authentication
on-line/off-line attacks
e-residue attacks
provable security


Gene sequence data sets analysed using a hierarchical neural clusterer Evolutionary algorithms have been used to optimise the performance of neural network models before. This paper uses a hybrid approach by permanently attaching a genetic algorithm (GA) to a hierarchical clusterer to investigate appropriate parameter values for producing specific tree-shaped representations for some gene sequence data. It addresses a particular problem where the size of the data set makes the direct use of a GA too time consuming. We show by using a data set nearly two orders of magnitude smaller in the GA investigation that the results can be usefully translated across to the real, much larger data sets. The data sets in question are gene sequences and the aim of the analysis was to cluster short sub-sequences that could represent binding sites that regulate the expression of genes.

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

clustering
competitive learning
genetic algorithms
neural tree networks


Atmospheric radar signal processing using principal component analysis Principal Component Analysis (PCA) is a simple non-parametric method for extracting relevant information from high-dimensional data sets. In this paper, we analyze the data collected from the Indian MST (Mesosphere, Stratosphere, Troposphere) radar at Gadanki (13.5N 13.5 N , 79.2E 79.2 E ) using PCA. We tested the PCA for various simulated signals like narrowband, wideband and exponential signals which may contain more than one frequency both in absence and presence of noise. For the simulated data, it is observed that PCA works for low SNR, i.e. it successfully detects the frequency in the highly noise-corrupted signal also. Finally, we applied PCA to the radar data for estimating the power spectrum and thus in turn estimating the Doppler frequency components. We estimate the zonal (U), meridional (V), wind speed (W) etc. from the Doppler frequencies. Compared with existing algorithms, PCA works well at higher altitudes and results have been validated using the GPS sonde data.

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

mst radar
wavelet-based denoising
cepstral thresholding


Cascading artificial neural networks optimized by genetic algorithms and integrated with global navigation satellite system to offer accurate ubiquitous positioning in urban environment Location-based services (LBSs) have long been identified as an important component of emerging mobile services. While outdoor positioning has become strongly established, systems dealing with indoor positioning in urban environment are still under development. The upcoming LBSs require positioning systems (PSs) that are available ubiquitously, which requires the integration of the PS available in an outdoor environment with the PS available in indoor environment. Global navigation satellite systems (GNSSs) such as GPS, GLONASS, Galileo, and QZSS are some of the prominent systems that provide outdoor positioning. Indoor positioning systems (IPSs), however, are undergoing rapid development, and these systems can be supplied using short-range wireless technologies such as Wi-Fi, Bluetooth, RFID, and Infrared. Among these technologies, intense research is being conducted into Wi-Fi-based positioning systems due to their ubiquitous presence. This paper presents a model and results for a ubiquitous positioning system (UPS) that integrates a novel WLAN-based IPS and GNSS. The IPS is developed using cascading artificial neural networks, which are further optimized using genetic algorithms. The systems were thoroughly investigated on an actual Wi-Fi network at Asian Institute of Technology, Thailand. The IPS demonstrated a mean accuracy of 2.10m and the UPS demonstrated a mean accuracy of 3.26m, with 89% of the distance error within the range of 03.5m.

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

indoor positioning systems
gnss
gps
ubiquitous positioning
artificial neural networks
genetic algorithms


Pharmacophore modeling and virtual screening studies to design some potential histone deacetylase inhibitors as new leads Histone deacetylase is one of the important targets in the treatment of solid tumors and hematological cancers. A total of 20 well-defined inhibitors were used to generate Pharmacophore models using and HypoGen module of Catalyst. These 20 molecules broadly represent 3 different chemotypes. The best HypoGen model consists of four-pharmacophore featuresone hydrogen bond acceptor, one hydrophobic aliphatic and two ring aromatic centers. This model was validated against 378 known HDAC inhibitors with a correlation of 0.897 as well as enrichment factor of 2.68 against a maximum value of 3. This model was further used to retrieve molecules from NCI database with 238,819 molecules. A total of 4638 molecules from a pool of 238,819 molecules were identified as hits while 297 molecules were indicated as highly active. Also, a Similarity analysis has been carried out for set of 4638 hits with respect to most active molecule of each chemotypes which validated not only the Virtual Screening potential of the model but also identified the possible new Chemotypes. This type of Similarity analysis would prove to be efficient not only for lead generation but also for lead optimization.

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

histone deacetylase
pharmacophore
hypogen model
virtual screening
similarity analysis


towards an architecture for intelligent control of narrative in interactive virtual worlds The creation of novel, engaging and dynamic interactive stories presents a unique challenge to the designers of systems for interactive entertainment, education and training. Unlike conventional narrative media, an interactive narrative-based system may be required to generate its own story structure, determine the appropriate interface elements to use to convey the storys action and manage the effective interaction of a user within the story as it plays out. Here we describe the architecture of the Mimesis system, which integrates a 3D graphical gaming environment with intelligent techniques for generating and controlling interaction with and within a narrative in order to create an engaging and coherent user experience

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

computer games
interactive narrative
planning
embodied agents


Pattern recognition of strings with substitutions, insertions, deletions and generalized transposition We study the problem of recognizing a string Y which is the noisy version of some unknown string X* chosen from a finite dictionary, II. The traditional case which has been extensively studied in the literature is the one in which Y contains substitution, insertion and deletion (SID) errors. Although some work has been done to extend the traditional set of edit operations to include the straightforward transposition of adjacent characters(2) [see J. Assoc. Comput. Mach. 22, 177-183 (1975)] the problem is unsolved when the transposed characters are themselves subsequently substituted, as is typical in cursive and typewritten script, in molecular biology and in noisy chain-coded boundaries. In this paper we present the first reported solution to the analytic problem of editing one string X to another, Y, using these four edit operations. A scheme for obtaining the optimal edit operations has also been given. Both these solutions are optimal for the infinite alphabet case. Using these algorithms we present a syntactic pattern recognition scheme which corrects noisy text containing all these types of errors. The paper includes experimental results involving sub-dictionaries of the most common English words which demonstrate the superiority of our system over existing methods. (C) 1997 Pattern Recognition Society.

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

traditional and generalized transposition errors


Time-domain damping models in structural acoustics using digital filtering We propose an original approach to provide well-posed time-domain damping modeling. We build a discrete-time constitutive law which is interpreted as a digital filter. The filter is synthetized from complex modulus data through an optimization problem. We add constraints to ensure stability, causality and dissipation of the model. Resulting discrete model is implemented in an energy-preserving numerical scheme.

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


Selecting infrastructure maintenance projects with Robust Portfolio Modeling We report a repeated application of RPM to bridge maintenance project selection. We identify general features that contributed to the success of this application. We develop an algorithm for solving non-dominated portfolios in large RPM problems.

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

portfolio decision analysis
multiple criteria decision making
resource allocation
incomplete information


Dynamic Contrast-Enhanced MRI-Based Early Detection of Acute Renal Transplant Rejection A novel framework for the classification of acute rejection versus nonrejection status of renal transplants from 2-D dynamic contrast-enhanced magnetic resonance imaging is proposed. The framework consists of four steps. First, kidney objects are segmented from adjacent structures with a level set deformable boundary guided by a stochastic speed function that accounts for a fourth-order Markov-Gibbs random field model of the kidney/background shape and appearance. Second, a Laplace-based nonrigid registration approach is used to account for local deformations caused by physiological effects. Namely, the target kidney object is deformed over closed, equispaced contours (iso-contours) to closely match the reference object. Next, the cortex is segmented as it is the functional kidney unit that is most affected by rejection. To characterize rejection, perfusion is estimated from contrast agent kinetics using empirical indexes, namely, the transient phase indexes (peak signal intensity, time-to-peak, and initial up-slope), and a steady-phase index defined as the average signal change during the slowly varying tissue phase of agent transit. We used a kappa(n)-nearest neighbor classifier to distinguish between acute rejection and nonrejection. Performance of our method was evaluated using the receiver operating characteristics (ROC). Experimental results in 50 subjects, using a combinatoric kappa(n)-classifier, correctly classified 92% of training subjects, 100% of the test subjects, and yielded an area under the ROC curve that approached the ideal value. Our proposed framework thus holds promise as a reliable noninvasive diagnostic tool.

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

acute renal transplant rejection
level set
nonrigid registration

dynamic perfusion
iso-contours
laplace equation


Applying the improved fuzzy cellular neural network IFCNN to white blood cell detection Although algorithm NDA based on the fuzzy cellular neural network (FCNN) has indicated the basic superiority in its adaptability and easy hardware-realization for microscopic white blood cell detection [Wang Shitong, Wang Min, A new algorithm NDA based on fuzzy cellular neural networks for white blood cell detection, IEEE Trans. Inf. Technol. Biomed., accepted], it still does not work very well in keeping the boundary integrity of a white blood cell. In this paper, the improved version of FCNN called IFCNN is proposed to tackle this issue. The distinctive characteristic of IFCNN is to incorporate the novel fuzzy status containing the useful information beyond a white blood cell into its state equation, resulting in enhancing the boundary integrity. Our theoretical analysis shows that IFCNN has the global stability and the experimental results demonstrate its obvious advantage over FCNN in keeping the boundary integrity.

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

fuzzy cellular neural networks
white blood cell detection
boundary integrity


"It's a small world after all": NoC performance optimization via long-range link insertion Networks-on-chip (NoCs) represent a promising solution to complex on-chip communication problems. The NoC communication architectures considered so far are based on either completely regular or fully customized topologies. In this paper, we present a methodology to automatically synthesize an architecture which is neither regular nor fully customized. Instead, the communication architecture we propose is a superposition of a few long-range links and a standard mesh network. The few application-specific long-range links we insert significantly increase the critical traffic workload at which the network transitions from a free to a congested state. This way, we can exploit the benefits offered by both complete regularity and partial topology customization. Indeed, our experimental, results demonstrate a significant reduction in the average packet latency and a major improvement in the achievable network through with minimal impact on network topology.

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

design automation
multiprocessor system-on-chip (mp-soc)
network-on-chip (noc)
performance analysis


Steady-state frequency response for periodic systems This paper extends the concept of steady-state frequency response, well known in the theory of linear time-invariant (LTI) systems, to linear time-varying systems with periodic co-efficients, called periodic systems. It is shown that for an internally stable periodic system there exist complete orthogonal systems of real periodic functions {?n} and {?n} called eigenfunctions, such that for the inputs ?n every output of the system converges in steady state to ?n?n, where ?n are non-negative real numbers. The set of all such numbers is called the singular frequency response of the system. In the case of LTI systems, the singular frequency response turns out to be consisting of the magnitudes of the sinusoidal frequency responses of the system. The singular frequency response {?n} is shown to be the singular spectrum of a compact operator associated with the system and has all the characteristics of the magnitude frequency response of LTI systems. A state-space realization of this operator and its adjoint leads to an alternative formulation of inverse of the singular frequency response as eigenvalues arising from a boundary value problem with periodic boundary values.

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

linear periodic systems
eigenfunction expansions
eigenvalue problems


Metamodels and emergent behaviour in models of conflict In this paper, we develop a simplified mathematical model (a metamodel) of a simulation model of conflict, based on ideas drawn from the analysis of more general physical systems, such as found in fluid dynamics modelling. We show that there is evidence from the analysis of historical conflicts to support the kind of emergent behaviour implied by this approach. We then apply this approach to the development of a metamodel of a particular complexity based simulation model of conflict (ISAAC), developed for the US Marine Corps. The approach we have illustrated here is very generic, and is applicable to any simulation model which has complex interactions similar to those found in fluid dynamic modelling, or in simulating the emergent behaviour of large numbers of simple systems which interact with each other locally.

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

conflict
emergent behaviour
metamodel
simulation
complexity


History of the Discovery of the Thymosins From a historical perspective, the studies that led to the isolation and characterization of the thymosins began in earnest in the early 1960s in the laboratory of Abraham White at the Albert Einstein College of Medicine in New York. In a 1966 paper in the Proceedings of the National Academy of Sciences, U.S., we first named these thymic-derived factors Thymosins. By 1972, the thymosin team had moved to the University of Texas Medical Branch in Galveston (UTMB) where an extremely talented group of young scientists and students succeeded over the next 6 years in preparing and testing a highly active partially purified calf thymus preparation, termed thymosin fraction-5 (TF5), which was amenable for scale-up and suitable for clinical use. In 1974, we received the first IND for a thymic hormone preparation from the FDA to begin a phase-I study with TF5 in children with primary immunodeficiency diseases at the University of California Medical Center in San Francisco. The immunorestorative and potentially life-saving properties of TF5 in clinical medicine were first documented in a landmark paper in 1975 by Drs. Arthur Ammann and Diane Wara in the New England Journal of Medicine. TF5 consists of a family of at least 40 mostly small acidic polypeptides, with molecular weights ranging from 1000 to 15,000 Da. This article will identify the key scientists and the milestones involved in the initial studies with TF5 that have led to the chemical characterization of the thymosins and to translational studies from the lab bench to the clinic

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

thymosin
primary immunodeficiency diseases

thymosin fraction 5
thymosin alpha 1
thymosin beta 4
t cells
wound healing
immunomodulation


Core words and Parikh matrices Parikh matrices have been widely investigated due to their applicability in arithmetizing words by numbers. This paper introduces the core of a binary word, which captures the essential part of a word from the perspective of its Parikh matrix. Additionally, the stronger notion of core M-unambiguity is introduced and the characterization of core M-unambiguous binary words is obtained. Finally, a generalization of the core of a binary word and some of its interesting properties are investigated.

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


Non-adaptability measures in the pseudo-questionnaires context Measuring the degree of non-adaptability of a partition to a criterion, represented by a reference partition, is an essential step in pseudo-questionnaires theory. In this work we characterize axiomatically the measure of non-adaptability in a general context. We base it on pre-orders on the set of all the possible experiences (complete or incomplete partitions). The construction of this measure is crucial for practical applications. It can be done in a natural way starting from the atoms of the partitions and constructing the non-adaptability measure by a process of successive aggregations made by suitable aggregation operators. (C) 2007 Elsevier Inc. All rights reserved.

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

pseudo-questionnaire
t-norm and t-conorm
non-additive measure
adaptability
compositive non-adaptability measure


Hybrid storage-based caching strategy for content delivery network services This study proposes a novel caching scheme for content delivery network services. In general, video content users often watch the first part of video clips and then switch to other content. Therefore, a caching scheme is proposed, in which the first part of the frequently referenced content is stored on a solid state drive (SSD) while the remaining video content is stored on a hard disk drive (HDD),. The proposed hybrid (SSD/HDD) caching scheme offers several benefits, such as an improved average data output capacity due to the high average data rate and average hit capacity of the SSD. That is, performance can be significantly improved at a low extra cost with the cache server of a content delivery network (CDN).

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

content delivery network (cdn)
content distribution network (cdn)
caching algorithm
solid state drive (ssd)
future internet
youtube


Some combinatorial aspects of congruence lattice representations A finite distributive lattice D can be represented as the congruence lattice, Con L, of a finite lattice L. We shall discuss the combinatorial aspects of such - and related - representations, specifically, optimal size, breadth, and degree of symmetry. (C) 1999-Elsevier Science B.V. All rights reserved.

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

congruence lattice
breadth
finite
distributive

automorphism group
planar
join-homomorphism


Design of new titanium alloys for orthopaedic applications Parallel to the biofunctionalisation of existing materials, innovation in biomaterials engineering has led to the specific design of titanium alloys for medical applications. Studies of the biological behaviour of metallic elements have shown that the composition and structure of the material should be carefully tailored to minimise adverse body reactions and to enhance implant longevity, respectively. Consequently, interest has focused on a new family of titanium alloys: Ti-6Mo-3Fe-5Ta, Ti-4Mo-2Fe-5Ta and Ti-6Mo-3Fe-5Zr-5Hf alloys. The non-toxicity of the specially designed titanium alloys compared with osteoblastic cells has been ascertained using MTT and RN tests. In addition, phase transformations upon thermal processing have been investigated, with comparison with a well-defined beta titanium alloy. Optimum thermal processing windows (above 550degreesC) have been designed to generate a stable and nanostructured alpha phase from the isothermal omega phase that precipitates in a low temperature range (150-350degreesC). The generation of such nanostructured microstructures should provide a promising opportunity to investigate tissue-biomaterial interactions at the scale of biomolecules such as proteins.

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

biomaterials
titanium alloys
phase transformations


implementation and applications of the distortion operator The distortion operator transforms 2D images in a manner similar to image warping or morphing, allowing source pixels to be mapped to any destination pixel. This operator can be implemented on current hardware, allowing at least one distortion per frame at interactive frame rates. Potential applications are numerous, but those described include re-mapping images for correct projection onto curved screens, correcting camera distortion from multiple sources simultaneously, and allowing constant time dynamic texturing and lighting of a static scene which is independent of geometric complexity.

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

texturing
lighting
projection
image warping


QuRiNet: A wide-area wireless mesh testbed for research and experimental evaluations Research in wireless mesh networks has been growing in recent years. Many testbeds have been created to study networking protocols in wireless mesh networks. In this work, we describe QuRiNet, an outdoor wide-area wireless mesh network deployed in a natural reserve. QuRiNet comprises of over 30 wireless nodes, spread over 2000 acres of wilderness. QuRiNet provides the backbone infrastructure for transporting ecological and environmental data from the natural reserve to the on-campus laboratories. Mesh nodes in QuRiNet are powered by solar energy, and comprise of multiple radios per node. Physical link distances in QuRiNet range from hundreds to thousands of meters. A parallel goal of deploying QuRiNet is to create a novel platform for advanced research in wireless mesh networks. In this report, we share our experiences in the deployment and maintenance of QuRiNet in its unique setting. We also describe various research efforts that have been leveraging the QuRiNet testbed. Several interesting measurement results are reported, along with the impact of various network configurations and technological variations on the functionality of the testbed. QuRiNet has been used for a variety of experimental studies including: channel assignment, network monitoring, and mobility studies. Current and future study plans include experimental evaluations of various security and reliability research.

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

wireless mesh networks
channel assignment
natural reserve
qurinet


Comparison of several eigenvalue reanalysis methods for modified structures Several eigenvalue reanalysis methods for modified structures are compared in terms of their computational accuracy and efficiency. These include the basic perturbation method, improved perturbation methods such as the William B. Bickford method and the method presented by Chen et al. (1994), the Pade approximate method, and Kirsch's combined method extended by Chen and Yang. All the above methods are used to calculate the approximate eigenvalues of a plane frame with 202 nodes and 357 beam elements. The results show that the methods can give satisfactory solutions if the changes of structural parameters are small, but the Pade approximate method and the extended Kirsch combined method are the most efficient among the five approximate methods for the case of large modifications of the structural parameters.

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

modified structures
eigenvalue reanalysis

pade approximation
kirsch's combined method


Proactive resource allocation for asynchronous real-time distributed systems in the presence of processor failures We present two proactive resource allocation algorithms, RBA*-FT and OBA-FT, for fault-tolerant asynchronous real-time distributed systems. The algorithms consider an application model where task timeliness is specified by Jensen's benefit functions and the anticipated application workload during future time intervals is described by adaptation functions. In addition, we assume that reliability functions of processors are available a priori. Given these models, our objective is to maximize aggregate task benefit and minimize aggregate missed deadline ratio in the presence of processor failures. Since determining the optimal solution is computationally intractable, the algorithms heuristically compute sub-optimal resource allocations, but in polynomial time. Experimental results reveal that RBA*-FT and OBA-FT outperform their non-fault-tolerant counterparts in the presence of processor failures. Furthermore, RBA*-FT performs better than OBA-FT, although OBA-FT incurs better worst-case and amortized computational costs. Finally, we observe that both algorithms robustly withstand errors in the estimation of anticipated failures. (C) 2003 Elsevier Inc. All rights reserved.

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

adaptive resource allocation
fault-tolerance
asynchronous distributed systems
benefit accrual model
best effort real-time scheduling
real-time ethernet
quality of service


A new quorum-based scheme for managing replicated data in distributed systems We propose a new quorum-based scheme for managing replicated data in distributed systems. We first introduce a concept called difference pair to establish the basics for cyclic read-write coteries. A simple and efficient model is then presented to facilitate the construction of read-write coteries. The read-write coteries generated by the model are strictly symmetric. Our model can be applied to an arbitrary number of copy sites. More importantly, by introducing a parameter in the construction model, our scheme offers the flexibility of adjusting the sizes of read and write quorums. Such flexibility allows read and write quorums to be readily tailored for each individual data item according to its own request demand. Enhancement of data availability is also addressed by our model.

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

consistency
coterie
mutual exclusion
quorum
replica control


Implicit formulation with the boundary element method for nonlinear radiation of water waves An accurate and efficient numerical method is presented for the two-dimensional nonlinear radiation problem of water waves. The wave motion that occurs on water due to an oscillating body is described under the assumption of ideal fluid flow. The governing Laplace equation is effectively solved by utilizing the GMRES (Generalized Minimal RESidual) algorithm for the boundary element method (BEM) with quadratic approximation. The intersection or corner singularity in the mixed DirichletNeumann problem is resolved by introducing discontinuous elements. The fully implicit trapezoidal rule is used to update solutions at new time-steps, by considering stability and accuracy. Traveling waves generated by the oscillating body are absorbed downstream by the damping zone technique. To avoid the numerical instability caused by the local gathering of grid points, the re-gridding technique is employed, so that all the grids on the free surface may be re-distributed with an equal distance between them. The nonlinear radiation force is evaluated by means of the acceleration potential. For a mixed DirichletNeumann problem in a computational domain with a wavy top boundary, the present BEM yields numerical solutions for the quadratic rate of convergence with respect to the number of boundary elements. It is also demonstrated that the present time-marching and radiation condition work successfully for nonlinear radiation problems of water waves. The results obtained from this study concur reasonably well with other numerical computations.

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

nonlinear radiation problem
water waves
oscillating body
bem with quadratic approximation
gmres
damping zone
acceleration potential

discontinuous element
implicit time-marching


A fast semi-implicit method for anisotropic diffusion Simple finite differencing of the anisotropic diffusion equation, where diffusion is only along a given direction, does not ensure that the numerically calculated heat fluxes are in the correct direction. This can lead to negative temperatures for the anisotropic thermal diffusion equation. In a previous paper we proposed a monotonicity-preserving explicit method which uses limiters (analogous to those used in the solution of hyperbolic equations) to interpolate the temperature gradients at cell faces. However, being explicit, this method was limited by a restrictive CourantFriedrichsLewy (CFL) stability timestep. Here we propose a fast, conservative, directionally-split, semi-implicit method which is second order accurate in space, is stable for large timesteps, and is easy to implement in parallel. Although not strictly monotonicity-preserving, our method gives only small amplitude temperature oscillations at large temperature gradients, and the oscillations are damped in time. With numerical experiments we show that our semi-implicit method can achieve large speed-ups compared to the explicit method, without seriously violating the monotonicity constraint. This method can also be applied to isotropic diffusion, both on regular and distorted meshes.

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

finite differencing
monotonicity
anisotropic diffusion


Grid vertex-unfolding orthogonal polyhedra An edge-unfolding of a polyhedron is produced by cutting along edges and flattening the faces to a net, a connected planar piece with no overlaps. A grid unfolding allows additional cuts along grid edges induced by coordinate planes passing through every vertex. A vertex-unfolding allows faces in the net to be connected at single vertices, not necessarily along edges. We show that any orthogonal polyhedra of genus zero has a grid vertex-unfolding. (There are orthogonal polyhedra that cannot be vertex-unfolded, so some type of "gridding" of the faces is necessary.) For any orthogonal polyhedron P with n vertices, we describe an algorithm that vertex-unfolds P in O(n(2)) time. Enroute to explaining this algorithm, we present a simpler vertex-unfolding algorithm that requires a 3 x 1 x 1 refinement of the vertex grid.

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


Correlating service touch-point preferences with engagement parameters Purpose - This paper aims to contribute to extant research which emphasises the need for service suppliers to be able to leverage firm-customer relationships through an understanding of the correlation between service touch-points and engagement parameters. Design/methodology/approach - The authors utilised multivariate methods (CATPCA and Pro-fit) to analyse the data. Data were collected through a questionnaire survey of 238 respondents, sampled through the social networking site, "Facebook". Findings - It was found from the analysis of data that within the context of customer engagement, four critical parameters ("satisfaction", "loyalty/advocacy", "recruitment/retention" and "customer losses") impact on customer touch-points. Research limitations/implications - The study is characterised by two limitations. The first is that the respondents' simultaneous utilisation of multiple touch-points was not accounted for in the study. Second, the authors acknowledge that the narrow demographic spread of the respondents is a possible limitation of the study. Originality/value - The study findings are grounded in empirical findings which is a departure from traditional scholarship on customer touch-points which has been based on case observations and anecdotal evidence.

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

customer engagement
multivariate methods

touch-points
multivariate analysis
customer relations


session management for heterogeneous wireless access networks 3G networks offer new opportunities for mobile or nomadic users to remain connected to their services through changes in environment conditions. Such continuity still presents challenges however. 3G networks require resource management to guarantee that services will meet performance expectations. Also, because of cost, alternate wireless networking technologies can now be used in complement with 3G to take advantage of hotspots, while still preserving continuity of session.In this paper, we propose and analyse a multi-network session management infrastructure based on established protocols. The session unifies information on active services over different access networks. It supports service continuity, migration of services between networks to attempt to always give to the user a better experience at lower cost.A session supports composition of services based on different signalling models, although our primary focus is on SIP and HTTP, and our concept derived from IMS.

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

service network
service composition
user session


illustrating computer hardware concepts using pic-based projects We are developing a series of interesting projects that give students a hands-on introduction to computer hardware concepts. Our projects are designed around the PIC16F84, a powerful 8-bit microcontroller chip that sells for less than $10. The projects are suitable for classroom use in introductory level courses about computer hardware. The effectiveness of these projects has been evaluated both formally by students (student evaluation forms) and informally - through discussion within the teaching team. The feedback from students indicates that the development and implementation of the projects were successful. This paper describes the details of the projects completed to date, their overall effectiveness and our plans for further projects.

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


IO-Lite: A unified I/O buffering and caching system This article presents the design, implementation, and evaluation of IO-Lite, a unified I/O buffering and caching system for general-purpose operating systems. IO-Lite unifies all buffering and caching in the system, to the extent permitted by the hardware. In particular, it allows applications, the interprocess communication system, the file system, the file cache, and the network subsystem to safely and concurrently share a single physical copy of the data. Protection and security are maintained through a combination of access control and read-only sharing. IO-Lite eliminates all copying and multiple buffering of I/O data, and enables various cross-subsystem optimizations. Experiments with a Web server show performance improvements between 40 and 80% on real workloads as a result of IO-Lite.

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

management
zero-copy
networking
i/o buffering


Why linked data is not enough for scientists Scientific data represents a significant portion of the linked open data cloud and scientists stand to benefit from the data fusion capability this will afford. Publishing linked data into the cloud, however, does not ensure the required reusability. Publishing has requirements of provenance, quality, credit, attribution and methods to provide the reproducibility that enables validation of results. In this paper we make the case for a scientific data publication model on top of linked data and introduce the notion of Research Objects as first class citizens for sharing and publishing.

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

linked data
reproducibility
sharing
publishing


power-efficient and scalable load/store queue design via address compression This paper proposes an address compression technique for load/store queue (LSQ) to improve the scalability and power efficiency. A load/store queue (LSQ) typically needs a fully-associative CAM structure to search the address for collision and consequently poses scalability challenges of power consumption and area cost. Using the proposed approach, the LSQ can reduce the area cost ranging from 32\% to 66\% and power consumption ranging from 38\% to 71\%, depending on the compression parameter. The approach can provide 3.08\% overall processor energy reduction and causes only 0.22\% performance loss at an optimal configuration.

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

scalable design
power-efficient
load-store queue


measuring and predicting web login safety Users increasingly entrust websites with their personal and sensitive information. Sites commonly protect this information using user-supplied credentials (i.e., logins). We conducted a measurement study of top websites and surprisingly found that they transmit these credentials in the clear, thus leaving them vulnerable to eavesdropping. To make matters worse, users are often unaware of this threat because sites and browsers reflect little information about how logins are handled. As a first step towards solving this problem, we develop techniques for measuring logins on browsers to predict how logins would be handled before they are submitted. We demonstrate that achieving this goal requires instrumentation at the application layer and inside browsers. Specifically, network traces are not sufficient for determining login safety in general due to application-layer encryption; similarly, application-layer traces are insufficient because login submission logic may be generated in the browser at runtime. Based on a measurement study using login pages gathered from popular sites in addition to those visited by users through normal Web browsing, we found such predictions to be quite challenging due to a lack of any standard formats for Web logins. However, by applying a carefully chosen set of rules when measuring logins, we almost always correctly predict how logins will be handled.

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


automatic motion-guided video stylization and personalization Video stylization transfers a source video into an artistic version while maintaining temporal coherence between adjacent frames. In this paper, we formulate the unsupervised example-based video stylization with Markov random field model. In our algorithm, we implement an improved optical flow algorithm to maintain temporal coherence while improve the accuracy of estimation along motion boundaries. We also extend our algorithm to the application of video personalization, in which human faces keep clear and distinguishable. A series of techniques are fused in video personalization, including face detection and alignment, motion flow, skin detection, and illumination blending. Given a source video and a style template image, our algorithm produces the stylized and/or personalized video(s) automatically. Experimental results demonstrate that our algorithm performs excellently in both video stylization and personalization.

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


Artificial bandwidth extension of spectral envelope along a Viterbi path In this paper, we propose a hidden Markov model (HMM)-based wideband spectral envelope estimation method for the artificial bandwidth extension problem. The proposed HMM-based estimator decodes an optimal Viterbi path based on the temporal contour of the narrowband spectral envelope and then performs the minimum mean square error (MMSE) estimation of the wideband spectral envelope on this path. Experimental evaluations are performed to compare the proposed estimator to the state-of-the-art HMM and Gaussian mixture model based estimators using both objective and subjective evaluations. Objective evaluations are performed with the log-spectral distortion (LSD) and the wideband perceptual evaluation of speech quality (PESQ) metrics. Subjective evaluations are performed with the A/B pair comparison listening test. Both objective and subjective evaluations yield that the proposed wideband spectral envelope estimator consistently improves performances over the state-of-the-art estimators.

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

source-filter separation
line spectral frequency
joint temporal analysis


Scene invariant multi camera crowd counting We propose a crowd counting algorithm that is scene invariant and operates across multiple cameras. Camera calibration is used to normalise features between views and to achieve scene invariance. The algorithm compensates for regions of overlap in a multi camera environment using calibration. An investigation into the suitability of various feature types for scene invariance is conducted. A mean relative error <10% is seen on Views 13 of the PETS 2009 dataset, when trained on another scene.

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

crowd counting
multi camera
scene invariant


The TM-RTree: an index on generic moving objects for range queries Existing works on moving objects mainly focus on a single environment such as free space and road network, and do not investigate the complete trip for humans who can pass several environments, e.g., road network, pavement areas, indoor. In this paper, we consider multiple environments and study moving objects with different transportation modes, also called generic moving objects. We aim to answer a new class of queries supporting three kinds of conditions: temporal, spatial, and transportation modes. To efficiently provide the result, we propose an index structure called TM-RTree, which takes into account the feature of moving objects in different environments and has the capability of managing objects on not only temporal and spatial data but also transportation modes. This property is not maintained by existing indices for moving objects. Different cases on transportation modes are supported. Correspondingly, several algorithms are developed. The TM-RTree and related algorithms are developed in a real DBMS to have a practical and solid result for applications. In the experiment, we conduct the performance evaluation using extensive datasets and compare the proposed technique with the other two competitors, demonstrating the efficiency and significant superiority of our solution in various settings.

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

transportation modes
range queries
index structure


SketchSnakes: Sketch-line initialized Snakes for efficient interactive medical image segmentation We present an intuitive, fast and accurate 2D interactive segmentation method that combines a general subdivision-curve Snake possessing powerful editing capabilities, with a novel sketch-line user initialization process, and a pen input device. Using the pen (or a mouse), the Snake is quickly and precisely initialized with a few quick sketch lines drawn across the width of the target object. The smooth contour constructed using these lines is extremely close to the position and shape of the object boundary. This makes the Snakes task of snapping to the object boundary much simpler and hence more likely to succeed in noisy images with minimal user editing. We apply our Snake to the segmentation of several 2D medical images to demonstrate its efficiency, accuracy and robustness. We also compare SketchSnakes to Adobe Photoshops Magnetic Lasso (Adobe Systems Inc., Adobe Photoshop User Guide, 2002) as well as a recent graph-cut based image cutout tool known as Snap (Digital Film Tools LLC, Snap User Guide, 2007) in order to highlight SketchSnakes effectiveness.

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


a multi-expert system for the automatic detection of protein domains from sequence information We describe a novel method for detecting the domain structure of a protein from sequence information alone. The method is based on analyzing multiple sequence alignments that are derived from a database search. Multiple measures are defined to quantify the domain information content of each position along the sequence, and are combined into a single predictor using a neural network. The output is further smoothed and post-processed using a probabilistic model to predict the most likely transition or boundary positions between domains. The method was assessed using the domain definitions in SCOP for proteins of known structures and was compared to several other existing methods. Our method improves significantly over the best method available, the semi-manual PFam domain database, while being fully automatic. Our method can also be used to verify domain partitions based on structural data. Few examples of predicted domain definitions and alternative partitions, as suggested by our method, are also discussed.

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


Linearized Shift-Register Synthesis An efficient algorithm synthesizing all shortest q-linearized-feedback shift-registers generating a given sequence of length N over a finite field F(q)(m) is derived and its correctness is proved. This algorithm, which is a generalization of the Berlekamp-Massey algorithm, has time complexity O(lN) less than or similar to O(N(2)) operations in, where F(q)(m), where l is the linearized complexity of the sequence. The algorithm can be applied for efficiently solving the key equation when decoding Gabidulin codes.

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

gabidulin codes
key equation
linearized complexity


Optimizing data intensive GPGPU computations for DNA sequence alignment MUMmerGPU uses highly-parallel commodity graphics processing units (GPU) to accelerate the data-intensive computation of aligning next generation DNA sequence data to a reference sequence for use in diverse applications such as disease genotyping and personal genomics. MUMmerGPU 2.0 features a new stackless depth-first-search print kernel and is 13 faster than the serial CPU version of the alignment code and nearly 4 faster in total computation time than MUMmerGPU 1.0. We exhaustively examined 128 GPU data layout configurations to improve register footprint and running time and conclude higher occupancy has greater impact than reduced latency. MUMmerGPU is available open-source at http://www.mummergpu.sourceforge.net.

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


Shear flexible curved spline beam element for static analysis In this paper, an efficient curved cubic B-spline beam element is developed based on field consistency principle, for the static analysis. The formulation is general in the sense that it includes anisotropy, transverse shear deformation, in-plane and rotary inertia effects. The element is based on laminated beam theory, which satisfies the interface stress and displacement continuity, and has a vanishing shear stress on the top and bottom surfaces of the beam. The lack of consistency in the shear and membrane strain-field interpolations in their constrained physical limits causes poor convergence and unacceptable results due to locking. Hence, numerical experimentation is conducted to check these deficiencies with a series of assumed shear/membrane strain functions, redistributed in a field consistent manner. The performance of the element is assessed by studying the static behavior of a variety of problems ranging from straight beam to circular ring.

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


Distance to ill-posedness and the consistency value of linear semi-infinite inequality systems In this paper we consider the parameter space of all the linear inequality systems, in the n-dimensional Euclidean space, with a fixed and arbitrary (possibly infinite) index set. This parameter space is endowed with the topology of the uniform convergence of the coefficient vectors by means of an extended distance. Some authors, in a different context in which the index set is finite and, accordingly, the coefficients are bounded, consider the boundary of the set of consistent systems as the set of ill-posed systems. The distance from the nominal system to this boundary ('distance to ill-posedness'), which constitutes itself a measure of the stability of the system, plays a decisive role in the complexity analysis of certain algorithms for finding a solution of the system. In our context, the presence of infinitely many constraints would lead us to consider separately two subsets of inconsistent systems, the so-called strongly inconsistent systems and the weakly inconsistent systems. Moreover, the possible unboundedness of the coefficient vectors of a system gives rise to a special subset formed by those systems whose distance to ill-posedness is infinite. Attending to these two facts, and according to the idea that a system is ill-posed when small changes in the system's data yield different types of systems, now the boundary of the set of strongly inconsistent systems arises as the 'generalized ill-posedness' set. The paper characterizes this generalized ill-posedness of a system in terms of the so-called associated hypographical set, leading to an explicit formula for the 'distance to generalized ill-posedness'. On the other hand, the consistency value of a system, also introduced in the paper, provides an alternative way to determine its distance to ill-posedness (in the original sense), and additionally allows us to distinguish the consistent well-posed systems from the inconsistent well-posed ones. The finite case is shown to be a meeting point of our linear semi-infinite approach to the distance to ill-posedness with certain results derived for conic linear systems. Applications to the analysis of the Lipschitz properties of the feasible set mapping, as well as to the complexity analysis of the ellipsoid algorithm, are also provided.

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

well-posedness
distance to ill-posedness
regularity


A computer vision system for wineglass defect inspection via Gabor-filter-based texture features Computer vision inspection systems are widely used for on-line inspection and quality control to improve the finished product quality and lower the costs. In this study, a novel system for wineglass defect inspection has been presented. A carrier grating is used to carry spatial information about inspected glasses. To demodulate the regular/irregular information, an analysis approach for extracting texture features based on Gabor filter has been proposed. From global response surfaces or feature images, objects of interest are segmented. Next local response surfaces or feature images over the isolated regions are calculated. Lastly texture features describing their smoothness and uniformity are computed based on a gray-level co-occurrence matrix and extracted from the local feature images. To make an acceptance/rejection decision, these features are fed to a conventional back propagation classifier. The proposed inspection system has been implemented and tested with some wineglass samples.

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

computer vision
defect inspection
wineglass

gabor-filter-based texture features
neural network classifier


Feature selection for optimized skin tumor recognition using genetic algorithms In this paper, a new approach to computer supported diagnosis of skin tumors in dermatology is presented. High resolution skin surface profiles are analyzed to recognize malignant melanomas and nevocytic nevi (moles), automatically. In the first step, several types of features are extracted by 2D image analysis methods characterizing the structure of skin surface profiles: texture features based on cooccurrence matrices, Fourier features and fractal features. Then, feature selection algorithms are applied to determine suitable feature subsets for the recognition process. Feature selection is described as an optimization problem and several approaches including heuristic strategies, greedy and genetic algorithms are compared. As quality measure for feature subsets, the classification rate of the nearest neighbor classifier computed with the leaving-one-out method is used. Genetic algorithms show the best results. Finally, neural networks with error back-propagation as learning paradigm are trained using the selected feature sets. Different network topologies, learning parameters and pruning algorithms are investigated to optimize the classification performance of the neural classifiers. With the optimized recognition system a classification performance of 97.7% is achieved.

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


Finding an Upper Bound for the Number of Contacts in Hydrophobic-Hydrophilic Protein Structure Prediction Model It is believed that the functional properties of the protein are dependent on its structure. Therefore, it is critical to predict the protein's structure to understand the functional properties. One of the most widely studied protein structure prediction models is the hydrophobic-hydrophilic (HP) model, which abstracts the dominant force in protein folding. That is, to explain the hydrophobic interaction, the HP model tries to maximize the number of contacts among hydrophobic amino acids. Although a number of heuristics have been proposed to find a tight lower bound for the number of contacts, these methods cannot guarantee the quality of the obtained solution since no information on upper bound has been obtained. In this research, we focus on identifying the efficiently computable upper bound. We present a new mathematical formulation of the HP model, which can provide an upper bound using linear relaxation of the formulation. Computational experiments using benchmark problems show that our formulation provides tight upper bound.

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


A UML package for specifying real-time objects The Unified Modeling Language (UML) provides a robust set of tools for modeling software systems. However, these tools do not directly address the requirements of real-time systems. Many real-time systems require the specification of data that has strict timing constraints. This paper presents a UML package for specifying real-time objects called RT-Object. The constructs in the package are based on the objects of the Real-Time Semantic Objects Relationships And Constraints (RTSORAC) model. The RT-Object package has been used to design real-time objects in a Real-Time Multi-User Virtual Environment (RTMUVE), in which widely distributed users collaborate in time-critical planning and decision making.

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


typed transformations of typed abstract syntax Advantages of embedded domain-specific languages (EDSLs) are that one does not have to implement a separate type system nor an abstraction mechanism, since these are directly borrowed from the host language. Straightforward implementations of embedded domain-specific languages map the semantics of the embedded language onto a function in the host language. The semantic mappings are usually compositional, i.e. they directly follow the syntax of the embedded language. One of the questions which arises is whether conventional compilation techniques, such as global analysis and resulting transformations, can be applied in the context of EDSLs. The approach we take is that, instead of mapping the embedded language directly onto a function, we first build a representation of the abstract syntax tree of the embedded program fragment. This syntax tree is subsequently analyzed and transformed, and finally mapped onto a function representing its denotational semantics. In this way we achieve run-time "compilation" of the embedded language. Run-time transformations on the embedded language can have a huge effect on performance. In previous work we present a case study comparing the Read instances generated by Haskells deriving construct with instances on which run-time grammar transformations (precedence resolution, left-factorisation and left-corner transformation) have been applied. In this paper we present the library, which has an arrow like interface, which supports in the construction of analyses and transformations, and we demonstrate its use in implementing a common sub-expression elemination transformation. The library uses typed abstract syntax to represent fragments of embedded programs containing variables and binding structures, while preserving the idea that the type system of the host language is used to emulate the type system of the embedded language. The tricky issue is how to keep a collection of mutually recursive structures well-typed while it is being transformed. We finally discuss the typing rules of Haskell, its extensions and those as implemented by the GHC and show that pure System-F based systems are sufficiently rich to express what we want to express, albeit at the cost of an increased complexity of the code.

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

type systems
meta-programming
gadt
common subexpression elimination


a path based modeling approach for dynamic power estimation In this paper a path based modeling approach due to different internal traffic scenarios is proposed for dynamic power estimation, under Thermal Design Power (TDP) conditions, for data path intensive designs. The model estimates power as a function of bandwidth and effective toggle rate of the input data transactions. It also takes into account the effect of cross-coupling capacitance on dynamic power. The model scales well to obtain power estimates for a design which is a proliferation of the existing one. This enables to get an early power estimation for a next generation design. The effectiveness of the proposed modeling approach has been demonstrated on a complex industrial 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 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


Toward the Next Wave of Services: Linked Services for the Web of Data It has often been argued that Web services would have a tremendous impact on the Web, as a core enabling technology supporting a highly efficient service-based economy at a global scale. However, despite the outstanding progress in the area we are still to witness the application of Web services in any significant numbers on the Web. In this paper, we analyse the state of the art highlighting the main reasons we believe have hampered their uptake. Based on this analysis, we further discuss about current trends and development within other fields such as the Semantic Web and Web 2.0 and argue that the recent evolution provides the missing ingredients that will lead to a new wave of services - Linked Services - that will ultimately witness a significant uptake on a Web scale. Throughout the presentation of this vision we outline the main principles that shall be underpinning the development of Linked Services and we illustrate how they can be implemented using a number of technologies and tools we have developed and are in the process of extending.

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

linked services
web services
semantic web
web of data


mi-DS: Multiple-Instance Learning Algorithm Multiple-instance learning (MIL) is a supervised learning technique that addresses the problem of classifying bags of instances instead of single instances. In this paper, we introduce a rule-based MIL algorithm, called mi-DS, and compare it with 21 existing MIL algorithms on 26 commonly used data sets. The results show that mi-DS performs on par with or better than several well-known algorithms and generates models characterized by balanced values of precision and recall. Importantly, the introduced method provides a framework that can be used for converting other rule-based algorithms into MIL algorithms.

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

multiple-instance learning (mil)
rule-based algorithms


NONLINEAR OBSERVER FOR INDUCTION MOTOR TO IMPROVE EFFICIENCY AND DYNAMIC STABILITY ANALYSIS IN FOC METHOD Control of induction motor due to its nonlinear property is one of the most popular research topics recently. Vector control based algorithms which are used for proper functioning estimate the rotor speed and magnetic flux. In many applications, flux and speed are estimated without using sensors. Thus, in these cases, it is necessary to obtain speed and flux by measuring voltage and current. In this paper, a nonlinear observer for estimating motor parameters based on Lyapunov function is presented. Using the Lyapunov theory, inputs regulating system and control system are earned which improve system performance. Simulation and experimental results are included to validate the effectiveness of the proposed control scheme under possible uncertainties and different reference trajectories. These results show the advantages of the proposed observer in control of induction motor transient performances. The merits of the proposed control system are also indicated comparing with a traditional optimal control system.

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

induction motor
nonlinear observer
lyapunov function


A web services framework for distributed model management Distributed model management aims to support the wide-spread sharing and usage of decision support models. Web services is a promising technology for supporting distributed model management activities such as model creation and delivery, model composition, model execution and model maintenance to fulfill dynamic decision-support and problem solving requests. We propose a web services based framework for model management (called MM-WS) to support various activities of the model management life cycle. The framework is based on the recently proposed Integrated Service Planning and Execution (ISP & E) approach for web services integration. We discuss encoding of domain knowledge (as individual models) and utilize the MM-WS framework to interleave synthesis of composite models with their execution. A prototypical implementation with an example is used to illustrate the utility of the framework to enable distributed model management and knowledge integration. Benefits and issues of using the framework to support model-based decision-making in organizational contexts are outlined.

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

distributed model management
web services
model composition


Hebbian-based neural networks for bottom-up visual attention and its applications to ship detection in SAR images This paper proposes a bottom-up attention model based on pulsed Hebbian neural networks. The salience of the visual input can be generated through the networks using a simple normalization process, which can be calculated rapidly. Moreover, visual salience in this model can be represented as binary codes that mimic neuronal pulses in the human brain. Experimental results on psychophysical patterns and eye fixation prediction for natural images prove the effectiveness and efficiency of the model. In an arduous task of detecting ships in synthetic aperture radar (SAR) images, there are large amounts of data to be processed in real time. As a fast and effective technique for saliency detection, the proposed model is applied to ship detection in SAR images and its robustness against speckles is further proved.

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

visual attention
hebbian neural networks

saliency map
principal component analysis
discrete cosine transform