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

International Scientific-Professional Conference on Information Technology (IT)

作者： Kamran Javidi Maria G. Martini Peter A. Kara Department of Computer Science Wireless Multimedia and Networking Research Group School of Computer Science and Mathematics Faculty of Engineering Computing and the Environment Kingston University Penrhyn Road Campus Kingston upon Thames London UK Department of Networked Systems and Services Faculty of Electrical Engineering and Informatics Budapest University of Technology and Economics Budapest Hungary

Light field visualization commonly provides a single content over the entire field of view. However, the angularly-selective nature of the technology enables the simultaneous visualization of different contents at different viewing angles. Yet segmenting the valid viewing area comes with content interference as well in forms of separation zones, resulting invalid viewing domains. In this paper, we introduce a study on the separation zone of split-domain light field visualization. We created a static-content-based scenario in which we split the valid viewing area into two distinct domains, with a separation zone in between them. This was achieved by merging two light field contents in the middle with an instantaneous switch. The resulting visualization on a light field display was captured by a DSLR camera from two viewing distances, and it was compared to the crosstalk effect caused by insufficient angular resolution.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A provable-secure and practical two-party distributed signing protocol for SM2 signature algorithm

引用

Frontiers of computer Science 2020年第3期14卷 203-215页

作者： Yudi ZHANG Debiao HE Mingwu ZHANG Kim-Kwang Raymond CHOO Key Laboratory of Aerospace Information Security and Trusted Computing of Ministry of Education School of Cyber Science and EngineeringWuhan UniversityWuhan 430072China School of Computer Sciences Hubei University of TechnologyWuhan 430068China Department of Information Systems and Cyber Security and Department of Electrical and Computer Engineering University of Texas at San AntonioSan AntonioTX 78249USA

Mobile devices are widely used for data access,communications and ***,storing a private key for signature and other cryptographic usage on a single mobile device can be challenging,due to its computational ***,a number of(t,n)threshold secret sharing schemes designed to minimize private key from leakage have been proposed in the ***,existing schemes generally suffer from key reconstruction *** this paper,we propose an efficient and secure two-party distributed signing protocol for the SM2 signature *** latter has been mandated by the Chinese government for all electronic commerce *** proposed protocol separates the private key to storage on two devices and can generate a valid signature without the need to reconstruct the entire private *** prove that our protocol is secure under nonstandard ***,we implement our protocol using MIRACL Cryptographic SDK to demonstrate that the protocol can be deployed in practice to prevent key disclosure.

关键词： SM2 signature two-party signing wireless environment provable security threshold secret sharing

来源：评论

学校读者我要写书评

暂无评论

A Generalized Tensor Formulation for Hyperspectral Image Super-Resolution Under General Spatial Blurring

arXiv

引用

arXiv 2024年

作者： Wang, Yinjian Li, Wei Gui, Yuanyuan Du, Qian Fowler, James E. The School of Information and Electronics Beijing Institute of Technology Beijing Key Laboratory of Fractional Signals and Systems Beijing100081 China The Department of Electrical and Computer Engineering Mississippi State University StarkvilleMS39762 United States

Hyperspectral super-resolution is commonly accomplished by the fusing of a hyperspectral imaging of low spatial resolution with a multispectral image of high spatial resolution, and many tensor-based approaches to this task have been recently proposed. Yet, it is assumed in such tensor-based methods that the spatial-blurring operation that creates the observed hyperspectral image from the desired super-resolved image is separable into independent horizontal and vertical blurring. Recent work has argued that such separable spatial degradation is ill-equipped to model the operation of real sensors which may exhibit, for example, anisotropic blurring. To accommodate this fact, a generalized tensor formulation based on a Kronecker decomposition is proposed to handle any general spatial-degradation matrix, including those that are not separable as previously assumed. Analysis of the generalized formulation reveals conditions under which exact recovery of the desired super-resolved image is guaranteed, and a practical algorithm for such recovery, driven by a blockwise-group-sparsity regularization, is proposed. Extensive experimental results demonstrate that the proposed generalized tensor approach outperforms not only traditional matrix-based techniques but also state-of-the-art tensor-based methods;the gains with respect to the latter are especially significant in cases of anisotropic spatial blurring. Copyright © 2024, The Authors. All rights reserved.

关键词： Tensors

来源：评论

学校读者我要写书评

暂无评论

RECURSIVE DISENTANGLEMENT NETWORK 10

RECURSIVE DISENTANGLEMENT NETWORK

引用

10th International Conference on Learning Representations, ICLR 2022

