Factors affecting e-payment adoption in Nigeria

For e-commerce to be successful, an efficient e-payment system is the key. The use of formal payment systems also enhances the ability to execute and manage monetary policies, which is essential for a country’s financial sector. Although Nigeria is a regional leader, the usage of e-Payments is still very low despite its many benefits and also attempts by the financial authorities. This therefore calls for an urgent need to investigate the factors that affect individual’s intention to adopt e-payment in Nigeria so that steps can be fashioned out to improve the situation. A survey was conducted to get individual perceptions of e-payments through the use of questionnaires designed based on the theoretical model developed. The results showed that awareness, knowledge of benefits, ease of use, reliability, trust and security, acceptability, accessibility and social influence are the main factors that influence individuals’ intention to adopt e-payments.

The effective use of implicit parallelism through the use of an object-oriented programming language

This thesis explores translating well-written sequential programs in a subset of the Eiffel programming language - without syntactic or semantic extensions - into parallelised programs for execution on a distributed architecture. The main focus is on constructing two object-oriented models: a theoretical self-contained model of concurrency which enables a simplified second model for implementing the compiling process. There is a further presentation of principles that, if followed, maximise the potential levels of parallelism. Model of Concurrency. The concurrency model is designed to be a straightforward target for mapping sequential programs onto, thus making them parallel. It aids the compilation process by providing a high level of abstraction, including a useful model of parallel behaviour which enables easy incorporation of message interchange, locking, and synchronization of objects. Further, the model is sufficient such that a compiler can and has been practically built. Model of Compilation. The compilation-model's structure is based upon an object-oriented view of grammar descriptions and capitalises on both a recursive-descent style of processing and abstract syntax trees to perform the parsing. A composite-object view with an attribute grammar style of processing is used to extract sufficient semantic information for the parallelisation (i.e. code-generation) phase. Programming Principles. The set of principles presented are based upon information hiding, sharing and containment of objects and the dividing up of methods on the basis of a command/query division. When followed, the level of potential parallelism within the presented concurrency model is maximised. Further, these principles naturally arise from good programming practice. Summary. In summary this thesis shows that it is possible to compile well-written programs, written in a subset of Eiffel, into parallel programs without any syntactic additions or semantic alterations to Eiffel: i.e. no parallel primitives are added, and the parallel program is modelled to execute with equivalent semantics to the sequential version. If the programming principles are followed, a parallelised program achieves the maximum level of potential parallelisation within the concurrency model.

An operational approach to object-oriented software development

The traditional waterfall software life cycle model has several weaknesses. One problem is that a working version of a system is unavailable until a late stage in the development; any omissions and mistakes in the specification undetected until that stage can be costly to maintain. The operational approach which emphasises the construction of executable specifications can help to remedy this problem. An operational specification may be exercised to generate the behaviours of the specified system, thereby serving as a prototype to facilitate early validation of the system's functional requirements. Recent ideas have centred on using an existing operational method such as JSD in the specification phase of object-oriented development. An explicit transformation phase following specification is necessary in this approach because differences in abstractions between the two domains need to be bridged. This research explores an alternative approach of developing an operational specification method specifically for object-oriented development. By incorporating object-oriented concepts in operational specifications, the specifications have the advantage of directly facilitating implementation in an object-oriented language without requiring further significant transformations. In addition, object-oriented concepts can help the developer manage the complexity of the problem domain specification, whilst providing the user with a specification that closely reflects the real world and so the specification and its execution can be readily understood and validated. A graphical notation has been developed for the specification method which can capture the dynamic properties of an object-oriented system. A tool has also been implemented comprising an editor to facilitate the input of specifications, and an interpreter which can execute the specifications and graphically animate the behaviours of the specified systems.

Budgeting, budgetary control and management information in the highways departments

The need for an adequate information system for the Highways Departments in the United Kingdom has been recognised by the report of a committee presented to the Minister of Transport in 1970, (The Marshall Report). This research aims to present a comprehensive information system on a sound theoretical basis which should enable the different levels of management to execute their work adequately. The suggested system presented in this research covers the different functions of the Highways Department, and presents a suggested solution for problems which may occur during the planning and controlling of work in the different locations of the Highways Department. The information system consists of:- 1. A coding system covering the cost units, cost centres and cost elements. 2. Cost accounting records for the cost units and cost centres. 3. A budgeting and budgetary control system covering, the different planning methods and procedures which are required for preparing the capital expenditure budget, the improvement and maintenance operation flexible budgets and programme of work, the plant budget, the administration budget, and the purchasing budget. 4. A reporting system which ensures that the different levels of management are receiving relevant and timely information. 5. The flow of documents which covers the relationship between the prime documents, the cost accounting records, budgets, reports and their relation to the different sections and offices within the department. A comprehensive cost units, cost centres, and cost elements codes together with a number of examples demonstrating the results of the survey, and examples of the application and procedures of the suggested information system have been illustrated separately as appendices. The emphasis is on the information required for internal control by management personnel within the County Council.

