background: in this study we evaluated the prognostic impact of metastatic lymph node ratio (mlr) in patients with gastric cancer undergoing curative surgical resection. methods: a total of 121 patients with gastric adenocarcinoma undergoing curative r0 surgical resection in our institutions between 2003 and 2010 were included in this study.  mlr was classified into 3 groups as follows: mlr0; 0...

In recent years, many research works propose to embed the networked data into a low-dimensional feature space, where each node is represented as a feature vector. With the embedding feature vectors, the original network structure can be e‚ectively reconstructed, classic learning algorithms can be applied directly, and more importantly the learned embedding representations can also be widely use...

This work is a modeling of evolutionary networks embedded in one or two dimensional configuration space. The evolution is based on two attachments depending on degree and spatial distance. The probability for a new node n to connect with a previous node i at distance r ni follows a k i  j k j + (1 − a) r −α ni  j r −α nj , where k i is the degree of node i, α and a are tunable parameters. In ...

In this paper a method of embedding a linear graph in n-cube is discussed. Necessary and sufficient conditions on node configurations for the embeddability are obtained by analyzing the structure of n-cube in code space with respect to the distance 2c by means of Reed-Muller code. The fundamental idea in this study is to modify a given graph iteratively in such a manner that the connecting prop...

A &k, d ) hyperpyramid is a level structure of k hypercubes, where the hypercube at level i is of dimension id, and a node at level i 1 is connected to every node in a &dimensional subcube at level i, except for the leaf level k. Hyperpyramids contain pyramids as propy subgraphs. We show that a hyperpyramid P(k, d ) can be embedded in a hypercube with minimal expansion and dilation = d. The con...

Link prediction (LP) algorithms propose to each node a ranked list of nodes that are currently non-neighbors, as the most likely candidates for future linkage. Owing increasing concerns about privacy, users (nodes) may prefer keep some their connections protected or private. Motivated by this observation, our goal is design differentially private LP algorithm, which trades off between privacy n...

Self-adjusting networks (SANs) have the ability to adapt communication demand by dynamically adjusting workload (or demand) embedding, i.e., mapping of requests into network topology. SANs can reduce routing costs for frequently communicating node pairs paying a cost embedding. This is particularly beneficial when has structure, which to. Demand be represented in form graph, defined set nodes (...

‎for a given measure space $(x,{mathscr b},mu)$ we construct all measure spaces $(y,{mathscr c},lambda)$ in which $(x,{mathscr b},mu)$ is embeddable‎. ‎the construction is modeled on the ultrafilter construction of the stone--v{c}ech compactification of a completely regular topological space‎. ‎under certain conditions the construction simplifies‎. ‎examples are given when this simplification o...

Abstract Labeled graphs are particularly well adapted to represent objects in the context of topology-based geometric modeling. Thus, graph transformation theory is used implement modeling operations and check their consistency. This article defines a class rules dedicated embedding computations. Objects here defined as particular subclass labeled which arc labels encode topological structure (...