软印刷技术

软印刷技术是基于弹性体印章/模具来转移图形结构的微纳加工技术。详细介绍了软印刷技术中转移图形结构的多种方式,并探讨软印刷技术在微纳电子学、光学、传感器、生物等领域的广泛应用。对软印刷技术的弹性体印章/模具制备、聚二甲基硅氧烷的属性、理论研究等进行了探讨。     

淤泥软基爆炸固结试验研究

对爆炸效应在淤泥软基工程中的应用问题进行了探讨，并首次提出了爆炸在淤泥软基中的分界应力特征以及排水固结及破坏分区的基本模式。为采用动力加速对淤泥软基工程的处理，提供了试验依据，具有实用价值和指导意义。     

土壤冲击特性的实验研究

本文利用分离式Hopkinson压杆研究了土体在不同应变率条件下的冲击动态力学性能，发现土体有明显的应变率效应，与静载相比，冲击荷载下土的动强度和动模量均有很大的提高。     

SAW软扩频调制解调器的研究

报道了一种直接序列软扩频调制解调器的SAW实现方案，并给出了相应的实验结果。该方案对提高系统抗干扰能力、频宽利用等方面均具有与其他技术不同的特点。同时，该技术方案为进一步研究DS-OFDM打下了基础。     

粗粒土渗透变形机制浅析

对砂卵砾石的渗透变形的形成条件进行了简要分析，在此基础上对渗透变形的形式进行了简要评价，并提出了渗透变形临界坡降的计算方法。     

非饱和土的抗剪强度理论研究

从孔隙水的存在状态出发 ,围绕Bishop抗剪强度公式中存在的几个疑点展开讨论 .认为非饱和土中支配强度和变形的应力之所以不同 ,是因为非饱和土中存在一种性质与有效应力不同的应力———内部应力 ,它不传递 ,仅影响土的塑性变形 .同时还对Bishop ,Fredlund和卢肇钧提出的抗剪强度公式中的参数测试方法进行分析 ,指出 :各种抗剪强度理论在概念上都是相同的 ,其区别仅在于确定由吸力产生的那部分有效应力时采用的参数和测试方法不同     

粉喷桩处理软弱地基在祁临高速公路的应用

结合工程实例，介绍了粉喷桩的所属类型，粉喷桩对软弱地基加固的原因，所适应土质及加固特点，阐述了祁临十八合同段的粉喷桩施工过程及施工中应注意的若干问题，得出粉喷桩处理不良地基效果良好。     

Generation of Technology-Independent Retargetable Analog Blocks

This paper introduces a complete methodology for retargeting of analog cells to different sets of specifications. This methodology is technology-independent, thus allowing the migration, from one technology to another, of the circuit under retargeting. Careful integration of the device sizing and layout generation tasks via the incorporation of layout constraints during the sizing process allows to generate fully functional designs in a few minutes. The methodology is illustrated via the retargeting of a fully-differential Miller-compensated two-stage operational amplifier for a new set of specifications and two different technological processes.An erratum to this article can be found at     

An Effective Software Pipelining Algorithm for Clustered Embedded VLIW Processors

This paper proposes a software pipelining framework, CALiBeR (ClusterAware Load Balancing Retiming Algorithm), suitable for compilers targetingclustered embedded VLIW processors. CALiBeR can be used by embedded systemdesigners to explore different code optimization alternatives, that is, high-qualitycustomized retiming solutions for desired throughput and program memory sizerequirements, while minimizing register pressure. An extensive set of experimentalresults is presented, demonstrating that our algorithm compares favorablywith one of the best state-of-the-art algorithms, achieving up to 50% improvementin performance and up to 47% improvement in register requirements. In orderto empirically assess the effectiveness of clustering for high ILP applications,additional experiments are presented contrasting the performance achievedby software pipelined kernels executing on clustered and on centralized machines.