Designing Modular Software: A Case Study in Introductory Statistics

Modular programming is a development paradigm that emphasizes self-contained, flexible, and independent pieces of functionality. This practice allows new features to be seamlessly added when desired, and unwanted features to be removed, thus simplifying the software's user interface. The recent rise of web-based software applications has presented new challenges for designing an extensible, modular software system. In this article, we outline a framework for designing such a system, with a focus on reproducibility of the results. We present as a case study a Shiny-based web application called intRo, that allows the user to perform basic data analyses and statistical routines. Finally, we highlight some challenges we encountered, and how to address them, when combining modular programming concepts with reactive programming as used by Shiny. Supplementary material for this article is available online.     

Single Machine Batch Scheduling Problem with Resource Dependent Setup and Processing Time in the Presence of Fuzzy Due Date

We consider a batch scheduling problem on a single machine which processes jobs with resource dependent setup and processing time in the presence of fuzzy due-dates given as follows:1. There are n independent non-preemptive and simultaneously available jobs processed on a single machine in batches. Each job j has a processing time and a due-date.2. All jobs in a batch are completed together upon the completion of the last job in the batch. The batch processing time is equal to the sum of the processing times of its jobs. A common machine setup time is required before the processing of each batch.3. Both the job processing times and the setup time can be compressed through allocation of a continuously divisible resource. Each job uses the same amount of the resource. Each setup also uses the same amount of the resource.4. The due-date of each job is flexible. That is, a membership function describing non-decreasing satisfaction degree about completion time of each job is defined.5. Under above setting, we find an optimal batch sequence and resource values such that the total weighted resource consumption is minimized subject to meeting the job due-dates, and minimal satisfaction degree about each due-date of each job is maximized. But usually we cannot optimize two objectives at a time. So we seek non-dominated pairs i.e. the batch sequence and resource value, after defining dominance between solutions.A polynomial algorithm is constructed based on linear programming formulations of the corresponding problems.     

基于FA-DEA聚类的模式分析方法及在我国软件园研究中的应用

模式分析方法日益成为现代经济管理研究的主流方法之一,但是目前关于模式分析的结构化方法的研究还不多见.本文提出了基于FA-DEA聚类的模式研究结构化方法,这个方法区别于以往文献的是采用了混合聚类方法,综合运用关键因素的绝对量信息和效率的相对量信息.基于上述方法,本文确定了我国软件园发展的三种发展模式.并对三个模式的条件、特征以及它们之间的分界与演进做了详细的描述.最后,给出了若干建议.     

一类(L)ukasiewicz n+1值逻辑系统中VDF问题的求解理论

为在经典逻辑学中建立Fuzzy分离规则的推理模式，由赋值决定公式问题（简称VDF问题）已经提出，并已在二值命题逻辑L和p＋1（p为素数）值Lukasiewicz命题逻辑中得到了解决，但是对一般的n＋1（n〉3且n不是素数）值Lukasiewicz命题逻辑系统L（n＋1），VDF问题相当复杂且尚未解决．本文尝试在一类特殊的n＋1值Lukasiewicz命题逻辑系统L（n＋1），即L（n＋1）的赋值域W（n＋1）的所有子代数在包含序下构成一个链中建立VDF问题的求解理论，并完满地解决了这类n＋1值Lukasiewicz命题逻辑系统L（n＋1）中的VDF问题．     

矿产资源密集型区域可持续发展模式的系统动力学仿真研究

矿产资源密集型区域经济发展与人口增长、资源消耗、环境污染和体制滞后之间的矛盾日益凸显.如何协调他们之间的关系成为区域经济可持续发展的当务之急.对区域内各子系统之间的相互关系和内部作用机制进行了分析,以黑龙江省为例构建了矿产资源密集型区域可持续发展模式的系统动力学模型并对该区域的标准发展模式、传统发展模式、准绿色发展模式和绿色发展模式进行仿真模拟.结果表明:人口和谐发展、资源高效利用、环境污染有效控制、严格实施生态制度监管以及大力加强区域间融合的绿色发展模式是当前矿产资源密集型区域可持续发展模式的最佳选择.     

直觉模糊GM(1,1)模型及其在灰色发展决策的应用

研究了以直觉模糊数为对象的GM(1,1)模型并运用到灰色发展决策方法。利用灰色系统理论中核和灰度的内涵,将直觉模糊数的犹豫度和记分函数结合构建了直觉模糊数序列 GM(1,1)预测模型,从而实现了直觉模糊数的预测。在此基础上结合变权原理提出了基于直觉模糊数的灰色发展决策方法。最后,算例分析说明了该方法的合理性和可行性。