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

arXiv 2025年

作者： Zhang, Guangbin Wang, Yan Huang, Tianyao Eldar, Yonina C. Yangtze Delta Region Academy Beijing Institute of Technology Zhejiang Jiaxing China Radar Research Laboratory School of Information and Electronics Beijing Institute of Technology Beijing China School of Computer and Communication Engineering University of Science and Technology Beijing Beijing China Department of Computer Science and Applied Mathematics Weizmann Institute of Science Israel

We consider high angular resolution detection using distributed mobile platforms implemented with so-called partly calibrated arrays, where position errors between subarrays exist and the counterparts within each subarray are ideally calibrated. Since position errors between antenna arrays affect the coherent processing of measurements from these arrays, it is commonly believed that its angular resolution is influenced. A key question is whether and how much the angular resolution of partly calibrated arrays is affected by the position errors, in comparison with ideally calibrated arrays. To address this fundamental problem, we theoretically illustrate that partly calibrated arrays approximately achieve high angular resolution. Our analysis uses a special characteristic of Cramér-Rao lower bound (CRB) w.r.t. the source separation: When the source separation increases, the CRB first declines rapidly, then plateaus out, and the turning point is close to the angular resolution limit. This means that the turning point of CRB can be used to indicate angular resolution. We then theoretically analyze the declining and plateau phases of CRB, and explain that the turning point of CRB in partly calibrated arrays is close to the angular resolution limit of distributed arrays without errors, demonstrating high resolution ability. This work thus provides a theoretical guarantee for the high-resolution performance of distributed antenna arrays in mobile platforms. Copyright © 2025, The Authors. All rights reserved.

关键词： Source separation

来源：评论

学校读者我要写书评

暂无评论

Study and prediction of prostate cancer using fuzzy inference system

引用

Materials Today: Proceedings 2022年 56卷 157-164页

作者： Boadh, Rahul Aarya, Deo Datta Dahiya, Mamta Rathee, Rakesh Rathee, Sarita Kumar, Ajay Jain, Sarika Rajoria, Yogendra Kumar Department of the Mathematics School of Basic and Applied Science K. R. Mangalam University Sohna Road Haryana Gurugram122103 India Department of the Mathematics Acharya Narendra Dev College University of Delhi India Department of Computer Science & Engineering Faculty of Engineering and Technology Shree Guru Govind Singh Tricentenary University Haryana Gurugram122103 India University Institute of Engineering & Technology Maharshi Dayanand University Haryana 124001 Rohtak India Department of Electrical Engineering DPG Institute of Technology and Management Haryana Gurgaon122001 India Department of Mechanical Engineering Faculty of Engineering and Technology Shree Guru Govind Singh Tricentenary University Haryana Gurugram122103 India Department of Mathematics Amity School of Applied Sciences Amity University Haryana Gurugram122413 India

The essential driver of passing among men on the planet is prostate disease. In the chief stage, for early identification of the prostate disease by applying Fuzzy Inference System (FIS) has been depicted in this study. The age of the patient, Prostate Volume (PV), % Free PSA (FPSA) and Prostate Specific Antigen (PSA) are utilized as input parameters in FIS for computing the risk factor of the prostate cancer. In this study Mamdani method is used for evaluation and analysis of the Prostate Cancer Risk (PCR). The present FIS additionally required the base estimation decreases horribleness lessens dismalness, mortality and more dependable from other system. It can likewise be considered in medicine to decrease manual assignments and human mistake. This review advocate that, this FIS might consequence on work on the productivity to recognized the distinctive kind of the malignant growths just as lessening the expense of care of the patients. © 2022

关键词： Risk assessment

来源：评论

学校读者我要写书评

暂无评论

On the Uncrossed Number of Graphs

arXiv

引用

arXiv 2024年

作者： Balko, Martin Hliněný, Petr Masařík, Tomáš Orthaber, Joachim Vogtenhuber, Birgit Wagner, Mirko H. Department of Applied Mathematics Faculty of Mathematics and Physics Charles University Czech Republic Faculty of Informatics Masaryk University Brno Czech Republic Institute of Informatics Faculty of Mathematics Informatics and Mechanics University of Warsaw Poland Institute of Software Technology Graz University of Technology Austria Institute of Computer Science Osnabrück University Germany

