The real-time refinement calculus: A foundation for machine-independent real-time programming

The real-time refinement calculus is an extension of the standard refinement calculus in which programs are developed from a precondition plus post-condition style of specification. In addition to adapting standard refinement rules to be valid in the real-time context, specific rules are required for the timing constructs such as delays and deadlines. Because many real-time programs may be nonterminating, a further extension is to allow nonterminating repetitions. A real-time specification constrains not only what values should be output, but when they should be output. Hence for a program to implement such a specification, it must guarantee to output values by the specified times. With standard programming languages such guarantees cannot be made without taking into account the timing characteristics of the implementation of the program on a particular machine. To avoid having to consider such details during the refinement process, we have extended our real-time programming language with a deadline command. The deadline command takes no time to execute and always guarantees to meet the specified time; if the deadline has already passed the deadline command is infeasible (miraculous in Dijkstra's terminology). When such a realtime program is compiled for a particular machine, one needs to ensure that all execution paths leading to a deadline are guaranteed to reach it by the specified time. We consider this checking as part of an extended compilation phase. The addition of the deadline command restores for the real-time language the advantage of machine independence enjoyed by non-real-time programming languages.

Computer-aided programming using formally specificed design templates

This paper describes a formal component language, used to support automated component-based program development. The components, referred to as templates, are machine processable, meaning that appropriate tool support, such as retrieval support, can be developed. The templates are highly adaptable, meaning that they can be applied to a wide range of problems. Some of the main features of the language are described, including: higher-order parameters; state variable declarations; specification statements and conditionals; applicability conditions and theories; meta-level place holders; and abstract data structures.

Am I being treated fairly by my leaders? The roles of group identification and self-other comparisons in judgements of procedural justice

The current experiment focuses on the roles of social identity and social comparison in perceptions of procedural justice. Participants are randomly allocated to conditions in a 2 (whether the participant has the opportunity to voice an opinion), X 2 (whether the comparison other has the opportunity to voice an opinion), X 2 (whether the comparison other is an ingroup or an outgroup member), between subjects design. Participants are then asked to report the extent to which they perceive the procedure they are involved in to be fair. It is predicted that participants will have a strong feeling of procedural unfairness when they are not given an opportunity by the leader to voice their opinion, but learn that their comparison other is given that opportunity. It is also predicted that the feeling of unfairness should be stronger when the comparison other is an outgroup rather than an ingroup member. Additionally, participants receiving a fair treatment may regard the procedure as fair when their outgoup comparison other receives an unfair treatment. Results support these predictions and reveal that how people make judgments of procedural justice through social comparison is qualified by the social identities of the parties involved.

The programming language python in earth system simulations

-scale vary from a planetary scale and million years for convection problems to 100km and 10 years for fault systems simulations. Various techniques are in use to deal with the time dependency (e.g. Crank-Nicholson), with the non-linearity (e.g. Newton-Raphson) and weakly coupled equations (e.g. non-linear Gauss-Seidel). Besides these high-level solution algorithms discretization methods (e.g. finite element method (FEM), boundary element method (BEM)) are used to deal with spatial derivatives. Typically, large-scale, three dimensional meshes are required to resolve geometrical complexity (e.g. in the case of fault systems) or features in the solution (e.g. in mantel convection simulations). The modelling environment escript allows the rapid implementation of new physics as required for the development of simulation codes in earth sciences. Its main object is to provide a programming language, where the user can define new models and rapidly develop high-level solution algorithms. The current implementation is linked with the finite element package finley as a PDE solver. However, the design is open and other discretization technologies such as finite differences and boundary element methods could be included. escript is implemented as an extension of the interactive programming environment python (see www.python.org). Key concepts introduced are Data objects, which are holding values on nodes or elements of the finite element mesh, and linearPDE objects, which are defining linear partial differential equations to be solved by the underlying discretization technology. In this paper we will show the basic concepts of escript and will show how escript is used to implement a simulation code for interacting fault systems. We will show some results of large-scale, parallel simulations on an SGI Altix system. Acknowledgements: Project work is supported by Australian Commonwealth Government through the Australian Computational Earth Systems Simulator Major National Research Facility, Queensland State Government Smart State Research Facility Fund, The University of Queensland and SGI.

Exchange fairness and employee performance:An examination of the relationship between organizational politics and procedural justice

Data obtained from a manufacturing firm and a newspaper firm in India were used to examine the relationship between organizational politics and procedural justice in three separate studies. Study 1 constructively replicated research on the distinctiveness of the two constructs. Confirmatory factor analyses in which data from the manufacturing firm served as the development sample and data from the newspaper firm served as the validation sample demonstrated the distinctiveness of organizational politics and procedural justice. Study 2 examined the antecedents of the two constructs using data from the manufacturing firm. Structural equation modeling (SEM) results revealed formalization and participation in decision making to be positively related to procedural justice but negatively related to organizational politics. Further, authority hierarchy and spatial distance were positively related to organizational politics but unrelated to procedural justice. Study 3 examined the consequences of the two constructs in terms of task and contextual performance using data from the newspaper firm. Results of SEM analysis revealed procedural justice but not organizational politics to be related to task performance and the contextual performance dimensions of interpersonal facilitation and job dedication. © 2004 Elsevier Inc. All rights reserved.

Combining analytic hierarchy process and goal programming for logistics distribution network design

Logistics distribution network design is one of the major decision problems arising in contemporary supply chain management. The decision involves many quantitative and qualitative factors that may be conflicting in nature. This paper applies an integrated multiple criteria decision making approach to design an optimal distribution network. In the approach, the analytic hierarchy process (AHP) is used first to determine the relative importance weightings or priorities of alternative warehouses with respect to both deliverer oriented and customer oriented criteria. Then, the goal programming (GP) model incorporating the constraints of system, resource, and AHP priority is formulated to select the best set of warehouses without exceeding the limited available resources. In this paper, two commercial packages are used: Expert Choice for determining the AHP priorities of the warehouses, and LINDO for solving the GP model. © 2007 IEEE.