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

Research Square 2021年

作者： Hao, Qingbo Zhu, Ke Wang, Chundong Wang, Peng Mo, Xiuliang Liu, Zhen Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology Tianjin University of Technology Tianjin China School of Computer Science and Engineering Tianjin University of Technology Tianjin China Engineering Research Center of Learning-Based Intelligent System Ministry of Education Tianjin China Graduate School of Engineering Nagasaki Institute of Applied Science Nagasaki Japan

The rapid development of Mobile Internet has spawned various mobile applications (apps). A large number of apps make it difficult for users to choose apps conveniently, causing the app overload problem. As the most effective tool to solve the problem of app overload, the app recommendation has attracted extensive attention of researchers. Traditional recommendation methods usually use historical data of apps used by users to explore their preferences, and then make an app recommendation list for users. Although the traditional app recommendation methods have achieved certain results, the performance of app recommendation still needs to be improved due to the following two reasons. On the one hand, it is difficult to construct traditional app recommendation models when facing with the sparse user-app interaction data. On the other hand, contextual information has a large impact on users’ app usage preferences, which is often overlooked by traditional app recommendation methods. To overcome the aforementioned problems, we proposed a Context-aware Feature Deep Interaction Learning (CFDIL) method to explore user preferences, and then perform app recommendation by learning potential user-app relationships in different contexts. The novelty of CFDIL is as follows: (1) CFDIL incorporates contextual features into users’ preferences modeling by constructing a novel user and app feature portrait. (2) The problem of data sparsity is effectively solved by the use of dense user and app feature portraits, as well as the tensor operations for label sets. (3) CFDIL trains a new deep network structure, which can make accurate app recommendation using the contextual information and attribute information of users and apps. We applied CFDIL on three real datasets and conducted extensive experiments, which showed that CFDIL outperformed the benchmark method. © 2021, CC BY.

关键词： User profile

来源：评论

学校读者我要写书评

暂无评论

Modeling Multilevel Business Process Monitoring via BPMN Extension

引用

Concurrency and Computation: Practice and Experience 2025年第12-14期37卷

作者： Kang, Guosheng Wang, Zhen Cheng, Hangyu Liu, Jianxun Wen, Yiping Peng, Jun School of Computer Science and Engineering Hunan University of Science and Technology Xiangtan China Hunan Provincial Key Lab. for Services Computing and Novel Software Technology Hunan University of Science and Technology Xiangtan China School of Computer Science and Technology Xi'an Jiaotong University Xi'an China School of Computer Science Fudan University Shanghai China

Business process monitoring involves real-time supervision of a series of activities carried out by an organization to achieve specific objectives. Process event monitoring points (PEMP) are used to pinpoint specific locations within a process model where expected events are anticipated to occur. However, in general business process modeling languages, such as business process model and notation (BPMN), there is a lack of explicit modeling for PEMPs. This article proposes a method for modeling pairwise event monitoring points in business process models to track the execution status of specific activities or process segments via BPMN extension. Specifically, process monitoring points are designed by expanding the modeling element of sequence flow. Moreover, the business process model is decomposed using the refined process structure tree (RPST) to verify the soundness of the designed pairwise monitoring points. The proposed method allows flexible monitoring at the process segment level. And the process monitoring data could be used for a clear understanding of business progress, especially useful in heterogeneous business process model to support decision-making. Through case study from real-world business processes, the effectiveness and usefulness of the proposed process monitoring modeling method is validated. © 2025 John Wiley & Sons Ltd.

关键词： Electronic trading

来源：评论

学校读者我要写书评

暂无评论

Structure Reinforcing and Attribute Weakening Network based API Recommendation Approach for Mashup Creation

Structure Reinforcing and Attribute Weakening Network based ...

引用

IEEE International Conference on Web Services (ICWS)

作者： Yong Xiao Jianxun Liu Guosheng Kang Rong Hu Buqing Cao Yingcheng Cao Min Shi Hunan Key Lab. for Services Computing and Novel Software Technology HNUST Xiangtan China School of Computer Science and Engineering Hunan University of Science & Technology Xiangtan China

ISBN: (数字)9781728187860

ISBN: (纸本)9781728187877

With the explosive growth of Web APIs on the Internet, it is a challenge to recommend desirable Web APIs from multiple ecosystems to develop a Mashup. Most existing API service recommendation methods focus on functional semantic similarity, but underutilize the rich network relations which inherently reflect either positive or negative relevance between services. Moreover, in the recommendation process, they usually pay too much attention to the interactions between Mashups and APIs, but ignore the cooperation between APIs. In this paper, we propose a novel method named SRAWN (Structure Reinforcing and Attribute Weakening Network) based API recommendation approach for Mashup creation. Specifically, we first design a feature extractor layer to capture structure relationship and attribute information from an API relation network graph by introducing a GAT2VEC framework, and obtain representation vectors corresponding to each API. Then, a matching evolving layer is proposed to capture the matching evolving process between APIs. At this layer, APIs are chosen incrementally to composite a Mashup, and the embedding vectors of the Mashup's existing composition features are updated adaptively based on diverse candidate APIs, by introducing a Deep Interest Network. Comprehensive experiments on a real-world dataset show that SRAWN outperforms the other state-of-the-art solutions.

