A strategy for blood vessels segmentation based on the threshold which combines statistical and scale space filter. Application to the study of angiogenesis

This paper presents a strategy for segmenting blood vessels based on the threshold, which combines statistics and scale space filter. By incorporating statistical information, the strategy is capable of reducing over-segmentation. We propose a two-stage strategy which involves: (1) optimal selection of window size and (2) optimal selection of scale. We compared our strategy to two commonly used thresholding techniques. Experimental results showed that our method is much more robust and accurate. Our strategy suggested a modification to Otsu's method. In this application the important information to be extracted from images is only the number of blood vessels present in the images. The proposed segmentation technique is tested on manual segmentation, where segmentation errors less than 3% were observed. The work presented in this paper is a part of a global image analysis process. Therefore, these images will be subject to a further morphometrical analysis in order to diagnose and predict automatically malign tumors.     

Model for small superconducting variable-thickness bridge constrictions

We present a simple model to simulate small three-dimensional superconducting constrictions of variable thickness (VTBs) for which the cross-sectional dimensions are of the same order as the length, and both are less than (T). We study the behavior of the modulus of the order parameterf and the supercurrent densityJ _s as a function of the various dimensions. We find that the extent to whichf is depressed in the banks depends on the ratio of width to length of the constriction. We show that even for very abrupt geometries,J _s is not zero andf does not reach its equilibrium value immediately outside the constriction. On the basis of our results, we propose a more general expression for the effective length valid also when all dimensions are of the same order. The calculated values ofdI _c /dT are consistent with experimental data from well-characterized VTBs. We suggest that the discrepancy between the calculated and experimental values ofI _c R _n may be due to the nonuniformity of the normal current density in the constriction.     

Computing the homology of groups: The geometric way

In this paper, we present several algorithms related with the computation of the homology of groups, from a geometric perspective (that is to say, carrying out the calculations by means of simplicial sets and using techniques of Algebraic Topology). More concretely, we have developed some algorithms which, making use of the effective homology   method, construct the homology groups of Eilenberg–MacLane spaces K(G,1)$K(G,1)$ for different groups G$G$, allowing one in particular to determine the homology groups of G$G$.     

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.     

CrAlN coatings deposited by cathodic arc evaporation at different substrate bias

CrAlN is a good candidate as an alternative to conventional CrN coatings especially for high temperature oxidation-resistance applications. Different CrAlN coatings were deposited on hardened steel substrates by cathodic arc evaporation (CAE) from chromium-aluminum targets in a reactive nitrogen atmosphere at negative substrate bias between − 50 and − 400 V. The negative substrate bias has important effects on the deposition growth rate and crystalline structure. All our coatings presented hardness higher than conventional CrN coatings. The friction coefficient against alumina and tungsten carbide balls was around 0.6. The sliding wear coefficient of the CrAlN coatings was very low while an important wear was observed in the balls before a measurable wear were produced in the coatings. This effect was more pronounced as the negative substrate bias was increased.     

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.