Research study on sixth grade problem-posing instruction: Case of addition, subtraction and number comparison on decimals Abstract The aim of this research project is to investigate the implementation of problem-posing instruction on decimals to one sixth-grade mathematics class. There are four research objectives: 1) design and implement problem-posing instruction on decimals; 2) discuss the status of children¡¦s performance in problem-solving; 3) analyze the type of problems posed by children; and, 4) display categories of misconceptions exhibited when children did problem posing. The stages for instructions were three: 1) children solved the problem given by the instructor; 2) children referred to given problem and posed a problem; and, 3) children solved their own problem. In this study, the type of problem posing chosen for instruction is ¡§similar problem¡¨, which is adapted from Tsubota, a Japan scholar. The researcher collected data by using: own constructed decimal problems question sheet, worksheet on problem solving, worksheet on problem posing, children¡¦s diaries and teachers¡¦ notes on instruction. There are four findings. First, the implementation of sixth grade problem-posing instruction on decimals is feasible. Second, 96.9% of students¡¦ problems are plausible and contain sufficient information for problem solvers. Most students could change the number and content of the question but few revised the structure of the question. There was also multiple development for those problems. Third, children¡¦s performance in posing/solving stage was better than that in problem-solving stage. Finally, the researcher reported that the teacher faced problems such as difficulty in control of time, establishing children¡¦s habit in reporting, and collecting misconceptions of children. Key word : problem solving; problem posing; addition, subtraction and number comparison on decimals

Predictive multiple suppression methods consist of two main steps: a prediction step, in which multiples are predicted from the seismic data, and a subtraction step, in which the predicted multiples are matched with the true multiples in the data. The last step appears crucial in practice: an incorrect adaptive subtraction method will cause multiples to be sub-optimally subtracted or primaries being distorted, or both. Therefore, we propose a new domain for separation of primaries and multiples via the Curvelet transform. This transform maps the data into almost orthogonal localized events with a directional and spatial-temporal component. The multiples are suppressed by thresholding the input data at those Curvelet components where the predicted multiples have large amplitudes. In this way the more traditional filtering of predicted multiples to fit the input data is avoided. An initial field data example shows a considerable improvement in multiple suppression.

Thesis (Ph. D.)--University of Wisconsin--Madison, 1968. / Typescript. Vita. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references.

We propose a framework for detecting and tracking multiple interacting objects from a single, static, uncalibrated camera. The number of objects is variable and unknown, and object-class-specific models are not available. We use background subtraction results as measurements for object detection and tracking. Given these constraints, the main challenge is to associate pixel measurements with (possibly interacting) object targets. We first track clusters of pixels, and note when they merge or split. We then build an inference graph, representing relations between the tracked clusters. Using this graph and a generic object model based on spatial connectedness and coherent motion, we label the tracked clusters as whole objects, fragments of objects or groups of interacting objects. The outputs of our algorithm are entire tracks of objects, which may include corresponding tracks from groups of objects during interactions. Experimental results on multiple video sequences are shown.

