The design of a portable programming language

Summary We consider the design of a strongly-typed language with userdefined types in which it is arranged that, given that a type is available, it is immaterial to the user whether it is a user-defined type or one of the primitive types with representations selected by the implementer. This scheme provides unprecedented freedom in choosing the primitive types; by making these machine-dependent we can ensure production of programs that are easily and efficiently portable between computers of different architectures. A general discussion of the implementer's responsibilities in choosing primitive types appropriate to his machine is illustrated by considering implementation choices for translation of the language into BCPL. Finally we discuss the contribution of the language to the solution of the portability problem.     

Microstructure Development of Oxycarbide Composites during Active-Filler-Controlled Polymer Pyrolysis

The microstructure development of a ceramic composite material fabricated by active-filler-controlled polymer pyrolysis (AFCOP) was investigated. During heating of a polysiloxane precursor mixed with titanium powder in argon atmosphere up to 1400°C, thermally induced decomposition of the polymer phase is combined with simultaneous carburization of the transition metal filler. Precipitation of nanocrystalline titanium carbide at the filler particle surface starts above 400°C, and larger, faceted carbide particles have growth above 800°C. A skeleton of turbostratic carbon is formed above 800°C in the polymer-derived silicon oxycarbide matrix from which b-silicon carbide and cristobalite crystallize above 1000°C. A pronounced reduction in linear shrinkage involved in polymer–ceramic conversion is observed. The shrinkage reduction ranges from more than 25% for the filler-free precursor to less than 10% in the presence of 30 vol% of the titanium filler. Thus, active-filler-controlled pyrolysis offers the possibility of controlling shrinkage and porosity formation during polymer–ceramic conversion in order to fabricate bulk components from organometallic polymer precursor systems.     

Exploring US Business Cycles with Bivariate Loops Using Penalized Spline Regression

The phrase business cycle is usually used for short term fluctuations in macroeconomic time series. In this paper we focus on the estimation of business cycles in a bivariate manner by fitting two series simultaneously. The underlying model is thereby nonparametric in that no functional form is prespecified but smoothness of the functions are assumed. The functions are then estimated using penalized spline estimation. The bivariate approach will allow to compare business cycles, check and compare phase lengths and visualize this in forms of loops in a bivariate way. Moreover, the focus is on separation of long and short phase fluctuation, where only the latter is the classical business cycle while the first is better known as Friedman or Goodwin cycle, respectively. Again, we use nonparametric models and fit the functional shape with penalized splines. For the separation of long and short phase components we employ an Akaike criterion.     

A Discrepancy in Analyses of the MSCEIT--Resolving the Mystery and Understanding Its Implications: A Reply to Gignac (2005).

Replies to comments made by G. E. Gignac (see record 2005-06671-010) on the current authors' original article (see record 2003-02341-015). Gignac reanalyzed the factor structure of the Mayer-Salovey-Caruso Emotional Intelligence Test (MSCEIT) and found results that differed from those the authors obtained initially. The authors tracked down the surprising sources of those discrepancies. G. E. Gignac's hierarchical model of emotional intelligence appears promising, and the authors anticipate that further investigations of the MSCEIT factor structure may yield additional information. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

A Simon Effect in Pigeons.

Pigeons pecked left versus right keys contingent upon the color presented at 1 of those locations. Spatial-response latencies were shorter when the color appeared at the same location as the required response than at the opposite location. This Simon effect occurred when the stimulus on the alternative key was constant, varied from trial to trial, or changed when the color cue appeared and when the reinforcement probability for correct responses was the same on corresponding as on noncorresponding trials. Humans performing the same task by touching the keys also showed the Simon effect. These findings demonstrate that for pigeons, too, a relevant symbolic cue activates a spatial code that produces faster responses at the location corresponding with the activated code. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Iterative ultrasonic signal and image deconvolution for estimation of the complex medium response

The ill‐conditioned inverse problem of estimating ultrasonic medium responses by deconvolution of RF signals is investigated. The primary difference between the proposed method and others is that the medium response function is assumed to be complex‐valued rather than restricted to being real‐valued. Derived from the complex medium model, complex Wiener filtering is presented, and a Hilbert transform related limitation to inverse filtering type methods is discussed. We introduce a nonparametric iterative algorithm, the least squares method with point count regularization (LSPC). The algorithm is successfully applied to simulated and experimental data and demonstrates the capability of recovering both the real and imaginary parts of the medium response. The simulation results indicate that the LSPC method can outperform Wiener filters and improve the resolution of the ultrasound system by factors as high as 3.7. Experimental results using a single element transducer and a conventional medical ultrasound system with a linear array transducer show that despite the errors in pulse estimation and the noise in the RF signals, excellent results can be obtained, demonstrating the stability and robustness of the algorithm. © 2006 Wiley Periodicals, Inc. Int J Imaging Syst Technol, 15, 266–277, 2005     

National and international university departmental Web site interlinking

Although many link patterns have been identified at the university level, departmental interlinking has been relatively ignored. Universities are multidisciplinary by nature and various disciplines may employ the Web differently, thus patterns identified at the university level may hide subject differences. Departments are typically subject-oriented, and departmental interlinking may therefore illustrate interesting disciplinary linking patterns, perhaps relating to informal scholarly communication. The aim of this paper is to identify whether and how link patterns differ along country and disciplinary lines between similar disciplines and similar countries. Physics, Chemistry and Biology departments in Australia, Canada and the UK have been chosen. In order to get a holistic picture of departments' Web use profiles and link patterns, five different perspectives are identified and compared for each set of departments. Differences in link patterns are identified along both national and disciplinary lines, and are found to reflect offline phenomena. Along national lines, a likely explanation for the difference is that countries with better research performances make more general use of the Web; and, with respect to international peer interlinking, countries that share more scholarly communication tend to interlink more with each other. Along disciplinary lines, it seems that departments from disciplines which are more willing to distribute their research outputs tend to make more general use of the Web, and also interlink more with their national and international peers.     

A bandwidth latency tradeoff for broadcast and reduction

The “fractional tree” algorithm for broadcasting and reduction is introduced. Its communication pattern interpolates between two well known patterns—sequential pipeline and pipelined binary tree. The speedup over the best of these simple methods can approach two for large systems and messages of intermediate size. For networks which are not very densely connected the new algorithm seems to be the best known method for the important case that each processor has only a single (possibly bidirectional) channel into the communication network.