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

2025 International Conference on Electronics, Information, and Communication, ICEIC 2025

作者： Reyes, Ma Julianna Re-An D.G. Dicreto, Eirnan Santos, Emmanuel Gabriel D. Limbag, Daniella Franxene P. Sampedro, Gabriel Avelino College of Computer Studies De La Salle University Manila Philippines Networks and Distributed Systems Laboratory University of the Philippines Diliman Quezon City Philippines

ISBN: (纸本)9798331510756

Chessis a complex game characterized by diverse strategies and time constraints, making quick decision-making essential for success. While Elo ratings are widely recognized as indicators of player skill, the predictability of match outcomes based solely on these ratings remains a challenge. The study aims to develop a model for accurately predicting the outcome of chess games using logistic regression, focusing on Elo rating differences and the number of moves in each game. The dataset includes over 20,000 games from ***, and only games with decisive outcomes (excluding draws) were used. The research categorizes Elo ratings into various classes and evaluates model performance across these ranges. The model achieves a predictive accuracy of 68.18%, demonstrating the significance of Elo ratings and move counts in determining game results. Performance metrics, including precision, recall, and Fl-score, further validate the model's effectiveness. The study concludes that while Elo ratings and move count are strong predictors of chess outcomes, further refinement is needed to improve performance at high-ranking skill levels. The model performs well for experts but loses accuracy in master-level games, reflecting higher skill-level complexities. The insights gained from this research contribute to a deeper understanding of predictive modeling in chess, sug-gesting potential avenues for further investigation into additional Influencing factors. © 2025 IEEE.

关键词： Logistic regression

来源：评论

学校读者我要写书评

暂无评论

EloMetrics: Advanced Outcome Prediction for Chess Matches with Elo Ratings and Logistic Regression

EloMetrics: Advanced Outcome Prediction for Chess Matches wi...

引用

International Conference on Electronics, Information and Communications (ICEIC)

作者： Ma. Julianna Re-an DG. Reyes Eirnan Dicreto Emmanuel Gabriel D. Santos Daniella Franxene P. Limbag Gabriel Avelino Sampedro College of Computer Studies De La Salle University Manila Philippines Networks and Distributed Systems Laboratory University of the Philippines Diliman Quezon City Philippines

ISBN: (数字)9798331510756

ISBN: (纸本)9798331510763

关键词： Training Measurement Analytical models Logistic regression Accuracy Focusing Psychology Games Predictive models Time factors

来源：评论

学校读者我要写书评

暂无评论

Backbone Based GPS-Free Localization in Mobile Ad Hoc networks

引用

电子学报(英文版) 2007年第1期16卷 155-160页

作者： TIAN Mingjun ZHAO Dan YAN Wei Computer Networks and Distributed Systems Laboratory Peking University Beijing 100871 China

In this paper we describe a distributed, GPS-free localization algorithm called BGFL (Backbone -based GPS-free localization), which does not rely on any absolute position reference such as GPS or fixed anchor nodes. Instead, the algorithm only depends on the distances between the nodes and their neighbors. It is backbone based, in which some nodes in the network are first selected then formed into a backbone network, where every node on the backbone builds a LCS (Local coordinate system). Finally, all LCSs are merged into a global relative coordinate system. We simulate the performance of the algorithms under a variety of node densities, distance estimation errors and moving speeds. The results show that our algorithm outperforms the existing GPS-free localization algorithms in terms of accuracy, communication cost, convergence time, probability to build a global coordinate system and adaptability to the mobile environment.

关键词：移动Ad-Hoc网高速链路 GPS 定位

来源：评论

学校读者我要写书评

暂无评论

Resource Unaware Computing - A distributed Strategy for Divisible Load Processing on Linear Daisy Chain networks

Resource Unaware Computing - A Distributed Strategy for Divi...

引用

IEEE International Conference on networks

作者： Jingxi Jia Bharadwaj Veeravalli Computer Networks and Distributed Systems Laboratory (CNDS) Department of Electrical and Computer Engineering National University of Singapore Singapore

ISBN: (纸本)0780397460

In this paper we present a novel load distribution strategy for scheduling divisible loads on linear networks, when the speeds of the computing nodes and the speeds of the communication links are unknown. This practical assumption is captured in our problem formulation and we present a novel strategy, referred to as early start strategy (ESS), to generate a load distribution. Our strategy estimates the speed parameters and takes distinct advantage in utilizing a processor that responds earliest in the computation and including other fast processors in a progressive manner in phases to minimize the overall processing time. We analyze the strategy under several influencing parameters such as, load size, network size, and probe load size. We present simulation studies to validate all the theoretical findings and quantify the performance of our strategy

