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

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

自动化学报 2008年第11期34卷 1404-1409页

作者： LI Zhi-Peng YU Hong LIU Yun-Cai LIU Fu-Qiang 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

旅行时间的短期的预报为聪明的交通系统的成功是必要的。在这份报纸，我们考察预报模型的短期的交通的 state-of-art 并且构画出他们每个模型的基本想法，相关工作，优点和劣势。一改进适应指数的变光滑(IAES ) 模型也被建议克服以前的... 详细信息

旅行时间的短期的预报为聪明的交通系统的成功是必要的。在这份报纸，我们考察预报模型的短期的交通的 state-of-art 并且构画出他们每个模型的基本想法，相关工作，优点和劣势。一改进适应指数的变光滑(IAES ) 模型也被建议克服以前的适应指数的变光滑模型的缺点。然后，比较实验在状况和反常交通调节评估在牌照匹配获得的直接旅行时间数据(每分钟行数) 上预报模型的四个主要分支的性能的正常交通下面被执行。实验的结果证明每个模型似乎有它的自己的力量和软弱。IASE 的预报表演比在更突然预报地平线(预报的和二步) 的另外的模型优异， IASE 能够处理各种交通条件。

关键词：自适应指数平滑模型短期旅行时间预测预测方法信息处理技术城市街道设计方案

来源：评论

学校读者我要写书评

暂无评论

Improved condition for controllability of strongly dependent strict minimal siphons in Petri nets

Improved condition for controllability of strongly dependent...

引用

IEEE International Conference on Networking, Sensing and Control

作者： GuanJun Liu ChangJun Jiang MengChu Zhou Key Laboratory of the MoE for Embedded System and Service Computing University of Tongji Shanghai China Department of Electrical and Computer Engineering New Jersey Institute of Technology Newark NJ USA

Li and Zhou propose an important concept for Petri nets: elementary siphons. They partition siphons into elementary and dependent ones. The controllability of the latter can be ensured by the former's proper control. They give a sufficient condition to decide whether a dependent siphon is controlled by its elementary ones in S 3 PR. However, this condition is so loose that in many cases the controllability of a dependent SMS cannot be determined although it is actually controlled. In this paper, we propose an improved condition to decide the controllability of strongly dependent SMS.

关键词： Controllability system recovery Nickel Flexible manufacturing systems Petri nets Sufficient conditions Control theory

来源：评论

学校读者我要写书评

暂无评论

Graph Ensemble Neural Network

SSRN

引用

SSRN 2023年

作者： Duan, Rui Yan, Chungang Wang, Junli Jiang, Changjun Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai201804 China Collaborative Innovation Center for Financial Network Security Tongji University Shanghai201804 China

Ensemble methods have been shown to improve graph neural networks (GNNs). Existing ensemble methods on graphs determine a strong classifier by combining a set of trained base classifiers, i.e., combining the final outputs of base classifiers for prediction. However, these methods fail to promote many popular GNNs to perform well under heterophily (in graphs where many connected nodes havedifferent class labels), which limits their applicability. Furthermore, they ignore the hierarchical nature of GNNs, which results in no interaction between base classifiers when neighbors are aggregated (during training). Two issues arise from this: low applicability and shallow ensemble. We propose Graph Ensemble Neural Network (GEN) for addressing above issues, which is not a simple ensembleof GNNs, but instead integrates ensemble into GNNs to fuse a set of graphs. GEN deepens single ensemble into multiple ensembles during training and applies to homophily and heterophily graphs. In GEN, we design structure augmentation to generate some graphs for training and design feature augmentation for attenuating errors brought by the initial features. Different from existing graphensemble methods that execute only one ensemble, GEN executes multiple deep ensembles throughout the neighbor aggregation to fuse multiple graphs generated by structure augmentation. Extensive experiments show that GEN achieves new state-of-the-art performance on homophily and heterophily graphs for the semi- and full-supervised node classification. The source code of GEN is publicly available at https://***/graphNN/GEN1. © 2023, The Authors. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Collaborative Tensor Factorization and its Application in POI Recommendation

Collaborative Tensor Factorization and its Application in PO...

引用

