No description available.

In the basic understanding of measurement, students are expected to be able to subdivide a given whole into a unit and then change the position of that unit along the entire length of the whole. These basic operations of subdivision and change of position are related to the more formal operations of partitioning and iterating. In the context of fractions, partitioning and iterating play a fundamental role in understanding fractions as measures, where students are expected to partition a whole into an iterable unit. In the context of angle measurement, students are expected to measure angles as a fractional amount of a full rotation or a circle, by partitioning the circle into a unit angle and then iterating that unit angle to find the measure of the given angle. Despite this link between measurement, fractions, and angles, research suggests that there is a disconnect between students' concepts of measurement and geometry concepts, including angle and angle measurement. Therefore, one area of study that might help us understand this disconnection would be to investigate the relationship between students' concepts of measurement and their concepts of angle measurement. This current study documents sixth, seventh, and eighth grade students' measurement schemes for fractions and their quantifications of angularity, and then investigates the relationship between them. This research is guided by the following question: What is the relationship between middle school students' measurement schemes for fractions and their quantifications of angularity? Results indicate that the majority of students involved in this study do not possess a measurement concept of fractions nor a measurement concept of angularity. However, these results demonstrate that there is a relationship between students' measurement schemes for fractions and their quantifications of angularity. It is concluded that students who construct more sophisticated fraction schemes tend to construct more sophisticated quantifications of angularity. / Doctor of Philosophy / Although the concepts of measurement, fractions, and angle measurement are related, research suggests that there is a disconnect between students' concepts of measurement and geometry concepts, including angle and angle measurement. Therefore, one area of study that might help us understand this disconnection would be to investigate the relationship between students' concepts of measurement and their concepts of angle measurement. This current study documents sixth, seventh, and eighth grade students' understandings of measurement, as indicated by their fraction schemes, and angle measurement, as indicated by how they quantify angularity or the openness of an angle. This study then investigates the relationship between them. This research is guided by the following question: What is the relationship between middle school students' measurement schemes for fractions and their quantifications of angularity? Results indicate that the majority of students involved in this study do not possess a measurement concept of fractions nor a measurement concept of angularity. However, these results demonstrate that there is a relationship between students' measurement schemes for fractions and their quantifications of angularity. It is concluded that students who construct more sophisticated fraction schemes tend to construct more sophisticated quantifications of angularity.

The unprecedented rise of IoT has revolutionized every business vertical enthralling people to embrace IoT applications in their day-to-day lives to accrue multifaceted benefits. It is absolutely fair to say that a day without connected IoT systems, such as smart devices, smart enterprises, smart homes or offices, etc., would hamper our conveniences, drastically. Many IoT applications for these connected systems are safety-critical, and any unauthorized access could have severe consequences to their consumers and society. In the overall IoT security spectrum, human-to-machine authentication for IoT applications is a critical and foremost challenge owing to highly prescriptive characteristics of conventional user authentication schemes, i.e., knowledge-based or token-based authentication schemes, currently used in them. Furthermore, studies have reported numerous users’ concerns, from both the security and usability perspectives, that users are facing in using available authentication schemes for IoT applications. Therefore, an impetus is required to upgrade user authentication schemes for new IoT age applications to address any unforeseen incidents or unintended consequences. This dissertation aims at designing next-generation user authentication schemes for IoT applications to secure connected systems, namely, smart devices, smart enterprises, smart homes, or offices. To accomplish my research objectives, I perform a thorough study of ways and types of user authentication mechanisms emphasizing their security and usability ramifications. Subsequently, based on the substantive findings of my studies, I design, prototype, and validate our proposed user authentication schemes. I exploit both physiological and behavioral biometrics to design novel schemes that provide implicit (frictionless), continuous (active) or risk-based (non-static) authentication for multi-user scenarios. Afterward, I present a comparative analysis of the proposed schemes in terms of accuracy against the available state-of-the-art user authentication solutions. Also, I conduct SUS surveys to evaluate the usability of user authentication schemes.

