MPP数据并行FORTRAN汇编代码模拟环境的设计与实现

本文阐述了一种在单机上模拟ＭＰＰ机执行并行汇编代码的方法。这种并行汇编代码由ＭＰＰＦＯＲＴＲＡＮ编译器生成。由于在一个大型工程中，编译生成的目标代码运行环境不一定能及时具备，所以，研制汇编代码模拟环境ＤＰＦＡＳ有助于及早验证编译目标代码的正确性和完备性。本文通过共享进程组在ＳＧＩ工作站上实现多机环境模拟和远程地址访问模拟。此模拟环境的实现对ＭＰＰ数据并行ＦＯＲＴＲＡＮ编译器的正确性验证和效率评估有一定的帮助。     

论教育传播学视角下的课堂互动

本文针对当前课堂教学互动中存在的问题,从教育传播学的理论视角下对其进行了分析。笔者认为,可以将课堂互动理解为特殊的教学媒体,特定的教学过程以及特别的传播环境。以期实现对课堂互动的重定位,构建一个高效、民主、和谐的教学与学习环境,实现教与学的最优化。     

使用FPGA设计高可靠SpaceWire路由器

为了提高系统的可靠性和可用性，提出一种基于静态随机存取存储器（Static Random-Access Memory,SRAM）型现场可编程门阵列（Field-Programmable Gate Array, FPGA）的SpaceWire路由器设计方法。路由器通过系统级三模冗余技术加固，采用基于位流重定位的动态部分刷新技术修复系统中发生的软故障，并提出一种基于工作输入和健康现态的实时状态同步方法，以确保故障模块修复后的状态与其他模块同步。因此，该系统能够进行错误掩蔽和自我修复。在Xilinx Virtex-5 FPGA开发板ML507上对所提出的路由器系统结构和设计方法进行实现和验证。实验结果表明，路由器的可靠性和可用性显著增加，且系统的实时性很好，能保证路由器在整个工作过程中提供正常服务而不会引起系统功能中断或延迟；位流重定位技术的采用将所需存储空间减少三分之二，同时也降低了原始位流本身故障的可能性。     

A mathematical formulation and efficient heuristics for the dynamic container relocation problem

The container relocation problem (CRP) is concerned with emptying a single yard‐bay which contains J containers each following a given pickup order so as to minimize the total number of relocations made during their retrieval process. The CRP can be modeled as a binary integer programming (IP) problem and is known to be NP‐hard. In this work, we focus on an extension of the CRP to the case where containers are both received and retrieved from a single yard‐bay, and call it the dynamic container relocation problem. The arrival (departure) sequences of containers to (from) the yard‐bay is assumed to be known a priori. A binary IP formulation is presented for the problem. Then, we propose three types of heuristic methods: index based heuristics, heuristics using the binary IP formulation, and a beam search heuristic. Computational experiments are performed on an extensive set of randomly generated test instances. Our results show that beam search heuristic is very efficient and performs better than the other heuristic methods.Copyright © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 101–118, 2014     

Fire truck relocation during major incidents

The effectiveness of a fire department is largely determined by its ability to respond to incidents in a timely manner. To do so, fire departments typically have fire stations spread evenly across the region, and dispatch the closest truck(s) whenever a new incident occurs. However, large gaps in coverage may arise in the case of a major incident that requires many nearby fire trucks over a long period of time, substantially increasing response times for emergencies that occur subsequently. We propose a heuristic for relocating idle trucks during a major incident in order to retain good coverage. This is done by solving a mathematical program that takes into account the location of the available fire trucks and the historic spatial distribution of incidents. This heuristic allows the user to balance the coverage and the number of truck movements. Using extensive simulation experiments we test the heuristic for the operations of the Fire Department of Amsterdam‐Amstelland, and compare it against three other benchmark strategies in a simulation fitted using 10 years of historical data. We demonstrate substantial improvement over the current relocation policy, and show that not relocating during major incidents may lead to a significant decrease in performance.     

Great-power Responsibility,Side-effect Harms and American Drone Strikes in Pakistan

In International Relations (IR), the actions of great powers are usually assessed through their direct effects. Great powers are generally considered to be responsible for the consequences of their actions if they intentionally caused them. Although there is discussion on “double-effects” and “side-effect harms” in the realms of philosophy and political sociology, these largely remain absent from the field of IR. This article bridges that gap by clarifying a set of yardsticks through which side-effect harms of great powers’ actions can be evaluated, including “capacity”, “historical precedent”, “voluntarism” and “unintentional causality”. These yardsticks are deduced through the Theory of Special Responsibilities, which combines elements of Constructivism and the English School. The theoretical framework presented is then applied to the case of American drone strikes in the Federally Administered Tribal Areas (FATA) of Pakistan. A number of terrorists in FATA have relocated elsewhere within Pakistan to escape these strikes, subsequently harming individuals in new locations. The article asks: who bears responsibility for the harm brought to civilians by these dislocated terrorists? Analysis from the perspective of the theoretical framework, constructed and applied here, suggests that even if the US may claim not to have directly intended such an outcome, it still shares some responsibility for the harm to innocent civilians.     

Mathematical formulation and heuristic algorithm for the block relocation and loading problem

This study considers the block relocation and loading problem in container terminals. The optimal loading sequence and relocation location are simultaneously decided on the basis of the desired ship‐bay and initial yard space configuration. An integer linear programming model is developed to minimize the number of relocations in the yard space on the basis of no shifts in the ship bay. The accuracy of the model is tested on small‐scale scenarios by using CPLEX. Considering the problem size in the real world, we present a rule‐based heuristic method that is combined with a mathematical model for the removal, loading, and relocation operations. The influence of rules on algorithm performance is also analyzed, and the heuristic algorithm is compared with different types of algorithms in the literature. The extensive numerical experiments show the efficiency of the proposed heuristic algorithm.