The gap between the number of known protein sequences and structures continues to widen, particularly as a result of sequencing projects for entire genomes. Recently there have been many attempts to generate structural assignments to all genes on sets of completed genomes using fold-recognition methods. We developed a method that detects false positives made by these genome-wide structural assi...

Lab Assignments Instrumentation Labs: Name of Lab Assignment: Lab 1 Introductory Experiments and Linear Circuits I [1] Lab 2 Linear Circuits II [2] Lab 3 Semiconductor Diodes [3] Lab 4 JFET Circuits I [4] Lab 5 JFET Circuits II [5] Lab 6 Op Amps I [6] Lab 7 Op Amps II [7] Lab 8 Op Amps III [8] Lab 9 LabVIEW Programming [9] Lab 10 Analog to Digital and Digital to Analog Conversion [10] Lab 11 Si...

Scheduling problems are often modeled as resource constrained problems in which critical resource assignments to tasks are known and the best assignment of resource time must be made subject to these constraints. Generalization to resource scheduling, where resource assignments are chosen concurrently with times results in a problem which is much more di cult. A simpli ed model of the general r...

Multi-label classification has received considerable interest in recent years. Multi-label classifiers have to address many problems including: handling large-scale datasets with many instances and a large set of labels, compensating missing label assignments in the training set, considering correlations between labels, as well as exploiting unlabeled data to improve prediction performance. To ...

The SUPERFAMILY database contains a library of hidden Markov models representing all proteins of known structure. The database is based on the SCOP 'superfamily' level of protein domain classification which groups together the most distantly related proteins which have a common evolutionary ancestor. There is a public server at http://supfam.org which provides three services: sequence searching...

Scheduling problems are often modeled as resource constrained problems in which critical resource assignments to tasks are known and the best assignment of resource time must be made subject to these constraints. Generalization to resource scheduling, where resource assignments are chosen concurrently with times results in a problem which is much more di±cult. A simpli ̄ed model of the general r...

Portfolio Online Evolution is a novel method for playing real-time strategy games through evolutionary search in the space of assignments of scripts to individual game units. This method builds on and recombines two recently devised methods for playing multi-action games: (1) Portfolio Greedy Search, which searches in the space of heuristics assigned to units rather than in the space of actions...

When function of protein cannot be experimentally determined, it can often be inferred from sequence similarity. Analysis of the protein structure can provide functional clues or confirm tentative functional assignments inferred from the sequence. Many structure based approaches exist (e.g. fold similarity, three-dimensional templates), but as no single method can be expected to be successful i...

This paper presents a new method for multiple criteria ordinal classification (sorting) problems. This type of problem requires the different classes or categories to be pre-defined and ordered, from the best to the worst or from the worst to the best. The actions (not necessarily known a priori) are assigned to the different ordered classes. Several ELECTRE type methods were designed to deal w...

Reducing the amount of hardware needed for implementing a sequential machine is very important. The problem of, in the strict sense, minimal realization of sequential machines is difficult and it is entirely unsolved (except complete enumeration). Typically, this problem can be replaced with a number of subproblems such as: state minimization, state assignment, choice of flip-flops and minimiza...