Expression of high-molecular-mass neurofilament protein in horse (Equus caballus) spinal ganglion neurons

Spinal ganglion (SG) neurons are subdivided, on the basis of their cytoplasmic aspect at light and electron microscopy, into dark (D) and light (L) neurons. Numerous efforts have been made to find specific markers able to identify D and L neuronal cytotypes. The isolectin B4 (IB4), utilized to identify nonpeptidergic D neurons in mice, unfortunately, has not proved as effective in other species. The 200-kDa neurofilament protein (NF200) is considered as a typical marker of L neurons in the rat, cat, and chick. The aim of this study was to analyze the histological, morphometric, and neurochemical characteristic of NF200-immunoreactive (IR) horse SG neurons, to better characterize them morphologically and functionally. NF200-IR neurons showed two levels (strong and weak) of staining intensity. Most (84%) strongly stained NF200-IR neurons corresponded to L neurons, and showed similar bimodality as in the size distribution study, which seems to indicate a third population of neurons, in addition to the two populations (small and large) previously identified. In triple-staining experiments where NF200 was colocalized with IB4, substance P (SP), and neuronal nitric oxide synthase (nNOS) neuronal markers, most NF200-IR neurons were single stained. On the contrary, most IB4-, SP-, and nNOS-stained neurons were triple labeled and almost equally subdivided between strong and weak NF200-IR with the latter being always smaller in size than strong NF200-IR neurons. In conclusion, horse SG neurons display significant morphometric and neurochemical differences compared with those of rodents.     

A Low‐Memory,Straightforward and Fast Bilateral Filter Through Subsampling in Spatial Domain

In this work we present a new algorithm for accelerating the colour bilateral filter based on a subsampling strategy working in the spatial domain. The base idea is to use a suitable subset of samples of the entire kernel in order to obtain a good estimation of the exact filter values. The main advantages of the proposed approach are that it has an excellent trade‐off between visual quality and speed‐up, a very low memory overhead is required and it is straightforward to implement on the GPU allowing real‐time filtering. We show different applications of the proposed filter, in particular efficient cross‐bilateral filtering, real‐time edge‐aware image editing and fast video denoising. We compare our method against the state of the art in terms of image quality, time performance and memory usage.     

Estimation in X-bar control charts: effects and corrections

This paper presents an approach for improving the control limits of $ \overline{X} $ control charts when the parameters of the process are estimated and the control chart is in operation. In these conditions, the observed average run length (ARL) may be very different from the planned ARL since the parameter estimates may have a larger error. To minimize this problem, the data collected in effective control (phase 2) will be used to re-estimate the parameters with a precision greater than that obtained in phase 1. Thus, we defined a minimum sample size of observations of phase 2, which is constituted of a mixture of two normal distributions that should be used to re-estimate the process parameters. The proposal is illustrated with numerical example.     

ASCE Journal of Management in Engineering: Review of the years 1985–2002

This study considers the content of the papers published by ASCE’s Journal of Management in Engineering, which has witnessed a growth in number of papers and breadth of participation, particularly of international origin, during the 1985–2002 period. The content is analyzed in two main dimensions: the type of subject and its composing topics, and the type of contributors to the journal. The analysis shows the evolution of the engineering management discipline as represented in the journal. Over the years the discipline has been enriched by an increasing number of contributions on corporate strategies and programs, organizational change, and cultures issues, as well as a growing interest in project management topics, such as quality planning and evaluation of alternative project delivery systems. The number of papers by practitioners, initially the largest contributing group to the journal, has declined significantly over the years.     

Introducing QoS awareness in distributed programming: QTcl

A number of distributed applications require communication services with quality of service (QoS) guarantees. Building global‐scale distributed systems with predictable properties is one of the great challenges for computer systems engineering in the new century. Work undertaken within the Internet Engineering Task Force has led to the definition of novel architectural models for the Internet with QoS support. According to these models, the network has to be appropriately configured in order to provide applications with the required performance guarantees. In next‐generation networks, enabling applications to interact with the underlying QoS services is of primary importance. Hence, several special‐purpose application programming interfaces (APIs) have been defined to let applications negotiate QoS parameters across QoS‐capable networks. However, so far, none of these APIs are available in different operating environments. We believe that such features should be embedded in programming environments for distributed applications. In this work we present how we included QoS control features in Tcl, a programming language that has been widely adopted for the development of distributed multimedia applications. Our work has led to the implementation of QTcl, an extended Tcl interpreter that provides programmers with a new set of primitives, in full compliance with the standard SCRAPI programming interface for the RSVP protocol. QTcl in highly portable, in that it enables standard QoS negotiation to be performed in a seamless fashion on the most common operating systems. Copyright © 2003 John Wiley & Sons, Ltd.     

On the Symbolic Reduction of Processes with Cryptographic Functions

We study the reachability problem for cryptographic protocols represented as processes relying on perfect cryptographic functions. We introduce a symbolic reduction system that can handle hashing functions, symmetric keys, and public keys. Desirable properties such as secrecy or authenticity are specified by inserting logical assertions in the processes.We show that the symbolic reduction system provides a flexible decision procedure for finite processes and a reference for sound implementations. The symbolic reduction system can be regarded as a variant of syntactic unification which is compatible with certain set-membership constraints. For a significant fragment of our formalism, we argue that a dag implementation of the symbolic reduction system leads to an algorithm running in nptime thus matching the lower bound of the problem.In the case of iterated or finite control processes, we show that the problem is undecidable in general and in ptime for a subclass of iterated processes that do not rely on pairing. Our technique is based on rational transductions of regular languages and it applies to a class of processes containing the ping-pong protocols studied in 1982 by Dolev, Even and Karp.     

Optimal errors-in-variables filtering

This paper deals with optimal (minimal variance) filtering in an errors-in-variables framework. Differently from many other contexts, errors-in-variables models treat all variables in a symmetric way (no partition of the variables into inputs and outputs is required) and assume additive noise on all the variables. The filtering technique described in this paper can be easily implemented in a recursive way and does not require the use of a Riccati equation at every update. The results of Monte Carlo simulations have shown the effectiveness and consistency of the approach.     

Design and Calibration of an Opto-mechanical Appliance for 3D Non-contact Orthopedic Measurements Part II: Calibration Methodology and Experimental Results

A multistep iterative calibration methodology for the opto-mechanical system introduced in Part I is proposed. The methodology makes use of a monoview coplanar set of control points, whose number has been determined on the basis of both geometrical considerations and the results of a statistical analysis aiming at assessing the procedure stability in the case of noisy image data. The calibration procedure is carried out comparing the theoretical and observed images of the calibration pattern. Both synthetic and real data have been employed to test the calibration procedure, which proved to be accurate and efficient. The experimental results achieved by the calibrated system are satisfactory in terms of measurement precision.