Modeling alternative zoning strategies in forest management

To satisfy public demands for environmental values, forest companies are facing the prospect of a reduction in wood supply and increases in costs. Some Canadian provincial governments have proposed intensifying silviculture in special zones dedicated to timber production as the means for pushing out the forest possibility frontiers. In this paper, we compare the traditional two‐zone land allocation framework which includes ecological reserves and integrated forest management zones with the triad — a three‐zone scheme which adds a zone dedicated to intensive timber production. We compare the solutions of the mixed‐integer linear programs formulated under both land‐allocation frameworks. We explore through sensitivity analysis the conditions under which the triad regime can offset the impact on timber production from increased environmental demands. We show that under the realistic conditions characteristic to Coastal British Columbia, higher environmental demands may be satisfied under the triad regime without increasing the financial burdens on the industry or reducing its wood supply. This occurs, however, only if regulatory constraints in timber production zone are flexible.     

Optimal implementations of UPGMA and other common clustering algorithms

In this work we consider hierarchical clustering algorithms, such as UPGMA, which follow the closest-pair joining scheme. We survey optimal O(n²)-time implementations of such algorithms which use a ‘locally closest’ joining scheme, and specify conditions under which this relaxed joining scheme is equivalent to the original one (i.e. ‘globally closest’).     

On the temporal relations between memory scanning and response preparation

Three experiments were conducted to investigate whether response processes can start before memory scanning has finished when both are required in the same task. In Experiment 1 the color of a stimulus letter determined which hand might respond, and the letter's memory set membership determined whether that response should be made or withheld. Electrophysiological data suggested that lateralized response preparation was not initiated until memory scanning finished. Experiment 2 replicated these results with a consistent stimulus-response mapping to make the scanning process easier. Experiment 3 tested for earlier response priming with a probe reaction time paradigm, and the results suggested that color information can be used to activate a response before memory scanning is finished. The results of Experiments 1-3 suggest that interference between memory scanning and response preparation precludes the concurrent operation of these processes.     

Microelectrochemistry on Surfaces with the Scanning Electrochemical Microscope (SECM)

The scanning electrochemical microscope (SECM) is one of the scanning probe techniques that have been developed following the introduction of the scanning tunneling microscope. The approaches that have been used to modify surfaces with lateral resolution using the SECM are presented and discussed. These approaches made it possible to drive a variety of microelectrochemical reactions on surfaces, as well as to study the mechanism of these processes due to the unique advantages that the SECM offers.     

Robust real-time unusual event detection using multiple fixed-location monitors

We present a novel algorithm for detection of certain types of unusual events. The algorithm is based on multiple local monitors which collect low-level statistics. Each local monitor produces an alert if its current measurement is unusual, and these alerts are integrated to a final decision regarding the existence of an unusual event. Our algorithm satisfies a set of requirements that are critical for successful deployment of any large-scale surveillance system. In particular it requires a minimal setup (taking only a few minutes) and is fully automatic afterwards. Since it is not based on objects' tracks, it is robust and works well in crowded scenes where tracking-based algorithms are likely to fail. The algorithm is effective as soon as sufficient low-level observations representing the routine activity have been collected, which usually happens after a few minutes. Our algorithm runs in realtime. It was tested on a variety of real-life crowded scenes. A ground-truth was extracted for these scenes, with respect to which detection and false-alarm rates are reported.     

Inferring the capacity of the vector Poisson channel with a Bernoulli model

The capacity defines the ultimate fidelity limits of information transmission by any system. We derive the capacity of parallel Poisson process channels to judge the relative effectiveness of neural population structures. Because the Poisson process is equivalent to a Bernoulli process having small event probabilities, we infer the capacity of multi-channel Poisson models from their Bernoulli surrogates. For neural populations wherein each neuron has individual innervation, inter-neuron dependencies increase capacity, the opposite behavior of populations that share a single input. We use Shannon's rate-distortion theory to show that for Gaussian stimuli, the mean-squared error of the decoded stimulus decreases exponentially in both the population size and the maximal discharge rate. Detailed analysis shows that population coding is essential for accurate stimulus reconstruction. By modeling multi-neuron recordings as a sum of a neural population, we show that the resulting capacity is much less than the population's, reducing it to a level that can be less than provided with two separated neural responses. This result suggests that attempting neural control without spike sorting greatly reduces the achievable fidelity. In contrast, single-electrode neural stimulation does not incur any capacity deficit in comparison to stimulating individual neurons.     

3D Shape Recovery of Smooth Surfaces: Dropping the Fixed-Viewpoint Assumption

