一个函数不等式的加强与延伸

从一个常见的不等式谈起,分析了多种证明方法,运用该不等式推导出了多个重要结论,对不等式进行了扩充和加强,解释了蕴含的意义,显示了该不等式的重要性和深刻性.     

基于粗糙集的患者满意度评价模型及其实证分析

在文献阅读及实地调研的基础上,本文提出了患者满意度的定义,建立了影响患者满意度的指标体系,介绍了粗糙集的相关概念及利用粗糙集进行评价的步骤,提出了新的约简方法,构建了基于粗糙集的患者满意度评价模型并进行了实证分析,得出了影响患者满意度的关键指标,并计算了关键指标权重,对江西省十个医院进行了综合评价值的计算.     

交通运输系统协调发展理论与模型研究

提出了交通运输系统协调度的评价分析模型.从系统论的观点出发,提出了交通运输系统协调理论的概念,探讨了交通运输系统随时间而不断演化变迁的规律,给出了交通运输系统协调发展基本步骤;并根据协调学原理,讨论了交通运输系统的协调性问题,提出了系统协调发展模型,对交通运输子系统内部及子系统之间及系统整体的协调发展问题进行了研究,探讨了交通运输可持续发展的系统协调管理过程,为进一步研究交通运输系统的可持续发展奠定了基础.     

关于举办2012年中学生数学奥林匹克夏令营活动的启事

从1996年至今,华中师范大学数学与统计学学院已成功举办多届全国中学生数学奥林匹克夏令营活动,培养了大批优秀的数学竞赛选手,他们经过权威名师的指点,既丰富了理论知识,更掌握了实践经验,为走上成功明确了航向,在国内、国际数学竞赛中取得了令人瞩目的成绩。我院已成为全国数学奥林匹克活动的重要培训基地,吸引了众多优秀中学生云集武汉参     

系统动力学在城市污水再生回用系统中的应用

用系统动力学方法研究了城市污水回用系统.首先分析了影响城市污水回用系统的诸多因素以及它们之间的相互关系,探讨了污水再生回用系统行为和结构的特点,确定了系统中因素之间的定量关系,建立了城市污水回用系统动力学(SD)模型,并介绍了模型的检验方法.同时给出了SD模型的具体应用实例,对西北地区的某一城市的污水回用进行了预测和分析,提出了符合该城市发展的污水回用方案.     

压板松动时大型发电机端部绕组的主共振与分岔

研究了大型汽轮发电机定子端部固定绕组的压板松动时,位于两侧压板间某段绕组的振动问题．首先,采用分离变量法,给出了发电机运行时定子端部绕组区域的磁感应强度表达式,并给出了绕组所受电磁力及与松动压板间摩擦力的计算式．其次,建立了研究绕组非线性振动问题的力学分析模型,采用多尺度法对主共振情形进行了解析求解,推得了稳态运动下的幅频响应方程,并对定常解的稳定性及分岔奇异性进行了研究,得到了稳定性的判定条件及分岔方程的转迁集．最后,针对工程实际问题进行了计算,给出了相应的幅频响应曲线图,并进行了分析讨论．     

求解资源受限项目调度问题的人工鱼群算法

提出了将人工鱼群算法应用于求解资源受限项目调度问题中的构想,建立了求解资源受限项目调度问题的人工鱼群算法模型,设计了一种标准随机键编码方式,构建了人工鱼的觅食行为、聚群行为、追尾行为和随机行为四种基本算子,采用了正向逆向局部改进技术和精英保留策略,并给出了算法流程。应用PSPLIB标准问题库对该算法进行了大量的测试,并与其他算法进行了比较,验证了该算法的有效性。     

红树林自然保护区湿地生态系统的数学模型及其应用

研究了红树林自然保护区自然环境和人类社会活动对于生态系统的影响,考虑了生物之间的相互关系,将生物量、生物生长的面积等作为主要指标,建立了常微分方程组模型,对生态系统的变化情况进行了描述,借助稳定性分析对方程进行了研究,并进行了数值模拟。根据理论分析和数值模拟的结果,对保护区的林木恢复工作提出了合理的建议。     

