Transformation of a Woodworking and Furniture Industrial District in Kampala, Uganda: Dichotomous Development of SME Cluster and Large Firm Sector

Clustering small manufacturers are believed to attain various types of collective efficiency. A woodworking and furniture SME district in Uganda has created a learning environment for artisans to start up their own workshops. In the district workers can access various managerial information including business skills and input materials easily than outside. Hence it attracted new entrants to follow and district growth continued. On contrary large firms are locating separately and dispersedly from SME district and have a negative image to SME. This dichotomy has been created partly through spatial division of two sectors and partly through policy favouritism toward large firms.

Transformation of the Financial Sector in Indonesia

Introduction : The source and deployment of finance are central issues in economic development. Since 1966, when the Soeharto Administration was inaugurated, Indonesian economic development has relied on funds in the form of aid from international organizations and foreign countries. After the 1990s, a further abundant inflow of capital sustained a rapid economic development. Foreign funding was the basis of Indonesian economic growth. This paper will describe the mechanism for allocating funds in the Indonesian economy. It will identify the problems this mechanism generated in the Indonesian experience, and it will attempt to explain why there was a collapse of the financial system in the wake of the Asian Currency Crisis of 1997. History of the Indonesian Financial system The year 1966 saw the emergence of commercial banks in Indonesia. It can be said that before 1966 a financial system hardly existed, a fact commonly attributed to economic disruptions like the consecutive runs of fiscal deficit and hyperinflation under the Soekarno Administration. After 1996, with the inauguration of Soeharto, a regulatory system of financial legislation, e.g. central banking law and banking regulation, was introduced and implemented, and the banking sector that is the basis of the current financial system in Indonesia was built up. 　　　The Indonesian financial structure was significantly altered at the first financial reform of 1983. Between 1966 and 1982, the banking sector consisted of Bank Indonesia (the Central Bank) and the state-owned banks. There was also a system for distributing the abundant public revenue derived from the soaring oil price of the 1970s. The public finance distribution function, incorporated in Indonesian financial system, changed after the successive financial reforms of 1983 and 1988, when there was a move away from the monopoly-market style dominated by state-owned banks (which was a system of public finance distribution that operated at the discretion of the government) towards a modern market mechanism. The five phases of development The Indonesian financial system developed in five phases between 1966 and the present time. The first period (1966-72) was its formative period, the second (1973-82) its policy based finance period under soaring oil prices, the third (1983-91) its financial-reform period, the fourth (1992-97) its period of expansion, and the fifth (1998-) its period of financial restructuring. The first section of this paper summarizes the financial policies operative during each of the periods identified above. In the second section changes to the financial sector in response to policies are examined, and an analysis of these changes shows that an important development of the financial sector occurred during the financial reform period. In the third section the focus of analysis shifts from the general financial sector to particular commercial banks’ performances. In the third section changes in commercial banks’ lending and fund-raising behaviour after the 1990s are analysed by comparing several banking groups in terms of their ownership and foundation time. The last section summarizes the foregoing analyses and examines the problems that remain in the Indonesian financial sector, which is still undergoing restructuring.

The Diversity and Dynamics of Industrial Organisation: Transformation of Local Assemblers in the Vietnamese Motorcycle Industry

This paper focuses on an emerging arm's-length form of industrial organisation in the motorcycle industry, which had traditionally been characterised by tightly integrated form of organisation. By engaging in how this new form of organisation that emerged in China was transferred to Vietnam and evolved in the Vietnamese context, this paper seeks to illustrate how the rise of local firms in developing countries is driving the increased diversity and dynamics of industrial organisation in an industry that had previously been dominated by TNCs from developed countries.

ERP Software Selection Processes: A Case Study in the Metal Transformation Sector

When a firm decides to implement ERP softwares, the resulting consequences can pervade all levels, includ- ing organization, process, control and available information. Therefore, the first decision to be made is which ERP solution must be adopted from a wide range of offers and vendors. To this end, this paper describes a methodology based on multi-criteria factors that directly affects the process to help managers make this de- cision. This methodology has been applied to a medium-size company in the Spanish metal transformation sector which is interested in updating its IT capabilities in order to obtain greater control of and better infor- mation about business, thus achieving a competitive advantage. The paper proposes a decision matrix which takes into account all critical factors in ERP selection.

A program transformation for continuation call-based tabled execution

The advantages of tabled evaluation regarding program termination and reduction of complexity are well known —as are the significant implementation, portability, and maintenance efforts that some proposals (especially those based on suspensión) require. This implementation effort is reduced by program transformation-based continuation cali techniques, at some eñrciency cost. However, the traditional formulation of this proposal by Ramesh and Cheng limits the interleaving of tabled and non-tabled predicates and thus cannot be used as-is for arbitrary programs. In this paper we present a complete translation for the continuation cali technique which, using the runtime support needed for the traditional proposal, solves these problems and makes it possible to execute arbitrary tabled programs. We present performance results which show that CCall offers a useful tradeoff that can be competitive with state-of-the-art implementations.

Towards dynamic term size computation via program transformation

Knowing the size of the terms to which program variables are bound at run-time in logic programs is required in a class of applications related to program optimization such as, for example, recursion elimination and granularity analysis. Such size is difficult to even approximate at compile time and is thus generally computed at run-time by using (possibly predefined) predicates which traverse the terms involved. We propose a technique based on program transformation which has the potential of performing this computation much more efficiently. The technique is based on finding program procedures which are called before those in which knowledge regarding term sizes is needed and which traverse the terms whose size is to be determined, and transforming such procedures so that they compute term sizes "on the fly". We present a systematic way of determining whether a given program can be transformed in order to compute a given term size at a given program point without additional term traversal. Also, if several such transformations are possible our approach allows finding minimal transformations under certain criteria. We also discuss the advantages and present some applications of our technique.

