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

1st International Conference on Applied Artificial Intelligence and Computing, ICAAIC 2022

作者： Umar, Syed Reddy, N Linga Yadesa, Tariku Birhanu Deressa, Tadele Debisa Fikadu, Etana College of Engineering & Technology Wollega University Dept. of Computer Science Nekemte Ethiopia Dr Ysr Architecture and Fine Arts University Dept. of Computer Science Andhra Pradesh Kadapa India

ISBN: (纸本)9781665497107

technology, economics, government, people, management, and infrastructure all play a role in creating a Smart City. This indicates that a Smart City may have different communication requirements than a traditional city. The introduction of wireless technologies like WiFi, Bluetooth, ZigBee, WiMax, and 4G/LTE has made them a viable option for facilitating communication in Smart City projects. As long as they are using unlicensed interference, coexistence and band problems will continue to be a problem. Smart cities utilize the Internet of Things (IoT) to address this issue. Using hybrid optimization methods, this article tackles the problems of resource allocation and routing for the Internet of Things (IoT) by proposing the ECRR protocol (energy efficient, congestion aware resource allocation and routing). Data clustering and met heuristic algorithms are usedin the first step of the ECRR method to better distribute IoT devices and gateways throughout the network. It also proposes a method for selecting the best future route by using a queue-based swarm optimization algorithm, which enhancesthe route discovery process. With Network Simulator (NS-2), the proposed ECRR approach is simulated and compared to existing state-of-the-art methods in terms of energy consumption, node lifetime, throughput, end-to end latency, packet delivery ratio, and packet overheads. © 2022 IEEE.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

Improving the performance of Dragonfly networks through restrictive Proxy routing strategies

引用

computer Networks 2025年 267卷

作者： Navaridas, Javier Pascual, Jose A. Dept. of Computer Architecture and Technology Faculty of Computer Science University of the Basque Country UPV/EHU Paseo Manuel de Lardizabal 1 Donostia-San Sebastián20018 Spain

Dragonfly has become the network of choice for large-scale high-performance computing systems and, indeed, it dominates the top positions of supercomputer rankings. The reason for this is that it offers a sweet spot in terms of cost, simplicity, performance, fault-tolerance and power consumption. In this work, we propose a collection of routing strategies which restrict proxies to be adjacent to either the local or the remote router. This way, it features shorter paths than the standard Valiant routing. We carry out an extensive simulation-based evaluation to assess their performance. Our experiments found latency reductions of up to 76% and throughput improvements of up to 26% when compared with standard Valiant routing when using synthetic traffic from independent sources at different scales. Furthermore, when using realistic application-inspired workloads, we found the strategies required between 5% and 20% less time to perform communications. In general, we observe that selecting proxies that are adjacent to the sender is more beneficial than those adjacent to the destination because the latter tends to generate backpressure in the last level of the interconnect. Interestingly, we found that the most restrictive proxy routing strategies obtain the best results in all scenarios and show that counterintuitively, the lower the path diversity, the more balanced the use of network resources. Our study includes investigating the interplay between routing and Dragonfly parameters and provide optimal parameters for proxy-based routing algorithms. Finally, we discuss some practical considerations related to the deployment of our strategies. © 2025 The Authors

关键词： Interconnection networks (circuit switching)

来源：评论

学校读者我要写书评

暂无评论

Survey on Use of AI/ML Algorithms in Enhancing Filesystem Performance and Efficiency

Survey on Use of AI/ML Algorithms in Enhancing Filesystem Pe...

引用

International Conference on Reliability, Infocom Technologies and Optimization (ICRITO) (Trends and Future Directions)

作者： Vijay Olekar Yash Patil Vishvam Pawar Shubham Pitale V R. Jaiswal Vishal Naranje Dept. of Information Technology Pune Institute of Computer Technology Pune Pune India School of Engineering Architecture and Interior Design Amity University Dubai

ISBN: (数字)9798350350357

ISBN: (纸本)9798350350364

