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

18th International Conference on Web Information systems and Technologies, WEBIST 2022

作者： Neto, Ulisses Telemaco Oliveira, Toacy Pillat, Raquel Alencar, Paulo Cowan, Don Melo, Glaucia David R. Cheriton School of Computer Science University of Waterloo Waterloo Canada System Engineering and Computing Program Federal University of Rio de Janeiro Rio de Janeiro Brazil

ISBN: (纸本)9789897586132

An increasing number of platforms for Business Process Automation (BPA) have been developed in recent years, including open-source and proprietary solutions. However, there are still some unsolved problems and limitations related to the adoption of these solutions, which include: vendor lock-in, limited UI/UX, limited integration, outdated technology stack, and lack of support for non-process features. The framework presented in this paper addresses these problems and limitations by providing an open-source platform to facilitate the development of process-aware information systems (PAISs) based on code generation techniques. The platform is capable of generating a functional process-aware Web application from a business process model defined in BPMN. To the best of our knowledge, there is no other software tool that generates fully functional process-aware Web applications. The presented framework has been evaluated in the academy and industry and used to develop dozens of non-profit and commercial process-aware applications. Copyright © 2022 by SCITEPRESS – Science and Technology Publications, Lda. All rights reserved.

关键词： Open systems

来源：评论

学校读者我要写书评

暂无评论

PSMiner: A Pattern-Aware Accelerator for High-Performance Streaming Graph Pattern Mining 23

PSMiner: A Pattern-Aware Accelerator for High-Performance St...

引用

Proceedings of the 60th Annual ACM/IEEE Design Automation Conference

作者： Hao Qi Yu Zhang Ligang He Kang Luo Jun Huang Haoyu Lu Jin Zhao Hai Jin National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology China National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology China and Zhejiang-HUST Joint Research Center for Graph Processing Zhejiang Lab China Department of Computer Science University of Warwick United Kingdom

ISBN: (纸本)9798350323481

Streaming Graph Pattern Mining (GPM) has been widely used in many application fields. However, the existing streaming GPM solution suffers from many unnecessary explorations and isomorphism tests, while the existing static GPM ones require many repetitive operations to compute the full graph. In this paper, we propose a pattern-aware incremental execution approach and design the first streaming GPM accelerator called PSMiner, which integrates multiple optimizations to reduce redundant computation and improve computing efficiency. We have conducted extensive experiments. The results show that compared with the state-of-the-art software and hardware solutions, PSMiner achieves the average speedups of 770.9× and 60.4×, respectively.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Investigation of Traffic Radar Coverage Efficiency under Different Placement Strategies

Investigation of Traffic Radar Coverage Efficiency under Dif...

引用

International Conference on Internet of Things 2024, ICIoT 2024

作者： Yao, Shun Zhou, Jin Chieng, David Kwong, Chiew Foong Lee, Boon Giin Li, Jianqiang Chen, Yusen Next-Generation Internet of Everything Laboratory Department of Electrical and Electronic Engineering University of Nottingham Ningbo China Ningbo China School of Computer Science University of Nottingham Ningbo China Ningbo China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China Zhejiang Communication Investment Group Co. Ltd. Zhejiang China

This paper presents a comprehensive investigation of traffic radar coverage efficiency under different placement strategies in collaboration with Zhejiang Communications Investment Group Company Limited (CICO). The overall goal is to maximise coverage while minimising blind spots and the number of radars, given the constraints of the road. The NSGA-II multi-objective optimisation algorithm is found to be capable of generating a set of optimal solutions for the proposed radar placement configurations. When aiming for 100% coverage, the results indicate that a multi-antenna radar configuration requires the lowest radar density. Overall, this study provides valuable insights to transportation infrastructure owners in determining the best radar placement strategies for road traffic monitoring. © The Institution of engineering & Technology 2024.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

Testing Facility Location with Constrained Queue Time Problem: A Case Study in Florida, USA 24

