扇形束投影域重建—再投影迭代法

本文所提出的投影域重建——再投影迭代算法可以恢复不完整的扇形束投影数据,从而实现从有限的投影数据重建图象。这种算法把滤波——反投影图象重建过程和再投影的过程纳入一个公式,仅在投影域上估算未知的投影数据,因此避免了重建过程和反投影过程中的插值运算,改善了收敛性,提高了计算精度,缩短了运算时间。模拟实验表明:即使有70％的投影数据丢失,经过两次迭代就能以令人满意的精度恢复丢失的投影数据。     

Making costly manufacturing smart with transfer learning under limited data: A case study on composites autoclave processing

The integration of advanced manufacturing processes with ground-breaking Artificial Intelligence methods continue to provide unprecedented opportunities towards modern cyber-physical manufacturing processes, known as smart manufacturing or Industry 4.0. However, the “smartness” level of such approaches closely depends on the degree to which the implemented predictive models can handle uncertainties and production data shifts in the factory over time. In the case of change in a manufacturing process configuration with no sufficient new data, conventional Machine Learning (ML) models often tend to perform poorly. In this article, a transfer learning (TL) framework is proposed to tackle the aforementioned issue in modeling smart manufacturing. Namely, the proposed TL framework is able to adapt to probable shifts in the production process design and deliver accurate predictions without the need to re-train the model. Armed with sequential unfreezing and early stopping methods, the model demonstrated the ability to avoid catastrophic forgetting in the presence of severely limited data. Through the exemplified industry-focused case study on autoclave composite processing, the model yielded a drastic (88%) improvement in the generalization accuracy compared to the conventional learning, while reducing the computational and temporal cost by 56%.     

中国的铸造生产能力与铸件出口贸易

2001年度中国灰铸铁，铸钢和可锻铸铁三类铸件的产量均大于或相当于日、美、德三国同类铸件产量的总和。尚欠发达的中国相关工业如何能为如此巨大的铸造工业提供足够的订单?美国按相关工业分类预测铸件年需求量的经验值得我们借鉴。中国铸件出口以廉价低档铸件为主，量值长期在低位徘徊的局面应予改变。2003年度美国各类进口铸件预计可达220万t，销售总金额约为40亿美元。     

不完备XML信息系统的粗糙集模型

随着XML成为网络信息表示和交换的标准以及不确定数据的广泛存在,不确定XML数据库管理技术成为了当今研究的热点。首先,允许XML文档叶子节点的信息值为丢失的或遗漏的空值,提出不完备的XML信息系统;其次,提出节点的相容关系、限制相容关系以及阈值相容关系等概念,基于粗糙集理论分别定义这3种关系对应的粗糙集模型;最后,通过实例分析表明,限制相容关系模型能克服相容关系模型分类粗糙的缺点,阈值相容关系模型通过合理地设置阈值可达到更好的分类效果,从而提高了对XML数据的预测、分类的精确度。     

Limited carry-in technique for real-time multi-core scheduling

Schedulability analysis has been widely studied to provide offline timing guarantees for a set of real-time tasks. The so-called limited carry-in technique, which can be orthogonally incorporated into many different multi-core schedulability analysis methods, was originally introduced for Earliest Deadline First (EDF) scheduling to derive a tighter bound on the amount of interference of carry-in jobs at the expense of investigating a pseudo-polynomial number of intervals. This technique has been later adapted for Fixed-Priority (FP) scheduling to obtain the carry-in bound efficiently by examining only one interval, leading to a significant improvement in multi-core schedulability analysis. However, such a successful result has not yet been transferred to any other non-FP scheduling algorithms. Motivated by this, this paper presents a generic limited carry-in technique that is applicable to any work-conserving algorithms. Specifically, this paper derives a carry-in bound in an algorithm-independent manner and demonstrates how to apply the bound to existing non-FP schedulability analysis methods for better schedulability.     

Engineering TCP transmission and retransmission mechanisms for wireless networks

Transmission Control Protocol (TCP) provides mechanisms for reliable data communications. Although it works well in wired networks, it fails to offer satisfactory performance in lossy and wireless environments. And in the multi-hop wireless infrastructure, packet delivery suffers high cumulative loss rate if traveling over multiple wireless hops. The Selective acknowledgment (SACK) is one header option that might be used to combat segment corruptions in air channels. In this paper, an alternative set of flow control mechanisms is proposed to handle high packet loss rate in a wireless medium. Using a measurement-based mechanism, sustainable segment delivery is achievable through a novel size-reduction method. Multiple segment retransmission mechanisms are introduced to reduce successive timeout events. One single byte loss is sufficient to waste all other bytes in a file received at a destination. That is, a good TCP flow control mechanism should provide a high successful file transmission completion rate, and this is set as our design goal. Through thorough simulations, our proposed multi-segment retransmission designs perform with higher successful file transfer rate and fewer timeout events than NewReno and SACK under a wide range of packet loss probabilities.     

Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan

We study online scheduling on two unbounded parallel-batching machines with limited restarts to minimize the makespan. In this system jobs arrive over time and a batch can be restarted if and only if all the jobs in it have never been restarted. To tackle this difficult problem, we make the second-restart assumption whereby we can only interrupt a running batch B at time t if both machines are busy at time t and batch B has a later starting time than the other running batch. For this case, we provide a best online algorithm with a competitive ratio . For the general problem, we show that no online algorithms can have a competitive ratio less than 1.298, leaving a gap from 1.298 to 1.366.     

Stabilization for nonlinear systems via a limited capacity communication channel with data packet dropout

This paper addresses the stabilization problem for a class of nonlinear systems. It is assumed that the controller can only receive the transmitted sequence of finite coded signals via a limited digital communication channel. Both state and output feedback coder-decoder-controller procedures are proposed. Stabilization conditions involving the size of coding alphabet, the sampling period, system state growth rate and data packet dropout rate are obtained. Finally, an example is given to illustrate the design procedures and effectiveness of the proposed results.     

不完备信息系统中对象的相似性刻画

信息系统知识约简与知识发现是粗糙集理论的重要研究方向。通过对不完备信息系统中对象的相似性刻画方式以及相应的粗糙集模型进行对比分析,基于限制容差关系提出了一种新的限制相似关系,建立了基于限制相似关系的粗糙集模型,讨论了模型的基本性质及其与已有模型之间的关系。