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

45th International Symposium on Mathematical Foundations of computer Science, MFCS 2020

作者： Deligkas, Argyrios Mertzios, George B. Spirakis, Paul G. Zamaraev, Viktor Department of Computer Science Royal Holloway University of London Egham United Kingdom Department of Computer Science Durham University United Kingdom Department of Computer Science University of Liverpool United Kingdom Computer Engineering and Informatics Department University of Patras Greece

ISBN: (纸本)9783959771597

In this paper we consider the following total functional problem: Given a cubic Hamiltonian graph G and a Hamiltonian cycle C0 of G, how can we compute a second Hamiltonian cycle C1 ≠ C0 of G? Cedric Smith and William Tutte proved in 1946, using a non-constructive parity argument, that such a second Hamiltonian cycle always exists. Our main result is a deterministic algorithm which computes the second Hamiltonian cycle in O(n·20.299862744n) = O(1.23103n) time and in linear space, thus improving the state of the art running time of O∗(20.3n) = O(1.2312n) for solving this problem (among deterministic algorithms running in polynomial space). Whenever the input graph G does not contain any induced cycle C6 on 6 vertices, the running time becomes O(n·20.2971925n) = O(1.22876n). Our algorithm is based on a fundamental structural property of Thomason's lollipop algorithm, which we prove here for the first time. In the direction of approximating the length of a second cycle in a (not necessarily cubic) Hamiltonian graph G with a given Hamiltonian cycle C0 (where we may not have guarantees on the existence of a second Hamiltonian cycle), we provide a linear-time algorithm computing a second cycle with length at least n − 4α(√n + 2α) + 8, where α = ∆-2/δ−2 and δ, ∆ are the minimum and the maximum degree of the graph, respectively. This approximation result also improves the state of the art. © Nathalie Bertrand;licensed under Creative Commons License CC-BY 45th International Symposium on Mathematical Foundations of computer Science (MFCS 2020).

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

An Optimized Approach to Hourly Temperature and Humidity Setpoint Generation for Reducing Tomato Disease and Saving Power Cost in Greenhouses

SSRN

引用

SSRN 2024年

作者： Sánchez-Molina, Jorge Antonio Wang, Hui Laktionov, Ivan Díaz, Francisco Rodríguez Li, Ming BIPP Institute of Plant Protection Beijing Academy of Agriculture and Forestry Sciences Beijing100097 China Department of Computer Systems Software Dnipro University of Technology DniproUA49005 Ukraine Department of Informatics University of Almería ceiA3 CIESOL Almería04120 Spain Beijing Research Center for Information Technology in Agriculture National Engineering Research Centre for Information Technology in Agriculture National Engineering Laboratory for Agri-product Quality Traceability Key Laboratory of Agri-informatics Ministry of Agriculture Beijing100097 China

Grey leaf spot is a main leaf disease of tomato in Mediterranean greenhouses, characterized by warm temperatures and high humidity during the spring and winter seasons, hence suitable for pathogen infection and spore spread. Consequently, the utilization of automatic control and optimization algorithms has emerged as effective means to prevent chemical-oriented disease control and enhancing the overall quality and safety of food and crops. The aim of this work is to search an optimal strategy for precision management on greenhouse tomato growth environment. So, multi-objective optimization rises to an alternative to achieve this goal. While there were lots of research on determining trajectories to control a desired crop growth, and lacking works that optimize climate conditions for restraining the damage of disease on crop. Based on the multi-objective genetic algorithm optimization method (MOGA), the solution balances the conflict of two objectives: minimum power cost caused by climate control and maximum health leaves with few effects of grey leaf spot. This study also highlights disease and high temperature impact on tomato growth, which are as inequality constraints of the optimization problems. The results showed MOGA strategy performers good, the minimum power cost is only need 0.084€*day-1 in warm weather condition, as well as 3.74 €*day-1 in cold weather condition, the uninfected LAI (m2[Leaves](m-2[soils]*day-1)) is the range of [0.14 0.20]. The yearly power cost at least [308 1365]€.These are able to embed within a control scheme for achieving optimization purpose. The farmer receives the data necessary for decision-making to establish the setpoints during the crop cycle, modifying the control decisions, lowering production costs, reducing the use of pesticides and increasing the system efficiency to optimize crop growth. © 2024, The Authors. All rights reserved.

关键词： Crops

来源：评论

学校读者我要写书评

暂无评论

On the Hardware Implementation Performance, of Face Recognition Techniques, for Digital Forensics 7th

