PETCAM-A Power Efficient TCAM Architecture for Forwarding Tables Ternary Content Addressable Memory (TCAM) is a hardware device which can support high-speed table lookups and is an attractive solution for applications such as packet forwarding and classification. We investigate various TCAM architectures recently proposed for TCAM power and memory reduction in packet forwarding and show that far better power and memory performance is possible when we use an optimal prefix set for the given routing table. Compared to existing approaches, our experimental results demonstrate that our approach can significantly reduce both power (8-98 percent) and TCAM memory (45-78 percent) requirements.

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


Research culture and New Zealand's performance-based research fund: some insights from bibliographic compilations of research outputs Year-on-year trends in research outputs show increases in research activity as the date of the research assessment exercise-in New Zealand the Performance-Based Research Fund (PBRF)-looms. Moreover, changes with time in the number and types of conference presentation indicate that the vehicle of publication is also being influenced by the PBRF. Within New Zealand business schools, relating the published journal articles to the Australian Business Deans Council rankings list shows a trend towards more publications of lower rank, raising doubts about whether the rhetoric about the PBRF raising the quality of research is really justified. This 'drive' towards increasing numbers of research outputs is also fostered by an increasing trend towards co-authorship in publishing across all disciplines.

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

research publications
research quality
research collaboration
author collaboration
performance-based research fund (pbrf)


transfer between menu systems This paper investigates whether changes in the user/computer dialogue structure will affect the performance of users who are familiar with an earlier version of the product. Quantitative predictions using the Kieras and Polson (1985) production system model were derived to test whether changing the lexical attributes and structure of a popular menu-driven word-processor would permit transfer of existing knowledge of the word-processor to a new version. The results show that changes to the dialogue structure of the menu-system are not detrimental, while changes to the lexical attributes of the menus will hinder user performance.

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

product structure systems affect users test performance version attributes knowledge paper user dialogue

processor
computation
system modeling
predict
change


multiobjective real-coded bayesian optimization algorithmrevisited: diversity preservation This paper provides empirical studies on MrBOA, which have been designed for strengthening diversity of nondominated solutions. The studies lead to modified sharing. A new selection scheme has been suggested for improving diversity performance. Empirical tests validate their effectiveness on uniformity and front-spread (i.e., diversity) of nondominated set. A diversity-preserving MrBOA (dp-MrBOA) has been designed by carefully combining all the promising components; i.e., modified sharing, dynamic crowding, and diversity-preserving selection. Experiments demonstrate that the dp-MrBOA is able to significantly improve diversity performance (for the scaling problems), without weakening proximity of nondominated set.

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

probabilistic models
multiobjective optimization
evolutionary algorithms


Inhibition of Apoptosis by Human T-Lymphotropic Virus Type-1 Tax Protein Deregulation of the apoptotic process can lead to pathophysiological changes that result in either degenerative diseases or cancer. Although the transactivator Tax has been established as an essential effector of human T-lymphotropic virus type-1 (HTLV-1)-mediated diseases, which include both a neurodegenerative pathology and leukemia/lymphoma, its exact role(s) in the pathogenesis remains to be clarified. Because the apoptotic potential of Tax is still being debated, we addressed this question by testing the susceptibility of Tax(-) and Tax(+) cells to apoptosis under conditions of growth factor withdrawal and Bax overexpression. Results showed that Tax(+) cells are protected from apoptosis triggered by depletion of growth factors. This protective effect seems to be the result of a block in the apoptotic program regulated by mitochondria. Furthermore, in an attempt to elucidate which transcriptional pathway activated by Tax is important in the observed Tax-induced resistance, we found that CREB/ATF activity plays a relevant role in protecting cells from apoptosis induced by Bax overexpression. All together, these data might suggest that the ability of Tax to inhibit certain apoptotic stimuli could be important in its role as a viral transforming protein.

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

htlv-1
cytochrome c
serum starvation
creb.


An M/G/1 queue with multiple types of feedback, gated vacations and FCFS policy ? We consider an M/G/1 queueing system with multiple types of feedback, gated vacations and FCFS policy where the first service of a new customer is either successful (and then the customer leaves the system) or unsuccessful (and then the customer joins to the end of the queue for another service as old customer with different Bernoulli feedback parameter and different service distribution), and customers are served in the order of joining the tail of the queue. By applying a new method developed by authors (Queueing system with fixed feedback policy, J. Aust. Math. Soc. B, to appear, Comput. Oper. Res. 27 (2000) 269) we obtain joint probability generating function of system sizes of new and old customers at steady state and Laplace Stieltjes transform of total response time. We also give algorithms for calculation of moments of system size and total response time. The polling system in computer network can be modeled as queue with gated vacation. In order to include transmission's error, the polling system is modeled as queue with gated vacation and feedback where old customers have different feedback parameter and different service time distribution compared to new customers. For M/G/1 queueing system with multiple types of feedback, analysis of FCFS policy is more difficult than that of priority policy. In fact, classical embedded Markov chain methods can be applied to priority queue with multiple types of feedback, but they cannot be applied to FCFS queue. Until now, system size distribution and total response time distribution are known for M/G/1 priority queues with multiple types of feedback (J. Appl. Prob. 34 (1997) 773; Queueing Systems 8 (1991) 183), but only mean system size and mean total response time are known for M/G/1 FCFS queues with multiple types of feedback (Oper. Res. 42 (1994) 380; Commun. Stat. Stochastic Model 5(1) (1989) 115; Oper. Res. Lett. 25 (1999) 137; Queueing Theory and its Applications, CWI Monographs 7, North-Holland, Amsterdam; J. ACM 31 (1984) 13). In order to analyze the queue with feedback and gated vacation completely, we need to find the distribution of the system size and total response time in addition to mean system size and mean total response time. The purpose of this paper is to obtain joint probability generating function of system sizes of new and old customers at steady state and Laplace Stieltjes transform of total response time of an M/G/1 queueing system with multiple types of feedback, gated vacations and FCFS policy.

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

feedback
gated vacation
fcfs policy
total response time

m/g/1 queueing system
joint queue size distribution


Optimal phase calibration of nonlinear, delayed sensors We introduce a non-parametric method to eliminate delay. Method is suitable for any nonlinear memoryless sensors. Produce a single-valued calibration curve for sensors.

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

nonlinear sensor calibration
system identification
delay estimation
lissajous curves


The Integrated Model on Mobile Payment Acceptance (IMMPA): An empirical application to public transport We investigated the variables that influence the intention to adopt mobile payment. Three main intention-based models have been analysed: TAM, DOI, and UTAUT. We developed the Integrated Model on Mobile Payment Acceptance (IMMPA). The IMMPA has been tested with Structural Equation Modelling (SEM). The IMMPA has been applied to the mobile ticketing in the public transport context.

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

public transport
mobile payment
mobile ticketing
tam
doi
utaut
sem


Feed-forward inhibition in the visual thalamus Based on recently available anatomical and physiological data, we propose a specific pattern of connectivity between relay and local interneuron cells in the lateral geniculate nucleus of the cat that can serve a more complex role in visual information processing than simply sharpen the receptive fields of relay cells. We treat a thalamic network composed of biophysical models of relay and interneuron cells receiving their input from partially overlapping retinal ON and OFF receptive field groups. A mechanism is proposed through which parallel processing and lateral inhibition in the forward direction can enhance spatial resolution at the thalamic level.

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

vision
signal processing
feed-forward inhibition
computational neuroscience


