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

4th International Conference on Ubiquitous Computing and Intelligent Information Systems, ICUIS 2024

作者： Arora, Dinesh Sharma, Deepika Sharma, Avinash Goyal, Parul Chandigarh Enigineering College Department of Electronics & Communications Engineering Landran Punjab Mohali India Chandigarh College of Technology Depatment of Biotechnolgy Landran Punjab Mohali India Chandigarh Enigineering College Department of Computer Science & Engineering Jhanjeri Punjab Mohali India M. M Engineering College Maharishi Markandeshwar Deemed to be University Computer Science & Engineering Department Mullana Haryana Ambala India

ISBN: (纸本)9798331529635

This study presents a hybrid Generative Adversarial Network (GAN) and Support Vector Machine (SVM) model for accurately categorizing Raspberry Cane Disease (RCD) into four severity levels. Leveraging a dataset of 7,000 high-resolution images, the model achieves 98.8% accuracy. GANs generate synthetic images to address data scarcity, while SVMs ensure precise multi-class classification. The results demonstrate the model's effectiveness in disease severity assessment, highlighting its potential for broader agricultural applications. © 2024 IEEE.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

Redefining Disease Assessment in Raspberries: A Hybrid GAN-SVM Model for Detailed Intensity Measurement

Redefining Disease Assessment in Raspberries: A Hybrid GAN-S...

引用

Ubiquitous Computing and Intelligent Information Systems (ICUIS), International Conference on

作者： Dinesh Arora Deepika Sharma Avinash Sharma Parul Goyal Department of Electronics & Communications Engineering Chandigarh Enigineering College Landran Mohali Punjab India Depatment of Biotechnolgy Chandigarh College of Technology Landran Mohali Punjab India Department of Computer Science & Engineering Chandigarh Enigineering College Jhanjeri Mohali Punjab India Computer Science & Engineering Department M. M Engineering College Maharishi Markandeshwar Deemed to be University Mullana Ambala Haryana India

ISBN: (数字)9798331529635

ISBN: (纸本)9798331529642

关键词： Support vector machines Precision agriculture Plant diseases Accuracy Food security Generative adversarial networks Ubiquitous computing Vectors Hybrid power systems Information systems

来源：评论

学校读者我要写书评

暂无评论

Integrating CNN and Genetic Algorithms for Kohlrabi Variety Classification in India: A Study of Purple Vienna, White Vienna, and Grand Duke

Integrating CNN and Genetic Algorithms for Kohlrabi Variety ...

引用

International Conference on Inventive Computation Technologies (ICICT)

作者： Nadim Akhtar Ruchi Singla Dinesh Arora Deepika Sharma Avinash Sharma Department of Computer Science Engineering Chandigarh Group of Colleges Landran (Mohali) Punjab India Director Research & Devlopment Chandigarh Group of Colleges Landran (Mohali) Punjab India Department of Electronics & Communications Engineering Chandigarh Enigineering College Landran Mohali Punjab India Depatment of Biotechnolgy Chandigarh College of Technology Landran Mohali Punjab India Department of Computer Science & Engineering Chandigarh Enigineering College Jhanjeri Mohali Punjab India

ISBN: (数字)9798331512248

ISBN: (纸本)9798331512255

The proposed work looks into differences between types of Kohlrabi common in India using special systems called Convolutional Neural Networks (CNN) with Genetic Algorithms (GA). A set of 4000 high-quality pictures was carefully gathered and readied. These included Purple Vienna, White Vienna, and Grand Duke types. The CNN design was made to find small differences in pictures. It used convolutional, pooling, and fully connected parts for a strong grouping of things. The CNN model was good at telling apart different kinds of kohlrabi. It got it right 96.12 % of the time based on how they looked and what color they were! The test results showed that the model was very accurate across all categories, showing it is reliable in spotting small differences. Comparing it to other ways of doing things, found that the CNN model worked better. This made sure it is a strong and trustworthy choice for telling different types of Kohlrabi apart. This study shows that machine learning methods, especially CNNs can be good for farming tasks. It gives hope to finding the right type of plants better in farm work and separate markets for sales. Also, these techniques help improve breeding programs. The good use of CNNs in correctly grouping Kohlrabi types shows better ways to grow crops and can help with making food long-lasting. It also leads people closer to understanding what different plants look like, helping those who work on farms make smarter choices.

