Studies on helium flow in experimental loops with different impedances operated with fountain effect pumps

An experimental flow loop with He II flow driven by fountain effect pumps (FEPs) is studied with respect to operation at different flow impedances and with thermal loads applied at different positions. The measured values of temperature, flow rate and pressure drop are compared with calculations resulting from a simplified model which assumes ideal performance of the porous plug and of the heat exchangers and which does not take into account Gorter-Mellink (GM) conduction. The main features of the loop are shown to be well described by this model. Refined calculations with a more complex model, including GM conduction of the He II, are only required for predicting the temperature distribution in some discrete regions of the loop.

Register Allocation and Optimal Spill code Scheduling in Software Pipelined Loops using 0-1 Integer Linear Programming Formulation

In achieving higher instruction level parallelism, software pipelining increases the register pressure in the loop. The usefulness of the generated schedule may be restricted to cases where the register pressure is less than the available number of registers. Spill instructions need to be introduced otherwise. But scheduling these spill instructions in the compact schedule is a difficult task. Several heuristics have been proposed to schedule spill code. These heuristics may generate more spill code than necessary, and scheduling them may necessitate increasing the initiation interval. We model the problem of register allocation with spill code generation and scheduling in software pipelined loops as a 0-1 integer linear program. The formulation minimizes the increase in initiation interval (II) by optimally placing spill code and simultaneously minimizes the amount of spill code produced. To the best of our knowledge, this is the first integrated formulation for register allocation, optimal spill code generation and scheduling for software pipelined loops. The proposed formulation performs better than the existing heuristics by preventing an increase in II in 11.11% of the loops and generating 18.48% less spill code on average among the loops extracted from Perfect Club and SPEC benchmarks with a moderate increase in compilation time.

An association and Wilson activity coefficient model for solubilities of aromatic solid pollutants in supercritical carbon dioxide

The solubilities of various solid pollutants in supercritical carbon dioxide were investigated. The intermolecular interactions play a significant role in determining the solubilities of solids in supercritical carbon dioxide. A new model equation was derived by using the concepts of association and activity coefficient model to correlate the solubilities of solids. The model equation combines the association and Wilson activity coefficient models and includes the interaction potentials between the molecules, which are useful in understanding the behavior of the solid solutes in SCCO2. The new model equation involves five adjustable parameters to correlate the solubilities of solids by incorporating the interactions between the molecules. The equation correlated 75 solid systems with an average AARD of around 9%, which was better than the correlations obtained from standard models such as Mendez Santiago-Teja (MT) model and association model. (C) 2012 Elsevier B.V. All rights reserved.

Runtime dependence computation and execution of loops on heterogeneous systems

GPUs have been used for parallel execution of DOALL loops. However, loops with indirect array references can potentially cause cross iteration dependences which are hard to detect using existing compilation techniques. Applications with such loops cannot easily use the GPU and hence do not benefit from the tremendous compute capabilities of GPUs. In this paper, we present an algorithm to compute at runtime the cross iteration dependences in such loops. The algorithm uses both the CPU and the GPU to compute the dependences. Specifically, it effectively uses the compute capabilities of the GPU to quickly collect the memory accesses performed by the iterations by executing the slice functions generated for the indirect array accesses. Using the dependence information, the loop iterations are levelized such that each level contains independent iterations which can be executed in parallel. Another interesting aspect of the proposed solution is that it pipelines the dependence computation of the future level with the actual computation of the current level to effectively utilize the resources available in the GPU. We use NVIDIA Tesla C2070 to evaluate our implementation using benchmarks from Polybench suite and some synthetic benchmarks. Our experiments show that the proposed technique can achieve an average speedup of 6.4x on loops with a reasonable number of cross iteration dependences.

A Statistical Model of Current Loops and Magnetic Monopoles

We formulate a natural model of loops and isolated vertices for arbitrary planar graphs, which we call the monopole-dimer model. We show that the partition function of this model can be expressed as a determinant. We then extend the method of Kasteleyn and Temperley-Fisher to calculate the partition function exactly in the case of rectangular grids. This partition function turns out to be a square of a polynomial with positive integer coefficients when the grid lengths are even. Finally, we analyse this formula in the infinite volume limit and show that the local monopole density, free energy and entropy can be expressed in terms of well-known elliptic functions. Our technique is a novel determinantal formula for the partition function of a model of isolated vertices and loops for arbitrary graphs.