A linear programming-based method for job shop scheduling We present a decomposition heuristic for a large class of job shop scheduling problems. This heuristic utilizes information from the linear programming formulation of the associated optimal timing problem to solve subproblems, can be used for any objective function whose associated optimal timing problem can be expressed as a linear program (LP), and is particularly effective for objectives that include a component that is a function of individual operation completion times. Using the proposed heuristic framework, we address job shop scheduling problems with a variety of objectives where intermediate holding costs need to be explicitly considered. In computational testing, we demonstrate the performance of our proposed solution approach.

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

job shop
optimal timing problem
linear programming

shifting bottleneck
intermediate inventory holding costs
non-regular objective
sensitivity analysis
single machine
earliness/tardiness


Firefly algorithm approach based on chaotic Tinkerbell map applied to multivariable PID controller tuning Nowadays, a variety of controllers used in process industries are still of the proportional-integral-derivative (PID) types. MD controllers have the advantage of simple structure, good stability, and high reliability. A relevant issue for PID controllers design is the accurate and efficient tuning of parameters. In this context, several approaches have been reported in the literature for tuning the parameters of PID controllers using evolutionary algorithms, mainly for single-input single-output systems. The systematic design of multi-loop (or decentralized) PID control for multivariable processes to meet certain objectives simultaneously is still a challenging task. This paper proposes a new chaotic firefly algorithm approach based on Tinkerbell map (CFA) to tune multi-loop PID multivariable controllers. The firefly algorithm is a metaheuristic algorithm based on the idealized behavior of the flashing characteristics of fireflies. To validate the performance of the proposed PID control design, a multi-loop multivariable PID structure for a binary distillation column plant (Wood and Berry column model) and an industrial-scale polymerization reactor are taken. Simulation results indicate that a suitable set of PID parameters can be calculated by the proposed CFA. Besides, some comparison results of a genetic algorithm, a particle swarm optimization approach, traditional firefly algorithm, modified firefly algorithm, and the proposed CFA to tune multi-loop PID controllers are presented and discussed. (C) 2012 Elsevier Ltd. All rights reserved.

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

metaheuristics
firefly optimization
control systems


Dual-Band Antenna Fed with CPW Technology Using Modified Mirrored L-Shaped Conductor-Back Plane This paper describes a novel configuration of a CPW-fed printed monopole antenna that depicts dual-band operations of WLAN and X-bands. The proposed antenna consists of a simple rectangular-shaped patch as the main radiator, the modified mirrored L-shaped conductor back plane element, and the partial rectangular CPW-ground surface. Dual-band performances can be obtained by embedding and adjusting dimensions of strips on mirrored L-Shaped conductor back plane element. The impedance bandwidth with \(\hbox {s}_{11} < -10\)dB is about 2.2GHz (5.057.25GHz) or 36% for 5GHz band and 5.2GHz (7.612.8GHz) or 51% for X-band. The measured peak gains are about 1.8 dBi at WLAN-band and 4.3 dBi at X-band. The Experimental results indicate that the fabricated antenna with proper dimensions, good radiation characteristics, and reasonable measured gains can be a good candidate for various applications of the future multi-band wireless communication systems and mobile device.

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

coplanar waveguide (cpw) antennas
conductor-back plane (cbp)
multi-band antenna
monopoles


Shape optimization of a bow The limb of a recurve bow is optimized such that, with given geometrical and material constraints, the initial arrow speed is maximized. The optimization is done under consideration of the dynamics of the system.

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

archery
dynamic optimization
geometric nonlinear optimization


current mode instrumentation amplifier with rail-to-rail input and output A Current Mode Instrumentation Amplifier with rail-to-rail input and output is presented. It is based on constant gm input stages, and cascode output stages. Although this CMIA structure has a good Input Common Mode Voltage, it suffers from a poor output swing, due to the limitation imposed by the current mirrors. This problem is overcome by using a transconductance amplifier as output block. The circuit was designed to 0.6m XC06 XFAB CMOS technology. Post layout simulations on the extracted circuit net-list provide a bandwidth about 70 kHz (-3dB), and a CMRR higher than 160dB, for a dc gain set to 66 dB. The power consumption is 149W at 1.5V.

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

analog integrated circuits
rail-to-rail input and output


domain-specific language integration with compile-time parser generator library Smooth integration of domain-specific languages into a general purpose host language requires absorbing of domain code written in arbitrary syntax. The integration should cause minimal syntactical and semantic overhead and introduce minimal dependency on external tools. In this paper we discuss a DSL integration technique for the C++ programming language. The solution is based on compile-time parsing of the DSL code. The parser generator is a C++ template metaprogram reimplementation of a runtime Haskell parser generator library. The full parsing phase is executed when the host program is compiled. The library uses only standard C++ language features, thus our solution is highly portable. As a demonstration of the power of this approach, we present a highly efficient and type-safe version of printf and the way it can be constructed using our library. Despite the well known syntactical difficulties of C++ template metaprograms, building embedded languages using our library leads to self-documenting C++ source code.

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

parser generator
dsl integration
haskell


VISUAL: An object oriented language for image understanding VISUAL is an object-oriented and declarative language for locating objects automatically. The language is designed according to the principle of closeness and the principle of object orientation, A VISUAL program describes the geometric relationships among components of an object, The inference engine of VISUAL opens the corresponding databases and NxN 2-D maps of the components, then applies chromatographic search for unification. The inference engine outputs a database and a 2-D map of the object which could be a component of another object to be recognized. Hence VISUAL is a tool to build up a hierarchical model-based vision system.

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

declarative language
principle of closeness
chromatographic search


Local cortical injections of glutamate and noradrenaline alter high-frequency (245Hz) neuronal activity in rat cortex Data collected from rat frontal cortical neurons has shown a surprising change in power levels at frequencies surrounding 245Hz following local injections of the neurotransmitters noradrenaline and glutamate. The power spectrum does not change anywhere else up to 1000Hz. This effect does not appear to be related to the firing rate of individual neurons, nor the overall power spectral densities.

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

power spectrum
neurotransmitters
noradrenaline
glutamate


Bacterial Cellulose Hydrolysis in Anaerobic Environmental SubsystemsClostridium thermocellumandClostridium stercorarium, Thermophilic Plant-fiber Degraders Cellulose degradation is a rare trait in bacteria. However, the truly cellulolytic bacteria are extremely efficient hydrolyzers of plant cell wall polysaccharides, especially those in thermophilic anaerobic ecosystems. Clostridium stercorarium, a thermophilic ubiquitous soil dweller, has a simple cellulose hydrolyzing enzyme system of only two cellulases. However, it seems to be better suited for the hydrolysis of a wide range of hemicelluloses. Clostridium thermocellum, an ubiquitous thermophilic gram-type positive bacterium, is one of the most successful cellulose degraders known. Its extracellular enzyme complex, the cellulosome, was prepared from C. thermocellum cultures grown on cellulose, cellobiose, barley ?-1,3-1,4-glucan, or a mixture of xylan and cellulose. The single proteins were identified by peptide chromatography and MALDI-TOF-TOF. Eight cellulosomal proteins could be found in all eight preparations, 32 proteins occur in at least one preparation. A number of enzymatic components had not been identified previously. The proportion of components changes if C. thermocellum is grown on different substrates. Mutants of C. thermocellum, devoid of scaffoldin CipA, that now allow new types of experiments with in vitro cellulosome reassembly and a role in cellulose hydrolysis are described. The characteristics of these mutants provide strong evidence of the positive effect of complex (cellulosome) formation on hydrolysis of crystalline cellulose.

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

bacterial cellulose hydrolysis anaerobic thermophilic cellulosome scaffoldin enzyme complex


