Autofluorescence imaging and magnification endoscopy

It is well known that angiogenesis is critical in the transition from premalignant to malignant lesions.Consequently,early detection and diagnosis based on morphological changes to the microvessels are crucial.In the last few years,new imaging techniques which utilize the properties of light-tissue interaction have been developed to increase early diagnosis of gastrointestinal(GI) tract neoplasia.We analyzed several "red-flag" endoscopic techniques used to enhance visualization of the vascular pattern of preneoplastic and neoplastic lesions(e.g.trimodal imaging including autofluorescence imaging,magnifying endoscopy and narrow band imaging).These new endoscopic techniques provide better visualization of mucosal microsurface structure and microvascular architecture and may enhance the diagnosis and characterization of mucosal lesions in the GI tract.In the near future,it is expected that trimodal imaging endoscopy will be practiced as a standard endoscopy technique as it is quick,safe and accurate for making a precise diagnosis of gastrointestinal pathology,with an emphasis on the diagnosis of early GI tract cancers.Further large-scale randomized controlled trials comparing these modalities in different patient subpopulations are warranted before their endorsement in the routine practice of GI endoscopy.

Sensor fault diagnosis of time-delay systems based on adaptive observer

Presents a novel approach for the sensor fault diagnosis of time-delay systems by using an adaptive observer technique. The sensor tault is modeled as an additive perturbation described by a time varying function. Systems without model uncertainty are initially considered, followed by a discussion of a general situation where the system is subjected to either model uncertainty or external disturbance. An adaptive diagnostic algorithm is developed to diagnose the fault, and a modified version is proposed for general system to improve robusiness. The stability of fault diagnosis system is proved. Finally, a numerical example is given to illustrate the efficiency of the proposed method.

An Effective Diagnosis of Diabetic Retinopathy with Aid of Soft Computing Approaches

DR （diabetic retinopathy） is a most probable reason of blindness in adults, but the only remedy or escape from blindness is that we have to detect DR as early. Several automated screening techniques are used to detect individual lesions in the retina. Still it takes more dependency of time and experts. To overcome those problems and also automatically detect DR in easier and faster way, we took into soft computing approaches in our proposed work. Our proposed work will discuss several amounts of soft computing algorithms, it can detect DR features （landmark and retinal lesions） in an easy manner. Processes includes are： （1） Pre-processing; （2） Optic disc localization and segmentation; （3） Localization of fovea; （4） Blood vessel segmentation; （5） Feature extraction; （6） Feature selection; Finally （7） detection of diabetic retinopathy stages （mild, moderate, severe and PDR）. Our experimental results based on Matlab simulation and it takes databases of STARE and DRIVE. Proposed effective soft computing approaches should improve the sensitivity, specificity and accuracy.

14-16世纪日本村落共同体的形成与自治

从14世纪中叶开始,伴随着集村化运动在各地的进展,日本逐步形成了具有一定自治性的村落共同体--"总村"。这一村落共同体区别于之前各历史阶段的村落,很多延续至近世乃至近代。其自治性主要体现在如下几个方面:各类租税的收取和缴纳由"总村"负责,即"地下请";"总村"对村内百姓拥有一定的裁判权,即"自检断";在与外部村落发生冲突时,"总村"通过武装斗争以及申诉等各类手段积极解决争端。这些自治活动显示,"总村"内部存在村落运行组织,但其主导权主要集中于代表上层百姓的"地侍"阶层。15世纪后半期出现的各地域政权利用村落共同体的自治推进统治,使得"总村"成为大名地方支配的基本单位。这一政策基本为之后的织丰统一政权以及德川幕府所继承,反映了日本中世向近世转型过程中断裂与连续并存的复杂面相。

A QUANTIFIER-ELIMINATION BASED HEURISTIC FOR AUTOMATICALLY GENERATING INDUCTIVE ASSERTIONS FOR PROGRAMS

A method using quantifier-elimination is proposed for automatically generating program invariants/inductive assertions. Given a program, inductive assertions, hypothesized as parameterized formulas in a theory, are associated with program locations. Parameters in inductive assertions are discovered by generating constraints on parameters by ensuring that an inductive assertion is indeed preserved by all execution paths leading to the associated location of the program. The method can be used to discover loop invariants-properties of variables that remain invariant at the entry of a loop. The parameterized formula can be successively refined by considering execution paths one by one; heuristics can be developed for determining the order in which the paths are considered. Initialization of program variables as well as the precondition and postcondition, if available, can also be used to further refine the hypothesized invariant. The method does not depend on the availability of the precondition and postcondition of a program. Constraints on parameters generated in this way are solved for possible values of parameters. If no solution is possible, this means that an invariant of the hypothesized form is not likely to exist for the loop under the assumptions/approximations made to generate the associated verification condition. Otherwise, if the parametric constraints are solvable, then under certain conditions on methods for generating these constraints, the strongest possible invariant of the hypothesized form can be generated from most general solutions of the parametric constraints. The approach is illustrated using the logical languages of conjunction of polynomial equations as well as Presburger arithmetic for expressing assertions.