栓状流密相气力输送

首先介绍了气力输送的实验设备。评述了水平栓流气力输送的压力降计算方法，用3种不同的方法计算了压力降并与实验数据进行比较。此外评述了用特征线方法进行了水平管的数值模拟，倾斜管的压力降计算和长距离的栓流气力输送。最后展望了该领域的发展方向。

Against ambiguity

This paper argues that the widespread belief that ambiguity is beneficial in design communication stems from conceptual confusion. Communicating imprecise, uncertain and provisional ideas is a vital part of design teamwork, but what is uncertain and provisional needs to be expressed as clearly as possible. This paper argues that viewing design communication as conveying permitted spaces for further designing is a useful rationalisation for understanding what designers need from their notations and computer tools, to achieve clear communication of uncertain ideas. The paper presents a typology of ways that designs can be uncertain. It discusses how sketches and other representations of designs can be both intrinsically ambiguous, and ambiguous or misleading by failing to convey information about uncertainty and provisionality, with reference to knitwear design, where communication using inadequate representations causes severe problems. It concludes that systematic use of meta-notations for conveying provisionality and uncertainty can reduce these problems.

双套管密相气力输运过程的数值模拟和能耗分析

基于计算流体力学理论,提出一种可用于预测双套管密相气力输送系统能耗的新方法.与以往依靠经验的计算方法不同,本工作将输送管道分为起始段与充分发展段两部分,分别进行详细的计算流体力学模拟后汇总得出整个系统的总能耗.压力梯度为750 Pa/m的情况下,计算所得物料输送速率为10 t/h,耗气量为290 m~3/h,实验所得物料输送速率为8.0 t/h,耗气量240 m~3/h,证明本数模方法是可靠的.

Beyond Watson and Crick : programming the self-assembly and reconfiguration of DNA nanostructures based on stacking interactions

Life is the result of the execution of molecular programs: like how an embryo is fated to become a human or a whale, or how a person’s appearance is inherited from their parents, many biological phenomena are governed by genetic programs written in DNA molecules. At the core of such programs is the highly reliable base pairing interaction between nucleic acids. DNA nanotechnology exploits the programming power of DNA to build artificial nanostructures, molecular computers, and nanomachines. In particular, DNA origami—which is a simple yet versatile technique that allows one to create various nanoscale shapes and patterns—is at the heart of the technology. In this thesis, I describe the development of programmable self-assembly and reconfiguration of DNA origami nanostructures based on a unique strategy: rather than relying on Watson-Crick base pairing, we developed programmable bonds via the geometric arrangement of stacking interactions, which we termed stacking bonds. We further demonstrated that such bonds can be dynamically reconfigurable.

The first part of this thesis describes the design and implementation of stacking bonds. Our work addresses the fundamental question of whether one can create diverse bond types out of a single kind of attractive interaction—a question first posed implicitly by Francis Crick while seeking a deeper understanding of the origin of life and primitive genetic code. For the creation of multiple specific bonds, we used two different approaches: binary coding and shape coding of geometric arrangement of stacking interaction units, which are called blunt ends. To construct a bond space for each approach, we performed a systematic search using a computer algorithm. We used orthogonal bonds to experimentally implement the connection of five distinct DNA origami nanostructures. We also programmed the bonds to control cis/trans configuration between asymmetric nanostructures.

The second part of this thesis describes the large-scale self-assembly of DNA origami into two-dimensional checkerboard-pattern crystals via surface diffusion. We developed a protocol where the diffusion of DNA origami occurs on a substrate and is dynamically controlled by changing the cationic condition of the system. We used stacking interactions to mediate connections between the origami, because of their potential for reconfiguring during the assembly process. Assembling DNA nanostructures directly on substrate surfaces can benefit nano/microfabrication processes by eliminating a pattern transfer step. At the same time, the use of DNA origami allows high complexity and unique addressability with six-nanometer resolution within each structural unit.

The third part of this thesis describes the use of stacking bonds as dynamically breakable bonds. To break the bonds, we used biological machinery called the ParMRC system extracted from bacteria. The system ensures that, when a cell divides, each daughter cell gets one copy of the cell’s DNA by actively pushing each copy to the opposite poles of the cell. We demonstrate dynamically expandable nanostructures, which makes stacking bonds a promising candidate for reconfigurable connectors for nanoscale machine parts.

Randomness-efficient curve sampling

Curve samplers are sampling algorithms that proceed by viewing the domain as a vector space over a finite field, and randomly picking a low-degree curve in it as the sample. Curve samplers exhibit a nice property besides the sampling property: the restriction of low-degree polynomials over the domain to the sampled curve is still low-degree. This property is often used in combination with the sampling property and has found many applications, including PCP constructions, local decoding of codes, and algebraic PRG constructions.

The randomness complexity of curve samplers is a crucial parameter for its applications. It is known that (non-explicit) curve samplers using O(log N + log(1/δ)) random bits exist, where N is the domain size and δ is the confidence error. The question of explicitly constructing randomness-efficient curve samplers was first raised in [TU06] where they obtained curve samplers with near-optimal randomness complexity.

In this thesis, we present an explicit construction of low-degree curve samplers with optimal randomness complexity (up to a constant factor) that sample curves of degree (m log_q(1/δ))^O(1) in F_q^m. Our construction is a delicate combination of several components, including extractor machinery, limited independence, iterated sampling, and list-recoverable codes.