双锭电磁铸造实验研究

通过对双锭电磁铸造模拟实验，研究了感应线圈内磁场分布，以及感应线圈以结方式、铸锭间距、电源频率和电流的变化时磁场分布的影响，为指导铸造工艺提供参考。     

基于PHPCMS V9的留言板系统开发

PHPCMS V9是比较流行的PHP开发框架,已经应用到政府、教育、商业各个领域。千篇一律的网站并不能满足个性化的需求,网站需要进行二次开发,而留言板功能是很多网站所需要的。本文详细介绍了基于PHPCMS V9的留言板系统的开发过程。     

带有两次订购机会且两阶段需求相关的Newsboy模型

首先建立需求形式为一般随机变量情形下零售商的两次订购决策模型,并从理论上证明了在两个阶段需求相互独立情形下,零售商期望利润函数的下凹性及最优订购策略的存在唯一性,从而弥补了已有模型在寻求最优订购策略时采用数值方法所存在的缺憾;然后,建立两阶段需求相关情形下带有两次订购的Newsboy模型,给出了模型的分析解.数值实例验证了模型的求解过程,并得到了相关管理启示.     

Smooth Scheduling under Variable Rates or the Analog-Digital Confinement Game

This work considers non-terminating scheduling problems in which a system of multiple resources serves clients having variable needs. The system has m identical resources and n clients; in each time slot each resource may serve at most one client; in each such slot t each client γ has a rate, a real number ρ _γ (t), that specifies his needs in this slot. The rates satisfy the restriction ∑ _γ ρ _γ (t)≤m for any slot t. Except of this restriction, the rates can vary in arbitrary fashion. (This contrasts most prior works in this area in which the rates of the clients are constant.) The schedule is required to be smooth as follows: a schedule is Δ -smooth if for all time intervals I the absolute difference between the amount of service received by each client γ to his nominal needs of ∑ _t∈I ρ _γ (t) is less than Δ. Our objective are online schedulers that produce Δ-smooth schedules where Δ is a small constant which is independent of m and n. Our paper constructs such schedulers; these are the first online Δ-smooth schedulers, with a constant Δ, for clients with arbitrarily variable rates in a single or multiple resource system. Furthermore, the paper also considers a non-concurrent environment in which there is an additional restriction that each client is served at most once in each time slot; it presents the first online smooth schedulers for variable rates under this restriction. The above non-concurrent restriction is crucial in some applications (e.g., CPU scheduling). It has been pointed out that this restriction “adds a surprising amount of difficulty” to the scheduling problem. However, this observation was never formalized and, of course, was never proved. Our paper formalizes and proves some aspects of this observation. Another contribution of this paper is the introduction of a complete information, two player game called the analog-digital confinement game. In such a game pebbles are located on the real line; the two players, the analog player and the digital player, take alternating turns and each one, in his turn, moves some of the pebbles; the digital player moves the pebbles backwards by discrete distances while the analog player moves the pebbles forward by analog distances; the aim of the analog player is to cause one pebble (or more) to escape a pre-defined real interval while the aim of the digital player is to confine the pebbles into the interval. We demonstrate that this game is a convenient framework to study the general question of how to approximate an analog process by a digital one. All the above scheduling results are established via this game. In this derivation, the pebbles represent the clients, the analog player generates the needs of the clients and the digital player generates the schedule. Dedicated to the memory of Professor Shimon Even for his inspiration and encouragement     

振弦式力传感器一带二接线技术试验研究

大坝安全监测所用的振弦式测力监测仪器一般采用四芯屏蔽电缆实现信号输入和输出。”一带二”技术是在实际工作中根据施工现场的需要总结出来的一种应急补救措施。当振弦式仪器的信号电缆在埋设施工后,发生电缆故障时可以采取该技术措施来进行补救处理。试验结果表明监测信号完整且相互之间无干扰。     

A graph-theoretical clustering method based on two rounds of minimum spanning trees

Many clustering approaches have been proposed in the literature, but most of them are vulnerable to the different cluster sizes, shapes and densities. In this paper, we present a graph-theoretical clustering method which is robust to the difference. Based on the graph composed of two rounds of minimum spanning trees (MST), the proposed method (2-MSTClus) classifies cluster problems into two groups, i.e. separated cluster problems and touching cluster problems, and identifies the two groups of cluster problems automatically. It contains two clustering algorithms which deal with separated clusters and touching clusters in two phases, respectively. In the first phase, two round minimum spanning trees are employed to construct a graph and detect separated clusters which cover distance separated and density separated clusters. In the second phase, touching clusters, which are subgroups produced in the first phase, can be partitioned by comparing cuts, respectively, on the two round minimum spanning trees. The proposed method is robust to the varied cluster sizes, shapes and densities, and can discover the number of clusters. Experimental results on synthetic and real datasets demonstrate the performance of the proposed method.     

基于两阶段领导的多目标粒子群优化算法

提出一种基于两阶段领导的多目标粒子群算法(P-AMOPSO).该算法包含4个改进策略:基于强支配排序与拥挤距离排序相结合的构造外部集策略,基于两阶段的领导粒子选择策略,基于高斯分布及均匀分布相结合的变异策略,基于邻域认知的个体极值更新策略.通过几个典型的多目标测试函数对P-AMOPSO算法的性能进行测试,并与多目标优化算法进行对比.结果表明,P-AMOPSO算法具有较好的搜索性能.     

Quintic nonpolynomial spline method for the solution of a second-order boundary-value problem with engineering applications

Nonpolynomial quintic spline functions are used to develop a numerical algorithm for computing an approximation to the solution of a system of second order boundary value problems associated with heat transfer. We show that the approximate solutions obtained by our algorithm are better than those produced by other spline and domain decomposition methods. A comparison of our algorithm with nonpolynomial quadratic spline method is discussed with the help of two numerical examples.     

Dynamical systems identification using Gaussian process models with incorporated local models

Gaussian process (GP) models form an emerging methodology for modelling nonlinear dynamic systems which tries to overcome certain limitations inherent to traditional methods such as e.g. neural networks (ANN) or local model networks (LMN).The GP model seems promising for three reasons. First, less training parameters are needed to parameterize the model. Second, the variance of the model's output depending on data positioning is obtained. Third, prior knowledge, e.g. in the form of linear local models can be included into the model. In this paper the focus is on GP with incorporated local models as the approach which could replace local models network.Much of the effort up to now has been spent on the development of the methodology of the GP model with included local models, while no application and practical validation has yet been carried out. The aim of this paper is therefore twofold. The first aim is to present the methodology of the GP model identification with emphasis on the inclusion of the prior knowledge in the form of linear local models. The second aim is to demonstrate practically the use of the method on two higher order dynamical systems, one based on simulation and one based on measurement data.     

概念格的分布式集成算法研究

随着大数据时代的到来,海量数据的分布存储和分布计算变得越来越重要,其中概念格的分布式集成变得尤为紧迫。为了解决概念格的构格时间较长的问题,提出了面向概念格的分布式集成算法。概念格的集成是先对子概念格中的概念按内涵个数递减进行排序,再将排序后的子概念格集成为全局概念格。构造全局概念格选择两种集成方式:1)添加式集成方式,即主节点接收并集成来自所有子节点的子概念格;2)二路归并式集成方式,即各个子节点处的所有子概念格先集成,而后将所得的概念格提交给主节点接收并完成最终集成。实验表明,这两种概念格的分布式集成策略各有优缺点,但都能够减少概念格的构格时间。