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

Lecture Notes in computer science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2025年 14784 LNCS卷 v页

作者： Bai, Guangdong Ishikawa, Fuyuki Aït-Ameur, Yamine Papadopoulos, George A. School of Electrical Engineering and Computer Science Faculty of Engineering Architecture and Information Technology University of Queensland BrisbaneQLD Australia Information Systems Architecture Science Research Division National Institute of Informatics Tokyo Chiyoda-ku Japan IRIT University of Toulouse Toulouse France Department of Computer Science University of Cyprus Nicosia Cyprus

来源：评论

学校读者我要写书评

暂无评论

Memory Efficient Two-Pass 3D FFT Algorithm for Intel~ Xeon Phi^(TM) Coprocessor

引用

Journal of computer science & technology 2014年第6期29卷 989-1002页

作者：刘益群李焱张云泉张先轶 Institute of Software Chinese Academy of Sciences University of Chinese Academy of Sciences Department of Computer Science and Technology Tsinghua University CCF ACM IEEE State Key Laboratory of Computer Architecture Institute of Computing TechnologyChinese Academy of Sciences

Equipped with 512-bit wide SIMD inst d large numbers of computing cores, the emerging x86-based Intel（R） Many Integrated Core （MIC） architecture ot only high floating-point performance, but also substantial off-chip memory bandwidth. The 3D FFT （three-di fast Fourier transform） is a widely-studied algorithm; however, the conventional algorithm needs to traverse the three times. In each pass, it computes multiple 1D FFTs along one of three dimensions, giving rise to plenty of rided memory accesses. In this paper, we propose a two-pass 3D FFT algorithm, which mainly aims to reduce of explicit data transfer between the memory and the on-chip cache. The main idea is to split one dimension into ensions, and then combine the transform along each sub-dimension with one of the rest dimensions respectively erence in amount of TLB misses resulting from decomposition along different dimensions is analyzed in detail. el parallelism is leveraged on the many-core system for a high degree of parallelism and better data reuse of loc On top of this, a number of optimization techniques, such as memory padding, loop transformation and vectoriz employed in our implementation to further enhance the performance. We evaluate the algorithm on the Intel（R） PhiTM coprocessor 7110P, and achieve a maximum performance of 136 Gflops with 240 threads in offload mode, which ts the vendor-specific Intel（R）MKL library by a factor of up to 2.22X.

关键词： 3D-FFT memory efficie many-core Many Integrated Core Intel（R） Xeon PhiTM

来源：评论

学校读者我要写书评

暂无评论

Exergames for elderly: Social exergames to persuade seniors to increase physical activity

Exergames for elderly: Social exergames to persuade seniors ...

引用

2011 5th International Conference on Pervasive Computing Technologies for Healthcare and Workshops, PervasiveHealth 2011

作者： Brox, Ellen Luque, Luis Fernandez Evertsen, Gunn Judith Hernandez, Juan Emilio González Northern Research Institute TromsØ Norway Department of Computer Architecture and Technology University of Seville Seville Spain

ISBN: (纸本)9781936968152

Games with remote controls and motion sensors that require the players to move, so-called exergames, have become very popular. Many of these games are also being played by the senior population. Participating in regular training sessions outside their homes can be challenging for elderly, and it is hard to motivate oneself to exercise regularly alone at home. Regular physical activity is important both for the physical and psychological health and it is an integral part of many rehabilitation therapies. In addition, many elderly suffer from loneliness, making social interaction within exergames very important. In this paper we provide a narrative review of how exergames can help to motivate elderly to exercise more, focusing in possible social interactions in online exergaming and persuasive technologies. Finally, we discuss how social exergaming can be used both to prevent loneliness and encourage physical activity. © 2011 ICST.

关键词： Remote control

来源：评论

学校读者我要写书评

暂无评论

Secure Beamforming for Continuous Aperture Array (CAPA) Systems

arXiv

引用

arXiv 2025年

作者： Sun, Mingjun Ouyang, Chongjun Wang, Zhaolin Wu, Shaochuan Liu, Yuanwei School of Electronics and Information Engineering Harbin Institute of Technology Harbin150001 China School of Electrical and Electronic Engineering UCD College of Engineering and Architecture University College DublinD04 V1W8 Ireland School of Electronic Engineering and Computer Science Queen Mary University of London LondonE1 4NS United Kingdom Department of Electrical and Electronic Engineering The University of Hong Kong Hong Kong

Continuous aperture array (CAPA) is considered a promising technology for 6G networks, offering the potential to fully exploit spatial DoFs and achieve the theoretical limits of channel capacity. This paper investigates the performance gain of a CAPA-based downlink secure transmission system, where multiple legitimate user terminals (LUTs) coexist with multiple eavesdroppers (Eves). The system’s secrecy performance is evaluated using a weighted secrecy sum-rate (WSSR) under a power constraint. We then propose two solutions for the secure current pattern design. The first solution is a block coordinate descent (BCD) optimization method based on fractional programming (FP), which introduces a continuous-function inversion theory corresponding to matrix inversion in the discrete domain. This approach derives a closed-form expression for the optimal source current pattern. Based on this, it can be found that the optimal current pattern is essentially a linear combination of the channel spatial responses, thus eliminating the need for complex integration operations during the algorithm’s optimization process. The second solution is a heuristic algorithm based on Zero-Forcing (ZF), which constructs a zero-leakage current pattern using the channel correlation matrix. It further employs a waterfilling approach to design an optimal power allocation scheme that maximizes the WSSR. In high SNR regions, this solution gradually approaches the first solution, ensuring zero leakage while offering lower computational complexity. Simulation results demonstrate that: 1) CAPA-based systems achieve better WSSR compared to discrete multiple-input multiple-output (MIMO) systems. 2) The proposed methods, whether optimization-based or heuristic, provide significant performance improvements over existing state-of-the-art Fourier-based discretization methods, while considerably reducing computational complexity. Copyright © 2025, The Authors. All rights reserved.

关键词： Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

Early Prediction of the Winner in StarCraft Matches

Early Prediction of the Winner in StarCraft Matches

引用

9th International Joint Conference on Computational Intelligence, IJCCI 2017

作者： Alvarez-Caballero, Antonio Merelo, J.J. Sanchez, Pablo Garcıa Fernandez-Ares, A. Department of Computer Architecture and Computer Technology University of Granada Spain Department of Computer Science University of Cadiz Spain

ISBN: (纸本)9789897582745

A fast and precise prediction of the outcome of a game is essential for the design of bots that play the game;it can be used either offline as a fast way to design bot strategies or online for conserving resources and conceding defeat or speed up victory, as well as evaluating the consequences of actions. The objective of this paper is predicting the winner of a StarCraft match as soon as possible. This study is done with supervised learning, because a lot of suitable data is available. The main problem of this approach is the big amount of generated data, so it has to be selected and organised properly and be treated with proper tools. A set of six learning algorithms is used, from simpler ones to more complex algorithms. Spark and MLlib are used due to their capabilities to deal with big amounts of data. With the learned models, time of matches are restricted, trying to get a time bound for predicting results. With this approach we get that it is not necessary to play a whole match to predict its winner with high accuracy: with 10 minutes we can predict the outcome with 90% of accuracy. © 2017 by SCITEPRESS–science and technology Publications, Lda. All rights reserved.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Fake News Classification: Past, Current, and Future

引用

computers, Materials & Continua 2023年第11期77卷 2225-2249页

作者： Muhammad Usman Ghani Khan Abid Mehmood Mourad Elhadef Shehzad Ashraf Chaudhry Department of Computer Science University of Engineering and TechnologyLahore54890Pakistan Department of Computer Science&Information Technology Abu Dhabi UniversityAbu Dhabi59911United Arab Emirates Department of Software Engineering Faculty of Engineering and ArchitectureNisantasi UniversityIstanbulTurkey

The proliferation of deluding data such as fake news and phony audits on news web journals,online publications,and internet business apps has been aided by the availability of the web,cell phones,and social *** can quickly fabricate comments and news on social *** most difficult challenge is determining which news is real or ***,tracking down programmed techniques to recognize fake news online is *** an emphasis on false news,this study presents the evolution of artificial intelligence techniques for detecting spurious social media *** study shows past,current,and possible methods that can be used in the future for fake news *** different publicly available datasets containing political news are utilized for performing *** supervised learning algorithms are used,and their results show that conventional Machine Learning(ML)algorithms that were used in the past perform better on shorter text *** contrast,the currently used Recurrent Neural Network(RNN)and transformer-based algorithms perform better on longer ***,a brief comparison of all these techniques is provided,and it concluded that transformers have the potential to revolutionize Natural Language Processing(NLP)methods in the near future.

关键词： Supervised learning algorithms fake news classification online disinformation transformers recurrent neural network(RNN)disinformation transformers recurrent neural network(RNN)

来源：评论

学校读者我要写书评

暂无评论

A Secure and Efficient Information Authentication Scheme for E-Healthcare System

引用

computers, Materials & Continua 2023年第9期76卷 3877-3896页

作者： Naveed Khan Jianbiao Zhang Ghulam Ali Mallah Shehzad Ashraf Chaudhry Faculty of Information Technology Beijing University of TechnologyBeijing100124China Department of Computer Science Shah Abdul Latif UniversityKhairpur66111Pakistan Department of Computer Engineering Faculty of Engineering ArchitectureNisantasi UniversityIstanbul34398Turkey

The mobile cellular network provides internet connectivity for heterogeneous Internet of Things(IoT)*** cellular network consists of several towers installed at appropriate locations within a smart *** cellular towers can be utilized for various tasks,such as e-healthcare systems,smart city surveillance,traffic monitoring,infrastructure surveillance,or sidewalk *** is a primary concern in data broadcasting,particularly authentication,because the strength of a cellular network’s signal is much higher frequency than the associated one,and their frequencies can sometimes be aligned,posing a significant *** a result,that requires attention,and without information authentication,such a barrier cannot be ***,we design a secure and efficient information authentication scheme for IoT-enabled devices tomitigate the flaws in the e-healthcare *** proposed protocol security shall check formally using the Real-or-Random(ROR)model,simulated using ProVerif2.03,and informally using pragmatic *** comparison,the performance phenomenon shall tackle by the already result available in the MIRACL cryptographic lab.

关键词： IoT-enable device e-healthcare authentication edge computing

来源：评论

学校读者我要写书评

暂无评论

Dynamic I/O-Aware Scheduling for Batch-Mode Applications on Chip Multiprocessor Systems of Cluster Platforms

引用

Journal of computer science & technology 2014年第1期29卷 21-37页

作者：吕方崔慧敏王蕾刘磊武成岗冯晓兵游本中 State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences University of Chinese Academy of Sciences CCF ACM IEEE Department of Computer Science and Engineering University of Minnesota at Twin Cities Institute of Information Science Academia Sinica

Efficiency of batch processing is becoming increasingly important for many modern commercial service centers, e.g., clusters and cloud computing datacenters. However, periodical resource contentions have become the major performance obstacles for concurrently running applications on mainstream CMP servers. I/O contention is such a kind of obstacle, which may impede both the co-running performance of batch jobs and the system throughput seriously. In this paper, a dynamic I/O-aware scheduling algorithm is proposed to lower the impacts of I/O contention and to enhance the co-running performance in batch processing. We set up our environment on an 8-socket, 64-core server in Dawning Linux Cluster. Fifteen workloads ranging from 8 jobs to 256 jobs are evaluated. Our experimental results show significant improvements on the throughputs of the workloads, which range from 7% to 431%. Meanwhile, noticeable improvements on the slowdown of workloads and the average runtime for each job can be achieved. These results show that a well-tuned dynamic I/O-aware scheduler is beneficial for batch-mode services. It can also enhance the resource utilization via throughput improvement on modern service platforms.

关键词： chip multiprocessor batch processing co-running I/0 contention scheduling

来源：评论

学校读者我要写书评

暂无评论

Early prediction of thewinner in starcraft matches 9

Early prediction of thewinner in starcraft matches

引用

9th International Joint Conference on Computational Intelligence, IJCCI 2017

作者： Álvarez-Caballero, Antonio Merelo, J.J. Sánchez, Pablo García Fernández-Ares, A. Department of Computer Architecture and Computer Technology University of Granada Spain Department of Computer Science University of Cádiz Spain

ISBN: (纸本)9789897582745

A fast and precise prediction of the outcome of a game is essential for the design of bots that play the game;it can be used either offline as a fast way to design bot strategies or online for conserving resources and conceding defeat or speed up victory, as well as evaluating the consequences of actions. The objective of this paper is predicting the winner of a StarCraft match as soon as possible. This study is done with supervised learning, because a lot of suitable data is available. The main problem of this approach is the big amount of generated data, so it has to be selected and organised properly and be treated with proper tools. A set of six learning algorithms is used, from simpler ones to more complex algorithms. Spark and MLlib are used due to their capabilities to deal with big amounts of data. With the learned models, time of matches are restricted, trying to get a time bound for predicting results. With this approach we get that it is not necessary to play a whole match to predict its winner with high accuracy: with 10 minutes we can predict the outcome with 90% of accuracy. Copyright © 2017 by SCITEPRESS - science and technology Publications, Lda. All rights reserved.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

An Efficient Network-on-Chip Router for Dataflow architecture

引用

Journal of computer science & technology 2017年第1期32卷 11-25页

作者： Xiao-Wei Shen Xiao-Chun Ye Xu Tan Da Wang Lunkai Zhang Wen-Ming Li Zhi-Min Zhang Dong-Rui Fan Ning-Hui Sun State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China School of Computer and Control Engineering University of Chinese Academy of Sciences Beijing 100049 China Department of Computer Science The University of Chicago IL 60637 U.S.A.

Dataflow architecture has shown its advantages in many high-performance computing cases. In dataflow computing, a large amount of data are frequently transferred among processing elements through the network-on-chip （NoC）. Thus the router design has a significant impact on the performance of dataflow architecture. Common routers are designed for control-flow multi-core architecture and we find they are not suitable for dataflow architecture. In this work, we analyze and extract the features of data transfers in NoCs of dataflow architecture： multiple destinations, high injection rate, and performance sensitive to delay. Based on the three features, we propose a novel and efficient NoC router for dataflow architecture. The proposed router supports multi-destination; thus it can transfer data with multiple destinations in a single transfer. Moreover, the router adopts output buffer to maximize throughput and adopts non-flit packets to minimize transfer delay. Experimental results show that the proposed router can improve the performance of dataflow architecture by 3.6x over a state-of-the-art router.

关键词： multi-destination router network-on-chip dataflow architecture high-performance computing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：