IEEE International Conference on Networking, Sensing and Control

作者： Wenjing Luan Guanjun Liu Changjun Jiang Department of Computer Science & Technology Tongji University Shanghai P. R. China MoE Key Lab of Embedded System & Service Computing Tongji University Shanghai P. R. China

ISBN: (纸本)9781467399760

The rapid prevalence of location-based services provides an opportunity to understand people's mobility behavior, helps people easily decide where to go at the next moment, and helps salesmen select the most suitable commercial sites to delivery advertisements. In this paper, we propose a POI recommendation method based on collaborative tensor factorization. Firstly, we present a generalized objective function for collaboratively factorizing an n-mode tensor with m feature matrices. Secondly, all users' check-in behaviors are modeled as a 3-mode tensor and three feature matrices are extracted to characterize the time distribution, category distribution and POI correlation. Thirdly, we fill the missing entries by using our collaborative tensor factorization approach such that a user's rating to a POI at a specific time is recovered. Our experiment on a real check-in database shows that our method can provide more accurate recommendation.

关键词： Tensor factorization context feature extraction POI recommendation

来源：评论

学校读者我要写书评

暂无评论

Upper bounds on lifetime of ordinary clustering ultra wide band sensor networks

引用

Ruan Jian Xue Bao/Journal of Software 2011年第2期22卷 313-322页

作者： Xu, Juan Hong, Yong-Fa Wang, Cheng Bai, Xing-Zhen College of Electronics and Information Engineering Tongji University Shanghai 200092 China Key Laboratory of Embedded System and Service Computing of the Ministry of Education Tongji University Shanghai 200092 China College of Information Science and Engineering Shandong University of Science and Technology Qingdao 266510 China

This paper considers the time hopping impulse radio ultra wide band (TH-IR UWB) sensor networks, with n sensor nodes uniformly and independently located on a square and a Sink. The upper bounds on the lifetime of ordinary clustering dense and extended TH-IR UWB sensor networks are derived respectively. For ordinary clustering networks, the cluster head aggregates data from the nodes within its own cluster, and relays data to other cluster heads. The results indicate that the upper bounds on the lifetime of ordinary clustering dense TH-IR UWB are in proportion with the node density (or the number of nodes), while the upper bounds on the lifetime of extended networks are inversely proportional to the size of the deployment area (or the number of nodes). The results also reveal that the upper bound on the lifetime of dense network in the ideal case are longer than those of the static network by a factor of (n/log n)1/2, and the upper bound on the lifetime of extended network in the ideal case are longer than those of the static network by a factor of (λn/log(λn))1/2. Therefore, sensor nodes, or the Sink moving randomly in the square, can improve the lifetime of ordinary clustering TH-IR UWB sensor network. © 2011 ISCAS.

关键词： Energy dissipation

来源：评论

学校读者我要写书评

暂无评论

Independent global constraints-aware web service composition optimization

引用

Information Technology Journal 2009年第2期8卷 181-187页

作者： Fang, Xianwen Jiang, Changjun Fan, Xiaoqin Department of Computer Science and Technology Tongji University Shanghai 201804 China Key Lab of Embedded System and Service Computing Ministry of Education Shanghai 201804 China Department of Information and Computer Science Anhui University of Science and Technology Huainan Anhui 232001 China

In semi-automatic service composition, developers should construct the process model according to concrete application requirement and then the instance services are bound automatically for every abstract task and make the composite service with optimal performance. This study presents independent global constrains-aware Web service composition method based on associate Petri net (APN) and genetic algorithm (GA). Firstly, an APN modeling methods which can describe multi-attribute multi-constraint relations and associate relation between component services is proposed. Secondly, combining with the properties of APN, GA is used to search a legal firing sequence with the biggest trust value in the APN model and the composite service corresponding to the legal firing sequence is the optimal solution. Finally, the experimental simulation is given out. Theoretical analysis and experimental results indicate that this method owns both lower computation cost and higher success ratio of service composition. © 2009 Asian Network for Scientific Information.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

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 based model checking for the collaborative-ness of multiple processes systems

Petri net based model checking for the collaborative-ness of...

引用

IEEE International Conference on Networking, Sensing and Control

