Reconsideration on Homogeneous Quadratic Riemann Boundary Value Problem

The homogeneous quadratic Riemann boundary value problem (1) with Hoelder continuous coefficients for the normal case was considered by the author in 1997. But the solutions obtained there are incomplete. Here its general method of solution is obtained.     

ZD15振动机除铁原理

去除粉状耐火材料、玻璃原料、电瓷物料中的铁磁物质，目前工业上普遍采用酸洗法。但该法生产周期长，效率低，成本高。而振动电磁除铁不但可快速、高效、低耗地除去这类物料中的铁磁杂质，且操作简便。本文给出了所设计的除铁器的振幅、生产率及振体空间在励磁回路中所需的磁感应强度等基本设计参数，为结构设计提供了理论依据     

Static extracting method of software intended behavior based on API functions invoking

The method of extracting and describing the intended behavior of software precisely has become one of the key points in the fields of software behavior＇s dynamic and trusted authentication. In this paper, the author proposes a specified measure of extracting SIBDS （software intended behaviors describing sets） statically from the binary executable using the software＇s API functions invoking, and also introduces the definition of the structure used to store the SIBDS in detail. Experimental results demonstrate that the extracting method and the storage structure definition offers three strong properties： （i） it can describe the software＇s intended behavior accurately; （ii） it demands a small storage expense; （iii） it provides strong capability to defend against mimicry attack.     

Homology Priority Task Scheduling in μC/OS-Ⅱ Real-Time Kernel

μC/OS-Ⅱ is an open source real-time kernel adopting priority preemptive schedule strategy. Aiming at the problem of μC/OS-Ⅱ failing to support homology priority tasks scheduling, an approach for solution is proposed. The basic idea is adding round-robin scheduling strategy in its original scheduler in order to schedule homology priority tasks through time slice roundrobin. Implementation approach is given in detail. Firstly, the Task Control Block （TCB） is extended. And then, a new priority index table is created, in which each index pointer points to a set of homology priority tasks. Eventually, on the basis of reconstructing μC/OS-Ⅱ real-time kernel, task scheduling module is rewritten. Otherwise, schedulability of homology task supported by modified kernel had been analyzed, and deadline formula of created homology tasks is given. By theoretical analysis and experiment verification, the modified kernel can support homology priority tasks scheduling, meanwhile, it also remains preemptive property of original μC/OS-Ⅱ.     

庐陵古村落建筑的园林化特色

园林艺术作为一种传统乡居追求,历史上首先出现于我国北方,而南宋以降随着经济文化中心的南移,大批中原人士涉江而来.为赣江流域的庐陵先民.诗书传家"提供了优越条件,形成了蜚声遐迩的庐陵文化,建筑文化是庐陵文化的一个重要组成部分.而庐陵古村落建筑的园林化,是庐陵建筑文化的一大特色.进行庐陵古村落乡土建筑文化的研究,不仅对发掘、保护以及利用现存的古村落建筑具有非常重要的理论价值,同时对当代村镇的规划建设亦具有积极的现实意义.     

弧焊机器人控制系统

本文介绍一种二级计算机控制的弧焊机器人控制系统。在考虑相邻关节影响的条件下，对弧焊机器人控制系统的硬件电路和控制方法进行了分析和设计．     

关于非平凡的黎斯算子

讨论一般巴拿赫空间上非紧的黎斯算子存在问题,说明各经典巴拿赫空间上确有这种非平凡的黎斯算子,给出一类空间,其上的根算子理想与严格奇异算子理想是不重合的。     

The harmonic decomposition reconstruction for the exponential radon transform

The exponential Radon transform, a generalization of the Radon transform, is defined and studied as a mapping of function spaces. It is represented in terms of Fourier transform of its domain and range, and this leads to the harmonic decomposition reconstruction. The results are similar results of Tretiak and Metz. Foundation item: Supported by the National Natural Science Foundation of China (No. 19971064), Key Project of Science and Technology of Hubei Province Education Committee. Biography: Wang Jin-ping (1963-), male, Ph.D. candidate, research direction: numberical solution of singular integral equation and integral transformation etc.     

高校思想政治工作的困境及其对策

思想政治工作被视为一切工作的“生命线”，其地位和作用不言而喻。然而，就目前高校学生思想政治教育工作而言，受到国际，国内的政治，经济环境的影响，以及高校学生思想政治教育工作本身的诸多困扰，使高校的学生思想政治教育工作面临着严峻的挑战。如何研究新情况，形成新认识，开辟新境界，解决新问题巳是不可回避的课题。     

Resource Search in Unstructured Peer-to-Peer System Based on Multiple-Tree Overlay Structure

We propose a multiple-tree overlay structure for resource discovery in unstructured P2P systems. Peers that have similar interests or hold similar type of resources will be grouped into a tree-like cluster. We exploit the heterogeneity of peers in each cluster by connecting peers with more capacities closer to the root of the tree. The capacity of a peer can be defined in different ways （e.g. higher network bandwidth, larger disk space, more data items of a certain type etc.） according to different needs of users or applications.