Dissertations / Theses: 'Computer programming, informatic'

1

Kirby, Graham N. C. "Reflection and hyper-programming in persistent programming systems." Thesis, University of St Andrews, 1992. http://hdl.handle.net/10023/1673.

Full text

Abstract:

In an orthogonally persistent programming system, data is treated in a manner independent of its persistence. This gives simpler semantics, allows the programmer to ignore details of long-term data storage and enables type checking protection mechanisms to operate over the entire lifetime of the data. The ultimate goal of persistent programming language research is to reduce the costs of producing software. The work presented in this thesis seeks to improve programmer productivity in the following ways: • by reducing the amount of code that has to be written to construct an application; • by increasing the reliability of the code written; and • by improving the programmer’s understanding of the persistent environment in which applications are constructed. Two programming techniques that may be used to pursue these goals in a persistent environment are type-safe linguistic reflection and hyper-programming. The first provides a mechanism by which the programmer can write generators that, when executed, produce new program representations. This allows the specification of programs that are highly generic yet depend in non-trivial ways on the types of the data on which they operate. Genericity promotes software reuse which in turn reduces the amount of new code that has to be written. Hyper-programming allows a source program to contain links to data items in the persistent store. This improves program reliability by allowing certain program checking to be performed earlier than is otherwise possible. It also reduces the amount of code written by permitting direct links to data in the place of textual descriptions. Both techniques contribute to the understanding of the persistent environment through supporting the implementation of store browsing tools and allowing source representations to be associated with all executable programs in the persistent store. This thesis describes in detail the structure of type-safe linguistic reflection and hyper-programming, their benefits in the persistent context, and a suite of programming tools that support reflective programming and hyper-programming. These tools may be used in conjunction to allow reflection over hyper-program representations. The implementation of the tools is described.

APA, Harvard, Vancouver, ISO, and other styles

2

Davidson, Joseph Ray. "An information theoretic approach to the expressiveness of programming languages." Thesis, University of Glasgow, 2016. http://theses.gla.ac.uk/7200/.

Full text

Abstract:

The conciseness conjecture is a longstanding notion in computer science that programming languages with more built-in operators, that is more expressive languages with larger semantics, produce smaller programs on average. Chaitin defines the related concept of an elegant program such that there is no smaller program in some language which, when run, produces the same output. This thesis investigates the conciseness conjecture in an empirical manner. Influenced by the concept of elegant programs, we investigate several models of computation, and implement a set of functions in each programming model. The programming models are Turing Machines, λ-Calculus, SKI, RASP, RASP2, and RASP3. The information content of the programs and models are measured as characters. They are compared to investigate hypotheses relating to how the mean program size changes as the size of the semantics change, and how the relationship of mean program sizes between two models compares to that between the sizes of their semantics. We show that the amount of information present in models of the same paradigm, or model family, is a good indication of relative expressivity and average program size. Models that contain more information in their semantics have smaller average programs for the set of tested functions. In contrast, the relative expressiveness of models from differing paradigms, is not indicated by their relative information contents. RASP and Turing Machines have been implemented as Field Programmable Gate Array (FPGA) circuits to investigate hardware analogues of the hypotheses above. Namely that the amount of information in the semantics for a model directly influences the size of the corresponding circuit, and that the relationship of mean circuit sizes between models is comparable to the relationship of mean program sizes. We show that the number of components in the circuits that realise the semantics and programs of the models correlates with the information required to implement the semantics and program of a model. However, the number of components to implement a program in a circuit for one model does not relate to the number of components implementing the same program in another model. This is in contrast to the more abstract implementations of the programs. Information is a computational resource and therefore follows the rules of Blum’s axioms. These axioms and the speedup theorem are used to obtain an alternate proof of the undecidability of elegance. This work is a step towards unifying the formal notion of expressiveness with the notion of algorithmic information theory and exposes a number of interesting research directions. A start has been made on integrating the results of the thesis with the formal framework for the expressiveness of programming languages.

APA, Harvard, Vancouver, ISO, and other styles

3

Page, Stephen Dowland. "Computer tools for music information retrieval." Thesis, University of Oxford, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.293399.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Yang, Jean Ph D. Massachusetts Institute of Technology. "Preventing information leaks with policy-agnostic programming." Thesis, Massachusetts Institute of Technology, 2015. http://hdl.handle.net/1721.1/101468.

Full text

Abstract:

Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2015.
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged student-submitted from PDF version of thesis.
Includes bibliographical references (pages 103-115).
As a solution to the problem of information leaks, I propose a policy-agnostic programming paradigm that enforces security and privacy policies by construction. I present the implementation of this paradigm in a new language, Jeeves, that automatically enforces information flow policies describing how sensitive values may flow through computations. In Jeeves, the programmer specifies expressive information flow policies separately from other functionality and relies on the language runtime to customize program behavior based on the policies. Jeeves allows programmers to implement information flow policies once instead of as repeated checks and filters across the program. To provide strong guarantees about Jeeves programs, I present a formalization of the dynamic semantics of Jeeves, define non-interference and policy compliance properties, and provide proofs that Jeeves enforces these properties. To demonstrate the practical feasibility of policy-agnostic programming, I present Jacqueline, a web framework built on Jeeves that enforces policies in database-backed web applications. I provide a formalization of Jacqueline as an extension of Jeeves to include relational operators and proofs that this preserves the policy compliance guarantees. Jacqueline enforces information flow policies end-to-end and runs using an unmodified Python interpreter and SQL database. I show, through several case studies, that Jacqueline reduces the amount of policy code required while incurring limited overheads
by Jean Yang.
Ph. D.

