可重定位的基于事务的系统级验证

功能验证已经成为开发SoC的主要问题。随着一些复杂SoC的规模超过两千万门，以及对开发和集成嵌入式软件的需求持续增加，软件模拟器已经力所不及。在设计过程需要几百万个时钟周期来充分测试和验证软件功能的情况下，软件仿真器的性能下降到1-5Hz。按照这种速率，软件调试需要几年的时     

Mutant p53 Mediates Sensitivity to Cancer Treatment Agents in Oesophageal Adenocarcinoma Associated with MicroRNA and SLC7A11 Expression

TP53 gene mutations occur in 70% of oesophageal adenocarcinomas (OACs). Given the central role of p53 in controlling cellular response to therapy we investigated the role of mutant (mut-) p53 and SLC7A11 in a CRISPR-mediated JH-EsoAd1 TP53 knockout model. Response to 2 Gy irradiation, cisplatin, 5-FU, 4-hydroxytamoxifen, and endoxifen was assessed, followed by a TaqMan OpenArray qPCR screening for differences in miRNA expression. Knockout of mut-p53 resulted in increased chemo- and radioresistance (2 Gy survival fraction: 38% vs. 56%, p < 0.0001) and in altered miRNA expression levels. Target mRNA pathways analyses indicated several potential mechanisms of treatment resistance. SLC7A11 knockdown restored radiosensitivity (2 Gy SF: 46% vs. 73%; p = 0.0239), possibly via enhanced sensitivity to oxidative stress. Pathway analysis of the mRNA targets of differentially expressed miRNAs indicated potential involvement in several pathways associated with apoptosis, ribosomes, and p53 signaling pathways. The data suggest that mut-p53 in JH-EsoAd1, despite being classified as non-functional, has some function related to radio- and chemoresistance. The results also highlight the important role of SLC7A11 in cancer metabolism and redox balance and the influence of p53 on these processes. Inhibition of the SLC7A11-glutathione axis may represent a promising approach to overcome resistance associated with mut-p53.     

Switching to Directional Antennas with Constant Increase in Radius and Hop Distance

For any angle α<2π, we show that any connected communication graph that is induced by a set P of n transceivers using omni-directional antennas of radius 1, can be replaced by a strongly connected communication graph, in which each transceiver in P is equipped with a directional antenna of angle α and radius r _dir, for some constant r _dir=r _dir(α). Moreover, the new communication graph is a c-spanner of the original graph, for some constant c=c(α), with respect to number of hops.     

On the Need for Mixed Media in Distributed Requirements Negotiations

Achieving agreement with respect to software requirements is a collaborative process that traditionally relies on same-time, same-place interactions. As the trend toward geographically distributed software development continues, colocated meetings are becoming increasingly problematic. Our research investigates the impact of computer-mediated communication on the performance of distributed client/developer teams involved in the collaborative development of a requirements specification. Drawing on media-selection theories, we posit that a combination of lean and rich media is needed for an effective process of requirements negotiations when stakeholders are geographically dispersed. In this paper, we present an empirical study that investigates the performance of six educational global project teams involved in a negotiation process using both asynchronous text-based and synchronous videoconferencing-based communication modes. The findings indicate that requirement negotiations were more effective when the groups conducted asynchronous structured discussions of requirement issues prior to the synchronous negotiation meeting. Asynchronous discussions were useful in resolving issues related to uncertainty in requirements, thus allowing synchronous negotiations to focus more on removing ambiguities in the requirements.     

A formal framework for scenario development in support of environmental decision-making

Scenarios are possible future states of the world that represent alternative plausible conditions under different assumptions. Often, scenarios are developed in a context relevant to stakeholders involved in their applications since the evaluation of scenario outcomes and implications can enhance decision-making activities. This paper reviews the state-of-the-art of scenario development and proposes a formal approach to scenario development in environmental decision-making. The discussion of current issues in scenario studies includes advantages and obstacles in utilizing a formal scenario development framework, and the different forms of uncertainty inherent in scenario development, as well as how they should be treated. An appendix for common scenario terminology has been attached for clarity. Major recommendations for future research in this area include proper consideration of uncertainty in scenario studies in particular in relation to stakeholder relevant information, construction of scenarios that are more diverse in nature, and sharing of information and resources among the scenario development research community.     

Ultra‐fast‐switching flexoelectric liquid‐crystal display with high contrast

Abstract— The flexoelectro‐optic effect provides a fast‐switching mechanism (0.01–0.1 msec), suitable for use in field‐sequential‐color full‐motion‐video displays. An in‐plane electric field is applied to a short‐pitch chiral nematic liquid crystal aligned in the uniform standing helix (or Grandjean) texture. The switching mechanism is experimentally demonstrated in a single‐pixel test cell, and the display performance is investigated as a function of device parameters. A contrast ratio of 2000:1 is predicted.     

RMAIN: Association rules maintenance without reruns through data

Association rules are well recognised as a data mining tool for analysis of transactional data, currently going far beyond the early basket-based applications. A wide spectrum of methods for mining associations have been proposed up to date, including batch and incremental approaches. Most of the accurate incremental methods minimise, but do not completely eliminate reruns through processed data. In this paper we propose a new approximate algorithm RMAIN for incremental maintenance of association rules, which works repeatedly on subsequent portions of new transactions. After a portion has been analysed, the new rules are combined with the old ones, so that no reruns through the processed transactions are performed in the future. The resulting set of rules is kept similar to the one that would be achieved in a batch manner. Unlike other incremental methods, RMAIN is fully separated from a rule mining algorithm and this independence makes it highly general and flexible. Moreover, it operates on rules in their final form, ready for decision support, and not on intermediate representation (frequent itemsets), which requires further processing. These features make the RMAIN algorithm well suited for rule maintenance within knowledge bases of autonomous systems with strongly bounded resources and time for decision making. We evaluated the algorithm on synthetic and real datasets, achieving promising results with respect to either performance or quality of output rules.