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

Will the fibers of the future be considered fibers?

National Science Review 2024年第10期11卷 15-17页

作者： Dewen Xu Ya Liu Hailiang Wang Wei Yan Changjun Jiang Meifang Zhu State Key Laboratory for Modification of Chemical Fibers and Polymer Materials College of Materials Science and Engineering Donghua University Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Department of Computer Science and Technology Tongji University

Fiber materials are key materials that have changed human history and promoted the progress of human civilization. In ancient times, humans used feathers and animal skins for clothing, and later they widely employed natural fibers such as cotton, hemp, silk and wool to make fabrics(Fig. 1a). Chinese ancestors had mastered the art of natural fiber weaving as early as the Neolithic *** thousand years ago, people were already familiar with and adept at techniques for spinning natural fibers [1].

关键词： future will considered fibers

来源：评论

学校读者我要写书评

暂无评论

Construction algorithms for index model based on Web page classification

引用

Journal of Computational Information systems 2014年第2期10卷 655-664页

作者： Zhang, Yangjie Yan, Chungang Wang, Pengwei Sun, Haichun Department of Computer Science and Technology Tongji University Shanghai 201804 China The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 201804 China

Web pages on the Internet are massive, diverse, heterogeneous and redundant. How to organize and manage them effectively is an urgent problem. In this paper, we propose a method to index web pages and build an index model based on web page classification and hyperlink analysis. First, an initialization algorithm is given to construct an index model for an initial set of web pages. Then, considering the dynamics of web pages on the Internet, we propose an incremental updating algorithm which can update an index model incrementally. Through theoretical analysis, the complexity of proposed algorithms shows linear relationships with the scale of web pages and their growth. The experimental results show that initialization algorithm can construct an index model for a fixed number of web pages relatively fast, while the incremental updating algorithm can satisfy the update speed of web pages on the Internet. Thus, the proposed algorithms are feasible and effective. The constructed index model can provide supports for diversified information service systems to enable them to make better use of web resources and provide more valuable services to users. Copyright © 2014 Binary Information Press.

关键词： Websites

来源：评论

学校读者我要写书评

暂无评论

Efficient Rate Control Algorithm for Hierarchical Video Coding

引用

Journal of Donghua University(English Edition) 2012年第3期29卷 222-226页

作者：陆千里岑锋许维胜朱芳来 The Key Laboratory of Embedded System and Service Computing Ministry of EducationTongji University Department of Control Science&Engineering Tongji University

For rate control (RC) of hierarchical structure coding, an independent rate-quantization (R-Q) model was proposed based on mean absolute differences (MADs) in different temporal levels (TLs). In the proposed R-Q model, a novel MAD model was developed according to the hierarchical structure. The experimental results demonstrate that the proposed algorithm provides better performance, in terms of average peak signal-to-noise ratio (PSNR) and quality smoothness, than the H.264 reference model, JM14.2, under various sequences.

关键词： rate-quantization (R-Q) model rate control(RC) video coding peak signal-to-noise ratio (PSNR) hierarchical structure

来源：评论

学校读者我要写书评

暂无评论

An optimized Apriori algorithm based on sparse matrix for intrusion detection

引用

Open Cybernetics and systemics Journal 2014年第1期8卷 8-11页

作者： Zeng, Xiaohui Lv, Jingxiang Li, Jingzhong Luo, Wenlang Dept. of Computer Science and Technology Jinggangshan University Ji’an China The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China

The original Apriori algorithm is widely used in the intrusion detection field, but it may consume incredible computing resources in the process of handling network packets. We propose our optimized-Apriori algorithm which can greatly improves the algorithm efficiency by means of reducing the data storage space and the number of frequent item sets. We take full advantage of the characteristics of sparse matrix to save storage space and shorten the running time. The experimental results show that our optimized-Apriori algorithm can make a larger progress in saving the storage space of network data to be processed, even shortening nearly half of the data mining time in the process of intrusion detection. © Zeng et al.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Neighborhood Extended Dynamic Graph Neural Network 2022