APA, Harvard, Vancouver, ISO, and other styles

5

Deng, Zhenyue. "Practical secure information flow in programming languages." FIU Digital Commons, 2005. http://digitalcommons.fiu.edu/etd/2771.

Full text

Abstract:

If we classify variables in a program into various security levels, then a secure information flow analysis aims to verify statically that information in a program can flow only in ways consistent with the specified security levels. One well-studied approach is to formulate the rules of the secure information flow analysis as a type system. A major trend of recent research focuses on how to accommodate various sophisticated modern language features. However, this approach often leads to overly complicated and restrictive type systems, . making them unfit for practical use. Also, problems essential to practical use, such as type inference and error reporting, have received little attention. This dissertation identified and solved major theoretical and practical hurdles to the application of secure information flow. We adopted a minimalist approach to designing our language to ensure a simple lenient type system. We started out with a small simple imperative language and only added features that we deemed most important for practical use. One language feature we addressed is arrays. Due to the various leaking channels associated with array operations, arrays have received complicated and restrictive typing rules in other secure languages. We presented a novel approach for lenient array operations, which lead to simple and lenient typing of arrays. Type inference is necessary because usually a user is only concerned with the security types for input/output variables of a program and would like to have all types for auxiliary variables inferred automatically. We presented a type inference algorithm B and proved its soundness and completeness. Moreover, algorithm B stays close to the program and the type system and therefore facilitates informative error reporting that is generated in a cascading fashion. Algorithm Band error reporting have been implemented and tested. Lastly, we presented a novel framework for developing applications that ensure user information privacy. In this framework, core computations are defined as code modules that involve input/output data from multiple parties. Incrementally, secure flow policies are refined based on feedback from the type checking/inference. Core computations only interact with code modules from involved parties through well-defined interfaces. All code modules are digitally signed to ensure their authenticity and integrity.

APA, Harvard, Vancouver, ISO, and other styles

6

Mehandjiev, Nikolay Dimitrov. "User enhanceability for information systems through visual programming." Thesis, University of Hull, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.389464.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Hsu, Jimmy M. "Programming surveys for the MIT Information Acceleration Project." Thesis, Massachusetts Institute of Technology, 1996. http://hdl.handle.net/1721.1/40187.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Alzahrani, Ahmed A. "Enhanced learning of computer programming in university through collaboration using multi-touch tools." Thesis, Kingston University, 2017. http://eprints.kingston.ac.uk/41045/.

Full text

Abstract:

While collaborative learning is universally recognised as a process of considerable pedagogical value, and the enhancement of standard application interfaces to promote collaboration has formed the subject of previous studies, the literature addressing the degree to which Multi-touch technology is used remains limited. Multi-touch, multi-mouse tools are a novel category of groupware, which can enhance learning through collaborative use of those tools. The research aim is to develop a framework and a software tool known as the Learning to Program through a Computer-Aided Collaboration (LPCAC) tool. The LPCAC is a Multi-touch software tool that enhances the learning of computer programming in university through collaborative use of this tool. Subsidary objectives are pursued in the form of research questions, with most comparatively investigating and evaluating the use of the Multi-touch tool compared to the standalone PC-based approach. University students were selected to take part in a study to measure their performance improvements using the Multi-touch tools in a collaborative environment. A two-part process was followed to analyse the difference between student collaborations using Multi-touch with multi-mouse devices cmpared to standalone PC-based system with a single mouse device. Data collection involved video recording and a questionnaire analysis. Data analysis followed an eight-step process to evaluate the process of collaborative programming, which includes an analysis of collaboration patterns, time on task, equity of participation and design quality. While the Multi-touch tool is limited in a number of ways, its multiple points of contact and the collaborative activity promote a more favourable software design process when compared to the standalone PC-based condition. Although further research is needed, this study has found that Multi-touch technology represents a promising prospect for application in teaching computer programming in educational establishments, as well as improving the software development process in the wider collaborative software development.

APA, Harvard, Vancouver, ISO, and other styles

9

Winnett, Maria E. "Programming support for CSCW : using X windows." Thesis, Kingston University, 1995. http://eprints.kingston.ac.uk/20591/.

Full text

Abstract:

This thesis presents a model for programming support for synchronous, distributed CSCW (Computer Supported Co-operative Work). Synchronous, distributed CSCW aims to allow groups of people separated, by distance to work together in real time as if they were at the same location. The model proposed in the thesis allows an application program to be constructed using user interface components known as “shared widgets”. A shared widget displays underlying application data on multiple screens and processes input from multiple users distributed over a network. The distribution of data to and from the users and the underlying network communication is hidden from the application program within the shared widget. The model describes a shared widget as comprising a single “Artefact” and a number of “Views.” The Artefact contains the underlying data and the actions that can be performed on it. A View is the presentation of the Artefact on a user's screen. Shared widgets contain a View for each user in the group. Each user can provide input to the Artefact via their own View, and any change made to the Artefact is reflected synchronously in all the Views. The Artefact can also impose a floor control policy to restrict input to a particular user or group of users, by checking each input event against a known floor control value. The model differs from previous approaches to programming support for CSCW in that the distributed nature of the users is hidden from the application programmer within the shared widgets. As a result, the application programmer does not have to be concerned with the processing of input events or the distribution of output to multiple users. The hiding of these implementation details within the shared widgets allows the CSCW application to be constructed in a similar way to a single-user application. An implementation of the shared widget model, using X Windows, is also described in the thesis. Experimental results and observations are given and used to suggest future directions for further research.

APA, Harvard, Vancouver, ISO, and other styles

10