Mandi: a market exchange for trading utility and cloud computing services The recent development in Cloud computing has enabled the realization of delivering computing as an utility. Many industries such as Amazon and Google have started offering Cloud services on a "pay as you go" basis. These advances have led to the evolution of the market infrastructure in the form of a Market Exchange (ME) that facilitates the trading between consumers and Cloud providers. Such market environment eases the trading process by aggregating IT services from a variety of sources, and allows consumers to easily select them. In this paper, we propose a light weight and platform independent ME framework called "Mandi", which allows consumers and providers to trade computing resources according to their requirements. The novelty of Mandi is that it not only gives its users the flexibility in terms of negotiation protocol, but also allows the simultaneous coexistence of multiple trading negotiations. In this paper, we first present the requirements that motivated our design and discuss how these facilitate the trading of compute resources using multiple market models (also called negotiation protocols). Finally, we evaluate the performance of the first prototype of "Mandi" in terms of its scalability.

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


Sex Differences in the Expression and Use of Computer-Mediated Affective Language Does Context Matter? Although women have been stereotyped as more emotionally expressive than men, the extant empirical evidence on sex differences in the expression and use of affective communication is equivocal. The authors examined the influence of sex and context on the expression and use of computer-mediated affective language in a sample of young adults. A total of 56 undergraduates (28 males, 28 females) were paired in same-sex dyads and randomly assigned to either a webcam or no webcam condition. The participants engaged in a 10-min free chat online conversation in the laboratory. Transcripts were objectively coded for the use of affective communication and traditional linguistic and conversational style measures. The analyses revealed separate significant Sex x Webcam Condition interactions on the affective quality of language used and the expression of computer-mediated emotion. Men in the webcam condition used significantly less active words than men in the no webcam condition and less than women in the webcam condition. Women in the webcam condition used significantly more emoticons than women in the no webcam condition or men in either condition. Men and women did not differ in their use of emoticons in the no webcam condition. Results suggest that sex differences in the use and expression of computer-mediated affective communication are context specific in an undergraduate sample. Findings are discussed in terms of their larger implications for understanding sex differences in the expression and use of emotion in face-to-face (FTF) social interactions.

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


extending xcsf beyond linear approximation XCSF is the extension of XCS in which classifier prediction is computed as a linear combination of classifier inputs and a weight vector associated to each classifier. XCSF can exploit classifiers' computable prediction to evolve accurate piecewise linear approximations of functions. In this paper, we take XCSF one step further and show how XCSF can be easily extended to allow polynomial approximations. We test the extended version of XCSF on various approximation problems and show that quadratic/cubic approximations can be used to significantly improve XCSF's generalization capabilities.

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

function approximation
lcs
least squares


Dynamic fault diagnosis using extended matrix and tensor locality preserving discriminant analysis It is well acknowledged that utilizing dynamic information can improve accuracy in fault diagnosis for dynamic processes. Conventional methods encode dynamic information by constructing an extended vector comprising current process data as well as past process data. Then the classic Linear Discriminant Analysis (LDA) is usually applied to extended vectors to reduce dimensionality and obtain a discriminative subspace where overlapping among different fault classes is minimized. However, using extended vectors aggravates the "curse of dimensionality" problem and loses structure information in variables. Besides, LDA probably provides suboptimal results when there are more than two candidate fault classes. This paper proposes using extended matrices to encoding dynamic information and using a novel dimensionality reduction method named Tensor Locality Preserving Discriminant Analysis (TLPDA) to perform dimensionality reduction on extend matrices directly. TLPDA is based on local structure in data and overcomes the main drawbacks of LDA. A new dynamic fault diagnosis scheme is developed based on extended matrices and TLPDA. Extensive simulations on the Tennessee Eastman (TE) benchmark simulation process clearly demonstrate the superiority of our methods in terms of misclassification rate and making use of extra training data. (C) 2012 Elsevier B.V. All rights reserved.

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

dynamic fault diagnosis
dimensionality reduction

matrix representation
local structure preserving


Genetic Algorithms as an Alternative Method of Parameter Estimation and Finding Most Likely Sequences of States of Hidden Markov Chains for HMMs and Hybrid HMM/ANN Models In this paper genetic algorithms are used in estimation and decoding processes of a Hidden Markov Model (HMM) and a hybrid HMM/ANN model with conditional binomial distributions. The hybrid model combines a hidden Markov chain with a perceptron which is assumed to constitute a match network. Genetic algorithms are applied here instead of the traditional methods such as the EM algorithm and the Viterbi algorithm. The paper demonstrates performance of an HMM and a hybrid model in modeling the annual number of months, in which some seismic events are recorded. Parameters of the discrete-time two-state models are estimated using the maximum likelihood method, on the basis of data on seismic events that were recorded in Romania in years 1901-1990. Then, on the basis of the estimation results, the most likely sequences of states of the hidden Markov chains are found.

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

markov chains
genetic algorithms
seismic events

hidden markov models
hybrid hmm/ann models
neural networks


Reproductive aging in invertebrate genetic models The invertebrate genetic systems of Caenorhabditis elegans and Drosophila melanogaster are emerging models to understand the underlying mechanisms of reproductive aging and the relationship between reproduction and lifespan. Both animals show progressive decline in egg production beginning at early middle age, caused in part by reduction in germline stem cell proliferation as well as in survival of developing eggs. Molecular genetic analysis reveals that insulin and TGF-? signaling are regulators of germline stem cell maintenance and proliferation during aging. Furthermore, the lifespan of both C. elegans and D. melanogaster appears to be regulated by signaling that depends on the presence of germline stem cells in the adult gonad. These invertebrate models provide powerful tools to dissect conserved causes of reproductive aging.

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


Hash join algorithms on SMPs clusters: Effects of netcaches on its scalability and performance We investigate the effect that caches, particularly caches for remote accesses, have on the performance of hash join algorithms. The join is a computationally intensive operation of relational databases and is used in many important applications. Thus, there are a considerable number of studies on the parallel hash join. However, most of the previous research does not show how cache affects the performance of these algorithms. In this paper, we show the impact and benefits of remote caches (Netcaches) on the overall performance of parallel hash join algorithms running on SMP clusters. Furthermore, we show the effects of these caches on speedup and scalability of these algorithms. Our simulation results leads us to conclude that the execution time of hash join algorithms on modem's multiprocessors, with large local and remote caches, could be reduced up to 70%. Finally, we show results for verifying the big effects of netcaches on scalability of these algorithms.

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

hash join algorithms
netcaches
smps
clusters


Managing as designing: 'opportunity knocks' for the IS field? In response to anxieties about our discipline's decline, this opinion piece 'looks to the future', arguing a strong prospectus for the IS field, based on its direct relevance to general management practice. The thesis set out is inspired by the recent upsurge in interest in 'managing as designing'. Reformulating management as design, I argue that we have a formidable knowledge-base of tools, theories and critique relevant to any manager, not just the MIS-inclined specialist. A case study of yet another failed information system (in U.K. children's services) is presented to show just how uniquely relevant our discipline is, in the workplace of today. Other pertinent issues are explored, such as synergies with the growing vogue for evidence-based management. The paper concludes by considering implications for research, including the need for a less exclusive approach to publishing and dissemination emphasising the need to make our work more accessible to lay practitioners. European Journal of Information Systems (2010) 19, 422-431. doi:10.1057/ejis.2010.31; published online 1 June 2010

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

information systems
managing as designing

evidence-based management
is failure
child welfare
design science


