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

Differential Private Preservation Multi-core DBScan Clustering for Network User Data

Procedia Computer Science 2018年 129卷 257-262页

作者： Lina Ni Chao Li Haoran Liu Anu G. Bourgeois Jiguo Yu College of Computer Science and Engineering Shandong University of Science and Technology Qingdao China The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China Department of Computer Science Georgia State University University Plaza Atlanta GA 30303 USA School of Information Science and Engineering Qufu Normal University Shandong China

Mining rich network user data to extract valuable information becomes the focus and commercial interest of researchers. Differential privacy protection is a new paradigm based on data distortion, which protects sensitive data while maintains a certain statistical properties by adding random noise, and makes up for the shortcomings that traditional schemas require knowledge background assumptions and cannot analyze quantitatively. In this paper, we propose a DP-MCDBScan schema based on the powerful differential privacy. We perform simulation to evaluate our schema, whose results show that our schema has better efficiency, accuracy, and privacy protection effect than previous schemas.

关键词： Private preserving differential privacy MCDBScan clustering data mining Laplace noise

来源：评论

学校读者我要写书评

暂无评论

Modeling and analysis of dual-arm cluster tools for wafer fabrication with revisiting

Modeling and analysis of dual-arm cluster tools for wafer fa...

引用

IEEE International Conference on Automation Science and Engineering (CASE)

作者： Yan Qiao NaiQi Wu MengChu Zhou Department of Industrial Engineering School of Mechatronics Engineering Guangdong University of Technology Guangzhou China 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

Some wafer fabrication processes are repeated processes, e.g. atomic layer deposition (ALD) process. For such processes, the wafers need to visit some processing modules for a number of times, which complicates the cycle time analysis. This paper studies the cycle time analysis problem for such processes. With a Petri net model, it is found that such processes contain local cycles involving only the revisiting PMs and global cycles involving both revisiting and non-revisiting PMs. The process switches between these two types of cycles such that the process never reaches a steady state. Based on this finding, the mechanism underlying such processes is revealed and analytical expressions are given for the calculation of their cycle time. Illustrative examples are presented to show the application of the proposed approach.

关键词： Robots Semiconductor device modeling Fabrication Schedules Analytical models system recovery Load modeling

来源：评论

学校读者我要写书评

暂无评论

An Improved Adaptive Exponential Smoothing Model for Short-term Travel Time Forecasting of Urban Arterial Street

引用

Acta Automatica Sinica 2008年第11期34卷 1404-1409页

作者： Zhi-Peng LI Hong YU Yun-Cai LIU Fu-Qiang LIU Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 200092 P. R. China Intelligent Transportation System Department Shanghai Electrical Apparatus Research Institute Shanghai 200063 P. R. China Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University Shanghai 200240 P. R. China

Short-term forecasting of travel time is essential for the success of intelligent transportation system. In this paper, we review the state-of-art of short-term traffic forecasting models and outline their basic ideas, related works, advantages and disadvantages of each model. An improved adaptive exponential smoothing (IAES) model is also proposed to overcome the drawbacks of the previous adaptive exponential smoothing model. Then, comparing experiments are carried out under normal traffic condition and abnormal traffic condition to evaluate the performance of four main branches of forecasting models on direct travel time data obtained by license plate matching (LPM). The results of experiments show each model seems to have its own strength and weakness. The forecasting performance of IASE is superior to other models in shorter forecasting horizon (one and two step forecasting) and the IASE is capable of dealing with all kind of traffic conditions.

关键词： Travel time short-term forecasting license plate matching (LPM) exponential smoothing

来源：评论

学校读者我要写书评

暂无评论

Knowledge granulation in interval-valued information systems

Knowledge granulation in interval-valued information systems

引用

International Workshop on Intelligent systems and Applications

作者： Zhang, Nan Miao, Duoqian Gao, Can Department of Computer Science and Technology Tongji University Shanghai 201804 China Department of Computer Science University of Regina Regina SK S4S 0A2 Canada Key Lab. of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 201804 China Department of Electrical and Computer Engineering University of Alberta Edmonton AB T6R 2G4 Canada

ISBN: (纸本)9781424498574

Rough set theory, proposed by Pawlak, has been proved to be a mathematical tool to deal with vagueness and uncertainty in intelligent information processing. In this paper, we propose the concept of knowledge granulation in interval-valued information systems, and discuss some important properties. From these properties, it can be shown that the proposed knowledge granulation provides important approaches to measuring the discernibility of different knowledge. It may be helpful for rule evaluation and knowledge discovery in interval-valued information systems. © 2011 IEEE.

关键词： Information systems

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Real-time multi-target path prediction and planning for autonomous driving aided by FCN

arXiv

引用

arXiv 2019年

作者： Zhou, Hongtu Yang, Xinneng Zhang, Enwei Zhao, Junqiao Cai, Lewen Ye, Chen Wu, Yan Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai Department of Computer Science and Technology School of Electronics and Information Engineering Tongji University Shanghai Institute of Intelligent Vehicle Tongji University Shanghai Department of Computer Science Nanjing University Nanjing China

Real-time multi-target path planning is a key issue in the field of autonomous driving. Although multiple paths can be generated in real-time with polynomial curves, the generated paths are not flexible enough to deal with complex road scenes such as S-shaped road and unstructured scenes such as parking lots. Search and sampling-based methods, such as A* and RRT and their derived methods, are flexible in generating paths for these complex road environments. However, the existing algorithms require significant time to plan to multiple targets, which greatly limits their application in autonomous driving. In this paper, a real-time path planning method for multi-targets is proposed. We train a fully convolutional neural network (FCN) to predict a path region for the target at first. By taking the predicted path region as soft constraints, the A* algorithm is then applied to search the exact path to the target. Experiments show that FCN can make multiple predictions in a very short time (50 times in 40ms), and the predicted path region effectively restrict the searching space for the following A* search. Therefore, the A* can search much faster so that the multi-target path planning can be achieved in real-time (3 targets in less than 100ms). Copyright © 2019, The Authors. All rights reserved.

关键词： Autonomous vehicles

来源：评论

学校读者我要写书评

暂无评论

Optimal Linear Crossover for Mitigating Negative Transfer in Evolutionary Multitasking

引用

IEEE Transactions on Evolutionary Computation 2024年

作者： Liu, Zhaobo Yuan, Jianhua Zhang, Haili Zeng, Tao Zhu, Zexuan Shenzhen University Institute for Advanced Study Shenzhen518060 China Shenzhen University College of Computer Science and Software Engineering Shenzhen518060 China Shenzhen Polytechnic University School of Undergraduate Education Shenzhen518055 China Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen518060 China Shenzhen University Shenzhen City Key Laboratory of Embedded System Design Shenzhen518060 China Chongqing University Key Laboratory of Dependable Service Computing in Cyber Physical Society Ministry of Education of China Chongqing400044 China

Evolutionary multitasking algorithms use information exchange among individuals in a population to solve multiple optimization problems simultaneously. Negative transfer is a critical factor that affects the performance of evolutionary multitasking algorithms. In this study, we propose an innovative approach to mitigate negative transfer in evolutionary multitasking algorithms. The proposed approach is grounded in rigorous theoretical analysis, which provides valuable theoretical insights into the design of an optimal linear crossover operator for mitigating negative transfer. By identifying interpretable conditions, we establish a solid theoretical foundation to prevent negative transfer in diverse scenarios. Building upon these findings, we theoretically derive a closed-form expression for the optimal crossover operator and propose practical design methods based on approximations. Furthermore, we integrate the proposed optimal crossover operator into a fundamental evolutionary multitasking algorithm framework. The resultant algorithm is comparable or superior to other state-of-the-art methods. Empirical validation through comprehensive experiments confirms the effectiveness of our theoretical findings. © 1997-2012 IEEE.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Multicast Capacity Scaling Laws for Multihop Cognitive Networks

