检索结果-内蒙古大学图书馆

Classification of facial diagnosis gloss in Chinese medicine based on different algorithms

Chinese journal of integrative medicine 2016年 2016 Apr 4页

作者： Fu-Feng Li Rui Zhou Guo-Zheng Li Rui-Wei Zhao Four Diagnosis Laboratory of Traditional Chinese Medicine Shanghai University of Traditional Chinese Medicine Shanghai 201203 China. li_fufeng@***. Four Diagnosis Laboratory of Traditional Chinese Medicine Shanghai University of Traditional Chinese Medicine Shanghai 201203 China. The Key Laboratory of Embedded System and Service Computing Ministry of Education Department of Control Science & Engineering Tongji University Shanghai 201804 China.

OBJECTIVE:To design a face gloss classification model and to provide an automatic and quantitative approach for the diagnosis of Chinese medicine (CM) based on the face images. METHODS:To classify the face gloss images into two groups (gloss and non-gloss), feature extraction methods were applied to the original images. The original images were supposed to obtain a more ideal representation in which gloss information was better revealed in four color spaces [including red, green, blue (RGB), hue, saturation, value (HSV), Gray and Lab]. Principal component analysis (PCA), 2-dimensional PCA (2DPCA), 2-directional 2-dimensional PCA [(2D)PCA], linear discriminant analysis (LDA), 2-dimensional LDA (2DLDA), and partial least squares (PLS) were used as the feature extraction methods of face gloss. k nearest neighbor was used as the classifification method. RESULTS:All the six feature extraction methods were useful in extracting information of face gloss, especially LDA, which had the best prediction accuracy in the 4 color spaces. The average accuracy of LDA in the Lab was 7%-10% higher than that of PCA, 2DPCA, (2D)PCA and 2DLDA P<0.05). The prediction accuracy of LDA reached 98% in the Lab color space and showed practical usage in clinical diagnosis. The consistent rate between the CM experts and the facial diagnosis system was 81%. CONCLUSION:A computer-assisted classifification model was designed to provide an automatic and quantitative approach for the gloss diagnosis of CM based on the face images.

关键词： Chinese medicine computer-assisted face gloss diagnosis feature extraction image processing

来源：评论

学校读者我要写书评

暂无评论

Description and verification of dynamic software architectures for distributed systems

Journal of Software

引用

Journal of Software 2010年第7期5卷 721-728页

作者： Xu, Hongzhen Zeng, Guosun Chen, Bo Department of computer Science and Technology Tongji University Shanghai 201804 China Department of Computer Science and Technology East China Institute of Technology Fuzhou Jiangxi Province 344000 China Embedded System and Service Computing Key Lab of Ministry of Education Shanghai 201804 China

Continuing growth and increasing complexity of distributed software systems make them be more flexible, adaptive and easily extensible. Dynamic evolution or reconfiguration of distributed software systems is one possible solution to meet these demands. However, there are some challenges for building dynamically evolving distributed software systems at runtime, where dynamic software architectures for them is one of the most crucial problems. In this paper, we proposed a formal method of describing and verifying dynamic software architectures for distributed systems using hypergraph grammars. We firstly gave out reconfiguration production rules and operations for software architectures based on hypergraph grammars, and then described dynamic reconfiguration of software architectures for distributed systems according to those rules. At last we verified the invariant property of dynamic software architectures for those systems using model checking, and gave out corresponding verification algorithms. © 2010 ACADEMY PUBLISHER.

关键词： Dynamic models

来源：评论

学校读者我要写书评

暂无评论

Petri net-based scheduling analysis of dual-arm cluster tools with wafer revisiting

Petri net-based scheduling analysis of dual-arm cluster tool...

引用

IEEE International Conference on Automation Science and Engineering (CASE)

作者： Yan Qiao NaiQi Wu MengChu Zhou Department of Industrial Engineering School of Electro-Mechanical Engineering Guangdong University of Technology Guangzhou China The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China Department of Electrical and Computer Engineering New Jersey Institute of Technology Newark NJ USA

With wafer revisit, it is complicated to schedule cluster tools in semiconductor fabrication. In wafer fabrication processes, such as atomic layer deposition (ALD), the wafers need to visit some process modules for a number of times. The existing swap-based strategy can be used to operate a dual-arm cluster tool for such a process. It results in a 3-wafer cyclic schedule. However, it is not optimal in the sense of cycle time. Thus, to search for a better schedule, a Petri net model is developed for a dual-arm cluster tool with wafer revisit. With it, the properties of the 3-wafer schedule are analyzed. It is found that, to improve the performance, it is necessary to reduce the number of wafers completed in a cycle. Thus, a 1-wafer schedule is developed by using a new swap-based strategy.

关键词： Robots Schedules Semiconductor device modeling Firing Steady-state Load modeling Transient analysis

来源：评论

学校读者我要写书评

暂无评论

Asymptotic throughput for large-scale wireless networks with general node density

引用

Wireless Networks 2012年第5期19卷 559-575页

作者： Cheng Wang Changjun Jiang Xiang-Yang Li Yunhao Liu Department of Computer Science Tongji University Shanghai China Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai China The Tsinghua National Laboratory for Information Science and Technology (TNLIST) Department of Computer Science and Engineering Tongji University Shanghai China The Department of Computer Science Illinois Institute of Technology Chicago USA The TNLIST and School of Software Tsinghua University Beijing China CSE The Hong Kong University of Science and Technology Kowloon Hong Kong

We study the asymptotic throughput for a large-scale wireless ad hoc network consisting of n nodes under the generalized physical model. We directly compute the throughput of multicast sessions to unify the unicast and broadcast throughputs. We design two multicast schemes based on the so-called ordinary arterial road system and parallel arterial road system, respectively. Correspondingly, we derive the achievable multicast throughput by taking account of all possible cases of n s = ω(1) and 1 ≤ n d ≤ n − 1, rather than only the cases of $$n_s=\Uptheta(n)$$ as in most related works, where n s and n d denote the number of sessions and the number of destinations of each session, respectively. Furthermore, we consider the network with a general node density $$\lambda \in [1,n]$$ , while the models in most related works are either random dense network (RDN) or random extended network (REN) where the density is λ = n and λ = 1, respectively, which further enhances the generality of this work. Particularly, for the special case of our results by letting λ = 1 and $$n_s=\Uptheta(n)$$ , we show that for some regimes of n d , the multicast throughputs achieved by our schemes are better than those derived by the well-known percolation-based schemes.

关键词：

来源：评论

学校读者我要写书评

暂无评论

ASBSO: An improved brain storm optimization with flexible search length and memory-based selection

arXiv

引用

arXiv 2021年

作者： Yu, Yang Gao, Shangce Wang, Yirui Cheng, Jiujun Todo, Yuki The Faculty of Engineering University of Toyama Toyama930-8555 Japan Key Laboratory of Embedded System and Service Computing Ministry of Education Department of Computer Science and Technology Tongji University Shanghai200092 China The School of Electrical and Computer Engineering Kanazawa University Kanazawa-shi920-1192 Japan

Brain storm optimization (BSO) is a newly proposed population-based optimization algorithm which uses a logarithmic sigmoid transfer function to adjust its search range during the convergent process. However, this adjustment only varies with the current iteration number, and lacks of flexibility and variety which makes a poor search efficiency and robustness of BSO. To alleviate this problem, an adaptive step length structure together with a success memory selection strategy are proposed to be incorporated into BSO. This proposed method, adaptive step length based on memory selection BSO, namely ASBSO, applies multiple step lengths to modify the generation process of new solutions, thus supplying a flexible search according to corresponding problems and convergent periods. The novel memory mechanism which is capable of evaluating and storing the degree of improvements of solutions is used to determine the selection possibility of step lengths. A set of 57 benchmark functions are used to test ASBSO's search ability, and four real-world problems are adopted to show its application value. All these test results indicate the remarkable improvement in solution quality, scalability and robustness of ASBSO. Copyright © 2021, The Authors. All rights reserved.

关键词： Swarm intelligence

来源：评论

学校读者我要写书评

暂无评论

New reachability trees for unbounded Petri nets

New reachability trees for unbounded Petri nets

引用

IEEE International Conference on Robotics and Automation (ICRA)

作者： ShouGuang Wang MengChu Zhou MengDi Gan Dan You Yue Li School of Information & Electronic Engineering Zhejiang Gongshang University Hangzhou China State Key Laboratory for Manufacturing Systems Engineering Xi'an Jiaotong University Xi'an China MoE Key Laboratory of Embedded System and Service Computing Tongji University Shanghai China Department of Electrical and Computer Engineering New Jersey Institute of Technology Newark NJ USA

ISBN: (纸本)9781479969241

Reachability is an important dynamic property of Petri nets. Its determination given an unbounded net and initial marking has remained an open problem since 1960s. Due to its extreme difficulty, a great deal of research has been focused on some subclasses of unbounded nets. For arbitrary ones, this work intends to propose a new reachability tree (NRT), which consists of only but all reachable markings from its initial marking. Furthermore, an NRT-based method to decide deadlocks of unbounded nets is presented. An example is provided to show the new results.

关键词： system recovery Petri nets Manufacturing systems Solids Gallium nitride embedded systems

来源：评论

学校读者我要写书评

暂无评论

arXiv

引用

arXiv 2017年

作者： Lang, Guangming School of Mathematics and Statistics Changsha University of Science and Technology Changsha Hunan410114 China Department of Computer Science and Technology Tongji University Shanghai201804 China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai201804 China College of Mathematics and Econometrics Hunan University Changsha Hunan410004 China

In practical situations, there are many dynamic covering information systems with variations of attributes, but there are few studies on related family-based attribute reduction of dynamic covering information systems. In this paper, we first investigate updated mechanisms of constructing attribute reducts for consistent and inconsistent covering information systems when varying attribute sets by using related families. Then we employ examples to illustrate how to compute attribute reducts of dynamic covering information systems with variations of attribute sets. Finally, the experimental results illustrates that the related family-based methods are effective to perform attribute reduction of dynamic covering information systems when attribute sets are varying with time. Copyright © 2017, The Authors. All rights reserved.

关键词： Information use

来源：评论

学校读者我要写书评

暂无评论

Finite time convergence of pinning synchronization with a single nonlinear controller

arXiv

引用

arXiv 2021年

作者： Chen, Tianping Lu, Wenlian Liu, Xiwei The School of Computer Sciences/Mathematics Fudan University Shanghai200433 China The Centre for Computational Systems Biology School of Mathematical Sciences Fudan University China Department of Computer Science and Technology Tongji University The Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai200092 China

来源：评论

学校读者我要写书评

暂无评论

arXiv

引用

arXiv 2017年

作者： Lang, Guangming School of Mathematics and Statistics Changsha University of Science and Technology Changsha Hunan410114 China Department of Computer Science and Technology Tongji University Shanghai201804 China The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai201804 China College of Mathematics and Econometrics Hunan University Changsha Hunan410004 China

In practice, there are many dynamic covering decision information systems, and knowledge reduction of dynamic covering decision information systems is a significant challenge of covering-based rough sets. In this paper, we first study mechanisms of constructing attribute reducts for consistent covering decision information systems when adding objects using related families. We also employ examples to illustrate how to construct attribute reducts of consistent covering decision information systems when adding objects. Then we investigate mechanisms of constructing attribute reducts for consistent covering decision information systems when deleting objects using related families. We also employ examples to illustrate how to construct attribute reducts of consistent covering decision information systems when deleting objects. Finally, the experimental results illustrates that the related family-based methods are effective to perform attribute reduction of dynamic covering decision information systems when object sets are varying with time. Copyright © 2017, The Authors. All rights reserved.

关键词： Rough set theory

来源：评论

学校读者我要写书评

暂无评论

HeavyTracker: An Efficient Algorithm for Heavy-Hitter Detection in High-Speed Networks

HeavyTracker: An Efficient Algorithm for Heavy-Hitter Detect...

引用

International Conference on Parallel and Distributed systems (ICPADS)

作者： Jiakun Yu Yu-E Sun He Huang Yang Du Guoju Gao Hongli Xu Shigang Chen School of Computer Science and Technology Soochow University Suzhou China School of Rail Transportation Soochow University Suzhou China Ministry of Education Key Laboratory of Embedded System and Service Computing (Tongji University) Shanghai China School of Computer Science and Technology University of Science and Technology of China Hefei China

Detecting heavy hitters that constitute the majority of network traffic is a critical task in network measurement. However, the highly skewed network traffic and the size-limited on-chip memory pose great challenges for heavy-hitter detection. The prior arts either use sketches to track all flows or maintain a fix-sized tracking list for recording elephant flows, resulting in limited detection precision or time-consuming tracking list exchanges. This paper presents HeavyTracker, an efficient algorithm that detects heavy hitters based on a count-with-threshold strategy. A two-dimensional tracker unit array is employed in our design to capture the heavy hitters, where each flow is randomly mapped to one unit in all rows. The tracker unit is designed to accept many flows and precisely report the largest two with frequencies that reach a predefined threshold. This design eliminates the frequent and time-consuming exchanges for maintaining the tracking list, allowing us to use a hash table to track the reported elephant flows. Experimental results based on real Internet traces show that HeavyTracker achieves a high $\mathbf{F}_{\beta}$-Score of threshold-t detection (0.97) and over 99% precision of top-k detection under a tight memory size. Besides, it reduces the frequency estimation error by 97.4% compared to the state-of-the-art.

关键词： Art High-speed networks Measurement uncertainty Telecommunication traffic Size measurement Frequency estimation Internet

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：