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

Verification of web service protocols by logic of knowledge

Journal of Information and Computational Science 2011年第6期8卷 921-932页

作者： Chen, Qingliang Su, Kaile Cao, Ying Liu, Chanjuan School of Electronics Engineering and Computer Science Peking University Beijing 100871 China Department of Computer Science Jinan University Guangzhou 510632 China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 200000 China Institute for Integrated and Intelligent Systems Griffith University Brisbane Australia

Web services is a popular distributed systems technology and its effectiveness and efficiency rely badly on the underlying protocols. And web service protocols are designed in XML formats so the message structures within are quite different from the conventional ones. Therefore, the well-established formal verification techniques for conventional protocols, which have gained substantial achievements in practice, cannot be applied directly to them because of the inherently different syntax. In this paper, we propose a justification-oriented and automatic formal approach to verify, in the standard Dolev-Yao model, concerned security properties expressed as epistemic notions, i. e., logic of knowledge, for web service protocols, based on a fault-preserving mapping tool called SuD (SOAP under Dolev-Yao). Our approach is significant because, instead of finding flaws in finite number of protocol sessions, the specifications we are to verify can hold in arbitrary number of sessions. © 2011 Binary Information Press.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

Environment compatibility of services intraction and its reachable analysis

引用

Computer Modelling and New Technologies 2013年第4期17卷 162-167页

作者： Chen, B. Huang, X. Service and Embedded Computing Key Lab of Ministry of Education Tongji University Shanghai 201804 China College of Computer Guangxi University of Science and Technology Liuzhou 545006 China Libray of Guangxi University of Science and Technology Liuzhou 545006 China

The environment of services were not considered in most of analyses of interface interaction of composite services. In this paper, interface of interaction of services under specific environment are modelled as interface automata. The concept of environment compatibility of services is proposed. By giving the expression of criterion for compatibility checking and traversing the interaction model of composite services, reachable analysis for interaction environment compatibility checking can be carried. Some results of verifications are different from that of without environment and are accordance to actual situations.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Petri net-based real-time scheduling of time-constrained single-arm cluster tools with activity time variation

Petri net-based real-time scheduling of time-constrained sin...

引用

IEEE International Conference on Robotics and Automation (ICRA)

作者： Yan Qiao NaiQi Wu MengChu Zhou Department of Industrial Engineering School of Mechatronics Engineering Guangdong University of Technology Guangzhou China The Key Laboratory of Embedded System and Service Computing Ministry of Education University of Tongji Shanghai China Department of Electrical and Computer Engineering New Jersey Institute of Technology Newark NJ USA

It is challenging to schedule time-constrained cluster tools subject to activity time variation. With the help of their Petri net model, a real-time control policy is used to offset the activity time variation. Based on it, the schedulability conditions and scheduling algorithms are presented for single-arm cluster tools. The schedulability conditions can be analytically checked. Algorithms are developed based on analytical expressions such that it is also computationally efficient. The schedule obtained by the scheduling algorithms together with a real-time control policy forms the real-time schedule. It is optimal in terms of cycle time.

关键词： Robots Semiconductor device modeling Schedules Load modeling Real time systems Manganese Bismuth

来源：评论

学校读者我要写书评

暂无评论

Efficient Routing Protection Algorithm Based on Optimized Network Topology

引用

Computers, Materials & Continua 2022年第9期72卷 4525-4540页

作者： Haijun Geng Zikun Jin Jiangyuan Yao Han Zhang Zhiguo Hu Bo Yang Yingije Guo Wei Wang Qidong Zhang Guoao Duan School of Computer and Information Technology Shanxi UniversityShanxi030006China School of Automation and Software Engineering Shanxi UniversityShanxi030006China School of Computer Science and Technology Hainan UniversityHaikou570228China Department of Computer Science&Technology Tsinghua UniversityBeijing100084China Department of Urban&Regional Planning San JoséState University San JoséCA95192USA Key Laboratory of Embedded System and Service Computing(Tongji University) Ministry of EducationShanghai201804China Institute of Fundamental and Frontier Sciences University of Electronic Science and Technology of ChinaChengdu610054China Beijinng University of Technology Beijing-Dublin International CollegeBeijing University of TechnologyBeijing100124China

Network failures are unavoidable and occur *** the network fails,intra-domain routing protocols deploying on the Internet need to undergo a long convergence *** this period,a large number of messages are discarded,which results in a decline in the user experience and severely affects the quality of service of Internet service Providers(ISP).Therefore,improving the availability of intra-domain routing is a trending research question to be *** usually employs routing protection algorithms to improve intra-domain routing ***,existing routing protection schemes compute as many backup paths as possible to reduce message loss due to network failures,which increases the cost of the network and impedes the methods deployed in *** address the issues,this study proposes an efficient routing protection algorithm based on optimized network topology(ERPBONT).ERPBONT adopts the optimized network topology to calculate a backup path with the minimum path coincidence degree with the shortest path for all source ***,the backup path with the minimum path coincidence with the shortest path is described as an integer programming *** the simulated annealing algorithm ERPBONT is used to find the optimal ***,the algorithm is tested on the simulated topology and the real *** experimental results show that ERPBONT effectively reduces the path coincidence between the shortest path and the backup path,and significantly improves the routing availability.

