Prior research of rough-and-tumble play (RTP) has shown mixed results—different operational definitions, varying functions, and positive and negative outcomes. Few researchers have studied interventions to address RTP in school settings. With unclear evidence of RTP outcomes and the extent school interventions are addressing RTP in school settings, this study explored the extent and effectiveness of intervention programs being implemented to prevent/reduce negative outcomes of RTP in elementary schools. A survey was created and conducted with 30 school problem-solving teams in a western state to obtain information concerning RTP in elementary school settings. Teams provided estimated percentages of RTP leading to beneficial and problematic behaviors, types of benefits or problems resulting from RTP, specific prevention/intervention programs that teams report implementing to address RTP concerns, percentage estimations of students responding to implemented interventions, and training needs to address interventions for RTP concerns. Survey responses showed different medians for estimated percentages for problematic outcomes (80%) versus beneficial outcomes (10%). Further, the number of problem items (M = 9.57, SD = 1.87) was more highly endorsed by teams than the number of items listing benefits (M = 4.43, SD = 3. 39), suggesting RTP was more often problematic than beneficial. Interventions estimated to be effective in treating negative RTP outcomes with 80% or greater response rates are reward systems, social skills trainings, active supervision, and bully prevention. These study findings are different from previous research, which concluded that RTP was harmless and/or beneficial to students, and might be due to environmental differences (school vs. community). It might be estimated that schools should monitor or prevent RTP to avoid problems, such as aggression, bullying, and poor peer relationships. Programs frequently used by teams targeted skill acquisition through social skills training, anger management, and bully prevention. This study provides understanding to the extent RTP should be addressed in schools. School problem-solving teams report that RTP can be problematic in school settings; however, it can be prevented with school-wide intervention and intervened with individual and small-group interventions.

This is a collection of poems.

No description available.

