Interpersonal trust and formal controls in low systemic trust societies

This study is concerned with the role of interpersonal trust in management control. On the basis of a questionnaire survey and interviews of senior managers from business organisations in sri lanka, the study explores the control behaviour of superior managers when they trust or distrust their subordinates. Sri lanka, a society in which the dependence on interpersonal trust is high, was chosen for the study to maximise the effect of interpersonal trust.

The findings of this study indicate that a superior's high trust in a subordinate is associated with a low level of monitoring, a high level of social interactions, and a low reliance on formal controls. In contrast, a superior's low level of trust in a subordinate is associated with a high level of monitoring, a low level of social interactions, and a high reliance on formal controls. Because the data emanate from experienced senior managers, these findings are at least indicative of control behaviour of superior managers in sri lanka and possibly of similar countries in asia. An understanding of the control behaviour of managers in this region is particularly important for designing and implementing effective controls systems for firms, subsidiaries, branches or joint-ventures operating in the region.

Development of DAL and DAPL languages for building distributed applications

A common characteristic among parallel/distributed programming languages is that the one language is used to specify not only the overall organisation of the distributed application, but also the functionality of the application. That is, the connectivity and functionality of processes are specified within a single program. Connectivity and functionality are independent aspects of a distributed application. This thesis shows that these two aspects can be specified separately, therefore allowing application designers to freely concentrate on either aspect in a modular fashion. Two new programming languages have been developed for specifying each aspect. These languages are for loosely coupled distributed applications based on message passing, and have been designed to simplify distributed programming by completely removing all low level interprocess communication. A suite of languages and tools has been designed and developed. It includes the two new languages, parsers, a compilation system to generate intermediate C code that is compiled to binary object modules, a run-time system to create, manage and terminate several distributed applications, and a shell to communicate with the run-tune system. DAL (Distributed Application Language) and DAPL (Distributed Application Process Language) are the new programming languages for the specification and development of process oriented, asynchronous message passing, distributed applications. These two languages have been designed and developed as part of this doctorate in order to specify such distributed applications that execute on a cluster of computers. Both languages are used to specify orthogonal components of an application, on the one hand the organisation of processes that constitute an application, and on the other the interface and functionality of each process. Consequently, these components can be created in a modular fashion, individually and concurrently. The DAL language is used to specify not only the connectivity of all processes within an application, but also a cluster of computers for which the application executes. Furthermore, sub-clusters can be specified for individual processes of an application to constrain a process to a particular group of computers. The second language, DAPL, is used to specify the interface, functionality and data structures of application processes. In addition to these languages, a DAL parser, a DAPL parser, and a compilation system have been designed and developed (in this project). This compilation system takes DAL and DAPL programs to generate object modules based on machine code, one module for each application process. These object modules are used by the Distributed Application System (DAS) to instantiate and manage distributed applications. The DAS system is another new component of this project. The purpose of the DAS system is to create, manage, and terminate many distributed applications of similar and different configurations. The creation procedure incorporates the automatic allocation of processes to remote machines. Application management includes several operations such as deletion, addition, replacement, and movement of processes, and also detection and reaction to faults such as a processor crash. A DAS operator communicates with the DAS system via a textual shell called DASH (Distributed Application SHell). This suite of languages and tools allowed distributed applications of varying connectivity and functionality to be specified quickly and simply at a high level of abstraction. DAL and DAPL programs of several processes may require a few dozen lines to specify as compared to several hundred lines of equivalent C code that is generated by the compilation system. Furthermore, the DAL and DAPL compilation system is successful at generating binary object modules, and the DAS system succeeds in instantiating and managing several distributed applications on a cluster.

Logic and The Open Society : revising the place of Tarski’s theory of truth within Popper’s political philosophy

This chapter retraces the way in which the Austrian philosopher Sir Karl Popper came to accept a Correspondence Theory of Truth from the work of the Polish logician and mathematician Alfred Tarski. It is argued that Popper’s use of Tarski’s semantic theory of truth reveals crucial insights into the fundamental characteristics of Popper’s social philosophy.  Quite deceptively, arguments based upon Tarski’s theory of truth appear implicitly throughout the text of The Open Society and Its Enemies (1945). It is then demonstrated how Popper integrated a correspondence theory of truth into a theory of the functions of communicative language that he received from Karl Bühler.

Deep bed filtration : mathematical models and observations

Numerous mathematical models have been developed to evaluate both initial and transient stage removal efficiency of deep bed filters. Microscopic models either using trajectory analysis or convective diffusion equations were used to compute the initial removal efficiency. These models predicted the removal efficiency under favorable filtration conditions quantitatively, but failed to predict the removal efficiency under unfavorable conditions. They underestimated the removal efficiency under unfavorable conditions. Thus, semi-empirical formulations were developed to compute initial removal efficiencies under unfavorable conditions. Also, correction for the adhesion of particles onto filter grains improved the results obtained for removal efficiency from the trajectory analysis. Macroscopic models were used to predict the transient stage removal efficiency of deep bed filters. The O’Melia and Ali1 model assumed that the particle removal is due to filter grains as well as the particles that are already deposited onto the filter grain. Thus, semi-empirical models were used to predict the ripening of filtration. Several modifications were made to the model developed by O’Melia and Ali to predict the deterioration of particle removal during the transient stages of filtration. Models considering the removal of particles under favorable conditions and the accumulation of charges on the filter grains during the transient stages were also developed. This article evaluates those models and their applicability under different operating conditions of filtration.

