Reasoning about real-time repetitions: terminating and nonterminating

It is common for a real-time system to contain a nonterminating process monitoring an input and controlling an output. Hence, a real-time program development method needs to support nonterminating repetitions. In this paper we develop a general proof rule for reasoning about possibly nonterminating repetitions. The rule makes use of a Floyd-Hoare-style loop invariant that is maintained by each iteration of the repetition, a Jones-style relation between the pre- and post-states on each iteration, and a deadline specifying an upper bound on the starting time of each iteration. The general rule is proved correct with respect to a predicative semantics. In the case of a terminating repetition the rule reduces to the standard rule extended to handle real time. Other special cases include repetitions whose bodies are guaranteed to terminate, nonterminating repetitions with the constant true as a guard, and repetitions whose termination is guaranteed by the inclusion of a fixed deadline. (C) 2002 Elsevier Science B.V. All rights reserved.

Hypercapitalism: Language, new media and social perceptions of value

Using examples from contempoary policy and business discourses, and exemplary historical texts dealing with the notion of value, I put forward an argument as to why a critical scholarship that draws on media history, language analysis, philosophy and political economy is necessary to understand the dynamics of what is being called 'the global knowledge economy'. I argue that the social changes associated with new modes of value determination are closely associated with new media form.

What is the value of firms' prior knowledge? Building organisational knowledge capabilities

A firm's prior knowledge facilitates the absorption of new knowledge, thereby renewing a firm's systematic search, transfer and absorption capabilities. The rapidly expanding field of biotechnology is characterised by the convergence of disparate sciences and technologies. This paper, the shift from proteinbased to DNA-based diagnostic technologies, quantifies the value of a firm's prior knowledge and its relation to future knowledge development. Four dimensions of diagnostic and four dimensions of knowledge in biotechnology firms are analysed. A simple scaled matrix method is developed to quantify the positive and negative heuristic values of prior scientific and technological knowledge that is useful for the acquisition and absorption of new knowledge.

Corporate stadium sponsorships, signaling theory, agency conflicts, and shareholder wealth

Contrary to the plethora of critical articles recently appearing in both the popular and business press, this carefully controlled investigation of 49 stadium- and arena-naming-rights agreement announcements provides striking evidence that such sponsorships can significantly enhance the stock prices of sponsoring companies. Indeed, the results of the study show that the average stadium sponsor's stock prices increased by 1.65 percent at the time of announcement of the programs-a result considerably in excess of the returns associated with other major marketing programs such as the signing of Olympic sponsorships and celebrity endorsers. A multiple regression analysis employing firm-specific changes in stock prices as the dependent variable and quantifiable corporate and sponsorship-related attributes as independent variables is also presented. Variables positively and significantly correlated with perceived sponsorship success include team-winning percentages, contract length, and high technology and locally based companies. Overall, the findings of the study are consistent with the novel hypothesis that, for some firms, the real value-added of a stadium sponsorship may lie in its ability to serve as an effective or honest signal of managerial confidence in the future of the company.

The nexus of value chain integration and e-business applications on public sector agriculture R&D management

We examine the potential impact of interconnectivity of value chain partnerships through electronic means (e-business practices) on the management of Public Sector Agriculture R&D in Australia. We review the changing forms of managing research and development, the forces driving these changes, and R&D processes that are theoretically consistent with the move towards value chain involvement and the increase in active constituents in Public Sector Agriculture R&D. We then explore the potential of emerging e-business models to change the patterns of inter-connectivity, speed and omnipresence of partners in the value chain. Three e-business R&D management practices are identified that provide the prerequisite flexibility necessary to take advantage of opportunistic markets. These R&D business practices are: compressing R&D to reduce time to market, fostering co-development to enter a market at the last moment and building flexible products that allow adjustment at the last possible moment. Some fundamental reallocation of existing resources will be required to meet these markets. Implications of these e-business practices for R&D management are discussed.

Boundary value problems for systems of difference equations associated with systems of second-order ordinary differential equations

We study difference equations which arise as discrete approximations to two-point boundary value problems for systems of second-order ordinary differential equations. We formulate conditions which guarantee a priori bounds on first differences of solutions to the discretized problem. We establish existence results for solutions to the discretized boundary value problems subject to nonlinear boundary conditions. We apply our results to show that solutions to the discrete problem converge to solutions of the continuous problem in an aggregate sense. (C) 2002 Elsevier Science Ltd. All rights reserved.

