Blu Homes, an innovative housing company based in the Boston, is looking forward to having the opportunities to expand its customer base on the West Coast. The company sells durable, energy-efficient prefabrication homes and has several million dollars of revenue annually. Blu Homes has a concrete mission to build super-efficient prefabrication green homes by leveraging their leading-edge techn...

In smooth orthogonal layouts of planar graphs, every edge is an alternating sequence of axis-aligned segments and circular arcs with common axisaligned tangents. In this paper, we study the problem of finding smooth orthogonal layouts of low edge complexity, that is, with few segments per edge. We say that a graph has smooth complexity k—for short, an SCk-layout—if it admits a smooth orthogonal...

In order to improve the quality of image with super-resolution reconstruction, a method based on motion estimation error and edge constraint was proposed. Under the condition of data consistency and amplitude restriction, the motion estimation error was analyzed, with its variance being calculated; meanwhile, in order to suppress the ringing artifacts, edge constraint was adopted and a method b...

Vanadium K-edge X-ray-absorption spectra were collected for samples of thionine-oxidized, super-reduced (during enzyme turnover) and dithionite-reduced VFe-protein of the vanadium nitrogenase of Azotobacter chroococcum (Acl*). Both the e.x.a.f.s and the x.a.n.e.s. (X-ray-absorption near-edge structure) are consistent with the vanadium being present as part of a VFeS cluster; the environment of ...

In this paper, a method of super-resolution image reconstruction based on wavelet transform and edge-directed interpolation is put forward. Firstly the low resolution image is decomposed by the stationary wavelet transform; meanwhile, the image obtained from edge-directed interpolation is decomposed by discrete wavelet transform, then the three high frequency sub bands obtained through stationa...

A bipartite graph G = (U, V ;E) is called ǫ-regular if the edge density of every sufficiently large induced subgraph differs from the edge density of G by no more than ǫ. If, in addition, the degree of each vertex in G is between (d− ǫ)n and (d+ ǫ)n, where d is the edge density of G and |U | = |V | = n, then G is called super (d, ǫ)-regular. In [Combinatorica, 19 (1999), pp. 437– 452] it was sh...

one of the locations of renal artery atherosclerosis is at the orifice of the renal artery, therefore thestructure of this orifice was assessed in 6 normal, adult male dogs by light microscopy (lm) andtransmission electron microscopy (tem). for the lm study, processed tissues were embedded in paraffinand sectioned serially into 6-μm thickness. sections were stained with orcein. for the tem stud...

Let G(V,E) be a graph with p vertices and q edges. A vertex labeling of G is an assignment f : V (G) → {1, 2, 3, . . . , p + q} be an injection. For a vertex labeling f, the induced Smarandachely edge m-labeling f S for an edge e = uv, an integer m ≥ 2 is defined by f ∗ S(e) = ⌈ f(u) + f(v) m ⌉ . Then f is called a Smarandachely super m-mean labeling if f(V (G))∪ {f(e) : e ∈ E(G)} = {1, 2, 3, ....

Let a and b be two positive integers. For the graph G with vertex set V(G) and edge set E(G) with p=IV(G)1 and q=IE(G)I, we define two sets Q(a) and PCb) as follows: Q(a) ={ ± a, ± (a+ 1), ... , ±(a +(q-2)12)} if q is even, Q(a) = (O} u( ± a, ± (a+ 1), ... , ±(a +(q-3)12)} if q is odd, PCb) ={ ± b, ± (b+ I), ... , ±(b +(p-2)/2) l if p is even, PCb) {Ol u( ±b,±(b+l), ... ,±(b+(p-3)12)} ifpisodd....