Graph embedding techniques, which learn low-dimensional representations of a graph, are achieving state-of-the-art performance in many graph mining tasks. Most existing algorithms assign single vector to each node, implicitly assuming that representation is enough capture all characteristics the node. However, across domains, it common observe pervasively overlapping community structure, where ...

Localized geographic single path routing along a wireless network graph requires exact location information about the network nodes to assure message delivery guarantees. Node localization in practice however is not exact. Errors ranging from several centimeters up to several meters are usual. How to perform localized routing in practice when such errors are prevalent? In this work we look at a...

Network embedding algorithms that map nodes in a network into a low-dimensional vector space are prevalent in recent years, due to their superior performance in many network-based tasks, such as clustering, classification, and link prediction. The main assumption of existing algorithms is that the learned latent representation for nodes should preserve the structure of the network, in terms of ...

Network virtualization has caught the attention of many researchers in recent years. It facilitates the process of creating several virtual networks over a single physical network. Despite this advantage, however, network virtualization suffers from the problem of mapping virtual links and nodes to physical network in most efficient way. This problem is called virtual network embedding (“VNE”)....

Many parallel algorithms use hypercubes as the communication topology among their processes. When such algorithms are executed on hypercube multicomputers the communication cost is kept minimum since processes can be allocated to processors in such a way that only communication between neighbor processors is required. However, the scalability of hypercube multicomputers is constrained by the fa...

Geographic routing is an appealing routing strategy that uses the location information of the nodes to route the data. This technique uses only local information of the communication graph topology and does not require computational effort to build routing table or equivalent data structures. A particularly efficient implementation of this paradigm is greedy routing, where along the data path t...

Among the adaptive-grid methods, redistribution and embedding techniques have been the focus of more attention by researchers. Simultaneous or combined adaptive techniques have also been used. This paper describes a combination of adaptive-grid embedding and redistribution methods on semi-structured grids for two-dimensional invisid flows. Since the grid is semi-structured, it is possible to us...

Learning with graph-structured data, such as social, biological, and financial networks, requires effective low-dimensional representations to handle their large complex interactions. Recently, the advances of neural networks embedding algorithms, many unsupervised approaches have been proposed for downstream tasks promising results; however, there has limited research on interpreting and, spec...

We present three distinct XML vocabularies and demonstrate integration with o:XML source code. The vocabularies relate to interface documentation, unit tests and Design By Contract conditions. By layering the information with XML namespaces, syntax conflicts are avoided and selective processing can be performed using standard XML tools. Automated unit tests and the implementation of Design By C...

background: sentinel  lymph  node  biopsy  has  shown  to  be  a  good  alternative procedure  for  axillary  lymph  node  dissection  and  to lead  to  lower  frequency  of morbidity, though this technique has its own side effects. it needs especial equipment and may not be available in some medical centers, especially in developing countries. this study aimed to identify a subgroup of patient...