An approach to emulating separable graphs

A technique foremulating multicomputer interconnection networks that are based onseparable graphs (graphs having bounded degree and sublinear multicolor recursive bisectors) is presented. Efficient emulations among interconnection networks are necessary for porting programs designed for one network to another.Emulations are formalized asgraph embeddings, where the nodes (processors) of theguest graph (emulated network) are assigned to nodes of thehost graph (emulator), while the edges (communication links) of the guest are routed via paths in the host. The communication slowdown in an emulation depens on thedilation (length of the longest routing path) and thecongestion (number of paths that contend for a host edge) of the embedding. Theexpansion of the embedding (the ratio of the sizes of the host to guest) determines the inefficiency of processor utilization. Cell trees are introduced as interconnection networks whose special communication properties enable them to serve as intermediate devices in these emulations. Nodes in cell trees are organized into equinumerous parts calledcells; the cells are labeled by nodes of a complete binary tree. Communication in cell trees is restricted to two specific and distinct primitives:cell communication is confined within cells, whiletransfer communication occurs between adjacent cells. Rather than solved directly, the emulation problem for the original guest-host pair is decomposed into two independent parts: emulating the guest by the cell tree, and emulating the cell tree by the host.In emulations of separable graphs by cell trees, the node assignment that ensures small dilation is derived from the separator-based decomposition of guest graphs. The congestion-free edge routing is achieved by coordinatingglobal andlocal phases, which are based on two characteristic cell-tree communication primitives.The technique is instantiated by emulating cell trees on specific host graphs. Withshuffle-like hypercube-derivative networks as hosts new constant-expansion emulations are obtained that have both dilation and congestion logarithmic in the size of the multicolor bisector of guest graphs. These emulations are the first such to have optimal (up to constants)congestion; they provide the firstoptimal algorithm for emulating arbitrary separable graphs on shuffle-like networks. The application of the technique tohypercubes as hosts also produces optimal emulations that differ from those previously known by having smaller expansion constants.This research was supported in part by NSF Grants CCR-88-12567 and CCR-90-13184, and by the University of Massachusetts Graduate School Fellowship for the academic year 1991-92. A preliminary version of this paper was presented at the 3rd ACM Symposium on Parallel Algorithms and Architectures, July 22–24, 1991, in Hilton Head, South Carolina, USA.     

Scientometric analysis of the research activities of chemists from the “Rugjer Bošković” Institute (Yugoslavia), 1976–1985

The research activity of chemists from the Rugjer Bokovi Institute (RBI, Zagreb, Yugoslavia) was analyzed for the period 1976–1985, covering 2018 research years of scientific work, and 1149 SCI registered papers (0.57 publications per research year). At the average, one paper was published by 3.05 scientists. The papers were published in 235 different journals, most frequently is the nationalCroatica Chemica Acta (171 papers). The publications were divided into two groups: for the periods 1976–1980 and 1981–1985, and for each paper citations were collected in the respective time period. An average publication had 2.58 citations. Chemical papers from the second period had 2.73 citations per paper, which is 85% of the expected value, and this was considerably more than for Yugoslav papers (66%) in general. The papers were classified according to the subfields used in theJournal Citation Reports, and the results compared with the data published bySchubert, Glänzel andBraun. The distribution of citations was also analyzed.     

Frequency dependence of the spin-fluctuation spectrum in Pd: Calculations within the finite bandwidth model

The frequency dependence of the electron-paramagnon spectrumP() in Pd is calculated within the finite bandwidth model. It is found that for an almost full band, the magnitude, the range, and the position of the peak frequency inP() are dramatically reduced compared to their values in the usual paramagnon theory. Also, we find that the frequency dependence of the spin-fluctuation contribution to the electron self-energy is strongly affected by a close proximity of the Fermi level to the top of the band. We speculate that an unusually large value of the Coulomb pseudopotential is probably partially responsible for the absence of superconductivity in Pd.     

Formation of oxide phases in the system Fe2O3−Gd2O3