On the Hardware Implementation Performance, of Face Recognit...

引用

7th International Symposium on Security in Computing and Communications, SSCC 2019

作者： Pantopoulou, Maria Sklavos, Nicolas Ognjanovic, Ivana SCYTALE Group Computer Engineering and Informatics Department University of Patras Patras Greece University of Donja Gorica Podgorica Montenegro

ISBN: (纸本)9789811548246

As face recognition systems constitute a very useful tool in the sector of Digital Forensics, they should provide accurate and fast results. Although several software implementations for face recognition exist, they are unable to achieve high recognition rate in reasonable time, due to the complex and numerous needed calculations. As a result, there is an on-going research in low-cost hardware implementations, especially based on Field Programmable Gate Arrays (FPGAs), in order to reduce the processing time and the false alarm identification rate. In this work, we introduce the fundamental of algorithms, for face recognition, such as Principal Components Analysis (PCA), and its modified methods, as well as the Local Binary Pattern (LBP). These approaches are applied in different architectures, and alternative FPGA implementations are introduced. We also present implementation synthesis results, based on the recognition time and the allocated hardware resources. © Springer Nature Singapore Pte Ltd. 2020.

关键词： Face recognition

来源：评论

学校读者我要写书评

暂无评论

Applying classical control techniques to quantum systems: entanglement versus stability margin and other limitations

Applying classical control techniques to quantum systems: en...

引用

IEEE Conference on Decision and Control

作者： C. A. Weidner S. G. Schirmer F. C. Langbein E. Jonckheere H. H. Wills Physics Laboratory and Department of Electrical and Electronic Engineering Quantum Engineering Technology Laboratories University of Bristol United Kingdom Faculty of Science & Engineering Swansea University Swansea UK School of Computer Science and Informatics Cardiff University Cardiff UK Department of Electrical and Computer Engineering University of Southern California Los Angeles CA USA

ISBN: (数字)9781665467612

ISBN: (纸本)9781665467629

Development of robust quantum control has been challenging and there are numerous obstacles to applying classical robust control to quantum system including bilinearity, marginal stability, state preparation errors, nonlinear figures of merit. The requirement of marginal stability, while not satisfied for closed quantum systems, can be satisfied for open quantum systems where Lindbladian behavior leads to non-unitary evolution, and allows for nonzero classical stability margins, but it remains difficult to extract physical insight when classical robust control tools are applied to these systems. We consider a straightforward example of the entanglement between two qubits dissipatively coupled to a lossy cavity and analyze it using the classical stability margin and structured perturbations. We attempt, where possible, to extract physical insight from these analyses. Our aim is to highlight where classical robust control can assist in the analysis of quantum systems and identify areas where more work needs to be done to develop specific methods for quantum robust control.

关键词： Robust control Quantum system Perturbation methods Qubit Stability analysis Behavioral sciences

来源：评论

学校读者我要写书评

暂无评论

Comparative Analysis of Various Image Splicing Algorithms 8th

Comparative Analysis of Various Image Splicing Algorithms

引用

8th International Workshop on Soft Computing Applications, SOFA 2018

作者： ur Rhhman, Hafiz Arif, Muhammad Ullah, Anwar Al-Azani, Sadam Balas, Valentina Emilia Geman, Oana Khan, Muhammad Jalal Islam, Umar School of Computer Science and Educational Software Guangzhou University Guangzhou510006 China Wollongong Joint Institute Central China Normal University WuhanHubei China Department of Information and Computer Science King Fahd University of Petroleum and Minerals Dhahran Saudi Arabia Department of Automatics and Applied Informatics Aurel Vlaicu University of Arad Arad Romania Faculty of Electrical Engineering and Computer Science University Suceava Suceava Romania Department of Computer Science COMSATS University Abbottabad Abbottabad Pakistan

ISBN: (纸本)9783030521899

Daily millions of images are uploaded and download to the web, as a result the data is available in the paperless form in the computer system for organization. Nowadays, with the help of powerful computer software such as Photoshop and Corel Draw, it is very easy to alter the contents of the authenticated image without leaving any clues. This led to a big problem due to the negative impact of image splicing. It is highly recommended to develop image tampering detection technique to recognize the authentic and temper images. In this paper, we propose an enhanced technique for blind images splicing by combing Discrete Cosine Transform Domain (DTC) and Markov feature in the spatial domain. Moreover, Principal Component Analysis (PCA) is used to select the most significant features. Finally, Support Vector Machine (SVM) is applied to classify the image as being tempered or genuine on the publicly available dataset using ten-fold cross-validation. By applying different statistical techniques, the results showed that the proposed technique performs better than other available detection techniques in the literature. © 2021, Springer Nature Switzerland AG.

