DSpace Community:https://dspace.lboro.ac.uk/2134/83
Thu, 22 Feb 2018 04:58:58 GMT2018-02-22T04:58:58ZDSpace Community:https://dspace.lboro.ac.uk:443/dspace-jspui/retrieve/921/fpic.jpghttps://dspace.lboro.ac.uk/2134/83
Formal software development tools: an investigation into usabilityhttps://dspace.lboro.ac.uk/2134/31907
Title: Formal software development tools: an investigation into usability
Authors: Kadoda, Gada F.
Abstract: Formal methods are techniques that are firmly based in mathematics, they can be used
to specify and verify computer systems. Formal techniques offer many advantages,
including correctness and productivity over less formal ones. Wide acceptance of
these methods is hindered by their relatively difficult notations and theories. This
thesis takes the view that the availability of usable tools that support formal
techniques plays an important role in promoting their use by a wider community of
software engineers. [Continues.]
Description: A doctoral thesis submitted in partial fulfilment of the requirements for the award of Doctor of Philosophy at Loughborough University.Wed, 01 Jan 1997 00:00:00 GMThttps://dspace.lboro.ac.uk/2134/319071997-01-01T00:00:00ZSoftware development management using metamodels and activity networkshttps://dspace.lboro.ac.uk/2134/31865
Title: Software development management using metamodels and activity networks
Authors: Dawson, Christian W.
Abstract: This thesis develops the concept, management and control of metamodels for the
management of software development projects. Metamodels provide a more flexible
approach for managing and controlling the software engineering process and are based
on the integration of several software development paradigms. Generalised Activity
Networks are used to provide the more powerful planning techniques required for
managing metamodels. In this thesis, both new node logics, that clarify previous work
in this field, and Generalised Activity-on-the-Arrow and Generalised Activity-on-the-Node
representations are developed and defined. Activity-on-the-Node representations
reflect the current mood of the project management industry and allow constraints to be
applied directly to logical dependencies between activities. The Generalised Activity
Networks defined within this thesis can be used as tools to manage risks and
uncertainties in both software developments and general engineering projects. They
reflect the variation and uncertainties in projects more realistically and improve the
planning and scheduling of such projects. [Continues.]
Description: A doctoral thesis submitted in partial fulfilment of the requirements for the award of Doctor of Philosophy at Loughborough University.Sat, 01 Jan 1994 00:00:00 GMThttps://dspace.lboro.ac.uk/2134/318651994-01-01T00:00:00ZTask allocation and job specification in computer systems designhttps://dspace.lboro.ac.uk/2134/31847
Title: Task allocation and job specification in computer systems design
Authors: Ho, Ka-Wai (Kelvin)
Abstract: There are many problems to resolve during the
development of any computer system. Different methodologies
have been devised and developed to deal with these problems.
Many of the commonly used structured design methodologies and
their methods are mainly data-driven and technically
oriented. They fail to address the issue of task allocation
and job design requirements for the end users. They do not
see the whole organization as an open and complex sociotechnical
system, with human activity as an important part of
it. This often results in systems which meet the functional
specifications, but fail to satisfy the social or human
requirements as well as staff aspirations. [Continues.]
Description: A master's thesis submitted in partial fulfilment of the requirements for the award of Master of Philosophy at Loughborough University.Tue, 01 Jan 1991 00:00:00 GMThttps://dspace.lboro.ac.uk/2134/318471991-01-01T00:00:00ZFast consensus for fully distributed multi-agent task allocationhttps://dspace.lboro.ac.uk/2134/28490
Title: Fast consensus for fully distributed multi-agent task allocation
Authors: Turner, Joanna; Meng, Qinggang; Schaefer, Gerald; Soltoggio, Andrea
Abstract: In distributed multi-agent task allocation problems, the time to find a solution and a guarantee of reaching a solution, i.e. an execution plan, is critical to ensure a fast response. The problem is made more difficult by time constraints on tasks and on agents, which may prevent some tasks from being executed. This paper proposes a new distributed consensus-based task allocation algorithm that reduces convergence time with respect to previous methods, i.e. the time required for the network of agents to agree on a task allocation, while maximising the number of allocated tasks. The novel idea is to reduce the time to reach consensus among agents by using a hierarchy or rank-based conflict resolution among agents. Unlike other existing algorithms, this method enables different agents to construct their task schedules using any insertion heuristic, and still guarantee convergence. Simulation results demonstrate that the proposed approach can allocate a greater number of tasks in a shorter time than an established baseline method. Additionally, the analysis delineates dependencies between optimal insertion strategies and number of tasks per agent, providing insights for further optimisation strategies.
Description: This conference paper is closed access until after the conference has taken place.Mon, 01 Jan 2018 00:00:00 GMThttps://dspace.lboro.ac.uk/2134/284902018-01-01T00:00:00Z