In 1998, it was proved by Ben-David and Litman that a concept space has a sample compression scheme of size $d$ if and only if every finite subspace has a sample compression scheme of size $d$. In the compactness theorem, measurability of the hypotheses of the created sample compression scheme is not guaranteed; at the same time measurability of the hypotheses is a necessary condition for learnability. In this thesis we discuss when a sample compression scheme, created from compression schemes on finite subspaces via the compactness theorem, have measurable hypotheses. We show that if $X$ is a standard Borel space with a $d$-maximum and universally separable concept class $\m{C}$, then $(X,\CC)$ has a sample compression scheme of size $d$ with universally Borel measurable hypotheses. Additionally we introduce a new variant of compression scheme called a copy sample compression scheme.

In 1998, it was proved by Ben-David and Litman that a concept space has a sample compression scheme of size $d$ if and only if every finite subspace has a sample compression scheme of size $d$. In the compactness theorem, measurability of the hypotheses of the created sample compression scheme is not guaranteed; at the same time measurability of the hypotheses is a necessary condition for learnability. In this thesis we discuss when a sample compression scheme, created from compression schemes on finite subspaces via the compactness theorem, have measurable hypotheses. We show that if $X$ is a standard Borel space with a $d$-maximum and universally separable concept class $\m{C}$, then $(X,\CC)$ has a sample compression scheme of size $d$ with universally Borel measurable hypotheses. Additionally we introduce a new variant of compression scheme called a copy sample compression scheme.

In 1998, it was proved by Ben-David and Litman that a concept space has a sample compression scheme of size $d$ if and only if every finite subspace has a sample compression scheme of size $d$. In the compactness theorem, measurability of the hypotheses of the created sample compression scheme is not guaranteed; at the same time measurability of the hypotheses is a necessary condition for learnability. In this thesis we discuss when a sample compression scheme, created from compression schemes on finite subspaces via the compactness theorem, have measurable hypotheses. We show that if $X$ is a standard Borel space with a $d$-maximum and universally separable concept class $\m{C}$, then $(X,\CC)$ has a sample compression scheme of size $d$ with universally Borel measurable hypotheses. Additionally we introduce a new variant of compression scheme called a copy sample compression scheme.

Heifers should represent the greatest genetic potential within a dairy herd. To maximize this potential, heifers must be inseminated to proven sires, a practice requiring management changes on many dairies. Holstein heifers (n=115) were allotted to one of three groups to compare alternatives to daily estrous detection that may facilitate the management of a program of artificial insemination for heifers. Group 1 heifers (Controls) received no treatment but were observed twice daily for signs of estrus. Group 2 heifers (2X-PGF) were synchronized with two injections of prostaglandin F2 alpha given 11 days apart and observed for estrus. Group 3 heifers (MGA+PGF) were synchronized with 9 days of melengestrol acetate feeding and an injection of prostaglandin F2 alpha 14 days after the last feeding and observed for estrus. Comparisons were made on the effectiveness of each treatment in estrous response and pregnancy rates and on the management requirements and economics associated with each program. Estrous response was significantly higher for the 2X-PGF group, while synchronized pregnancy and first-service conception rates did not differ. On an annual basis, the MGA+PGF group was calculated to require three-quarters of the labor input as compared to the 2X-PGF group and less than a fifth of the labor required for the Control group. A program of daily estrous detection was calculated to have an economic advantage over synchronization the frequency estrous synchronization programs was scheduled four times per year. was increased to six times per when When year, synchronization had a slight economic advantage over daily estrous detection when animal numbers were low and labor costs were high. The economic advantage of daily estrous detection is reduced when synchronization is performed more frequently throughout the year.