The processing power of CPUs is increasing day by day, but systems often struggle to fully utilize this power due to the bottleneck of file access time from the disk. Over the years, various techniques have been devised to reduce I/O latency while considering various file parameters. Our survey paper aims to shed light on these techniques, efficiently comparing them and highlighting the benefits and drawbacks of each approach. For our evaluation, we have considered various file parameters, such as access time, file size, directory structure, and kernel execution flow. We have combined these parameters with a range of supervised and unsupervised machine learning algorithms, including Decision Tree, ABLE, RNN, GNN, CART, XGBoost, CNN, and more. This survey aims to highlight the use of ML/AI algorithms in the intelligent detection of file access and I/O patterns to optimize the performance of modern applications.

关键词： Surveys Machine learning algorithms Adaptive systems File systems System performance Neural networks Predictive models

来源：评论

学校读者我要写书评

暂无评论

A Blockchain-Based Parametric Model Library for Knowledge Sharing in Building Information Modeling Collaboration

引用

Journal of Construction Engineering and Management 2023年第11期149卷 04023107-04023107页

作者： Hsu, Chih-Lin Wang, Jui-Tang Hou, Hsin-Yi Dept. of Architecture National Taiwan Univ. of Science and Technology Taipei10607 Taiwan Dept. of Electronic and Computer Engineering National Taiwan Univ. of Science and Technology Taipei10607 Taiwan

A building lifecycle consists of multiple domains, and building information modeling (BIM) applications involve cross-domain knowledge exchange. In the knowledge spiral theory proposed by Nonaka, externalization facilitates knowledge exchange in designing cooperation, and a model library (ML) contains the necessary information for the architecture, engineering, and construction (AEC) industry. However, current MLs are centralized systems that are vulnerable to data tampering and copyright disputes, and the provided models may not match the requirements of current building projects. Therefore, this article develops a blockchain-based parametric ML (BBPML) for BIM collaboration to realize knowledge sharing. The parametric model in our ML can be flexibly applied to a project by adjusting the parameters. A blockchain network provides reliable storage and ensures the upload sequence. The research creates a website based on the proposed system through Ethereum and applies it to a curtain wall project. © 2023 American Society of Civil Engineers.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

Meaning of the Clusters on Dimensionality Reduction by Word Clustering 12

Meaning of the Clusters on Dimensionality Reduction by Word ...

引用

12th International Congress on Advanced Applied Informatics, IIAI-AAI 2022

作者： Deguchi, Toshinori Seo, Sinsuke Ishii, Naohiro Dept. of Electrical and Computer Engineering Gifu College Gifu Japan Interdisciplinary Technology Development Gifu College Gifu Japan Information Systems Architecture Advanced Institute of Industrial Technology Tokyo Japan

ISBN: (数字)9781665497558

ISBN: (纸本)9781665497558

In text mining, Latent Semantic Analysis (LSA) is the popular method to reduce the dimension of document vectors. Since LSA produces a set of topics by statistical information, the meaning of each topic is not *** proposed a method to reduce the dimension by clustering the words in the documents. This method produces a set of clusters of words instead of topics. Using Word2vec to vectorize the words, the mean vector of the cluster is calculated, which shows the meaning of the *** this paper, we show the dimensionality reduction and the meaning of the generated clusters by word cloud, on document classification problem with a subset of BBC Dataset. © 2022 IEEE.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

A Deep Neural Network for Detecting Broken and Scattered Power Lines in Complex Aerial Images 3

A Deep Neural Network for Detecting Broken and Scattered Pow...

引用

3rd International Conference on Artificial Intelligence and computer Information technology, AICIT 2024

作者： Pei, Qiugen Lai, Yuxuan Wei, Nianxing Wu, Shiting Guangdong Power Grid Co. Ltd. Enterprise Architecture and Digitalization Department Guangzhou China Guangdong University of Technology Dept. School of Computer Science Guangzhou China Guangdong Power Grid Co. Ltd. Huizhou Boluo Power Supply Bureau Huizhou China

ISBN: (纸本)9798350365443

Object detection algorithms constitute a pivotal task in the realm of computer vision, aiming to precisely identify and locate objects within images across diverse scenarios. In power systems, especially in aerial images used to detect wire breaks or scattered anomalies, object detection faces significant challenges. The distribution of wires is often uneven, appearing in different sizes in high-resolution images, and the diversity of fault shapes and sizes makes it difficult for traditional object detection models to recognize accurately. Moreover, the detection of small targets also limits the precision of traditional methods. To address the issue of diversity in fault shapes and sizes in high-resolution images, which makes it difficult for traditional object detection models to recognize accurately, first, we collect fault images of wire breaks and scatter under common scenarios, constructing the 'EWF _detection' (Electric wire fault) dataset, and propose a Pyramid Multi-scale Object Detection Model, establishing the Hybrid Spatial Attention Pooling module, HSAP, which significantly enhances the multi-scale feature extraction capability. It not only improves the model's ability to focus on key features, but also suppresses unnecessary features, enhancing the expressiveness of the network, and effectively adapting to complex backgrounds, variable lighting conditions, and different line scales and directions for transmission line detection needs. This improvement makes our model perform exceptionally well in detecting rare faults in wires and accurately locate fault positions. These achievements provide reliable technical support for wire anomaly detection in the power industry and indicate a broad prospect of application in future power scenarios. Our method not only improves detection accuracy, but also maintains efficient detection speed, reducing reliance on a large number of fault line images. These advantages make our model an important technical tool for pow

关键词： Aerial photography

来源：评论

学校读者我要写书评

暂无评论

QVal: A Novel Routing Algorithm for Dragonfly Networks

QVal: A Novel Routing Algorithm for Dragonfly Networks

引用

IEEE International Conference on High Performance Computing and Communications (HPCC)

作者： Javier Navaridas Jose A. Pascual Dept. of Computer Architecture and Technology University of the Basque Country (UPV/EHU) Donostia-San Sebastián Spain

Dragonfly is becoming one of the networks of choice for high-performance computer systems as it offers a sweet spot in terms of cost, simplicity, performance, fault-tolerance and power. In a Dragonfly topology, compute nodes are connected to routers forming fully-connected groups, which are then connected to every other group. This provides very high connectivity with very low diameter which are desired characteristics of high performance interconnection networks. In this work, we propose Quick Valiant, a new routing algorithms for dragonfly networks which leverages Valiant routing with novel proxy selection criteria which reduce the utilization of network resources and eases congestion under pathological loads. These criteria restrict the possible proxies to these that are adjacent to either the local or the remote router, codenamed QVL and QVR, respectively. We compare our proposals with canonical routing functions and observe reductions of average path length of up to 27% and throughput improvements of up to 46% when compared with Valiant routing. Out of these criteria, restricting to local proxies only, QVL, obtains the best results in all scenarios.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Affine-NoC: Multi-ring NoCs exploiting long physical links

Affine-NoC: Multi-ring NoCs exploiting long physical links

引用

International Workshop on Network on Chip architectures, NoCArc

作者： Enrique Vallejo Evangelos Mageiropoulos Nikolaos Chrysos Manolis G.H. Katevenis Computer Science Dept. Universidad de Cantabria Spain Santander Spain Computer Architecture and VLSI Systems (CARV) Laboratory Foundation for Research and Technology – Hellas (FORTH) Heraklion Greece

ISBN: (数字)9798331506421

ISBN: (纸本)9798331506438

Routerless multi-ring proposals are low-cost NoCs that employ multiple independent rings, avoiding any crossbars or arbitration mechanisms. Their complexity lies on the selection of the set of rings to connect all the nodes. Previous proposals result in unbalanced designs with high hop *** work introduces Affine-NoC, a balanced routerless NoC based on a novel arrangement of rings derived from the Affine Plane. Affine-NoC exploits express channels to connect distant processing elements, allowing for a completely balanced layout of the set of rings and a reduction in average distance and diameter without sacrificing bisection *** shows that Affine-NoC presents a balanced design with a low number of rings per node and reduced complexity, similar cost to previous proposals in terms of aggregated link length, while it simplifies the multiplex units and reduces the hop count. Simulation results show that Affine-NoC reduces hop count and average latency by 76% and 20.5% respectively compared to previous designs, it reduces deflections by 27% and avoids unfairness, making it a feasible alternative for multi-ring routerless NoCs.