As complicações peri-implantares, posteriormente a colocação do implante em função, são frequentes e sua identificação precoce pode significar uma terapêutica adequada e consequentemente garantir o sucesso do terapêutica. A proposta neste trabalho foi avaliar longitudinalmente a densidade ótica do osso alveolar peri-implantar na região cervical, analisada, por meio da técnica de subtração radiográfica de um acervo de radiografias digitais adquiridas de pacientes previamente reabilitados com trinta e sete implantes osteointegrados imediatos na região anterior da maxila. Os controles radiográficos foram realizados em cinco momentos: na instalação das próteses, após 15,90,180 e 360 dias, e as radiografias intrabucais foram obtidas pela técnica do paralelismo de cilindro longo, com posicionadores do tipo Hanshin individualizados de forma a garantir a padronização das imagens. As imagens digitais obtidas foram alinhadas e equalizadas e por fim submetidas ao procedimento de subtração radiográfica. Os resultados indicaram que a metodologia de subtração radiográfica é válida para a avaliação da perda óssea peri-implantar, assim como demonstra a literatura. No entanto, a reprodução das angulações verticais e horizontais, apresentam-se como críticas na avaliação da densidade óptica da crista óssea e demandam grande habilidade do operador para a correta aplicação. Por meio dessa técnica, conseguimos avaliar de forma quantitativa e qualitativa as alterações na faces proximais nas imagens radiográficas do acervo analisado. A subtração radiográfica, por meio da ferramenta de histograma, permitiu quantificar de forma objetiva as diferenças encontradas nas análises. / The peri-implant complications, in addition to implant placement in function, are frequent and their early identification could mean a therapy appropriately and consequently guarantee the success of the treatment. The aim of this research was to longitudinally evaluate of the optical density of the peri-implant alveolar bone at the cervical region, analyzed by means of the radiographic subtraction technique, a collection of digital radiographs acquired from patients previously rehabilitated with thirty seven osseointegrated implants. The radiographic controls performed in five moments, at the installation of the prostheses, after 15,90,180 and 360 days, and the intraoral radiographs were obtained by parallelism technique, with Hanshin-type positioners individualized in order to guarantee the standardization of the images. The obtained digital images were aligned and equalized and finally submitted to radiographic subtraction procedure. The results indicated that the methodology of radiographic subtraction is valid for an evaluation of the peri-implant bone loss, as well as to demonstrated at the literature. However, the reproduction of the vertical and horizontal angles, are presented as critical in the evaluation of the optical density, and demand a great ability of the operator for a correct application. Through the technique we obtained a quantitative and qualitative evaluation in the area of proximal images in the radiographic images of the analyzed data. The histogram tool applied on the radiographic subtraction images allowed to quantify objectively as the differences found in the analyzes.

The objective of this project is to use digital imaging devices to monitor a delineated area of the public space and to register statistics about people moving across this area. A feasible detecting approach, which is based on background subtraction, has been developed and has been tested on 39 images. Individual pedestrians in images can be detected and counted. The approach is suitably used to detect and count pedestrians without overlapping. Accuracy rate of detection is higher than 80%.

With the development of big data computing, the speech recognition has been popular for serving human’s life. However, when place the speech recognition system into noisy environments, the background noises greatly degrades the speech recognition system accuracy as it adds in unuseful information into the desired speech. Thus for a speech recognition system, obtaining a good performance under noises has become a vital issue. To tackle the noise effect problem of automatic speech recognition (ASR), a method to reduce the noise effect is essential. Recently, multiple of methods have been developed to enhance the speech signal, they usually follow the principle of suppressing the noise in a noisy speech signal. This thesis simulated the popular techniques for speech recogniton and speech enhancement, which are the multilayer perceptron and the spectral subtraction. The aim of this work is to use MATLAB to build an automatic speech recognition system that can be used in noisy environment. MATLAB simulations are used to verify the success of recognition with clean speech and show the system performance improvements after applying speech enhancement method in seven kinds of noisy environments. The result is presented by using comparative histograms between noisy signals and corresponding denoised signals. It shows that, using denoised signal will obtain a higher recognition rate, thus we can say the system performance is improved in noisy environments.

No description available.

This thesis explores possible improvements, using parallel computing, to the PSF-alignment and image subtraction algorithm found in HOTPANTS. In time-domain astronomy the PSF-alignment and image subtraction algorithm OIS is used to identify transient events. hotpants is a software package based on OIS, the software package ISIS, and other subsequent research done to improve OIS. A parallel GPU implementation of the algorithm from HOTPANTS – henceforth known as BACH –was created for this thesis. The goal of this thesis is to answer the questions: “what parts of HOTPANTS are most suited for parallelisation?” and “how does bach perform compared to HOTPANTS and SFFT?”, another PSF-alignment and image subtraction tool. The authors found that the parts most susceptible to parallelisation were the convolution and subtraction steps. However, the subtraction did not display a significant improvement to its sequential counterpart. The other parts of HOTPANTS were deemed too complex to implement in parallel on the GPU. However, some parts could probably either be partly parallelised on the GPU or parallelised usingthe CPU. BACH was always as fast as or faster than HOTPANTS; it was generally 2 times faster, but was up to 4.5 times faster in some test cases. It was also faster than SFFT, but this result was not equivalent to the result presented in [15], which is why the authors of this thesis believe something was wrong with either the installation of SFFT or the hardware used to test it.

No description available.