O crescimento acelerado de negócios voltado para Internet aumenta significativamente a necessidade por mecanismos que possam garantir a confidencialidade dos dados, fornecendo ferramentas para autenticidade e irretratabilidade dos usuários em qualquer meio de comunicação, mesmo em equipamentos que possuem recursos computacionais limitados, como um telefone celular, por exemplo. Este trabalho apresenta um esquema de criptografia que utiliza os dados pessoais para geração de chave e cifração, chamado Criptografia Baseada na Identidade, sem necessidade de um certificado digital. São apresentados diversos modelos de cifração, assinatura, acordo de chaves, bem como principais características, diferenças operacionais e respectivos aspectos relevantes de segurança. Algumas aplicabilidades como busca de dados cifrados, por exemplo, são implementadas, para melhor entendimento das operações e fases envolvidas. Os comparativos de custos computacionais das operações envolvidas destacam o esquema de assinatura de Barreto et al. (2005) e esquema de acordo de chave Mc- Cullagh e Barreto (2004b). São descritos também os pré-requisitos de um ambiente criptográfico baseado na identidade, o qual permite realizar as operações de cifração, assinatura e acordo de chaves com menor custo computacional possível. / The accelerated growth of Internet-based business increase significantly the need for mechanisms that can guarantee the data confidentiality, providing tools for authenticity and non-repudiation users in any medium of communication, even with computer resources becoming increasingly scarce, eg into a cell phone. This paper describes an encryption scheme that uses personal data for key generation and encryption, called the Identity Based Encryption, without need for a digital certificate. Various encryption schemes, signature, key agreement are shown, and its main characteristics, operational differences and their respective relevant aspects of security. Some aplicabilities such as encrypted data search, for example, are implemented, for better understanding of the operations and stages involved. The comparative computataional costs of operations highlight the Barreto et al. (2005) signature scheme and McCullagh e Barreto (2004b) key agreement scheme. They are also described, the prerequisites of an Identity-based cryptography environment, which allows to perform the operations of encryption, signing and key agreement with lower computational cost possible.

O crescimento acelerado de negócios voltado para Internet aumenta significativamente a necessidade por mecanismos que possam garantir a confidencialidade dos dados, fornecendo ferramentas para autenticidade e irretratabilidade dos usuários em qualquer meio de comunicação, mesmo em equipamentos que possuem recursos computacionais limitados, como um telefone celular, por exemplo. Este trabalho apresenta um esquema de criptografia que utiliza os dados pessoais para geração de chave e cifração, chamado Criptografia Baseada na Identidade, sem necessidade de um certificado digital. São apresentados diversos modelos de cifração, assinatura, acordo de chaves, bem como principais características, diferenças operacionais e respectivos aspectos relevantes de segurança. Algumas aplicabilidades como busca de dados cifrados, por exemplo, são implementadas, para melhor entendimento das operações e fases envolvidas. Os comparativos de custos computacionais das operações envolvidas destacam o esquema de assinatura de Barreto et al. (2005) e esquema de acordo de chave Mc- Cullagh e Barreto (2004b). São descritos também os pré-requisitos de um ambiente criptográfico baseado na identidade, o qual permite realizar as operações de cifração, assinatura e acordo de chaves com menor custo computacional possível. / The accelerated growth of Internet-based business increase significantly the need for mechanisms that can guarantee the data confidentiality, providing tools for authenticity and non-repudiation users in any medium of communication, even with computer resources becoming increasingly scarce, eg into a cell phone. This paper describes an encryption scheme that uses personal data for key generation and encryption, called the Identity Based Encryption, without need for a digital certificate. Various encryption schemes, signature, key agreement are shown, and its main characteristics, operational differences and their respective relevant aspects of security. Some aplicabilities such as encrypted data search, for example, are implemented, for better understanding of the operations and stages involved. The comparative computataional costs of operations highlight the Barreto et al. (2005) signature scheme and McCullagh e Barreto (2004b) key agreement scheme. They are also described, the prerequisites of an Identity-based cryptography environment, which allows to perform the operations of encryption, signing and key agreement with lower computational cost possible.

Many partial differential equations (PDEs) admit conserved quantities like mass or energy. Those quantities are often essential to establish well-posed results. When approximating a PDE by a finite-difference scheme, it is natural to ask whether related discretized quantities remain conserved under the scheme. Such conservation may establish the stability of the numerical scheme. We present an algorithm for checking the preservation of a polynomial quantity under a polynomial finite-difference scheme. In our algorithm, schemes can be explicit or implicit, have higher-order time and space derivatives, and an arbitrary number of variables. Additionally, we present an algorithm for, given a scheme, finding conserved quantities. We illustrate our algorithm by studying several finite-difference schemes.