科技基础条件平台资源共享的本质与机理研究

科技基础条件平台建设具有重大战略意义。平台建设的核心是资源共享体系的形成。资源共享具有主体的构成多元性、资源所有权与使用权的分离性、共享方式的合作性、效益的分享性等特征。资源共享遵循技术共需原理、物质保障原理和利益驱动原理等基本原理。资源共享需建立共享导向、江交投入、有偿使用、风险分担、信息互动、高效服务、竞争激励等七大机制。     

ON THE CONSTRUCTION OF ALGEBRAIC-GEOMETRIC CODES

1,Illtroduction'SincetheearlypapersbyG0ppa[1-31,algebralc-ge0metriccodeshavebeeninthespotlight0fcodingthe0reticresearchf0rab0uttwodecades.NumerousexcitingresultshavebeenachievedusingGoppa'sconstructi0noflinearcodesfromalgebralccurvesoverfinitefields,bothbyalgebraicge0metorsandcodingtheorists.Becauseofthedifficultyofthesubject,severalexplanatorypaPersandtextbookshaveappeared,seeforinstance[4-8].Inthispaperwepresentaquitedtherentpointofviewconcerningalgebraic-geometriccodes.Itiswellknownthataq…     

A Combinatorial Condition and Boolean Functions with Optimal Algebraic Immunity

This paper first proposes an infinite class of 2k-variable Boolean functions with high nonlinearity and high algebraic degree. Then an infinite class of balanced Boolean functions are proposed by modifying the above Boolean functions. This class of balanced Boolean functions have optimal algebraic degree and high nonlinearity. Both classes have optimal algebraic immunity based on a general combinatorial conjecture.     

基于回报函数逼近的学徒学习综述

回顾了基于回报函数逼近的学徒学习的发展历史,介绍了目前的主要工作,总结了学徒学习的一般方法,讨论了线性和非线性假设条件下的回报函数求解,比较了逆向增强学习(IRL)和边际最大化(MMP)两类逼近方法.基于IRL的学徒学习是一种通过迭代的方法用基回报函数的线性组合来逼近真实回报函数的过程.MMP方法可以看作是一类基于梯度下降的最优化方法.综合采用滤波及将策略函数概率化等方法可以降低对专家演示的最优要求.最后指出了该领域存在的问题,提出了未来的研究方向,如在部分可观察马尔可夫决策过程框架下的学徒学习及对不确定策略的学习等.     

用于流水线ADC的无采样保持运放前端电路

为了降低流水线模数转换器功耗与提升输入信号范围，设计了一种无采样保持运放前端电路. 移除采样保持运放降低了功耗，并改进开关时序进一步降低电路功耗；同时改进传统开关电容比较器输入，使得模数转换器可达到0 ~ 3.3 V满电源电压的量化范围. 将设计的无采样保持运放前端电路应用在一款低功耗12位50 MS/s流水线模数转换器进行验证，采用0.18 μm 1P6M工艺进行流片，芯片面积为1.95 mm2. 测试结果表明：3.3 V电压下，采样率为50 MS/s、输入信号频率为5.03 MHz时，信噪失真比（SNDR）为64.67 dB，无杂散动态范围（SFDR）为72.9 dB，功耗为65 mW.     

深圳市常见园林植物滞尘效应研究

以深圳市6种常见的园林植物为对象, 研究其单位面积滞尘量及其粒径组成特征, 探究植物叶片表面的微观形貌结构以及滞留颗粒物的组分和分布特征, 分析气象因子对植物滞尘的影响。结果表明: 1) 6种园林植物的单位叶面积滞尘量排序为黄金榕(0.74±0.21 g/m²)>鹅掌藤(0.42±0.26 g/m²)>对叶榕(0.24±0.26 g/m²)>龙船花(0.20±0.07 g/m²)>沿阶草(0.18±0.10 g/m²)>鸡蛋花(0.15±0.10 g/m²); 2) 6种园林植物滞尘以粒径α>10 μm的颗粒物为主, 质量占比为59.21%~88.92% (黄金榕除外), 鹅掌藤对α>10 μm 颗粒物的滞尘能力最强(0.34±0.20 g/m²), 黄金榕对3 μm<α<10 μm (0.51±0.15 g/m2)和 0.15 μm<α<3 μm (0.14±0.07 g/m2)颗粒物的滞留能力最强; 3) 6种园林植物叶表面的气孔、褶皱、沟槽、絮状凸起和绒毛等微观形貌有利于叶片对颗粒物的截留, 叶片滞留颗粒物的元素组成主要为O, Si和Al; 4) 6种园林植物叶表滞留的大颗粒物(α>10 μm)易受风速和温度的影响。研究结果对深圳市园林植物配置具有指导意义, 并可为通过植物滞尘效应改善空气质量提供一定的理论依据。     

