A novel strategy to increase protein expression yield is unintended induction of expression in complex media, called auto-induction. This method can be used to express proteins under control of the lac promoter without any need to monitor bacterial growth pattern, and addition of specific expression inducers such as Isopropyl β-D-1-thiogalactopyranoside (IPTG) at proper time. In the present stu...

A circle graph is the intersection graph of a set of chords on a circle. A graph is Helly circle if there is a model of chords satisfying the Helly property. In 2003 it was conjectured that Helly circle graphs are exactly diamond-free circle graphs. In this work, we propose a method to compress any Helly circle representation of a graph and give some ideas to advance in an inductive proof of th...

A paradox has arisen in the literature on information and communication technologies (ICT) appropriation by teachers during their internship and professional induction. On the one hand, some studies show that, at the completion of their basic training, new teachers have a good grounding in technology skills (Clausen 2007; Karsenti et al. 2007), feel fairly confident about using ICT (Moore and C...

Physics Education research indicates that there is a significant gap between the learning obtained by students and what teachers expect. In the usual teaching the fundamental concepts of electromagnetic induction are usually quickly analyzed, spending most of the time to solve problems in a more or less rote manner. However, Physics Education research has shown that the fundamental concepts of ...

The theory of universal graphs originated from the observation of R. Rado [4,5] that a universal countable graph X exists, i.e., X is countable and isomorphically embeds every countable graph. He also showed that under GCH, there is a universal graph in every infinite cardinal. Since then, several results have been proved about the existence of universal elements in different classes of graphs....

Current rule induction systems (e.g. CN2) typically rely on a \separate and conquer" strategy, learning each rule only from still-uncovered examples. This results in a dwindling number of examples being available for learning successive rules, adversely a ecting the system's accuracy. An alternative is to learn all rules simultaneously, using the entire training set for each. This approach is i...

Cost-sensitive specialization is a generic technique for misclassification cost sensitive induction. This technique involves specializing aspects of a classifier associated with high misclassification costs and generalizing those associated with low misclassification costs. It is widely applicable and simple to implement. It could be used to augment the effect of standard cost-sensitive inducti...

This paper explores two boosting techniques for cost-sensitive tree classiications in the situation where misclassiication costs change very often. Ideally, one would like to have only one induction, and use the induced model for diierent misclassiication costs. Thus, it demands robustness of the induced model against cost changes. Combining multiple trees gives robust predictions against this ...