The formation of oxide phases in the system (1 -x) Fe₂O₃ +xGd₂O₃ was investigated for 0 x 1. On the basis of XRD measurements the distribution of oxide phases, -Fe₂O₃, Gd₃Fe₅O₁₂, GdFeO₃ and Gd₂O₃ was determined, as a function ofx. No solid solutions were observed with certainty even at the very ends of the concentration range. This was also confirmed by⁵⁷Fe Mössbauer spectroscopy. New accurate crystallographic data for Gd₃Fe₅O₁₂ are given. The formation of oxide phases in the system Fe₂O₃- Gd₂O₃ is compared with the data for analogous system Fe₂O₃-Eu₂O₃.     

Magnetic pinning in inhomogeneous type II superconductors

The magnetic structure of a vortex in the presence of an anisotropic inhomogeneity distribution is calculated within the London model. The anisotropic supercurrent pattern consists of closed current loops, superimposed on a backflow pattern. The nonvanishing current density at the vortex core gives rise to an intrinsic Lorentz force identical with the pinning force resulting from the spatial variation of the vortex self-energy.     

How Cancer Cells Invade Bladder Epithelium and Form Tumors: The Mouse Bladder Tumor Model as a Model of Tumor Recurrence in Patients

Non-muscle-invasive bladder cancer is the most common form of bladder cancer. The main problem in managing bladder tumors is the high recurrence after the transurethral resection of bladder tumors (TURBT). Our study aimed to examine the fate of intravesically applied cancer cells as the implantation of cancer cells after TURBT is thought to be a cause of tumor recurrence. We established an orthotopic mouse bladder tumor model with MB49-GFP cancer cells and traced them during the first three days to define their location and contacts with normal urothelial cells. Data were obtained by Western blot, immunolabeling, and light and electron microscopy. We showed that within the first two hours, applied cancer cells adhered to the traumatized epithelium by cell projections containing α3β1 integrin on their tips. Cancer cells then migrated through the epithelium and on day 3, they reached the basal lamina or even penetrated it. In established bladder tumors, E-cadherin and desmoplakin 1/2 were shown as feasible immunohistochemical markers of tumor margins based on the immunolabeling of various junctional proteins. Altogether, these results for the first time illustrate cancer cell implantation in vivo mimicking cellular events of tumor recurrence in bladder cancer patients.     

An e-Learning tool considering similarity measures for manufacturing cell formation

Manufacturing cell formation is the first step in the design of cellular manufacturing system. The primary objective of this step is to cluster machines into machine cells and parts into part families so that the minimum of intercell trips will be achieved. This paper will be focused on the configuration of machine cells considering three types of initial machine-part matrix: binary (zero-one) matrix, production volume matrix, and operation time matrix. The similarity measure uses only information from these types of matrix. A pure combinatorial programming formulation will be developed to maximize the sum of similarity coefficients between machine/part pairs. An e-Learning tool/application to help industrial students and engineers for enhancing their cell formation capability is proposed. This tool is designed to include a novel similarity coefficient-based heuristic algorithm for solving the cell formation problem. To determine the performance of the proposed tool, comparison is made with a well-known tool along a case study.     

Online learning and fusion of orientation appearance models for robust rigid object tracking

We introduce a robust framework for learning and fusing of orientation appearance models based on both texture and depth information for rigid object tracking. Our framework fuses data obtained from a standard visual camera and dense depth maps obtained by low-cost consumer depth cameras such as the Kinect. To combine these two completely different modalities, we propose to use features that do not depend on the data representation: angles. More specifically, our framework combines image gradient orientations as extracted from intensity images with the directions of surface normals computed from dense depth fields. We propose to capture the correlations between the obtained orientation appearance models using a fusion approach motivated by the original Active Appearance Models (AAMs). To incorporate these features in a learning framework, we use a robust kernel based on the Euler representation of angles which does not require off-line training, and can be efficiently implemented online. The robustness of learning from orientation appearance models is presented both theoretically and experimentally in this work. This kernel enables us to cope with gross measurement errors, missing data as well as other typical problems such as illumination changes and occlusions. By combining the proposed models with a particle filter, the proposed framework was used for performing 2D plus 3D rigid object tracking, achieving robust performance in very difficult tracking scenarios including extreme pose variations.