We present a new method for recovering the 3D shape of a featureless smooth surface from three or more calibrated images illuminated by different light sources (three of them are independent). This method is unique in its ability to handle images taken from unconstrained perspective viewpoints and unconstrained illumination directions. The correspondence between such images is hard to compute and no other known method can handle this problem locally from a small number of images. Our method combines geometric and photometric information in order to recover dense correspondence between the images and accurately computes the 3D shape. Only a single pass starting at one point and local computation are used. This is in contrast to methods that use the occluding contours recovered from many images to initialize and constrain an optimization process. The output of our method can be used to initialize such processes. In the special case of fixed viewpoint, the proposed method becomes a new perspective photometric stereo algorithm. Nevertheless, the introduction of the multiview setup, self-occlusions, and regions close to the occluding boundaries are better handled, and the method is more robust to noise than photometric stereo. Experimental results are presented for simulated and real images.     

Knowledge transfer in globally distributed teams: the role of transactive memory

This paper explores the role of transactive memory in enabling knowledge transfer between globally distributed teams. While the information systems literature has recently acknowledged the role transactive memory plays in improving knowledge processes and performance in colocated teams, little is known about its contribution to distributed teams. To contribute to filling this gap, knowledge‐transfer challenges and processes between onsite and offshore teams were studied at TATA Consultancy Services. In particular, the paper describes the transfer of knowledge between onsite and offshore teams through encoding, storing and retrieving processes. An in‐depth case study of globally distributed software development projects was carried out, and a qualitative, interpretive approach was adopted. The analysis of the case suggests that in order to overcome differences derived from the local contexts of the onsite and offshore teams (e.g. different work routines, methodologies and skills), some specific mechanisms supporting the development of codified and personalized ‘directories’ were introduced. These include the standardization of templates and methodologies across the remote sites as well as frequent teleconferencing sessions and occasional short visits. These mechanisms contributed to the development of the notion of ‘who knows what’ across onsite and offshore teams despite the challenges associated with globally distributed teams, and supported the transfer of knowledge between onsite and offshore teams. The paper concludes by offering theoretical and practical implications.     

Lower bounds for testing Euclidean Minimum Spanning Trees

The Euclidean Minimum Spanning Tree problem is to decide whether a given graph G=(P,E) on a set of points in the two-dimensional plane is a minimum spanning tree with respect to the Euclidean distance. Czumaj et al. [A. Czumaj, C. Sohler, M. Ziegler, Testing Euclidean Minimum Spanning Trees in the plane, Unpublished, Part II of ESA 2000 paper, downloaded from http://web.njit.edu/~czumaj/] gave a 1-sided-error non-adaptive property-tester for this task of query complexity . We show that every non-adaptive (not necessarily 1-sided-error) property-tester for this task has a query complexity of , implying that the test in [A. Czumaj, C. Sohler, M. Ziegler, Testing Euclidean Minimum Spanning Trees in the plane, Unpublished, Part II of ESA 2000 paper, downloaded from http://web.njit.edu/~czumaj/] is of asymptotically optimal complexity. We further prove that every adaptive property-tester has query complexity of Ω(n1/3). Those lower bounds hold even when the input graph is promised to be a bounded degree tree.     

Sourcing in or out: Implications for social capital and knowledge sharing

The sharing of knowledge between a firm and its internal or external service suppliers has become an important element of contemporary sourcing arrangements. Moreover, the knowledge based view (KBV) has long suggested that due to stronger cognitive links within firms, internal compared to external service provision creates better conditions for knowledge sharing. Empirical evidence for this claim is however scarce, and the KBV does not explain the mechanisms for more knowledge sharing in internal sourcing in detail. Moreover, there is now some evidence to suggest that firms’ relationships with external sourcing partners are becoming more similar to those with captive centres, which represent a less traditional form of insourcing setting. To scrutinize the possible knowledge sharing advantages of internal sourcing in more depth, we turn to social capital (SC) research. There are some theoretical claims that SC and knowledge sharing are stronger within than between firms, and there is ample evidence that SC facilitates knowledge sharing. Our survey results suggest that the extent of knowledge sharing and SC are indeed stronger in a captive than in an external sourcing mode, and that structural (tie strength), cognitive (shared understanding), and relational (trust) aspects of SC mediate the effect of sourcing mode on the extent of knowledge sharing. By contrast, network stability (a structural aspect) mediated knowledge sharing only indirectly, by reinforcing the other SC aspects. We highlight important contributions to research and practice of IS outsourcing and social capital.