网络安全产品研究

本文在研究了网络安全的国内外有关情况后对网络安全技术进行了探讨 ,介绍了一种简单而实用的网络安全产品 ,添补了这方面的空白 ,而且本文介绍的产品已经应用到了许多部门 ,为网络安全做出了贡献     

一个游戏难题的推广、建模及求解

推广了RPG游戏中的一个难题,建立了相应的数学模型,给出了完善的解决方案,深化了现行的相关结果.     

煤层注水非线性渗流方程的解析解及应用

本文运用流体力学,多孔介质流体动力学,渗流理论等理论知识,结合实验室和现场试验,从理论上对煤层注水预湿煤体机理进行了研究.分析了煤层注水过程,建立起了煤层注水的数学模型;对煤层注水的边界条件进行了描述.由于描述煤层注水的方程组为非线性的,为简化它们,利用了因次分析理论,引入了注水压力,渗透速度,煤水份增加量等无因次量.之后讨论了其解析和近似解.另外:结合实际煤层注水的科研项目,说明了该理论指导煤层注水及设计的作用和重要性.     

Transition to turbulence, small disturbances, and sensitivity analysis I: A motivating problem

For over 100 years, researchers have attempted to predict transition to turbulence in fluid flows by analyzing the spectrum of the linearized Navier-Stokes equations. However, for many simple flows this approach fails to match experimental results. Recently, new scenarios for transition have been proposed that are based on the interaction of the linearized equations of motion with small disturbances to the flow system. These new “mostly linear” theories have increased our understanding of the transition process, but the role of nonlinearity has not been explored in detail. This paper is the first of a two part work in which sensitivity analysis is used to study the effects of small disturbances on transition to turbulence. In this part, we study a highly sensitive one-dimensional Burgers' equation as a motivating problem. Sensitivity analysis is used to predict the large changes in solutions in the presence of a small disturbance. Also, sensitivity analysis is shown to provide more information about the disturbed nonlinear problem than a purely linear analysis of the problem. In the second part of this work, this analysis will be extended to the three-dimensional Navier-Stokes equations to show that small disturbances have great potential to trigger transition to turbulence.     

快递企业航空货运网络的构建

快递业竞争激烈,构建高效合理的航空货运网络是快递企业提高竞争力的重要手段。“枢纽—辐射”式航空货运网络是整合航空快递资源、提高航空快递资源利用效率、提高快递企业竞争力的有效模式。本文以降低航空快递网络成本、加快航空快递处理时间为目标,从航空快递网络枢纽的选取、指派关系的确定、枢纽个数的选择三个方面研究了航空快递网络模型建立问题,选用遗传算法求解不同枢纽个数下航空快递网络的运输成本,并据此进行枢纽的选取,运用重力模型法进行指派关系的确定,在此基础上运用超效率DEA模型确定枢纽个数。接着,以包含17个节点的顺丰航空快递网络的规划为例,对本文所提出的模型和算法进行了验证,验证结果证实了模型的合理性。本文的研究为快递企业构建航空货运网络提供了科学实用的方法,该方法的使用可以降低航空货运成本,提高效率,从而提高快递企业的竞争力。     

出租车司机社会贡献评价方法研究

出租车司机的社会贡献对于促进城市经济发展和社会进步具有重要的作用,评价出租车司机的社会贡献是激励出租车司机多做社会贡献的重要手段。为了评价出租车司机的社会贡献,本文提出了一种基于实际出租车运营数据的评价方法。本文设计了运营特性、重点区域、恶劣天气、大事件四个体现司机社会贡献的指标,以此构建了出租车司机社会贡献评价指标体系,进而选用了主观赋权法G1法和客观赋权法拉开档次法相结合的赋权方式对指标赋权,并选择四种评价信息集结方法建立了出租车司机社会贡献评价模型。最后,通过实际的出租车运营数据验证了本方法的可行性。本文为评价出租车司机社会贡献提供了一种研究思路和方法,并对政府政策的制定和企业策略的实施具有一定的启示。     

Auxiliary tool allocation in flexible manufacturing systems