关键词： computer networks distributed computing Processor scheduling Electronic switching systems Probes Delay effects Laboratories Drives Distribution strategy Parameter estimation

来源：评论

学校读者我要写书评

暂无评论

An Efficient Multi-band Infrared Small Objects Detection Approach for Low-Altitude Artificial Intelligence of Thing

引用

IEEE Internet of Things Journal 2025年

作者： Peng, Yuhuai Wang, Jing Wang, Wenqian Liu, Lei Atiquzzaman, Mohammed Guizani, Mohsen Dustdar, Schahram Northeastern University School of Computer Science and Engineering Shenyang110819 China Zhiyuan Research Institute Hangzhou310024 China Northeastern University School of Computer Science and Engineering Shenyang110819 China Xidian University State Key Laboratory of Integrated Service Networks Xi'an710071 China University of Oklahoma School of Computer Science NormanOK73019 United States Mohamed Bin Zayed University of Artificial Intelligence Department of Machine Learning Masdar United Arab Emirates Technische Universität Wien Distributed Systems Group Vienna1040 Austria

As a cutting-edge technology of low-altitude Artificial Intelligence of Thing (AIoT), UAV object detection significantly enhances the surveillance services capabilities of low-altitude AIoT. However, the difficulty of object detection is exacerbated by the high proportion of small and obscure objects in the captured images. To address the mentioned challenges, we present an efficient multi-band infrared small object detection approach for low-altitude intelligent surveillance services. Firstly, we propose the Multi-band infrared Image Fusion algorithm based on Cascade-GAN (MIF-CGAN), which produces fused images with high information entropy and high contrast. Then, the Transformer-based Multi-scale Dense Small Object Detection (MsDSOD) algorithm is proposed. The algorithm consists of the Global-Local Object Detection (G-LOD) network, the Object Dense Area Extraction (O-DAE) module, and the Weighted Boxes Fusion (WBF) module. It extracts small objects features at different scales from infrared images and fuses the global and local detection results to accurately identify small objects in dense scenes. Furthermore, compared to the traditional algorithms, the mean Average Precision (mAP) of MsDSOD is improved by 0.80% and the Average Precision in small object detection (APs) is improved by 0.72%. The proposed algorithm is optimally suited to deal with complex scenes with dense small objects and background occlusion. © 2014 IEEE.

关键词： Infrared imaging

来源：评论

学校读者我要写书评

暂无评论

Wireless multi-hop network scenario emulation by controlling maximal error

引用

中国高等学校学术文摘·电气与电子工程 2009年第2期4卷 173-180页

作者： Huizhou ZHAO Xiaoming LI Wei YAN Computer Networks and Distributed Systems Laboratory Peking University Beijing 100871 China

A fundamental problem about Ad-hoc network emulation is how to emulate a wireless multi-hop network scenario in a fixed testbed, which, however, is scarcely discussed in depth by existing radio frequency (RF)control wireless network emulators. Therefore, in this article, we first formulate the wireless multi-hop scenario emulation problem based on RF-control, take controlling the maximal error as the solution mentality, and present an algorithm called the matching exact-solution condition algorithm. The experiment results show that the algorithm can solve the wireless multi-hop network scenario emulation problem and maximal error can be achieved.

关键词： computer architecture wireless multi-hop network emulation algorithm matching exact-solution condition algorithm network scenario emulation

来源：评论

学校读者我要写书评

暂无评论

MBF: A real matrix bloom filter representation method on dynamic set

MBF: A real matrix bloom filter representation method on dyn...

引用

2007 IFIP International Conference on Network and Parallel Computing Workshops, NPC 2007

作者： Jiacong, Wang Mingzhong, Xiao Yafei, Dai Computer Networks and Distributed Systems Laboratory Peking University China

ISBN: (纸本)0769529437

Bloom Filter is a simple space-efficient randomized data structure for representing a set in order to support membership queries, which uses an m-bit array to represent a data set. In order to support representing dynamic set, dynamic bloom filter (DBF) and split bloom filter (SBF) have been developed. Both DBF and SBF can support concisely representation and approximate membership queries of dynamic set instead of static set. SBF declares that it uses an s Xm bit matrix that consists of s bloom filters to represent a dynamic set, so DBF dose. But in fact, both the two bloom filters are not matrix representation method at all. They are just a set of s bloom filters whose length is m, and they have got a departure from the original idea of bloom filter: the constant query time cost. This paper points out the fact, and then introduce a truly matrix representation method of bloom filter to represent a dynamic set. We call it the Matrix Bloom Filter (MBF). Then, we will analysis the algorithm of MBF and study the average time complexity and the false positive probability. © 2007 IEEE.

关键词： Matrix algebra

来源：评论

