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

8th International Conference on Cloud Computing and Big Data Analytics (ICCCBDA)

作者： Wan, Fulei Chen, Wei Xiao, Qifu CNPC Chuanqing Drilling Engn Co Chengdu Peoples R China

ISBN: (纸本)9781665455336

Cluster well development mode is the main mode for the efficient development of unconventional oil and gas reservoirs at home and abroad. Due to the dense well placement and the limited three-dimensional space of the borehole, cluster well trajectory design is faced with: Low wellhead and artificial target matching efficiency and cluster Wells around the barrier design difficulty,cluster Wells orbit design is difficult, to solve the above problems, improve the efficiency of cluster well group orbit design, based on the research, formed the wellhead and targets for efficient matching algorithm, automatic cluster Wells orbit around the barrier design algorithm, developed a cluster well group borehole trajectory automatic design software, The software is applied to complete the trial calculation of automatic trajectory design of 21 cluster well platforms in Sichuan and Chongqing area. The trial calculation results show that: The automatic design software of cluster well trajectory developed in this paper can greatly improve the efficiency of cluster well trajectory design and reduce the design time of cluster well trajectory. It preliminarily realizes the automatic design of cluster well trajectory and effectively promotes the development of cluster well trajectory design toward a higher level of automation

关键词： km algorithm automatic wellbore trajectory design km task allocation algorithm A* algorithm automatic detour algorithm for cluster well trajectory

来源：评论

学校读者我要写书评

暂无评论

Optimal MRUs Allocation Mechanism Based on User Priority for Wi-Fi 7 Network

Optimal MRUs Allocation Mechanism Based on User Priority for...

引用

IEEE Global Communications Conference (GLOBECOM)

作者： Pan, Jialiang He, Rong Lin, Yang Fang, Xuming Southwest Jiaotong Univ Key Lab Informat Coding & Transmiss Chengdu Peoples R China

ISBN: (纸本)9781665435406

Multiple Resource Unit (MRU) is one of the new key features introduced by IEEE 802.11be draft. Different from IEEE 802.11ax standard, which supports assigning only one RU to each user, 802.11be supports MRU assigned to a single user to enhance the resource utilization and flexibility. Due to the strict restrictions on combinations of MRU sizes and locations specified in IEEE 802.11be draft, the resource allocation algorithms face some new challenges. In this paper, we designed an MRU resource allocation algorithm based on user priority, which considered the restrictions of MRU distribution pattern and MRU combination on different channel bandwidth. User priority is defined according to the channel condition and the priority of traffic types. Then an optimal MRUs allocation mechanism for users with different priorities is proposed to maximize the aggregate satisfaction level of the scheduled users. The matching problem of STAs and MRU locations is modeled based on graph theory km (Kuhn-Munkras) algorithm, to find the perfect matching solution. Simulation results show that the proposed scheme can improve throughput by 39.8% and the user satisfaction level by 22.03%, compared with the baseline schemes, which evenly assigned the RU resources.

关键词： Wi-Fi 7 IEEE 802.11be Resource Allocation Multi-RU User priority User satisfaction level km algorithm

来源：评论

学校读者我要写书评

暂无评论

Suitability-based Task Assignment in Crowdsourcing Markets 13

Suitability-based Task Assignment in Crowdsourcing Markets

引用

13th IEEE International Conference on Services Computing (SCC) / 13th IEEE International Conference on Web Services (ICWS)

作者： Wang, Pengwei Chen, Zhen Zhang, Zhaohui Donghua Univ Sch Comp Sci & Technol Shanghai Peoples R China

ISBN: (纸本)9781728187891

