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

2013 IEEE International Conference on Automation Science and Engineering, CASE 2013

作者： Zhu, Qinghua Wu, Naiqi Qiao, Yan Zhou, Mengchu School of Computer Guangdong University of Technology Guangzhou 510006 China Macau University of Science and Technology China Department of Industrial Engineering School of Electro-Mechanical Engineering Guangdong University of Technology Guangzhou 510006 China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 201804 China Department of Electrical and Computer Engineering New Jersey Institute of Technology Newark NJ 07102-1982 United States

ISBN: (纸本)9781479915156

It is very challenging to schedule a multi-cluster tool for it needs to coordinate the activities of multiple robots. This paper studies one-wafer cyclic scheduling for multi-cluster tools whose bottleneck cluster tool is process-bound. A Petri net model is developed to describe the system. Based on the model, it is shown that, for any multi-cluster tool whose bottleneck cluster tool is process-bound, there is always a one-wafer cyclic schedule. Then, a method is presented to find the minimal cycle time and the optimal one-wafer cyclic schedule. The method requires only simple calculation. An example illustrates the application and effectiveness of the proposed method. © 2013 IEEE.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

SelectCast: Scalable Data Aggregation Scheme in Wireless Sensor Networks

引用

IEEE Transactions on Parallel and Distributed systems 2012年第10期23卷 1958-1969页

作者： Cheng Wang Changjun Jiang Shaojie Tang Xiang-Yang Li Key Laboratory of Embedded System and Service Computing 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 Department of Computer Science and Engineering Tsinghua National Laboratory for Information Science and Technology (TNLIST) University of Tongji China

In this work, for a wireless sensor network (WSN) of n randomly placed sensors with node density \lambda \in [1,n], we study the tradeoffs between the aggregation throughput and gathering efficiency. The gathering efficiency refers to the ratio of the number of the sensors whose data have been gathered to the total number of sensors. Specifically, we design two efficient aggregation schemes, called single-hop-length (SHL) scheme and multiple-hop-length (MHL) scheme. By novelly integrating these two schemes, we theoretically prove that our protocol achieves the optimal tradeoffs, and derive the optimal aggregation throughput depending on a given threshold value (lower bound) on gathering efficiency. Particularly, we show that under the MHL scheme, for a practically important set of symmetric functions called divisible perfectly compressible (DPC) functions, including the mean, max, and various kinds of indicator functions, etc., the data from \Theta (n) sensors can be aggregated to the sink at the throughput of a constant order \Theta (1), implying that, our MHL scheme is indeed scalable.

关键词： Throughput Wireless sensor networks Temperature measurement Protocols Lattices Temperature sensors

来源：评论

学校读者我要写书评

暂无评论

Knowledge Granulation in Interval-Valued Information systems

Knowledge Granulation in Interval-Valued Information Systems

引用

International Workshop on Intelligent systems and Applications, ISA

作者： Nan Zhang Duoqian Miao Can Gao Department of Computer Science and Technology University of Tongji Shanghai China Department of Electrical and Computer Engineering University of Alberta Edmonton AB Canada Key Laboratory of Embedded System and Service Computing of Ministry of Education University of Tongji Shanghai China

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.

关键词： Information systems Approximation methods Uncertainty Rough sets Computers Entropy

来源：评论

学校读者我要写书评

暂无评论

Information Security Evaluation by Information Flow Analysis Based on Stochastic Petri Nets

Information Security Evaluation by Information Flow Analysis...

引用

IEEE International Conference on systems, Man and Cybernetics

作者： Hanqian Tu Dongming Xiang Wang Lin Guanjun Liu Department of Computer Science and Technology Zhejiang Sci-Tech University Hangzhou China Department of Computer Science Key laboratory of Embedded System and Service Computing Ministry of Education Shanghai Electronic Transactions and Information Service Collaborative Innovation Center Tongji University Shanghai China

ISBN: (数字)9781665410205

ISBN: (纸本)9781665410212

The Petri-net-based information flow analysis offers an effective approach for detecting information leakage by the concept of non-interference. Although the related studies propose efficient solutions, they lack quantitative evaluation on information leakage. In this paper, we propose a novel method for quantitative evaluation of information security based on stochastic labeled Petri nets (SLPNs) and information flow analysis. Specifically, we introduce four different levels of security metrics, and provide a methodology for evaluating the information security. Furthermore, a case study is presented to show the feasibility of our method.

关键词： Measurement Petri nets Semantics Stochastic processes Information leakage Explosions Complexity theory Cybernetics Business

来源：评论