Visualizing a graph G in the plane nicely, for example, without crossings, is unfortunately not always possible. To address this problem, Masařík and Hliněný [10] recently asked for each edge of G to be drawn without crossings while allowing multiple different drawings of G. More formally, a collection D of drawings of G is uncrossed if, for each edge e of G, there is a drawing in D such that e is uncrossed. The uncrossed number unc(G) of G is then the minimum number of drawings in some uncrossed collection of G. No exact values of the uncrossed numbers have been determined yet, not even for simple graph classes. In this paper, we provide the exact values for uncrossed numbers of complete and complete bipartite graphs, partly confirming and partly refuting a conjecture posed by Hliněný and Masařík [10]. We also present a strong general lower bound on unc(G) in terms of the number of vertices and edges of G. Moreover, we prove NP-hardness of the related problem of determining the edge crossing number of a graph G, which is the smallest number of edges of G taken over all drawings of G that participate in a crossing. This problem was posed as open by Schaefer in his book [18].MSC Codes 68R10 Copyright © 2024, The Authors. All rights reserved.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

An Efficient Solution for the Collusion Problem of DECO

An Efficient Solution for the Collusion Problem of DECO

引用

Information Security and Cryptology (ISCTURKEY), International Conference on

作者： Uğur Şen Murat Osmanoğlu Ali Aydin Selçuk Institute of Applied Mathematics Middle East Technical University Ankara Turkey Department of Computer Engineering Ankara University Ankara Turkey Department of Computer Engineering TOBB University of Economics and Technology Ankara Turkey

ISBN: (数字)9798331533649

ISBN: (纸本)9798331533656

DECO is one of the state-of-the-art TLS evidence protocols that enables privacy-preserving verification without necessitating server-side modifications. It allows applications to extract verifiable data from websites. However, DECO is vulnerable to collusion attacks, where the prover and verifier may secretly conspire, even if DECO itself remains secure. This vulnerability limits DECO's ability to transfer data to smart contracts. To address the collusion issue, decentralized oracle networks have been integrated with DECO, involving multiple executions for the same attestation and relying on majority consensus to determine the correct outcome. While this approach mitigates collusion risk, it is inefficient. In this paper, we address the collusion vulnerability in DECO by proposing an enhanced approach that expands the verifier's role to a set of $n$ verifiers within a single DECO execution, utilizing a Distributed Verifiable Random Function (DVRF). This method requires the prover to obtain consensus from all $n$ verifiers, thereby increasing the difficulty of collusion and enhancing the security of the system. Furthermore, the proposed solution is more efficient than executing $n$ separate DECO protocols and provides verifiable features that facilitate integration with slashing and reward mechanisms, thereby improving its applicability in decentralized systems.

关键词： Smart contracts Blockchains Security Data mining Interoperability

来源：评论

学校读者我要写书评

暂无评论

Reschedulable Task Allocation Strategy in Cloud-Edge-End Cooperative Mobile Crowd Sensing

Reschedulable Task Allocation Strategy in Cloud-Edge-End Coo...

引用

IEEE International Conference on Communications (ICC)

作者： Haifeng Jiang Shuhao Wang Chaogang Tang Huaming Wu Ruidong Li School of Computer Science and Technology China University of Mining and Technology Xuzhou China The Center for Applied Mathematics Tianjin University Tianjin China The Institute of Science and Engineering Kanazawa University Kanazawa Japan

ISBN: (数字)9781728190549

ISBN: (纸本)9781728190556

In centralized mobile crowd sensing (MCS), the cloud platform assigns all the tasks to participants every time. Since the cloud platform consumes a lot of computing and communication resources to provide services for participants, it will bring about high communication delay and request congestion. The cloud-edge-end architecture for service provisioning has aroused extensive attention recently, owing to its advantages in resource provisioning in close proximity to the resource requestors. Despite the advantages of this architecture, we also observe that it cannot dynamically adjust the allocation scheme when the corresponding computing services are not available to the participants after the initial task allocation. To address this issue, we put forward a re-schedulable task allocation approach in the cloud-edge-end architecture. We aim to improve the efficiency of task execution such as the maximization of task completion rate, while considering service types provided by edge servers and multiple constraints such as resource balancing on the edge servers and deadlines for the task responses. An improved Grey Wolf Optimization (GWO) algorithm is adopted for task rescheduling in this paper. Simulation results indicate that the proposed algorithm performs well in terms of task completion rates and task average response time.