An efficient and accurate non-hydrostatic model with embedded Boussinesq-type like equations for surface wave modeling A novel approach that embeds the Boussinesq-type like equations into ail implicit non-hydrostatic model (NHM) is developed. Instead of using an integration approach, Boussinesq-type like equations with a reference velocity under a virtual grid system are introduced to analytically obtain an analytical form of pressure distribution at the top layer. To determine the size of vertical layers in the model, a top-layer control technique is proposed and the reference location is employed to optimize linear wave dispersion property. The efficiency and accuracy of this NHM with Boussinesq-type like equations (NHM-BTE) are critically examined through four free-surface wave examples. Overall model results show that NHM-BTE using only two vertical layers is capable of accurately simulating highly dispersive wave motion and wave transformation over irregular bathymetry. Copyright (C) 2008 John Wiley & Sons, Ltd.

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

reference velocity
pressure distribution

non-hydrostatic
implicit method
free-surface waves
boussinesq-type like equations


Supply chain modeling in uncertain environment with bi-objective approach Supply chain is viewed as a large-scale system that consists of production and inventory units, organized in a serial structure. Uncertainty is the main attribute in managing the supply chains. Managing a supply chain (SC) is very difficult. since various sources of uncertainty and complex interrelationships among various entities exist in the SC. Uncertainty may result from customer's demand variability or unreliability in external suppliers. In this paper we develop an inventory model for an assembly supply chain network (each unit has at most one immediate successor, but any number of immediate predecessors) which fuzzy demand for single product in one hand and fuzzy reliability of external suppliers in other hand affect on determination of inventory policy in SCM. External supplier's reliability has determined using a fuzzy expert system. Also the performance of supply chain is assessed by two criteria including total cost and fill rate. To solve this bi-criteria model, hybridization of multi-objective particle swarm optimization and simulation optimization is considered. Results indicate the efficiency of proposed approach in performance measurement. (C) 2008 Elsevier Ltd. All rights reserved.

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

uncertainty
simulation optimization
particle swarm optimization

supply chain management
fuzzy sets
multi-objective decision making


A model for relational reasoning as verbal reasoning Deductive reasoning is an essential part of complex cognition. It occurs whenever human beings (or machines) draw conclusions that go beyond what is explicitly provided. Reasoning about spatial relations is an excellent testbed for the assessment of competing reasoning theories. In the present paper we show that such competing theories are often less diverse than one might think. We introduce an approach for how relational reasoning can be conceived as verbal reasoning. We describe a theory of how humans construct a one-dimensional mental representation given spatial relations. In this construction process objects are inserted in a dynamic structure called a queue which provides an implicit direction. The spatial interpretation of this direction can theoretically be chosen freely. This implies that choices in the process of constructing a mental representation influence the result of deductive spatial reasoning. To derive the precise rules for the construction process we employ the assumption that humans try to minimize their cognitive effort, and two cost measures are compared to judge the efficiency of the construction process. From this we deduce how the queue should be constructed. We discuss empirical evidence for this approach and provide algorithms for a computational implementation of the construction and reasoning process.

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

deduction
mental models
cost function
computational modeling


blocking in large mobile cellular networks with bursty traffic We consider large cellular networks. The traffic entering the network is assumed to be correlated in both space and time. The space dependency captures the possible correlation between the arrivals to different nodes in the network, while the time dependency captures the time correlation between arrivals to each node. We model such traffic with a Markov-Modulated Poisson Process(MMPP).It is shown that even in the single node environment, the problem is not mathematically tractable. A model with an infinite number of circuits is used to approximate the finite model. A novel recursive methodology is introduced in finding the joint moments of the number of busy circuits in different cells in the network leading to accurate determination of blocking probability. A simple mixed-Poisson distribution is introduced as an accurate approximation of the distribution of the number ofbusy circuits.We show that for certain cases, in the system with an infinite number of circuits in each cell, there is no effect of mobility on the performance of the system. Our numerical results indicate that the traffic burstiness has a major impact on the system performance. The mixed-Poisson approximation is found to be a very good fit to the exact finite model. The performance of this approximation using few moments is affected by traffic burstiness and average load. We find that in a reasonable range of traffic burstiness, the mixed-Poisson distribution provides a close approximation.

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

network fit methodology mobility space approximation performance correlation probability model traffic effect circuits

dependencies
systems
cellular network
determinism
recursion
environments
process
timing
distributed


goals and plans in a program for playing go A program that plays Go provides a basis for analyzing possibilities for extending present AI conceptions of planning and goal structures to problems that are ill-structured, dynamic, multiperson, resource-bound, and highly interactive. The focus is on mechanisms for communicating information and control over time and among a number of interacting processes, in a flexible but coherent manner. Using the capabilities of current computer languages, it is possible to specify planning and goal structures, and appropriate conventions for them, that will accommodate the demands of these increasingly complex and sophisticated problem environments.

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

artificial intelligence
plans and goals
go program
ill-structured problems
game playing


A hybrid Wavelet Neural Network and Switching Particle Swarm Optimization algorithm for face direction recognition Face direction recognition is an important research issue in humancomputer interaction. In order to improve recognition accuracy, a novel hybrid approach called Switching Particle Swarm OptimizationWavelet Neural Network (SPSOWNN) is presented. In this model, we employ the recently proposed Switching Particle Swarm Optimization (SPSO) algorithm to optimize the parameters of weights, scale factors, translation factors and threshold in Wavelet Neural Network (WNN). The proposed SPSOWNN method has fast convergence speed and higher learning ability than conventional WNNs. Especially, a mode-dependent velocity updating equation with Markovian switching parameters is introduced in SPSO to overcome the contradiction between the local search and the global search, which makes it easy to jump the local minimum. The experiment results of the recognition for face direction show the feasibility and effectiveness of the proposed method. Compared with Particle Swarm OptimizationWavelet Neural Network (PSOWNN), Genetic AlgorithmWavelet Neural Network (GAWNN) and WNN, the proposed method has much better performance over them.

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

face direction recognition
wavelet neural network
switching particle swarm optimization


Three-dimensional projection mask-less patterning (PMLP) of micro-lenses and cones: Monitoring and modelling of ion multi-beam kinetic sputtering in GaAs A projection mask-less patterning (PMLP) proof-of-concept tool, realised as part of the European FP6-NMP integrated project CHARPAN (Charged Particle Nanotech), has been applied for three-dimensional patterning of a GaAs surface, using a stencil mask with a pre-defined opening distribution. A 1010 matrix of micro-lenses was used as test structure for argon ion multi-beam structuring, while studying the time evolution of the sputtered structures. The kinetic sputtering and re-deposition have been modelled in simulation software, in order to be able to correct for such effects beforehand in the design of datasets to be fed to the future programmable aperture plate.

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

3d nanopatterning
micro-lenses
ion multi-beam projection
mask-less
re-deposition


Criterion of calibration for transductive confidence machine with limited feedback This paper is concerned with the problem of on-line prediction in the situation where some data are unlabelled and can never be used for prediction, and even when the data are labelled, the labels may arrive with a delay. We construct a modification of randomised transductive confidence machine for this case and prove a necessary and sufficient condition for its predictions being calibrated, in the sense that in the long run they are wrong with a prespecified probability under the assumption that the data are generated independently by the same distribution. The condition for calibration turns out to be very weak: feedback should be given on more than a logarithmic fraction of steps. (C) 2006 Elsevier B.V. All rights reserved.

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


Restricted natural language based querying of clinical databases A generic querying solution in the clinical domain. Translation of restricted natural language queries to SQL queries. Resolving the complexity of data extraction from EntityAttributeValue data 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

restricted natural language querying
knowledge discovery and reuse
data analytics


