http://hdl.handle.net/10453/46 2013-06-20T02:39:31Z http://hdl.handle.net/10453/19483 Calculating Project Completion in Polynomial Processing Time Copertari, Luis Technology-based organizations and knowledge organizations rely on large activity networks to manage Research & Development (R&D) projects. Avoiding optimistic completion times due to the characteristic Program Evaluation and Review Technique (PERT) assumptions is a problem that can grow exponentially in complexity with the number of activities. A recursive technique that solves the problem in a polynomial number of steps has been developed, assuming that all duration times follow beta distributions. It is important to notice that the only two 100% valid approaches to calculate the project completion time are simulation and the stochastic sum for each and every path in the network. Nevertheless, both require finding the shape parameters, and that is precisely the main contribution of this paper: a system of equations to calculate the shape parameters of each activity and the overall project. 2012-12-12T00:00:00Z http://hdl.handle.net/10453/17711 Information users and usability in the digital age Chowdhury Gobinda; Chowdhury Sudatta Information users and usability constitute the main building blocks of today's electronic information world. This important new text is the first to give a holistic overview of all of the necessary issues relating to information users and the usability of information services in the digital world, including user-centred design, and the characteristics and behaviour of information users. 2011-01-01T00:00:00Z http://hdl.handle.net/10453/12400 Pattern Calculus: Computing with Functions and Structures Jay Barry The pattern calculus is a new foundation for computation, in which the expressive power of functions and of data structures are fruitfully combined within pattern-matching functions. The best of existing foundations focus on either functions (in the lambda-calculus) or on data structures (in Turing machines) or compromise on both (as in object-orientation). By contrast, a small typed pattern calculus supports all the main programming styles, including functional, imperative, object-oriented and query-based styles. Indeed, it may help to support web services, to the extent that these are generic functions applied to partially specified data structures. 2009-01-01T00:00:00Z http://hdl.handle.net/10453/12332 Agent Based Hybrid Intelligent Systems Zhang Zili; Zhang Chengqi 2004-01-01T00:00:00Z