关键词： Principal component analysis

来源：评论

学校读者我要写书评

暂无评论

Social Welfare Maximization in Cross-Silo Federated Learning

arXiv

引用

arXiv 2022年

作者： Chen, Jianan Hu, Qin Jiang, Honglu Department of Computer and Information Science Indiana University Purdue University Indianapolis IndianapolisIN United States Department of Informatics and Engineering Systems The University of Texas Rio Grande Valley BrownsvilleTX United States

As one of the typical settings of Federated Learning (FL), cross-silo FL allows organizations to jointly train an optimal Machine Learning (ML) model. In this case, some organizations may try to obtain the global model without contributing their local training, lowering the social welfare. In this paper, we model the interactions among organizations in cross-silo FL as a public goods game for the first time and theoretically prove that there exists a social dilemma where the maximum social welfare is not achieved in Nash equilibrium. To overcome this social dilemma, we employ the Multi-player Multi-action Zero-Determinant (MMZD) strategy to maximize the social welfare. With the help of the MMZD, an individual organization can unilaterally control the social welfare without extra cost. Experimental results validate that the MMZD strategy is effective in maximizing the social welfare. Copyright © 2022, The Authors. All rights reserved.

关键词： Game theory

来源：评论

学校读者我要写书评

暂无评论

Parameterized Complexity of Binary CSP: Vertex Cover, Treedepth, and Related Parameters

arXiv

引用

arXiv 2022年

作者： Bodlaender, Hans L. Groenland, Carla Pilipczuk, Michal Department of Information and Computing Sciences Utrecht University Netherlands Faculty of Electrical Engineering Mathematics and Computer Science Technical University Delft Netherlands Institute of Informatics University of Warsaw Poland

We investigate the parameterized complexity of Binary CSP parameterized by the vertex cover number and the treedepth of the constraint graph, as well as by a selection of related modulator-based parameters. The main findings are as follows: Binary CSP parameterized by the vertex cover number is W[3]-complete. More generally, for every positive integer d, Binary CSP parameterized by the size of a modulator to a treedepth-d graph is W[2d + 1]-complete. This provides a new family of natural problems that are complete for odd levels of the W-hierarchy. We introduce a new complexity class XSLP, defined so that Binary CSP parameterized by treedepth is complete for this class. We provide two equivalent characterizations of XSLP: the first one relates XSLP to a model of an alternating Turing machine with certain restrictions on conondeterminism and space complexity, while the second one links XSLP to the problem of model-checking first-order logic with suitably restricted universal quantification. Interestingly, the proof of the machine characterization of XSLP uses the concept of universal trees, which are prominently featured in the recent work on parity games. We describe a new complexity hierarchy sandwiched between the W-hierarchy and the A-hierarchy: For every odd t, we introduce a parameterized complexity class S[t] with W[t] ⊆ S[t] ⊆ A[t], defined using a parameter that interpolates between the vertex cover number and the treedepth. We expect that many of the studied classes will be useful in the future for pinpointing the complexity of various structural parameterizations of graph *** Codes 68Q15 © 2022, CC BY.

关键词： Constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Energy optimization in massive MIMO UAV-aided MEC-enabled vehicular networks

arXiv

引用

arXiv 2021年

作者： Michailidis, Emmanouel T. Miridakis, Nikolaos I. Michalas, Angelos Skondras, Emmanouil Vergados, Dimitrios J. Vergados, Dimitrios D. Department of Electrical and Electronics Engineering University of West Attica Egaleo12241 Greece Department of Informatics and Computer Engineering University of West Attica Egaleo12243 Greece Department of Electrical and Computer Engineering University of Western Macedonia Kozani50131 Greece Department of Informatics University of Piraeus Piraeus18534 Greece Department of Informatics University of Western Macedonia Kastoria52100 Greece Department of Informatics University of Piraeus Piraeus18534 Greece