Crowdsourcing web services has received much attention in recent years, which has been widely used in many fields, and provides important human computing services for the rapid development of AI. Crowdsourcing knowledge acquisition is one of the most important applications, which includes a series of work such as image annotation and picture classification. However, due to the differences in the difficulty of these tasks and the uncertainty of workers, how to make a reasonable task assignment while ensuring the completion of tasks becomes a big challenge. To this end, we introduce WordNet external knowledge base to help determine the difficulty of picture classification tasks. We refer to the e-sports rank mechanism and use dynamic update strategy to assess the actual ability of workers. A novel criterion affinity based on the weighted Euclidean distance with penalty factor is proposed to measure the suitability between tasks and workers. On this basis, the Kuhn-Munkres (km) algorithm is used to solve the weighted bipartite graph matching problem. Through comparative experiments, the effectiveness of our proposed method is verified.

关键词： crowdsourcing task assignment bipartite graph matching km algorithm

来源：评论

学校读者我要写书评

暂无评论

QoS-Based Channel and Power Optimization algorithm in D2D System 18

QoS-Based Channel and Power Optimization Algorithm in D2D Sy...

引用

18th IEEE International Conference on Communication Technology (IEEE ICCT)

作者： Tao, Jing Zhu, Qi Hu, Han Nanjing Univ Posts & Telecommun Jiangsu Key Lab Wireless Commun Nanjing Jiangsu Peoples R China

ISBN: (纸本)9781538676356

This paper considers the scenario of D2D users sharing cellular user uplink resources, and proposes an optimal resource allocation algorithm in order to improve the system capacity. The algorithm first uses fuzzy C-means (FCM) algorithm to cluster according to the geographic location of the D2D user, so that users in the cluster can not share the channel to restrain the interference between D2D pairs, then use the Kuhn-Munkras (km) algorithm to allocate cellular users' uplink channel for D2D users in the cluster, which means optimally match the D2D user with the cellular user. Finally, Considering the system capacity, the users' quality of service (Qos) requirements and the D2D users' transmit power, a non-cooperative game model is constructed to optimize the transmit power of D2D users and the existence of its Nash equilibrium is proved. Simulation results turn out that it can effectively promote the system capacity while guaranteeing the communication quality of each user.

关键词： device-to-device capacity FCM algorithm km algorithm game theory

来源：评论

学校读者我要写书评

暂无评论

A Sort Method to Enhance Significant Spectral Components of Test Set 12

A Sort Method to Enhance Significant Spectral Components of ...

引用

12th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)

作者： Zhou, Yingbo Kuang, Jishun Hunan Univ Coll Informat Sci & Engn Changsha Hunan Peoples R China

ISBN: (纸本)9781509040933

A sort method is proposed to enhance the significant spectral components of test set. In the field of integrated circuit testing, to calculate significant spectral components, it's necessary to do spectrum analysis for the test set. In this paper, a bipartite graph and weight matrix are constructed based on the test set and its significant spectral components. Therefore, the problem of enhancement of significant spectrum components is transformed into a bipartite graph matching problem that can be solved by km(Kuhn-Munkras) algorithm. After the order adjustment of the test set according to the matching relationship, the correlation between the significant component and test set has been increased, and the significant spectral components are enhanced. Finally, the experimental results on the test set of the ISCAS-89 benchmark circuits show that the coefficients of the sorted test have increased by 9.47% on average, and the incompatible bits between the test set and its significant spectral components have effectively reduced by 14.18% on average.

关键词： spectrum analysis the significant components bipartite graph match km algorithm correlation

来源：评论

学校读者我要写书评

暂无评论

Multi-service Communication Isolation of Underground Pipe Gallery Based onWiFi6 11th

Multi-service Communication Isolation of Underground Pipe Ga...

引用

11th European-Alliance-for-Innovation (EAI) International Conference on Game Theory for Networks (GameNets)

作者： Liu, Shaojun Lou, Zheng Li, Jingwei Zhang, Linlin Shao, Sujie State Grid Jiangsu Elect Power Co Ltd Nanjing Power Supply Branch Nanjing Peoples R China Beijing Univ Posts & Telecommun State Key Lab Networking & Switching Technol Beijing Peoples R China

ISBN: (纸本)9783031231407;9783031231414

There are a variety of services in underground pipe gallery, and these services should be isolated during data transmission to ensure communication security. WiFi6(802.11ax) has the advantages of fast transmission rate, lowenergy consumption and lowcost, and is suitable for carrying the underground pipe gallery communication service. In order to ensure the reliability of underground pipe gallery service transmission, it is necessary to study the communication isolation technology of WiFi6. In this paper, a communication isolation technology based on WiFi6 is proposed, and the communication isolation architecture of underground pipe gallery is designed to realize communication service isolation in frequency domain and spatial domain. In the frequency domain, a spectrum isolation scheme based on guardband is designed. In the spatial domain, a spatial stream isolation scheme based on service grouping is designed. Then, an isolation resource allocation method based on improved km algorithm is proposed to realize the optimization of multi-service isolation. The simulation results show that the proposed communication isolation scheme can realize the communication isolation of underground pipe gallery with lower resource cost.

关键词： Communication service isolation WiFi6 Underground pipe gallery Guardband km algorithm

来源：评论

学校读者我要写书评

暂无评论

Studies on Centroid Type-reduction algorithms for Interval Type-2 Fuzzy Logic Systems 5

Studies on Centroid Type-reduction Algorithms for Interval T...

引用

IEEE 5th International Conference on Big Data and Cloud Computing (BDCloud)

作者： Chen, Yang Wang, Dazhi Northeastern Univ Inst Elect Power Syst & Motor Drives Shenyang Peoples R China Liaoning Univ Technol Coll Sci Jinzhou Peoples R China

ISBN: (纸本)9781467371834

Type-reduction is one of the most important blocks in interval type-2 (IT2) fuzzy logic systems (FLSs). This paper investigates three types of centroid type-reduction algorithms for interval type-2 fuzzy logic systems. One is the traditional type-reduction algorithm, called Karnik Mendel (km) algorithm, and the other two are enhanced type-reduction algorithms, called enhanced Karnik Mendel (Ekm) algorithm and Enhanced Iterative algorithm with stopping condition (EIASC). According to two types of primary membership function of interval type-2 fuzzy sets, as the number of sampling points of primary variable increases, simulation results show that the defuzzified values for three types of typereduction algorithms all converge to certain values. The computational costs of these algorithms are also analyzed. Above these provide a reference to interval type-2 fuzzy logic systems designers and adopters.

关键词： interval type-2 fuzzy logic systems km algorithm Ekm algorithm EISAC simulations

来源：评论

学校读者我要写书评

暂无评论

Research on D2D Resource Allocation algorithm Based on Improved Fuzzy Clustering 10

Research on D2D Resource Allocation Algorithm Based on Impro...

引用

10th International Conference on Digital Image Processing (ICDIP)

作者： Liu, Mingshan Liu, Yang Zhou, Yuan Zhang, Wenbo Yu, Yanling Jilin Univ Coll Commun Engn Changchun 130022 Jilin Peoples R China

ISBN: (数字)9781510622005

ISBN: (纸本)9781510622005

D2D communication is widely considered as one of the key technologies in 5G communication systems. The introduction of D2D communication can improve system throughput and spectrum utilization in cellular systems. Considering the scenario that D2D users are larger than cellular users(concerts or gyms), aiming at the problem of co-channel interference caused by D2D users multiplexing uplink resources of cellular users, an improved resource allocation algorithm based on fuzzy clustering is proposed to effectively suppress interference. First, the D2D users are divided into several D2D user groups so that multiple D2D users can reuse the same CU user resources. Subsequently, on the basis of guaranteeing the QoS of cellular users and D2D users, an improved km algorithm is used to match the optimal multiplexing resources for each D2D user group. The simulation results show that the proposed algorithm can effectively reduce the interference between users, and the system throughput has been significantly improved.

关键词： D2D communication fuzzy clustering resource allocation km algorithm

来源：评论

学校读者我要写书评

暂无评论

Interference-graph and fuzzy C-means based resource allocation scheme in LTE-V2V communication networks

引用

AEU-INTERNATIONAL JOURNAL OF ELECTRONICS AND COMMUNICATIONS 2021年 142卷

作者： Liu, Zhixin Wang, Yongkang Xie, Yuan-ai Yuan, Yazhou Chan, Kit Yan Yang, Yi Ma, Kai Yanshan Univ Sch Elect Engn Qinhuangdao 066004 Hebei Peoples R China Curtin Univ Dept Elect & Comp Engn Perth WA 6102 Australia

In this paper, a framework is proposed to improve the effectiveness of the long-term-evolution vehicle-to-vehicle (LTE-V2V) communication system, where the uplink channel of the cellular user equipment (CUE) is reused by multiple V2V links. Since the orthogonal channels occupied by each CUEs are multiplexed by multiple V2V links, the serious interference is generated in the co-tier layer and cross-tier layer. In order to minimize the co-channel interference between CUE link and V2V links, an optimized resource sharing scheme is proposed. Firstly, Fuzzy C-means (FCM) algorithm is proposed to perform the clustering based on the geographical location characteristics of V2V links. In the FCM algorithm, the adjacent V2V links are grouped into a cluster to facilitate the solution of the channel allocation problem. Assuring the V2V links in the same cluster do not share the same channel, the adjacent V2V links are avoided to reuse the same channel. On this basis, the use of reasonable channel allocation scheme can effectively reduce the co-channel interference. Considering that the channel state information (CSI) of mobile links is slowly faded, the total system capacity is maximized by leveraging the CSI while the reliability can be guaranteed for all V2V links. The outage probability constraint is used to ensure the reliability of all V2V links. The channel assignment problem of V2V links is formulated as a weighted two-dimensional matching problem, and the interference bipartite graph is constructed. Finally, Kuhn Munkras (km) algorithm is introduced to allocate the uplink orthogonal channel of CUEs for the V2V links in the same class in order to maximize the total system capacity. Numerical simulation results show that the algorithm can improve the total system capacity.

关键词： Vehicular network Resource allocation FCM algorithm km algorithm Graph theory

来源：评论

学校读者我要写书评

暂无评论

A collaboration approach for cloud factories based on Kuhn-Munkras algorithm

引用

INTERNATIONAL JOURNAL OF COMPUTER INTEGRATED MANUFACTURING 2022年第9期35卷 972-988页

作者： Huo, Yunliang Xiong, Ji Guo, Zhixing Wenjun, Xiao Lei, Liang Sichuan Univ Sch Mech Engn Chengdu Peoples R China Sichuan Univ Yibin R&d Pk Yibin Peoples R China Chengdu Yigao Intelligent Technol Co Ltd Chengdu Peoples R China

Cloud manufacturing (CMfg) is a network-based and service-oriented resource-sharing manufacturing paradigm, where resources from different factories are encapsulated as services that can be jointly employed to complete manufacturing tasks. To provide an efficient collaboration strategy among the factories in CMfg, in this work, a universal framework was proposed to describe manufacturing resources under the cloud environment, in which both equipment and factory levels were considered. Moreover, a collaboration model among cloud factories was presented from the perspective of the bipartite graph. Specifically, the surplus and demands of resources were mapped to vertex vectors of the bipartite graph, respectively. Collaboration expectations of each factory, QoS (quality of service) and supply-demand balance of manufacturing capacity were evaluated as the matching degree. Furthermore, the Kuhn-Munkras(km) algorithm, which is good at bipartite graph matching, was adopted to solve the proposed model. Finally, results from simulation confirmed that the proposed method is feasible and advanced, in comparison with the current related methods.

关键词： Cloud manufacturing Cloud factory Collaboration Strategy Optimization km algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：