The attention mechanism enables graph neural networks (GNNs) to learn the weights between target node and its one-hop neighbors, thereby improving performance further. However, most existing GNNs are oriented toward homogeneous graphs, in which each layer can only aggregate information of neighbors. Stacking multilayer introduces considerable noise easily leads over smoothing. We propose here a...

‎Let $G$ be a finite and simple graph with vertex set $V(G)$‎. ‎A nonnegative signed total Roman dominating function (NNSTRDF) on a‎ ‎graph $G$ is a function $f:V(G)rightarrow{-1‎, ‎1‎, ‎2}$ satisfying the conditions‎‎that (i) $sum_{xin N(v)}f(x)ge 0$ for each‎ ‎$vin V(G)$‎, ‎where $N(v)$ is the open neighborhood of $v$‎, ‎and (ii) every vertex $u$ for which‎ ‎$f(u...

In this paper, we explore the information dissemination problem in ad-hoc wireless networks. First, we analyze the probability of successful broadcast, assuming: the nodes are uniformly distributed, the available area has a lower bound relative to the total number of nodes, and there is zero knowledge of the overall topology of the network. By showing that the probability of successful broadcas...

We consider a location-distribution problem motivated by a case study for a multi-channel retailing company, which sells a wide variety of products via Internet, mail order catalogs, and stores. Since most items to deliver are small or medium-size parcels, consolidation is a major concern which is addressed by designing a multi-echelon distribution system. This system is adaptive, in the sense ...

In this research a variable neighborhood search (VNS) algorithm is developed that can generate musical fragments of arbitrary length. The objective function of the algorithm is based on a quantification of existing fifth species counterpoint rules. A thorough parametric analysis of the VNS reveals the significance of the algorithm’s parameters on the quality of the composed fragment, as well as...

We consider neighborhood search defined on combinatorial optimization problems. Suppose that N is a neighborhood for combinatorial optimization problem X. We say that N′ is LO-equivalent (locally optimal) to N if for any instance of X, the set of locally optimal solutions with respect to N and N′ are the same. The union of two LO-equivalent neighborhoods is itself LO-equivalent to the neighborh...

Faudree, R.J., R.J. Gould and L.M. Lesniak, Neighborhood conditions and edge-disjoint perfect matchings, Discrete Mathematics 91 (1991) 33-43. A graph G satisfies the neighborhood condition ANC(G) 2 m if, for all pairs of vertices of G, the union of their neighborhoods has at least m vertices. For a fixed positive integer k, let G be a graph of even order n which satisfies the following conditi...

Abstract: Single feature is inefficient to describe content of an image, which is a shortcoming in traditional image retrieval task. We know that one image can be described by different features. Multi-feature fusion ranking can be utilized to improve the ranking list of query. In this paper, we first analyze graph structure and multi-feature fusion re-ranking from manifold aspect. Then, Three ...

Variable neighborhood search (VNS) is a metaheuristic, or framework for building heuristics, based upon systematic change of neighborhoods both in a decent phase to find a local minimum, and in a perturbation phase to get out of the corresponding valley. It was first proposed in 1997 and since has rapidly developed both in its methods and its applications. Both of these aspects are thouroughly ...

In this paper, a new fix-and-optimize (FO) approach is proposed for two dynamic multi-level capacitated lot sizing problems (MLCLSP), the MLCLSP without setup carryover and the MLCLSP with setup carryover. Given an MIP model of a lot sizing problem, the approach iteratively solves a series of subproblems of the model until no better solution can be found. Each sub-problem re-optimizes a subset ...