关键词： Energy consumption Simulation computer architecture Sensors Delays Resource management Servers

来源：评论

学校读者我要写书评

暂无评论

Price Prediction of Seasonal Items Using Time Series Analysis

引用

computer Systems Science & Engineering 2023年第7期46卷 445-460页

作者： Ahmed Salah Mahmoud Bekhit Esraa Eldesouky Ahmed Ali Ahmed Fathalla Faculty of Computers and Informatics Zagazig UniversitySharkeya44523Egypt Information Technology Department the University of Technology and Applied SciencesIbriOman School of Electrical and Data Engineering University of Technology SydneySydney2007Australia College of Computer Engineering and Sciences Prince Sattam Bin Abdulaziz UniversityAl-Kharj11942Saudi Arabia Computer Science Department Faculty of Computers and InformaticsSuez Canal UniversityIsmailia41522Egypt Higher Future Institute for Specialized Technological Studies Cairo3044Egypt Department of Mathematics Faculty of ScienceSuez Canal UniversityIsmailia41522Egypt

The price prediction task is a well-studied problem due to its impact on the business *** are several research studies that have been conducted to predict the future price of items by capturing the patterns of price change,but there is very limited work to study the price prediction of seasonal goods(e.g.,Christmas gifts).Seasonal items’prices have different patterns than normal items;this can be linked to the offers and discounted prices of seasonal *** lack of research studies motivates the current work to investigate the problem of seasonal items’prices as a time series *** proposed utilizing two different approaches to address this problem,namely,1)machine learning(ML)-based models and 2)deep learning(DL)-based ***,this research tuned a set of well-known predictive models on a real-life *** models are ensemble learning-based models,random forest,Ridge,Lasso,and Linear ***,two new DL architectures based on gated recurrent unit(GRU)and long short-term memory(LSTM)models are ***,the performance of the utilized ensemble learning and classic ML models are compared against the proposed two DL architectures on different accuracy metrics,where the evaluation includes both numerical and visual comparisons of the examined *** obtained results show that the ensemble learning models outperformed the classic machine learning-based models(e.g.,linear regression and random forest)and the DL-based models.

关键词： Deep learning price prediction seasonal goods time series analysis

来源：评论

学校读者我要写书评

暂无评论

Joint Optimization of Service Caching Task Offloading and Resource Allocation in Cloud-Edge Cooperative Network

Joint Optimization of Service Caching Task Offloading and Re...

引用

IEEE International Conference on Communications (ICC)

作者： Chaogang Tang Yao Ding Shuo Xiao Huaming Wu Ruidong Li School of Computer Science and Technology China University of Mining and Technology Xuzhou China The Center for Applied Mathematics Tianjin University Tianjin China The Institute of Science and Engineering Kanazawa University Kanazawa Japan

ISBN: (数字)9781728190549

ISBN: (纸本)9781728190556

The cloud-edge cooperative network presents both opportunities and challenges for latency-sensitive and computation-intensive tasks. Effectively harnessing the strengths of edge computing and cloud computing enables real-time task handling, thus reaching a win-win situation where not only the stated quality of service (QoS) is delivered from the angle of service providers, but also the quality of experience (QoE) is improved from the angle of service requestors. However, due to the unpredictable task generation and time-varying environments, it is challenging to achieve optimal task scheduling and effective resource management and allocation. To address this issue, we propose an innovative cloud-edge framework that incorporates task offloading, service caching, and resource allocation in this paper. In this framework, we can determine where to offload the task, e.g., locally, at the edge, or in the cloud center. In view of the importance of the superior user experience, we aim to maximize the user satisfaction regarding task offloading in this framework. The problem is actually a mixed-integer nonlinear programming (MINLP) problem that entails simultaneously addressing cache decisions, offloading decisions, and resources allocation in a dynamic cloud-edge computing system. Owing to the NP-hardness, our original problem is decomposed into two layers of alternating problems. Specifically, we adopt a genetic algorithm (GA) based approach to jointly make cache and offloading decisions, and then iteratively optimize the communication and computing resources allocation. Extensive experimentation has demonstrated the feasibility and effectiveness of the proposed approach.