关键词： Multiplexing Network topology Flow production systems Simulation Layout computer architecture Complexity theory Topology Proposals Logic

来源：评论

学校读者我要写书评

暂无评论

Study of an OPTO-ASIC for a Functionally Safe Speed Sensor Using the Spatial Frequency Filter Method

Study of an OPTO-ASIC for a Functionally Safe Speed Sensor U...

引用

IEEE Design and Diagnostics of Electronic Circuits and Systems (DDECS)

作者： Frank Wasinski Werner Bonath Ubbo Ricklefs Michael Schwarz Josef Börcsök Dept. of Electrical Engineering and Information Technology THM University of Applied Sciences Giessen Germany ICAS Institute for Computer Architecture and System Programming University of Kassel Kassel Germany

ISBN: (数字)9798331528010

ISBN: (纸本)9798331528027

For decades, speed sensors based on the spatial frequency filter method have successfully proven themselves in a wide range of applications. This makes the sensor concept particularly suitable for the area of functional safety. New filter variants extend the previous measuring range to very low speeds up to standstill detection. By combining the sensor with a safety system on chip for recording and analysing measured values, a functionally safe measuring chain can be established. In order to demonstrate the variability and performance of the new filters, an optical application-specific integrated circuit was designed, which forms the basis for further extensive tests. The core components are a large number of freely configurable photodiode channels, which were realised via a redundant structure, as well as two different transimpedance amplifier concepts. In the further course of the project, the ASIC will be analysed with regard to its desired performance parameters and its robustness.

关键词： Optical filters Semiconductor device measurement Optical design Stimulated emission Safety Topology System-on-chip Optical sensors Optical amplifiers Velocity measurement

来源：评论

学校读者我要写书评

暂无评论

Identify Initial Nodes for Spreader in A New Diffusion Model Based on Topology (DBT) in Social Networks

Identify Initial Nodes for Spreader in A New Diffusion Model...

引用

International Conference on Web Research (ICWR)

作者： Ehsan Khosravi Fatemeh Yazdanifar Nikoo Salimi Hamid Ahmadi Beni Dept. of Computer Engineering Sharif University of Technology Tehran Iran Dept. of Mathematics and Computer Science Amirkabir University of Technology Tehran Iran Dept. of the Electrical Electronics Electronics and Telecommunication Engineering and Naval Architecture University of Genoa Genoa Italy Dept. of Software Engineering Azarbaijan Shahid Madani University Tabriz Iran

With the development of science and technology through social networks, the process of diffusion has become a controversial subject. In social networks, the process of diffusion is transmitted from one individual to another. The influence maximization problem, in which at least k nodes are chosen as the initial nodes of the spreader in the smallest amount of time, is one of the most critical aspects of the diffusion process. Furthermore, the initial nodes in the social network should generate the most influence on the other nodes in the network. However, in the algorithms proposed to solve the problem of influence maximization, the real-world factors which affect the influence probability in diffusion models are ignored for example, the influence probability is determined randomly. This problem causes influence maximization algorithms based on diffusion models to face the challenge of time-consuming Monte Carlo simulation. So, the RIM algorithm presented in this article which this method selects the initial nodes of the spreader according on their local reachability. In addition, Due to privacy in social networks, complete information about people such as gender, education, etc. is not available. For this reason, in the RIM algorithm, using the graph structure in social networks, the influence probability is calculated in the new DBT diffusion model. In addition, the RIM algorithm exhibits stable performance in the selection of the spreader's initial nodes in terms of influence spread, and execution time.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：