在教学中推行微型化学实验势在必行

微型化学实验是当今化学教学中的重要变革之一。本文简单介绍了微型化学实验的特点和当前国内外发展的概况，倡议在我省的化学中尽快推行微型化学实验     

An Area Optimization Method for Digital Filter Design

In this paper, we propose an efficient design method for area optimization in a digital filter. The conventional methods to reduce the number of adders in a filter have the problem of a long critical path delay caused by the deep logic depth of the filter due to adder sharing. Furthermore, there is such a disadvantage that they use the transposed direct form (TDF) filter which needs more registers than those of the direct form (DF) filter. In this paper, we present a hybrid structure of a TDF and DF based on the flattened coefficients method so that it can reduce the number of flip‐flops and full‐adders without additional critical path delay. We also propose a resource sharing method and sharing‐pattern searching algorithm to reduce the number of adders without deepening the logic depth. Simulation results show that the proposed structure can save the number of adders and registers by 22 and 26%, respectively, compared to the best one used in the past.     

箕斗卸载状况的检测方法

介绍了箕斗卸载状况检测方法的原理,分析了各种方法的优点和缺点。使用时应根据具体情况选择合理的检测方法。     

龙潭拱坝砼上坝运输方案选择

龙潭拱坝坝高９０ｍ，砼上坝运输是砼施工过程中的中间环节，控制进度的关键，必须因时因地制宜地选择适当的运输机械和运输方案，使砼运输能做到保质、保量、及时和经济，通过论证比较，结合本工程现实情况，砼上坝运输不采用缆机而采用门机方案．     

交叉连接的少层残差卷积神经网络

最近的研究表明,卷积神经网络的性能可以通过采用跨层连接来提高,典型的残差网络(Res Net)便通过恒等映射方法取得了非常好的图像识别效果.但是通过理论分析,在残差模块中,跨层连接线的布局并没有达到最优设置,造成信息的冗余和层数的浪费,为了进一步提高卷积神经网络的性能,文章设计了两种新型的网络结构,分别命名为C-FnetO和C-FnetT,它们在残差模块的基础上进行优化并且具有更少的卷积层层数,同时通过在MNIST,CIFAR-10,CIFAR-100和SVHN公开数据集上的一系列对比实验表明,与最先进的卷积神经网络对比,C-FnetO和C-FnetT网络获得了相对更好的图像识别效果,其中C-FnetT网络的性能最佳,在四种数据集上均取得了最高的准确率.     

合体女裤提臀结构设计的探讨

首先用问卷调查的方式得到人们对合体裤提臀的要求,主要表现在臀突感、臀下以及臀后与人体的贴合度上;其后对6款样裤进行了拓版,得到影响提臀效果的结构设计参数.在此基础上用实验法得出结果:在合体裤制版参数常用取值范围内,总裆宽越小,后上裆倾斜角越大,前后裆宽比越小,裤子的提臀效果越好;通过美观性与舒适性的评价,得出兼顾两者的参数配置.     

Bit-level systolic arrays for modular multiplication

This paper presents bit-level cellular arrays implementing Blakley's algorithm for multiplication of twon-bit integers modulo anothern-bit integer. The semi-systolic version uses 3n(n+3) single-bit carry save adders and 2n copies of 3-bit carry look-ahead logic, and computes a pair of binary numbers (C, S) in 3n clock cycles such thatC+S[0, 2N). The carry look-ahead logic is used to estimate the sign of the partial product, which is needed during the reduction process. The final result in the correct range [0,N) can easily be obtained by computingC+S andC+S–N, and selecting the latter if it is positive; otherwise, the former is selected. We construct a localized process dependence graph of this algorithm, and introduce a systolic array containing 3nw simple adder cells. The latency of the systolic array is 6n+w–2, wherew=n/2. The systolic version does not require broadcast and can be used to efficiently compute several modular multiplications in a pipelined fashion, producing a result in every clock cycle.     

考虑动态备用需求曲线的电能量-备用耦合出清模型

电力市场中,价格帽等原因会导致缺失收入(missing money)和发电容量充裕度不足等问题。以美国得克萨斯州为代表的备用需求曲线是国外电力市场解决此问题的成熟方法之一,但得克萨斯州的曲线是相对静态的曲线,且备用价格增量推导原理未明确公开。为此,文中通过考虑可再生能源、负荷预测的不确定性,以及不同品种的备用产品,制定动态备用需求曲线。基于电能量-备用耦合现货出清模型,推导了考虑备用需求曲线的现货价格公式,并分析了国外现有机制忽略的备用价格增量高阶项问题,并通过中国华东某省数据进行验证。结果表明,备用需求曲线可以体现稀缺定价,通过备用价格增量动态反映可再生能源、负荷等波动下的系统实时容量充裕度情况。通过稀缺定价机制可以合理提高电厂收入,有利于保障系统充裕度。     

蝶形运动估计算法及其VLSI实现

视频技术发展要求更高速,更利于硬件实现的运动估计算法.提出了一种蝶形运动估计算法,该算法采用蝶形搜索模板、快速截止技术和运动向量预测技术.该算法较钻石搜索算法提速43.26%-80%,并且图像质量更好.同时,本文采用加法树和片内并行存储器,构建该算法的VLSI实现结构.通过两种数据映射方法(拉丁方映射和4×4块映射),该结构不但解决了快速搜索算法的数据不规则性难题,并且节省了带宽.当系统时钟为27MHz,数据总线为16位,外部存储器带宽要求仅为4.57Mbit/s.比较其它硬件实现结构,该结构采用了更少的处理单元数,更小的缓存单元,但却获得更快的速度和更高的灵活性.