引用

IEEE Transactions on Mobile computing 2012年第11期11卷 1627-1639页

作者： Cheng Wang Shaojie Tang Xiang-Yang Li Changjun Jiang Key Laboratory of Embedded System and Service Computing Building of Electronics and Information Engineering Ministry of Education Shanghai China Department of Computer Science and Engineering University of Tongji China Department of Computer Science Illinois Institute of Technology Chicago IL USA Tsinghua National Laboratory for Information Science and Technology Tsinghua University Beijing China Department of Computer Science and Engineering University of Tongji Shanghai China

In this paper, we study multicast capacity for cognitive networks. We consider the cognitive network model consisting of two overlapping ad hoc networks, called the primary ad hoc network (PaN) and secondary ad hoc network (SaN), respectively. PaN and SaN operate on the same space and spectrum. For PaN (or SaN, respectively), we assume that primary (or secondary, respectively) nodes are placed according to a Poisson point process of intensity n (or m, respectively) over a unit square region. We randomly choose n s (or m s , respectively) nodes as the sources of multicast sessions in PaN (or SaN, respectively), and for each primary source vp (or secondary source v s , respectively), we pick uniformly at random nd primary nodes (or md secondary nodes, respectively) as the destinations of v p (or v s , respectively). Above all, we assume that PaN can adopt the optimal protocol in terms of the throughput. Our main work is to design the multicast strategy for SaN by which the optimal throughput can be achieved, without any negative impact on the throughput for PaN in order sense. Depending on nd and n, we choose the optimal one for PaN from two strategies called percolation strategy and connectivity strategy, respectively. Subsequently, we design the corresponding throughput-optimal strategy for SaN. We derive the regimes in terms of n, n d , m, and m d in which the upper bounds on multicast capacities for PaN and SaN can be achieved simultaneously. Unicast and broadcast capacities for the cognitive network can be derived by our results as the special cases by letting n d = 1 (or m d = 1) and n d = n - 1 (or m d = m - 1), respectively, which enhances the generality of this work.

关键词： Throughput Ad hoc networks Road transportation Slabs Routing Lattices Mobile computing

来源：评论

学校读者我要写书评

暂无评论

Admission Control for Non-preprovisioned service Flow in Wireless Metropolitan Area Networks

Admission Control for Non-preprovisioned Service Flow in Wir...

引用

European Conference on Universal Multiservice Networks (ECUMN)

作者： Liping Wang Fuqiang Liu Yusheng Ji Nararat Ruangchaijatupon The Key Laboratory of |Embedded System and Service Computing| Ministry of Education China Ministry of Education Tongji University Shanghai China Graduate University of Advanced Studies (SOKENDAI) Tokyo Japan National Institute of Information Japan School of Electronics and Information Engineering University of Tongji Shanghai China The Graduate University for Advanced Studies Tokyo Japan National Institute of Informatics Japan

Improving the admission control process in wireless metropolitan area networks (WMAN) based on the IEEE 802.16e standard can improve the QoS. Because IEEE 802.16e supports five classes of service as well as mobility, an admission control policy for non-preprovisioned service flow is proposed. This policy is compatible with the QoS parameters for each service class defined in the standard. As improvements, the guard channel scheme is used to give handover connections higher priority and a novel proportional bandwidth-borrowing scheme is added to prioritize the different service classes. The simulation results show the proposed admission control policy maximizes the bandwidth utilization and the use of the two schemes provides a reasonable priority order of new originated connections and handover connections of different service classes. The connection-blocking and connection-dropping probabilities were reduced to the extent that they can be ignored

关键词： Admission control Wireless LAN Metropolitan area networks Bandwidth Media Access Protocol Laboratories embedded system embedded computing Informatics Identity management systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：