Dissertations / Theses: 'Electronic spreadsheets – Computer programs'

1

Hall, Maria Jean. "The A.D.E. taxonomy of spreadsheet application development." Thesis, Edith Cowan University, Research Online, Perth, Western Australia, 1992. https://ro.ecu.edu.au/theses/1696.

Full text

Abstract:

Spreadsheets are a major application in end-user computing, one of the fastest growing areas of computing. Studies have shown that 30% of spreadsheet applications contain errors. As major decisions are often made with the assistance of spreadsheets, the control of spreadsheet applications is a matter of concern to enduser developers, managers, EDP auditors and computer professionals. The application of appropriate controls to the spreadsheet development process requires prior categorisation of the spreadsheet application. The special-purpose A.D.E. (Application, Development, Environment) taxonomy of spreadsheet application development was evolved by mathematical taxonomic methods to categorise spreadsheet development projects to facilitate their management and control.

APA, Harvard, Vancouver, ISO, and other styles

2

Kenyon, Mitchell Alan William. "The value of spreadsheet programs to planners." Thesis, University of British Columbia, 1988. http://hdl.handle.net/2429/28088.

Full text

Abstract:

According to Brail, a planning professor at Rutgers University, it is abundantly clear that the electronic spreadsheet is the single most important computer tool available to the practicing planner, (working paper, 1985,1) What is the value, measured in increased productivity, of spreadsheet programs to planners? Spreadsheet programs, referred to simply as spreadsheets, are an enhanced version of the paper spreadsheet. Paper spreadsheets are tabular forms commonly used by bookkeepers and accountants. Spreadsheets perform computations that would be tedious and perhaps impossible on a paper spreadsheet. A number of factors influence the value of spreadsheets to planners. This thesis discuses three factors in detail: the capabilities of spreadsheets, the utility of the planning models whose computations sometimes involve spreadsheets, and the savings in development time by employing spreadsheet templates. Assessing the capabilities of spreadsheets requires clarifying the concept of spreadsheets and describing their general applications. Clarifying the concept includes defining spreadsheet terms such as worksheet, functions, macros, and templates', depicting the evolution of spreadsheets; highlighting differences between spreadsheet packages; and noting the limitations of spreadsheets. Describing the general applications involves discussing the three major uses of spreadsheets: table production, numerical analysis, and the testing of "what if scenarios. Evaluating the utility of the planning models whose computations sometimes involve spreadsheets requires two steps. The first step establishes the relationship between models and spreadsheets in data analysis for planning. The second step examines the advantages and disadvantages of the planning models. Determining the savings in development time by employing templates involves three steps. The first step constructs criteria by which to evaluate the structure of a template for accuracy and ease of use. The second step examines how well available templates fit the planning model discussed. The third step evaluates the structure of each of the templates using the criteria constructed. Five chapters compose the body of the thesis. The first chapter explains the concept of the spreadsheet. The second chapter illustrates the general applications of spreadsheets, determines the role of spreadsheets in data analysis for planning, and develops criteria by which to evaluate a template's structure. Each of the last three chapters demonstrates the potential of spreadsheets to planners by describing and evaluating planning models and spreadsheet templates. There are many factors influencing the value of spreadsheets to planners not covered in this thesis which may prove grounds for further research. The thesis ignores the affect the planner's access to computers and programs, knowledge of computers, and attitude towards computers has on the value of spreadsheets. Furthermore, the thesis does not establish the relative worth of spreadsheets in comparison to other possible tools for performing the computation of a planning model. Therefore, this thesis is unable to confirm Brail's claim that spreadsheets are the most important computer tool. Nevertheless, this thesis provides reasons for Brail's enthusiasm towards spreadsheets.
Applied Science, Faculty of
Community and Regional Planning (SCARP), School of
Graduate

APA, Harvard, Vancouver, ISO, and other styles

3

Whitmer, Brian C. "Improving Spreadsheets for Complex Problems." Diss., CLICK HERE for online access, 2008. http://contentdm.lib.byu.edu/ETD/image/etd2361.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Mobarak, Barbara Ann. "The development of a computer literacy curriculum for California charter schools." CSUSB ScholarWorks, 2004. https://scholarworks.lib.csusb.edu/etd-project/2683.

Full text

Abstract:

To develop leaders for the 21st century, schools must be able to prepare students to meet the high academic, technical and workforce challenges. Charter schools are increasingly attempting to meet these challenges by educating students through innovative means and by creating effectual educational programs that are more conducive to the needs of the student. This document provides a computer literacy curriculum, which will facilitate student learning of computer literacy skills.

APA, Harvard, Vancouver, ISO, and other styles

5

Davidson, Conda. "Comparative analysis of teaching methods and learning styles in a high school computer spreadsheet unit /." free to MU campus, to others for purchase, 2000. http://wwwlib.umi.com/cr/mo/fullcit?p9974620.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Dandolu, Rajesekhar R. "Excel Sheet Based Semantic Email." TopSCHOLAR®, 2004. http://digitalcommons.wku.edu/theses/1101.

Full text

Abstract:

EXCEL SHEET BASED SEMANTIC EMAIL Rajesekhar R, Dandolu December 10, 2004. 47 Pages Directed by: Dr. Guangming Xing Department of Computer Science Western Kentucky University The Semantic Web is an extension of the current web in which information is given well-defined meaning, better enabling computers and people to work in cooperation. The Semantic Web envisions a portion of the World-Wide Web in which the underlying data is machine understandable and can thus be exploited for improved querying, aggregation, and interaction. Excel Sheet Based Semantic Email is a type of Semantic Web application, which deals with the understanding of emails received and performing corresponding actions according to the schema specified in the email. The user can compose an email structure and specify all the semantic actions and necessary information related to a particular schema. The emails received are processed according to the schema format to which they belong and corresponding semantic actions are taken. In this project, Semantic Email is implemented by encoding the information in Excel Sheets. It could be reengineered to support heterogeneous semantic actions based on the particular application. The project can be enhanced providing a web interface, apart from the email system that is currently used as the way of communication. The clients can directly use the web page,

APA, Harvard, Vancouver, ISO, and other styles

7

McManigal, Gerald F. "An electronic bulletin board for UNIX based systems." Thesis, Kansas State University, 1986. http://hdl.handle.net/2097/9935.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Marlow, Simon David. "Deforestation for higher-order functional programs." Thesis, University of Glasgow, 1995. http://theses.gla.ac.uk/4818/.

Full text

Abstract:

Functional programming languages are an ideal medium for program optimisations based on source-to-source transformation techniques. Referential transparency affords opportunities for a wide range of correctness-preserving transformations leading to potent optimisation strategies. This thesis builds on deforestation, a program transformation technique due to Wadler that removes intermediate data structures from first-order functional programs. Our contribution is to reformulate deforestation for higher-order functional programming languages, and to show that the resulting algorithm terminates given certain syntactic and typing constraints on the input. These constraints are entirely reasonable, indeed it is possible to translate any typed program into the required syntactic form. We show how this translation can be performed automatically and optimally. The higher-order deforestation algorithm is transparent. That is, it is possible to determine by examination of the source program where the optimisation will be applicable. We also investigate the relationship of deforestation to cut-elimination, the normalisation property for the logic of sequent calculus. By combining a cut-elimination algorithm and first-order deforestation, we derive an improved higher-order deforestation algorithm. The higher-order deforestation algorithm has been implemented in the Glasgow Haskell Compiler. We describe how deforestation fits into the framework of Haskell, and design a model for the implementation that allows automatic list removal, with additional deforestation being performed on the basis of programmer supplied annotations. Results from applying the deforestation implementation to several example Haskell programs are given.

APA, Harvard, Vancouver, ISO, and other styles

9

Collins, Graham Richard McFarlane. "Supporting formal reasoning about functional programs." Thesis, University of Glasgow, 2001. http://theses.gla.ac.uk/4609/.

Full text

Abstract:

It is often claimed that functional programming languages, and in particular pure functional languages are suitable for formal reasoning. This claim is supported by the fact that many people in the functional programming community do reason about languages and programs in a formal or semi-formal way. Different reasoning principles such as equational reasoning, induction and co-induction, are used, depending on the nature of the problem. Using a computer program to check the application of rules and to mechanise the tedious bookkeeping involved can simplify proofs and provide more confidence in their correctness. When reasoning about programs, this can also allow experiments with new rules and reasoning styles, where a user may not be confident about structuring a proof on paper. Checking the applicability of a rule can eliminate the risk of mistakes caused by misunderstanding the theory being used. Just as there are different ways in which formal or informal reasoning can be applied in functional programming, there are different ways in which tools can be provided to support this reasoning. This thesis describes an investigation of how to develop a mechanised reasoning system to allow reasoning about algorithms as a functional programmer would write them, not an encoding of the algorithm into a significantly different form. In addition, this work aims to develop a system to support a user who is not a theorem proving expert or an expert in the theoretical foundations of functional programming. The work is aimed towards a system that could be used by a functional programmer developing real programs and wishing to prove some or all of the programs correct or to prove that two programs are equivalent.

APA, Harvard, Vancouver, ISO, and other styles

10

Mareček, Jakub. "Exploiting structure in integer programs." Thesis, University of Nottingham, 2012. http://eprints.nottingham.ac.uk/49276/.

Full text

Abstract:

The thesis argues the case for exploiting certain structures in integer linear programs. Integer linear programs are optimisation problems, where one minimises or maximises a linear function of variables, whose values are required to be integral as well as satisfying certain linear equalities and inequalities. For such an abstract problem, there are very good general-purpose solvers. The state of the art in such solvers is an approach known as “branch and bound”. The performance of such solvers depends crucially on four types of in-built heuristics: primal, improvement, branching, and cut-separation or, more generally, bounding heuristics. However, such heuristics have, until recently, not exploited structure in integer linear programs beyond the recognition of certain types of single-row constraints. Many alternative approaches to integer linear programming can be cast in the following, novel framework. “Structure” in any integer linear program is a class of equivalence among triples of algorithms: deriving combinatorial objects from the input, adapting them, and transforming the adapted object to solutions of the original integer linear program. Many such alternative approaches are, however, inherently incompatible with branch and bound solvers. We, hence, define a structure to be “useful”, only when it extracts submatrices, which allow for the implementation of more than one of the four types of heuristics required in the branch and bound approach. Although the extraction of the best possible submatrices is non-trivial, the lack of a considerable submatrix with a given property can often be recognised quickly, and storing useful submatrices in a “pool” makes it possible to use them repeatedly. The goal is to explore whether the state-of-the-art solvers could make use of the structures studied in the academia. Three examples of useful structures in integer linear programs are presented. A particularly widely applicable useful structure relies on the aggregation of variables. Its application can be seen as a decomposition into three stages: Firstly, we partition variables in the original instance into as small number as possible of support sets of constraints forcing convex combinations of binary variables to be less than or equal to one in the original instance, and one-element sets. Secondly, we solve the “aggregated” instance corresponding to the partition of variables. Under certain conditions, we obtain a valid lower bound. Finally, we fix the solution of the aggregated instance in primal and improvement heuristics for the original instance, and use the partition in hyper-plane branching heuristics. Under certain conditions, the primal heuristics are guaranteed to find a feasible solution to the original instance. We also present structures exploiting mutual-exclusion and precedence constraints, prevalent in scheduling and timetabling applications. Mutual exclusion constraints correspond to instances of graph colouring. For numerous extensions of graph colouring, there are natural primal and branching heuristics. We present lower bounding heuristics for extensions of graph colouring, based on augmented Lagrangian methods for novel semidefinite programming relaxations, and reformulations based on a novel transformation of graph colouring to graph multicolouring. Precedence constraints correspond to an instance of precedence-constrained multi-dimensional packing. For such packing problems, we present heuristics based on an adaptive discretisation and strong discretised linear programming relaxations. On in- stances of packing unit-cubes into a box, the reformulation makes it possible to solve instances that are by five orders of magnitude larger than previously. On instances from complex timetabling problems, which combine mutual- exclusion and packing constraints, the combination of heuristics above can often result in the gap between primal and dual bounds being reduced to under five percent, orders of magnitude faster than using state of the art solvers, without any information being used that is outside of the instance.

APA, Harvard, Vancouver, ISO, and other styles

11

Gabris, Patsy Lynette. "Spreadsheet instruction and their use for teaching mathematics in the business computer applications course in Virginia." Thesis, Virginia Tech, 1991. http://hdl.handle.net/10919/42150.

Full text

Abstract:

This study describes the use of spreadsheets in business computer applications (BCA) courses and identifies and evaluates the use of spreadsheets for emphasizing and teaching mathematics in BCA courses.

Survey instruments in the form of questionnaires were sent to all of the Virginia high schools with the BCA course to attain the BCA teachers' perceptions of spreadsheet use. Responses were received from 257 teachers, or 70% of the total assumed population.

Findings reveal that 95% of the Virginia BCA teachers include spreadsheet instruction in their BCA courses. The mean number of class periods used for spreadsheet instruction is 27; however, the standard deviation is relatively high. The basic mathematics operations received extensive emphasis. The more complex operations only some emphasis. Accounting and Payroll computation receive the most amount of spreadsheet instructional time.

Over half of the BCA teachers who teach spreadsheets include increasing their students' mathematics skills as one of the course objectives. At the same time, however, only 22% of the respondents evaluate their students' mathematics skills independently from spreadsheet application evaluation. Although this independent mathematics evaluation seldom occurs, 72% of the respondents believe that teaching spreadsheets enhances students' mathematics skills to some extent, and 42% believe that teaching spreadsheets enhances students' mathematics skills extensively.

Considering the amount of material to be taught in spreadsheet instruction, not enough of the BCA class time is devoted to spreadsheet instruction. Much spreadsheet instruction precedes emphasis on mathematics as part of the instruction. Also, considering that students emphasize in their learning what they are evaluated on, the importance the BCA teachers placed on mathematics appears to be minimal.

Master of Science

APA, Harvard, Vancouver, ISO, and other styles

12

Quigley, Claire Louise. "A programming logic for Java bytecode programs." Thesis, University of Glasgow, 2004. http://theses.gla.ac.uk/3030/.

Full text

Abstract:

One significant disadvantage of interpreted bytecode languages, such as Java, is their low execution speed in comparison to compiled languages like C. The mobile nature of bytecode adds to the problem, as many checks are necessary to ensure that downloaded code from untrusted sources is rendered as safe as possible. But there do exist ways of speeding up such systems. One approach is to carry out static type checking at load time, as in the case of the Java Bytecode Verifier. This reduces the number of runtime checks that must be done and also allows certain instructions to be replaced by faster versions. Another approach is the use of a Just In Time (JIT) Compiler, which takes the bytecode and produces corresponding native code at runtime. Some JIT compilers also carry out some code optimization. There are, however, limits to the amount of optimization that can safely be done by the Verifier and JITs; some operations simply cannot be carried out safely without a certain amount of runtime checking. But what if it were possible to prove that the conditions the runtime checks guard against would never arise in a particular piece of code? In this case it might well be possible to dispense with these checks altogether, allowing optimizations not feasible at present. In addition to this, because of time constraints, current JIT compilers tend to produce acceptable code as quickly as possible, rather than producing the best code possible. By removing the burden of analysis from them it may be possible to change this. We demonstrate that it is possible to define a programming logic for bytecode programs that allows the proof of bytecode programs containing loops. The instructions available to use in the programs are currently limited, but the basis is in place to extend these. The development of this logic is non-trivial and addresses several difficult problems engendered by the unstructured nature of bytecode programs.

APA, Harvard, Vancouver, ISO, and other styles

13

Funnell, Lynette. "A classroom-based investigation into the potential of the computer spreadsheet as a learning tool within the secondary school mathematics curriculum." Thesis, Rhodes University, 1992. http://hdl.handle.net/10962/d1003329.

Full text

Abstract:

The influence of modern technology on education is becoming more noticeable and has implications for the curriculum and the teaching methods of mathematics. The microcomputer can be used effectively as a powerful teaching and learning aid within the mathematics classroom. This study considers the role of the computer as an aid to teachers and pupils in the teaching and learning of mathematics and shows it as having great potential. At present relatively few schools in South Africa are using the computer as a teaching aid in the mathematics classroom. The researcher proposes that some reasons are a shortage of suitable programs, the fact that few teachers have adequate skills in educative uses of the computer and most teachers are not skilled in programming techniques. Based on this assessment of the problem, spreadsheet programs related to some mathematics lessons, together with teaching notes and pupils' material have been developed. Besides describing the potential of the computer in mathematics, this study outlines the development of three spreadsheet packages and suitable teaching methodologies used for each package, and assesses an action research investigation undertaken by the researcher, teachers and pupils when using these spreadsheet packages in six classes. The findings of the investigation are most encouraging. The overall conclusion is that computer spreadsheet packages can assist the teacher in making the learning of mathematics more effective, more interesting and more enjoyable.