关键词： Mashups Semantics Ecosystems Feature extraction Heterogeneous networks Explosives Data mining

来源：评论

学校读者我要写书评

暂无评论

Diversified QoS-Centric Service Recommendation for Uncertain QoS Preferences

Diversified QoS-Centric Service Recommendation for Uncertain...

引用

IEEE International Conference on Services computing (SCC)

作者： Guosheng Kang Jianxun Liu Buqing Cao Yong Xiao Hunan Provincial Key Lab. for Services Computing and Novel Software Technology HNUST Xiangtan China School of Computer Science and Engineering Hunan University of Science and Technology Xiangtan China

ISBN: (数字)9781728187891

ISBN: (纸本)9781728187907

With the wide adoption of SOA (Service Oriented Architecture), a massive amount of Web services emerge on the Internet. Finding the desired services becomes a challenge. Thus, service recommendation has become of paramount research to relieve users' difficulty in service selection. Existing Web service recommendation approaches employ utility functions or skyline techniques with the assumption that users can provide numerical QoS (Quality of Service) preferences. However, in practice, it is hard for users, even for professional users, to provide specific QoS preferences in their service requests. Thus, how to effectively recommend services to users when their QoS preferences are uncertain is a challenging issue. To solve the problem, this paper focuses on the characteristics of user requirements, and proposes a diversified QoS-centric service recommendation approach for uncertain QoS preferences, by which a list of services with desired QoS fulfillment and diversity are produced. Extensive experiments are conducted on a real-world dataset to demonstrate the effectiveness and efficiency of our approach.

关键词： Uncertainty Conferences Service computing Quality of service Euclidean distance Service-oriented architecture

来源：评论

学校读者我要写书评

暂无评论

Fine-grained image analysis with deep learning: A survey

arXiv

引用

arXiv 2021年

作者： Wei, Xiu-Shen Song, Yi-Zhe Aodha, Oisin Mac Wu, Jianxin Peng, Yuxin Tang, Jinhui Yang, Jian Belongie, Serge PCA Lab Key Lab of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education Jiangsu Key Lab of Image Video Understanding for Social Security School of Computer Science and Engineering Nanjing University of Science and Technology China University of Surrey United Kingdom The University of Edinburgh United Kingdom The State Key Laboratory for Novel Software Technology Nanjing University China Peking University China Nanjing University of Science and Technology China The University of Copenhagen The Pioneer Centre for AI Denmark

Fine-grained image analysis (FGIA) is a longstanding and fundamental problem in computer vision and pattern recognition, and underpins a diverse set of real-world applications. The task of FGIA targets analyzing visual objects from subordinate categories, e.g., species of birds or models of cars. The small inter-class and large intra-class variation inherent to fine-grained image analysis makes it a challenging problem. Capitalizing on advances in deep learning, in recent years we have witnessed remarkable progress in deep learning powered FGIA. In this paper we present a systematic survey of these advances, where we attempt to re-define and broaden the field of FGIA by consolidating two fundamental fine-grained research areas – fine-grained image recognition and fine-grained image retrieval. In addition, we also review other key issues of FGIA, such as publicly available benchmark datasets and related domain-specific applications. We conclude by highlighting several research directions and open problems which need further exploration from the community. © 2021, CC BY.

关键词： Image recognition

来源：评论

学校读者我要写书评

暂无评论

Generalizable Cross-modality Medical Image Segmentation via Style Augmentation and Dual Normalization

arXiv

引用

arXiv 2021年

作者： Zhou, Ziqi Qi, Lei Yang, Xin Ni, Dong Shi, Yinghuan The State Key Laboratory for Novel Software Technology National Institute of Healthcare Data Science Nanjing University China The School of Computer Science and Engineering Southeast University China National-Regional Key Technology Engineering Laboratory for Medical Ultrasound School of Biomedical Engineering Health Science Center The Medical Ultrasound Image Computing Lab The Marshall Laboratory of Biomedical Engineering Shenzhen University China

For medical image segmentation, imagine if a model was only trained using MR images in source domain, how about its performance to directly segment CT images in target domain? This setting, namely generalizable cross-modality segmentation, owning its clinical potential, is much more challenging than other related settings, e.g., domain adaptation. To achieve this goal, we in this paper propose a novel dual-normalization model by leveraging the augmented source-similar and source-dissimilar images during our generalizable segmentation. To be specific, given a single source domain, aiming to simulate the possible appearance change in unseen target domains, we first utilize a nonlinear transformation to augment source-similar and source-dissimilar images. Then, to sufficiently exploit these two types of augmentations, our proposed dual-normalization based model employs a shared backbone yet independent batch normalization layer for separate normalization. Afterward, we put forward a style-based selection scheme to automatically choose the appropriate path in the test stage. Extensive experiments on three publicly available datasets, i.e., BraTS, Cross-Modality Cardiac, and Abdominal Multi-Organ datasets, have demonstrated that our method outperforms other state-of-the-art domain generalization methods. Code is available at https://***/zzzqzhou/Dual-Normalization. Copyright © 2021, The Authors. All rights reserved.

关键词： Magnetic resonance imaging

来源：评论

学校读者我要写书评

暂无评论

A proof-of-majority consensus protocol for blockchain-enabled collaboration infrastructure of 5G network slice brokers 2

A proof-of-majority consensus protocol for blockchain-enable...

引用

2nd ACM International Symposium on Blockchain and Secure Critical Infrastructure, BSCI 2020, Co-located with AsiaCCS 2020

作者： Lin, Wenmin Xu, Xiaolong Qi, Lianyong Zhang, Xuyun Dou, Wanchun Khosravi, Mohammad R. Institute of VR and Intelligent Systems Alibaba Business School Hangzhou Normal University Hangzhou China Nanjing University of Information and Technology Nanjing China Qufu Normal University Rizhao China Department of Computing Macquarie University Sydney Australia State Key Laboratory of Novel Software Department of Computer Science and Technology Nanjing University Nanjing China Department of Electrical and Electronic Engineering Shiraz University of Technology Shiraz Department of Computer Engineering Persian Gulf University Bushehr Iran

ISBN: (纸本)9781450376105

With network slicing technology, 5G changes the classical mobile network business model from a network-operator-oriented business to a more open system with multiple stakeholders. In this context, a network slice broker plays the role of agency between network resource providers and vertical service providers, to lease and provide on-demand network slice services. In practice, a single network slice broker normally owns limited types of network slices. And a collaboration infrastructure could be built up to enable network slice sharing among multiple network slice brokers, so as to improve user experience, and enhance the resource utilization rate. However, a major challenge with such an infrastructure is how to support fair and secure slice trading process among multiple un-trusted network slice providers. Blockchain technology, on the other side, brings in high opportunities to implement a fair and secure trading system without a trusted third-party. In view of this observation, this paper proposes a design of blockchain-enabled collaboration infrastructure for network slice brokers, where a group of registered brokers can trade their network slices in a fair and secure manner. To enhance the accountability of slice trading records, transactions are verified and sorted by each broker node, which are further packed into blocks and appended to a shared ledger maintained by each member in the collaboration network. More specifically, we design a Proof-of-Majority (PoM) consensus protocol to sort slice trading transactions before packing transaction blocks of the shared ledger. Furthermore, an optimization for the basic PoM protocol is discussed, with dependency resolving strategy to improve system performance. Experiments are conducted to verify the feasibility of our proposal. © 2020 ACM.

关键词： 5G mobile communication systems

来源：评论

学校读者我要写书评

暂无评论

ON THE OPPORTUNITIES OF GREEN computing: A SURVEY

arXiv

引用

arXiv 2023年

作者： Zhou, You Lin, Xiujing Zhang, Xiang Wang, Maolin Jiang, Gangwei Lu, Huakang Wu, Yupeng Zhang, Kai Yang, Zhe Wang, Kehang Sui, Yongduo Jia, Fengwei Tang, Zuoli Zhao, Yao Zhang, Hongxuan Yang, Tiannuo Chen, Weibo Mao, Yunong Li, Yi Bao, De Li, Yu Liao, Hongrui Liu, Ting Liu, Jingwen Guo, Jinchi Zhao, Xiangyu Wei, Ying Qian, Hong Liu, Qi Wang, Xiang Chan, Wai Kin Li, Chenliang Li, Yusen Yang, Shiyu Yan, Jining Mou, Chao Han, Shuai Jin, Wuxia Zhang, Guannan Zeng, Xiaodong Tsinghua University China Shanghai Jiaotong University China University of Science and Technology of China China Key Laboratory of Aerospace Information Security and Trusted Computing Ministry of Education School of Cyber Science and Engineering Wuhan University China Huazhong University of Science and Technology China Shanghai Institute of AI for Education School of Computer Science and Technology East China Normal University China Xi’an Jiaotong University China College of Computer Science Nankai University China School of Computer Science China University of Geosciences China School of Information Science and Technology Beijing Forestry University China Engineering Research Center for Forestry-Oriented Intelligent Information Processing National Forestry and Grassland Administration China Guangzhou University China Nanyang Technological University Singapore City University of Hong Kong Hong Kong Wuhan University China State Key Laboratory for Novel Software Technology Nanjing University China Ant Group China