作者： Chen, Yixuan Shi, Yubin Li, Dongsheng Wang, Yujiang Dong, Mingzhi Zhao, Yingying Dick, Robert Lv, Qin Yang, Fan Shang, Li China and Shanghai Key Laboratory of Data Science School of Computer Science Fudan University Shanghai China Microsoft Research Asia Shanghai China Department of Computing Imperial College London London United Kingdom Department of Electrical Engineering and Computer Science University of Michigan Michigan United States Department of Computer Science University of Colorado Boulder Boulder United States School of Microelectronics Fudan University Shanghai China

Disentangled feature representation is essential for data-efficient learning. The feature space of deep models is inherently compositional. Existing β-VAE-based methods, which only apply disentanglement regularization to the resulting embedding space of deep models, cannot effectively regularize such compositional feature space, resulting in unsatisfactory disentangled results. In this paper, we formulate the compositional disentanglement learning problem from an information-theoretic perspective and propose a recursive disentanglement network (RecurD) that propagates regulatory inductive bias recursively across the compositional feature space during disentangled representation learning. Experimental studies demonstrate that RecurD outperforms β-VAE and several of its state-of-the-art variants on disentangled representation learning and enables more data-efficient downstream machine learning tasks. © 2022 ICLR 2022 - 10th International Conference on Learning Representationss. All rights reserved.

关键词： Information theory

来源：评论

学校读者我要写书评

暂无评论

Analytical Model of Nonlinear Fiber Propagation for General Dual-Polarization Four-Dimensional Modulation Formats

arXiv

引用

arXiv 2023年

作者： Liang, Zhiwei Chen, Bin Lei, Yi Liga, Gabriele Alvarado, Alex School of Computer Science and Information Engineering Hefei University of Technology Hefei China Intelligent Interconnected Systems Laboratory of Anhui Province China Department of Electrical Engineering Eindhoven University of Technology Eindhoven Netherlands

Coherent dual-polarization (DP) optical transmission systems encode information on the four available degrees of freedom of an optical field: the two polarization states, each with two quadrature components. Such systems naturally operate based on a four-dimensional (4D) signal space. Having a general analytical model to accurately estimate nonlinear interference (NLI) is key to analyze such transmission systems as well as to study how different DP-4D formats are affected by NLI. However, the available models in the literature are not completely general. They either do not apply to the entire DP-4D formats or do not consider all the NLI contributions. In this paper, we develop a model that applies to all DP-4D modulation formats with independent symbols. Our model takes self-channel interference, cross-channel interference and multiple-channel interference effects into account. As an application of our model, we further study the effects of signal-noise interactions in long-haul transmission via the proposed model. When compared to previous results in the literature, our model is more accurate at predicting the contribution of NLI for both low and high dispersion fibers in single- and multi-channel transmission systems. For the NLI, we report an average gap from split step Fourier simulation results below 0.15 dB. The simulation results further show that by considering signal-noise interactions, the proposed model in long-haul transmission can reduce the transmission reach prediction error by 4%. © 2023, CC BY-NC-SA.

关键词： Optical fiber communication

来源：评论

学校读者我要写书评

暂无评论

Dermoscopic Image Classification Using Attention Mechanism and Ensemble Learning Approaches

Dermoscopic Image Classification Using Attention Mechanism a...

引用

2023 IEEE International Conference on Big Data, BigData 2023

作者： Huang, Shanchuan Lei, Hongwei Jin, Liuhan Yang, Jinzhu Jiang, Tao Yao, Yudong Grzegorzek, Marcin Li, Chen Northeastern University Microscopic Image and Medical Image Analysis Group College of Medicine and Biological Information Engineering China Northeastern University Key Laboratory of Intelligent Computing in Medical Image Ministry of Education Liaoning Shenyang China Chengdu University of Traditional Chinese Medicine School of Intelligent Medicine Chengdu China Stevens Institute of Technology Department of Electrical and Computer Engineering United States Institute of Medical Informatics University of Luebeck Luebeck Germany

ISBN: (纸本)9798350324457

Background and purpose: Skin tumours have become one of the most common diseases worldwide. While benign ones are not usually a threat to human health, malignant ones can develop into skin cancer and become life-threatening if left untreated. Early detection of the disease is important for the treatment of patients with skin tumours and dermoscopy is the most effective means of diagnosing skin tumours. However, the complexity of skin tumour cells makes the diagnosis somewhat erroneous for doctors. Therefore, a dermoscopic classification network based on deep learning and computer-aided diagnostic techniques is needed to obtain a high diagnostic accuracy rate for skin tumours. Methods: In this paper, Deep-skin, a model for dermoscopic image classification is proposed, which is based on both attention mechanism and ensemble learning. Considering the characteristics of dermoscopic images, embedding different attention mechanisms on top of Inception-V3 has been suggested to obtain more potential features. We then improve the classification performance by late fusion of the different models. To demonstrate the effectiveness of Deep-skin, experiments and evaluations are performed on the publicly available dataset Skin Cancer: Malignant vs. Benign and compare the performance of Deep-skin with other classification models. Results: The experimental results indicate that Deep-skin performs well on the dataset in comparison to other models, achieving a maximum accuracy of 87.8%.Conclusion: In this paper, the Deep-skin model is proposed for the classification of dermoscopic images and has shown better performance. In the future, we intend to investigate better classification models for automatic diagnosis of skin tumours. Such models can potentially assist physicians and patients in clinical settings. © 2023 IEEE.

