基于“3S”技术的县级土地资源动态监测技术系统

土地资源日新月异的变化使得传统的土地资源管理手段无法满足土地资源信息及时更新的要求。探讨了利用遥感、地理信息系统和全球定位系统为代表的“3S”技术进行县级土地资源动态监测和更新的原理和方法。遥感是进行土地利用变化动态监测,发现土地利用变化区域的主要手段。全球定位系统接收仪用于对变化区域进行现场精确定位和实测。实测的变更数据可用于对原有的地理信息系统本底数据库进行修改,从而完成对土地资源的动态监测和数据库的及时更新。福清市土地资源动态监测技术系统就是利用“3S”技术建立起来的业务运行系统。系统所具备的功能可以满足县级土地资源的动态监测和及时更新。     

土地资源利用动态MIS设计及关键技术研究

随着我国国民经济和社会的迅速发展，用传统的土地资源研究方法和管理手段对当今信息时代的土地资源利用进行动态管理已显得十分不宜。面临着土地资源浪费严重、土地利用率低、土地信息管理落后等种种矛盾。而利用GIS技术、RS技术、GSP技术、MIS技术、DBMS技术、ES技术和DBS技术以及多种技术的集成，来对土地资源的变化进行动态管理和对有关资料信息进行及时更新已势在必行。     

遥感技术在河北省土地资源管理中的应用与展望

自2001年我省首次应用遥感技术对石家庄市土地利用变化状况进行遥感动态监测以来，河北省国土资源厅连续几年在此方面作了大量的工作，并取得了显著的成效。目前，应用遥感技术对土地利用情况进行动态监测，已经成为我省土地资源管理中实行业务化和常规化运行的重要手段。本文就遥感技术在土地资源管理中的应用、土地利用动态遥感监测的技术路线和方法、遥感技术在土地资源管理中的应用前景以及今后需要研究和解决的主要问题做一简要介绍。     

一个基于XML的多Agent网络管理原型系统

网络管理中已经普遍接纳多Agent体系结构，AGIMA是成功开发移动代码机制和群组管理功能的原型系统之一。考虑到Agent交换和共享网络管理信息的需要，新一代的管理信息结构SMlng描述的网管信息可以通过基于XML的资源描述体系（RDF）进行知识表示，需要集成更新的工具软件，为Agent引入网络管理的智能技术打下基础。     

遥感技术在河北省土地调查中的应用与展望

河北省从2001年首次在土地资源调查监测中引入卫星遥感技术，开展了石家庄市土地利用卫星遥感动态监测试点研究。在试点经验的基础上，2005年部署开展了河北省土地利用遥感动态监测，对重点城市和县城开展了土地利用变化监测，构建全省土地利用遥感本底数据库。从2005年开始我省用三年时间，在全省组织实施了土地利用更新调查工作，其中遥感技术得到了更加广泛和深入的应用。本文着重分析遥感在土地调查中的作用、技术方法和流程，以及存在的主要问题，并结合未来遥感技术的发展和国家土地遥感工作的部署，对我省今后遥感技术在土地调查中应用前景作出展望。     

热门动画，电骡自动下

电骡（eMule）上提供了很多热门电视剧的同步更新，一般电视台播放一集。电骡上就提供最新一集的下载。利用“VeryCD资源更新器”自动监测电骡资源更新变化，并让电骡自动下载最新资源，免去你手动查看更新和下载之苦，很方便。[编者按]     

基于时序MODIS反射率产品统计检验方法的土地覆盖更新

土地覆盖产品的生产是遥感领域的研究热点。全球范围土地覆盖产品因其在空间范围上的巨大尺度,生产周期较长,因此产品的时间跨度也很大,需要具有与之相对应的快速生成与更新技术,以提高产品的时间分辨率。使用MODIS历史土地覆盖产品和反射率产品,采用平均值显著性统计检验的思想,实现土地覆盖产品的快速更新。在MODIS条带号为h26v05的结果中选取宁夏自治区作为检验样区,通过目视检验和精度评价的方法对土地覆盖更新结果进行检验,总体精度为90.0290%。对水、混交林、草原、城市和建成区、裸地或低植被覆盖地变化的趋势和变化原因进行分析论证,表明采用平均值显著性统计检验的思想使用时序反射率产品对土地覆盖产品进行自动化快速更新是可行的。     

WEB方式的远程协作OA系统的设计与实现

随着计算机技术的不断发展，和办公系统在各行各业的广泛推广使用，传统客户/服务器方式的办公系统逐渐暴露出其不可改变的固有缺点，越来越不能适应现代化的管理，如：日常维护烦琐，需要及时解决每个工作站中出现的问题，维护工作的难度大；版本更新困难，版本更新时，需要每个工作站都要重新更新；占用大量资源，每个工作站都安装一套工作站软件，系统开销大，     

网络化制造资源主题搜索MRS系统的设计研究

