Design rules for an integratable low-power amplifier/filter combination

In this paper design rules for a circuit topology in which there is an inseparable combination of an amplifier and a filter characteristic, are presented. By intentionally using the capacitance of an already present input sensor for the filtering, the total required integrated capacitance is much less than that in circuits, which have a separately designed amplifier and filter function. Consequently, it is possible to have the advantage of a better integratability. Moreover, less complexity in the design is achieved. The presented circuit shows a current-to-voltage conversion and an inherently controllable second-order low-pass filter characteristic. A discrete realization has been designed to test the circuit. This circuit operates down to a 1 V supply voltage and the transfer shows a 1.8 M currentto-voltage conversion with a bandwidth of 6 kHz. Measurement results of this circuit show that a 63 dB dynamic range can be achieved with a total required integrated capacitance of only 31 pF.     

The Gaussian scale-space paradigm and the multiscale local jet

A representation of local image structure is proposed which takes into account both the image's spatial structure at a given location, as well as its deep structure, that is, its local behaviour as a function of scale or resolution (scale-space). This is of interest for several low-level image tasks. The proposed basis of scale-space, for example, enables a precise local study of interactions of neighbouring image intensities in the course of the blurring process. It also provides an extrapolation scheme for local image data, obtained at a given spatial location and resolution, to a finite scale-space neighbourhood. This is especially useful for the determination of sampling rates and for interpolation algorithms in a multilocal context. Another, particularly straightforward application is image enhancement or deblurring, which is an instance of data extrapolation in the high-resolution direction.A potentially interesting feature of the proposed local image parametrisation is that it captures a trade-off between spatial and scale extrapolations from a given interior point that do not exceed a given tolerance. This (rade-off suggests the possibility of a fairly coarse scale sampling at the expense of a dense spatial sampling large relative spatial overlap of scale-space kernels).The central concept developed in this paper is an equivalence class called the multiscale local jet, which is a hierarchical, local characterisation of the image in a full scale-space neighbourhood. For this local jet, a basis of fundamental polynomials is constructed that captures the scale-space paradigm at the local level up to any given order.     

Parametric estimation of affine deformations of planar shapes

We consider the estimation of affine transformations aligning a known 2D shape and its distorted observation. The classical way to solve this registration problem is to find correspondences between the shapes and then compute the transformation parameters from these landmarks. Here we propose a novel approach where the exact transformation is obtained as the solution of a polynomial system of equations. The method has been tested on synthetic as well as on real images and its robustness in the presence of segmentation errors and additive geometric noise has also been demonstrated. We have successfully applied the method for the registration of hip prosthesis X-ray images. The advantage of the proposed solution is that it is fast, easy to implement, has linear time complexity, works without established correspondences and provides an exact solution regardless of the magnitude of transformation.     

Effects of woody elements on simulated canopy reflectance: Implications for forest chlorophyll content retrieval

An important bio-indicator of actual plant health status, the foliar content of chlorophyll a and b (Cab), can be estimated using imaging spectroscopy. For forest canopies, however, the relationship between the spectral response and leaf chemistry is confounded by factors such as background (e.g. understory), canopy structure, and the presence of non-photosynthetic vegetation (NPV, e.g. woody elements)—particularly the appreciable amounts of standing and fallen dead wood found in older forests. We present a sensitivity analysis for the estimation of chlorophyll content in woody coniferous canopies using radiative transfer modeling, and use the modeled top-of-canopy reflectance data to analyze the contribution of woody elements, leaf area index (LAI), and crown cover (CC) to the retrieval of foliar Cab content. The radiative transfer model used comprises two linked submodels: one at leaf level (PROSPECT) and one at canopy level (FLIGHT). This generated bidirectional reflectance data according to the band settings of the Compact High Resolution Imaging Spectrometer (CHRIS) from which chlorophyll indices were calculated. Most of the chlorophyll indices outperformed single wavelengths in predicting Cab content at canopy level, with best results obtained by the Maccioni index ([R₇₈₀ − R₇₁₀] / [R₇₈₀ − R₆₈₀]). We demonstrate the performance of this index with respect to structural information on three distinct coniferous forest types (young, early mature and old-growth stands). The modeling results suggest that the spectral variation due to variation in canopy chlorophyll content is best captured for stands with medium dense canopies. However, the strength of the up-scaled Cab signal weakens with increasing crown NPV scattering elements, especially when crown cover exceeds 30%. LAI exerts the least perturbations. We conclude that the spectral influence of woody elements is an important variable that should be considered in radiative transfer approaches when retrieving foliar pigment estimates in heterogeneous stands, particularly if the stands are partly defoliated or long-lived.     

Modelling and solving grid resource allocation problem with network resources for workflow applications

A problem of allocating resources of a grid to workflow applications is considered. The problem consists, generally, in allocating distributed grid resources to tasks of a workflow in such a way that the resource demands of each task are satisfied. Grid resources are divided into computational resources and network resources. Computational tasks and transmission tasks of a workflow are distinguished. We present a model of the problem, and an algorithm for finding feasible resource allocations. A numerical example is included, showing the importance of the resource allocation phase on a grid. Some conclusions and directions for future research are given.     

The motivation of information technology consultants: The struggle with social dimensions and identity

Increasingly, customer companies hire external information technology (IT) consultants, often on a special project basis. These consultants are employees of professional service firms, although they receive their assignments from the hiring companies, report to them, and are supervised by them. Using semistructured interviews with 12 IT consultants in Sweden, we examine the factors that influence their work motivation, including the effect of this dual allegiance—to the service firm and to the customer company. The data indicate that the primary motivators are the variety in tasks and the opportunity to influence and/or manage an entire project. Neither monetary incentives nor the consultancy firm norms are strong motivators. A factor that affects work behavior and motivation is the subordinate identity that IT consultants must assume with their powerful clients. The article concludes with practical suggestions for managers who seek to understand what motivates employees who work at a distance, under external control. © 2011 Wiley Periodicals, Inc.     

All normalized anti-monotonic overlap graph measures are bounded

In graph mining, a frequency measure for graphs is anti-monotonic if the frequency of a pattern never exceeds the frequency of a subpattern. The efficiency and correctness of most graph pattern miners relies critically on this property. We study the case where frequent subgraphs have to be found in one graph. Vanetik et al. (Data Min Knowl Disc 13(2):243?C260, 2006) already gave sufficient and necessary conditions for anti-monotonicity of graph measures depending only on the edge-overlaps between the instances of the pattern in a labeled graph. We extend these results to homomorphisms, isomorphisms and homeomorphisms on both labeled and unlabeled, directed and undirected graphs, for vertex- and edge-overlap. We show a set of reductions between the different morphisms that preserve overlap. As a secondary contribution, we prove that the popular maximum independent set measure assigns the minimal possible normalized frequency and we introduce a new measure based on the minimum clique partition that assigns the maximum possible normalized frequency. In that way, we obtain that all normalized anti-monotonic overlap graph measures are bounded from above and below. We also introduce a new measure sandwiched between the former two based on the polynomial time computable Lovász ??-function.     

A computational study of vortex-airfoil interaction using high-order finite difference methods

Simulations of the interaction between a vortex and a NACA0012 airfoil are performed with a stable, high-order accurate (in space and time), multi-block finite difference solver for the compressible Navier-Stokes equations.We begin by computing a benchmark test case to validate the code. Next, the flow with steady inflow conditions are computed on several different grids. The resolution of the boundary layer as well as the amount of the artificial dissipation is studied to establish the necessary resolution requirements. We propose an accuracy test based on the weak imposition of the boundary conditions that does not require a grid refinement.Finally, we compute the vortex-airfoil interaction and calculate the lift and drag coefficients. It is shown that the viscous terms add the effect of detailed small scale structures to the lift and drag coefficients.     

A resource-efficient event algebra

Events play many roles in computer systems, ranging from hardware interrupts, over event-based software architecture, to monitoring and managing of complex systems. In many applications, however, individual event occurrences are not the main point of concern, but rather the occurrences of certain event patterns. Such event patterns can be defined by means of an event algebra, i.e., expressions representing the patterns of interest are built from simple events and operators such as disjunction, sequence, etc.We propose a novel event algebra with intuitive operators (a claim which is supported by a number of algebraic properties). We also present an efficient detection algorithm that correctly detects any expression with bounded memory, which makes this algebra particularly suitable for resource-constrained applications such as embedded systems.