学校读者我要写书评

暂无评论

VCFGAN: A Two-stage Collaborative Filtering Framework based on Variational Autoencoders and Generative Adversarial Networks

VCFGAN: A Two-stage Collaborative Filtering Framework based ...

引用

Information systems and computing Technology (ISCTech), International Conference on

作者： Zhiqiang Huang Jinzhong Li Xueyu Huang Junqi Liu School of Software Engineering Jiangxi University of Science and Technology Nanchang China College of Electronics and Information Engineering Jinggangshan University Ji’an China Ministry of Education Key Laboratory of Embedded System and Service Computing (Tongji University) Shanghai China

ISBN: (数字)9798350379860

ISBN: (纸本)9798350379877

Deep generative models, such as Generative Adversarial Networks (GAN) and Variational Autoencoders (VAE), are widely used in collaborative filtering. They usually learn users’ preferences for items directly from a highly sparse user rating matrix (URM), and then recommend the top-N items to users. Due to the high sparsity of URM, GAN has limited ability to handle sparse data, while VAE’s encoder can extract features. Therefore, we propose a two-stage collaborative filtering framework based on variational autoencoders and generative adversarial networks, named VCFGAN. It first uses two VAEs to extract features from URM and side information (SI), and then uses the extracted latent vectors to train the GAN network. To evaluate the performance of our proposed VCFGAN model, some experiments are conducted on two real datasets, and the experimental results show that our model outperforms other representative models.

关键词： Training Collaborative filtering Autoencoders Generative adversarial networks Feature extraction Vectors Data mining Sparse matrices Recommender systems Information systems

来源：评论

学校读者我要写书评

暂无评论

On Theoretical Optimization of the Sensing Matrix for Sparse-Dictionary Signal Recovery

On Theoretical Optimization of the Sensing Matrix for Sparse...

引用

IEEE Global Conference on Signal and Information Processing (GlobalSIP)

作者： Jianchen Zhu Shengjie Zhao Xu Ma Gonzalo R. Arce Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai CHN School of Optics and Photonics Beijing Institute of Technology Beijing CHN Department of Electrical and Computer Engineering University of Delaware Newark Delaware USA

Compressive Sensing (CS) is a new paradigm for the efficient acquisition of signals that have sparse representation in a certain domain. Traditionally, CS has provided numerous methods for signal recovery over an orthonormal basis. However, modern applications have sparked the emergence of related methods for signals not sparse in an orthonormal basis but in some arbitrary, perhaps highly overcomplete, dictionary, particularly due to their potential to generate different kinds of sparse representation of signals. Here, we first propose the Signal space Subspace Pursuit (SSSP) algorithm, and then we derive a low bound on the number of measurements required. The algorithm has low computational complexity and provides high recovery accuracy.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Berth-Crane allocation model and algorithm of container berths in the uncertain environment

Advances in Intelligent Systems and Computing

引用

Advances in Intelligent systems and computing 2013年 212卷 785-792页

作者： Liu, Jian-xin Du, Yu-yue Hong, Yong-fa Sun, Lin-lin College of Information Science Engineering Shandong University of Science and Technology Qingdao 266590 Shandong China The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 200092 China College of Civil Engineering and Architecture SUST Qingdao 266590 Shandong China

ISBN: (纸本)9783642375019

According to the randomness of the vessel's arrival time and handling time, the establishment of a randomly-oriented environment container berths-crane allocation model, the optimizing goal is to minimize the average ship-waiting time. Taking into account the complexity of the model solution, this paper offers the design of an improved genetic algorithm to reduce the searching space, and according to the characteristics of the optimal solution. With testing example to verify that the model can simulate decision-making environment of berths-crane allocation problem and reflect the decision-maker's attitude toward risks and preferences. The algorithm can gain a stable and satisfactory solution within the operating time. © Springer-Verlag Berlin Heidelberg 2013.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Effcient poisoning attacks and defenses for unlabeled data in DDoS prediction of intelligent transportation systems

Security and Safety

引用

Security and Safety 2022年第1期1卷 145-165页

作者： Zhong Li Xianke Wu Changjun Jiang College of Information Science and Technology Donghua UniversityShanghai 201620China Key Laboratory of the Ministry of Education for Embedded System and Service Computing Department of Computer ScienceTongji UniversityShanghai 201804China Shanghai Network Financial Security Collaborative Innovation Center Tongji UniversityShanghai 201804China