作者： Guanjun Liu Changjun Jiang Department of Computer Science and Technology Tongji University Shanghai China MoE Key Lab of Embedded Systems & Service Computing Tongji University Shanghai China

ISBN: (纸本)9781467399760

In many distributed environments, multiple processes both interact/collaborate with each other and share some common resources. To model and analyze such systems, this paper defines a class of Petri nets called Parallel Processes Net (P 2 N). A P 2 N composes of a group of Single-process Nets (SNs). Each SN models a process and these SNs are connected via a set of places. Some of these places represent the common resources shared by these processes, and others represent the channels through which messages are transferred among these processes. We define collaborative-ness for P 2 Ns which requires that each process of a modeled system never enters into a deadlock or livelock state. The collaborative-ness can be represented by a CTL (Computational Tree Logic) formula and thus can be checked (for bounded P 2 Ns) by using some Petri net tools such as INA.

关键词： Petri nets system recovery Nickel Collaboration Computational modeling Analytical models Process control

来源：评论

学校读者我要写书评

暂无评论

OpenDrift: Online Evolving Fraud Detection for Open-Category and Concept-Drift Transactions

OpenDrift: Online Evolving Fraud Detection for Open-Category...

引用

IEEE International Conference on Web services (ICWS)

作者： Cheng Wang Songyao Chai Hangyu Zhu Department of Computer Science and Technology Tongji University Shanghai China Key Laboratory of Embedded System and Service Computing Ministry of Education China Shanghai Artificial Intelligence Laboratory Shanghai China

The rapid growth of electronic commerce brings convenience to modern life but comes with security risks by various cybercrimes in online payment services. Most existing security methods for fraud detection depend on the static learning paradigm, which trains a model over a static training dataset and deploys the trained model for inference with the frozen model parameters under the i.i.d. assumption. Unfortunately, this paradigm becomes incommensurate with the increasingly complicated and varying fraud patterns due to the untimely and delayed responses in the offline environment. Without sensing the evolution of fraud timely, it is challenging to train and deploy targeted countermeasures. The emerging means of fraud are not only reflected in the openness of their category, but also in the drift of their superimposed risk features. The interweaving of open-category and concept drift accelerates the process of existing methods becoming powerless. In this paper, we propose EvoFD, an online evolving fraud detection framework to enable continual learning to cope with undercurrent surges of evolving fraud. The core idea of EvoFD is to weaken the bias caused by the anchoring effect on the learned information. It learns in an online streaming fashion by using instructive representations as anchors. Specially, we maintain the progressively updatable class anchors and optimize the representation network to embed features and class anchors into a unified normalized space, where the training and predicting can be conducted simultaneously or independently. In the framework, we preserve the balanced replay memory for each class to accumulate knowledge and avoid forgetting. The advantages of our method are validated by extensive experiments over the real-world dataset from a prestigious bank.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Maximally permissive distributed control of large scale automated manufacturing systems modeled with Petri nets

Maximally permissive distributed control of large scale auto...

引用

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

作者： Hu, Hesuan Zhou, Mengchu Liu, Yang School of Electro-mechanical Engineering Xidian University Xi'an Shaanxi 710071 China School of Computer Engineering Nanyang Technological University Singapore 639798 Singapore 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 United States

ISBN: (纸本)9781479915156

Ensuring nonblockingness remains challenging for automated manufacturing systems (AMS) owing to their discrete event dynamics. Both scalability and maximal permissiveness are essential for the synthesis and implementation of their centralized supervisors. Inspired by the divide and conquer philosophy, this work proposes a partition methodology and distributed control technique for large scale AMS. They are represented as interconnected and overlapping subsystems sharing some common components in terms of buffers. For each subsystem, a local supervisor is designed based on its local behavior and neighboring information only. Generalizing the existing results, we develop a condition under which the control law via decomposition promises the maximal permissiveness. Buffer capacities are well designed for the sake of their decomposition into multiple overlapping subsystems. Theoretical results are developed to characterize the behavior compatibility among local controllers. An experimental study illustrates the effectiveness of the proposed method. © 2013 IEEE.

关键词： Supervisory personnel

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：