浅谈高校人才流失的预防策略

高校能否留住人才是关系到其生存和发展的关键问题。本文阐述了一般高校人才流失的负面影响 ,分析了原因 ,并就问题的解决提出了自己的观点。     

群的n—伪正规子群

“本文引入了群的民;—伪正规子群的概念,并结合文[1]中n次方群及n次方闭群的概念和结果得到若干有益的绪论。     

直面政治主体的历史选择时限

考察一些老党、大党在 2 0世纪最后几十年被历史所淘汰的根源 ,可以看出 :政治主体的历史选择时限由执政根基中起重要作用的经济因素所决定 ,除此之外 ,政党的内聚力和社会动员功能也不容忽视。     

高校团员意识教育的生长点内化点群集凝聚点

团员意识的共性本质是记得起自己是团员、先进青年、党的助手与后备军.高校团员意识还带有浓重的学习、志愿、法制、团队意识的高学历个性色彩.面对办学体制改革、网络冲击、市场人才需求压力、转型期价值整合,世界文化的碰撞磨合所带来的高校团员意识教育新难题,探索表明思想政治教育通道是团员意识的生长点;实践活动教育通道是团员意识的内化点;团的组织建设通道是团员意识的群集凝聚点.     

语篇衔接手段与汉译英

英语和汉语在运用各种衔接手段创建语篇的连贯关系上有着较大差异。英语注重“形合”,倾向于采用显性的衔接手段 ;而汉语注重“意合”,较多地采用隐性的衔接方式。因此 ,译者在汉译英时应当注意二者的不同 ,进行适当调整 ,才能译出流利通顺的文章。     

准素子群的正规化子具有给定指数的有限群的幂零长

研究了已给准素子群的正规化子指数的有限群.给出了所有准素子群的正规化子有素数幂指数的有限 群的幂零长的界.     

轻微刑事案件侦、捕、诉联动机制构建

侦查机关与检察机关既有诉讼职能的一致性,也有职业思维与能力上的差异性。侦查权应然层面属于行使公诉权的检察机关,而具体实施侦查权的主体则应当多元化。在现有刑事诉讼体制不做大的修改之前提下,侦检关系的务实抉择是构建切实可行的侦、捕、诉联动机制,以使轻微刑事案件办理既符合诉讼效率的要求,又不偏离公正的轨道。     

Assessing and communicating heterogeneity of treatment effects for patient subpopulations: The hardest problem there is

Heterogeneity is an enormously complex problem because there are so many dimensions and variables that can be considered when assessing which ones may influence an efficacy or safety outcome for an individual patient. This is difficult in randomized controlled trials and even more so in observational settings. An alternative approach is presented in which the individual patient becomes the “subgroup,” and similar patients are identified in the clinical trial database or electronic medical record that can be used to predict how that individual patient may respond to treatment.     

词汇衔接手段与大学英语六级写作

衔接手段是一个语篇连贯的重要条件,在语篇衔接和连贯理论的指导下,分析词汇衔接手段及其在大学英语六级写作中的运用,指出词汇衔接手段的熟练运用是非英语专业考生在大学英语六级考试写作中获得高分的重要条件,因此,在英语写作教学中,教师应注重对词汇衔接手段的介绍及其运用.     

Graph based isomorph-free generation of two-level regular fractional factorial designs

We provide a new necessary and sufficient check for testing the isomorphism of two 2-level regular fractional factorial designs. The approach is based on modeling fractional factorial designs as bipartite graphs. We employ an efficient canonical graph labeling approach to compare two designs for isomorphism. We then improve upon the existing non-isomorphic fractional factorial design generation algorithm by reducing the number of candidate designs from which isomorphs need to be removed. Not only does our method generate non-isomorphic designs much faster, it is also able to generate designs with run sizes of 2048 and 4096 runs, which were not generated by the existing methods.