案例教学及其在《心理咨询》课程教学中的运用

案例教学是当代一种很有发展潜力的教学模式。本文阐述了案例教学的起源、案例的特性,以及案例教学在《心理咨询》教学中运用和应注意的问题。     

论偷渡案件中的几个基本法律问题

随着国际形势的变化以及我国对偷渡犯罪案件打击力度的加强,此类犯罪案件的手段及表现形式也日趋复杂,而立法的滞后性又是必然特点,因此,在司法实践中对于具体犯罪的认定方面就出现了意见不一的现象,也引发了理论界的争议。为此,拟对偷渡犯罪案件中的具体犯罪认定的几个问题进行探讨,以期在交流中获得共识。     

国内外基础化学教学对比及应用

我国目前基础化学的教学内容和课程体系,应参考美、英、德等国的基础化学教育理念和教学手段,从拓宽教学知识体系、引入学科前沿成果、加强案例素材应用、完善多媒体教学、充分发挥学生的主体作用等方面入手,同时通过多种教学手段尝试和改进,达到激发学生兴趣、提升学生科学素养的目的,以增强教学效果。     

案例教学法在工业企业防火教学中的应用

工业企业防火课程具有较强的理论知识性和实践应用性,其教学必须体现理论讲授为主导,实践应用为主体的教学指导思想。而传统的教学方法不能真正实现师生互动,无法培养学生学习的主动性和创造性。为弥补传统教学模式中存在的缺陷,将案例教学法引入工业企业防火课堂教学中,取得了良好的教学效果。     

Analysis of practical policies for a single link distribution system

In this paper we consider a transportation problem where several products have to be shipped from an origin to a destination by means of vehicles with given capacity. Each product is made available at the origin and consumed at the destination at the same constant rate. The time between consecutive shipments must be greater than a given minimum time. All demand needs to be satisfied on time and backlogging is not allowed. The problem is to decide when to make the shipments and how to load the vehicles with the objective of minimizing the long run average of the transportation and the inventory costs at the origin and at the destination over an infinite horizon. We consider two classes of practical shipping policies, the zero inventory ordering (ZIO) policies and the frequency‐based periodic shipping (FBPS) policies. We show that, in the worst‐case, the Best ZIO policy has a performance ratio of . A better performance guarantee of is shown for the best possible FBPS policy. The performance guarantees are tight. Finally, combining the Best ZIO and the Best FBPS policies, a policy that guarantees a performance is obtained. Computational results show that this policy gives an average percent optimality gap on all the tested instances of <1%. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

一种基于UML/OCL的软件测试方法

根据UML/OCL和建模环境提供的软件模型信息,以一个武器装备管理信息系统的装备入库顺序图为例,在分析UML/OCL顺序图的语法和对象间的交互信息的基础上产生测试场景,提供了一种基于UML/OCL的面向对象的软件测试方法,并提出测试自动化的设想,对软件测试有一定的借鉴作用。     

Two‐machine flow shop no‐wait scheduling with a nonavailability interval

We study a two‐machine flow shop scheduling problem with no‐wait in process, in which one of the machines is not available during a specified time interval. We consider three scenarios of handing the operation affected by the nonavailability interval. Its processing may (i) start from scratch after the interval, or (ii) be resumed from the point of interruption, or (iii) be partially restarted after the interval. The objective is to minimize the makespan. We present an approximation algorithm that for all these scenarios delivers a worst‐case ratio of 3/2. For the second scenario, we offer a 4/3‐approximation algorithm. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

Bin‐packing problem with concave costs of bin utilization

We consider a generalized one‐dimensional bin‐packing model where the cost of a bin is a nondecreasing concave function of the utilization of the bin. Four popular heuristics from the literature of the classical bin‐packing problem are studied: First Fit (FF), Best Fit (BF), First Fit Decreasing (FFD), and Best Fit Decreasing (BFD). We analyze their worst‐case performances when they are applied to our model. The absolute worst‐case performance ratio of FF and BF is shown to be exactly 2, and that of FFD and BFD is shown to be exactly 1.5. Computational experiments are also conducted to test the performance of these heuristics. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

案例教学法在学前教育学课程教学中的运用

学前教育学课程是学前教育专业学生系统学习本专业知识的认知起点,在教学中运用案例教学法能弥补学生对本专业的感性认知和实践经验的缺乏,对于教师的"教"、学生的"学"和师生之间、生生之间的互动都有十分重要而有益的价值。本文诠释了案例教学法的基本内涵,在此基础上论述了案例教学法在学前教育学课程教学中的重要价值,最后探讨了在学前教育学课程教学中案例教学法的实施过程和应当注意的问题。     

Parallel machine scheduling with batch deliveries to minimize total flow time and delivery cost

Motivated by the flow of products in the iron and steel industry, we study an identical and parallel machine scheduling problem with batch deliveries, where jobs finished on the parallel machines are delivered to customers in batches. Each delivery batch has a capacity and incurs a cost. The objective is to find a coordinated production and delivery schedule that minimizes the total flow time of jobs plus the total delivery cost. This problem is an extension of the problem considered by Hall and Potts, Ann Oper Res 135 (2005) 41–64, who studied a two‐machine problem with an unbounded number of transporters and unbounded delivery capacity. We first provide a dynamic programming algorithm to solve a special case with a given job assignment to the machines. A heuristic algorithm is then presented for the general problem, and its worst‐case performance ratio is analyzed. The computational results show that the heuristic algorithm can generate near‐optimal solutions. Finally, we offer a fully polynomial‐time approximation scheme for a fixed number of machines. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 492–502, 2016