Backeman, Jens, and Erik Carlson. "Dokumentera med eXtreme Programming : Går det?" Thesis, Uppsala University, Computer Systems Sciences, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-126179.

Full text

Abstract:

Att sätta sig in i system kan vara krångligt utan rätt sorts dokumentation. Vi har undersökt vilken dokumentation som kan vara lämplig att lämna över till nya utvecklare, som ska arbeta vidare med systemet i software maintenance fasen.

Det har gjorts genom att vi har gjort en litteraturstudie om dokumentation samt undersökt vad för dokumentationsartefakter som används när man ska sätta sig in i datorsystem. Vi använde eXtreme Programming för att utveckla ett system som vi försökte dokumentera samtidigt som vi utvecklade det.

eXtreme Programming förordar muntlig kommunikation, vilket är svårt att lämna över till nya utvecklare. Vi upptäckte under vår utveckling att det var svårt att föra in dokumentation sam-tidigt som utvecklandet pågick, därför använde vi bara enhetstester och strukturerade kod-kommentarer under utvecklingsiterationerna.

Vi undersökte hur dokumentationen som skapats fungerade genom att göra en undersökning bestående av strukturerade intervjuer där de fick komma med kommentarer om hur dokumen-tationen hjälpte förståelsen för systemet.

Vi lämnar ifrån oss en vidareutveckling av eXtreme Programming som innefattar en doku-mentationsiteration innan överlämnandet samt en studie om vad för dokumentation som är värdefull att ha vid systemöverlämningar.

Understanding systems can be a tough task without the right sort of documentation. We have examined the documentation artifacts which may be appropriate to hand over to new develop-ers, who will continue working with the system during the software maintenance phase.

By doing a literature review on documentation and examined what documentation artifacts is used when you want to understand a computer system. We used the eXtreme Programming system development methodology to develop a system that we tried to document as we devel-oped it.

eXtreme Programming favors oral communication, but that is hard to hand over to new devel-opers. We discovered during our development that it was difficult to introduce documentation while the development process was going on so we only used structured code comments and unit testing during the development iterations

We examined how the documentation that was created worked by doing a survey consisting of structured interviews where the respondents made comments about if and how the documen-tation improved their understanding of the system.

We pass on an evolved eXtreme Programming system development methodology, which in-cludes a standalone documentation iteration before the handover, and a study of what kind of documentation that is valuable to have when transferring systems to new developers.

APA, Harvard, Vancouver, ISO, and other styles

11

Dunlop, Mark David. "Multimedia information retrieval." Thesis, University of Glasgow, 1991. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.358626.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Alatawi, Mohammed Naif. "Examining the Impact of Learning Management Systems in Computer Programming Courses." Diss., NSUWorks, 2019. https://nsuworks.nova.edu/gscis_etd/1084.

Full text

Abstract:

The development of software and communication technologies in education has led the majority of universities worldwide to integrate the functions of Learning Management Systems (LMSs) into their learning environments. LMSs offers several features that encourage their use by universities and other educational institutions, such as unlimited access to course content, easy tracking of learners’ progress and performance, and reduced costs in terms of both money and time. Most existing LMS studies have been focused on experienced LMS users who are familiar with its functions, with little consideration given to new users. Furthermore, although previous researchers have identified various means of enhancing the effectiveness of LMS use, no consensus has yet been reached on which of these features most successfully improve the learning outcomes of new learners enrolled in programming courses. The purpose of this study, therefore, was to examine the usability of particular LMS features and their impact on learning outcomes for freshman students enrolled in programming courses. Through the Virtual Programming Lab (VPL) and discussion forums, particular LMS features have been considered. For this study, a quantitative quasi-experimental design was employed, including experimental and control groups of new students enrolled in an introductory programming course that involved different LMS features. These features have been considered in the place of treatment in this experiment, in which the level of difference between participants in the two groups was compared. This study involved two main dependent variables: LMS features’ usability and learning achievement. For the first dependent variable, LMS usability, the participants completed a survey, based on the components of Shackel’s usability model (1991), to evaluate the effectiveness of the LMS features’ usability. Four constructs underpin this model: effectiveness, learnability, flexibility, a¬¬nd attitude. For the second dependent variable, learning achievement, the final grade was used to measure the impact of these two LMS features on learning achievement between the two groups. The results revealed significance differences related to LMS features’ usability and learning achievement between the experimental group and the control group. Participants in the experimental group reported greater LMS usability than did those in the control group, and overall course scores indicated improved learning performance in members of the experimental group who applied the VPL and discussion forms features of programming courses.

APA, Harvard, Vancouver, ISO, and other styles

13

Crous, Theodorus. "Semantos : a semantically smart information query language." Pretoria : [s.n.], 2008. http://upetd.up.ac.za/thesis/available/etd-11292009-190944/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Wang, Tianze. "Machine Learning for Constraint Programming." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-254660.

Full text

Abstract:

It is well established that designing good heuristics for solving Constraint Programming models requires years of domain experience and a huge amount of trial and error. In this thesis project, we conduct an empirical study of whether Machine Learning and Deep Learning techniques have the potential to help the design of constraint solving heuristics.Specifically, this thesis project examines the potential of Machine Learning and Deep Learning models for the regression task of predicting the makespan and solving time of a Job-Shop Scheduling Problem without actually solving the given Job-Shop Scheduling Problem instance. Several Machine Learning models are tested with manually designed features as input. Different Deep Learning architectures are explored with either just the Job-Shop Scheduling Problem instance as input or with an additional input of the previously designed features.××Results of the experiments justify the potential of several proposed models in predicting the makespan and solving time. For predicting the makespan (unit: machine time unit), the best Random Forest regression model achieves a Mean Squared Error of 0.78 on the test set. The best Deep Learning model achieves a Mean Squared Error of 0.74 on the test set. For predicting the solving time (unit: milliseconds) of a Job-Shop Scheduling Problem, the best Random Forest regression model achieves a Mean Squared Error of 2.12 107 on the test set. The best Deep Learning model achieves a Mean Squared Error of 5.19 107 on the test set.Discussions of the reason behind the difference of different Machine Learning and Deep Learning models are provided and future directions are proposed.
Det är väl etablerat att det kräver många års erfarenhet av domänexpertis och mycket experimentell felsökning för att utforma en bra sökheuristik för villkorsprogrammeringsmodeller. I denna avhandling beskriver vi genomförandet av en empirisk studie med syftet att utreda potentialen av maskininlärningstekniker för att underlätta framtagandet av villkorsprogrammeringslösare.Mer specifikt undersöker vi maskininlärningsmodellers regressionsförmåga att förutse makespanöch lösningstid för "Job-Shop Scheduling Problem"utan att för den delen lösa den givna "Job-Shop Scheduling Problem"instansen. Flertalet maskininlärningsmodeller testas med manuellt framtagna särdrag som indata. Olika djupmaskininlärningsarkitekturer utforskas med antingen bara "Job-Shop Scheduling Problem-instanser som indata eller med ytterliggare indata i form av de manuellt framtagna särdragen.××Experimentresultaten motiverar användandet av flertalet av de föreslagna maskininlärningsmodellerna för att förutse makespanöch lösningstid. För förutsägandet av makespan"(enhet: maskintidsenhet) uppnår den bästa Random Forestregressionsmodellen ett medelkvadratfel på 0,78 på testdatamängden. Den bästa djupmaskininlärningsmodellen uppnår ett medelkvadratfel på 0,74 på testdatamängden. För förutsägandet av lösningstiden (enhet: millisekund) av "Job-Shop Scheduling Problem"uppnår den bästa Random Forestregressionsmodellen ett medelkvadratfel på 2.12 107 på testdatamängden. Den bästa djupmaskininlärningsmodellen uppnår ett medelkvadratfel på 5.19 107 på testdatamängden.Skillnadsorsakerna rörande de olika maskininlärningsmodellernas prestanda diskuteras i avhandlingen samt framtida forskningsinriktningar.

APA, Harvard, Vancouver, ISO, and other styles

15

Mynyk, John. "Information technology programming standards and annual project maintenance costs." Thesis, University of Phoenix, 2014. http://pqdtopen.proquest.com/#viewpdf?dispub=3578624.

Full text

Abstract:

Organizations that depend on the use of IT in their business models must maintain their systems and keep their systems current to survive (Filipek, 2008; Kulkarni, Kumar, Mookerjee, & Sethi, 2009; Unterkalmsteiner et al., 2012). As most IT departments allocate as much as 80% of their budget to maintain stability while leaving only the other 20% to allow improvements (Telea et al., 2010), high cost of stability may be a reason many IT organizations cannot afford efficient staffing and even jeopardize the existence of the organization (Filipek, 2008; Talib, Abdullah, Atan, & Murad, 2010). The purpose of this exploratory mixed methods study was to discover the IT programming standards used in IT departments that predict a decrease in project maintenance costs. This study employed an exploratory mixed methods data collection and analysis to develop and test a collection of universal programming standards. The qualitative portion of the study resulted in a list of IT programming standards from the Fortune 20 companies of 2011. Surveyed from IT departments in the Fortune 500 companies of 2011, the quantitative portion of this study correlate the degree of enforcement of each IT programming standard to a decrease in average project maintenance costs using a backward stepwise regression. Using a 95% confidence interval and a 5% margin of error (α = .05), the backward stepwise regression discarded 18 of the 22 IT programming standards. The remaining correlations give evidence that a) the more the department enforces waiting for feedback the higher the maintenance costs, b) the more the department enforces having the architectural team develop coding guidelines the lower the maintenance costs, and c) the more the IT department enforces the following of change management procedures, the higher the maintenance costs.

APA, Harvard, Vancouver, ISO, and other styles

16

Clarke, James. "Global inference for sentence compression : an integer linear programming approach." Thesis, University of Edinburgh, 2008. http://hdl.handle.net/1842/2384.

Full text

Abstract:

In this thesis we develop models for sentence compression. This text rewriting task has recently attracted a lot of attention due to its relevance for applications (e.g., summarisation) and simple formulation by means of word deletion. Previous models for sentence compression have been inherently local and thus fail to capture the long range dependencies and complex interactions involved in text rewriting. We present a solution by framing the task as an optimisation problem with local and global constraints and recast existing compression models into this framework. Using the constraints we instil syntactic, semantic and discourse knowledge the models otherwise fail to capture. We show that the addition of constraints allow relatively simple local models to reach state-of-the-art performance for sentence compression. The thesis provides a detailed study of sentence compression and its models. The differences between automatic and manually created compression corpora are assessed along with how compression varies across written and spoken text. We also discuss various techniques for automatically and manually evaluating compression output against a gold standard. Models are reviewed based on their assumptions, training requirements, and scalability. We introduce a general method for extending previous approaches to allow for more global models. This is achieved through the optimisation framework of Integer Linear Programming (ILP). We reformulate three compression models: an unsupervised model, a semi-supervised model and a fully supervised model as ILP problems and augment them with constraints. These constraints are intuitive for the compression task and are both syntactically and semantically motivated. We demonstrate how they improve compression quality and reduce the requirements on training material. Finally, we delve into document compression where the task is to compress every sentence of a document and use the resulting summary as a replacement for the original document. For document-based compression we investigate discourse information and its application to the compression task. Two discourse theories, Centering and lexical chains, are used to automatically annotate documents. These annotations are then used in our compression framework to impose additional constraints on the resulting document. The goal is to preserve the discourse structure of the original document and most of its content. We show how a discourse informed compression model can outperform a discourse agnostic state-of-the-art model using a question answering evaluation paradigm.

