mean labelings are a type of additive vertex labeling. this labeling assigns non-negative integers to the vertices of a graph in such a way that all edge-weights are different, where the weight of an edge is defined as the mean of the end-vertex labels rounded up to the nearest integer. in this paper we focus on mean labelings of some graphs that are the result of the corona operation. in parti...

significant advantages of intermodal and containerized transport have increased the global interest to this mode of transportation. this growing interest is reflected in the annual volume of container cargo growth. however, the container transport inside iran does not have a proper place. comparing the count of containers entering and leaving ports with the statistics obtained from railway and ...

DEXSY2 is a dental expert system, which diagnoses oral diseases and offers a treatment course. The system which is designed and implemented from scratch is capable of diagnosing among thirty five oral diseases and offering a course of treatment for each. It uses a decision tree for its representation of knowledge, and each of its nodes contains a frame. The knowledge base of the system contains...

Targeted at fellow historians and American Studies scholars, as well interdisciplinary students of material culture the decorative performing arts, William D. Moore’s Shaker Fever: America’s Twentieth-Century Fascination with a Communitarian Sect serves both historiography interpretation life case study in how cultural entrepreneurs have imagined mythologized subcultural group existing outside ...

the person, who, on his way, encounters a fruit-bearing tree belonging to others, can eat from its fruit as much as fulfilling his need, provided that his reaching to that tree has been accidental rather than on purpose; and that he should not take away any fruit with him and damage a tree or a fruit. in this respect, the owner’s consent is not considered a sine qua non. the reason for this rul...

we study the limiting distribution of the degree of a given node in a scaled attachment random recursive tree, a generalized random recursive tree, which is introduced by devroye et. al (2011). in a scaled attachment random recursive tree, every node $i$ is attached to the node labeled $lfloor ix_i floor$ where $x_0$, $ldots$ , $x_n$ is a sequence of i.i.d. random variables, with support in [0,...