Quadratic polynomial guided fuzzy C-means and dual attention mechanism for medical image segmentation

Medical image segmentation is the most complex and important task in the field of medical image processing and analysis, as it is linked to disease diagnosis accuracy. However, due to the medical image's high complexity and noise, segmentation performance is limited. We propose a novel quadratic polynomial guided fuzzy C-means and dual attention mechanism composite network model architecture to address the aforementioned issues (QPFC-DA). It has mechanisms for channel and spatial edge attention, which guide the content and edge segmentation branches, respectively. The bi-directional long short-term memory network was added after the two content segmentation branches to better integrate multi-scale features and prevent the loss of important features. Furthermore, the fuzzy C-means algorithm guided by the quadratic polynomial can better distinguish the image's weak edge regions and has a degree of noise resistance, resulting in a membership matrix with less ambiguity and a more reliable segmentation result. We also conducted comparison and ablation experiments on three medical data sets. The experimental results show that this method is superior to several other well-known methods.     

An SVD-based image watermarking in wavelet domain using SVR and PSO

The paper presents a novel blind watermarking scheme for image copyright protection, which is developed in the discrete wavelet transform (DWT) and is based on the singular value decomposition (SVD) and the support vector regression (SVR). Its embedding algorithm hides a watermark bit in the low–low (LL) subband of a target non-overlap block of the host image by modifying a coefficient of U component on SVD version of the block. A blind watermark-extraction is designed using a trained SVR to estimate original coefficients. Subsequently, the watermark bit can be computed using the watermarked coefficient and its corresponding estimate coefficient. Additionally, the particle swarm optimization (PSO) is further utilized to optimize the proposed scheme. Experimental results show the proposed scheme possesses significant improvements in both transparency and robustness, and is superior to existing methods under consideration here.     

砂土地基上圆形浅基础三维破坏包络面的理论研究

对砂土地基上圆形浅基础在竖向荷载V 、水平荷载 H 及力矩 M 复合加载条件下的承载力进行了系统的三维有限元分析。在分析中,砂土假定为纯摩擦材料,遵循基于 Mohr-Coulomb 破坏准则的理想弹塑性本构关系。首先,对圆形浅基础的竖向承载力进行了有限元计算,并与滑移线解法进行了对比,两种方法所得结果比较吻合。进而探讨了砂土内摩擦角对于基础在 V-H 、V-M荷载平面与V-H-M 三维荷载空间内的破坏包络轨迹的影响。计算结果表明,与不排水情况下软黏土地基上基础破坏包络面相比,砂土地基上圆形浅基础的破坏包络面形状有较大差异,但V-H 和V-M 平面内的破坏包络面形状仍具有较好的归一化特性。基于有限元计算结果,建立了圆形浅基础在V-H-M 三维荷载空间内的破坏包络面方程,该方程可用来合理评价复合加载条件下砂土地基上圆形浅基础的整体稳定性。     

汉语复合名词语义信息标注词库: 基于生成词库理论

复合名词分析一直是语言研究和自然语言信息处理中的一个重要问题,涉及未登录词的识别、自动释义以及词典编纂等。生成词库理论是目前较新的一种语义学理论,我们拟利用该理论对汉语复合名词进行语义信息标注,建立一个词库。该文首先介绍了这一词库的标注框架,然后通过对“纸”、“石”构成的复合词的对比分析,展示了这一词库在复合名词构词、语义研究中的应用。研究结果显示,物性角色、自然类和人造类是非常重要的语义信息,能揭示复合名词构词和语义的一些模式和规律。     

Bounded parallel-batching scheduling with two competing agents

We consider a scheduling problem in which two agents, each with a set of non-preemptive jobs, compete to perform their jobs on a common bounded parallel-batching machine. Each of the agents wants to minimize an objective function that depends on the completion times of its own jobs. The goal is to schedule the jobs such that the overall schedule performs well with respect to the objective functions of both agents. We focus on minimizing the makespan or the total completion time of one agent, subject to an upper bound on the makespan of the other agent. We distinguish two categories of batch processing according to the compatibility of the agents. In the case where the agents are incompatible, their jobs cannot be processed in the same batch, whereas all the jobs can be processed in the same batch when the agents are compatible. We show that the makespan problem can be solved in polynomial time for the incompatible case and is NP-hard in the ordinary sense for the compatible case. Furthermore, we show that the latter admits a fully polynomial-time approximation scheme. We prove that the total completion time problem is NP-hard and is polynomially solvable for the incompatible case with a fixed number of job types.     

规则与实例相结合的公文标题汉英机器翻译系统

随着我国对外开放的不断深入,越来越多的外国朋友希望了解中国的方针政策,而公文是贯彻执行我国方针政策的有力工具,标题作为公文的一大要素,起着点明主题的作用。因此,在信息公开化不断发展的今天,政府网站或公报不仅需要刊载中文版的信息,而且有必要刊载英文版的。鉴于行政机关法定公文标题格式固定、要素稳定的特点,本文基于自建小型公文标题语料库,经分析得出公文标题的表达式和10个词表,然后结合实例,设计一公文标题翻译系统。这只是行政机关公文翻译系统的初步探索,希望能为减轻文秘人员的工作负担、最终实现公文的语言自由转换提供一点帮助。     

DIDS监视代理间数据融合算法的设计与实现

提出并实现用于分布式入侵检测系统中多监视代理之间协同检测的数据融合算法,实验证明该算法可以在0.07 s~1 s之内检测出SYN洪水、Smurf、Land等多种分布式拒绝服务攻击,并及时采取响应措施,阻断攻击者的网络连接。该算法建立在对多数据源的数据分析基础之上,提高了入侵检测的准确性,克服了路由访问控制列表过滤的局限性,可以实现在不影响网络正常运行情况下的实时检测与报警功能。     

中小企业数据库安全性研究

针对目前中小企业中存在的数据泄露问题,该文提出了一种中小企业的数据库模式,并给出了安全后端模式的架构图。为了实现数据库的保密性,该系统设计一个二级密钥管理机制,有效防止了数据的泄露。     

基于最小二乘支持向量机的非线性广义预测控制

通过中值定理将一类非线性系统近似为时变线性系统,然后将提出的在线最小二乘支持向量机回归(OLSSVMR)与广义预测控制相结合,提出了一种基于OLS-SVMR的自适应直接广义预测控制.利用OLS-SVMR直接设计预测控制器,并基于广义误差估计对控制器参数和广义误差估计中的未知向量进行自适应调整.理论证明了该方法可使广义误差估计值收敛到原点的一个小邻域内.仿真算例也验证了该方法的有效性.     

基于粒子群的CDMA功率和速率联合控制算法

提出了基于效用函数的CDMA网络下行链路的功率和速率联合控制最优化算法.在这类算法中,效用函数为非凸函数,经典的最优化理论很难解决这类问题.将粒子群优化方法应用于算法的非凸性设计,并通过仿真算例证明了该算法能有效解决非凸优化问题,且可保证系统的公平性.