关键词： Cloud computing Quality of service Cooperative systems User experience Real-time systems Resource management Quality of experience

来源：评论

学校读者我要写书评

暂无评论

Collaborative Task Offloading with Digital Twin in Multi-Vehicle and Multi-Edge Environments

Collaborative Task Offloading with Digital Twin in Multi-Veh...

引用

IEEE Conference on Global Communications (GLOBECOM)

作者： Anqi Gu Huaming Wu Yixiao Wang Ruidong Li Chaogang Tang Center for Applied Mathematics Tianjin University Tianjin China Institute of Science and Engineering Kanazawa University Kanazawa Japan School of Computer Science and Technology China University of Mining and Technology Xuzhou China

ISBN: (数字)9798350351255

ISBN: (纸本)9798350351262

In recent years, the effective utilization of edge servers to assist vehicles in handling compute-intensive and latency-sensitive tasks has emerged as a pivotal concern in Vehicular Edge Computing (VEC). In this paper, we adopt a cooperative approach that leverages the collective capabilities of multiple edge servers. This strategy is designed to effectively manage tasks and alleviate the computational burden imposed on these servers. Specifically, Graph Neural Network (GNN) is applied to extract and classify features such as the geographical locations and communication statuses of multiple edge servers, enabling the selection of the most suitable servers for collaborative task execution. We have utilized solar energy for local computing, effectively achieving environmental protection and reducing the local energy burden on vehicles. Moreover, a novel edge attraction formula is defined to refine the rationality of clustering. In addition, Deep Reinforcement Learning (DRL) is employed to make real-time offloading decisions. To ensure experimental accuracy while mitigating costs, we establish a corresponding digital twin environment to acquire experimental data. By conducting a comparative analysis against three other baseline methods, we effectively reduce task completion time and thus meet the stringent demands of time-sensitive tasks.

关键词： Costs Simulation Collaboration Solar energy Feature extraction Graph neural networks Real-time systems Digital twins Servers Protection

来源：评论

学校读者我要写书评

暂无评论

Negative result about the construction of genuinely entangled subspaces from unextendible product bases

引用

Physical Review A 2022年第1期106卷 012442-012442页

作者： Maciej Demianowicz Institute of Physics and Applied Computer Science Faculty of Applied Physics and Mathematics Gdańsk University of Technology Narutowicza 11/12 Gdańsk 80-233 Poland

Unextendible product bases (UPBs) provide a versatile tool with various applications across different areas of quantum information theory. Their comprehensive characterization is thus of great importance and has been a subject of vital interest for over two decades now. An open question asks about the existence of UPBs, which are genuinely unextendible, i.e., they are not extendible even with biproduct vectors. In other words, the problem is to verify whether there exist genuinely entangled subspaces (GESs), subspaces composed solely of genuinely multiparty entangled states, complementary to UPBs. We solve this problem in the negative for many sizes of UPBs in different multipartite scenarios. In particular, in the all-important case of equal local dimensions, we show that there are always forbidden cardinalities for such UPBs, including the minimal ones corresponding to GESs of the maximal dimensions.

关键词： Nonlocality Quantum entanglement Quantum information theory

来源：评论

学校读者我要写书评

暂无评论

An Improved Algorithm for Finding Maximum Outerplanar Subgraphs

arXiv

引用

arXiv 2023年

作者： Calinescu, Gruia Kaul, Hemanshu Kudarzi, Bahareh Department of Computer Science Illinois Institute of Technology ChicagoIL60616 United States Department of Applied Mathematics Illinois Institute of Technology ChicagoIL60616 United States

We study the NP-complete Maximum Outerplanar Subgraph problem. The previous best known approximation ratio for this problem is 2/3. We propose a new approximation algorithm which improves the ratio to 7/10. © 202... 详细信息

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：