نتایج جستجو برای: friendly relations
تعداد نتایج: 187640 فیلتر نتایج به سال:
let g=(v,e) be a simple graph. an edge labeling f:e to {0,1} induces a vertex labeling f^+:v to z_2 defined by $f^+(v)equiv sumlimits_{uvin e} f(uv)pmod{2}$ for each $v in v$, where z_2={0,1} is the additive group of order 2. for $iin{0,1}$, let e_f(i)=|f^{-1}(i)| and v_f(i)=|(f^+)^{-1}(i)|. a labeling f is called edge-friendly if $|e_f(1)-e_f(0)|le 1$. i_f(g)=v_f(1)-v_f(0) is called the edge-f...
A printable version of this syllabus is available here.
This paper ditcusses the functions preseni in a sophisticated relation browser with support for icons, maps, text and normal fixed format relations. A discussion of some of the required data base extensions to support, such a browser is also presented. I INTRODUCTIOX This paper suggests the design of TIMBER (Text, icon and Map Browser for Extended Relations), a user friendly, graphics-oriented ...
let $g=(v,e)$ be a simple graph. an edge labeling $f:eto {0,1}$ induces a vertex labeling $f^+:vtoz_2$ defined by $f^+(v)equiv sumlimits_{uvin e} f(uv)pmod{2}$ for each $v in v$, where $z_2={0,1}$ is the additive group of order 2. for $iin{0,1}$, let $e_f(i)=|f^{-1}(i)|$ and $v_f(i)=|(f^+)^{-1}(i)|$. a labeling $f$ is called edge-friendly if $|e_f(1)-e_f(0)|le 1$. $i_f(g)=v_f(...
To remove a cognitive dissonance in interpersonal relations, people tend to divide our acquaintances into friendly and hostile parts, both groups internally friendly and mutually hostile. This process is modeled as an evolution towards the Heider balance. A set of differential equations have been proposed and validated (Kulakowski et al, IJMPC 16 (2005) 707) to model the Heider dynamics of this...
A mixture of positive (friendly) and negative (antagonistic) relations exist among users in most social media applications. However, many such applications do not allow users to explicitly express the polarity of their interactions. As a result most research has either ignored negative links or was limited to the few domains where such relations are explicitly expressed (e.g. Epinions trust/dis...
This publication presents a relation computation or calculus for international relations using a mathematical modeling. It examined trust for international relations and its calculus, which related to Bayesian inference, Dempster-Shafer theory and subjective logic. Based on an observation in the literature, we found no literature discussing the calculus method for the international relations. T...
Syntactic structures have been good features for opinion analysis, but it is not easy to use them. To find these features by supervised learning methods, correct syntactic labels are indispensible. Two possible sources to acquire syntactic structures are parsing trees and dependency trees. For the annotation processing, parsing trees are more readable for annotators, while dependency trees are ...
Wedefine a logicD capable of expressing dependence of a variable on designated variables only. Thus D has similar goals to the Henkin quantifiers of [4] and the independence friendly logic of [6] that it much resembles. The logic D achieves these goals by realizing the desired dependence declarations of variables on the level of atomic formulas. By [3] and [17], ability to limit dependence rela...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید