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

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

来源：评论

学校读者我要写书评

暂无评论

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Predictive Resilience Assessment of Road Networks Based on Dynamic Multi-Granularity Graph Neural Network

SSRN

引用

SSRN 2024年

作者： Zang, Di Ding, Yongjie Zhao, Jiayi Tang, Keshuang Zhu, Hong Key Laboratory of Embedded System and Service Computing Ministry of Educaiton Department of Computer Science and Technology Tongji University No. 4800 Cao’an Road Shanghai China Key Laboratory of Road and Traffic Engineering Ministry of Education College of Transportation Engineering Tongji University No. 4800 Cao’an Road Shanghai China

Due to the influence of global climate anomalies, abnormal weather conditions such as heavy rainfall have become more frequent in recent years, posing a significant threat to the operation of transportation systems. An effective assessment of the resilience of the transportation system before and during heavy rain can alert the transportation department to take necessary emergency actions. However, existing methods for assessing the rainfall resilience of transportation networks mostly suffer from the following problems: 1) Simulation methods for modeling rainfall impacts lack realism;2) After-the-fact evaluations of resilience cannot offer advance warning prior to or during a heavy rain event. To address above problems, we present a novel resilience assessment methodology for evaluating the resilience of road networks in real-time during heavy rainfall scenarios. In this methodology, we propose the temporal decomposition-based dynamic multi-granularity graph neural network (TD2MG2NN) for long-term traffic speed forecasting, providing a perspective on the future evolution of traffic states for accurate resilience assessment. In addition, we construct a composite traffic resilience indicator, designed to comprehensively reflect changes in the spatial-temporal resilience of the transportation system during heavy rain. Experimental results on four publicly real datasets indicate that the prediction performance of TD2MG2NN outperforms state-of-the-art models. The assessment results for the transportation road network in California demonstrate that the comprehensive resilience indicator is superior to single functional resilience indicator and the real-time methodology for evaluating resilience can accurately depict and predict the operation of the road network system under heavy rainfall scenarios. © 2024, The Authors. All rights reserved.

关键词： Roads and streets

来源：评论

学校读者我要写书评

暂无评论

A Microfluidic Spherical Helix Module Using Liquid Metal and Additive Manufacturing for Drug Delivery Applications

A Microfluidic Spherical Helix Module Using Liquid Metal and...

引用

Microwave, MTT-S International Symposium

作者： Yangyang Guan Shicong Wang Manos M. Tentzeris Yuanan Liu Beijing Key Laboratory of Work Safety Intelligent Monitoring Beijing University of Posts and Telecommunications China Key Laboratory of Embedded System and Service Computing of the Ministry of Education Tongji University China Agile Technologies for High-performance Electromagnetic Novel Applications Georgia Institute of Technology USA

In this paper, a spherical helix module based on 3D printing and microfluidic technologies was fabricated, tested and applied to drug delivery applications. A liquid metal alloy is introduced to enhance the sensitivity of the complex and drug-/liquid-reconfigurable helix topology. Moreover, the influence of the dimensions of the hemisphere inscribed by the helical turns on the resonant frequency of the structure is researched. The microfluidic channels with 1 mm radius are shaped in the form of double semispherical helix using a Form-2 3D printer. To fulfill effectively the liquid metal (LM) injection, movement and recycle for reuse, a syringe pump is integrated to flexibly control the flow of the fluid. Besides, the proof-of-concept prototype achieves excellent radiation gain and impedance matching. The realized sensitivity is 0.96 mL/GHz and 0.33 mL/GHz corresponding with the frequency shift from 2.28 to 2.01 GHz and 2.01 to 1.65 GHz.

关键词： Resonant frequency Monitoring Microfluidics Liquids Drugs Mathematical model Three-dimensional printing

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Polynomial-time hierarchy of computable reals

引用

Journal of Computational Information systems 2011年第4期7卷 1108-1115页

作者： Chen, Qingliang Su, Kaile Wu, Lijun Department of Computer Science Jinan University Guangzhou 510632 China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China Key Laboratory of High Confidence Software Technologies Ministry of Education Peking University Beijing China Institute for Integrated and Intelligent Systems Griffith University Brisbane Australia School of Computer Science and Engineering University of Electronic Science and Technology Chengdu 610054 China

In mathematics, various representations of real numbers have been investigated and all these representations are proved to be mathematically equivalent. Furthermore, it is known that all effective versions of these representations lead to the same class of "computable real numbers". However, when subrecursive (such as primitive recursive) is taken into account, these representations can lead to different notions of "computable real numbers". This paper will look into the polynomial-time version of the problem for computable real numbers under different representations. We will summarize the known results to exhibit the comprehensive hierarchy they form. Our goal is to clarify systematically how the polynomial-time computability depends on the representations of the real numbers. Copyright © 2011 Binary Information Press.

关键词： Polynomial approximation

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：