APA, Harvard, Vancouver, ISO, and other styles

17

Hofuku, Yoyoi, Shinya Cho, Tomohiro Nishida, and Susumu Kanemune. "Why is programming difficult? : proposal for learning programming in “small steps” and a prototype tool for detecting “gaps”." Universität Potsdam, 2013. http://opus.kobv.de/ubp/volltexte/2013/6445/.

Full text

Abstract:

In this article, we propose a model for an understanding process that learners can use while studying programming. We focus on the “small step” method, in which students learn only a few concepts for one program to avoid having trouble with learning programming. We also analyze the difference in the description order between several C programming textbooks on the basis of the model. We developed a tool to detect “gaps” (a lot of concepts to be learned in a program) in programming textbooks.

APA, Harvard, Vancouver, ISO, and other styles

18

Bell, D. A. "Information handling and pattern discovery." Thesis, University of Ulster, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.245331.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Kural, S. Yasemin. "Clustering information retrieval search outputs." Thesis, City University London, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.312900.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Rodrigues, Odinaldo Teixeira. "A methodology for iterated information change." Thesis, Imperial College London, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.285828.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Collier, Robin. "Automatic template creation for information extraction." Thesis, University of Sheffield, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.286986.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Hodge, Victoria J. "Integrating information retrieval & neural networks." Thesis, University of York, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.247019.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Kawalek, John Paul. "User innovation in information systems practice." Thesis, Sheffield Hallam University, 1998. http://shura.shu.ac.uk/19898/.

Full text

Abstract:

Information systems practice in this thesis is seen to involve the everyday use of technology for information purposes. It involves individuals or user groups and specialists in applying and adapting information technology resources. The inclusion of groups other than the Information Systems specialist as playing a role in the practice of information systems, is in part the recognition that information technology is increasingly accessible. It is possible to apply Information Technology in a variety of ways by non-information Systems specialists. This represents a shift in emphasis from the dominant assumption in much of the Information Systems literature that the practice is the sole domain of the Information Systems specialist. Further the thesis makes a critical appraisal of the effects that such an assumption has on the discipline. The perspective argued, is that the discipline has not yet effectively embraced the issues of learning and behaviour, in the context of power relationships in the everyday utilisation of the Information Technologies by non-information Systems specialists. It tends to be entrenched in Information Technology design and development. The methodological debates associated with the underpinning of the discipline has still not embraced organisation based studies which focus on motivations and behaviours of the non-information Systems specialists who have increasingly powerful technology at their disposal. The thesis develops an analysis of behaviours and motivations of non-information Systems specialists. These motivations are termed 'orientations'. By using this construction, the thesis demonstrates that the application of Information Technology can be seen as 'constrained' by social structures and 'political' forces, and as such the applications are limited to haphazard innovations with the technology. One such 'constraint' is the general lack of empathy which is heightened by some of the assumptions and approaches made by the Information Systems discipline. This tends towards the functional aspect of application development, and thereby undervaluing the requirement for learning and critical reflection by those involved in the practice of Information Systems. Findings suggest that despite the availability of powerfultechnology, commonly its use as an effective information tool is constrained and limited.

APA, Harvard, Vancouver, ISO, and other styles

24

Millard, David Edward. "Hypermedia interoperability : navigating the information continuum." Thesis, University of Southampton, 2000. https://eprints.soton.ac.uk/259234/.

Full text

Abstract:

Open Hypermedia Systems are designed to allow links to be authored and followed on top of any media format. The link structures are held separately from the documents in a software component called a Link Server. As hypermedia has matured as a research topic attention has turned to standardising the way in which components talk to Link Servers in order to provide interoperability. The Open Hypermedia Systems Working Group took up this challenge and proposed an Open Hypermedia Protocol (OHP). However, the scope of this proposal proved to be too large and the protocol was divided into domain specific parts (Navigational, Spatial and Taxonomic Hypermedia), tackling each domain differently, but consistently. It is questionable whether this step was the correct one, as the domains share many similar features. In this thesis I present a detailed examination of the information spaces that the OHP was attempting to model (from all these considered hypertext domains), which incorporates notions of both behaviour and context. This examination looks at what it means to navigate around the many dimensions of information, across these domains, and reveals a cohesive and continuous structure that I call the Information Continuum. The Fundamental Open Hypermedia Model (FOHM) is presented, which is capable of representing the structures of this continuum in a consistent and meaningful way. FOHM is coupled with an agent infrastructure to produce an implementation that demonstrates the model being used for cross-domain interoperability.

APA, Harvard, Vancouver, ISO, and other styles

25

Diakonikolaou, George. "Methodological support for developing complex information systems." Thesis, University of Manchester, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.335120.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Tsalgatidou, Aphrodite. "Dynamics of information systems : modelling and verification." Thesis, University of Manchester, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.257152.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Zisman, Andrea. "Information discovery for interoperable autonomous database systems." Thesis, Imperial College London, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.299787.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Cutts, Geoff. "Modelling and analysis of parallel information systems." Thesis, Sheffield Hallam University, 1993. http://shura.shu.ac.uk/19524/.

Full text

Abstract:

