Relevant bibliographies by topics / Electronic publishing Computer programs / Dissertations / Theses
To see the other types of publications on this topic, follow the link: Electronic publishing Computer programs.

Dissertations / Theses on the topic 'Electronic publishing Computer programs'

Author: Grafiati
Published: 10 December 2022
Last updated: 29 January 2023

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

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Electronic publishing Computer programs.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Kowalczyk, Thomas L. "Performance analysis of text-oriented printing using PostScript /." Online version of thesis, 1988. http://hdl.handle.net/1850/10451.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Robledo, Arcos Maria Andrea. "Electronic design and publishing for the Mexican textiles exhibition /." Online version of thesis, 1990. http://hdl.handle.net/1850/11249.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

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
4

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
5

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
6

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
7

Faw, Bruce Duane. "A system for the application of computer mediated communication to scholarly discourse." CSUSB ScholarWorks, 1996. https://scholarworks.lib.csusb.edu/etd-project/1275.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

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
9

Fisher, David B. "Expert systems in typography /." Online version of thesis, 1990. http://hdl.handle.net/1850/10583.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Chen, Chih-Ming. "The economic feasibility of Computer-to-Plate technology for use in magazine production /." Online version of thesis, 1995. http://hdl.handle.net/1850/12176.

Full text
APA, Harvard, Vancouver, ISO, and other styles
11

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
12

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
13

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<br>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
14

Lindoo, Edward C. "The Future of Newspapers A Study of the World Wide Web And Its Relationship to electronic Publishing of Newspaper." NSUWorks, 1998. http://nsuworks.nova.edu/gscis_etd/672.

Full text
Abstract:
The purpose of this study was to determine the effects that the World Wide Web (Web) is having on newspaper publishing. With the development of the Web, more than 4,000 electronic publishers have created Web sites, and are now in competition, not only with each other, but also with traditional media such as newspaper, magazines, radio and television. Due to a variety of factors, including advertisers expanding into Web markets, newspaper publishers perceive this new competition to be not only the most immediate, but also the most serious, systemic, long-term threat to traditional newspaper publishing to date. Therefore, the goal of this dissertation was to study the development of electronic newspapers, to ascertain how newspapers are currently using the World Wide Web, to suggest how new technologies, such as the Web, might be used by newspaper companies in the future to keep their share of the information dissemination marketplace, and to draw conclusions as to the importance of the Web to newspapers, now, and in the future. Millions of dollars have been spent by newspapers to get their product on the Web, and millions more will be spent to keep their presence on the Web. However, few publishers are making money on the Web, and some have ceased Web operations, almost as quickly as they started. Through the implementation of a survey, questions such as profitability, staffing, pricing, promotion, and Subscriptions were answered. Ultimately, this information can be used by newspaper publishers to enhance their Web product as they move into the future. The success of this project was based on the literature review, the results of the survey, and the final analysis, which has put into perspective where the electronic publishing industry is today, and what newspaper publishers need to do in the future to remain competitive, while maintaining their share of the market. Although the literature contained much hype about the Web, the final results of this paper show that the newspaper industry, as a whole, is not in as much danger as most publishers fear. And because most newspapers have created Web sites, they have positioned themselves well to fight off competition.
APA, Harvard, Vancouver, ISO, and other styles
15

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
16

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
17

Bickerstaff, Lisa. "Docutech open job submode simulation : a masters of fine arts thesis /." Online version of thesis, 1993. http://hdl.handle.net/1850/11965.

Full text
APA, Harvard, Vancouver, ISO, and other styles
18

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
19

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
20

Williams, Stanley Eugene. "Methods for storing, generating, and displaying characters to a graphics computer terminal." Virtual Press, 1987. http://liblink.bsu.edu/uhtbin/catkey/483079.

Full text
Abstract:
This creative project investigates a method for translating a run-length encoded data file of letterforms into bit mapped images. Each letterform is broken (cracked) into primitive strokes. Each primitive stroke is represented by equally spaced runlength spline points within a 72 unit counting system. The strokes are ordered from left to right, allowing a direct scan-line conversion using an on-off character fill. Most commercial letterforms are stored in an outline format. Outline letterfomrs must be converted to vector edges, and then quick sorted into two dimensional arrays of edges for scan-line conversion (no overlapping outlines are allowed). The author's method stores primitives in a left to right ordered format that eliminates the sorting routine.In order to display the letterforms as a body of text, an interpreted description language was developed. The language command structure is embedded in the text file and interpreted at run time. The language controlls the sizing and placement of letterforms at five levels. The page attributes controlls the placement of page margins, column margins, windows, headers, footers, etc. The Paragraph attributes controlles first word indents, paragraph indents, widow lines, etc. The line attributes controlles the text line length, inter word and character spacing, line leading, additional line indents, type of line justification and hyphenation, etc. No attributes were established at the word level. The character attributes controlles the type size, type style, degree of slant (poor man's italic), expansion or contraction, etc.Ball State UniversityMuncie, IN 47306
APA, Harvard, Vancouver, ISO, and other styles
21

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
22

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
23

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
24

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
25

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
26

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
27

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
28

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
29

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
30

Garrido, Piedad, Jesús Tramullas, and Manuel Coll. "CONDITOR1: Topic Maps and DITA labelling tool for textual documents with historical information." Texas A&M University Libraries, 2009. http://hdl.handle.net/10150/105197.

Full text
Abstract:
Conditor is a software tool which works with textual documents containing historical information. The purpose of this work two-fold: firstly to show the validity of the developed engine to correctly identify and label the entities of the universe of discourse with a labelled-combined XTM-DITA model. Secondly to explain the improvements achieved in the information retrieval process thanks to the use of a object-oriented database (JPOX) as well as its integration into the Lucene-type database search process to not only accomplish more accurate searches, but to also help the future development of a recommender system [21]. We finish with a brief demo in a 3D-graph of the results of the aforementioned search.
APA, Harvard, Vancouver, ISO, and other styles
31

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
32

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
33

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.<br>Department of Computer Science
APA, Harvard, Vancouver, ISO, and other styles
34

Farkas, Alex Mikló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
35

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
36

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
37

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
38

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
39

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.<br>Department of Computer Science
APA, Harvard, Vancouver, ISO, and other styles
40

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
41

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
42

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
43

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
44

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
45

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
46

Lung, Feng-Chun. "A portable traveler's weblog." CSUSB ScholarWorks, 2005. https://scholarworks.lib.csusb.edu/etd-project/2832.

Full text
APA, Harvard, Vancouver, ISO, and other styles
47

Nestra, Hä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
48

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
49

Dou, Jie. "Evaluating Microsoft .NET technology: Implementation online store." CSUSB ScholarWorks, 2006. https://scholarworks.lib.csusb.edu/etd-project/3060.

Full text
Abstract:
The purpose of this project is to design, develop and implement an e-commerce shopping cart system based on Microsoft.NET technology and to evaluate ASP.NET technology by developing a shopping cart system.
APA, Harvard, Vancouver, ISO, and other styles
50

Zibran, Minhaz Fahim, and University of Lethbridge Faculty of Arts and Science. "A multi-phase approach to university course timetabling." Thesis, Lethbridge, Alta. : University of Lethbridge, Faculty of Arts and Science, 2007, 2007. http://hdl.handle.net/10133/633.

Full text
Abstract:
Course timetabling is a well known constraint satisfaction optimization (CSOP) problem, which needs to be solved in educational institutions regularly. Unfortunately, this course timetabling problem is known to be NP-complete [7, 39]. This M.Sc. thesis presents a multi-phase approach to solve the university level course timetabling problem. We decompose the problem into several sub-problems with reduced complexity, which are solved in separate phases. In phase-1a we assign lectures to professors, phase-1b assigns labs and tutorials to academic assistances and graduate assistants. Phase-2 assigns each lecture to one of the two day-sequences (Monday-Wednesday-Friday or Tuesday-Thursday). In Phase-3, lectures of each single day-sequence are then assigned to time-slots. Finally, in phase-4, labs and tutorials are assigned to days and time-slots. This decomposition allows the use of different techniques as appropriate to solve different phases. Currently different phases are solved using constraint programming and integer linear programming. The multi-phase architecture with the graphical user interface allows users to customize constraints as well as to generate new solutions that may incorporate partial solutions from previously generated feasible solutions.<br>ix, 117 leaves ; 29 cm
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the bibliographies on the topic 'Electronic publishing Computer programs' for other source types:
Journal articles Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography