Small-angle neutron scattering (SANS) is employed to investigate the structure and longchain branch (LCB) content of metallocene-catalyzed polyethylene (PE). A novel scaling approach is applied to SANS data to determine themole fraction branch content (φbr) of LCBs in PE. The approach also provides the average number of branch sites per chain (nbr) and the average number of branch sites per min...

in this paper, using generalized {polya} urn models we find the expected value of the size of a branch in recursive $k$-ary trees. we also find the expectation of the number of nodes of a given outdegree in a branch of such trees.

The third-party motor insurance data from Sweden for 1977 described by Andrews and Herzberg in 1985 contain average claim occurrence rate (P c ) , size (C a category of vehicles specified the kilometres travelled per year (K), geographical zone (Z), no claims bonus (B) make car (M). categorical variables Z M may first be represented respectively vectors (Z 1 2 … 6 (M 8 binary variables. variabl...

Modern micro-architectures employ superscalar techniques to enhance system performance. Since the superscalar microprocessors must fetch at least one instruction cache line at a time to support high issue rate and large amount speculative executions. There are cases that multiple branches are often encountered in one cycle. And in practical implementation this would cause serious problem while ...

This article considers the problem of scheduling preemptive open shops to minimize total tardiness. The problem is known to be NP-hard. An efficient constructive heuristic is developed for solving large-sized problems. A branch-and-bound algorithm that incorporates a lower bound scheme based on the solution of an assignment problem as well as various dominance rules are presented for solving me...

High single instruction multiple data (SIMD) efficiency and low power consumption have made graphic processing units (GPUs) an ideal platform for many complex computational applications. Thousands of threads can be created by programmers and grouped into fixed-size SIMD batches, known as warps. High throughput is then achieved by concurrently executing such warps with minimal control overhead. ...

Motivated by the optimization of link state routing in ad hoc networks, and the concept of multipoint relays, we introduce the notion of remote-spanner. Given an unweighted graph G, a remote spanner is a set of links H such that for any pair of nodes (u, v) there exists a shortest path in G for which all links in the path that are not adjacent to u belong to H. The remote spanner is a kind of m...

Glushkov’s algorithm builds an ε-free nondeterministic automaton from a given regular expression. In the worst case, its number of states is linear and its number of transitions is quadratic in the size of the expression. We show in this paper that in average, the number of transitions is linear.