منابع مشابه
PC-Labeling of a Graph and its PC-Set
Abstract A binary vertex labeling f : V (G) → Z2 of a graph G is said to be friendly if the number of vertices labeled 0 is almost the same as the number of vertices labeled 1. This friendly labeling induces an edge labeling f∗ : E(G) → Z2 defined by f∗(uv) = f(u)f(v) for all uv ∈ E(G). Let ef (i) = {uv ∈ E(G) : f∗(uv) = i} be the number of edges of G that are labeled i. Productcordial index of...
متن کاملPCPC PC PC PCPC PCPC PC PC PCPC PC PC ( a ) 2 - ary 4 - tree PC PC PCPC PC PC PCPC PC PC PCPC PC PC
Many applications have stimulated the recent surge of interest single-chip parallel processing. In such machines, it is crucial to implement a high-throughput low-latency interconnection network to connect the on-chip components, especially the processing units and the memory units. In this paper, we propose a new mesh of trees (MoT) implementation of the interconnection network and evaluate it...
متن کامل“seis” – Security in Embedded Ip-based Systems
results in complex and cost-intensive E/E architectures. For this reason the innovation alliance for automobile electronics E|ENOVA initiated the research project “SEIS – Safety in Embedded IP-based Systems”, with the aim of creating a consistent security solution for internet protocol based communication inside the vehicle and for the vehicle’s communication with the environment. The project p...
متن کاملChad Outline
The model not only underpredicts civil war onsets, but it also had inconsistent success in its point predictions. It points to 1960-61 as the years Chad was most vulnerable to a civil war (over six percent probability for each of these years). Yet the first civil was onset was not until 1965 when the odds were a bit over one percent, about two-thirds the world average. Although the model does n...
متن کاملSeminar Outline
1. Teichm uller space and the Teichm uller metric d(X; Y) = inf(1=2) log K(), where : X ! Y ranges over all quasiconformal mappings in the appropriate isotopy class. 2. Teichm uller's theorem: If X is compact, or more generally if X is obtained from a compact Riemann surface by removing a nite number of points, then there is an essentially map f minimizing the innmum above. (This map is unique ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Geological data processing
سال: 1985
ISSN: 0388-502X,1347-541X
DOI: 10.6010/geoinformatics1975.1985.10_19