Derivation of a vector model for a Brushless Doubly-Fed Machine with multiple loops per nest

The paper presents a vector model for a Brushless Doubly-Fed Machine (BDFM). The BDFM has 4 and 8 pole stator windings and a nested-loop rotor cage. The rotor cage has six nests equally spaced around the circumference and each nest comprises three loops. All the rotor loops are short circuited via a common end-ring at one end. The vector model is derived based on the electrical equations of the machine and appropriate vector transformations. In contrast to the stator, there is no three phase circuit in the rotor. Therefore, the vector transformations suitable for three phase circuits can not be utilised for the rotor circuit. A new vector transformation is employed for the rotor circuit quantities. The approach presented in this paper can be extended for a BDFM with any stator poles combination and any number of loops per nest. Simulation results from the model implemented in Simulink are presented. © 2008 IEEE.

Additional angles to calculate the deformation of RNA helices induced by bulge loops

Bulges are common features of folded RNA structures. The RNA axial kinking caused by bulges has been confirmed by many experiments. Usually, a kinking angle zeta and a bending angle theta are used to describe the kinking and twisting of RNA molecules containing bulges. Here, we present two additional angles (twist angle zeta(1), twist angle zeta(2)) to describe the deformation of RNA helices induced by bulge loops because only two angles (a kinking angle zeta and a bending angle theta) are not enough to define the deformation of RNA induced by bulges. (C) 2002 Elsevier Science B.V. All rights reserved.

Stabilization of symmetric formations to motion around convex loops

We provide a cooperative control algorithm to stabilize symmetric formations to motion around closed curves suitable for mobile sensor networks. This work extends previous results for stabilization of symmetric circular formations. We study a planar particle model with decentralized steering control subject to limited communication. Because of their unique spectral properties, the Laplacian matrices of circulant graphs play a key role. We illustrate the result for a skewed superellipse, which is a type of curve that includes circles, ellipses, and rounded parallelograms. © 2007 Elsevier B.V. All rights reserved.

对PFU法中MacArthur-Wilson平衡模型的修改

考虑到环境压迫的因素,对PFU法中的MacArthur-Wilson平衡模型作了修改,推导出一个更为适用的新模型。小野外生态试验和室内毒理试验中提出4个功能参数(S_(eq),G,H,T_(90％))用于环境的生物监测。使用Monte Garlo序贯随机模拟算法和Marquardt算法估计模型参数并完成计算机程序的编制,最后还使用拟合差异度法检验实验模型。

Diassociativity in Conjugacy Closed Loops

Let Q be a conjugacy closed loop, and N(Q) its nucleus. Then Z(N(Q)) contains all associators of elements of Q. If in addition Q is diassociative (i.e., an extra loop), then all these associators have order 2. If Q is power-associative and |Q| is finite and relatively prime to 6, then Q is a group. If Q is a finite non-associative extra loop, then 16 ∣ |Q|.

安全ARP的Clark-Wilson模型化

ARP协议漏洞严重威胁着TCP／IP的安全，一些基于对称或非对称密钥机制的安全ARP协议被相继提出。本文介绍了ARP协议攻击的原理和几个最出名的基于对称或非对称密钥机制的安全ARP协议，引入Clark-wilson商业模型对ARP的完整性状态进行了分析，把改进协议Clark-Wilson模型化，在模型化的过程中找到了它们不能通过Clark-Wilson商业模型验证规则的关键点，并根据Clark-Wilson商业模型提出的经典场景，给出了相应的攻击场景。

基于Biba和Clark-Wilson策略的混合强制完整性模型

商业应用需要实施完整性策略保护.Biba模型提供了一种简洁的多级完整性控制方案,但是需要引入可信主体来保证实施的可用性.而Clark-Wilson模型通过可监控的状态转换提供了一种完备的完整性保护,但其复杂性影响了该模型的完整实现.提出的模型以Biba严格完整性策略为基础,同时根据可信主体在其生命周期所属的状态实施Biba低水标策略.对可信主体在其生命周期发生的状态转换及相应的低水标参数调整,采用Clark-Wilson模型来进行监控.在有效解决了Biba策略的可用性问题和Clark-Wilson模型监控量过大给系统带来的配置和运行负担问题的同时,继承它们的优点.证明了该策略融合方案是可行的、安全的.