Reconstruction of gastric slow wave from finger photoplethysmographic signal using radial basis function neural network Extraction of extra-cardiac information from photoplethysmography (PPG) signal is a challenging research problem with significant clinical applications. In this study, radial basis function neural network (RBFNN) is used to reconstruct the gastric myoelectric activity (GMA) slow wave from finger PPG signal. Finger PPG and GMA (measured using Electrogastrogram, EGG) signals were acquired simultaneously at the sampling rate of 100Hz from ten healthy subjects. Discrete wavelet transform (DWT) was used to extract slow wave (00.1953Hz) component from the finger PPG signal; this slow wave PPG was used to reconstruct EGG. A RBFNN is trained on signals obtained from six subjects in both fasting and postprandial conditions. The trained network is tested on data obtained from the remaining four subjects. In the earlier study, we have shown the presence of GMA information in finger PPG signal using DWT and cross-correlation method. In this study, we explicitly reconstruct gastric slow wave from finger PPG signal by the proposed RBFNN-based method. It was found that the network-reconstructed slow wave provided significantly higher (P<0.0001) correlation (?0.9) with the subjects EGG slow wave than the correlation obtained (?0.7) between the PPG slow wave from DWT and the EEG slow wave. Our results showed that a simple finger PPG signal can be used to reconstruct gastric slow wave using RBFNN method.

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

gastric myoelectric activity
photoplethysmography
discrete wavelet transform
radial basis function neural network


Model-Based Tomographic Reconstruction of Objects Containing Known Components The likelihood of finding manufactured components (surgical tools, implants, etc.) within a tomographic field-of-view has been steadily increasing. One reason is the aging population and proliferation of prosthetic devices, such that more people undergoing diagnostic imaging have existing implants, particularly hip and knee implants. Another reason is that use of intraoperative imaging (e. g., cone-beam CT) for surgical guidance is increasing, wherein surgical tools and devices such as screws and plates are placed within or near to the target anatomy. When these components contain metal, the reconstructed volumes are likely to contain severe artifacts that adversely affect the image quality in tissues both near and far from the component. Because physical models of such components exist, there is a unique opportunity to integrate this knowledge into the reconstruction algorithm to reduce these artifacts. We present a model-based penalized-likelihood estimation approach that explicitly incorporates known information about component geometry and composition. The approach uses an alternating maximization method that jointly estimates the anatomy and the position and pose of each of the known components. We demonstrate that the proposed method can produce nearly artifact-free images even near the boundary of a metal implant in simulated vertebral pedicle screw reconstructions and even under conditions of substantial photon starvation. The simultaneous estimation of device pose also provides quantitative information on device placement that could be valuable to quality assurance and verification of treatment delivery.

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

ct reconstruction
implant imaging
metal artifact reduction
penalized-likelihood estimation


Modified Clotting Properties of Fibrinogen in the Presence of Acetylsalicylic Acid in a Purified System To assess how treatment with acetylsalicylic acid (ASA) alters the fibrin network structure, clotting was initiated in purified fibrinogen incubated with ASA by adding thrombin. Clotting time and maximum absorbance of the fibrin aggregation curve were used to demonstrate the potential of fibrin generation. The results showed that the clotting properties of fibrinogen decreased and that the affinity of plasminogen to fibrin or thrombin inhibition by antithrombin increased if plasminogen or antithrombin, respectively, were present in the reaction system. The effect of ASA varied in a dose dependent manner. It was concluded that ASA may directly or indirectly confer positive or negative effects on the stability of the fibrin clot and that the balance between these effects may be regulated by the ASA dose.

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


precision locks This paper describes a new method for controlling data base concurrency, called precision locks (PL). The name is derived from the fact that they lock precisely the set of tuples required to guarantee data base consistency, phantoms included. This results in maximum concurrency among all tuple-level locking methods, including predicate locks. A framework for comparing locking systems which indicates the errors committed by them is introduced. It is shown that existing systems commit these errors while PL does not. While other logical locking systems are limited in the complexity of permissible predicates, PL allows them to be arbitrary. It is shown that transactions under PL are well formed and two phased which is sufficient to maintain consistency. The execution cost of PL is compared to a conventional tuple-level locking method. It is found that PL usually is cheaper to execute.

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

framework
method
systems
data base
concurrency
commit
complexity
consistency
paper
errors
cost
locking

precise maintainability transaction control


Finite volume difference scheme for a degenerate parabolic equation in the zero-coupon bond pricing In this paper we solve numerically a degenerate parabolic equation with dynamical boundary conditions of zero-coupon bond pricing. First, we discuss some properties of the differential equation. Then, starting from the divergent form of the equation we implement the finite volume method of Wang (2004) [6] to discretize the differential problem. We show that the system matrix of the discretization scheme is an M-matrix, so that the discretization is monotone. This provides the non-negativity of the price with respect to time if the initial distribution is non-negative. Numerical experiments demonstrate the efficiency of our difference scheme near the ends of the interval where the degeneration occurs. (C) 2011 Elsevier Ltd. All rights reserved.

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

degenerate parabolic equation
finite volume
difference scheme


Suppliers selection in the presence of both cardinal and ordinal data Traditionally, supplier selection models are based on cardinal data with less emphasis on ordinal data. However, with the widespread use of manufacturing philosophies such as just-in-time (JIT), emphasis has shifted to the simultaneous consideration of cardinal and ordinal data in supplier selection process. To select the best suppliers in the presence of both cardinal and ordinal data, this paper proposes an innovative method, which is based on imprecise data envelopment analysis (IDEA). A numerical example demonstrates the application of the proposed method.

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

data envelopment analysis
supplier selection
cardinal and ordinal data


constructing a virtual primary key for fingerprinting relational data Agrawal and Kiernan's watermarking technique for database relations [1] and Li et al's fingerprinting extension [6] both depend critically on primary key attributes. Hence, those techniques cannot embed marks in database relations without primary key attributes. Further, the techniques are vulnerable to simple attacks that alter or delete the primary key attribute.This paper proposes a new fingerprinting scheme that does not depend on a primary key attribute. The scheme constructs virtual primary keys from the most significant bits of some of each tuple's attributes. The actual attributes that are used to construct then virtual primary key differ from tuple to tuple. Attribute selection is based on a secret key that is known to the merchant only. Further, the selection does not depend on an apriori ordering over the attributes, or on knowledge of the original relation or fingerprint codeword.The virtual primary keys are then used in fingerprinting as in previous work [6]. Rigorous analysis shows that, with high probability, only embedded fingerprints can be detected and embedded fingerprints cannot be modified or erased by a variety of attacks. Attacks include adding, deleting, shuffling, or modifying tuples or attributes (including a primary key attribute if one exists), guessing secret keys, and colluding with other recipients of a relation.

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


fast collision detection for deformable models using representative-triangles We present a new approach to accelerate collision detection for deformable models. Our formulation applies to all triangulated models and significantly reduces the number of elementary tests between features of the mesh, i.e., vertices, edges and faces. We introduce the notion of Representative-Triangles, standard geometric triangles augmented with mesh feature information and use this representation to achieve better collision query performance. The resulting approach can be combined with bounding volume hierarchies and works well for both inter-object and self-collision detection. We demonstrate the benefit of Representative-Triangles on continuous collision detection for cloth simulation and N-body collision scenarios. We observe up to a one-order of magnitude reduction in feature-pair tests and up to a 5X improvement in query time.

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

bounding-volume hierarhcy
continuous collision detection
self-collision
deformable collisions


