基金最佳使用计划

本文给出了基金存款策略的数学模型.对于基金M使用n年的情况而言,首先把M分成n份,其中第i(1≤i≤n)份存款xi存期为i年,那么只有当第i(i ≤n-1)份资金按最佳存款策略存款到期后的本息和等于当年的奖学金数,并且第n份资金按最佳存款策略存款n年后的本息和等于原基金M与当年的奖学金数之和时,每年发放的奖学金才能达到最多.通过求解此模型,我们得到了基金的最佳存款策略,并求出了在n=10年,M=5000万元的情况下,基金的最佳使用方案.在可存款也可购买国库券时,采取一种转化方法,将国库券购买情况转化为相应年期的定期存款,结合问题(一)即可求得在n=10年,M=5000万元的情况下,基金的最佳使用方案;在第三年校庆时奖学金数额比其它年度多20%的问题的分析方法和模型的解决方法与前相同.     

Application of explicit schemes for the simulation of the two-phase filtration process

In the paper, the new model based on the kinetic approach is proposed to describe the process of two-phase slightly compressible fluid filtration. The capillary and gravity forces are taken into account. The obtained hyperbolic continuity equations for phase liquids are approximated by the explicit three-level schemes with a sufficiently mild stability condition. Due to its logical simplicity, the computational algorithm can be easily adapted to the hybrid architecture of modern supercomputers. The results of computations on a graphics accelerator are presented for the problem on contaminant infiltration into water-saturated soil and the high parallelization efficiency is demonstrated.     

An infrastructure for smart hospitals

In healthcare facilities most of the daily activities require strict coordination between clinicians, who often operate under heavy workloads and minimal workforce conditions in environments filled with increasingly complex technology. Ubiquitous Computing applications constitute a suitable solution for both reducing medical costs and improving patient safety by better supporting clinical processes. In this study we introduce an intelligent infrastructure for smart hospitals which implements basic services to optimize medical staff/patient interactions and grants ubiquitous and transparent access to clinical data stored in standard clinical databases. This infrastructure relies on the integration of Radio Frequency IDentification (RFID) and photosensor technologies to identify, locate and track clinicians and patients equipped with mobile devices and wearable RFID tags.     

Faster Approximate String Matching for Short Patterns

We study the classical approximate string matching problem, that is, given strings P and Q and an error threshold k, find all ending positions of substrings of Q whose edit distance to P is at most k. Let P and Q have lengths m and n, respectively. On a standard unit-cost word RAM with word size w≥log n we present an algorithm using time

Entanglement mean field theory: Lipkin–Meshkov–Glick Model

Entanglement mean field theory is an approximate method for dealing with many-body systems, especially for the prediction of the onset of phase transitions. While previous studies have concentrated mainly on applications of the theory on short-range interaction models, we show here that it can be efficiently applied also to systems with long-range interaction Hamiltonians. We consider the (quantum) Lipkin–Meshkov–Glick spin model, and derive the entanglement mean field theory reduced Hamiltonian. A similar recipe can be applied to obtain entanglement mean field theory reduced Hamiltonians corresponding to other long-range interaction systems. We show, in particular, that the zero temperature quantum phase transition present in the Lipkin–Meshkov–Glick model can be accurately predicted by the theory.     

Data preprocessing using hybrid general regression neural networks and particle swarm optimization for remote terminal units

Data corruption in SCADA systems refers to errors that occur during acquisition, processing, or transmission, introducing unintended changes to the original data. In SCADA-based power systems, the data gathered by remote terminal units (RTUs) is subject to data corruption due to noise interference or lack of calibration. In this study, an effective approach based on the fusion of the general regression neural network (GRNN) and the particle swarm optimization (PSO) technique is employed to deal with errors in RTU data. The proposed hybrid model, denoted as GRNN-PSO, is able to handle noisy data in a fast speed, which makes it feasible for practical applications. Experimental results show the GRNN-PSO model has better performance in removing the unintended changes to the original data compared with existing methods.     

Design optimization of supersonic jet pumps using high fidelity flow analysis

Supersonic jet pumps are simple devices with no moving parts, where a high velocity (primary) flow is used to pump a second fluid. In this paper, Computational Fluid Dynamics (CFD) is combined with an optimization framework in order to develop a tool for the rapid generation of jet pump designs. A key feature of the problem formulation is the transformation of the jet pump design parameters in terms of geometric ratios. This approach dramatically reduces the number of unrealistic designs covered by the Design of Experiments. Optimal Latin Hypercubes for surrogate model building and model validation points are constructed using a permutation genetic algorithm and design points are evaluated using CFD. Surrogate models of primary and entrained flow rates are built using a Moving Least Squares approach. A series of optimizations for various pump sizes are performed using a genetic algorithm and Sequential Quadratic Programming, with responses calculated from the surrogates. This approach results in a set of optimized designs, from which pumps for a wide range of flow rates can be interpolated.     

An isogeometrical approach to structural topology optimization by optimality criteria

The Isogeometric Analysis (IA) method is applied for structural topology optimization instead of finite elements. For this purpose, a control point based Solid Isotropic Material with Penalization (SIMP) method is employed and the material density is considered as a continuous function throughout the design domain and approximated by the Non-Uniform Rational B-Spline (NURBS) basis functions. To prevent the formation of layouts with porous media, a penalization technique similar to the SIMP method is used. For optimization an optimality criteria is derived and implemented. A few examples are presented to demonstrate the performance of the method. It is shown that, dissimilar to the element based SIMP topology optimization, the resulted layouts by this method are independent of the number of the discretizing control points and checkerboard free.