Nowadays,large numbers of smart sensors(e.g.,road-side cameras)which com-municate with nearby base stations could launch distributed denial of services(DDoS)attack storms in intelligent transportation *** attacks disable the services provided by base *** in this paper,considering the uneven communication traffic ows and privacy preserving,we give a hidden Markov model-based prediction model by utilizing the multi-step characteristic of DDoS with a federated learning framework to predict whether DDoS attacks will happen on base stations in the ***,in the federated learning,we need to consider the problem of poisoning attacks due to malicious *** poisoning attacks will lead to the intelligent transportation systems paralysis without security *** poisoning attacks mainly apply to the classi cation model with labeled *** this paper,we propose a reinforcement learning-based poisoningmethod speci cally for poisoning the prediction model with unlabeled ***,previous related defense strategies rely on validation datasets with labeled data in the ***,it is unrealistic since the local training datasets are not uploaded to the server due to privacy preserving,and our datasets are also ***,we give a validation dataset-free defense strategy based on Dempster-Shafer(D-S)evidence theory avoiding anomaly aggregation to obtain a robust global model for precise DDoS *** our experiments,we simulate 3000 points in combination with DARPA2000 dataset to carry out *** results indicate that our poisoning method can successfully poison the global prediction model with unlabeled data in a short ***,we compare our proposed defense algorithm with three popularly used defense *** results show that our defense method has a high accuracy rate of excluding poisoners and can obtain a high attack prediction probability.

关键词： Poisoning attacks Defenses Multi-step DDoS prediction Unlabeled data Intel-ligent transportation systems

来源：评论

学校读者我要写书评

暂无评论

An Effective and Robust Pedestrians Detecting Algorithm & Symposia

An Effective and Robust Pedestrians Detecting Algorithm & Sy...

引用

International Conference on Intelligent Transportation

作者： Zhipeng Li Yun Sun Fuqiang Liu Wenhuan Shi Key Laboratory of Embedded System and Service Computing supported by Ministry of Education University of Tongji Shanghai China School of Electronics and Information Engineering University of Tongji Shanghai China Department of Control Science and Technology Shanghai Jiaotong University Shanghai China

In this paper, we present a pedestrian detection approach using spatial histograms of oriented gradients feature. As spatial histograms of oriented gradients consist of marginal distributions of an image over local and global patches, they can preserve shape and contour of a pedestrian simultaneously. There are two main contributions in this paper. First of all, we expand the histograms of oriented gradients features from single-size to variable-size which can capture local and global feature of pedestrian automatically. We call theses feature as the "spatial histograms of oriented gradients". Secondly, we employ histogram similarity and Fisher criterion to measure discriminability of features and select some discriminative features to identify the pedestrian. SVM classifier is constructed to train the selected features from target and surrounding background. The proposed algorithm is tested on some public database. Experimental results show that the proposed approach is efficient and rapid in pedestrian detection.

关键词： Robustness Conferences Histograms Support vector machines Shape Intelligent transportation systems Sun Support vector machine classification Computer vision Image edge detection

来源：评论

学校读者我要写书评

暂无评论

A Money Laundering Structure Detection Method Based on Incremental Transaction Analysis

A Money Laundering Structure Detection Method Based on Incre...

引用

Data Science and Information Technology (DSIT), International Conference on

作者： Yifei Meng Zhong Li Key Laboratory of Embedded System and Service Computing Ministry of Education National (Province-Ministry Joint) Collaborative Innovation Center for Financial Network Security Tongji University Shanghai China College of Information Science and Technology Donghua University Shanghai China

Money laundering is the process of legitimizing dirty money through complex transactions, posing a serious threat to a country’s financial stability and national security. Nowadays, with the prevalence of organized money laundering, launderers prefer to use intricate multi-hop laundering chains to transfer dirty money. Moreover, they engage in normal financial activities to disrupt detection by auditors. In response to these trends and challenges, we propose a novel unsupervised money laundering structure detection framework for the anti-money laundering field, called structure incremental expansion (SIE). Our framework consists of two main modules: 1) Initialization of suspicious structures, which adopts a control-limit based method to identify suspicious accounts exhibiting anomalous transaction behavior. These accounts will serve as the starting points for suspicious structure expansion. 2) Dynamic structure expansion, where we design three dynamic membership functions according to the Financial Action Task Force’s definitions of the three stages of money laundering evolution. Newly-added incremental transactions in the network will be assigned to appropriate expanding suspicious structures. We conduct extensive experiments on simulated and public financial networks. SIE exhibits desirable performance and scalability. We also provide a detailed case study, visualizing a complete money laundering structure detection process, demonstrating our method’s strong interpretability.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：