Existence of multiple solutions for second-order discrete boundary value problems

We give conditions on f involving pairs of discrete lower and discrete upper solutions which lead to the existence of at least three solutions of the discrete two-point boundary value problem yk+1 - 2yk + yk-1 + f (k, yk, vk) = 0, for k = 1,..., n - 1, y0 = 0 = yn,, where f is continuous and vk = yk - yk-1, for k = 1,..., n. In the special case f (k, t, p) = f (t) greater than or equal to 0, we give growth conditions on f and apply our general result to show the existence of three positive solutions. We give an example showing this latter result is sharp. Our results extend those of Avery and Peterson and are in the spirit of our results for the continuous analogue. (C) 2002 Elsevier Science Ltd. All rights reserved.

Difference equations associated with fully nonlinear boundary value problems for second order ordinary differential equations

We study the continuous problem y"=f(x,y,y'), xc[0,1], 0=G((y(0),y(1)),(y'(0), y'(1))), and its discrete approximation (y(k+1)-2y(k)+y(k-1))/h(2) =f(t(k), y(k), v(k)), k = 1,..., n-1, 0 = G((y(0), y(n)), (v(1), v(n))), where f and G = (g(0), g(1)) are continuous and fully nonlinear, h = 1/n, v(k) = (y(k) - y(k-1))/h, for k =1,..., n, and t(k) = kh, for k = 0,...,n. We assume there exist strict lower and strict upper solutions and impose additional conditions on f and G which are known to yield a priori bounds on, and to guarantee the existence of solutions of the continuous problem. We show that the discrete approximation also has solutions which approximate solutions of the continuous problem and converge to the solution of the continuous problem when it is unique, as the grid size goes to 0. Homotopy methods can be used to compute the solution of the discrete approximation. Our results were motivated by those of Gaines.

A formal model of real-time program compilation

Program compilation can be formally defined as a sequence of equivalence-preserving transformations, or refinements, from high-level language programs to assembler code, Recent models also incorporate timing properties, but the resulting formalisms are intimidatingly complex. Here we take advantage of a new, simple model of real-time refinement, based on predicate transformer semantics, to present a straightforward compilation formalism that incorporates real-time constraints. (C) 2002 Elsevier Science B.V. All rights reserved.

A real symmetric Lanczos subspace implementation of quantum scattering using boundary inhomogeneities

We present an efficient and robust method for calculating state-to-state reaction probabilities utilising the Lanczos algorithm for a real symmetric Hamiltonian. The method recasts the time-independent Artificial Boundary Inhomogeneity technique recently introduced by Jang and Light (J. Chem. Phys. 102 (1995) 3262) into a tridiagonal (Lanczos) representation. The calculation proceeds at the cost of a single Lanczos propagation for each boundary inhomogeneity function and yields all state-to-state probabilities (elastic, inelastic and reactive) over an arbitrary energy range. The method is applied to the collinear H + H-2 reaction and the results demonstrate it is accurate and efficient in comparison with previous calculations. (C) 2002 Elsevier Science B.V. All rights reserved.

Chebyshev real wave packet propagation: H+O-2 (J=0) state-to-state reactive scattering calculations

In this paper we explore the relative performance of two recently developed wave packet methodologies for reactive scattering, namely the real wave packet Chebyshev domain propagation of Gray and Balint-Kurti [J. Chem. Phys. 108, 950 (1998)] and the Lanczos subspace wave packet approach of Smith [J. Chem. Phys. 116, 2354 (2002); Chem. Phys. Lett. 336, 149 (2001)]. In the former method, a modified Schrodinger equation is employed to propagate the real part of the wave packet via the well-known Chebyshev iteration. While the time-dependent wave packet from the modified Schrodinger equation is different from that obtained using the standard Schrodinger equation, time-to-energy Fourier transformation yields wave functions which differ only trivially by normalization. In the Lanczos subspace approach the linear system of equations defining the action of the Green operator may be solved via either time-dependent or time-independent methods, both of which are extremely efficient due to the simple tridiagonal structure of the Hamiltonian in the Lanczos representation. The two different wave packet methods are applied to three dimensional reactive scattering of H+O-2 (total J=0). State-to-state reaction probabilities, product state distributions, as well as initial-state-resolved cumulative reaction probabilities are examined. (C) 2002 American Institute of Physics.