Is the List of Incomplete Open Cubes Complete?

Variations of Incomplete Open Cubes is the major project by the twentieth-century conceptual artist Sol LeWitt. In this paper we interpret the enumerative component of the project as embeddings of graphs. This formulation permits use of an algorithm to check the completeness of the list of the structures produced by the artist. Our conclusion is that the artist found the correct number of structures (that is, 122), but that his list contains a mistake in the presentation of a pair of incomplete cubes, a discovery that appears not to have been noted before.     

Annular‐ring slot antenna designs with circular polarization radiation

The design of a microstrip‐fed annular‐ring slot antenna (ARSA) with circular polarization (CP) radiation is initially studied. To obtain CP radiation with broad 3‐dB axial ratio (AR) bandwidth that can cover the WiMAX 2.3 GHz (2305–2320 MHz, 2345–2360 MHz) and WLAN 2.4 GHz (2400–2480 MHz) bands, a novel technique of extending an inverted L‐shaped slot from the bottom section of the annular‐ring is proposed. To suppress the harmonic modes induced by the CP ARSA, the technique of integrating a defected ground structure into the annular‐ring slot is further introduced. From the measured results, 10‐dB impedance bandwidth and 3‐dB AR bandwidth of 44.86 and 9.68% were achieved by the proposed harmonic suppressed CP ARSA. Furthermore, average gain and radiation efficiency of ～4.7 dBic and 71%, respectively, were also exhibited across the bands of interest. © 2014 Wiley Periodicals, Inc. Int J RF and Microwave CAE 25:337–345, 2015.     

丙烷脱沥青装置调合前沥青的综合利用

在丙烷脱沥青装置加热炉试烧装置自产调合前沥青,通过观察油枪雾化沥青的能力、火嘴的燃烧情况以及燃烧后的烟尘状况,筛选出适合沥青燃烧的油枪,最终实现调合前沥青直接做加热炉燃料、减少重油出厂量的目的。     

Mixed coordination mechanisms for scheduling games on hierarchical machines

In this paper, we study scheduling games under mixed coordination mechanisms on hierarchical machines. The two scheduling policies involved are ‐ and ‐, where ‐ (resp., ‐) policy sequences jobs in nondecreasing order of their hierarchies, and jobs of the same hierarchy in nonincreasing (resp., nondecreasing) order of their processing times. We first show the existence of a Nash equilibrium. Then we present the price of anarchy and the price of stability for the games with social costs of minimizing the makespan and maximizing the minimum machine load. All the bounds given in this paper are tight.