This thesis presents an investigation of modelling and analysis of parallel information systems. The research was motivated by the recent developments in networks and powerful, low-cost, desk top multiprocessors. An integrated approach for the construction of parallel information systems was developed which focussed on modelling, verification and simulation of such systems. The thesis demonstrates how Petri nets can be used for the modelling and analysis of entity life histories and parallel information systems, place transition nets for the modelling and analysis of entity life histories and coloured Petri nets for the modelling and analysis of complex parallel information systems. These tools were integrated into a comprehensive framework which allowed for the modelling and analysis of complex parallel information systems and the framework was tested using a comprehensive case study. The thesis concludes that Petri nets are an ideal tool for the modelling and analysis of complex parallel systems. Verification is possible with deadlocks and similar properties being easily identified. Further the transformation rules proved to be beneficial to the process of moving from one model to another. Finally simulation of parallel behaviour was possible because the underlying models captured the notion of parallelism.

APA, Harvard, Vancouver, ISO, and other styles

29

Lindeborg, Christian. "Improved Programming Assignment Assessment with Grading Rubrics." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-254978.

Full text

Abstract:

Oral assessment of lab assignments is a strong tradition in computer science courses at KTH and many other universities. The task of correctly assessing the students’ work tends to fall upon a teaching assistant (TA) who needs to be able to tell whether or not they actually understand the concepts covered by the lab. Previous research indicates that there is a large degree of uncertainty among TAs when performing this assessment, which can lead to unfair grades and uncomfortable situations for both TAs and students. This thesis presents an attempt to improve the situation through the creation of grading rubrics tailor made for three individual labs in computer science courses at KTH to be used during oral assessment. The grading rubrics created were preferred by the majority of TAs who partook in the study and seemed, as seen from their perspective, to improve fairness in assessment.
Muntliga redovisningar av laborationer i programmering och datalogi är en stark tradition på KTH och många andra universitet, där det faller på en labbassistent att bedöma studenternas arbete och avgöra om de har förstått de koncept som laborationen ämnar förmedla. Tidigare forskning har visat att assistenterna ofta är osäkra på hur de ska göra sina bedömningar vilket kan leda till orättvisa betyg och besvärliga situationer för både assistenter och studenter. Denna rapport förmedlar försöket att skapa bedömningsmallar skräddarsydda för tre laborationer i programmering och datalogi på KTH för att användas vid själva redovisningen. Bedömningsmallarna föredrogs av majoriteten av de tillfrågade labbassistenterna och ansågs av dem göra redovisningarna mer rättvisa.

APA, Harvard, Vancouver, ISO, and other styles

30

WINSNES, CASPER, and GUSTAV ZANDER. "Solving Heyawake puzzles using Answer Set Programming." Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-157344.

Full text

Abstract:

Den här rapporten undersöker automatisk lösning av Heyawakepussel genom att använda Answer Set Programming. Heyawake är på många sätt likt det mer välkända Sudoku men har inte blivit lika efterforskat vilket gör spelet väldigt intressant att undersöka.Spelet är bevisat NP-fullständigt så fokus har legat på att implementera lösaren istället för att göra den så snabb som möjligt men endel optimeringar har ändå gjorts.Answer Set Programming ha länge använts för att lösa NP-fullständiga problem och för Heyawake är det möjligt att lösa normalstora pussel väldigt snabbt. För att optimera lösaren krävs djupgående kunskaper om Answer Set Programming-lösaren som används.
This report exmamines automatic solving of Heyawake puzzles usingAnswer Set Programming. Heyawake is somewhat similar to the morewell known Sudoku but has not been as extensively researched whichmakes the game very interesting to examine.The game has previously been proven to be NP-complete so the focushas been on implementing the solver instead of making it fast althoughsome optimizations has been made.Answer Set Programming has long been used to solve NP-completeproblems and for Heyawake it is possible to solve normal sized puzzlesvery fast. Optimizing the solver proved to be hard unless you have extensiveknowledge of the Answer Set Programming solver that is used.

APA, Harvard, Vancouver, ISO, and other styles

31

Russ, Samuel H. "An information-theoretic approach to analysis of computer architectures and compression of instruction memory usage." Diss., Georgia Institute of Technology, 1991. http://hdl.handle.net/1853/13357.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Lycett, Mark Geoffrey. "The development of component-based evolutionary information systems." Thesis, Brunel University, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.266634.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Haynes, Steven R. "Explanation in information systems : a design rationale approach." Thesis, London School of Economics and Political Science (University of London), 2002. http://etheses.lse.ac.uk/2652/.

Full text

Abstract:

This dissertation investigates the relationship between the information systems (IS) development context, and the context in which such systems are used. Misunderstandings and ambiguities emerge in the space between these contexts and often result in construction of systems that fail to meet the requirements and expectations of their intended users. This study explores this problem using an approach derived from three largely separate and distinct fields: explanation facilities in information systems, theories of explanation, and design rationale. Explanation facilities are typically included in knowledge-based information systems, where their purpose is to provide system users with the underlying reasons for why the system reaches a particular conclusion or makes a particular recommendation. Prior research suggests that the presence of an explanation facility leads to increased acceptance of these conclusions and recommendations, therefore enhancing system usability. Theory of explanation is a field of study in which philosophers attempt to describe the unique nature of explanation and to identify criteria for explanation evaluation. Design rationale research is concerned with the capture, representation, and use of the deep domain and artefact knowledge that emerges from the design process. The design rationale approach goes beyond specification and suggests that to understand a system requires knowledge of the arguments that led to its realisation. This study proposes a model of IS explanation structure and content derived from formal theories of explanation with a method for obtaining this content based on design rationale. The study has four goals: to derive a theory of explanation specific to the domain of information systems; to examine this definition empirically through a study involving IS development and management professionals; to investigate in a case study whether the information needed to populate the explanation model can be captured using design rationale techniques; and construction of prototype software to deliver explanations per the proposed framework.

