Construct Validity of the Pig Intestine Model in the Simulation of Laparoscopic Urethrovesical Anastomosis

Introduction: Laparoscopic training models are increasingly important in urology to allow trainees to improve their laparoscopic skills prior to going to the operating room. For a training model to be valid, it must correlate with performance in a real case. The model must also discriminate between experienced and inexperienced subjects. [See PDF for complete abstract]

When the brain changes its mind: Interocular grouping during binocular rivalry

The prevalent view of binocular rivalry holds that it is a competition between the two eyes mediated by reciprocal inhibition among monocular neurons. This view is largely due to the nature of conventional rivalry-inducing stimuli, which are pairs of dissimilar images with coherent patterns within each eye’s image. Is it the eye of origin or the coherency of patterns that determines perceptual alternations between coherent percepts in binocular rivalry? We break the coherency of conventional stimuli and replace them by complementary patchworks of intermingled rivalrous images. Can the brain unscramble the pieces of the patchwork arriving from different eyes to obtain coherent percepts? We find that pattern coherency in itself can drive perceptual alternations, and the patchworks are reassembled into coherent forms by most observers. This result is in agreement with recent neurophysiological and psychophysical evidence demonstrating that there is more to binocular rivalry than mere eye competition.

Image recognition: Visual grouping, recognition, and learning

Vision extracts useful information from images. Reconstructing the three-dimensional structure of our environment and recognizing the objects that populate it are among the most important functions of our visual system. Computer vision researchers study the computational principles of vision and aim at designing algorithms that reproduce these functions. Vision is difficult: the same scene may give rise to very different images depending on illumination and viewpoint. Typically, an astronomical number of hypotheses exist that in principle have to be analyzed to infer a correct scene description. Moreover, image information might be extracted at different levels of spatial and logical resolution dependent on the image processing task. Knowledge of the world allows the visual system to limit the amount of ambiguity and to greatly simplify visual computations. We discuss how simple properties of the world are captured by the Gestalt rules of grouping, how the visual system may learn and organize models of objects for recognition, and how one may control the complexity of the description that the visual system computes.

A new modularity measure for Fuzzy Community detection problems based on overlap and grouping functions

One of the main challenges of fuzzy community detection problems is to be able to measure the quality of a fuzzy partition. In this paper, we present an alternative way of measuring the quality of a fuzzy community detection output based on n-dimensional grouping and overlap functions. Moreover, the proposed modularity measure generalizes the classical Girvan–Newman (GN) modularity for crisp community detection problems and also for crisp overlapping community detection problems. Therefore, it can be used to compare partitions of different nature (i.e. those composed of classical, overlapping and fuzzy communities). Particularly, as is usually done with the GN modularity, the proposed measure may be used to identify the optimal number of communities to be obtained by any network clustering algorithm in a given network. We illustrate this usage by adapting in this way a well-known algorithm for fuzzy community detection problems, extending it to also deal with overlapping community detection problems and produce a ranking of the overlapping nodes. Some computational experiments show the feasibility of the proposed approach to modularity measures through n-dimensional overlap and grouping functions.

Bayesian models for finding and grouping junctions

In this paper, we propose two Bayesian methods for detecting and grouping junctions. Our junction detection method evolves from the Kona approach, and it is based on a competitive greedy procedure inspired in the region competition method. Then, junction grouping is accomplished by finding connecting paths between pairs of junctions. Path searching is performed by applying a Bayesian A* algorithm that has been recently proposed. Both methods are efficient and robust, and they are tested with synthetic and real images.

Grouping genetic operators for the delineation of functional areas based on spatial interaction

The delineation of functional economic areas, or market areas, is a problem of high practical relevance, since the delineation of functional sets such as economic areas in the US, Travel-to-Work Areas in the United Kingdom, and their counterparts in other OECD countries are the basis of many statistical operations and policy making decisions at local level. This is a combinatorial optimisation problem defined as the partition of a given set of indivisible spatial units (covering a territory) into regions characterised by being (a) self-contained and (b) cohesive, in terms of spatial interaction data (flows, relationships). Usually, each region must reach a minimum size and self-containment level, and must be continuous. Although these optimisation problems have been typically solved through greedy methods, a recent strand of the literature in this field has been concerned with the use of evolutionary algorithms with ad hoc operators. Although these algorithms have proved to be successful in improving the results of some of the more widely applied official procedures, they are so time consuming that cannot be applied directly to solve real-world problems. In this paper we propose a new set of group-based mutation operators, featuring general operations over disjoint groups, tailored to ensure that all the constraints are respected during the operation to improve efficiency. A comparative analysis of our results with those from previous approaches shows that the proposed algorithm systematically improves them in terms of both quality and processing time, something of crucial relevance since it allows dealing with most large, real-world problems in reasonable time.

Nonrandom behavior in field wave spectra and its effect on grouping of high waves /

"August 1982."

The haemolytic streptococci: their grouping by agglutination /

Mode of access: Internet.

Grouping for the judges' work.

At head of title: United States Centennial commission. International exhibition, 1876.