学校读者我要写书评

暂无评论

Checkpointing distributed application running on mobile ad hoc networks

Checkpointing distributed application running on mobile ad h...

引用

International Journal of High Performance Computing and Networking

作者： Mansouri, Houssem Badache, Nadjib Aliouat, Makhlouf Pathan, Al-Sakib Khan Department of Computer Science Faculty of Exact Sciences University of Bejaia Bejaia06000 Algeria Research Center on Scientific and Technical Information CERIST Ben-Aknoun Algiers16000 Algeria Laboratory of Networks and Distributed Systems Computer Science Department University of Ferhat Abbas S?tif1 S?tif19000 Algeria Faculty of Computer and Information Systems Islamic University in Madinah Madinah al-Munawwarah Saudi Arabia CSE Department University of Asia Pacific Bangladesh

Mobile ad hoc network (MANET) is a type of wireless network consisting of a set of self-configured mobile hosts that can communicate with each other using wireless links without the assistance of any fixed infrastructure. This has made it possible for us to create distributed mobile computing applications and has also brought several new challenges in the field of distributed algorithm design. Checkpointing is a well explored fault tolerance technique for the wired and cellular mobile networks. However, it is not directly applicable to MANET owing to its dynamic topology, limited availability of stable storage, partitioning and the absence of fixed infrastructure. In this paper, we propose an adaptive, coordinated and non-blocking checkpointing algorithm to provide fault tolerance in cluster-based MANET, where only a minimum number of mobile hosts in the cluster should take checkpoints. The performance analysis and simulation results show that the proposed scheme requires less coordinating-message cost and performs well compared to the related previous works. Copyright ? 2018 Inderscience Enterprises Ltd.

关键词： Mobile ad hoc networks distributed computer systems Fault tolerance Mobile computing Cellular mobile networks Check pointing Clustering distributed mobile computing Fault tolerance techniques MANET Non blocking checkpointing Performance analysis and simulation

来源：评论

学校读者我要写书评

暂无评论

Extending the reach of online social networks to opportunistic networks with PodNet

Extending the reach of online social networks to opportunist...

引用

2nd International Workshop on Mobile Opportunistic Networking, MobiOpp 2010

作者： Distl, Bernhard Csucs, Gergely Trifunovic, Sascha Legendre, Franck Anastasiades, Carlos Computer Engineering and Networks Laboratory ETH Zurich Switzerland Computer Networks and Distributed Systems Group University of Bern Switzerland

ISBN: (纸本)9781605589251

PodNet is an opportunistic architecture allowing to exchange multimedia content, or podcasts, from mobiles to mobiles in an opportunistic fashion using Wifi. Content can originate from the Internet (e.g., YouTube, BBC) but it can also be user generated content (e.g., pictures or video/voice recordings). We have enhanced the PodNet architecture to extend the reach of online social networking applications (e.g., Facebook, Twitter) to opportunistic networks. We'll demonstrate how Facebook feeds (public or private) are distributed opportunistically among the demo devices that are carried by participants. Using additional PodNet gateway components, content generated in the opportunistic domain can be sent to the Internet (e.g. updates on the Facebook page). Eventually, we will demonstrate an Infoscreen (embedded with a PodNet gateway), which displays useful high-level information (campus life, tram schedules) users can subscribe to, to fetch richer content provided through PodNet. © 2010 ACM.

关键词： Network architecture

来源：评论

学校读者我要写书评

暂无评论

Social trust in opportunistic networks

Social trust in opportunistic networks

引用

IEEE Conference on computer Communications Workshops, INFOCOM 2010

作者： Trifunovic, Sacha Legendre, Franck Anastasiades, Carlos Computer Engineering and Networks Laboratory ETH Zurich Switzerland Computer Networks and Distributed Systems Group University of Bern Switzerland

ISBN: (纸本)9781424467396

Opportunistic networks enable mobile users to participate in various social interactions with applications such as content distribution and micro-blogs. Because of their distributed nature, securing user interactions relies rather on trust than hard cryptography. Trust is often based on past user interactions such as in reputation systems relying on ratings. Yet, a more fundamental trust, social trust - assessing a user is genuine with honest intentions - must be established beforehand as many identities can be created easily (i.e., sybils). By leveraging the social network structure and its dynamics (conscious secure pairing and wireless contacts), we propose two complementary approaches for social trust establishment: explicit social trust and implicit social trust. Complexity, trust propagation and security issues are evaluated using real world complex graphs, synthetic mobility models and mobility traces. We show how our approach limits the maximum number of sybils independently of the network size and is more robust against manipulation attacks compared to state-of-the-art approaches such as PGP-like certification chains and distributed community detection algorithms. ©2010 IEEE.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：