interval-valued intuitionistic fuzzy sets (ivifss) are widely used to handle uncertainty and imprecision in decision making. however, in more complicated environment, it is difficult to express the uncertain information by an ivifs with considering the decision-making preference. hence, this paper proposes a group generalized interval-valued intuitionistic fuzzy soft set (g-givifss) which conta...

In recent years, we have witnessed a flourishing of 3D object modelling. Efficient and effective 3D model retrieval algorithms are high desired and attracted intensive research attentions. In this work, we propose a view-based 3D model retrieval algorithm based onweighted locality-constrained group sparse coding. Representative views are first selected by clustering and the corresponding weight...

In this paper we find formulas for group inverses of Laplacians of weighted trees. We then develop a relationship between entries of the group inverse and various distance functions on trees. In particular, we show that the maximal and minimal entries on the diagonal of the group inverse correspond to certain pendant vertices of the tree and to a centroid of the tree, respectively. We also give...

Adaptive Bit Loading (ABL) in Multiple-Input Multiple-Output Orthogonal Frequency-Division Multiplexing (MIMO-OFDM) is often used to achieve the desired Bit Error Rate (BER) performance in wireless systems. In this paper, we discuss some of the bit loading algorithms, compare them in terms of the BER performance, and present an effective and concise Adaptive Grouped Loading (AGL) algorithm. Fur...

An Euclidean graph associated with a molecule is defined by a weighted graph with adjacency matrix M = [dij], where for ij, dij is the Euclidean distance between the nuclei i and j. In this matrix dii can be taken as zero if all the nuclei are equivalent. Otherwise, one may introduce different weights for distinct nuclei. Balaban introduced some monster graphs and then Randic computed complexit...

The purpose of this study was to investigate the effect of weighted jump squat training with and without eccentric braking. Twenty male subjects were divided into two groups (n = 10 per group), Non-Braking Group and Braking Group. The subjects were physically active, but not highly trained. The program for Non-Braking Group consisted of 6 sets of 6 repetitions of weighted jump squats without re...

It is necessary to generate the automorphism group of a chemical graph in computer-aided structure elucidation. An Euclidean graph associated with a molecule is defined by a weighted graph with adjacency matrix M = [dij], where for i≠j, dij is the Euclidean distance between the nuclei i and j. In this matrix dii can be taken as zero if all the nuclei are equivalent. Otherwise, one may introduce...

BACKGROUND AND PURPOSE In stroke attributable to spontaneous dissection of the cervical artery, it is unclear whether the occurrence and pattern of stroke depend on the degree of stenosis. METHODS In 147 consecutive dissection of the cervical artery patients with (n=88) and without stroke (n=59), we compared the number, volume, and patterns of cerebral diffusion-weighted imaging stroke lesion...