在对开源搜索引擎Nutch系统结构充分理解和领会前提下设计了MRS系统架构。MRS系统的整体方案确定之后首先需要对系统进行初始化,在这个过程中需要对系统参数配置和创建数据库以及对系统主题设置进行配置。与此同时,还要对信息进行更新,包括种子站点更新、主题词表更新以及索引数据更新。最后系统向用户提供制造业网络制造资源信息检索功能,完成对所需的文件的搜索。应用结果表明,通过该系统用户能够很便捷地搜索到网络制造资源。     

一种动态更新LINUX内核变量的实现方法

在进行LINUX内核嵌入式开发时，经常使用内核启动过程中读取静态配置文件内容的方式对内核某些变量进行初始化，当静态配置文件改动时，只有重启内核，新配置才能生效。由此，提出一种动态更新内核变量的方法，使内核不需要重启便可以意识到配置的变化。     

A simulation-based heuristic algorithm for disposition of direction finders

A direction finder is a military weapon that is used to find locations of targets that emit radio frequencies. Multiple direction finders are used in a direction finder system for finding locations of targets in an area of interest. We present a two-stage heuristic algorithm for disposing direction finders in a direction finder system for the objective of maximizing the accuracy of estimation of the location of a target that is assumed to be located in the area of interest. In the suggested heuristic algorithm, a simulation-based method is used for estimating the probability of coverage, the probability that a target is in a given region (of a given size) surrounding the estimated location of the target, and another simulation-based method and a local search method are used to determine locations of direction finders that result in the maximum probability of coverage. Performance of the suggested algorithm is evaluated through computational experiments and results show that the algorithm gives a good disposition plan in a reasonable amount of computation time.     

The conversion of a dynamic B-spline curve into piecewise polynomials in power form

The evaluation of points and the computations of inflection points or cusps on a curve are often necessary in CAGD applications. When a curve is represented in a B-spline form, such computations can be made easier once it is transformed into a set of piecewise polynomial curves in power form. The usual practice of the transformation of a B-spline curve into a set of piecewise polynomial curves in power form is done either by a knot refinement followed by basis conversions, or by applying a Taylor expansion on each knot span of a B-spline curve.Presented in this paper is a new algorithm to convert a B-spline curve into a set of piecewise polynomial curves in power form. Experiment shows that the proposed algorithm significantly outperforms the conventional approach when one or more control points of a B-spline curve are continuously moving.     

Fermion confinement induced by geometry

We consider a five-dimensional model in which fermions are confined in a hypersurface due to an interaction with a purely geometric field. Inspired by the Rubakov-Shaposhnikov field-theoretical model, in which massless fermions can be localized in a domain wall through the interaction of a scalar field, we show that particle confinement may also take place if we endow the five-dimensional bulk with a Weyl integrable geometric structure, or if we assume the existence of a torsion field acting in the bulk. In this picture, the kind of interaction considered in the Rubakov-Shaposhnikov model is replaced by an interaction of fermions with a geometric field, namely a Weyl scalar field or a torsion field. We show that in both cases the confinement is independent of the energy and mass of the fermionic particle. We generalize these results to the case in which the bulk is an arbitrary n-dimensional curved space.     

Motion of a rigid cylinder between parallel plates in stokes flow : Part 1: Motion in a quiescent fluid and sedimentation

A general numerical scheme for solution of two-dimensional Stokes equations in a multiconnected domain of arbitrary shape [1, 2] is applied to the motion of a rigid circular cylinder between plane parallel boundaries. Numerically generated boundary-conforming coordinates are used to transform the flow domain into a domain with rectilinear boundaries. The transformed Stokes equations in vorticity-stream function form are then solved on a uniform grid using an iterative algorithm. In Part I coefficients of the resistance matrix representing the forces and torque on the cylinder due to its translational motion parallel or perpendicular to the boundaries or due to rotation about its axis are calculated. The solutions are obtained for a wide range of particle radii and positions across the channel. It is found that the force on a particle translating parallel to the boundaries without rotation exhibits a minimum at a position between the channel centerline and the wall and a local maximum on the centerline.

The resistance matrix is utilized to calculate translational and angular velocities of a free particle settling under gravity in a vertical channel. It is found that the translational velocity has a maximum at some lateral position and a minimum on the centerline; the particle angular velocity is opposite in sign to that of a particle rolling along the nearer channel wall except when the gap between the particle and the wall is very small. These results are compared with existing analytical solutions for a small cylindrical particle situated on the channel centerline, and with solutions of related 3-D problems for a spherical particle in a circular tube and in a place channel. It is shown that the behavior of cylindrical and spherical particles in a channel in many cases is qualitatively different. This is attributed to different flow patterns in these two cases. The motion of a spherical particle in a circular tube has qualitative and quantitative features similar to those for a cylindrical particle in a plane channel.     

Optical merger of direct vision with virtual images for scaled teleoperation

