Conditional risk, return and contagion in the banking sector in Asia

This paper investigates risk and return in the banking sector in three Asian markets of Taiwan, China and Hong Kong. The study focuses on the risk-return relation in a conditional factor GARCH-M framework that controls for time-series effects. The factor approach is adopted to incorporate intra-industry contagion and an analysis of spillovers between large banks and small banks. Finally, the study provides evidence on these relations before and after the Asian financial crisis of 1997. The results are generally consistent across the markets and with expectations.

The return to schooling: Estimates from a sample of young Australian twins

This study uses a sample of young Australian twins to examine whether the findings reported in [Ashenfelter, Orley and Krueger, Alan, (1994). 'Estimates of the Economic Return to Schooling from a New Sample of Twins', American Economic Review, Vol. 84, No. 5, pp.1157-73] and [Miller, P.W., Mulvey, C and Martin, N., (1994). 'What Do Twins Studies Tell Us About the Economic Returns to Education?: A Comparison of Australian and US Findings', Western Australian Labour Market Research Centre Discussion Paper 94/4] are robust to choice of sample and dependent variable. The economic return to schooling in Australia is between 5 and 7 percent when account is taken of genetic and family effects using either fixed-effects models or the selection effects model of Ashenfelter and Krueger. Given the similarity of the findings in this and in related studies, it would appear that the models applied by [Ashenfelter, Orley and Krueger, Alan, (1994). 'Estimates of the Economic Return to Schooling from a New Sample of Twins', American Economic Review, Vol. 84, No. 5, pp. 1157-73] are robust. Moreover, viewing the OLS and IV estimators as lower and upper bounds in the manner of [Black, Dan A., Berger, Mark C., and Scott, Frank C., (2000). 'Bounding Parameter Estimates with Nonclassical Measurement Error', Journal of the American Statistical Association, Vol. 95, No.451, pp.739-748], it is shown that the bounds on the return to schooling in Australia are much tighter than in [Ashenfelter, Orley and Krueger, Alan, (1994). 'Estimates of the Economic Return to Schooling from a New Sample of Twins', American Economic Review, Vol. 84, No. 5, pp. 1157-73], and the return is bounded at a much lower level than in the US. (c) 2005 Elsevier B.V. All rights reserved.

Timing analysis of assembler code control-flow paths

Timinganalysis of assembler code is essential to achieve the strongest possible guarantee of correctness for safety-critical, real-time software. Previous work has shown how timingconstrain ts on controlflow paths through high-level language programs can be formalised using the semantics of the statements comprisingthe path. We extend these results to assembler-level code where it becomes possible to not only determine timingconstrain ts, but also to verify them against the known execution times for each instruction. A minimal formal model is developed with both a weakest liberal precondition and a strongest postcondition semantics. However, despite the formalism’s simplicity, it is shown that complex timingb ehaviour associated with instruction pipeliningand iterative code can be modelled accurately.

Programs as paths: An approach to timing constraint analysis

A program can be decomposed into a set of possible execution paths. These can be described in terms of primitives such as assignments, assumptions and coercions, and composition operators such as sequential composition and nondeterministic choice as well as finitely or infinitely iterated sequential composition. Some of these paths cannot possibly be followed (they are dead or infeasible), and they may or may not terminate. Decomposing programs into paths provides a foundation for analyzing properties of programs. Our motivation is timing constraint analysis of real-time programs, but the same techniques can be applied in other areas such as program testing. In general the set of execution paths for a program is infinite. For timing analysis we would like to decompose a program into a finite set of subpaths that covers all possible execution paths, in the sense that we only have to analyze the subpaths in order to determine suitable timing constraints that cover all execution paths.