This paper analyses a new approach to the machine loading problem arising in flexible manufacturing systems (FMSs). This approach allows the operations to be assigned to machines assuming that machines have access to all the tools required for their operations. This exploits the flexibility of the FMS completely. Next an allocation of tools to machines is determined which satisfies the tool requirements for each machine and minimizes the total number of tools. Thus this approach minimizes the unnecessary tool duplications in the system and maximizes the tool utilization. The problem is modeled as an integer linear program (ILP). We notice that the main problem has a block diagonal structure which is decomposable by relaxing a set of linking constraints. Each separated sub-problem represents a problem of allocation of a single type of tools. We develop a branch-and-bound based exact solution procedure and three heuristic procedures to solve the sub-problems. Our lower bounding approach uses Lanrangean relaxation. The solutions to the Lagrangean relaxation are further used to determine the branching sequences and to develop heuristic approaches. Since finding even a feasible solution to the main problem is NP-hard, we develop only enumerative procedures to solve the main problem. Finally, these solution procedures are tested on randomly generated test problems.     

Mathematical programming modeling of the Response Time Variability Problem

The Response Time Variability Problem (RTVP) is a scheduling problem that has recently been defined in the literature. The RTVP has a broad range of real-life applications from manufacturing to services and information technology. A previous study developed a position exchange heuristic to apply to initial sequences for the RTVP, and a MILP (Mixed Integer Linear Programming) to obtain optimal solutions with a practical limit of 25 units to be scheduled. This paper aims to improve the best mathematical programming model developed thus far in order to solve larger instances up to 40 units to optimality. The contribution of this paper is 4-fold: (i) larger instances can be solved to optimality by the off the shelf standard software; (ii) the new optimal solutions of the RTVP can be used to compare the results of heuristic procedures; (iii) the importance of modeling is demonstrated, as well as the huge impact that reformulation, redundant constraints and the elimination of symmetries have on the efficiency of MILPs is clearly established; finally (iv) a challenge to develop a customized optimization algorithm to rival the MILP solution efficiency for the RTVP is put forward.     

Factorisation of Littlewood-Richardson coefficients

The hive model is used to show that the saturation of any essential Horn inequality leads to the factorisation of Littlewood-Richardson coefficients. The proof is based on the use of combinatorial objects known as puzzles. These are shown not only to account for the origin of Horn inequalities, but also to determine the constraints on hives that lead to factorisation. Defining a primitive Littlewood-Richardson coefficient to be one for which all essential Horn inequalities are strict, it is shown that every Littlewood-Richardson coefficient can be expressed as a product of primitive coefficients. Precisely the same result is shown to apply to the polynomials defined by stretched Littlewood-Richardson coefficients.     

Using box indices in supporting comparison in multiobjective optimization

Because of the conflicting nature of criteria or objectives, solving a multiobjective optimization problem typically requires interaction with a decision maker who can specify preference information related to the objectives in the problem in question. Due to the difficulties of dealing with multiple objectives, the way information is presented plays a very important role. Questions posed to the decision maker must be simple enough and information shown must be easy to understand. For this purpose, visualization and graphical representations can be useful and constitute one of the main tools used in the literature. In this paper, we propose to use box indices to represent information related to different solution alternatives of multiobjective optimization problems involving at least three objectives. Box indices are an intelligible and easy to handle way to represent data. They are based on evaluating the solutions in a natural and rough enough scale in order to let the decision maker easily recognize the main characteristics of a solution at a glance and to facilitate comparison of two or more solutions in an easily understandable way.     

Learning to Ignore Online Help Requests

Email discussion groups provide a useful way of organizing email communities with a common interest in a certain topic. Emails submitted to the discussion group are sent automatically to each individual member, thereby eliminating the need to send multiple emails. This method may present unexpected difficulties however, when it comes to cooperation between members. An experimental study shows that email requests for help sent through discussion groups received less responses than emails sent individually to members of a group. Furthermore, subscribers to large discussion groups responded less often to help requests, whether they were sent to the group as a whole or to individuals. These results are discussed in terms of the separate roles of social cues and experience on the diffusion of responsibility effect.