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

IEEE International Conference on Image Processing

作者： Wenjie Chen Zhangkai Ni Hanli Wang Department of Computer Science and Technology Tongji University Shanghai P. R. China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai P. R. China

Text-to-image generation aims at synthesizing photo-realistic images from textual descriptions. Existing methods typically align images with the corresponding texts in a joint semantic space. However, the presence of the modality gap in the joint semantic space leads to misalignment. Meanwhile, the limited receptive field of the convolutional neural network leads to structural distortions of generated images. In this work, a structure-aware generative adversarial network (SaGAN) is proposed for (1) semantically aligning multimodal features in the joint semantic space in a learnable manner; and (2) improving the structure and contour of generated images by the designed content-invariant negative samples. Experimental results show that SaGAN achieves over 30.1% and 8.2% improvements in terms of FID on the datasets of CUB and COCO when compared with the state-of-the-art approaches.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Interval set cluster analysis: A re-formulation 1

引用

12th International Conference on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing, RSFDGrC 2009

作者： Yao, Yiyu Lingras, Pawan Wang, Ruizhi Miao, Duoqian Department of Computer Science University of Regina Regina SK S4S 0A2 Canada Department of Mathematics and Computing Science Saint Mary's University Halifax NS B3H 3C3 Canada Dept. of Comp. Science and Technology Key Laboratory of Embedded System and Service Computing Tongji University Shanghai 201804 China

ISBN: (数字)9783642106460

ISBN: (纸本)3642106455

A new clustering strategy is proposed based on interval sets, which is an alternative formulation different from the ones used in the existing studies. Instead of using a single set as the representation of a cluster, each cluster is represented by an interval set that is defined by a pair of sets called the lower and upper bounds. Elements in the lower bound are typical elements of the cluster and elements between the upper and lower bounds are fringe elements of the cluster. A cluster is therefore more realistically characterized by a set of core elements and a set of boundary elements. Two types of interval set clusterings are proposed, one is non-overlapping lower bound interval set clustering and the other is overlapping lower bound interval set clusterings, corresponding to the standard partition based and covering based clusterings. © 2009 Springer-Verlag Berlin Heidelberg.

关键词： Cluster analysis

来源：评论

学校读者我要写书评

暂无评论

Petri net modeling and one-wafer scheduling of single-arm multi-cluster tools

Petri net modeling and one-wafer scheduling of single-arm mu...

引用

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Epitaxial growth of NaCl on Fe (100) and characterization of Fe/NaCl/Fe magnetic tunnel junctions

Epitaxial growth of NaCl on Fe (100) and characterization of...

引用

IEEE Conference on Nanotechnology

作者： Yuan-Tao Ji Qiang Li Yong-Chao Tang Lin Li Guo-Xing Miao State Key Laboratory for Manufacturing Systems Engineering and Systems Engineering Institute Xi’an Jiaotong University Xi’an 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

ISBN: (纸本)9781479956234

Growth of NaCl and Fe/NaCl/Fe Magnetic tunneling junctions on Si (100) has been achieved by using a high vacuum electron-beam deposition system. Epitaxial tunnel junctions turn out to be prone to pinholes as well as electrode oxidation. Instead, the best tunneling magnetoresistance we have achieved in this system is on polycrystalline tunnel barriers with thin Mg insertion, and reaching 22.3% at room temperature.

关键词： Iron Junctions Magnetic tunneling Epitaxial growth Tunneling magnetoresistance Electrodes Silicon

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

$\varepsilon$-Constraint and Fuzzy Logic-Based Optimization of Hazardous Material Transportation via Lane Reservation

引用

IEEE Transactions on Intelligent Transportation systems 2013年第2期14卷 847-857页

作者： Zhen Zhou Feng Chu Ada Che MengChu Zhou Computing Integrative Biology and Complex Systems Laboratory University of Evry-Val dEssonne Evry France School of Management Northwestern Polytechnical University Xian China Key Laboratory of Embedded System and Service Computing of Ministry of Education Tongji University Shanghai China Department of Electrical and Computer Engineering New Jersey Institute of Technology Newark NJ USA

With economic development, a great amount of hazardous material is shipped in the transport network every day. Hazardous material transportation is well known for its high potential risk. An accident can cause very serious economic damage and will have a negative impact on public health and the environment over the long term. Transporting hazardous materials on special lanes can reduce the risk. However, a lane reservation strategy may worsen traffic conditions for other vehicles. This paper investigates a hazardous material transportation problem with lane reservation. The problem lies in how to choose lanes to be reserved in the network and select the path for each hazardous material shipment from the reserved lanes. The goal is to obtain the best compromise between the impact on normal traffic and the transportation risk. A multiobjective integer programming model is presented for the new problem. Then, an algorithm is developed based on the ε -constraint method and a fuzzy-logic-based approach. Pareto optimal solutions are obtained by the former, and a preferred solution is selected by the fuzzy-logic-based approach. Computational results demonstrate the efficiency of the proposed algorithm using an instance based on a real network topology and randomly generated instances.

关键词： Hazardous materials Accidents Roads Linear programming Vectors Optimization

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：