242,363 research outputs found
A Stitch in Time Saves Nine: How the State of Ohio Can Save Money and Distress Through Legal Training for Pre-Service Teachers
For simplicity, this Note will focus on the educational requirements for high school teachers rather than elementary or middle school teachers. Here, the requirements include core content instruction, literacy instruction, and a 12-week student teaching experience. Additionally, ODHE issues a vague requirement of preparation in six different Ohio school-related standards. Only one of those standards, the Ohio Standards for the Teaching Profession, even mentions correctly applying the law.
There is clearly a need for some form of legal preparation for teachers in Ohio that must take place before an individual becomes a teacher. Not only is there an ethical obligation to protect student rights, but there is a financial obligation to prevent the waste of taxpayer money on legal fees. This Note will establish the need for the Ohio legislature or ODHE to require that teacher preparation programs contain a set number of hours devoted to instructing pre-service teachers in the basics of education law and ethics because of the liability being placed on school districts.
In reaching its conclusion, Part I of this Note discusses the history of education and education standards in Ohio and how the law is omnipresent in a teacher’s day-to-day existence. In Part II, this Note covers the history of claims, the potential for school district liability for failing to train teachers and school personnel, and the ways school districts are immune from suits. In Part III, this Note sets out how more legal education could be added to the basic educational curriculum for pre-service teachers and explains why this move is both necessary and advantageous. The overall conclusion reached by this paper is that, while the state is immune from lawsuits due to a failure to train teachers, continual legal pressure on school districts could increase the support for legal training for teaching education law in universities to pre-service teachers
Levelable Sets and the Algebraic Structure of Parameterizations
Asking which sets are fixed-parameter tractable for a given parameterization
constitutes much of the current research in parameterized complexity theory.
This approach faces some of the core difficulties in complexity theory. By
focussing instead on the parameterizations that make a given set
fixed-parameter tractable, we circumvent these difficulties. We isolate
parameterizations as independent measures of complexity and study their
underlying algebraic structure. Thus we are able to compare parameterizations,
which establishes a hierarchy of complexity that is much stronger than that
present in typical parameterized algorithms races. Among other results, we find
that no practically fixed-parameter tractable sets have optimal
parameterizations
Resource Bounded Immunity and Simplicity
Revisiting the thirty years-old notions of resource-bounded immunity and
simplicity, we investigate the structural characteristics of various immunity
notions: strong immunity, almost immunity, and hyperimmunity as well as their
corresponding simplicity notions. We also study limited immunity and
simplicity, called k-immunity and feasible k-immunity, and their simplicity
notions. Finally, we propose the k-immune hypothesis as a working hypothesis
that guarantees the existence of simple sets in NP.Comment: This is a complete version of the conference paper that appeared in
the Proceedings of the 3rd IFIP International Conference on Theoretical
Computer Science, Kluwer Academic Publishers, pp.81-95, Toulouse, France,
August 23-26, 200
Randomness extraction and asymptotic Hamming distance
We obtain a non-implication result in the Medvedev degrees by studying
sequences that are close to Martin-L\"of random in asymptotic Hamming distance.
Our result is that the class of stochastically bi-immune sets is not Medvedev
reducible to the class of sets having complex packing dimension 1
Mining SOM expression portraits: Feature selection and integrating concepts of molecular function
Background: 
Self organizing maps (SOM) enable the straightforward portraying of high-dimensional data of large sample collections in terms of sample-specific images. The analysis of their texture provides so-called spot-clusters of co-expressed genes which require subsequent significance filtering and functional interpretation. We address feature selection in terms of the gene ranking problem and the interpretation of the obtained spot-related lists using concepts of molecular function.

Results: 
Different expression scores based either on simple fold change-measures or on regularized Students t-statistics are applied to spot-related gene lists and compared with special emphasis on the error characteristics of microarray expression data. The spot-clusters are analyzed using different methods of gene set enrichment analysis with the focus on overexpression and/or overrepresentation of predefined sets of genes. Metagene-related overrepresentation of selected gene sets was mapped into the SOM images to assign gene function to different regions. Alternatively we estimated set-related overexpression profiles over all samples studied using a gene set enrichment score. It was also applied to the spot-clusters to generate lists of enriched gene sets. We used the tissue body index data set, a collection of expression data of human tissues, as an illustrative example. We found that tissue related spots typically contain enriched populations of gene sets well corresponding to molecular processes in the respective tissues. In addition, we display special sets of housekeeping and of consistently weak and highly expressed genes using SOM data filtering. 

Conclusions:
The presented methods allow the comprehensive downstream analysis of SOM-transformed expression data in terms of cluster-related gene lists and enriched gene sets for functional interpretation. SOM clustering implies the ability to define either new gene sets using selected SOM spots or to verify and/or to amend existing ones
P-Selectivity, Immunity, and the Power of One Bit
We prove that P-sel, the class of all P-selective sets, is EXP-immune, but is
not EXP/1-immune. That is, we prove that some infinite P-selective set has no
infinite EXP-time subset, but we also prove that every infinite P-selective set
has some infinite subset in EXP/1. Informally put, the immunity of P-sel is so
fragile that it is pierced by a single bit of information.
The above claims follow from broader results that we obtain about the
immunity of the P-selective sets. In particular, we prove that for every
recursive function f, P-sel is DTIME(f)-immune. Yet we also prove that P-sel is
not \Pi_2^p/1-immune
Immunity and Simplicity for Exact Counting and Other Counting Classes
Ko [RAIRO 24, 1990] and Bruschi [TCS 102, 1992] showed that in some
relativized world, PSPACE (in fact, ParityP) contains a set that is immune to
the polynomial hierarchy (PH). In this paper, we study and settle the question
of (relativized) separations with immunity for PH and the counting classes PP,
C_{=}P, and ParityP in all possible pairwise combinations. Our main result is
that there is an oracle A relative to which C_{=}P contains a set that is
immune to BPP^{ParityP}. In particular, this C_{=}P^A set is immune to PH^{A}
and ParityP^{A}. Strengthening results of Tor\'{a}n [J.ACM 38, 1991] and Green
[IPL 37, 1991], we also show that, in suitable relativizations, NP contains a
C_{=}P-immune set, and ParityP contains a PP^{PH}-immune set. This implies the
existence of a C_{=}P^{B}-simple set for some oracle B, which extends results
of Balc\'{a}zar et al. [SIAM J.Comp. 14, 1985; RAIRO 22, 1988] and provides the
first example of a simple set in a class not known to be contained in PH. Our
proof technique requires a circuit lower bound for ``exact counting'' that is
derived from Razborov's [Mat. Zametki 41, 1987] lower bound for majority.Comment: 20 page
- …