University of Nebraska–Lincoln

About: University of Nebraska–Lincoln is a education organization based out in Lincoln, Nebraska, United States. It is known for research contribution in the topics: Population & Poison control. The organization has 28059 authors who have published 61544 publications receiving 2139104 citations. The organization is also known as: Nebraska & UNL.

Research on the Academic Status of Children with Emotional and Behavioral Disorders A Review of the Literature From 1961 to 2000

Abstract: This review conducted a comprehensive examination of the current state of the literature on the academic status of students with emotional and behavioral disorders (EBD). The authors examined the literature to assess (a) student characteristics, (b) placement settings, (c) academic subject areas, and (d) measures used to assess academic achievement. Second, when possible, the functioning level of students was examined.Third, trends in the research over the past 4 decades were assessed. Although several investigators have researched the academic status of these students, significant limitations exist in the research, including incomplete reporting of student information, inadequate research on specific academic skill sets, and limited numbers of studies assessing students served in general education settings. Implications of the findings are discussed.

Constructing Interaction Test Suites for Highly-Configurable Systems in the Presence of Constraints: A Greedy Approach

Abstract: Researchers have explored the application of combinatorial interaction testing (CIT) methods to construct samples to drive systematic testing of software system configurations. Applying CIT to highly-configurable software systems is complicated by the fact that, in many such systems, there are constraints between specific configuration parameters that render certain combinations invalid. Many CIT algorithms lack a mechanism to avoid these. In recent work, automated constraint solving methods have been combined with search-based CIT construction methods to address the constraint problem with promising results. However, these techniques can incur a non-trivial overhead. In this paper, we build upon our previous work to develop a family of greedy CIT sample generation algorithms that exploit calculations made by modern Boolean satisfiability (SAT) solvers to prune the search space of the CIT problem. We perform a comparative evaluation of the cost-effectiveness of these algorithms on four real-world highly-configurable software systems and on a population of synthetic examples that share the characteristics of those systems. In combination our techniques reduce the cost of CIT in the presence of constraints to 30 percent of the cost of widely-used unconstrained CIT methods without sacrificing the quality of the solutions.