A profile π = (x1, ..., xk), of length k, in a finite connected graph G is a sequence of vertices of G, with repetitions allowed. A median x of π is a vertex for which the sum of the distances from x to the vertices in the profile is minimum. The median function finds the set of all medians of a profile. Medians are important in location theory and consensus theory. A median graph is a graph fo...

The median problem seeks a permutation whose total distance to a given set of permutations (the base set) is minimal. This is an important problem in comparative genomics and has been studied for several distance measures such as reversals. The transposition distance is less relevant biologically, but it has been shown that it behaves similarly to the most important biological distances, and ca...

Median graphs are characterized among direct products of graphs on at least three vertices. Beside some trivial cases, it is shown that one component of G × P3 is median if and only if G is a tree in that the distance between any two vertices of degree at least 3 is even. In addition, some partial results considering median graphs of the form G ×K2 are proved, and it is shown that the only nonb...

One could argue that the long-standing controversy over the relative merits of the median and mean is something of a touchstone of early statistics. The touchstone of medieval alchemy was basonite, a variety of quartz used to test the purity of gold alloys ; striking an alloy against the surface of the stone revealed the quality of the alloy by the color of the mark left on the stone. Likewise,...

Currently, the threshold T must be entered manually, based on given or estimated values for the SNR of the degraded image. Future work will look at ways to automate this process. Also, we found that at very low SNR, the AMP median filter introduces a few speckles into the restored image. We suspect that this may be due to incorrect adaption in regions of exceptionally high noise levels. Further...

Aprofileπ = (x1, . . . , xk), of length k, in a finite connected graphG is a sequence of vertices ofG, with repetitions allowed. Amedian x ofπ is a vertex forwhich the sumof the distances from x to the vertices in the profile is minimum. The median function finds the set of all medians of a profile. Medians are important in location theory and consensus theory. A median graph is a graph for whi...

A rich structure theory has been developed in the last three decades for graphs embed dable into hypercubes in particular for isometric subgraphs of hypercubes also known as partial cubes and for median graphs Median graphs which constitute a proper subclass of partial cubes have attracted considerable attention In order to better understand them semi median graphs have been introduced but have...

هدف این پژوهش مقایسه اثربخشی آموزش غنی­سازی زندگی زناشویی براساس دو رویکرد تئوری انتخاب و گاتمن بر گذشت زنان در است. روش نیمه‌تجربی با طرح پیش­آزمون ـ پس­آزمون گروه کنترل بود. جامعه شامل متأهل دارای مشکلات مراجعه‌کننده به مرکز مشاوره تسنیم شهرستان شوش سال 98 بودند که از میان آن‌ها 60 نفر نمونه­گیری دسترس صورت تصادفی سه مساوی جای گرفتند. اول 9 جلسه دقیقه­ای غنی‌سازی دوم 8 نظریه را دیدند. نیز پرس...