APA, Harvard, Vancouver, ISO, and other styles

34

Patel, Dilipkumar Kantibhai. "Conceptualisation and implementation strategies for effective information systems." Thesis, London South Bank University, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.245123.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Eskandari, Edvin. "Framgångsfaktorer för parprogrammering inom Extreme Programming." Thesis, University of Skövde, School of Humanities and Informatics, 2005. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-1001.

Full text

Abstract:

Det här arbetet har med hjälp av en kvalitativ undersökning tagit fram framgångsfaktorer för parprogrammering. Detta har genomförts med hjälp av intervju samt enkätundersökningar med sex respondenter. Då litteraturen inte behandlar hur parprogrammering kan bli framgångsrikt har detta arbete haft som syfte för att göra detta. Resultatet har kategoriserats i fyra nivåer. Exempel på framtagna framgångsfaktorer är att:

• ledningen måste införskaffa kunskaper om parprogrammering

• projektledaren uppmuntrar till byte av par ofta

• projektdeltagarna är öppna och mottagbara för konstruktiv kritik

APA, Harvard, Vancouver, ISO, and other styles

36

Farshchi, Alvarez Aria Richard, and Fredrik Gölman. "HOW CAN COMPUTER-BASED PROGRAMMING EXAMS BE IMPLEMENTED FOR ENGINEERING STUDENTS?" Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-300127.

Full text

Abstract:

Programmering inkluderar vanligtvis användningen av en dator och en textredigerare, men ändå avslutas programmeringskurser vid högskolor och universitet ofta med traditionella skriftliga tentor för att bedöma studenternas förvärvade praktiska kunskaper. Denna traditionella examineringsmetod begränsar komplexiteten i programmeringsproblem och kan leda till oavsiktliga subjektiva bedömningar. Tidigare studier om datorbaserade programmeringstentor som efterliknar verkliga programmeringsförhållanden tyder på att bedömningen av studenternas förvärvade kunskaper kan effektiviseras samtidigt som både betygs- och administrationsprocesser förenklas. Vi använder Bunges generella vetenskapliga metod och fallstudiemetodik för att utveckla ett system för datorbaserade programmeringstentor som kan implementeras på KTH Kista. Våra resultat tyder på att programmeringstentor kan utföras säkert på studenternas egna datorer genom att starta datorn i en begränsad förkonfigurerad systemmiljö med blockerad internetåtkomst från ett USBminne. Parat med den öppna lärplattformen Moodle kan tentorna administreras elektroniskt och utformas med automatiska rättningssprocesser. För att hjälpa tentavakter utvecklade vi även ett observationsverktyg som kan upptäcka om den begränsade systemmiljön kringgås. Trots uteblivna verkliga tester av systemet på grund av omständigheterna orsakade av den pågående pandemin, drar vi, med stöd av tidigare studier, slutsatsen att vår föreslagna lösning för datorbaserade programmeringstentor kan förbättra kvaliteten och effektiviteten av programmeringskurser och deras examinationsprocesser.
Programming usually includes the use of a computer and a text editor, yet programming courses given at institutions of higher education often conclude with traditional written exams to assess the students’ acquired practical knowledge. This traditional examination method restricts the complexity of programming problems and may result in unintentional subjective assessments. Previous research on computer-based programming exams that mimic real programming conditions suggest that the assessment of the students’ acquired knowledge can be made more efficient while also simplifying both grading and administration processes. We use Bunge’s general scientific method and case study methodology to develop a system for computer-based programming exams that can be implemented at KTH Kista. Our results suggest that programming exams can be safely performed on the students’ own computers by booting the computer into a restricted preconfigured system environment with blocked Internet access from a usb flash drive. Paired with the open-source learning management system Moodle, the exams can be administered electronically and designed with automatic grading processes. To help exam invigilators we also developed an observation tool that can detect if the restricted system environment is circumvented. Despite the lack of real tests of the system due to the circumstances caused by the ongoing pandemic, we conclude, with the support of previous studies, that our proposed solution for computer-based programming exams can improve the quality and efficiency of programming courses and their examination processes.

APA, Harvard, Vancouver, ISO, and other styles

37

Pagonis, Antonis. "An efficient visualisation mechanism for communication network monitoring information." Thesis, Loughborough University, 1999. https://dspace.lboro.ac.uk/2134/13691.

Full text

Abstract:

Most, if not all, of the control and monitoring functions of modern communication network systems are implemented as software. Such software systems are of considerable size and complexity in order to cope with the pre-defined requirements. Effective presentation of results and control of network activities are part of the expected software specifications. This thesis begins with an overvIew of the functions of Network Performance Management. Furthermore, it concentrates on Information Visualisation and its major role in the process of designing useful and usable software for communication network systems. Additional work follows on the author's novel idea of Figural Deformity Visualisation and its potential advantages with respect to network performance data pre-analysis. Figural Deformity (FD) can be a novel way of visualising multiple-variations by employing a single object and gradually deforming its original shape in order to represent relevant mapped parameters. Nevertheless, some research issues are considered before attempting to evaluate the effectiveness of the proposed visual mechanism by conducting user trials with qualified subjects. The thesis continues by presenting a prototype FD-Interface which has been used to collect the required experimental data. The relevant statistical analysis presents strong evidence in favour of the proposed type of user-interfaces. Finally, the work is concluded by presenting an initial implementation of the idea which has been evaluated in one of the largest companies of the British telecommunication industry.

APA, Harvard, Vancouver, ISO, and other styles

38

Holwell, Susan. "Soft systems methodology and its role in information systems." Thesis, Lancaster University, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.364316.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Marinheiro, Rui Miguel Neto. "Using context to integrate hypermedia with information retrieval systems." Thesis, University of Southampton, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.390725.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Griffin, Clive Robert. "The exchange of engineering information using complex data structures." Thesis, London South Bank University, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.357262.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Nielsen, Peter Axel. "Learning and using methodologies in information systems analysis and design." Thesis, Lancaster University, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.291718.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Jayaratne, Nimal Ananda. "A conceptual framework for understanding and evaluating information systems methodologies." Thesis, Heriot-Watt University, 1991. http://hdl.handle.net/10399/1291.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Patel, Nandish V. "Developing living information systems through systems tailorability : deferred systems design." Thesis, Brunel University, 1997. http://bura.brunel.ac.uk/handle/2438/5319.

Full text

Abstract:

An interpretivist investigation of computer-based business information systems was conducted in two commercial companies and two higher education institutes, by using both quantitative questionnaire survey and qualitative interview research methods. The investigation focused on the social and organisational context of information systems development and usage in these organisations. The utility of structured methodologies is now being questioned by some researchers who are calling for alternative approaches, and this investigation draws on that alternative strand of thinking. The collected data primarily reveals that the development and usage of information systems happens in changing organisations, which suggests that the design and usage of information systems must cater for such a changing or dynamic environment. Therefore the data is interpreted using a philosophical outlook encompassing the notion of "living" information systems and Critical Theory, and this philosophical stance regards information technology as liberating human endeavour in organisations. Five sub-concepts and the concept of deferred system's design are derived from the data, which have been formulated to account and cater for change in information systems environments. The concept of deferred system's design encourages the design of information systems which allow for organisational human behaviour, consisting of organisational change, uncertainty, and learning, to be mediated by information technology. A systems design principle called `deferred system's design decisions' is derived to enable designs of tailorable information systems, which may be regarded as one form of living information systems to facilitate such organisational behaviour. An intersubjective theoretical model called the spiral of change model of tailorable information systems is proposed to explain and understand better the changing organisational environment in which information systems must be developed and in which they must function. To inform practice a computer tool is proposed which enables conceptions of " tailorable information systems that employ the principle of deferred system's design decisions and enables modelling changing or dynamic information systems.

APA, Harvard, Vancouver, ISO, and other styles

44

Ojo, Sunday Olusegun. "Information management : a uniform conceptual model and its user interface." Thesis, University of Glasgow, 1985. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.254226.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Seo, Dongsu. "Reuse oriented information systems design paradigm in the TEMPORA environment." Thesis, University of Manchester, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.295663.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Walker, Edward. "Extracting data flow information for parallelizing FORTRAN nested loop kernels." Thesis, University of York, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.239812.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Ip, Saimond. "A knowledge representation approach to information systems analysis and modelling." Thesis, University of Cambridge, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.260555.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Zetterström, Andreas. "Visual Compositional-Relational Programming." Thesis, Uppsala University, Computer Systems Sciences, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-126895.

Full text

Abstract:

In an ever faster changing environment, software developers not only need agile methods, but also agile programming paradigms and tools. A paradigm shift towards declarative programming has begun; a clear indication of this is Microsoft's substantial investment in functional programming. Moreover, several attempts have been made to enable visual programming. We believe that software development is ready for a new paradigm which goes beyond any existing declarative paradigm: visual compositional-relational programming. Compositional-relational programming (CRP) is a purely declarative paradigm -- making it suitable for a visual representation. All procedural aspects -- including the increasingly important issue of parallelization -- are removed from the programmer's consideration and handled in the underlying implementation. The foundation for CRP is a theory of higher-order combinatory logic programming developed by Hamfelt and Nilsson in the 1990's. This thesis proposes a model for visualizing compositional-relational programming. We show that the diagrams are isomorphic with the programs represented in textual form. Furthermore, we show that the model can be used to automatically generate code from diagrams, thus paving the way for a visual integrated development environment for CRP, where programming is performed by combining visual objects in a drag-and-drop fashion. At present, we implement CRP using Prolog. However, in future we foresee an implementation directly on one of the major object-oriented frameworks, e.g. the .NET platform, with the aim to finally launch relational programming into large-scale systems development.

APA, Harvard, Vancouver, ISO, and other styles

49

Kallur, Ramegowda Sunil. "Re-configurable hardware programming in a protocol processor unit." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-186731.

Full text

Abstract:

Reconfigurable hardware architectures have been a research topic for many years. Programming such architectures requires manual low level coding or the design of custom compilers to generate the required configuration data for the architecture. In general, a protocol processor processes the packets according to the protocol. There are number of protocols like Ethernet and CPRI to define how the data has to be sent and received between the source and destination points. Data packets can be processed using generic processors programmed in software, but hardware processing is always faster and energy efficient. A compiler/mapper is investigated in this thesis work. The language application is developed using a parser generator tool called Antlr. The grammar is written in Extended Backus Naur Form (EBNF) and the corresponding language is used to describe the architecture and the protocols. The tool will generate a hardware model and its interconnections in SystemC TLM2.0 based on the protocol description. The hardware model is connected to Universal Verification Methodology (UVM) driver and functionality is verified by simulation. The Ethernet protocol is described using the developed language and the complete framework is verified.

APA, Harvard, Vancouver, ISO, and other styles

50

Kopanas, Vassilios. "Relational database support for a rule based approach to information systems." Thesis, University of Manchester, 1991. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.358052.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic 'Computer programming, informatic'

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