Testing Facility Location with Constrained Queue Time Proble...

引用

Proceedings of the Winter Simulation Conference

作者： Almir Antonio Monteiro Junior Rafael Schneider Vanessa de Almeida Guimarães Pedro Henrique González System Engineering and Computer Science Program Federal University of Rio de Janeiro BRAZIL COPPEAD Graduate School of Business Federal University of Rio de Janeiro BRAZIL

ISBN: (纸本)9798331534202

This study addresses the Testing Facility Location with Constrained Queue Time Problem. This optimization problem focuses on determining the best places to deploy testing sites and their available testers for infectious diseases, while constraining the maximum time in the queue with a given probability. An integer programming model is introduced and applied to the three biggest counties, in terms of population, of Florida, United States. Moreover, the Monte Carlo method is used to evaluate the model's output, aiming to check if the queueing time constraint is being satisfied. Through the experiments, a testing facility deployment plan can be determined for each county and further validated by the simulation. The results show that the solutions returned by the model behaved successfully when submitted to the Monte Carlo method, not exceeding the time in the queue in more than the predefined probability.

关键词：

来源：评论

学校读者我要写书评

暂无评论

FPGA-Based Large-Scale Sorting with Optimized Bandwidth Utilization

引用

ACM Transactions on Reconfigurable Technology and systems 2025年第2期18卷 1-27页

作者： Mingqian Sun Guangwei Xie Fan Zhang Wei Guo Xitian Fan Li Chen Jiayu Du School of Cyber Science and Engineering Southeast University Nanjing China School of Computer Science Fudan University Shanghai China National Digital Switching System Engineering and Technological Research Center Zhengzhou China Hongzhen Information Technology Co. Ltd Shanghai China Purple Mountain Laboratories Nanjing China

Fast sorting of large-scale data is an essential task for data centers. In previous works, the existing computational model of sorting kernel still results in lower bandwidth utilization on the external memory bus. And the execution of merge operations in merge sort circuit on FPGAs depends on control commands from the host CPU. In this case, the merge sort circuit is not fully offloaded to hardware layer for acceleration, resulting in a performance loss. We design an on-chip merge sort controller to efficiently command the merge sort process. The proposed controller has the ability to schedule multiple on-chip computing kernels simultaneously in a more efficient mode, thus ensuring that the circuit has a better bandwidth utilization. Meanwhile, fundamental factors affecting the performance of merge sort are studied and analyzed, and we propose a high-performance merge sort architecture. Results show that using the proposed controller-centered architecture, an overall improvement of 20%–30% in sorting throughput can be achieved. Compared with the state-of-the-art previous merge sorting implementation on FPGA, our circuit can achieve 1.22/1.46\(\times\) speedup.

关键词： Merge sort FPGA system architecture on-chip controller

来源：评论

学校读者我要写书评

暂无评论

Novel orange-red glaze based on in-doped CaFe2O4 red chromophore: Synthesis, properties and characterizations

引用

Ceramics International 2025年

作者： Qi, Menghang Tian, Liangsheng Wang, Qiuying Xiao, Ruoxiu Hu, Nan Shi, Lin Siritanon, Theeranun Jiang, Peng Department of Inorganic Nonmetallic Materials School of Materials Science and Engineering University of Science and Technology Beijing Beijing100083 China School of Computer and Communication Engineering University of Science and Technology Beijing Beijing100083 China Institute of Surface-Earth System Science School of Earth System Science Tianjin University Tianjin300072 China School of Chemistry Institute of Science Suranaree University of Technology 111 University Avenue Muang Nakhon Ratchasima30000 Thailand

The CaFe2-xInxO4 (0 ≤ x ≤ 1) pigment with red shade was successfully synthesized through solid state reactions. The crystal structure, color development mechanism, morphology and its application in the glaze were studied. XPS analysis confirmed Fe resides in +3 oxidation state. Combined with UV–Vis–NIR analysis, it is determined that the formation of red shade of the pigment is due to the 6A1(S) → 4T2(D), 6A1(S) → 4A1, 4E(G) and 6A1(S) → 4T2(G) transitions of Fe3+ in the visible light region. The pigment was applied to the lead-free low temperature glaze to evaluate its potential in preparing new glaze color. The as-synthesized glaze showed orange-red shade. With increased In3+ doping concentration, the glaze demonstrates a stronger red tone. The glaze also shows high NIR solar reflectance. Inferred from SEM-EDS, the pigment particles are evenly scattered in the glaze. Therefore, CaFe2-xInxO4 (0 ≤ x ≤ 1) red pigment is a qualified candidate for red shade glaze preparation. © 2025 Elsevier Ltd and Techna Group S.r.l.

关键词： Crystal structure

来源：评论

学校读者我要写书评

暂无评论

Joint Location-Value Privacy Protection for Spatiotemporal Data Collection via Mobile Crowdsensing 17th

Joint Location-Value Privacy Protection for Spatiotemporal ...

引用

17th EAI International Conference on Collaborative Computing: Networking, Applications, and Worksharing, CollaborateCom 2021

作者： Liu, Tong Li, Dan Cao, Chenhong Gao, Honghao Li, Chengfan Feng, Zhenni School of Computer Engineering and Science Shanghai University Shanghai China Shanghai Engineering Research Center of Intelligent Computing System Shanghai China School of Computer Science and Technology Donghua University Shanghai China

ISBN: (纸本)9783030926373

Due to the development of the Internet of Things, mobile crowdsensing has emerged as a promising pervasive sensing paradigm for online spatiotemporal data collection, by leveraging ubiquitous mobile devices. However, privacy leakage of device users is a crucial problem, especially when an untrusted central platform in mobile crowdsensing is considered. Moreover, private information of users like trajectories contained in both location tags and sensed values of their sensing data may be unexpectedly revealed to the platform. In order to solve this problem, we proposed a joint location-value privacy protection approach, which consists of two privacy preserving mechanisms to perturb the locations and sensed values of users, respectively. The approach can be performed by each user locally and independently. The privacy of users can be well preserved, as we theoretically prove that the two mechanisms satisfy local differential privacy. In addition, extensive simulations are conducted, and the results show that accurate estimated values can be derived based on perturbed locations and sanitized sensed values, by adopting the truth discovery method. © 2021, ICST Institute for computer Sciences, Social Informatics and Telecommunications engineering.

关键词： Location

来源：评论

学校读者我要写书评

暂无评论

AccelES: Accelerating Top-K SpMV for Embedding Similarity via Low-bit Pruning

AccelES: Accelerating Top-K SpMV for Embedding Similarity vi...

引用

IEEE Symposium on High-Performance computer Architecture

作者： Jiaqi Zhai Xuanhua Shi Kaiyi Huang Chencheng Ye Weifang Hu Bingsheng He Hai Jin National Engineering Research Center for Big Data Technology and System/Services Computing Technology and System Lab/Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China School of Computing National University of Singapore Singapore

ISBN: (数字)9798331506476

ISBN: (纸本)9798331506483

In the realm of recommendation systems, achieving real-time performance in embedding similarity tasks is often hindered by the limitations of traditional Top-K sparse matrix-vector multiplication (SpMV) methods, which suffer from high latency due to inefficient memory access patterns. This paper identifies these critical gaps and introduces AccelES, a novel approach that significantly enhances the efficiency of Top-K SpMV. Our method employs a two-stage calculation scheme: the first stage utilizes a compact, low-bit dataset to quickly identify the most relevant entries, while the second stage performs full-precision calculations solely on this pruned subset, thereby minimizing computational overhead. Furthermore, AccelES incorporates innovative matrix representations, Ultra-CSR and Random-CSR, which optimize memory bandwidth utilization. Experimental results demonstrate that AccelES accelerates performance, surpassing state-of-the-art FPGA, GPU, and CPU solutions by factors of 3.4×, 2.5×, and 153.3×, respectively, under controlled conditions. These advancements not only enhance processing speed but also significantly improve real-time performance in recommendation systems, establishing AccelES as a pivotal contribution to the field of Top-K sparse matrix-vector multiplication.

