油泵柱塞和轴承外套失效分析

对断裂的油泵柱塞、轴承外套从成分、组织、工艺等方面进行了检验分析。结果表明，柱塞首先断裂，断裂后的柱塞碎片卡住了轴承外套，使轴承外套过载脆断。而柱塞的断裂是由于热处理不当，造成淬火加热温度过高，使柱塞的显微组织出现粗大的针状马氏体，并引起淬火裂纹，导致柱塞的韧性下降，脆性增大，随着载荷作用和液压油的渗入，裂纹进一步扩展，当裂纹扩展笃柱塞有效载面积承受不了全部工作应力时，发生脆性断裂。     

Race as a moderator in a model of sexual harassment: An empirical test.

L. F. Fitzgerald, C. L. Hulin. and F. Drasgow (1995) proposed that victim characteristics, such as race, might moderate the relationships between sexual harassment and its job, psychological, and health status outcomes. This study describes 2 theoretical positions, tokenism and double jeopardy, that could account for this possible moderation by race, as well as the alternative view that no moderating effects exist. The effects of race are empirically examined through simultaneous path analysis. Results indicate that whereas, mean levels of harassment differ across race, the phenomenon of sexual harassment unfolds similarly across races; race is not a moderator of the relationships between sexual harassment and the variables proposed as its antecedents and outcomes. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

车体痕迹检验在交通事故成因认定中的应用

交通事故成因分析是依法处理交通事故的重要环节,而车体痕迹检验结果是确定某些交通事故成因的重要证据。通过一起交通事故成因判定案例,讨论了在交通事故痕迹鉴定中车体痕迹和微量物证种属的检验方法,分析了车体痕迹特征、微量物证与交通事故成因认定的关系。     

多用炉处理圆锥外圈的畸变分析

研究了影响多用炉处理全淬透钢圆锥外圈畸变的因素，并对淬火后工件的锥度变化进行了分析，采用热油淬火和低速搅拌等措施，减少了圆锥外圈的淬火畸变。     

一种BPEL流程数据竞争检测方法

对使用业务流程执行语言(BPEL)组织流程中存在的数据竞争问题进行了研究,根据BPEL特性提出了一个静态分析和动态监控相结合的有效检测方法.实验结果表明,该方法能够准确检测出流程中存在的数据竞争,提高了流程的可靠性.     

Analysis of frequency‐selective impedance loading of transmission lines for dual‐band couplers

This article proposes an analytical design methodology for dual‐band hybrid couplers and baluns structures for any arbitrary frequency ratio using a stub‐loaded transmission line. An analysis of changing the impedance behavior of the stub, is carried out for the two bands of operation, which along with a dispersive analysis, emphasizes certain conditions where the existing methodology is not applicable. In addition, an extra degree of freedom has been included to increase the solutions for a given frequency ratio, thus providing greater flexibility and feasibility of the proposed structure. The design methodology is experimentally validated with the design and fabrication of dual‐band branch‐line and rat‐race couplers for various commercial frequency bands. © 2011 Wiley Periodicals, Inc. Int J RF and Microwave CAE , 2011.     

多线程程序时序分析的隐Markov模型

针对多线程程序数据竞争分析与检测困难的问题,提出一种基于隐Markov 模型的多线程程序时序分析方法.用随机变量不确定性刻画不同线程之间时序上的交互关系,分析数据竞争条件下程序不确定结果的概率分布情况;建立多线程程序时序分析的隐Markov 模型,使用Baum-Welch 和前向算法仿真上下文对程序实际运行状态的影响.实验结果表明,该模型能够快速有效反映多线程执行时序,用于指导多线程程序时序竞争检测过程.     

静态检测中断驱动程序的数据竞争

直接运行于微控制器上的中断驱动程序中可能存在一种重要的程序错误:数据竞争.然而当前主流的数据竞争静态检测技术因其服务于多线程模型程序而不适用.设计简明、易用的中断特征描述语言可以使得竞争检测具有平台无关性;同时,提出了一个流敏感的、上下文敏感的、考虑中断驱动程序原子性、易变性和部分随机性的数据竞争检测算法.该算法具有高效、精确的特点.实验表明,其检测时间与代码规模基本呈线性关系,分析17850行代码仅用时3.6s;同时,相比于基于锁集技术的典型数据竞争检测方法,其准确率平均是后者的2.13倍.     

Automated dynamic detection of busy–wait synchronizations

With the advent of multicores, multithreaded programming has acquired increased importance. In order to obtain good performance, the synchronization constructs in multithreaded programs need to be carefully implemented. These implementations can be broadly classified into two categories: busy–wait and schedule‐based. For shared memory architectures, busy–wait synchronizations are preferred over schedule‐based synchronizations because they can achieve lower wakeup latency, especially when the expected wait time is much shorter than the scheduling time. While busy–wait synchronizations can improve the performance of multithreaded programs running on multicore machines, they create a challenge in program debugging, especially in detecting and identifying the causes of data races. Although significant research has been done on data race detection, prior works rely on one important assumption—the debuggers are aware of all the synchronization operations performed during a program run. This assumption is a significant limitation as multithreaded programs, including the popular SPLASH‐2 benchmark have busy–wait synchronizations such as barriers and flag synchronizations implemented in the user code. We show that the lack of knowledge of these synchronization operations leads to unnecessary reporting of numerous races. To tackle this problem, we propose a dynamic technique for identifying user‐defined synchronizations that are performed during a program run. Both software and hardware implementations are presented. Furthermore, our technique can be easily exploited by a record/replay system to significantly speedup the replay. It can also be leveraged by a transactional memory system to effectively resolve a livelock situation. Our evaluation confirms that our synchronization detector is highly accurate with no false negatives and very few false positives. We further observe that the knowledge of synchronization operations results in 23% reduction in replay time. Finally, we show that using synchronization knowledge livelocks can be efficiently avoided during runtime monitoring of programs. Copyright © 2009 John Wiley & Sons, Ltd.