we consider biobjective shortest path problems in networks with fuzzy arc lengths. considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. the rst and second approaches are extensions of the labeling method to solve the sing...

This paper introduces sector-specific externalities in the Heckscher–Ohlin twocountry dynamic general equilibrium model to show that indeterminacy of the equilibrium path in the world market can occur. Under certain conditions in terms of factor intensities, there are multiple equilibrium paths from the same initial distribution of capital in the world market, and the distribution of capital in...

By new advancements in vehicle manufacturing vehicle quality evaluation and assurance has become a more critical issue. In present work, the vibration transfer path analysis and vibration path ranking of a car interior has been performed. The method is similar to classical multilevel TPA methods but has distinct differences. The method is named VIVS which stands for Vehicle Interior Vibratio...

Link prediction is a challenging problem for complex network analysis, arising in many disciplines such as social networks and telecommunication networks. Currently, many existing approaches estimate the proximity of the link endpoints from the local neighborhood around them for link prediction, which suffer from the localized view of network connections. In this paper, we consider the problem ...

The Path Ranking Algorithm (Lao and Cohen, 2010) is a general technique for performing link prediction in a graph. PRA has mainly been used for knowledge base completion (Lao et al., 2011; Gardner et al., 2013; Gardner et al., 2014), though the technique is applicable to any kind of link prediction task. To learn a prediction model for a particular edge type in a graph, PRA finds sequences of e...

A ranking of a graph G is a mapping, p, from the vertices of G to the natural numbers such that for every path between any two vertices u and u, uf II, with p(u) = p(u), there exists at least one vertex w on that path with p(w) > p(u) = p(u). The value p(u) of a vertex u is the rank of vertex II. A ranking is optimal if the largest rank assigned is the smallest among all rankings. The optimal r...

A ranking of a graph is a coloring of the vertex set with positive integers such that on every path connecting two vertices of the same color there is a vertex of larger color. We consider the directed variant of this problem, where the above condition is imposed only on those paths in which all edges are oriented in the same direction. We show that the ranking number of a directed tree is boun...

With the development of online education system, personalized recommendation has played an essential role. In this paper, we focus on developing path systems that aim to generating and recommending entire learning given user in each session. Noticing existing approaches fail consider correlations concepts path, propose a novel framework named Set-to-Sequence Ranking-based Concept-aware Learning...