关键词： Quantization (signal) High dimensional data Memory management Graphics processing units Bandwidth Real-time systems Sparse matrices Recommender systems Field programmable gate arrays Optimization

来源：评论

学校读者我要写书评

暂无评论

Scavenger: Better Space-Time Trade-Offs for Key-Value Separated LSM-trees 40

Scavenger: Better Space-Time Trade-Offs for Key-Value Separa...

引用

40th IEEE International Conference on Data engineering, ICDE 2024

作者： Zhang, Jianshun Wang, Fang Qiu, Sheng Wang, Yi Ou, Jiaxin Huang, Junxun Li, Baoquan Fang, Peng Feng, Dan School of Computer Science and Technology Huazhong University of Science and Technology Wuhan National Laboratory for Optoelectronics Key Laboratory of Information Storage System Engineering Research Center of Data Storage Systems and Technology Ministry of Education of China China Shenzhen Huazhong University of Science and Technology Research Institute China Bytefrance Inc.

ISBN: (纸本)9798350317152

Key-Value Stores (KVS) implemented with log-structured merge-tree (LSM-tree) have gained widespread ac-ceptance in storage systems. Nonetheless, a significant challenge arises in the form of high write amplification due to the compaction process. While KV-separated LSM-trees successfully tackle this issue, they also bring about substantial space am-plification problems, a concern that cannot be overlooked in cost-sensitive scenarios. Garbage collection (GC) holds significant promise for space amplification reduction, yet existing GC strategies often fall short in optimization performance, lacking thorough consideration of workload characteristics. Additionally, current KV-separated LSM-trees also ignore the adverse effect of the space amplification in the index LSM-tree. In this paper, we systematically analyze the sources of space amplification of KV-separated LSM-trees and introduce Scavenger, which achieves a better trade-off between performance and space amplification. Scavenger initially proposes an I/O-efficient garbage collection scheme to reduce I/O overhead and incorporates a space-aware compaction strategy based on compensated size to minimize the space amplification of index LSM-trees. Extensive experiments show that Scavenger significantly improves write performance and achieves lower space amplification than other KV-separated LSM-trees (including BlobDB, Titan, and TerarkDB). © 2024 IEEE.

关键词： Economic and social effects

来源：评论

学校读者我要写书评

暂无评论

Circular Decomposition and Cross-Modal Recombination for Multimodal Sentiment Analysis

Circular Decomposition and Cross-Modal Recombination for Mul...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Haijian Liang Weicheng Xie Xilin He Siyang Song Linlin Shen School of Computer Science & Software Engineering Computer Vision Institue Shenzhen University Guangdong Key Laboratory of Intelligent Information Processing Shenzhen University School of Computing and Mathematical Sciences University of Leicester National Engineering Laboratory for Big Data System Computing Technology Shenzhen University

Multimodal Sentiment Analysis is a burgeoning research area, leveraging various modalities to predict the sentiment score. Nevertheless, previous studies have disregarded the impact of noise interference on specific modal sentiments during video recording, thereby compromising the accuracy of sentiment prediction. In this paper, we propose the Guided Circular Decomposition and Cross-Modal Recombination (GCD-CMR) model, which aims to eliminate contaminated sentiment features in a fine-grained way. To achieve this, we utilize tailored global information specific to each modality to guide the circular decomposing process in the GCD module, to produce a set of sentiment prototypes. Subsequently, in the CMR module, we align cross-modal sentiment prototypes and remove the contaminated prototypes for recombination. Experimental results on two publicly available datasets demonstrate that our model surpasses state-of-the-art models, confirming the effectiveness of our proposed method. We release the code at: https://***/nianhua20/GCD-CMR.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：