关键词： Attention mechanism Ensemble learning Image classification Late fusion Skin Cancer

来源：评论

学校读者我要写书评

暂无评论

A Dementia Diagnosis Technique Based on AI and Hardware Acceleration

A Dementia Diagnosis Technique Based on AI and Hardware Acce...

引用

Artificial Intelligence, Blockchain, and Internet of Things (AIBThings), IEEE International Conference on

作者： Kasem Khalil Mohammad M. R. Khan Mamun Ahmed Sherif Mohamed Elsersy Ahmad Abdel-Aliem Imam Kamal Abouzaid Electrical and Computer Engineering Department University of Mississippi MS USA Electrical and Computer Engineering Department Tennessee Technological University TN USA School of Computing Sciences and Computer Engineering University of Southern Mississippi MS USA Computer and Information Systems Dept. Higher Colleges of Technology AlAin Abu Dhabi UAE College of Osteopathic Medicine William Carey University Mississippi MS USA

The effects of Alzheimer’s disease (AD) are devastating, both personally and within the patient’s family, as the disease progresses slowly over many years. It could significantly affect illness consequences and outcomes if detected early and accurately. Non-invasive medical testing often uses blood bio-samples because they are easy to collect and relatively cheap to analyze. This paper proposes a federated learning (FL)-based diagnostic model for AD using blood bio-samples. We have used blood bio-sample data sets downloaded from the ADNI website to test and compare the efficacy of our models. According to the enormous data collected for early AD detection, we used a hardware acceleration scheme to implement our FL model to fasten the training and testing operations. The hardware-accelerator method is implemented using VHDL and Altera 10 GX FPGA. The simulation results show the proposed algorithms reach an accuracy and sensitivity of 89% and 87%, respectively, for early detection while taking less time to train than other state-of-the-art algorithms. The proposed algorithms also consume 52-172 mW, which makes them suitable for constrained devices.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Distributed Online Convex Optimization with Time-Varying Constraints: Tighter Cumulative Constraint Violation Bounds under Slater's Condition

引用

IEEE Transactions on Automatic Control 2025年

作者： Yi, Xinlei Li, Xiuxian Yang, Tao Xie, Lihua Hong, Yiguang Chai, Tianyou Johansson, Karl H. National Key Laboratory of Autonomous Intelligent Unmanned Systems Shanghai Institute of Intelligent Science and Technology China Ministry of Education Frontiers Science Center for Intelligent Autonomous Systems China Massachusetts Institute of Technology Lab for Information & Decision Systems CambridgeMA02139 United States Northeastern University State Key Laboratory of Synthetical Automation for Process Industries Shenyang110819 China Nanyang Technological University School of Electrical and Electronic Engineering 50 Nanyang Avenue 639798 Singapore Kth Royal Institute of Technology Division of Decision and Control Systems School of Electrical Engineering and Computer Science Sweden Digital Futures Stockholm10044 Sweden

This paper considers distributed online convex optimization with time-varying constraints. In this setting, a network of agents makes decisions at each round, and then only a portion of the loss function and a coordinate block of the constraint function are privately revealed to each agent. The loss and constraint functions are convex and can vary arbitrarily across rounds. The agents collaborate to minimize static network regret and network cumulative constraint violation. A novel distributed online algorithm with a vanishing stepsize is proposed and it achieves an O(Tmax {c,1-c}) static network regret bound and an O(T1-c/2) network cumulative constraint violation bound, where T is the number of rounds and c∈ (0,1) is a user-defined trade-off parameter. When Slater's condition holds (i.e, there is a point that strictly satisfies the inequality constraints), the network cumulative constraint violation bound is reduced to O(T1-c). Moreover, if the loss functions are strongly convex, then static network regret bound is reduced to O(log (T)), and the network cumulative constraint violation bound is reduced to O(√log (T)T) and O(log (T)) without and with Slater's condition, respectively. To the best of our knowledge, this paper is the first to achieve tighter (network) cumulative constraint violation bounds for (distributed) online convex optimization with time-varying constraints under Slater's condition. Finally, the theoretical results are verified through numerical simulations. © 1963-2012 IEEE.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