This paper presents a novel unmanned aerial vehicle (UAV)-aided mobile edge computing (MEC) architecture for vehicular networks. It is considered that the vehicles should complete latency-critical computation-intensive tasks either locally with on-board computation units or by offloading part of their tasks to road side units (RSUs) with collocated MEC servers. In this direction, a hovering UAV can serve as an aerial RSU (ARSU) for task processing or act as an aerial relay and further offload the computation tasks to a ground RSU (GRSU). In order to significantly reduce the delay during data offloading and downloading, this architecture relies on the benefits of massive multiple-input–multiple-output (MIMO). Therefore, it is considered that the vehicles, the ARSU, and the GRSU employ large-scale antennas. A three-dimensional (3-D) geometrical representation of the MEC-enabled network is introduced and an optimization method is proposed that minimizes the weighted total energy consumption (WTEC) of the vehicles and ARSU subject to transmit power allocation, task allocation, and timeslot scheduling. The numerical results verify the theoretical derivations, emphasize on the effectiveness of the massive MIMO transmission, and provide useful engineering insights. Copyright © 2021, The Authors. All rights reserved.

关键词： Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

CNN to BiLSTM: Enhancing Setswana Named Entity Recognition 20th

CNN to BiLSTM: Enhancing Setswana Named Entity Recognition

引用

20th International Conference on Data Science, ICDATA 2024, held as part of the World Congress in computer Science, computer engineering and Applied Computing, CSCE 2024

作者： Chabalala, Shumile Owolawi, Pius Ojo, Sunday Department of Computer Systems Engineering Faculty of Information and Communication Technology Tshwane University of Technology Block K 2 Aubrey Matlakala St Soshanguve - K Soshanguve0152 South Africa Department of Information Technology Faculty of Accounting and Informatics Durban University of Technology Ritson Campus Durban4000 South Africa

ISBN: (纸本)9783031858550

In order to handle Named entity recognition (NER) in the Setswana language, this study applies transfer learning from convolutional neural networks (CNN) to bidirectional long short-term memory (BiLSTM) networks. We propose a transfer learning approach that leverages an existing CNN model trained to detect features in Setswana text data. Then, utilizing these attributes, a BiLSTM model specifically designed for NER is updated with the goal of improving performance and overcoming Setswana's lack of annotated data. Our study on Setswana NER corpora shows the effectiveness of this transfer learning method by outperforming conventional NER models. The new model has an improved F1-Score of 96% over the existing ones. This research contributes to the expansion of NER methods for languages with low resources. © The Author(s) 2025.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

Enhancing Efficiency in Vision Transformer Networks: Design Techniques and Insights

arXiv

引用

arXiv 2024年

作者： Heidari, Moein Azad, Reza Kolahi, Sina Ghorbani Arimond, René Niggemeier, Leon Sulaiman, Alaa Bozorgpour, Afshin Aghdam, Ehsan Khodapanah Kazerouni, Amirhossein Hacihaliloglu, Ilker Merhof, Dorit School of Biomedical Engineering University of British Columbia BC Canada Faculty of Electrical Engineering and Information Technology RWTH Aachen University Aachen Germany Department of Industrial and Systems Engineering Tarbiat Modares University Tehran Iran Faculty of Information Science and Technology Universiti Kebangsaan Bangi Malaysia Faculty of Informatics and Data Science University of Regensburg Regensburg Germany Department of Electrical Engineering Shahid Beheshti University Tehran Iran Department of Computer Science University of Toronto Toronto Canada Department of Radiology Department of Medicine University of British Columbia BC Canada Fraunhofer Institute for Digital Medicine MEVIS Bremen Germany

Intrigued by the inherent ability of the human visual system to identify salient regions in complex scenes, attention mechanisms have been seamlessly integrated into various computer Vision (CV) tasks. Building upon this paradigm, Vision Transformer (ViT) networks exploit attention mechanisms for improved efficiency. This review navigates the landscape of redesigned attention mechanisms within ViTs, aiming to enhance their performance. This paper provides a comprehensive exploration of techniques and insights for designing attention mechanisms, systematically reviewing recent literature in the field of CV. This survey begins with an introduction to the theoretical foundations and fundamental concepts underlying attention mechanisms. We then present a systematic taxonomy of various attention mechanisms within ViTs, employing redesigned approaches. Amulti-perspective categorization is proposed based on their application, objectives, and the type of attention applied. The analysis includes an exploration of the novelty, strengths, weaknesses, and an in-depth evaluation of the different proposed strategies. This culminates in the development of taxonomies that highlight key properties and contributions. Finally, we gather the reviewed studies along with their available open-source implementations at our *** aim to regularly update it with the most recent relevant papers. © 2024, CC BY-NC-SA.

关键词： computer vision

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：