Girls back off mathematics again : the views and experiences of girls in computer based mathematics

The views and experiences of girls in two co-educational mathematics classrooms in which computers were regularly used were researched. Data were collected by observation and videotaping of lessons, questionnaire, and interviews of students and the teachers. In this paper case studies of six girls are presented. Their ‘stories’ reveal a diversity of experiences and views and multiple gender identities. High achieving girls persisted as “outsiders within,” other girls “backed off”, and exceptional girls challenged gender stereotypes. Implications for social justice in mathematics in the age of the super highway are discussed.

Student views of computer based-mathematics in the middle years : does gender make a difference?

How the use of computers in mathematics classrooms was viewed by students in two middle years mathematics classrooms was the focus of the research described in this paper. The primary data sources consisted of questionnaires, classroom observations supported by videotaping of mathematics lessons, and interviews with two girls and two boys from each class. Thus both qualitative and quantitative methods were used. Girls viewed the computer-based lessons less favourably than did boys. In general, the boys were likely to believe that computers contributed to their experiencing pleasure in these lessons, and to making mathematics more relevant to them. Girls were typically more concerned about whether computers facilitated learning and enabled success in mathematics. The attitudes of students to computer-based mathematics were related to their views of computers.

Projects in the hardware research group of the department of computer science of the University of Illinois,

Illustrations, p. 30-52, numbered as leaves.

Record of achievements and plans of the Information Engineering Laboratory in the Department of Computer Science of the University of Illinois at Urbana-Champaign, 1955-1973

Mode of access: Internet.

Bibliography of technical reports in the fields of computer science and computer engineering issued at the University of Waterloo from 1967 to 1987 /

Includes indexes.

Optimal embedding for watermarking in discrete data spaces

In this paper, we address the problem of robust information embedding in digital data. Such a process is carried out by introducing modifications to the original data that one would like to keep minimal. It assumes that the data, which includes the embedded information, is corrupted before the extraction is carried out. We propose a principled way to tailor an efficient embedding process for given data and noise statistics. © Springer-Verlag Berlin Heidelberg 2005.

Computer Mathematics for Motivated Students

Report published in the Proceedings of the National Conference on "Education in the Information Society", Plovdiv, May, 2013

Development of a computer simulation tool for application in adolescent spinal deformity surgery

Scoliosis is a three-dimensional spinal deformity which requires surgical correction in progressive cases. In order to optimize correction and avoid complications following scoliosis surgery, patient-specific finite element models (FEM) are being developed and validated by our group. In this paper, the modeling methodology is described and two clinically relevant load cases are simulated for a single patient. Firstly, a pre-operative patient flexibility assessment, the fulcrum bending radiograph, is simulated to assess the model's ability to represent spine flexibility. Secondly, intra-operative forces during single rod anterior correction are simulated. Clinically, the patient had an initial Cobb angle of 44 degrees, which reduced to 26 degrees during fulcrum bending. Surgically, the coronal deformity corrected to 14 degrees. The simulated initial Cobb angle was 40 degrees, which reduced to 23 degrees following the fulcrum bending load case. The simulated surgical procedure corrected the coronal deformity to 14 degrees. The computed results for the patient-specific FEM are within the accepted clinical Cobb measuring error of 5 degrees, suggested that this modeling methodology is capable of capturing the biomechanical behaviour of a scoliotic human spine during anterior corrective surgery.

Using Ownership to Reason About Inherent Parallelism in Object-Oriented Programs

With the emergence of multi-cores into the mainstream, there is a growing need for systems to allow programmers and automated systems to reason about data dependencies and inherent parallelismin imperative object-oriented languages. In this paper we exploit the structure of object-oriented programs to abstract computational side-effects. We capture and validate these effects using a static type system. We use these as the basis of sufficient conditions for several different data and task parallelism patterns. We compliment our static type system with a lightweight runtime system to allow for parallelization in the presence of complex data flows. We have a functioning compiler and worked examples to demonstrate the practicality of our solution.

Improved algebraic cryptanalysis of QUAD, Bivium and Trivium via graph partitioning on equation systems

We present a novel approach for preprocessing systems of polynomial equations via graph partitioning. The variable-sharing graph of a system of polynomial equations is defined. If such graph is disconnected, then the corresponding system of equations can be split into smaller ones that can be solved individually. This can provide a tremendous speed-up in computing the solution to the system, but is unlikely to occur either randomly or in applications. However, by deleting certain vertices on the graph, the variable-sharing graph could be disconnected in a balanced fashion, and in turn the system of polynomial equations would be separated into smaller systems of near-equal sizes. In graph theory terms, this process is equivalent to finding balanced vertex partitions with minimum-weight vertex separators. The techniques of finding these vertex partitions are discussed, and experiments are performed to evaluate its practicality for general graphs and systems of polynomial equations. Applications of this approach in algebraic cryptanalysis on symmetric ciphers are presented: For the QUAD family of stream ciphers, we show how a malicious party can manufacture conforming systems that can be easily broken. For the stream ciphers Bivium and Trivium, we nachieve significant speedups in algebraic attacks against them, mainly in a partial key guess scenario. In each of these cases, the systems of polynomial equations involved are well-suited to our graph partitioning method. These results may open a new avenue for evaluating the security of symmetric ciphers against algebraic attacks.