Scaled teleoperation is increasingly prevalent in medicine, as well as in other applications of robotics. Visual feedback in such systems is essential and should make maximal use of natural hand-eye coordination. This paper describes a new method of visual feedback for scaled teleoperation in which the operator manipulates the handle of a remote tool in the presence of a registered virtual image of the target in real time. The method adapts a concept already used successfully in a new medical device called the sonic flashlight, which permits direct in situ visualization of ultrasound during invasive procedures. The sonic flashlight uses a flat-panel monitor and a half-silvered mirror to merge the visual outer surface of a patient with a simultaneous ultrasound scan of the patient's interior. Adapting the concept to scaled teleoperation involves removing the imaging device and the target to a remote location and adding a master-slave control device. This permits the operator to see his hands, along with what appears to be the tool, and the target, merged in a workspace that preserves natural hand-eye coordination. Three functioning prototypes are described, one based on ultrasound and two on light microscopy. The limitations and potential of the new approach are discussed.     

Dynamic setup scheduling and flow control in manufacturing systems

We propose a method for flow control of parts in a manufacturing system with machines that require setups. The setup scheduling problem is investigated in the context of a multilevel hierarchy of discrete events with distinct frequencies. The higher level of the hierarchy calculates a target trajectory in the surplus/backlog space of the part types which must be tracked at the level of setups. We consider a feedback setup scheduling policy which usescorridors in the surplus/backlog space of the part types to determine the timing of the set-up changes in order to guide the trajectory in the desired direction. An interesting case in which the trajectory leads to a target point (e.g., a hedging point) is investigated in detail. It is shown that in this case the surplus/backlog trajectory at the setup level can lead to a limit cycle. Conditions for linear corridors which result in a stable limit cycle are determined.     

判别线面相交及面面相交可见性的假想墙法

针对判别直线与平面相交及平面与平面相交的可见性提出了一种假想墙的方法。 在直线与平面相交问题中探讨了 3 种典型的情况：一般位置直线与特殊位置平面相交、一般位 置直线与一般位置平面相交、特殊位置直线与一般位置平面相交;在平面与平面相交的问题中 探讨了 3 种典型的情况：特殊位置平面与特殊位置平面相交、一般位置平面与特殊位置平面相 交、一般位置平面与一般位置平面相交。通过假想墙方法,可快速准确地判断直线与平面相交 及平面与平面相交的可见性,为机械制图课程相关内容的学习及教学提供一些参考。     

Visual displays: the highlighting paradox

Office computer users view well over a billion displays in a given year. The savings of only a fraction of a second in the time it takes users to process each display can potentially lead to enormous time and cost savings. In recent research investigators have shown that on average subjects are quicker to find a target option in a highlighted display than in a display without highlighting. Paradoxically, in related research other investigators have shown that subjects are slower to find a target in a highlighted display than in a display without highlighting. In an attempt to resolve this paradox, an additional set of experiments was performed. Results from these experiments suggest that in order to determine whether highlighting will be of benefit, one must know the type of highlighting, the level of highlighting validity, and the probability that subjects attend first to the highlighted options.     

A constructive algorithm to solve "convex recursive deletion" (CoRD) classification problems via two-layer perceptron networks.

A sufficient condition that a region be classifiable by a two-layer feedforward neural net (a two-layer perceptron) using threshold activation functions is that either it be a convex polytope or that intersected with the complement of a convex polytope in its interior, or that intersected with the complement of a convex polytope in its interior or... recursively. These have been called convex recursive deletion (CoRD) regions. We give a simple algorithm for finding the weights and thresholds in both layers for a feedforward net that implements such a region. The results of this work help in understanding the relationship between the decision region of a perceptron and its corresponding geometry in input space. Our construction extends in a simple way to the case that the decision region is the disjoint union of CoRD regions (requiring three layers). Therefore this work also helps in understanding how many neurons are needed in the second layer of a general three-layer network. In the event that the decision region of a network is known and is the union of CoRD regions, our results enable the calculation of the weights and thresholds of the implementing network directly and rapidly without the need for thousands of backpropagation iterations.     

Facial Recognition System for Suspect Identification Using a Surveillance Camera

Nowadays, finding and Tracking a person in the world of technology is becoming a necessary task for various security purposes. Since the advent of technology, the development in the field of Facial Recognition plays an important role and has been exponentially increasing in today’s world. In this, a model is proposed for facial recognition to identify and alert the system when a person in search has been found at a specific location under the surveillance of a CCTV camera. The CCTV cameras are connected to a centralized server to which the live streaming feed is uploaded by cameras at each location. The server contains a database of all persons to be found. Based on the video feed from each camera, if a particular person in search is found in a certain feed, then the location of that person will be tracked and also a signal is passed to the system responsible. This model is based on image processing concepts to match live images with the existing trained images of the person in search. Since this model recognizes a person based on the first and foremost primary unique feature of a human, that is, only the person’s face image is required and will be found to be stored in the database. Hence the task of finding a person reduces to the task of detecting human faces in the video feed and matching with the existing images from the database.