A high performance and intrinsically secure key establishment protocol for wireless sensor networks Key establishment among neighboring sensors is the most challenging issue for security services such as authentication and confidentiality in wireless sensor networks (WSNs). Many key establishment schemes have recently been proposed, but most have security or performance issues. In this paper, we propose a novel key establishment protocol which is suitable for low resource sensor nodes. In this protocol, each sensor has a secret key and some common keys with other sensors. A common key between two sensors is generated using the secret of one sensor and the identity of the other. This key is stored in one of the sensors, and the other sensor generates it when a secure connection is required. We develop the proposed protocol for different key distribution models. These models use pre-deployment knowledge to distribute the common keys among sensors. The proposed scheme is analyzed based on connectivity, scalability, memory consumption and resistance against attacks. In comparison with previous approaches, the proposed protocol is the most resilient against compromised node attacks. In addition, it has low memory requirements and low computational overhead.

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

key management
network security
random key pre-distribution
symmetric polynomials
deployment knowledge


Using cross-validation for model parameter selection of sequential probability ratio test The sequential probability ratio test is widely used in in-situ monitoring, anomaly detection, and decision making for electronics, structures, and process controls. However, because model parameters for this method, such as the system disturbance magnitudes, and false and missed alarm probabilities, are selected by users primarily based on experience, the actual false and missed alarm probabilities are typically higher than the requirements of the users. This paper presents a systematic method to select model parameters for the sequential probability ratio test by using a cross-validation technique. The presented method can improve the accuracy of the sequential probability ratio test by reducing the false and missed alarm probabilities caused by improper model parameters. A case study of anomaly detection of resettable fuses is used to demonstrate the application of a cross validation method to select model parameters for the sequential probability ratio test.

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

sequential probability ratio test (sprt)


Using manual prostate contours to enhance deformable registration of endorectal MRI Endorectal MRI provides detailed images of the prostate anatomy and is useful for radiation treatment planning. Here we describe a Demons field-initialized B-spline deformable registration of prostate MRI. T2-weighted endorectal MRIs of five patients were used. The prostate and the tumor of each patient were manually contoured. The planning MRIs and their segmentations were simulated by warping the corresponding endorectal MRIs using thin plate spline (TPS). Deformable registration was initialized using the deformation field generated using Demons algorithm to map the deformed prostate MRI to the non-deformed one. The solution was refined with B-Spline registration. Volume overlap similarity was used to assess the accuracy of registration and to suggest a minimum margin to account for the registration errors. Initialization using Demons algorithm took about 15min on a computer with 2.8GHz Intel, 1.3GB RAM. Refinement B-spline registration (200 iterations) took less than 5min. Using the synthetic images as the ground truth, at zero margin, the average (S.D.) 98 (0.4)% for prostate coverage was 97 (1)% for tumor. The average (S.D.) treatment margin required to cover the entire prostate was 1.5 (0.2)mm. The average ( S.D.) treatment margin required to cover the tumor was 0.7 (0.1)mm. We also demonstrated the challenges in registering an in vivo deformed MRI to an in vivo non-deformed MRI. We here present a deformable registration scheme that can overcome large deformation. This platform is expected to be useful for prostate cancer radiation treatment planning.

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

endorectal mri
demons
deformable registration
treatment margin


Social Engagement and Attachment This article focuses on the importance of social engagement and the behavioral and neurophysiological mechanisms that allow individuals to reduce psychological and physical distance. A model of social engagement derived from the Polyvagal Theory is presented. The model emphasizes phylogeny as an organizing principle and includes the following points

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

vagus
autonomic nervous system
oxytocin
evolution


Back-propagation neural network based importance-performance analysis for determining critical service attributes Importance-performance analysis (IPA) is a simple but effective means of assisting practitioners in prioritizing service attributes when attempting to enhance service quality and customer satisfaction. As numerous studies have demonstrated, attribute performance and overall satisfaction have a non-linear relationship, attribute importance and attribute performance have a causal relationship and the customer's self-stated importance is not the actual importance of service attribute. These findings raise questions regarding the applicability of conventional IPA. Therefore, this study presents a revised IPA which integrates back-propagation neural network and three-factor theory to effectively assist practitioners in determining critical service attributes. Finally, a customer satisfaction improvement case is presented to demonstrate the implementation of the proposed Back-Propagation Neural Network based Importance Performance Analysis (BPNN-IPA) approach. (C) 2006 Elsevier Ltd. All rights reserved.

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

back-propagation neural network
three-factor theory
critical service attribute


Branch-and-price and constraint programming for solving a real-life technician dispatching problem Design of optimal routes for technicians that was motivated by a real problem. Treatment of soft time windows for arrival times at client locations. An exact solution procedure for the VRPSTW is proposed. A branch-and-price framework using constraint programming is implemented. Results obtained compare favorably with the current practice.

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

branch-and-price
routing
technician dispatch problem


Generating Reliable Code from Hybrid-Systems Models Hybrid systems have emerged as an appropriate formalism to model embedded systems as they capture the theme of continuous dynamics with discrete control. Under this paradigm, distributed embedded systems can be modeled as a network of communicating hybrid automata. Several techniques for code generation from these models have also been proposed and commercially implemented. Providing formal guarantees of the generated code with respect to the model, however, has turned out to be a hard problem. While the model is set in continuous time with concurrent execution and instantaneous switching, the code running on an inherently discrete platform, can be affected by the sampling interval, round-off errors, and communication delays between the sensor, controller, and actuators. Consequently, semantic differences between the model and its code can arise with potentially different system behavior. This paper proposes a criterion for faithful implementation of the hybrid-systems model with a focus on its switching semantics. We discuss different techniques to ensure a faithful implementation of the model, and test the feasibility of our concepts by implementing a model heater system. In this heater case study, we successfully eliminate all fault transitions and, thereby, generate code with correct behavior complying with the specification.

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


Data access in distributed simulations of multi-agent systems Distributed simulation has emerged as an important instrument for studying large-scale complex systems. Such systems inherently consist of a large number of components, which operate in a large shared state space interacting with it in highly dynamic and unpredictable ways. Optimising access to the shared state space is crucial for achieving efficient simulation executions. Data accesses may take two forms: locating data according to a set of attribute value ranges (range query) or locating a particular state variable from the given identifier (ID query and update). This paper proposes two alternative routing approaches, namely the address-based approach, which locates data according to their address information, and the range-based approach, whose operation is based on looking up attribute value range information along the paths to the destinations. The two algorithms are discussed and analysed in the context of PDES-MAS, a framework for the distributed simulation of multi-agent systems, which uses a hierarchical infrastructure to manage the shared state space. The paper introduces a generic meta-simulation framework which is used to perform a quantitative comparative analysis of the proposed algorithms under various circumstances.

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

complex systems
distributed simulation
range query


Modeling and fabrication of artistic products based on IFS fractal representation Contemporary computer-aided design (CAD) and computer-aided manufacturing (CAM) theories and systems are well developed for analytical and free-form objects, but neither can deal with all artistically appealing objects efficiently. Artistically appealing objects are common in, for example, jewellery and furniture decoration. Therefore, it is valuable to explore more suitable modeling and manufacturing method for artistically appealing objects. Fractal geometry has been employed for modeling natural objects that cannot be described easily by Euclidean geometry. In this paper, one type of fractal solid the Iterated Function System (IFS) fractal is proposed for modeling artistically appealing objects in a computational form. A Radial-Blossoming Tree (RBT) data structure is worked out for fractal solid modeling in a CAD platform. Traversal algorithms have been devised to extract necessary information from the RBT for generating the toolpath for a layered manufacturing (LM) process, so that a physical fractal object can be built and the fabrication of a fractally represented artistic product can be realized.

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