Robust Wireless Power Transfer by Self-Oscillating Controlled Inverter and Circular Pads

Robust Wireless Power Transfer by Self-Oscillating Controlle...

引用

electrical Machines and Drives (ICEMD), International Conference on

作者： Alireza Eikani Mohammad Amirkhani Hossein Jafari Sadegh Vaez-Zadeh Mojtaba Mirsalim Davood Arab Khaburi Advanced Motion Systems Research Lab School of Electrical and Computer Engineering College of Engineering University of Tehran Tehran Iran Department of Electrical Engineering Electrical Machines and Transformers Research Laboratory (EMTRL) Amirkabir University of Technology (Tehran Polytechnic) Tehran Iran Department of Electrical Engineering Iran University of Science and Technology Tehran Iran

Inductive wireless power transfer (WPT) faces significant challenges in achieving high efficiency and stable output power for charging mobile devices like EVs. Using circular pads (CP) as the transmitter (Tx) and receiver (Rx) and a self-oscillating controlled inverter, this paper demonstrates a robust WPT system that maintains high constant transfer efficiency and output power in a defined region regardless of coupling coefficient variations without communication between Tx and Rx or control circuits for the receiver side. In contrast to couplers with non-identical Tx and Rx pads and multiple decoupled coils in the Rx pad, the compact CP-CP magnetic coupler with a single identical coil on the Tx and Rx is more robust at a wider transfer distance (air gap) and lateral and rotational misalignment between the Tx and Rx. The proposed 1-kW robust WPT system with up to a 20 cm air gap between the Tx and Rx and up to 12 cm lateral misalignment in all directions at a 15 cm air gap and all degrees of rotational misalignment can tolerate coupling variations and achieve constant output power with 93% constant transfer efficiency.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Enhanced prairie dog optimization with Levy flight and dynamic opposition-based learning for global optimization and engineering design problems

引用

Neural computing and Applications 2024年第19期36卷 11137-11170页

作者： Biswas, Saptadeep Shaikh, Azharuddin Ezugwu, Absalom El-Shamir Greeff, Japie Mirjalili, Seyedali Bera, Uttam Kumar Abualigah, Laith Department of Mathematics National Institute of Technology Agartala Tripura Agartala India Unit for Data Science and Computing North-West University 11 Hoffman Street Potchefstroom2520 South Africa Faculty of Natural and Agricultural Sciences School of Computer Science and Information Systems North-West University Vanderbijlpark South Africa Centre for Artificial Intelligence Research and Optimization Torrens University Australia Fortitude Valley BrisbaneQLD4006 Australia Research Center University of Tabuk Tabuk71491 Saudi Arabia Computer Science Department Al al-Bayt University Mafraq25113 Jordan Hourani Center for Applied Scientific Research Al-Ahliyya Amman University Amman19328 Jordan Applied Science Research Center Applied Science Private University Amman11931 Jordan Department of Electrical and Computer Engineering Lebanese American University Byblos13-5053 Lebanon School of Engineering and Technology Sunway University Malaysia Petaling Jaya27500 Malaysia College of Engineering Yuan Ze University Taoyuan32003 Taiwan MEU Research Unit Middle East University Amman11831 Jordan

This study proposes a new prairie dog optimization algorithm version called EPDO. This new version aims to address the issues of premature convergence and slow convergence that were observed in the original PDO algorithm. To improve performance, several modifications are introduced in EPDO. First, a dynamic opposite learning strategy is employed to increase the diversity of the population and prevent premature convergence. This strategy helps the algorithm avoid falling into local optima and promotes global optimization. Additionally, the Lévy dynamic random walk technique is utilized in EPDO. This modified Lévy flight with random walk reduces the algorithm’s running time for the test function’s ideal value, accelerating its convergence. The proposed approach is evaluated using 33 benchmark problems from CEC 2017 and compared against seven other comparative techniques: GWO, MFO, ALO, WOA, DA, SCA, and RSA. Numerical results demonstrate that EPDO produces good outcomes and performs well in solving benchmark problems. To further validate the results and assess reliability, the authors employ average rank tests, the measurement of alternatives, and ranking according to the compromise solution (MARCOS) method, as well as a convergence report of EPDO and other algorithms. Furthermore, the effectiveness of the EPDO algorithm is demonstrated by applying it to five design problems. The results indicate that EPDO achieves impressive outcomes and proves its capability to address practical issues. The algorithm performs well in solving benchmark and practical design problems, as supported by the numerical results and validation methods used in the study. © The Author(s) 2024.

关键词： Global optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：