Dominant mode characteristics of circular groove guide

Circular groove guide is a kind of waveguide for millimeter waves with low loss, large dimensions, and low dispersion. In this paper, the dominant mode characteristics of it is analysed. The technique that mode macthing method combines with point matching method is used to derive the Nth-order characteristic equation of the guide. The 1st order, 2nd order and 3rd order approximate curves that the normalized cutoff wavelength of circular groove guide varies with c/a are given. The attenuation curves are given at 1mm, 1.5mm and 3mm wavelength. The numerical results are in well agreement with the experimental results published.     

Lack of familial clustering of hepatitis C virus infection

BACKGROUND: Although transmission of hepatitis C virus (HCV) through parental exposure is well documented, it is still controversial whether familial clustering of HCV occurs. METHODS: To investigate risk factors for HCV infection, 109 cases and 84 non-infected controls were studied. In addition, 250 family members (104 men, 146 women) of cases and 170 family members of controls (64 men, 106 women) were tested for HCV infection using an anti-HCV antibody, alanine aminotransferase (ALT), and reverse transcribed polymerase chain reaction (RT-PCR). RESULTS: In the case-control analysis, people aged > or =60 were almost three times more likely to be infected by HCV than those aged <40. Risk of HCV infection was most strongly related to a history of blood transfusion (OR = 12.6, 95% CI: 4.3-36.5) followed by a history of jaundice (OR = 4.1, 95% CI: 1.3-12.6). Only one family member of cases and no-one related to the controls had HCV infection. CONCLUSIONS: These results suggest that, in Korea, age and parenteral exposure, such as a blood transfusion, are risk factors for HCV infection and familial clustering of HCV infection, if it occurs, is rare.     

Mixed variable optimization using Taguchi's orthogonal arrays

Taguchi's orthogonal arrays for robust design are used in this paper in a nontraditional way to solve a mixed continuous-discrete structural optimization problem. The factors of an orthogonal array correspond to the members of a structure and the levels of each factor correspond to the material choices of each member. Based on the number of factors to be studied and the number of levels of each factor, an appropriate orthogonal array is selected for each specific problem. The number of rows of the orthogonal array correspond to the number of experiments (i.e. continuous sizing optimizations) to be conducted. The response of these experiments, which are the weight of the optimal designs corresponding to different material settings, are then used to calculate the mean effect of each factor level. Some possible optimal material settings can then be determined. Three examples are presented in this paper. Analysis using Taguchi's orthogonal arrays was able to isolate several near optimal or optimal designs. The accuracy and efficiency of the proposed method compared to more traditional solution methodologies are also discussed.     

Medullary thyroid carcinoma: genetic advances, treatment recommendations, and the approach to the patient with persistent hypercalcitoninemia

Medullary thyroid cancer is a tumor of the thyroid C cells that occurs in sporadic and hereditary clinical settings. Genetic testing of at-risk individuals is available and has been applied to patient management. Plasma calcitonin levels are a sensitive marker for the presence of disease. Surgery offers the best hope for cure and also is an effective modality for managing metastatic and recurrent disease.     

Industrial Policies In A Maturing Taiwan Economy

Taiwan's successful industrialisation process with significant structural change now spans four decades. This paper analyses the role of small and medium enterprises and the development of secondary import substitution industries in Taiwan in relation to some policy debates. It is argued that market friendly and self-restrained industrial policies were key to the success of Taiwan's fast industrialisation. However, when Taiwan entered a more matured economy in the 1980s, a more liberal industrial policy was introduced.     

古尔班通古特沙漠梭梭林地NDVI的时间效应-基于物候变化和MODIS图像的研究

遥感图像信息提取研究是遥感研究中的一个关键问题,也是遥感研究的热点和难点之一。使用2000~2010年MODIS-NDVI 16 d合成数据和物候记录,借助GIS空间分析和统计分析方法,重构了古尔班通古特沙漠梭梭林地Mean NDVI时间序列特征曲线。分析物候与Mean NDVI时间序列表明,梭梭林地内的短命植物生长期早于梭梭。研究梭梭林地Mean NDVI时间序列曲线发现,曲线中存在一个明显区别于其他地物的特征点,该点可以作为梭梭林地信息“诊断点”。根据“诊断点”特征构建了梭梭林地特征指数模型(HFFI),进而反演了古尔班通古特沙漠梭梭林地信息,并利用地面实际观测资料进行验证,结果表明分类精度达到83%。     

基于组反馈融合机制的视频超分辨率模型

视频超分辨率（video super-resolution,VSR）的目的是利用多个相邻帧的信息来生成参考帧的高分辨率版本。现有的许多VSR工作都集中在如何有效地对齐相邻帧以更好地融合相邻帧信息,而很少在相邻帧信息融合这一重要步骤上进行研究。针对该问题,提出了基于组反馈融合机制的视频超分辩模型（GFFMVSR）。具体来说,在相邻帧对齐后,将对齐视频序列输入第一重时间注意力模块;然后,将序列分成几个小组,各小组依次通过组内融合模块实现初步融合。不同小组的融合结果经过第二重时间注意力模块;然后,各小组逐组输入反馈融合模块,利用反馈机制反馈融合不同组别的信息,最后将融合结果输出重建。经验证,该模型具有较强的信息融合能力,在客观评价指标和主观视觉效果上都优于现有的模型。     

Roll‐to‐roll UV embossing process applied for light bar‐based sub‐wavelength gratings for backlight

This study proposes a roll‐to‐roll process‐based sub‐wavelength grating, which is attached on a light bar to turn the side‐lit red/green/blue (620, 520, and 450 nm) incident rays into a uniformly and normally output white light with high illuminance from the light bar's surface. On the basis of the rigorous coupling wave analysis, the relationship between the first‐order transmission/reflection efficiency and the pitch of the gratings with different shapes was analyzed. The optimal design can effectively reduce the coupling length and enhance the white color balance for display applications.     

Scalable influence maximization for independent cascade model in large-scale social networks

Influence maximization, defined by Kempe et al. (SIGKDD 2003), is the problem of finding a small set of seed nodes in a social network that maximizes the spread of influence under certain influence cascade models. The scalability of influence maximization is a key factor for enabling prevalent viral marketing in large-scale online social networks. Prior solutions, such as the greedy algorithm of Kempe et al. (SIGKDD 2003) and its improvements are slow and not scalable, while other heuristic algorithms do not provide consistently good performance on influence spreads. In this article, we design a new heuristic algorithm that is easily scalable to millions of nodes and edges in our experiments. Our algorithm has a simple tunable parameter for users to control the balance between the running time and the influence spread of the algorithm. Our results from extensive simulations on several real-world and synthetic networks demonstrate that our algorithm is currently the best scalable solution to the influence maximization problem: (a) our algorithm scales beyond million-sized graphs where the greedy algorithm becomes infeasible, and (b) in all size ranges, our algorithm performs consistently well in influence spread—it is always among the best algorithms, and in most cases it significantly outperforms all other scalable heuristics to as much as 100–260% increase in influence spread.