Rough sets have been studied for over 30 years, and the basic concepts of lower and upper approximations have been analysed in detail, yet nowhere has the idea of an `optimal' rough approximation been proposed or investigated. In this thesis, several concepts are used in proposing a generalized definition: measures, rough sets, similarity, and approximation are each surveyed. Measure Theory allows us to generalize the definition of the `size' for a set. Rough set theory is the foundation that we use to define the term `optimal' and what constitutes an `optimal rough set'. Similarity indexes are used to compare two sets, and determine how alike or different they are. These sets can be rough or exact. We use similarity indexes to compare sets to intermediate approximations, and isolate the optimal rough sets. The historical roots of these concepts are explored, and the foundations are formally defined. A definition of an optimal rough set is proposed, as well as a simple algorithm to find it. Properties of optimal approximations such as minimum, maximum, and symmetry, are explored, and examples are provided to demonstrate algebraic properties and illustrate the mechanics of the algorithm. / Thesis / Doctor of Philosophy (PhD) / Until now, in the context of rough sets, only an upper and lower approximation had been proposed. Here, an concept of an optimal/best approximation is proposed, and a method to obtain it is presented.

Domestic secondary wood products manufacturers are losing their competitive edge in the global economy. Foreign competition is steadily gaining market-share due to decreased labor costs. While domestic operations can not compete with labor costs available to foreign manufacturers, they may be able to remain competitive through product lead time reduction and on-time delivery to the final customer. Pull based manufacturing is one technique to reduce lead time increase on-time delivery. Value stream mapping was used in this project to evaluate a furniture rough mill located in Virginia to assess the current state, as well as develop 2 future state value streams. The current state evaluation found the system to be yield driven and production was based on a forecast. The lead time for internal nightstand components in the current state was found to be 15.1 hours. Using pull production and supermarket methodology in proposed future states, it was found that the lead time could be reduced to 7.5 hours. Lead times could be reduced by eliminating yield increasing non-value added activities currently in place which not only increase lead time, but also manufacturing waste as defined by lean manufacturing concepts. A cost analysis found that the labor and overhead costs associated with yield increasing activities in the current state outweighed the costs of a decreased yield measurement in the future state. While this project was limited to one rough mill and one product family of a lesser valued wood species it represents what is possible for assisting secondary manufacturers to remain competitive. The once successful traditional yield driven rough mill does not guarantee internal customer satisfaction and in this project is not cost effective. Future research should focus on the implications of the furniture rough mill's inability to meet downstream demand to internal customers. / Master of Science

No description available.

OLIVEIRA, Henrique Viana. Refinamento de consultas em lógicas de descrição utilizando teoria dos Rough sets. 2012. 111 f. Dissertação (Mestrado em ciência da computação)- Universidade Federal do Ceará, Fortaleza-CE, 2012. / Submitted by Elineudson Ribeiro (elineudsonr@gmail.com) on 2016-07-11T16:33:31Z No. of bitstreams: 1 2012_dis_hvoliveira.pdf: 789598 bytes, checksum: d75ef093adc56cc930f52c1e486ead5a (MD5) / Approved for entry into archive by Rocilda Sales (rocilda@ufc.br) on 2016-07-18T13:43:45Z (GMT) No. of bitstreams: 1 2012_dis_hvoliveira.pdf: 789598 bytes, checksum: d75ef093adc56cc930f52c1e486ead5a (MD5) / Made available in DSpace on 2016-07-18T13:43:45Z (GMT). No. of bitstreams: 1 2012_dis_hvoliveira.pdf: 789598 bytes, checksum: d75ef093adc56cc930f52c1e486ead5a (MD5) Previous issue date: 2012 / Query Refinement consists of methods that modify the terms of a consult aiming the change of its result obtained previously. Refinements can be done of several ways and different approaches can be applied to it. This work proposes to apply methods of Query Refinement based on Rough Set theory, using it as an alternative for the refinement problem. The proposed methods will be grounded in the languages of Description Logics, which are commonly used on problems involving knowledge bases or ontologies representation. Two extensions of Description Logics with the Rough Set theory are introduced in this dissertation. We will prove the complexity of satisfiability of these logics, as well as the complexities of the query refinement methods applied to these logics. Finally, we will show quality measures which will aid to choose the results of the refinements obtained. / Refinamento de consulta consiste de técnicas que modificam os termos de uma consulta com o objetivo de alterar os resultados obtidos inicialmente. Para a realização de tal fim, diversas abordagens podem ser aplicadas e diferentes tipos de refinamentos podem ser considerados. Este trabalho propõe aplicar a teoria dos Rough Sets como uma nova alternativa de solução para o problema. Através das noções presentes nessa teoria, iremos desenvolver técnicas que serão aplicadas nas linguagens de Lógicas de Descrição, que são comumente utilizadas em problemas de representação de bases de conhecimento ou ontologias. Além disso, introduziremos duas extensões de Lógicas de Descrição capazes de representar as operações da teoria dos Rough Sets. Provaremos os resultados de complexidade de decisão dessas duas lógicas, assim como os resultados de complexidade das técnicas de refinamentos desenvolvidas. Por fim, mostraremos métricas de qualidade que poderão ser usadas para melhorar o resultado dos refinamentos obtidos.

CoordenaÃÃo de AperfeiÃoamento de Pessoal de NÃvel Superior / Refinamento de consulta consiste de tÃcnicas que modificam os termos de uma consulta com o objetivo de alterar os resultados obtidos inicialmente. Para a realizaÃÃo de tal fim, diversas abordagens podem ser aplicadas e diferentes tipos de refinamentos podem ser considerados. Este trabalho propÃe aplicar a teoria dos Rough Sets como uma nova alternativa de soluÃÃo para o problema. AtravÃs das noÃÃes presentes nessa teoria, iremos desenvolver tÃcnicas que serÃo aplicadas nas linguagens de LÃgicas de DescriÃÃo, que sÃo comumente utilizadas em problemas de representaÃÃo de bases de conhecimento ou ontologias. AlÃm disso, introduziremos duas extensÃes de LÃgicas de DescriÃÃo capazes de representar as operaÃÃes da teoria dos Rough Sets. Provaremos os resultados de complexidade de decisÃo dessas duas lÃgicas, assim como os resultados de complexidade das tÃcnicas de refinamentos desenvolvidas. Por fim, mostraremos mÃtricas de qualidade que poderÃo ser usadas para melhorar o resultado dos refinamentos obtidos. / Query Refinement consists of methods that modify the terms of a consult aiming the change of its result obtained previously. Refinements can be done of several ways and different approaches can be applied to it. This work proposes to apply methods of Query Refinement based on Rough Set theory, using it as an alternative for the refinement problem. The proposed methods will be grounded in the languages of Description Logics, which are commonly used on problems involving knowledge bases or ontologies representation. Two extensions of Description Logics with the Rough Set theory are introduced in this dissertation. We will prove the complexity of satisfiability of these logics, as well as the complexities of the query refinement methods applied to these logics. Finally, we will show quality measures which will aid to choose the results of the refinements obtained.

Orientador: Pedro José Catuogno / Tese (doutorado) - Universidade Estadual de Campinas, Instituto de Matemática Estatística e Computação Científica / Made available in DSpace on 2018-08-26T02:18:47Z (GMT). No. of bitstreams: 1 Castrequini_RafaelAndretto_D.pdf: 917541 bytes, checksum: c03f74c254be62fceaa032d8a3fd40ec (MD5) Previous issue date: 2014 / Resumo: Provaremos uma fórmula do tipo Itô-Ventzel para caminhos Hölder cujo expoente é maior que 1/3. Os exemplos fundamentais de caminhos onde a fórmula é válida é o movimento Browniano fracionário. Nossa fórmula estende (e coincide) a versão clássica feita por H. Kunita na década de 80. As ferramentas utilizadas residem no contexto dos rough paths seguindo a abordagem de M. Gubinelli. Tais tecnicas começaram a serem desenvolvidas por T. Lyons no final de 90. Como aplicação, estudaremos equações diferenciais dirigidas por caminhos cujo expoente é maior que 1/2 (Sistemas de Young). Onde a idéia aqui é empregar nossa fórmula aplicando o método das caracteristicas nesse contexto, seguindo novamente os trabalhos de H. Kunita / Abstract: We prove an Itô-Ventezel type formula for Hölder paths with exponent is greater than 1/3. The most important class of examples of theses paths is given by fractional Brownian motion. Our formula is an extension (and agree) to classic version done by H. Kunita in 80's. The technical tools used rely on rough path theory following M. Gubinelli's approach. Those techniques were developed in the late 90's. by T. Lyons. As an application, we study differential equations driven by paths with exponent greater than 1/2 (Young Systems). The ideia here is to employ our formula together with method of characteristics in this setting, following Kunita's work / Doutorado / Matematica / Doutor em Matemática

No description available.