An improved method for bounding stationary measures of finite Markov processes A new method to compute bounds on stationary results of finite Markov processes in discrete or continuous time is introduced. The method extends previously published approaches using polyhedra of eigenvectors for stochastic matrices with a known lower and upper bound of their elements. Known techniques compute bounds for the elements of the stationary vector with respect to the lower bounds of the matrix elements and another set of bounds with respect to the upper bounds of matrix elements. The resulting bounds are usually not sharp, if lower and upper bounds for the elements are known. The new approach combines lower and upper bounds resulting in sharp bounds which are often much tighter than bounds computed using only one bounding value for the matrix elements.

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

performance analysis
dependability evaluation
stationary analysis
numerical analysis
bounding techniques


Predicting the exchange traded fund DIA with a combination of genetic algorithms and neural networks We evaluate the performance of a heterogeneous mixture of neural network algorithms for predicting the exchange-traded fund DIA. A genetic algorithm is utilized to find the best mixture of neural networks, the topology of individual networks in the ensemble, and to determine the features set. The genetic algorithm also determines the window size of the input time-series supplied to the individual classifiers in the mixture of experts. The mixtures of neural network experts consist of recurrent back-propagation networks, and radial basis function networks. The application of genetic algorithm on the heterogeneous mixture of powerful neural network architectures shows promise for prediction of stock market time series. These highly non-linear, stochastic and highly non-stationary time series have been found to be notoriously difficult to predict using conventional linear statistical methods. In this paper, we propose a biologically inspired methodology to tackle such hard problem using a multi-faceted solution.

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

time series prediction
financial forecasting


efficient mutation testing by checking invariant violations Mutation testing measures the adequacy of a test suite by seeding artificial defects (mutations) into a program. If a mutation is not detected by the test suite, this usually means that the test suite is not adequate. However, it may also be that the mutant keeps the program's semantics unchanged-and thus cannot be detected by any test. Such equivalent mutants have to be eliminated manually, which is tedious. We assess the impact of mutations by checking dynamic invariants. In an evaluation of our JAVALANCHE framework on seven industrial-size programs, we found that mutations that violate invariants are significantly more likely to be detectable by a test suite. As a consequence, mutations with impact on invariants should be focused upon when improving test suites. With less than 3\% of equivalent mutants, our approach provides an efficient, precise, and fully automatic measure of the adequacy of a test suite.

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


Encoding Words Into Interval Type-2 Fuzzy Sets Using an Interval Approach This paper presents a very practical type-2-fuzzistics methodology for obtaining interval type-2 fuzzy set (IT2 FS) models for words, one that is called an interval approach (IA). The basic idea of the IA is to collect interval endpoint data for a word from a group of subjects, map each subject's data interval into a prespecified type-1 (T1) person membership function, interpret the latter as an embedded T1 FS of an IT2 FS, and obtain a mathematical model for the footprint of uncertainty (FOU) for the word from these T1 FSs. The IA consists of two parts: the data part and the FS part. In the data part, the interval endpoint data are preprocessed, after which data statistics are computed for the surviving data intervals. In the FS part, the data are used to decide whether the word should be modeled as an interior, left-shoulder, or right-shoulder FOU. Then, the parameters of the respective embedded T1 MFs are determined using the data statistics and uncertainty measures for the T1 FS models. The derived T1 MFs are aggregated using union leading to an FOU for a word, and finally, a mathematical model is obtained for the FOU. In order that all researchers can either duplicate our results or use them in their research, the raw data used for our codebook examples, as well as a MATLAB M-file for the IA, have been put on the Internet at: http://sipi.usc.edu/similar to mendel.

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

computing with words
encoder
fuzzistics
interval approach (ia)
interval type-2 fuzzy sets (it2 fs)
perceptual computer (per-c)


Well-posedness by perturbations of mixed variational inequalities in Banach spaces ? In this paper, we consider an extension of the notion of well-posedness by perturbations, introduced by Zolezzi for a minimization problem, to a mixed variational inequality problem in a Banach space. We establish some metric characterizations of the well-posedness by perturbations. We also show that under suitable conditions, the well-posedness by perturbations of a mixed variational inequality problem is equivalent to the well-posedness by perturbations of a corresponding inclusion problem and a corresponding fixed point problem. Also, we derive some conditions under which the well-posedness by perturbations of a mixed variational inequality is equivalent to the existence and uniqueness of its solution.

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

mixed variational inequality
inclusion problem
fixed point problem
uniqueness


Scatterplot layout for high-dimensional data visualization Multi-dimensional data visualization is an important research topic that has been receiving increasing attention. Several techniques that apply scatterplot matrices have been proposed to represent multi-dimensional data as a collection of two-dimensional data visualization spaces. Typically, when using the scatterplot-based approach it is easier to understand relations between particular pairs of dimensions, but it often requires too large display spaces to display all possible scatterplots. This paper presents a technique to display meaningful sets of scatterplots generated from high-dimensional datasets. Our technique first evaluates all possible scatterplots generated from high-dimensional datasets, and selects meaningful sets. It then calculates the similarity between arbitrary pairs of the selected scatterplots, and places relevant scatterplots closer together in the display space while they never overlap each other. This design policy makes users easier to visually compare relevant sets of scatterplots. This paper presents algorithms to place the scatterplots by the combination of ideal position calculation and rectangle packing algorithms, and two examples demonstrating the effectiveness of the presented technique.

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

visualization
scatterplot
rectangle packing


statistical characterization of standard cells using design of experiments with response surface modeling This paper presents an approach for statistical characterization of standard cells based on a combination of Statistical Design of Experiments (S-DoE) and Response Surface Modeling. Unlike both, most of the State-of-the-Art and Sensitivity Analysis (SA) techniques currently offered by EDA vendors, S-DoE preserves the underlying correlation among process variation parameters. This results in about two orders of magnitude of statistical accuracy improvement, yet it features an electrical simulation effort linear to the cell complexity. The technique is validated using a representative subset of standard cells using a 32nm statistical Physical Design Kit.

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

response modeling
doe
statistical standard cell analysis


Measurement-based modelling of power consumption at wireless access network gateways Improving the energy efficiency of the ICT sector is becoming an ambitious challenge for industries and research communities alike. Understanding how the energy is consumed in each part of an ICT system becomes fundamental in order to minimize the overall energy consumed by the system itself. In this paper, we propose an experimentally-driven approach to (i) characterize typical wireless access network gateways from an energy consumption standpoint and (ii) develop simple and accurate power consumption models for such gateways. In this work we focused our attention on the monitoring, measurement and analysis of the energy consumption patterns of WiFi and WiMAX gateways. Our measurements show that the power consumption of such gateways exhibits a linear dependence on the traffic until a saturation point is reached. (C) 2012 Elsevier B.V. All rights reserved.

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

wimax
wifi
power consumption
energy efficiency
modelling


Generalizing prefix filtering to improve set similarity joins Identification of all pairs of objects in a dataset whose similarity is not less than a specified threshold is of major importance for management, search, and analysis of data. Set similarity joins are commonly used to implement this operation; they scale to large datasets and are versatile to represent a variety of similarity notions. Most methods proposed so far present two main phases at a high level of abstraction: candidate generation producing a set of candidate pairs and verification applying the actual similarity measure to the candidates and returning the correct answer. Previous work has primarily focused on the reduction of candidates, where candidate generation presented the major effort to obtain better pruning results. Here, we propose an opposite approach. We drastically decrease the computational cost of candidate generation by dynamically reducing the number of indexed objects at the expense of increasing the workload of the verification phase. Our experimental findings show that this trade-off is advantageous: we consistently achieve substantial speed-ups as compared to known algorithms. (C) 2010 Elsevier B.V. All rights reserved.

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