Neighborhood Extended Dynamic Graph Neural Network

引用

14th International Conference on Machine Learning and Computing, ICMLC 2022

作者： Yu, Da Wang, Junli Jiang, Changjun Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University China

ISBN: (纸本)9781450395700

Representation learning on dynamic graphs has drawn much attention due to its ability to learn hidden relationships as well as capture temporal patterns in graphs. It can be applied to represent a broad spectrum of graph-based data like social networks and further use the learned representations to solve the downstream tasks including link prediction and edge classification. Although some approaches have been proposed for dynamic graphs in recent years, most of them paid little attention to the evolution of the entire graph topology, leading to the lack of global information of what happened in nodes' neighborhoods during their update. We propose NEDGNN, a novel Neighborhood Extended Dynamic Graph Neural Network on dynamic graphs represented as sequences of time-stamped events. We introduce a temporal attention propagation module to generate messages for n-hop neighbors through a self-attention mechanism, which can help disseminate information among nodes' n-hop neighbors. Besides, a FIFO message box module is also applied to gain some time efficiency. Due to the introduction of these modules, NEDGNN outperforms many state-of-the-art baselines in several tasks. We also perform a detailed ablation study to test the effectiveness and time cost of each module. © 2022 ACM.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Transactional and QoS-aware selection algorithm for reliable Web service composition

引用

Journal of Computational Information systems 2012年第11期8卷 4633-4640页

作者： Shen, Hongjie Ding, Zhijun Wang, Pengwei Chen, Hongzhong Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 200092 China State Key Laboratory of Software Engineering Wuhan University Wuhan 430072 China

At present, most of the work has focused on Web services composition from the QoS side, little work being done on investigating how to implement service selection based on transactional and QoS requirements. In complicated network environment, composite services need transactional support for correct and reliable execution. Therefore, How to design a composite service to ensure not only correct and reliable execution but also optimal QoS is a challenging issue. This paper addresses the problem of selecting services by aggregating the transactional and QoS requirements. First, we presented global optimization selection algorithms based on two selection models of composite service with transactional requirements. Then, a heuristic selection algorithm is presented to select an approximately optimal transactional composite service within a reasonable time. Lastly, experiments are conducted to analyze the performance of our proposed algorithms. © 2012 Binary Information Press.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

Automatic Web services composition algorithm based on optimal matching

引用

Journal of Central South University 2011年第4期18卷 1169-1177页

作者：王俊丽丁志军侯玉兵 Engineering Research Center for Enterprise Digital Technology Ministry of EducationTongji University Key Laboratory of Embedded System and Service Computing Ministry of EducationTongji University Shanghai Branch China Information Technology Designing and Consulting Institute

A novel layered method was proposed to solve the problem of Web services *** this method,services composition problem was formally transformed into the optimal matching problem of every layer,then optimal matching problem was modeled based on the hypergraph theory,and solved by computing the minimal transversals of the ***,two optimization algorithms were designed to discard some useless states at the intermediary steps of the composition *** effectiveness of the composition method was tested by a set of experiments,in addition,an example regarding the travel services composition was also *** experimental results show that this method not only can automatically generate composition tree whose leaf nodes correspond to services composition solutions,but also has better performance on execution time and solution quality by adopting two proposed optimization algorithms.

关键词： Web services services composition optimal matching hypergraph theory

来源：评论

学校读者我要写书评

暂无评论

A Reduced Reachability Tree for a Class of Unbounded Petri Nets

引用

IEEE/CAA Journal of Automatica Sinica 2015年第4期2卷 345-352页

作者： Shouguang Wang Mengdi Gan Mengchu Zhou Dan You School of Information and Electronic Engineering Zhejiang Gongshang University State Key Laboratory for Manufacturing Systems Engineering Xi’an Jiaotong University Ministry of Education(MoE)Key Laboratory of Embedded System and Service Computing Tongji University MoE Key Laboratory of Embedded System and Service Computing Tongji University Department of Electrical and Computer Engineering New Jersey Institute of Technology

As a powerful analysis tool of Petri nets, reachability trees are fundamental for systematically investigating many characteristics such as boundedness, liveness and reversibility. This work proposes a method to generate a reachability tree, called ωRT for short, for a class of unbounded generalized nets called ω-independent nets based on new modified reachability trees (NMRTs). ωRT can effectively decrease the number of nodes by removing duplicate and ω-duplicate nodes in the tree, and verify properties such as reachability, liveness and deadlocks. Two examples are provided to show its superiority over NMRTs in terms of tree size. © 2014 Chinese Association of Automation.

关键词： Petri nets

来源：评论

学校读者我要写书评

暂无评论

A credible individual behavior profiling method for online payment fraud detection 21

A credible individual behavior profiling method for online p...

引用

4th International Conference on Data Storage and Data Engineering, DSDE 2021

作者： Cui, Jipeng Yan, Chungang Wang, Cheng Key Laboratory of the Ministry of Education for Embedded System and Service Computing Department of Computer Science and Engineering Tongji University China

ISBN: (纸本)9781450389303

Online payment fraud detection relies on a credible characterization of individual behaviors. Existing individual behavior profiling methods have three problems in credibility. Firstly, they solely regard users as individuals to model and fail to credibly characterize the whole behavior patterns of transactions. Secondly, they cannot make full use of the general information among similar individuals due to the heterogeneity of transaction attributes. Thirdly, they are not capable of utilizing the label information of transactions credibly. Faced with these challenges, we propose a credible method for individual behavior profiling that consists of two steps. The first step is the construction of the credible individual behavior profiling framework. To begin with, the concept of individuals is generalized and the credible transaction description is given. Afterwards, based on the co-occurrence information of transaction attributes, the credible behavior condition is defined to set a limit to individual behavior patterns. The second step is the implementation of the framework. For this purpose, the original fraud detection problem is transformed into a pseudo-recommender system problem with a co-occurrence mapping process. In order to guarantee the credible behavior constraint, a credible recommendation algorithm is designed to collaboratively restore both the ranking and rating information of the pseudo-rating matrices. Besides, an embedding based approach is adopted to parameterize the proposed model. Experiments on an online payment transaction dataset demonstrate the effectiveness of our proposed method. © 2021 ACM.

关键词： Crime

来源：评论

学校读者我要写书评

暂无评论

Feedback-based Coarse Time-Granularity POI Recommendation and Itinerary Planning

Feedback-based Coarse Time-Granularity POI Recommendation an...

引用

2021 China Automation Congress, CAC 2021

作者： Zong, Jie Ding, Zhijun The Key Laboratory of Embedded System and Service Computing Ministry of Education TONGJI University Shanghai China

ISBN: (纸本)9781665426473

For tourists, planning their own travel itinerary to a strange city is really challenging. Although there are many researches on Point of Interests (POIs) recommendation and itinerary planning, two problems occur in currently proposed recommendation algorithms. First, the time granularity of the algorithms is too fine. POI recommendation should be considered within a more coarse-grained time factor. For example, a visitor wouldn't like to visit a water park in winter, although he appears to love such places. However, seldom researches have taken this into consideration. Second, most of the algorithms build their models based on the tourists' trajectory, which means, they did not consider users' feedback. In fact, quite a number of tourists do not like their travel experience and give negative feedbacks after their visits. In this situation, we shouldn't recommend similar POIs to this user because he may not like such kind of scenic spots at all. To address these two problems, this paper proposes an algorithm called Feedback-based Coarse Time-Granularity POI Recommendation, which can extract information from comments and distinguish tourists' attitudes towards the POIs they have visited. At the same time, the coarse-grained time factor is considered while making recommendations. In addition, an itinerary planning algorithm is proposed. Experiments show that our algorithm can reach SOTA. © 2021 IEEE

关键词： Parks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：