APA, Harvard, Vancouver, ISO, and other styles

14

Yao, Yuan. "Robust execution of belief-desire-intention-based agent programs." Thesis, University of Nottingham, 2017. http://eprints.nottingham.ac.uk/46948/.

Full text

Abstract:

Belief-Desire-Intention (BDI) agent systems are a popular approach to building intelligent agents for complex and dynamic domains. In the BDI approach, agents select plans to achieve their goals based on their beliefs. When BDI agents pursue multiple goals in parallel, the interleaving of steps in different plans to achieve goals may result in conflicts, e.g., where the execution of a step in one plan makes the execution of a step in another concurrently executing plan impossible. Conversely, plans may also interact positively with each other, e.g., where the execution of a step in one plan assists the execution of a step in other concurrently executing plans. To avoid negative interactions and exploit positive interactions, an intelligent agent should have the ability to reason about the interactions between its intended plans. We propose SAM, an approach to scheduling the progression of an agent’s intentions (intended plans) based on Monte-Carlo Tree Search and its variant Single-Player Monte-Carlo Tree Search. SAM is capable of selecting plans to achieve an agent’s goals and interleaving the execution steps in these plans in a domain-independent way. In addition, SAM also allows developers to customise how the agent’s goals should be achieved, and schedules the progression of the agent’s intentions in a way that best satisfies the requirements of a particular application. To illustrate the flexibility of SAM, we show how our approach can be configured to prioritise criteria relevant in a range of different scenarios. In each of these scenarios, we evaluate the performance of SAM and compare it with previous approaches to intention progression in both synthetic and real-world domains.

APA, Harvard, Vancouver, ISO, and other styles

15

Setiowijoso, Liono. "Data Allocation for Distributed Programs." PDXScholar, 1995. https://pdxscholar.library.pdx.edu/open_access_etds/5102.

Full text

Abstract:

This thesis shows that both data and code must be efficiently distributed to achieve good performance in a distributed system. Most previous research has either tried to distribute code structures to improve parallelism or to distribute data to reduce communication costs. Code distribution (exploiting functional parallelism) is an effort to distribute or to duplicate function codes to optimize parallel performance. On the other hand, data distribution tries to place data structures as close as possible to the function codes that use it, so that communication cost can be reduced. In particular, dataflow researchers have primarily focused on code partitioning and assignment. We have adapted existing data allocation algorithms for use with an existing dataflow-based system, ParPlum. ParPlum allows the execution of dataflow graphs on networks of workstations. To evaluate the impact of data allocation, we extended ParPlum to more effectively handle data structures. We then implemented tools to extract from dataflow graphs information that is relevant to the mapping algorithms and fed this information to our version of a data distribution algorithm. To see the relation between code and data parallelism we added optimization to optimize the distribution of the loop function components and the data structure access components. All of these are done automatically without programmer or user involvement. We ran a number of experiments using matrix multiplication as our workload. We used different numbers of processors and different existing partitioning and allocation algorithm. Our results show that automatic data distribution greatly improves the performance of distributed dataflow applications. For example, with 15 x 15 matrices, applying data distribution speeds up execution about 80% on 7 machines. Using data distribution and our code-optimizations on 7 machines speeds up execution over the base case by 800%. Our work shows that it is possible to make efficient use of distributed networks with compiler support and shows that both code mapping and data mapping must be considered to achieve optimal performance.

APA, Harvard, Vancouver, ISO, and other styles

16

Human, TM. "The design and development of a microprocessor based control system for an electric rail transport system." Thesis, Cape Technikon, 1988. http://hdl.handle.net/20.500.11838/1121.

Full text

Abstract:

Thesis (Masters Diploma (Technology) Cape Technikon, 1988
Radioactivity and radioactive radiation are two scientific phenomena which man has always approached with great caution, if not fear. Radioactive radiation cannot be sensed by any of the human senses and experience has proved just how hazardous it can be to the human body. This caution is therefore by no means unfounded and through the years a set of standards has been derived as to what can be regarded as a safe dose to the human body. At the National Accelerator Centre radioisotopes are being produced by a chemical recovery process from targets which have been irradiated by a high energy proton beam. Targets are prepared by compressing salts, containing the elements to become radioisotopes, into tablets. The high energy protons collide with particles in the targets which give off radioactive radiation. The targets in their turn become radioactive and the isotopes that are produced from these targets are radioactive. The level of radioactive radiation is extremely hazardous and it is therefore impossible for any human being to come into close contact with any of the targets or isotopes. It is for these reasons that an electrical rail transport system was installed at the National Accelerator Centre to transport highly radioactive sources. The transport system links the two irradiation vaults to the two rows of hot cells, where the chemical recovery takes place, and to a well shielded storage area for storage of isotopes and radioactive waste. A transport system, performing tasks of this nature, must be, above all, extremely reliable. Secondly, commands entered by an operator to control the system, must be simple and straight forward. This thesis describes the control of the transport system at the National Accelerator Centre, including alI of its features, advantages and disadvantages.

APA, Harvard, Vancouver, ISO, and other styles

17

Liang, Donglin. "Developing practical program analyses for programs with pointers." Diss., Georgia Institute of Technology, 2002. http://hdl.handle.net/1853/8203.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Cordova, Hector. "Analysis of a parallelized neural network training program implemented using MPI and RPCs." To access this resource online via ProQuest Dissertations and Theses @ UTEP, 2008. http://0-proquest.umi.com.lib.utep.edu/login?COPT=REJTPTU0YmImSU5UPTAmVkVSPTI=&clientId=2515.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Escalante, Marco Antonio. "Probabilistic timing verification and timing analysis for synthesis of digital interface controllers." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/tape17/PQDD_0023/NQ36637.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Aubrey-Jones, Tristan. "Synthesizing imperative distributed-memory implementations from functional data-parallel programs." Thesis, University of Southampton, 2015. https://eprints.soton.ac.uk/381650/.

Full text

Abstract:

Distributed memory architectures such as Linux clusters have become increasingly common butremain difficult to program. We target this problem and present a noveltechnique to automatically generate data distribution plans, and subsequently MPI implementations in C++,from programs written in a functional core language. This framework encodes distributed data layouts as types, which are then used both to search (via type inference) for optimal data distribution plans and to generate the MPI implementations. The main novelty of our approach is that it supports multiple collections, distributed arrays, maps, and lists, rather than just arrays. We introduce the core language and explain our formalization of distributed data layouts. We describe how to search for data distribution plans using a type inference algorithm, and how we generate MPI implementations in C++ from such plans. We then show how our types can be extended to support local data layouts and improved array distributions. We also show how a theorem prover and suitable equational theories can be used to yield a better (i.e., more complete) type inference algorithm. We then describe the design of our implementation, and explain how we use a runtime performance-feedback directed search algorithm to find the best data distribution plans for different input programs. Finally, we present some conceptual and experimental evaluation which analyses the capabilities of our approach, and shows that our implementation can find distributed memory implementations of several example programs, and that the performance of generated programs is similar to that of hand-coded versions.

APA, Harvard, Vancouver, ISO, and other styles

21

Calder, Nigel Stuart. "Processing mathematical thinking through digital pedagogical media the spreadsheet /." The University of Waikato, 2008. http://hdl.handle.net/10289/2662.

Full text

Abstract:

Abstract This study is concerned with the ways mathematical understanding emerges when mathematical phenomena are encountered through digital pedagogical media, the spreadsheet, in particular. Central to this, was an examination of the affordances digital technologies offer, and how the affordances associated with investigating mathematical tasks in the spreadsheet environment, shaped the learning trajectories of the participants. Two categories of participating students were involved, ten-year-old primary school pupils, and pre-service teachers. An eclectic approach to data collection, including qualitative and quantitative methods, was initially undertaken, but as my research perspective evolved, a moderate hermeneutic frame emerged as the most productive way in which to examine the research questions. A hermeneutic process transformed the research methodology, as well as the manner in which the data were interpreted. The initial analysis and evolving methodology not only informed this transition to a moderate hermeneutic lens, they were constitutive of the ongoing research perspectives and their associated interpretations. The data, and some that was subsequently collected, were then reconsidered from this modified position. The findings indicated that engaging mathematical tasks through the pedagogical medium of the spreadsheet, influenced the nature of the investigative process in particular ways. As a consequence, the interpretations of the interactions, and the understandings this evoked, also differed. The students created and made connections between alternative models of the situations, while the visual, tabular structuring of the environment, in conjunction with its propensity to instantly manage large amounts of output accurately, facilitated their observation of patterns. They frequently investigated the visual nature of these patterns, and used visual referents in their interpretations and explanations. It also allowed them to pose and test their informal conjectures and generalisations in non-threatening circumstances, to reset investigative sub-goals easily, hence fostering risk taking in their approach. At times, the learning trajectory evolved in unexpected ways, and the data illustrated various alternative ways in which unexpected, visual output stimulated discussion and extended the boundaries of, or reorganised, their interaction and mathematical thinking. An examination of the visual perturbations, and other elements of learning as hermeneutic processes also revealed alternative understandings and explanations. Viewing the data and the research process through hermeneutic filters enhanced the connectivity between the emergence of individual mathematical understanding, and the cultural formation of mathematics. It permitted consideration of the ways this process influences the evolution of mathematics education research. While interpretive approaches are inevitably imbued with the researcher perspective in the analysis of what gets noticed, the research gave fresh insights into the ways learning emerges through digital pedagogical media, and the potential of this engagement to change the nature of mathematics education.

APA, Harvard, Vancouver, ISO, and other styles

22

Tang, Dezheng. "Mapping Programs to Parallel Architectures in the Real World." PDXScholar, 1992. https://pdxscholar.library.pdx.edu/open_access_etds/4534.

Full text

Abstract:

Mapping an application program to a parallel architecture can be described as a multidimensional optimization problem. To simplify the problem, we divide the overall mapping process into three sequential substeps: partitioning, allocating, and scheduling, with each step using a few details of the program and architecture description. Due to the difficulty in accurately describing the program and architecture and the fact that each substep uses incomplete information, inaccuracy is pervasive in the real-world mapping process. We hypothesize that the inaccuracy and the use of suboptimal, heuristic mapping methods may greatly affect the mapping or submapping performance and lead to a non-optimal solution. We do not discard the typical approach used by most researchers in which total execution time or speedup is the criterion to evaluate the quality of the mapping. However, we improve on this approach by including the effects of inaccuracy. We believe that, due to the presence of inaccuracy in the mapping process, investigating the impact of inaccuracy on the mapping quality is crucial to achieving good mappings. The motivation of this work is to identify the various inaccuracies during the mapping procedure and explore the sensitivity of mapping quality to the inaccurate parameters. To conduct the sensitivity examination, the Global Cluster partitioning algorithm and some models were used. The models use some program and architecture characteristics, or lower-level meters, to characterize the mapping solution space. The algorithm searches the solution space and makes the decision based on the information provided by the models. The experiments were implemented on a UNIX LAN of Sun workstations for different data flow graphs. The graphs use three parallel programming paradigms: fine grained, coarse-grained, and pipelined styles, to represent some high-level application programs: vector inner product calculation, matrix multiplication, and Gaussian elimination respectively. The experimental results show that varying system behavior affects the accuracy of lower-level meters, and the quality of the mapping algorithm is very sensitive to the inaccuracies.

APA, Harvard, Vancouver, ISO, and other styles

23

Cheng, Chung-Cho Oliver. "A tool for compiler testing /." Online version of thesis, 1987. http://hdl.handle.net/1850/10181.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Benn, Kenneth Robert Andrew. "A classroom-based investigation into the potential of a computer-mediated criterion-referenced test as an evaluation instrument for the assessment of primary end user spreadsheet skills." Thesis, Rhodes University, 1994. http://hdl.handle.net/10962/d1003328.

Full text

Abstract:

The demand for innovative end users of information technology is increasing along with the proliferation of computer equipment within the workplace. This has resulted in increasing demands being made upon educational institutions responsible for the education of computer end users. The demands placed upon the teachers are particularly high. Large class groups and limited physical resources make the task especially difficult. One of the most time consuming, yet important, tasks is that of student evaluation. To effectively assess the practical work of information technology students requires intensive study of the storage media upon which the students'efforts have been saved. The purpose of this study was to assess the suitability of criterion-referenced testing techniques applied to the evaluation of end user computing students. Objective questions were administered to the students using Question Mark, a computer-managed test delivery system which enabled quick and efficient management of scoring and data manipulation for empirical analysis. The study was limited to the classroom situation and the assessment of primary spreadsheet skills. In order to operate within these boundaries, empirical techniques were used which enabled the timeous analysis of the students' test results. The findings of this study proved to be encouraging. Computer-mediated criterion-referenced testing techniques were found to be sufficiently reliable for classroom practice when used to assess primary spreadsheet skills. The validation of the assessment technique proved to be problematic because of the constraints imposed by normal classroom practice as well as the lack of an established methodology for evaluating spreadsheet skills. However, sufficient evidence was obtained to warrant further research aimed at assessing the use of computer-mediated criterion-referenced tests to evaluate information technology end user learning in situations beyond the boundaries of the classroom, such as a national certification examination.

APA, Harvard, Vancouver, ISO, and other styles

25

Malireddy, Sailaja. "International student services opportunity database (ISSODB)." CSUSB ScholarWorks, 1997. https://scholarworks.lib.csusb.edu/etd-project/1408.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Clabough, Douglas M. "An electronic calendar system in a distributed UNIX environment." Thesis, Kansas State University, 1986. http://hdl.handle.net/2097/9906.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Wendelborn, Andrew Lawrence. "Data flow implementations of a lucid-like programming language." Title page, contents and summary only, 1985. http://web4.library.adelaide.edu.au/theses/09PH/09phw471.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Simone, James Nicholas. "NP user interface modeling." Diss., Online access via UMI:, 2009.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

29

Cardone, Richard Joseph. "Language and compiler support for mixin programming." Access restricted to users with UT Austin EID Full text (PDF) from UMI/Dissertation Abstracts International, 2002. http://wwwlib.umi.com/cr/utexas/fullcit?p3077428.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Faruqui, Saif Ahmed. "Utility computing: Certification model, costing model, and related architecture development." CSUSB ScholarWorks, 2005. https://scholarworks.lib.csusb.edu/etd-project/2756.

Full text

Abstract:

The purpose of the thesis was to propose one set of solutions to some of the challenges that are delaying the adoption of utility computing on a wider scale. These components enable effective deployment of utility computing, efficient look-up, and comparison of service offerings of different utility computing resource centers connected to the utility computing network.

APA, Harvard, Vancouver, ISO, and other styles

31

Carothers, Christopher D. "Efficient execution of Time Warp programs on heterogeneous, NOW platforms." Diss., Georgia Institute of Technology, 1997. http://hdl.handle.net/1853/8475.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Lenhert, Lance Ronald. "The next generation: A look at where today's enterprise resource planning (ERP) systems came from and where technology is heading." CSUSB ScholarWorks, 2000. https://scholarworks.lib.csusb.edu/etd-project/1689.

Full text

Abstract:

"Currently, the largest barrier to any given market usually involves capital. If a company does not have enough investment capital to start with, it could fail before it even gets started. However, there is a new component that affects some of the largest corporations in the world. The problem relates to being able to sustain current internal processing, as well as adapt and grow in new markets with higher volumes. There are systems out there today that claim to address these issues along with e-commerce and other electronic sharing of information."

APA, Harvard, Vancouver, ISO, and other styles

33

Odom, Stuart A. "Translator writer systems." Master's thesis, This resource online, 1992. http://scholar.lib.vt.edu/theses/available/etd-12232009-020105/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

殷志遠 and Chi-yuen Yan. "Using spreadsheet as mindtool in studying economics: a case study." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2002. http://hub.hku.hk/bib/B31256521.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Kondo, Boubacar. "An investigation of parallel algorithms developed for graph problems and their implementation on parallel computers." Virtual Press, 1991. http://liblink.bsu.edu/uhtbin/catkey/770951.

Full text

Abstract:

With the recent development of VLSI (Very Large Scale Integration) technology, research has increased considerably on the development of efficient parallel algorithms for solutions of practical graph problems. Varieties of algorithms have already been implemented on different models of parallel computers. But not too much is known yet about the question of which model of parallel computer will efficiently and definitely fit every graph problem. In this investigation the study will focus on a comparative analysis of speedup and efficiency of parallel algorithms with parallel model of computation, and with respect to some sequential algorithms.
Department of Computer Science

APA, Harvard, Vancouver, ISO, and other styles

36

Farkas, Alex Miklós. "Program construction and evolution in a persistent integrated programming environment /." Title page, contents and abstract only, 1995. http://web4.library.adelaide.edu.au/theses/09PH/09phf229.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Sobel, Ann E. Kelley. "Modular verification of concurrent systems /." The Ohio State University, 1986. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487267546983528.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Rayburn-Reeves, Daniel James. "Disambiguating human spoken diary entries using context information." View electronic thesis, 2008. http://dl.uncw.edu/etd/2008-1/rayburn-reevesd/danielrayburn-reeves.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Liang, Wen. "A compiler optimization framework for Concordia Parallel C." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp01/MQ39488.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Hopper, Michael A. "A compiler framework for multithreaded parallel systems." Diss., Georgia Institute of Technology, 1997. http://hdl.handle.net/1853/15638.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Moon, Hae-Kyung. "Compiler construction for a simple Pascal-like language." Virtual Press, 1994. http://liblink.bsu.edu/uhtbin/catkey/897511.

Full text

Abstract:

In this thesis a compiler called SPASCAL is implemented which translates source programs in a simple Pascal-like language called SPASCAL into target programs in the VAX assembly language. This thesis clearly describes the main aspects of a compiler: lexical analysis and syntactic analysis, including the symbol-table routines and the error-handling routines. This thesis uses regular expressions to define the lexical structure and a context-free grammar to define the syntactic structure of SPASCAL. The compiler is constructed using syntax-directed translation, context-free grammars and a set of semantic rules. SPASCAL Compiler is written with standard C in UNIX.
Department of Computer Science

APA, Harvard, Vancouver, ISO, and other styles

42

Lo, Jack Lee-jay. "Exploiting thread-level parallelism on simultaneous multithreaded processors /." Thesis, Connect to this title online; UW restricted, 1998. http://hdl.handle.net/1773/6946.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Lee, Kum-Yu Enid. "Privacy and security of an intelligent office form." Thesis, Kansas State University, 1986. http://hdl.handle.net/2097/9930.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Mangolas, Athanassios Anastassios. "An Ada library for positional board games." Thesis, This resource online, 1990. http://scholar.lib.vt.edu/theses/available/etd-06082009-171004/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Niu, Yanwei. "Parallelization and performance optimization of bioinformatics and biomedical applications targeted to advanced computer architectures." Access to citation, abstract and download form provided by ProQuest Information and Learning Company; downloadable PDF file 1.05 Mb., 143 p, 2005. http://wwwlib.umi.com/dissertations/fullcit/3181852.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Hao, Yiyao. "Micro-payment exchange system." CSUSB ScholarWorks, 2005. https://scholarworks.lib.csusb.edu/etd-project/2838.

Full text

Abstract:

The purpose of this project is to investigate the infrastructure requirements for a currency exchange market for holders of currencies issued through the Lightweight Currency Protocol. The Lightweight Currency Protocol was designed as a means for entities to issue currencies for the purpose of cultivating low value business transactions between collaborating nodes in a peer-to-peer market.

APA, Harvard, Vancouver, ISO, and other styles

47

Harmon, Trev R. "On-Line Electronic Document Collaboration and Annotation." Diss., CLICK HERE for online access, 2006. http://contentdm.lib.byu.edu/ETD/image/etd1589.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Ntsohi, Mamosa M. E. "Investigating teaching and learning of Grade 9 Algebra through excel spreadsheets : a mixed-methods case study for Lesotho." Thesis, Stellenbosch : Stellenbosch University, 2013. http://hdl.handle.net/10019.1/85657.

Full text

Abstract:

Thesis (PhD)-- Stellenbosch University, 2013.
ENGLISH ABSTRACT: The teaching and learning of algebra in the middle school grades in Lesotho is dominated by the mechanistic approach where learners are drilled on procedures for solving certain types of problems in algebra, without making any connection to the experience learners had with arithmetic. This is one of the sources of learners’ difficulties in mathematics. Research indicates that use of spreadsheets such as Excel has a potential of bridging the gap between arithmetic and algebra and thus enhancing the teaching and learning of algebra, making it meaningful to the learners. The study sought to answer the question: How do Grade 9 learners in Lesotho experience teaching and learning of algebra through Excel spreadsheets? The research commenced with a literature review that was followed by the empirical study. The theories of instrumental genesis and instrumental orchestration were identified as the framework for the investigation. Instrumental genesis is the process in which learners develop facility with the artifact as they use it towards achieving lesson objectives; technical (conceptual, mechanical) and personal (attitudes, behavior and preferred learning styles) aspects of learners’ experiences were identified. Instrumental orchestration is the steering of learners’ instrumental genesis by the teacher and the manner in which this process is carried out, depends on the teacher’s Technological Pedagogical Content Knowledge (TPCK). The research was a multi-case study following a mixed-methods approach, where both qualitative and quantitative methods were used. The empirical study was conducted in two schools in Lesotho. In each school, fifteen learners volunteered participation. The investigation was done through classroom teaching by me as the researcher. The focus was on what challenges learners encountered and how they benefited from their “spreadsheets algebra” learning experience. Data were collected through classroom observations where field notes were recorded and an observation schedule was used by the researcher and the Assistant Observer respectively. A questionnaire was also administered to all learner participants after the whole teaching period. Six learners, representative of high, medium and low performances in class, were also interviewed with a goal of finding out their experiences. The Assistant Observer was also interviewed to reduce the bias that may result from to the researcher studying her own practice The study found that learners experiences with learning algebra through spreadsheets, comprised of both challenges and benefits. The challenges encountered by learners could be classified into those that were school-based and those that were instruction-based. The school-based challenges related to inadequate physical structures and lack of well-functioning equipment in the computer laboratories. Instruction-based challenges encountered by learners were both technical and personal. Technical challenges related to the physical manipulation of the artifact and the lack of understanding of concepts involved, where the spreadsheets meet the algebra. Personal challenges related to learners’ attitude and behavior towards use of spreadsheets for algebra teaching and learning. While school authorities could address some of the challenges, it was found that both the teacher and learners could initiate strategies that could be used to overcome the instruction-based challenges. Teaching strategies such as “technical-demo”, “explain-the-screen”, “discuss-the–screen”, “link-screen-board” and “spot-and-show” (building on learners’ responses), and the general organization of classroom environment were helpful in orchestrating algebra learning within the spreadsheets. It was also found that use of spreadsheets had both cognitive and affective values for the learners. Even though use of spreadsheets may benefit both teachers and learners in algebra teaching and learning, implementation of the practice would require critical considerations in terms of teacher preparation and infra-structural improvements in the schools.
AFRIKAANSE OPSOMMING: Die onderrig en leer van algebra in die middelbare skoolgrade in Lesotho word oorheers deur die meganiese benadering waarvolgens leerders gedril word in prosedures om oplossings vir sekere tipe algebraprobleme te vind en die ervaring wat leerders in rekenkunde opgedoen het, nie daarmee in verband gebring word nie. Dit is een van die oorsake waarom leerders met wiskunde sukkel. Navorsing toon dat die gebruik van sigblaaie soos Excel moontlik die gaping tussen rekenkunde en algebra kan oorbrug, en dat die onderrig en leer van algebra daardeur kan verbeter, wat dit sinvol vir leerders sal maak. Die studie was daarop gemik om ’n antwoord op die volgende vraag te vind: Hoe ervaar graad 9-leerders in Lesotho die onderrig en leer van algebra deur middel van Excel-sigblaaie? Die navorsing het met ’n literatuuroorsig begin en is deur ’n empiriese studie opgevolg. Die teorieë instrumentele genese en instrumentele orkestrasie is uitgewys as die raamwerk vir die ondersoek. Instrumentele genese is die proses waarvolgens leerders bedrewenheid in die produk ontwikkel namate hulle dit gebruik om lesdoelstellings te bereik; tegniese (konseptuele, meganiese) en persoonlike (ingesteldheid, gedrag en voorkeurleerstyle) aspekte van leerders se ervarings is geïdentifiseer. Instrumentele orkestrasie is die stuur van leerders se instrumentele genese deur die onderwyser; en die wyse waarop hierdie proses uitgevoer word, hang van die onderwyser se Tegnologiese Pedagogiese Inhoudskennis (TPCK) af. Die navorsing het ’n meervoudige gevallestudie gebruik en ’n gemengde metodebenadering is gevolg, terwyl beide kwalitatiewe en kwantitatiewe metodes gebruik is. Die empiriese studie is in twee skole in Lesotho uitgevoer. Vyftien leerlinge uit elke skool het vrywillig deelgeneem. Die ondersoek is by wyse van klaskameronderrig deur my as die navorser gedoen. Daar is gefokus op die uitdagings wat leerders teëgekom het en hoe hulle by die “sigbladalgebra”-leerervaring gebaat het. Data is aan die hand van klaskamerwaarnemings versamel, waar veldnotas afgeneem is en ’n waarnemingskedule onderskeidelik deur die navorser en die assistentwaarnemer gebruik is. ’n Vraelys is na die volle onderrigtydperk by al die leerderdeelnemers afgeneem. Onderhoude is gevoer met ses leerders, wat hoë, medium en lae prestasies in die klaskamer verteenwoordig, met die doel om hulle ervarings te bekom. ’n Onderhoud is ook met die Assistentwaarnemer gevoer om vooroordeel, deurdat die navorser moontlik haar eie praktyk kon bestudeer, te verminder. Die studie het bevind dat leerders se ervarings met die leer van algebra deur middel van sigblaaie uitdagings sowel as voordele inhou. Die uitdagings wat leerders teëgekom het, kan onderskeidelik as skoolgebaseerde uitdagings en onderrig-gebaseerde uitdagings geklassifiseer word. Die skoolgebaseerde uitdagings hou verband met onvoldoende fisiese strukture en ’n gebrek aan behoorlik funksionerende toerusting in die rekenaarlaboratoriums. Die onderrig-gebaseerde uitdagings vir leerders is beide tegnies en persoonlik. Tegniese uitdagings hou verband met die fisiese manipulering van die produk en ’n gebrek aan begrip ten opsigte van die betrokke konsepte, naamlik waar die verband tussen die sigblaaie en algebra bestaan. Persoonlike uitdagings hou verband met leerders se ingesteldheid en gedrag rakende die gebruik van sigblaaie by die onderrig en leer van algebra. Alhoewel die skoolowerhede bepaalde uitdagings kan aanspreek, is daar bevind dat onderwysers sowel as leerders strategieë kan aanvoor om onderrig-gebaseerde uitdagings te oorkom. Onderrigstrategieë soos “tegniese demo”, “verduidelik die skerm”, “bespreek die skerm”, “koppel-skerm-bord” en “vind-en-wys” (wat op leerders se reaksie voortbou), asook die algemene organisasie van die klaskameromgewing, dra tot die orkestrasie van algebraonderrig met die sigblaaie by. Daar is ook bevind dat die gebruik van sigblaaie kognitiewe sowel as affektiewe waarde vir die leerders inhou. Selfs al sou onderwysers en leerders voordeel uit die gebruik van sigblaaie in die onderrig en leer van algebra kon trek, sou die implementering van die praktyk kritiese oorwegings moet geniet ten opsigte van onderwyservoorbereiding en infrastruktuurverbetering by die skole.

APA, Harvard, Vancouver, ISO, and other styles

49

Nestra, Härmel. "Iteratively defined transfinite trace semantics and program slicing with respect to them /." Online version, 2006. http://dspace.utlib.ee/dspace/bitstream/10062/1109/5/nestraharmel.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Pragasam, Ravi L. "The MC68701 based spectrum analyzer." Thesis, Kansas State University, 1985. http://hdl.handle.net/2097/9872.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic 'Electronic spreadsheets – Computer programs'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles