摘要：
Dynamic trust relationship making quantization model based on multiple attribute decision has been researched in this paper. Considering the problem that all information from nodes feedback would be not true or reliable, this paper improves a new rule to calculate the feedback trust and proposes a new quantization model on dynamic trust-relationship based on improved feedback trust. On this basis, from the complex structure characteristics of network, this paper introduces the nodes similarity and proposes a improved model of dynamic trust-relationship based on multi-attribution. The simulation experiment showed that the new model have better dynamic adaptability and get a better accuracy and stability of trust evaluation of network.
作者机构：
[刘朝晖; 刘曜; 阳小华] School of Computer Science and Technology, University of South China, Hengyang;Hunan;421001, China;[陈智; 吴志强] Science and Technology on Reactor System Design Technology Laboratory, Nuclear Power Institute of China, Chendu;610041, China
作者：
Lingyun Luo;Xinxin Liu;Xiaohua Yang;Zhiming Liu
作者机构：
School of Computer Science and Technology,University of South China,Hengyang 421001,China;Laboratory of Computer Science,Institute of Software,Chinese Academy of Sciences,P.O.Box 8718,Beijin
会议名称：
2014全国理论计算机科学学术年会
会议时间：
20141016
会议地点：
济南
会议论文集名称：
2014全国理论计算机科学学术年会论文集
关键词：
Up-to technique;Coalgebra;Bisimulation;Jointly consistent function
摘要：
To further explore the up-to techniques for bisimulation in the coalgebra setting,we investigate a special kind of functor,i.e.,product functor in this paper.Specifically,when F is the product of n sub-functors,in order to generate an up-to proof for bisimulation,it is suffcient to find n functions,where each one is consistent with its corresponding sub-functor,as well as weakly consistent with other sub-functors.The array formed by the n functions is called jointly consistent with F.We also give the analogue of jointly consistent function in traditional set theory.As for application,examples are given both coalgebraically and set-theoretically.
作者机构：
[Tan, Min-Sheng; Li, Yang-Wei; Xiang, Ting; Peng, Qun-Zhong; Guo, Miao; Wang, Chen-Cheng] Univ South China Hengyang, Sch Comp Sci & Technol, Hengyang 421001, Hunan, Peoples R China.
会议名称：
3rd International Conference on Wireless Communication and Sensor Networks (WCSN)
会议时间：
DEC 10-11, 2016
会议地点：
Wuhan, PEOPLES R CHINA
会议主办单位：
[Tan, Min-Sheng;Wang, Chen-Cheng;Guo, Miao;Xiang, Ting;Peng, Qun-Zhong;Li, Yang-Wei] Univ South China Hengyang, Sch Comp Sci & Technol, Hengyang 421001, Hunan, Peoples R China.
会议论文集名称：
ACSR-Advances in Comptuer Science Research
关键词：
the improvement of LEACH algorithm;optimal cluster head selection;cluster heads forecasting mechanism;time schedule
摘要：
In order to solve the problem of LEACH Algorithm cannot guarantee the larger residual energy node absolutely were elected as cluster head, and it consumes large amounts of energy for double counting of cluster head election, at the same time, the influence of the node distance for cluster head election is not included. The improved LEACH algorithm has solved the problems very well, it makes a use of cluster heads projection to decrease the number of cluster competition by combining with the optimal cluster head selection algorithm, which can reduce the node energy consumption, then to achieve equilibrium network energy consumption and prolong the survival time of the network. And the experimental results are shown that the improved LEACH algorithm balanced the energy consumption of the entire network, significantly reduced the power consumption of the nodes in the monitoring area, delayed the first dead nodes appear on the number of rounds, and prolonged the life cycle of monitoring network.
作者机构：
[Wang, Lin-Wei; Li, Yan] Capital Med Univ, Beijing Shijitan Hosp, Dept Surg Oncol, Beijing 100038, Peoples R China.;[Wang, Lin-Wei; Wu, Han; Liu, Wen-Lou; Li, Yan; Chen, Jia-Mei] Wuhan Univ, Zhongnan Hosp, Dept Oncol, Wuhan 430071, Peoples R China.;[Qu, Ai-Ping] Univ South China, Sch Comp Sci & Technol, Hengyang 421001, Peoples R China.;[Yuan, Jing-Ping] Wuhan Univ, Renmin Hosp, Dept Pathol, Wuhan 430060, Peoples R China.;[Liu, Juan] Wuhan Univ, Sch Comp, Wuhan 430072, Peoples R China.
通讯机构：
[Li, Yan] C;[Li, Yan; Liu, Juan] W;Capital Med Univ, Beijing Shijitan Hosp, Dept Surg Oncol, Beijing 100038, Peoples R China.;Wuhan Univ, Zhongnan Hosp, Dept Oncol, Wuhan 430071, Peoples R China.;Wuhan Univ, Sch Comp, Wuhan 430072, Peoples R China.
摘要：
As a widely used proliferative marker, Ki67 has important impacts on cancer prognosis, especially for breast cancer (BC). However, variations in analytical practice make it difficult for pathologists to manually measure Ki67 index. This study is to establish quantum dots (QDs)-based double imaging of nuclear Ki67 as red signal by QDs-655, cytoplasmic cytokeratin (CK) as yellow signal by QDs-585, and organic dye imaging of cell nucleus as blue signal by 4',6-diamidino-2-phenylindole (DAPI), and to develop a computer-aided automatic method for Ki67 index measurement. The newly developed automatic computerized Ki67 measurement could efficiently recognize and count Ki67-positive cancer cell nuclei with red signals and cancer cell nuclei with blue signals within cancer cell cytoplasmic with yellow signals. Comparisons of computerized Ki67 index, visual Ki67 index, and marked Ki67 index for 30 patients of 90 images with Ki67 </= 10% (low grade), 10% < Ki67 < 50% (moderate grade), and Ki67 >/= 50% (high grade) showed computerized Ki67 counting is better than visual Ki67 counting, especially for Ki67 low and moderate grades. Based on QDs-based double imaging and organic dye imaging on BC tissues, this study successfully developed an automatic computerized Ki67 counting method to measure Ki67 index.