AN APPROACH TOWARDS THE IMPLEMENTATION OF CHARACTERISTIC SET METHOD

1.IntroductionInthiscentury,theinventionofcomputerhasbroughtustoanewrevolutionera:weevencouldnotimaginewhattheworldwouldlooklikewithoutcomputer.Nowadays,wehavegottenusedtolettingcomputerhelpustodoinformationsearching,wordprocessing,complicatedcomputationsandsoon.Buthowaboutthementalworkmechanization,i.e.askingcomputertodomelltalworkforussuchasreasoning?MathematicsmechanizationisanewresearchfieldinitiatedbyProfessorWuWentsUnll]taChinesemathematician.Itisanalgebraicapproachratherthanalogicapp…     

考虑车下环境的高速动车组空气流场数值仿真

在建立典型高速动车组模型、轨道等环境模型基础上,根据流场有限元知识,将整体仿真模型划分为车头部分、车尾部分、中间车前部及中间车后部.采用对称计算域,选择非结构网格进行网格处理,进而仿真分析300km·h-1的流场分布规律.结果表明:建立的典型动车组模型总体受力69.4kN,车下部分尤其是转向架附近流场分布各异,湍流形式明显,该部分阻力占总体阻力33.6%,最大正负压力差约8kPa.通过分析比较ICE和TGV-A高速列车相关试验数据,验证了仿真方法与结果的合理性.     

基于分解多目标进化算法的光刻区调度方法

针对晶圆制造系统光刻区调度问题,考虑设备专用性约束、掩膜版数量约束及设备加工能力约束,以最小化总完工时间和光刻成本、最大化晶圆准时交付率和设备利用率为目标,提出了基于分解多目标进化算法的光刻区调度方法．针对非支配前沿点分布不均的问题,设计了基于聚类分析的参考点生成方法;综合考虑非支配解的分布均匀性、收敛性及计算资源的合理分配,改进了惩罚边界交叉聚合函数;设计了外部档案变邻域搜索方法,提高算法的求解质量和收敛速度．24组基准算例和晶圆制造仿真系统连续12个月的测试结果表明：提出的分解多目标进化算法相对于多种多目标进化算法,能够取得更好的收敛性和解的多样性．     

Recent Results on Constructing Boolean Functions with (Potentially) Optimal Algebraic Immunity Based on Decompositions of Finite Fields

Boolean functions with optimal algebraic immunity (OAI functions) are important cryptographic primitives in the design of stream ciphers. During the past decade, a lot of work has been done on constructing such functions, among which mathematics, especially finite fields, play an important role. Notably, the approach based on decompositions of additive or multiplicative groups of finite fields turns out to be a very successful one in constructing OAI functions, where some original ideas are contributed by Tu and Deng (2012), Tang, et al. (2017), and Lou, et al. (2015). Motivated by their pioneering work, the authors and their collaborators have done a series of work, obtaining some more general constructions of OAI functions based on decompositions of finite fields. In this survey article, the authors review our work in this field in the past few years, illustrating the ideas for the step-by-step generalizations of previous constructions and recalling several new observations on a combinatorial conjecture on binary strings known as the Tu-Deng conjecture. In fact, the authors have obtained some variants or more general forms of Tu-Deng conjecture, and the optimal algebraic immunity of certain classes of functions we constructed is based on these conjectures.