Toward the atomistic simulation of T cell epitopes automated construction of MHC:peptide structures for free energy calculations

Epitopes mediated by T cells lie at the heart of the adaptive immune response and form the essential nucleus of anti-tumour peptide or epitope-based vaccines. Antigenic T cell epitopes are mediated by major histocompatibility complex (MHC) molecules, which present them to T cell receptors. Calculating the affinity between a given MHC molecule and an antigenic peptide using experimental approaches is both difficult and time consuming, thus various computational methods have been developed for this purpose. A server has been developed to allow a structural approach to the problem by generating specific MHC:peptide complex structures and providing configuration files to run molecular modelling simulations upon them. A system has been produced which allows the automated construction of MHC:peptide structure files and the corresponding configuration files required to execute a molecular dynamics simulation using NAMD. The system has been made available through a web-based front end and stand-alone scripts. Previous attempts at structural prediction of MHC:peptide affinity have been limited due to the paucity of structures and the computational expense in running large scale molecular dynamics simulations. The MHCsim server (http://igrid-ext.cryst.bbk.ac.uk/MHCsim) allows the user to rapidly generate any desired MHC:peptide complex and will facilitate molecular modelling simulation of MHC complexes on an unprecedented scale.

How to manual:the valuation of rural travel time savings in least developed countries (LDCs)

The manual is designed to bring out issues that are relevant in the valuation of rural travel time savings in Least Developed Countries (LDCs). It should also be relevant for other developing countries which do not have LDC status but have rural economy features typical of low income developing countries. The manual elaborates step-by-step procedures on how to design and execute studies to estimate the value of time (VoT) savings of rural travellers.

A cross-national investigation into the marketing department's influence within the firm:toward initial empirical generalizations

An ongoing strong debate within the marketing discipline concerns the role of marketing within the firm. It has been frequently reported that the marketing function is in a deep decline. Marketing executives and academics alike are interested in the antecedents of this decline and potential performance consequences of this decline. Recent academic research have started investigations on this important topic. Using studies in single countries innovativeness and accountability of the marketing department has been reported as major antecedents of the influence of the marketing department within the organization. Academic research, however, does not provide convincing evidence for a direct link between this influence and business performance. Instead it shows that market orientation is a crucial intervening variable, as marketing department influence is positively related market orientation, which subsequently positively related to business performance. As noted prior research, however, studies firms in single countries. In this article we execute a cross-national study on the antecedents and performance consequences of marketing department influence in order to derive initial empirical generalizations. This study is executed in seven Western-oriented countries, including USA, UK, The Netherlands, Germany, Sweden, Israel and Australia. The study heavily builds on the framework developed in the 2009 Journal of Marketing article of Verhoef and Leeflang. This framework is tested per country and subsequently meta-analytic tests are used to derive initial empirical generalizations. An important empirical generalization is that innovativeness, the customer-connecting capabilities, and accountability of the marketing department are positively related to marketing department influence. Interestingly, a second initial generalization is that creativity of the marketing negative induces less influence. Our results also show a third empirical generalization in that firms having a CEO with a marketing background tend to have more influential marketing departments. Confirming prior research a fourth initial empirical generalization is that MD influence measures and market orientation are positively related. Market orientation is subsequently positively related to business performance. Our most important generalization is, however, that MD influence is positively related to business performance. Hence, beyond striving to become market oriented, firms should also aim to have strong marketing departments. These departments can create a stronger focus on the customer and can also coordinate marketing efforts. In order to become more influential marketing departments should: (1) acquire innovative capabilities, (2) be more connected to customers, (3) invest in accountability, and (4) be careful with be careful being too creative.

Pragmatic development of service based real-time change data capture

This thesis makes a contribution to the Change Data Capture (CDC) field by providing an empirical evaluation on the performance of CDC architectures in the context of realtime data warehousing. CDC is a mechanism for providing data warehouse architectures with fresh data from Online Transaction Processing (OLTP) databases. There are two types of CDC architectures, pull architectures and push architectures. There is exiguous data on the performance of CDC architectures in a real-time environment. Performance data is required to determine the real-time viability of the two architectures. We propose that push CDC architectures are optimal for real-time CDC. However, push CDC architectures are seldom implemented because they are highly intrusive towards existing systems and arduous to maintain. As part of our contribution, we pragmatically develop a service based push CDC solution, which addresses the issues of intrusiveness and maintainability. Our solution uses Data Access Services (DAS) to decouple CDC logic from the applications. A requirement for the DAS is to place minimal overhead on a transaction in an OLTP environment. We synthesize DAS literature and pragmatically develop DAS that eciently execute transactions in an OLTP environment. Essentially we develop effeicient RESTful DAS, which expose Transactions As A Resource (TAAR). We evaluate the TAAR solution and three pull CDC mechanisms in a real-time environment, using the industry recognised TPC-C benchmark. The optimal CDC mechanism in a real-time environment, will capture change data with minimal latency and will have a negligible affect on the database's transactional throughput. Capture latency is the time it takes a CDC mechanism to capture a data change that has been applied to an OLTP database. A standard definition for capture latency and how to measure it does not exist in the field. We create this definition and extend the TPC-C benchmark to make the capture latency measurement. The results from our evaluation show that pull CDC is capable of real-time CDC at low levels of user concurrency. However, as the level of user concurrency scales upwards, pull CDC has a significant impact on the database's transaction rate, which affirms the theory that pull CDC architectures are not viable in a real-time architecture. TAAR CDC on the other hand is capable of real-time CDC, and places a minimal overhead on the transaction rate, although this performance is at the expense of CPU resources.

Combining algorithms to predict bacterial protein sub-cellular location:parallel versus concurrent implementations

We describe a novel and potentially important tool for candidate subunit vaccine selection through in silico reverse-vaccinology. A set of Bayesian networks able to make individual predictions for specific subcellular locations is implemented in three pipelines with different architectures: a parallel implementation with a confidence level-based decision engine and two serial implementations with a hierarchical decision structure, one initially rooted by prediction between membrane types and another rooted by soluble versus membrane prediction. The parallel pipeline outperformed the serial pipeline, but took twice as long to execute. The soluble-rooted serial pipeline outperformed the membrane-rooted predictor. Assessment using genomic test sets was more equivocal, as many more predictions are made by the parallel pipeline, yet the serial pipeline identifies 22 more of the 74 proteins of known location.

An improved memory management scheme for large scale graph computing engine GraphChi

GraphChi is the first reported disk-based graph engine that can handle billion-scale graphs on a single PC efficiently. GraphChi is able to execute several advanced data mining, graph mining and machine learning algorithms on very large graphs. With the novel technique of parallel sliding windows (PSW) to load subgraph from disk to memory for vertices and edges updating, it can achieve data processing performance close to and even better than those of mainstream distributed graph engines. GraphChi mentioned that its memory is not effectively utilized with large dataset, which leads to suboptimal computation performances. In this paper we are motivated by the concepts of 'pin ' from TurboGraph and 'ghost' from GraphLab to propose a new memory utilization mode for GraphChi, which is called Part-in-memory mode, to improve the GraphChi algorithm performance. The main idea is to pin a fixed part of data inside the memory during the whole computing process. Part-in-memory mode is successfully implemented with only about 40 additional lines of code to the original GraphChi engine. Extensive experiments are performed with large real datasets (including Twitter graph with 1.4 billion edges). The preliminary results show that Part-in-memory mode memory management approach effectively reduces the GraphChi running time by up to 60% in PageRank algorithm. Interestingly it is found that a larger portion of data pinned in memory does not always lead to better performance in the case that the whole dataset cannot be fitted in memory. There exists an optimal portion of data which should be kept in the memory to achieve the best computational performance.

Measures of process harmonization

Context Many large organizations juggle an application portfolio that contains different applications that fulfill similar tasks in the organization. In an effort to reduce operating costs, they are attempting to consolidate such applications. Before consolidating applications, the work that is done with these applications must be harmonized. This is also known as process harmonization. Objective The increased interest in process harmonization calls for measures to quantify the extent to which processes have been harmonized. These measures should also uncover the factors that are of interest when harmonizing processes. Currently, such measures do not exist. Therefore, this study develops and validates a measurement model to quantify the level of process harmonization in an organization. Method The measurement model was developed by means of a literature study and structured interviews. Subsequently, it was validated through a survey, using factor analysis and correlations with known related constructs. Results As a result, a valid and reliable measurement model was developed. The factors that are found to constitute process harmonization are: the technical design of the business process and its data, the resources that execute the process, and the information systems that are used in the process. In addition, strong correlations were found between process harmonization and process standardization and between process complexity and process harmonization. Conclusion The measurement model can be used by practitioners, because it shows them the factors that must be taken into account when harmonizing processes, and because it provides them with a means to quantify the extent to which they succeeded in harmonizing their processes. At the same time, it can be used by researchers to conduct further empirical research in the area of process harmonization.

A new VRPPD model and a hybrid heuristic solution approach for e-tailing

We analyze a business model for e-supermarkets to enable multi-product sourcing capacity through co-opetition (collaborative competition). The logistics aspect of our approach is to design and execute a network system where “premium” goods are acquired from vendors at multiple locations in the supply network and delivered to customers. Our specific goals are to: (i) investigate the role of premium product offerings in creating critical mass and profit; (ii) develop a model for the multiple-pickup single-delivery vehicle routing problem in the presence of multiple vendors; and (iii) propose a hybrid solution approach. To solve the problem introduced in this paper, we develop a hybrid metaheuristic approach that uses a Genetic Algorithm for vendor selection and allocation, and a modified savings algorithm for the capacitated VRP with multiple pickup, single delivery and time windows (CVRPMPDTW). The proposed Genetic Algorithm guides the search for optimal vendor pickup location decisions, and for each generated solution in the genetic population, a corresponding CVRPMPDTW is solved using the savings algorithm. We validate our solution approach against published VRPTW solutions and also test our algorithm with Solomon instances modified for CVRPMPDTW.