211,855 research outputs found
Technological change and the productivity paradox: The management of new technologies in UK retail banks
No full textThis thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.Successful implementation of new technologies is necessary for survival in today's increasingly competitive banking environment. The banking sector is now the UK's largest investor in new technology. As a result of de-regulation and new technological opportunities, the dominant market position of the traditional banks is under threat from new market entrants. Such organisations are harnessing the latest technology to develop their services, and are not constrained by the costs of running national branch networks and integrating a diverse historical legacy of incompatible computer systems.
This thesis addresses the question of why the massive investment by UK retail banks in information technology is not being translated into significant productivity gains. The issue is referred to in the literature as the IT productivity paradox. It will be argued that the importance of the banks to the economy as a whole, and the position of the industry as the UK's largest investor in new technology, make it a particularly suitable arena in which to study this phenomenon.
Six empirical case studies of recent new technology projects are analysed by the development of grounded theory. The findings indicate that dysfunctional organisational structures and cultures, together with poor management of expertise, combine to sabotage change and constrain the potential of new technology projects. Most significantly, a lack of organisational learning is contributing to the paradox. Even successful projects had limited impact because the lessons learned were not disseminated throughout the organisation. The study concludes that the full potential offered by information technology will continue to elude the banks until their apparently complacent attitude towards organisational change is addressed
Virtual learning environment strategy working group (VLESWG) of Brunel University final report
No full textThe VLE Strategy Working Group (VLESWG) was established in September 2009 by the Information Steering Group (ISG) for the purpose of developing a ‘vision for e-learning’ at Brunel, with particular focus on the best option for the continued provision of a Virtual Learning Environment (VLE)
Mission de M. Brunel en Angleterre
No full textBrunel Clovis. Mission de M. Brunel en Angleterre. In: École pratique des hautes études, Section des sciences historiques et philologiques. Annuaire 1909-1910. 1909. pp. 89-90
Discours de M. Clovis Brunel, Président
No full textBrunel Clovis. Discours de M. Clovis Brunel, Président. In: Comptes rendus des séances de l'Académie des Inscriptions et Belles-Lettres, 92ᵉ année, N. 4, 1948. pp. 481-499
Discours de M. Clovis Brunel, Président
No full textBrunel Clovis. Discours de M. Clovis Brunel, Président. In: Comptes rendus des séances de l'Académie des Inscriptions et Belles-Lettres, 92ᵉ année, N. 4, 1948. pp. 481-499
Computer assisted modelling of linear, integer and separable programming problems
No full textFor mathematical programming (MP) to have greater impact upon the decision making process, MP software systems must offer suitable support in terms of model communication and modelling techniques . In this paper modelling techniques that allow logical restrictions to be modelled in integer programming terms are described and their implications discussed. In
addition it is demonstrated that many classes of non-linearities which are not variable separable may be reformulated in piecewise linear form. It is shown that analysis of bounds is necessary in the following three important contexts: model reduction, formulation of logical restrictions as 0-1 mixed integer programs and reformulation of nonlinear programs as variable separable programs, It is observed that as well as incorporating an interface between the modeller and the optimiser there is a need to make available to the modeller software facilities which support the modelling techniques described here
Geometric continuous patch complexes
No full textA theory of geometric continuity of arbitrary order is presented. Conditions of geometric continuity at a vertex where a number of patches meet are investigated. Geometric continuous patch complexes are introduced as the appropriate setting for the representation of surfaces in CAGD. The theory is applied to the modelling of closed surfaces and the fitting of triangular patches into a geometric continuous patch complex
Linear, integer separable and fuzzy programming problems: a united approach towards automatic reformulation
No full textFor mathematical programming (MP) to have greater impact as a
decision tool, MP software systems must offer suitable support in
terms of model communication and modelling techniques. In this
paper modelling techniques that allow logical restrictions to be
modelled in integer programming terms are described and their
implications discussed. In addition it is demonstrated that many
classes of non-linearities which are not variable separable may be
after suitable algebraic manipulation put in a variable separable
form. The methods of reformulating the fuzzy linear programming
problem as a Max-Min problem is also introduced. It is shown that
analysis of bounds plays a key role in the following four important
contexts: model reduction, reformulation of logical restrictions
as 0-1 mixed integer programs, reformulation of nonlinear programs
as variable separable programs and reformulation of fuzzy linear
programs. It is observed that as well as incorporating an
interface between the modeller and the optimiser there is a need to
make available to the modeller software facilities which support the
model reformulation techniques described here
Adapting the interior point method for the solution of linear programs on high performance computers
No full textIn this paper we describe a unified algorithmic framework for the interior point method (IPM) of solving Linear Programs (LPs) which allows us to adapt it over a range of high performance computer architectures. We set out the reasons as to why IPM makes better use of high performance computer architecture than the sparse simplex method. In the inner iteration of the IPM a search direction is computed using Newton or higher order methods. Computationally this involves solving a sparse symmetric positive definite (SSPD) system of equations. The choice of direct and indirect methods for the solution of this system and the design of data structures to take advantage of coarse grain parallel and massively parallel computer architectures are considered in detail. Finally, we present experimental results of solving NETLIB test problems on examples of these architectures and put forward arguments as to why integration of the system within sparse simplex is beneficial
Branch points, m. Fractions, and rational functions matching both derivatives and values
No full text- …