Bridge transformation for continuation call-based tabled execution.

The advantages of tabled evaluation regarding program termination and reduction of complexity are well known —as are the significant implementation, portability, and maintenance efforts that some proposals (especially those based on suspension) require. This implementation effort is reduced by program transformation-based continuation call techniques, at some efficiency cost. However, the traditional formulation of this proposal by Ramesh and Cheng limits the interleaving of tabled and non-tabled predicates and thus cannot be used as-is for arbitrary programs. In this paper we present a complete translation for the continuation call technique which, using the runtime support needed for the traditional proposal, solves these problems and makes it possible to execute arbitrary tabled programs. We present performance results which show that CCall offers a useful tradeoff that can be competitive with state-of-the-art implementations.

Automatic compile-time parallelization of CLP programs by analysis and transformation to a concurrent constraint language.

The concept of independence has been recently generalized to the constraint logic programming (CLP) paradigm. Also, several abstract domains specifically designed for CLP languages, and whose information can be used to detect the generalized independence conditions, have been recently defined. As a result we are now in a position where automatic parallelization of CLP programs is feasible. In this paper we study the task of automatically parallelizing CLP programs based on such analyses, by transforming them to explicitly concurrent programs in our parallel CC platform (CIAO) as well as to AKL. We describe the analysis and transformation process, and study its efficiency, accuracy, and effectiveness in program parallelization. The information gathered by the analyzers is evaluated not only in terms of its accuracy, i.e. its ability to determine the actual dependencies among the program variables, but also of its effectiveness, measured in terms of code reduction in the resulting parallelized programs. Given that only a few abstract domains have been already defined for CLP, and that none of them were specifically designed for dependency detection, the aim of the evaluation is not only to asses the effectiveness of the available domains, but also to study what additional information it would be desirable to infer, and what domains would be appropriate for further improving the parallelization process.

A technique for dynamic term size computation via program transformation

Knowing the size of the terms to which program variables are bound at run-time in logic programs is required in a class of applications related to program optimization such as, for example, granularity analysis and selection among different algorithms or control rules whose performance may be dependent on such size. Such size is difficult to even approximate at compile time and is thus generally computed at run-time by using (possibly predefined) predicates which traverse the terms involved. We propose a technique based on program transformation which has the potential of performing this computation much more efficiently. The technique is based on finding program procedures which are called before those in which knowledge regarding term sizes is needed and which traverse the terms whose size is to be determined, and transforming such procedures so that they compute term sizes "on the fly". We present a systematic way of determining whether a given program can be transformed in order to compute a given term size at a given program point without additional term traversal. Also, if several such transformations are possible our approach allows finding minimal transformations under certain criteria. We also discuss the advantages and applications of our technique and present some performance results.

Dynamic term size computation in logic programs via program transformation

Knowing the size of the terms to which program variables are bound at run-time in logic programs is required in a class of applications related to program optimization such as, for example, recursion elimination and granularity analysis. Such size is difficult to even approximate at compile time and is thus generally computed at run-time by using (possibly predefined) predicates which traverse the terms involved. We propose a technique based on program transformation which has the potential of performing this computation much more efficiently. The technique is based on finding program procedures which are called before those in which knowledge regarding term sizes is needed and which traverse the terms whose size is to be determined, and transforming such procedures so that they compute term sizes "on the fly". We present a systematic way of determining whether a given program can be transformed in order to compute a given term size at a given program point without additional term traversal. Also, if several such transformations are possible our approach allows finding minimal transformations under certain criteria. We also discuss the advantages and present some applications of our technique.

Remarks on methods for the computation of boundary-element integrals by co-ordinate transformation

It is well known that the evaluation of the influence matrices in the boundary-element method requires the computation of singular integrals. Quadrature formulae exist which are especially tailored to the specific nature of the singularity, i.e. log(*- x0)9 Ijx- JC0), etc. Clearly the nodes and weights of these formulae vary with the location Xo of the singular point. A drawback of this approach is that a given problem usually includes different types of singularities, and therefore a general-purpose code would have to include many alternative formulae to cater for all possible cases. Recently, several authors1"3 have suggested a type independent alternative technique based on the combination of standard Gaussian rules with non-linear co-ordinate transformations. The transformation approach is particularly appealing in connection with the p.adaptive version, where the location of the collocation points varies at each step of the refinement process. The purpose of this paper is to analyse the technique in eference 3. We show that this technique is asymptotically correct as the number of Gauss points increases. However, the method possesses a 'hidden' source of error that is analysed and can easily be removed.

A bi-cubic transformation for the numerical evaluation of the Cauchy principal value integrals in boundary methods

The numerical strategies employed in the evaluation of singular integrals existing in the Cauchy principal value (CPV) sense are, undoubtedly, one of the key aspects which remarkably affect the performance and accuracy of the boundary element method (BEM). Thus, a new procedure, based upon a bi-cubic co-ordinate transformation and oriented towards the numerical evaluation of both the CPV integrals and some others which contain different types of singularity is developed. Both the ideas and some details involved in the proposed formulae are presented, obtaining rather simple and-attractive expressions for the numerical quadrature which are also easily embodied into existing BEM codes. Some illustrative examples which assess the stability and accuracy of the new formulae are included.