Surface coverage of filter medium in deep bed filtration : mathematical modelling and experiments

This paper highlights the importance of surface coverage in modeling the removal of particles in deep bed filtration. A model that considers the saturation of sites on which particle deposition occurs is used. Experimental results obtained with monodispersed suspensions of 0.46 and 0.816 μm latex particles at different influent concentrations and ionic strengths were used to calculate the fraction of filter grain surface (β1) on which actual particle deposition occurs. This will be useful in evaluating the filter performance in terms of the utilization of available surface area of the filter medium. Further, the level of dendrite formation of particles on filter grains during filtration is expressed in terms of β1 and the specific surface coverage, θT (the fraction of a filter grain surface that is covered by particles at time T, assuming that the filter grain is covered by a monolayer of particles). This can be used to compare the contribution of deposited particles in the removal efficiency of deep bed filtration for suspensions with different physical and chemical characteristics.

Mathematical tasks and learning goals: examples from Japanese lesson study

This paper explores how to select, or design, the best mathematical task for a given learning goal. Examples are taken from a recent project in Victorian primary schools that employed Japanese lesson study as the means to provide teachers with professional learning within their own classrooms. The discussions by participating teachers and researchers provide some insights into the difficulties and solutions facing teachers intending to improve the critical thinking skills of their pupils. Examples of tasks and goals are provided.

Fuzzy Logic and Geostatistical Techniques for Spatialization of Soil Texture in Region with Rough Terrains

From the geotechnical standpoint, it is interesting to analyse the soil texture in regions with rough terrain due to its relation with the infiltration and runoff processes and, consequently, the effect on erosion processes. The purpose of this paper is to present a methodology that provides the soil texture spatialization by using Fuzzy logic and Geostatistic. The results were correlated with maps drawn specifically for the study area. The knowledge of the spatialization of soil properties, such as the texture, can be an important tool for land use planning in order to reduce the potential soil losses during rain seasons. (c) 2011 Published by Elsevier Ltd. Selection and peer-review under responsibility of Spatial Statistics 2011

Dynamics of experimental populations of native and introduced blowflies (Diptera: Calliphoridae): mathematical modelling and the transition from asymptotic equilibrium to bounded oscillations

The equilibrium dynamics of native and introduced blowflies is modelled using a density-dependent model of population growth that takes into account important features of the life-history in these flies. A theoretical analysis indicates that the product of maximum fecundity and survival is the primary determinant of the dynamics. Cochliomyia macellaria, a blowfly native to the Americas and the introduced Chrysomya megacephala and Chrysomya putoria, differ in their dynamics in that the first species shows a damping oscillatory behavior leading to a one-point equilibrium, whereas in the last two species population numbers show a two-point limit cycle. Simulations showed that variation in fecundity has a marked effect on the dynamics and indicates the possibility of transitions from one-point equilibrium to bounded oscillations and aperiodic behavior. Variation in survival has much less influence on the dynamics.

Mathematical modeling and control of population systems: Applications in biological pest control

The aim of this paper is to apply methods from optimal control theory, and from the theory of dynamic systems to the mathematical modeling of biological pest control. The linear feedback control problem for nonlinear systems has been formulated in order to obtain the optimal pest control strategy only through the introduction of natural enemies. Asymptotic stability of the closed-loop nonlinear Kolmogorov system is guaranteed by means of a Lyapunov function which can clearly be seen to be the solution of the Hamilton-Jacobi-Bellman equation, thus guaranteeing both stability and optimality. Numerical simulations for three possible scenarios of biological pest control based on the Lotka-Volterra models are provided to show the effectiveness of this method. (c) 2007 Elsevier B.V. All rights reserved.

Symbolic power, robotting, and surveilling

Symbolic power is discussed with reference to mathematics and formal languages. Two distinctions are crucial for establishing mechanical and formal perspectives: one between appearance and reality, and one between sense and reference. These distinctions include a nomination of what to consider primary and secondary. They establish the grammatical format of a mechanical and a formal world view. Such views become imposed on the domains addressed by means of mathematics and formal languages. Through such impositions symbolic power of mathematics becomes exercised. The idea that mathematics describes as it prioritises is discussed with reference to robotting and surveillance. In general, the symbolic power of mathematics and formal languages is summarised through the observations: that mathematics treats parts and properties as autonomous, that it dismembers what it addresses and destroys the organic unity around things, and that it simplifies things and reduces them to a single feature. But, whatever forms the symbolic power may take, it cannot be evaluated along a single good-bad axis.