advanced query processing
set similarity join


Using a bank of binary Hopfield networks as constraints solver in hybrid algorithms This paper proposes the use of a bank of Hopfield networks to solve a class of constraints which appear in combinatorial optimization problems. Specifically, we deal with problems which constraints structure can be represented by a binary matrix C, and can be separated in independent substructures. We show that a bank of Hopfield networks can solve these constraints, and also can be easily hybridized with a global search algorithm, such as simulated annealing, to obtain a final solution to the problem. We apply our approach to the solution of a famous logic-type puzzle, the light-up puzzle, where we report improvements over a branch and bound algorithm, and to an important problem which arises in electronic control: the so-called Crossbar Switch Problem.

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

bank of hopfield networks
hybrid algorithms
combinatorial optimization problems
crossbar switch problem


Social relation extraction from texts using a support-vector-machine-based dependency trigram kernel We propose a social relation extraction system using dependency-kernel-based support vector machines (SVMs). The proposed system classifies input sentences containing two peoples names on the basis of whether they do or do not describe social relations between two people. The system then extracts relation names (i.e., social-related keywords) from sentences describing social relations. We propose new tree kernels called dependency trigram kernels for effectively implementing these processes using SVMs. Experiments showed that the proposed kernels delivered better performance than the existing dependency kernel. On the basis of the experimental evidence, we suggest that the proposed system can be used as a useful tool for automatically constructing social networks from unstructured texts.

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

social relation extraction
dependency trigram kernel


concurrently-secure credential ownership proofs We address the case in credential systems where a credential owner wants to show her credential to a verifier without taking the risk that the ability to prove ownership of the same (and any other) credential is transferred to the verifier. We define credential ownership proof protocols for credentials signed by standard signature schemes. We also propose proper security definitions for the protocol, aiming to protect the security of both the credential issuer and the credential owner against concurrent attacks. We give two generic constructions of credential ownership proofs based on identity-based encryption and identity-based identification schemes. Furthermore, we show that signatures with credential ownership proofs are equivalent to identity-based identification schemes, in the sense that any secure construction of each implies a secure construction of the other. Finally, we show that the GQ identification protocol yields an efficient credential ownership proof for credentials signed by the RSA-FDH signature scheme of Bellare and Rogaway and prove the protocol concurrently-secure.

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

signature schemes
identification schemes
credential systems

designated-verifier signatures
identity-based cryptography


rapid association rule mining Association rule mining is a well-researched area where many algorithms have been proposed to improve the speed of mining. In this paper, we propose an innovative algorithm called Rapid Association Rule Mining (RARM) to once again break this speed barrier. It uses a versatile tree structure known as the Support-Ordered Trie Itemset (SOTrieIT) structure to hold pre-processed transactional data. This allows RARM to generate large 1-itemsets and 2-itemsets quickly without scanning the database and without candidate 2-itemset generation. It achieves significant speed-ups because the main bottleneck in association rule mining using the Apriori property is the generation of candidate 2-itemsets. RARM has been compared with the classical mining algorithm Apriori and it is found that it outperforms Apriori by up to two orders of magnitude (100 times), much more than what recent mining algorithms are able to achieve.

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

barrier
tree
mining
generation
structure
association rule
data
algorithm
paper
database

innovating
index data structure
electronic commerce
association rule mining
transaction
scan


A system for efficiently self-reconstructing 11/2-track switch torus arrays A mesh-connected processor array consists of many similar processing elements (PEs), which can be executed in both parallel and pipeline processing. For the implementation of an array of large numbers of processors, it is necessary to consider some fault tolerant issues to enhance the (fabrication-time) yield and the (run-time) reliability. In this paper, we introduce the 1(1)/(2) track switch torus array by changing the connections in 1(1)/(2)-track switch mesh array, and we apply our approximate re2 configuration algorithm to the torus array. We describe the reconfiguration strategy for the 1(1)/(2)-track switch torus array and its realization using WSI, especially 3-dimensional realization. A hardware realization of the algorithm is proposed and simulation results about the array reliability are shown. These imply that a self-reconfigurable system with no host computer can bu realized using our method, hence our method is effective in enhancing the run-time reliability as well as the fabrication-time yield of processor arrays.

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

11/2-track switch torus array
fault tolerance
wafer scale integration
self-reconfigurable system


Instantaneous frequency estimation of interfering FM signals through time-scale isolevel curves This paper investigates the possibility of extracting information regarding two or more frequency modulated (FM) signals in almost complete interference. To this aim, a novel wavelet-based approach for the estimation of instantaneous frequency (IF) is presented. It is first proved that the modulus of the Analytic Wavelet Transform (referred to as scalogram) of one or more FM signals obeys a time-scale evolution law whose isolevel curves (ICs) depend on signal IF. Hence, it is shown that scalogram points not belonging to ridge can provide a more robust IF estimate in case of strong interference. Experimental results confirm that the proposed approach improves ridge-based IF estimation, even in presence of noise.

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

instantaneous frequency
wavelet transform
fm signals

scalogram ridges
time-scale isolevel curves


Learning Graphical Model Parameters with Approximate Marginal Inference Likelihood-based learning of graphical models faces challenges of computational complexity and robustness to model misspecification. This paper studies methods that fit parameters directly to maximize a measure of the accuracy of predicted marginals, taking into account both model and inference approximations at training time. Experiments on imaging problems suggest marginalization-based learning performs better than likelihood-based approximations on difficult problems where the model being fit is approximate in nature.

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

conditional random fields
machine learning
segmentation


Stereo matching using weighted dynamic programming on a single-direction four-connected tree In recent years, stereo matching based on dynamic programming (DP) has been widely studied and various tree structures are proposed to improve the matching accuracy. However, previous DP-based algorithms do not incorporate all the smoothness functions determined by the edges between the adjacent pixels in the image, which will usually lead to lower matching accuracies. In this paper, we propose a novel stereo matching algorithm based on weighted dynamic programming on a single-direction four-connected (SDFC) tree. The SDFC tree structure is a new tree structure which includes all the edges in the image and the disparity of a pixel can be affected by all the edges in the image. However, in the SDFC tree, conventional DP-based algorithms will make the pixels that are far away from the root node provide higher energy than the nearby pixels, which will decrease the matching accuracy. So, the weighted dynamic programming approach is proposed to optimize the energy function on the new tree structure, and all the pixels in the SDFC tree are treated equivalently. Dynamic programming in the SDFC tree of every pixel in the image separately is very time-consuming, so a fast DP optimization method is designed for the SDFC tree, which reduces the computational complexity of the proposed weighted DP algorithm to 12 times of conventional DP based algorithm. Experiments show that our algorithm not only produces quite smooth and reasonable disparity maps which are close to the state-of-the-art results, but also can be implemented quite efficiently. Performance evaluations on the Middlebury data set show that our method ranks top in all the DP-based stereo matching algorithms, even better than the algorithms that apply segmentation techniques. Experimental results in an unmanned ground vehicle (UGV) test bed show that our algorithm gets very good matching results in different outdoor conditions, even on the asphaltic road which is considered to be textureless. This illustrates the robustness of our algorithm. (C) 2012 Elsevier Inc. All rights reserved.

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

weighted dynamic programming
single-direction four-connected tree


A global stability result for primal-dual congestion control algorithms with routing We prove a global stability result for a fluid approximation of a class of Internet-like communications networks operating a form of congestion control with routing. The network consists of an arbitrary interconnection of sources and links with negligible propagation delays. The model here allows for arbitrary strictly concave utility functions and the presence of dynamics at both sources and links.

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