Artificial Intelligence (AI) has achieved significant advancements in technology and research with the development over several decades, and is widely used in many areas including computing vision, natural language processing, time-series analysis, speech synthesis, etc. During the age of deep learning, especially with the arise of Large Language Models, a large majority of researchers’ attention is paid on pursuing new state-of-the-art (SOTA) results, resulting in ever increasing of model size and computational complexity. The needs for high computing power brings higher carbon emission and undermines research fairness by preventing small or medium-sized research institutions and companies with limited funding in participating in research. To tackle the challenges of computing resources and environmental impact of AI, Green computing has become a hot research topic. In this survey, we give a systematic overview of the technologies used in Green computing. We propose the framework of Green computing and devide it into four key components: (1) Measures of Greenness, (2) Energy-Efficient AI, (3) Energy-Efficient computing Systems and (4) AI Use Cases for Sustainability. For each components, we discuss the research progress made and the commonly used techniques to optimize the AI efficiency. We conclude that this new research direction has the potential to address the conflicts between resource constraints and AI development. We encourage more researchers to put attention on this direction and make AI more environmental friendly. Copyright © 2023, The Authors. All rights reserved.

关键词： Carbon footprint

来源：评论

学校读者我要写书评

暂无评论

Deep time-stream framework for click-through rate prediction by tracking interest evolution

arXiv

引用

arXiv 2020年

作者： Shi, Shu-Ting Zheng, Wenhao Tang, Jun Chen, Qing-Guo Hu, Yao Zhu, Jianke Li, Ming National Key Laboratory for Novel Software Technology Nanjing University Nanjing210023 China YouKu Cognitive and Intelligent Lab Alibaba Group Hangzhou China Zhejiang University Hangzhou China

Click-through rate (CTR) prediction is an essential task in industrial applications such as video recommendation. Recently, deep learning models have been proposed to learn the representation of users' overall interests, while ignoring the fact that interests may dynamically change over time. We argue that it is necessary to consider the continuous-time information in CTR models to track user interest trend from rich historical behaviors. In this paper, we propose a novel Deep Time-Stream framework (DTS) which introduces the time information by an ordinary differential equations (ODE). DTS continuously models the evolution of interests using a neural network, and thus is able to tackle the challenge of dynamically representing users' interests based on their historical behaviors. In addition, our framework can be seamlessly applied to any existing deep CTR models by leveraging the additional Time-Stream Module, while no changes are made to the original CTR models. Experiments on public dataset as well as real industry dataset with billions of samples demonstrate the effectiveness of proposed approaches, which achieve superior performance compared with existing methods. Copyright © 2020, The Authors. All rights reserved.

关键词： Continuous time systems

来源：评论

学校读者我要写书评

暂无评论

Sum of squares: a new metric for NFV service chain placement in edge computing environments and efficient heuristic algorithms

引用

CCF Transactions on Networking 2020年第2期3卷 140-153页

作者： Chen, Zhiqi Zhang, Sheng Qian, Zhuzhong Wang, Can Xiao, Mingjun Wu, Jie Lu, Sanglu State Key Lab. for Novel Software Technology Nanjing University Nanjing P.R. China School of Computer Science and Technology/Suzhou Institute for Advanced Study University of Science and Technology of China Hefei China Center for Networked Computing Temple University Philadelphia USA

Both network function virtualization (NFV) and edge computing (EC), especially the latter, are attracting more and more attention in recent years. A growing number of network service providers are migrating their services from the cloud to the edge for better QoS services, while the recent researches on NFV also concentrate on deploying NFV services in edge computing networks. However, NFV deployment in edge networks is a troublesome challenge and is fairly alien from conventional NFV deployment problems in data centres. Edge network differs from the data center network in the following two aspects: firstly, edge nodes are constrained in computing capacity, and secondly, the network connections between edge nodes are unstable and dynamic, which may show large variance over time. This means edge computing should be designed for high-efficient use of physical edge nodes’ resources. To address the challenges above, we investigate a new NFV Service Chain Placement problem in edge computing environments (NSCP-EC) in this paper. We first prove that the NSCP-EC problem is NP-complete. Then we propose a new metric which can better measure the capacity utilization rate of physical resources, and analyze its advantages with details. Based on the new metric, we propose two heuristic but efficient algorithms called MINI and MINI-tree. To confirm the performance of the two algorithms, we conduct simulations. The result demonstrates that MINI gains an advantage over genetic algorithm (GA) and MINI-tree orevails over MINI in tree topology conditions in the aspects of physical resource utilization, acceptance rate and running time. Both theoretical analysis and simulation results confirm the feasibility of the algorithms.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：