关键词： Routing protection algorithm network availability network failure shortest path backup path

来源：评论

学校读者我要写书评

暂无评论

Response Policies to Process Module Failure in Single-Arm Cluster Tools Subject to Wafer Residency Time Constraints

Response Policies to Process Module Failure in Single-Arm Cl...

引用

作者： Qiao, Yan Pan, Chun-Rong Wu, Nai-Qi Zhou, Mengchu Department of Industrial Engineering School of Electro-Mechanical Engineering Guangdong University of Technology Guangzhou510006 China School of Mechatronics and Electrical Engineering Jiangxi University of Science and Technology Ganzhou341000 China Institute of Systems Engineering Macau University of Science and Technology Taipa China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai201804 China Department of Electrical and Computer Engineering New Jersey Institute of Technology NewarkNJ07102-1982 United States

In semiconductor manufacturing, wafer residency time constraints make the scheduling problem of cluster tools complicated. A process module (PM) in cluster tools is prone to failure. It is crucial to deal with any such failure in a proper and timely manner. If there are feasible periodic schedules in operating a cluster tool before and after a PM failure, it is desired to make it operate continuously when such a failure occurs. However, due to wafer residency time constraints, it is highly challenging to control a tool such that it can be correctly transferred from a feasible schedule before failure to another after it. To solve this problem, a Petri net model is developed to describe the dynamic behavior of a single-arm cluster tool and failure response policies are proposed. The proposed policies are formulated via simple control laws for their easy implementation. Examples are given to show them. © 2015 IEEE.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

LSR-IGRU: Stock Trend Prediction Based on Long Short-Term Relationships and Improved GRU

arXiv

引用

arXiv 2024年

作者： Zhu, Peng Li, Yuante Hu, Yifan Liu, Qinyuan Cheng, Dawei Liang, Yuqi Department of Computer Science and Technology Tongji University Shanghai China Department of Computer Science and Technology Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Artificial Intelligence Laboratory Shanghai China Seek Data Group Emoney Inc Shanghai China

Stock price prediction is a challenging problem in the field of finance and receives widespread attention. In recent years, with the rapid development of technologies such as deep learning and graph neural networks, more research methods have begun to focus on exploring the interrelationships between stocks. However, existing methods mostly focus on the short-term dynamic relationships of stocks and directly integrating relationship information with temporal information. They often overlook the complex nonlinear dynamic characteristics and potential higher-order interaction relationships among stocks in the stock market. Therefore, we propose a stock price trend prediction model named LSR-IGRU in this paper, which is based on long short-term stock relationships and an improved GRU input. Firstly, we construct a long short-term relationship matrix between stocks, where secondary industry information is employed for the first time to capture long-term relationships of stocks, and overnight price information is utilized to establish short-term relationships. Next, we improve the inputs of the GRU model at each step, enabling the model to more effectively integrate temporal information and long short-term relationship information, thereby significantly improving the accuracy of predicting stock trend changes. Finally, through extensive experiments on multiple datasets from stock markets in China and the United States, we validate the superiority of the proposed LSR-IGRU model over the current state-of-the-art baseline models. We also apply the proposed model to the algorithmic trading system of a financial company, achieving significantly higher cumulative portfolio returns compared to other baseline methods. Our sources are released at https://***/ZP1481616577/Baselines_LSR-IGRU. Copyright © 2024, The Authors. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A Transformation Algorithm for Optimal Admissible Generalized Mutual Exclusion Constraints on Petri Nets with Uncontrollable Transitions

A Transformation Algorithm for Optimal Admissible Generalize...

引用

2011 IEEE International Conference on Robotics and Automation(2011年IEEE世界机器人与自动化大会 ICRA 2011)

作者： ShouGuang Wang ChengYing Wang MengChu Zhou College of Information & Electronic Engineer ngineering ing Zhe Zhejiang Gongshang UniversityHangzh College of Information & Electronic Engineer ngineering ing Zhejiang Gongshang Univ UniversityHangz The MoE Key Laboratory of Embedded System and Service Computing Tongji UniversityShanghai 200092Ch

For a class of Petri nets whose uncontrollable influence subnets are forward synchronization and backward conflict free (FSBCF) nets, this work studies their structure and properties and proposes an algorithm to transform a given generalized mutual exclusion constraint (GMEC) into an optimal admissible one. Compared with the path-based constraint transformation approaches, the proposed method has much higher computational efficiency. An example is used to illustrate the application of the proposed method.

关键词： Automated manufacturing systems discrete event systems forbidden state problem mutual exclusion Petri nets supervisory control

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：