A two-stage algorithm for identification of nonlinear dynamic systems

This paper investigates the two-stage stepwise identification for a class of nonlinear dynamic systems that can be described by linear-in-the-parameters models, and the model has to be built from a very large pool of basis functions or model terms. The main objective is to improve the compactness of the model that is obtained by the forward stepwise methods, while retaining the computational efficiency. The proposed algorithm first generates an initial model using a forward stepwise procedure. The significance of each selected term is then reviewed at the second stage and all insignificant ones are replaced, resulting in an optimised compact model with significantly improved performance. The main contribution of this paper is that these two stages are performed within a well-defined regression context, leading to significantly reduced computational complexity. The efficiency of the algorithm is confirmed by the computational complexity analysis, and its effectiveness is demonstrated by the simulation results.     

Computational complexity of queries based on itemsets

We investigate determining the exact bounds of the frequencies of conjunctions based on frequent sets. Our scenario is an important special case of some general probabilistic logic problems that are known to be intractable. We show that despite the limitations our problems are also intractable, namely, we show that checking whether the maximal consistent frequency of a query is larger than a given threshold is NP-complete and that evaluating the Maximum Entropy estimate of a query is PP-hard. We also prove that checking consistency is NP-complete.     

Width-restricted layering of acyclic digraphs with consideration of dummy nodes

This paper deals with the problem of finding graph layerings restricted to a given maximal width. However, other than previous approaches for width-restricted layering, we take into account the space for dummy nodes, which are introduced by edges crossing a layer. The main result is that the problem of finding a width-restricted layering under consideration of dummy nodes is NP-complete even when all regular nodes have the same constant width and all dummy nodes have the same constant width.     

A space- and time-efficient local-spin spin lock

A simple code transformation is presented that reduces the space complexity of Yang and Anderson's local-spin mutual exclusion algorithm. In both the original and the transformed algorithm, only atomic read and write instructions are used; each process generates Θ(logN) remote memory references per lock request, where N is the number of processes. The transformed algorithm uses Θ(N) distinct variables, which is clearly optimal.     

A Stronger Complexity Result for the Single Machine Multi-Operation Jobs Scheduling Problem to Minimize the Number of Tardy Jobs

We consider the single machine multi-operation jobs scheduling problem to minimize the number of tardy jobs. Each job consists of several operations that belong to different families. In a schedule, each family of job operations may be processed in batches with each batch incurring a setup time. A job completes when all of its operations have been processed. The objective is to minimize the number of tardy jobs. In the literature, this problem has been proved to be strongly NP-hard for arbitrary due-dates. We show in this paper that the problem remains strongly NP-hard even when the due-dates are common and all jobs have the same processing time.     

Switching between tasks of unequal familiarity: The role of stimulus-attribute and response-set selection.

It has been reported that it is harder to switch to a strong, well-practiced task from a weaker, less-practiced task than vice versa. Three experiments replicated this surprising asymmetry and investigated how it is affected by a reduction in interference between tasks. Experiment 1 progressively delayed the onset of the stimulus attribute associated with the stronger task. Experiments 2 and 3 separated the response sets of the tasks. Both manipulations reduced, without eliminating, interference of the stronger with the weaker task but reversed the asymmetry of switch costs, resulting in a larger cost of switching to the weaker task. The results are interpreted in terms of a model of the interactions between control input, task strength, and task priming. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

A Detection-Theoretic Model of Echo Inhibition.

A detection-theoretic analysis of the auditory localization of dual-impulse stimuli is described, and a model for the processing of spatial cues in the echo pulse is developed. Although for over 50 years "echo suppression" has been the topic of intense theoretical and empirical study within the hearing sciences, only a rudimentary understanding of its mechanisms has emerged. In this article, psychometric functions and results from matching studies are used in developing a model that specifies the perceived position of the echo pulse as a normal deviate, with an expectation that is a logistic function of the echo delay and a variance that depends on interaural time difference. Loss of information in the echo event is quantified as a decline in the efficiency with which the binaural system receives information from the lag impulse. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

CAM中一类新的NP完全问题

本文提出了计算机辅助制造(CAM)中的一类作业调度问题并证明了它的NP完全性。     

Drug Onset Cues, Conditioned Withdrawal, and Drug Relapse: Comment on McDonald and Siegel (2004).

Previous research has shown that under certain conditions environmental cues associated with morphine administration induce drug-opposite conditioned effects that mimic symptoms of opiate withdrawal. R. V. McDonald and S. Siegel (see record 2004-10475-001) extend these observations by demonstrating that acute exposure to a low dose of morphine induces symptoms of opiate withdrawal in rats previously exposed to a high dose of morphine. They hypothesized that early drug onset cues, repeatedly paired with later, larger drug effects, mediate the paradoxical effect of the low drug dose on behavior. They also hypothesized that conditioned withdrawal symptoms induced by the early drug onset cues may mediate the "priming" effect of drugs on relapse and craving. The authors of this comment discuss the degree to which the literature supports this hypothesis. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

PAC-learnability of probabilistic deterministic finite state automata in terms of variation distance

We consider the problem of PAC-learning distributions over strings, represented by probabilistic deterministic finite automata (PDFAs). PDFAs are a probabilistic model for the generation of strings of symbols, that have been used in the context of speech and handwriting recognition, and bioinformatics. Recent work on learning PDFAs from random examples has used the KL-divergence as the error measure; here we use the variation distance. We build on recent work by Clark and Thollard, and show that the use of the variation distance allows simplifications to be made to the algorithms, and also a strengthening of the results; in particular that using the variation distance, we obtain polynomial sample size bounds that are independent of the expected length of strings.