Two conceptions of reason

Two conceptions of reason are considered - the planning conception, embodied, for example, in rational choice theory and other familiar paradigms, and the improvisational conception, emerging from work on artificial intelligence and organization theory. Two illustrations are given of the problematic nature of the planning conception: ( 1) the inevitability of incompleteness in contracting and ( 2) the burdens of reason identified by John Rawls. Two diagnoses are provided for these infirmities: ( 1) the inexhaustibility of description and ( 2) the constructed nature of preferences and values. An alternative improvisational model is sketched and risk-spreading and bet-hedging are identified as two of its key technologies.

The network structure of a regional tourism organization: Application of he social network theory in one region of Queensland

Regional tourism organizations (RTOs) plays a central role in planning, coordinating and marketing tourism in many areas, including Queensland, Australia. RTOs rely on interaction with a network of other organizations for their efficient functioning. This paper describes an exploratory case study that develops a method for use of social network analysis techniques to analyse the inter-organizational network in one RTO region in Queensland. Results indicate that differences exist in the structure of inter-organizational links between commercial tourism organizations and planning organizations, between tourism organizations and other sectoral clusters, and between organizations at local, regional and state levels. The results highlight areas or improvement in the role and responsibilities of RTOs in Queensland.

Selecting optimal instantiations of data models - Theory and validation of an ex ante approach

The schema of an information system can significantly impact the ability of end users to efficiently and effectively retrieve the information they need. Obtaining quickly the appropriate data increases the likelihood that an organization will make good decisions and respond adeptly to challenges. This research presents and validates a methodology for evaluating, ex ante, the relative desirability of alternative instantiations of a model of data. In contrast to prior research, each instantiation is based on a different formal theory. This research theorizes that the instantiation that yields the lowest weighted average query complexity for a representative sample of information requests is the most desirable instantiation for end-user queries. The theory was validated by an experiment that compared end-user performance using an instantiation of a data structure based on the relational model of data with performance using the corresponding instantiation of the data structure based on the object-relational model of data. Complexity was measured using three different Halstead metrics: program length, difficulty, and effort. For a representative sample of queries, the average complexity using each instantiation was calculated. As theorized, end users querying the instantiation with the lower average complexity made fewer semantic errors, i.e., were more effective at composing queries. (c) 2005 Elsevier B.V. All rights reserved.

Models of adding relations to an organization structure of a complete K-ary tree

This paper proposes three models of adding relations to an organization structure which is a complete K-ary tree of height H: (i) a model of adding an edge between two nodes with the same depth N, (ii) a model of adding edges between every pair of nodes with the same depth N and (iii) a model of adding edges between every pair of siblings with the same depth N. For each of the three models, an optimal depth N* is obtained by maximizing the total shortening path length which is the sum of shortening lengths of shortest paths between every pair of all nodes. (c) 2005 Elsevier B.V. All rights reserved.