关键词： Training Accuracy Shape Neural networks Crops Convolutional neural networks Reliability Farming Genetic algorithms Sorting

来源：评论

学校读者我要写书评

暂无评论

Packets Buffering Enhancement with Hybrid Coding Labels for Virtual Optical Memory

引用

Procedia computer Science 2018年 130卷 336-343页

作者： Chun-Chieh Liu Yao-Tang Chang Chao-Chin Yang Jen-Fa Huang Institute of Computer and Communications Engineering Department of Electrical Engineering National Cheng Kung University (NCKU) Tainan Taiwan Depatment of Information Technology Kao Yuan University Kaohsiung Taiwan Department of Electro-Optical Engineering Kun Shan University Tainan Taiwan

For the practical deployment of optical packet switching (OPS) system, realizing all-optical buffering is a critical issue. In this paper, we present a hybrid labelling scheme based on optical code-division multiplexing (OCDM) over generalized multi-protocol label switching (GMPLS) network. The virtual optical memory is implemented by assigning queuing packets with different coded-WDM labels. The proposed hybrid labels combine the advantages of wavelength-division multiplexing (WDM) with spectral-amplitude-coding (SAC) OCDM. Due to the cyclic-shift property of arrayed-waveguide grating (AWG) and maximal-length sequence (M-sequence) codes, blocks of label generating and processing in node organization can be built in low complexity. Furthermore, utilizing hybrid coding technique in the buffering node increases the efficiency of label generating and processing. Derivation of the probability of packet missing is done to quantify the buffering performance of virtual optical memory. Simulation results show that the hybrid-coded labels, as compared to the conventional OCDM labels, are able to buffer the data packets with a relatively low probability of packet missing under similar label length.

关键词： Optical Packet Switching (OPS) generalized Multi-Protocol Label Switching (GMPLS) spectral-amplitude-coding optical code-division multiplexing (OCDM)

来源：评论

学校读者我要写书评

暂无评论

On out-of-sequence problem in contention-tolerant crossbar switches

引用

Information Technology Journal 2011年第12期10卷 2268-2275页

作者： Zhang, Jianfei Fang, Zhiyi Qu, Guannan Zhao, Xiaohui Zheng, S.Q. College of Computer Science and Technology School of Communications Engineering Jilin University China School of Communications Engineering Jilin University China Depatment of Computer Science University of Texas Dallas United States

Recently, we proposed an innovate crossbar switch named Contention-tolerant Crossbar Switches (CTC(N)). Different with conventional crossbar switches which resolve output contentions by building conflict-free connections among inputs and outputs before switching, CTC(N) tolerates output contentions and avoids cell lost by reconfiguring bus in switch fabric. In this way, complex hardware which is used to complete the arbitrations is released and schedulers are fully distributed over all input ports and operate independently. CTC(N) opens a new perspective on cell switching. For the asymmetric property of original CTC(N) architecture, DiaCTC(N), an improved architecture was proposed. However, interceptions which happen in contention-tolerant mechanism lead to cell out of their original sequence. In this study, we focus on this problem in CTC(N) and DiaCTC(N). Two methods including re-sequencing and Self-adjust scheduling algorithm will be discussed. © 2011 Asian Network for Scientific Information.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

How to collect balls moving in the euclidean plane

How to collect balls moving in the euclidean plane

引用

Proceedings of Computing: The Australasian Theory Symposium (CATS)

作者： Asahiro, Yuichi Horiyama, Takashi Makino, Kazuhisa Ono, Hirotaka Sakuma, Toshinori Yamashita, Masafumi Department of Social Information Systems Faculty of Information Science Kyushu Sangyo University Fukuoka 813-8503 Japan Division of Systems Science Graduate School of Engineering Science Osaka University Toyonaka Osaka 560-8531 Japan Depatment of Communications and Computer Engineering Graduate School of Informatics Kyoto University Kyoto 606-8501 Japan Department of Computer Science and Communication Engineering Graduate School of Information Science and Electrical Engineering Kyushu University Fukuoka 812-8581 Japan

In this paper, we study how to collect n balls moving with constant velocities in the Euclidean plane by k robots moving on straight track-lines through the origin. Since all the balls might not be caught by robots, differently from Moving-Target TSP, we consider the following 3 problems in various situations: (i) deciding if k robots can collect all n balls, (ii) maximizing the number of the balls collected by k robots, and (iii) minimizing the number of the robots to collect all n balls. The situations considered here contain the cases in which track-lines are given (or not), and track-lines are identical (or not). For all problems and situations, we provide polynomial time algorithms or proofs of intractability, which clarify the tractability- intractability frontier in the ball collecting problems in the Euclidean plane. © 2004 Elsevier B.V. All rights reserved.

关键词： Problem solving

来源：评论

学校读者我要写书评

暂无评论

How to Collect Balls Moving in the Euclidean Plane

引用

Electronic Notes in Theoretical computer Science 2004年 91卷 229-245页

作者： Yuichi Asahiro Takashi Horiyama Kazuhisa Makino Hirotaka Ono Toshinori Sakuma Masafumi Yamashita Department of Social Information Systems Faculty of Information Science Kyushu Sangyo University Fukuoka 813-8503 Japan Depatment of Communications and Computer Engineering Graduate School of Informatics Kyoto University Kyoto 606-8501 Japan Division of Systems Science Graduate School of Engineering Science Osaka University Toyonaka Osaka 560-8531 Japan Department of Computer Science and Communication Engineering Graduate School of Information Science and Electrical Engineering Kyushu University Fukuoka 812-8581 Japan

In this paper, we study how to collect n balls moving with constant velocities in the Euclidean plane by k robots moving on straight track-lines through the origin. Since all the balls might not be caught by robots, differently from Moving-Target TSP, we consider the following 3 problems in various situations: (i) deciding if k robots can collect all n balls, (ii) maximizing the number of the balls collected by k robots, and (iii) minimizing the number of the robots to collect all n balls. The situations considered here contain the cases in which track-lines are given (or not), and track-lines are identical (or not). For all problems and situations, we provide polynomial time algorithms or proofs of intractability, which clarify the tractability-intractability frontier in the ball collecting problems in the Euclidean plane.

关键词： Moving-Target TSP Vehicle routing problem Partially ordered set Combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

Performance Study of TCP Veno over WLAN and RED Router

Performance Study of TCP Veno over WLAN and RED Router

引用

IEEE Global Telecommunications Conference GLOBECOM'03

作者： Pang, Qixiang Liew, Soung C. Fu, Cheng Peng Wang, Wei Li, Victor O.K. Depatment of Information Engineering Chinese University of Hong Kong Hong Kong Division of Computer Communications School of Computer Engineering Nanyang Technological University Singapore Department of Electrical Engineering University of Hong Kong Hong Kong

This paper examines the impact of RED on two versions of TCP - traditional TCP Reno and a newly proposed variant, TCP Veno - over 802.11b WLAN. TCP Reno was originally designed for wired networks where packet losses are primarily due to network congestion. This assumption is not always true in wireless networks, in which packet losses can be due to transmission errors on the noisy wireless link. TCP Veno refines the algorithms in Reno by distinguishing between noncongestive and congestive states, and avoids the unnecessary reduction of TCP congestion window when packet losses are not due to congestion. Our results show that TCP Veno can achieve up to 30% more throughput than TCP Reno when link quality is poor. Our results also show that TCP Veno is compatible with RED. In addition, although RED does not help to further improve the throughput in Veno, it can improve fairness among co-existing TCP flows.

关键词： Network protocols

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：