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

Approximate Subtractor Operator for Low-Power Video Coding Hardware Accelerators

学校读者我要写书评

暂无评论

Approximate Subtractor Operator for Low-Power Video Coding H...

IEEE International Conference on Electronics, Circuits and Systems

作者： Rafael Ferreira Mateus Leme Marcel Correa Luciano Agostini Claudio Diniz Bruno Zatt Graduate Program on Computer Science Federal University of Pelotas (UFPel) Pelotas Brazil Graduate Program on Electronic Engineering and Computing Catholic University of Pelotas (UCPel) Pelotas Brazil

Video coding requires a massive computational effort leading to large power dissipation and energy consumption. Thus, energy efficiency becomes a significant concern especially under limited energy resources such as in mobile devices. Approximate computing is a promising technique to improve energy efficiency. Therefore, this work presents a new approximate subtractor operator to be used in video coding hardware accelerators. The proposed subtractor reduces power of a Sum of Absolute Differences (SAD) hardware accelerator on approximately 10.39% (on average of different videos) when compared to the use of the subtractor from the synthesis tool. It also presents a power reduction of 18.13% when compared to state-of-the-art approximate adder.

关键词：

Handling the Missing Data Problem in Electronic Health Records for Cancer Prediction

学校读者我要写书评

暂无评论

Handling the Missing Data Problem in Electronic Health Recor...

Spring Simulation Conference (SpringSim)

作者： Xudong Zhang Jiehao Xiao Yifei Gong Ning Yu Wei Zhang Sunghoon Jang Feng Gu Department of Computer Science The Graduate Center CUNY New York NY Department of Computing Science The College at Brockport SUNY Brockport NY Department of Physical Therapy The College of Staten Island Staten Island NY Department of Computer Engineering Technology New York City College of Technology Brooklyn NY Department of Computer Science The College of Staten Island Staten Island NY

ISBN: (数字)9781565553705

ISBN: (纸本)9781728163642

Electronic health records (EHRs) are the records containing the patients' clinic information. The EHRs have been widely used in disease diagnosis and therapy due to the numerous and valuable medical information in them. However, the missing data problem of EHRs hinders the usage. Replacing the missing data with mean values is an approach of data imputation. But, that method weakens the feature importance. In this study, we use the expectation-maximization (EM) algorithm to impute the missing data in EHRs. Some machine learning models, including artificial neural network, logistic regression, support vector machine, and random forests are used to evaluate the effectiveness of data imputation. The experimental results show that the prediction accuracies of cancers by using those models on the EHRs imputed by EM algorithm are higher than those by mean values, which indicates the EM algorithm is able to provide accurate estimations in data imputation of EHRs.

关键词：

5,18-Dimesitylorangarin: a Stable Antiaromatic Pentaphyrin(1.0.1.0.0) Displaying Remarkable Oxidative Self-Coupling Reactions

学校读者我要写书评

暂无评论

Angewandte Chemie 2024年第38期136卷

作者： Dr. Yutao Rao Jiyeon Lee Jinchao Chen Prof. Dr. Ling Xu Prof. Dr. Mingbo Zhou Dr. Bangshao Yin Prof. Dr. Jiwon Kim Prof. Dr. Atsuhiro Osuka Prof. Dr. Jianxin Song Key Laboratory of Chemical Biology and Traditional Chinese Medicine Ministry of Educational of China Key Laboratory of the Assembly and Application of Organic Functional Molecules of Hunan Province College of Chemistry and Chemical Engineering Hunan Normal University Changsha 410081 China School of Integrated Technology College of Computing Yonsei University Incheon 21983 Republic of Korea Integrated Science and Engineering Division Underwood International College Yonsei University Incheon 21983 Republic of Korea Integrative Biotechnology and Translational Medicine Graduate School Yonsei University Incheon 21983 Republic of Korea

5,18-Dimesitylorangarin and its BF 2 complex were synthesized by double S N Ar reaction of 3,5-dibromo-BODIPY with 2-pyrrolydipyrrin as the first examples of meso -aryl-substituted orangarin. These orangarins, delineated as [20]pentaphyrin(1.0.1.0.0), are strongly antiaromatic but rather stable. The free base orangarin was coupled by oxidation with MnO 2 to give a 11,11′-linked dimer, a cyclooctatetraene(COT)-centered trimer, and a spiro-trimer. Fused COT-centered 3H -orangarin dimer was oxidized to the corresponding 2H -orangarin dimer, which was further coupled to give a triply COT-centered 2H -orangarin tetramer. 3 H -Orangarin oligomers are all antiaromatic as evinced by extremely low-field-shifted 1 H NMR signals of the inner NH and ill-defined absorption spectra with broad tails. In contrast, COT-centered 2 H -orangarin dimer and tetramer show moderately low-field-shifted NH signals and intense NIR absorbance over 900 nm, suggesting effective π-conjugation through the COT bridge and almost non-antiaromatic character. These orangarin oligomers exhibit many reversible redox potentials owing to the intramolecular electronic interactions. Regardless of the different aromatic characters, all the orangarin monomers and oligomers exhibit very rapid excited-state decays.

关键词： pentaphyrin orangarin antiaromaticity oligomerization cyclooctatetraene

Relativistic VQE calculations of molecular electric dipole moments on quantum hardware

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Chawla, Palak Shweta Swain, K.R. Patel, Tushti Bala, Renu Shetty, Disha Sugisaki, Kenji Mandal, Sudhindu Bikash Riu, Jordi Nogué, Jan Prasannaa, V.S. Das, B.P. Centre for Quantum Engineering Research and Education TCG Crest Kolkata700091 India Department of Physics Indian Institute of Technology Delhi New Delhi110016 India Department of Physics IIT Tirupati Chindepalle Andhra Pradesh 517619 India Graduate School of Science and Technology Keio University 7-1 Shinkawasaki Saiwai-ku Kanagawa Kawasaki212-0032 Japan Quantum Computing Center Keio University 3-14-1 Hiyoshi Kohoku-ku Kanagawa Yokohama223-8522 Japan Keio University 2-15-45 Mita Minato-ku Tokyo Japan Qilimanjaro Quantum Tech Carrer de Veneçuela 74 Sant Martí Barcelona08019 Spain Universitat Politècnica de Catalunya Carrer de Jordi Girona 3 Barcelona08034 Spain Ghaziabad201002 India Department of Physics Tokyo Institute of Technology 2-12-1 Ookayama Meguro-ku Tokyo152-8550 Japan

The quantum–classical hybrid variational quantum eigensolver (VQE) algorithm is among the most actively studied topics in atomic and molecular calculations on quantum computers, yet few studies address properties other than energies or account for relativistic effects. This work presents high-precision 18-qubit relativistic VQE simulations for calculating the permanent electric dipole moments (PDMs) of alkaline earth metal monohydride molecules (BeH to RaH) on traditional computers, and 6- and 12-qubit PDM computations for SrH on IonQ quantum devices. To achieve high precision on current noisy intermediate scale era quantum hardware, we apply various resource reduction methods, including reinforcement learning-based and causal flow preserving ZX–Calculus routines, along with error mitigation and post-selection techniques. Our approach reduces the two-qubit gate count in our 12-qubit circuit by 99.71%, with only a 2.35% trade-off in precision for PDM when evaluated classically within a suitably chosen active space. On the current generation IonQ Forte-I hardware, the error in PDM is −1.17% relative to classical calculations and only 1.21% compared to the unoptimized circuit. © 2024, CC BY.

关键词： Qubits

Label-free optical fundus angiography based on programmable hyperspectral imaging

学校读者我要写书评

暂无评论

Optics & Laser Technology 2025年 191卷

作者： Yuetian Ren Yuning Song Jinchi Yao Hongguo Wei Yunxin Wang Shuaihang Luo Wenbin Xu James Joseph Keren Chen Shuo Chen College of Medicine and Biological Information Engineering Northeastern University 195 Innovation Road Shenyang 110169 Liaoning China National Key Laboratory of Scattering and Radiation 50 Yongding Road Beijing 110854 China School of Science and Engineering University of Dundee Dundee DD1 4HN Scotland UK Foshan Graduate School of Innovation Northeastern University 1 Panpu Road Foshan 528311 Guangdong China Key Laboratory of Intelligent Computing in Medical Image Ministry of Education Northeastern University 195 Innovation Road Shenyang 110169 Liaoning China

Retinal vasculature, as the sole deep vascular network within the human body that can be non-invasively observed, is closely associated with various retinal and systemic disorders. However, conventional fundus imaging techniques often suffer from inadequate contrast or rely on invasive contrast agents to visualize fine retinal vessels, hemorrhages, and exudates, thereby posing great challenges in screening or diagnosing fundus diseases at their early stages. In this study, we report a label-free optical fundus angiography method based on programmable hyperspectral imaging, in which fundus images with high-contrast retinal blood vessels can be captured in a snapshot by exposing fundus tissues under specific spectrally coded illumination. Using a self-developed programmable light source, such specific spectrally coded illumination is multiplexed with specific intensities at different wavelengths under the guidance of spectral post-processing algorithms. This enables the preservation of key spectral bands that can maximize the differences between the retinal blood vessels and other fundus tissues. In such a manner, the proposed method can select the wavelengths of interest during fundus imaging in a snapshot, in contrast to numerical wavelength selection after acquiring the full wavelengths of conventional spectroscopic fundus imaging techniques; thus, the time-consuming acquisition of a three-dimensional spectral dataset and spectral post-processing can be avoided. Through evaluations on a model eye and ex vivo porcine eyes, the proposed label-free optical fundus angiography method shows significant enhancement in the image contrast of retinal blood vessels compared to conventional fundus imaging, thus is expected to benefit early and more precise diagnosis of fundus diseases.

关键词：

The Quantum Internet (Technical Version)

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Rohde, Peter P. Huang, Zixin Ouyang, Yingkai Huang, He-Liang Su, Zu-En Devitt, Simon Ramakrishnan, Rohit Mantri, Atul Tan, Si-Hui Liu, Nana Harrison, Scott Radhakrishnan, Chandrashekar Brennen, Gavin K. Baragiola, Ben Q. Dowling, Jonathan P. Byrnes, Tim Munro, William J. Centre for Quantum Software and Information Faculty of Engineering and Information Technology University of Technology Sydney SydneyNSW Australia Hearne Institute for Theoretical Physics Louisiana State University Baton Rouge United States School of Mathematical and Physical Sciences Macquarie University NSW2109 Australia School of Mathematical and Physical Sciences University of Sheffield SheffieldS3 7RH United Kingdom Henan Key Laboratory of Quantum Information and Cryptography Henan Zhengzhou450000 China Hefei National Laboratory for Physical Sciences at Microscale Department of Modern Physics University of Science & Technology of China Hefei China CAS Centre for Excellence and Synergetic Innovation Centre in Quantum Information & Quantum Physics University of Science & Technology of China Hefei China CAS-Alibaba Quantum Computing Laboratory Shanghai China InstituteQ Aalto University Espoo02150 Finland Indian Institute of Science Bangalore India Singapore University of Technology & Design Singapore Centre for Quantum Technologies National University of Singapore Singapore Horizon Quantum Ireland 24 Fitzwilliam Place Dublin 2 D02 T296 Ireland Institute of Natural Sciences Shanghai Jiao Tong University Shanghai200240 China School of Mathematical Sciences Shanghai Jiao Tong University Shanghai200240 China Ministry of Education Key Laboratory in Scientific and Engineering Computing Shanghai Jiao Tong University Shanghai200240 China Shanghai Artificial Intelligence Laboratory Shanghai China University of Michigan Shanghai Jiao Tong University Joint Institute Shanghai200240 China Leibniz Institute for Research & Information in Education Frankfurt am Main Germany Department of Computer Science and Engineering NYU Shanghai 567 West Yangsi Road Shanghai200124 China Centre of Excellence in Engineered Quantum Systems Macquarie University NSW Australia Centre for Quantum Computation and Communication Technology School of Science RMIT University VIC

The desire to share and unite remote digital assets motivated the development of the classical internet, the enabler of the entire 21st century economy and our modern way of life. As we enter the quantum era, it is to be expected there will be a similar demand for networking quantum assets, motivating a global quantum internet for bringing together the world's quantum resources, leveraging off their exponential trajectory in capability. We present models for quantum networking, how they might be applied in the future, and the implications they will have. Socially, economically, politically and geostrategically, the upcoming era of quantum supremacy will be as significant for the 21st century as the transistor was for the 20th. The inherently different scaling in the computational power of quantum computers fundamentally changes the dynamics of how they will operate in the future. Given their high expected initial cost, a client/server model for outsourcing computation will be essential for enabling the accessibility and proliferation of this technology, and ensuring its economic viability. We therefore anticipate the emergence of cloud quantum computing, a model for outsourcing quantum computations to the network. We argue that economic efficiency will mandate that all future quantum computers be united into a single global virtual quantum computer, offering exponentially more power to all network participants than if they were to keep their resources to themselves. This model for the allocation of computational resources is uniquely quantum, with no classical analogue, completely altering the economic landscape for the future of computation. Given the sensitivity of much of the data to which future quantum computers are going to foreseeably be applied, protocols for encrypted quantum computation will be essential - the outsourcing of computations that neither an eavesdropper nor even the server performing the computation can spy upon. This will enable new models fo

关键词： Outsourcing

Automated classification of Wuyi rock tealeaves based on support vector machine

学校读者我要写书评

暂无评论

Automated classification of Wuyi rock tealeaves based on sup...

作者： Lin, Li-Hui Li, Cheng-Hsuan Yang, Sheng Li, Shao-Zi Wei, Yi College of Mathematics and Computer Science Wuyi University Wuyishan354300 China Graduate Institute of Educational Information and Measurement National Taichung University of Education Taichung40306 Taiwan School of Information Science and Engineering Xiamen University Xiamen361005 China The Key Laboratory of Cognitive Computing and Intelligent Information Processing Fujian Education Institutions Wuyishan354300 China

This paper describes a new automated classification method for Wuyi rock tealeaves based on the best penalty parameter selection for the support vector machine with RBF (Radial Basis Function) kernel. A total of 3590 fresh tealeaf images of the representative Rou Gui and Shui Hsien varieties of Wuyi rock tea are collected in their natural habitat. Fourteen image features are extracted in terms of the leaf shape and texture. The automatic selection method is used to find the optimum RBF kernel parameter sigma, which is then applied to design an automatic parameter selection method to screen the best penalty parameter C for the classification of Wuyi rock tealeaves. In this study, the SVM classifier is used for the automated classification and recognition of the 14 image features. The contribution of the various features to the recognition rate of fresh tealeaves is evaluated to identify the key features for the classification and recognition of fresh Wuyi rock tealeaf images. The experimental results show that the proposed method improves the recognition rate of fresh tealeaves to 91.00%. © 2018 John Wiley & Sons, Ltd.

关键词： Feature extraction

Pricing multi-asset derivatives by variational quantum algorithms

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Kubo, Kenji Miyamoto, Koichi Mitarai, Kosuke Fujii, Keisuke R4D Mercari Inc. Roppongi Hills Mori Tower 18F 6-10-1 Roppongi Minato-ku Tokyo106-6118 Japan Graduate School of Engineering Science Osaka University 1-3 Machikaneyama Toyonaka Osaka560-8531 Japan Center for Quantum Information and Quantum Biology Osaka University 1-2 Machikaneyama Toyonaka Osaka560-0043 Japan Center for Quantum Information and Quantum Biology Osaka University Japan JST PRESTO 4-1-8 Honcho Saitama Kawaguchi332-0012 Japan RIKEN Center for Quantum Computing Wako Saitama 351-0198 Japan

Pricing a multi-asset derivative is an important problem in financial engineering, both theoretically and practically. Although it is suitable to numerically solve partial differential equations to calculate the prices of certain types of derivatives, the computational complexity increases exponentially as the number of underlying assets increases in some classical methods, such as the finite difference method. Therefore, there are efforts to reduce the computational complexity by using quantum computation. However, when solving with naive quantum algorithms, the target derivative price is embedded in the amplitude of one basis of the quantum state, and so an exponential complexity is required to obtain the solution. To avoid the bottleneck, the previous study [Miyamoto and Kubo, IEEE Transactions on Quantum engineering, 3, 1–25 (2022)] utilizes the fact that the present price of a derivative can be obtained by its discounted expected value at any future point in time and shows that the quantum algorithm can reduce the complexity. In this paper, to make the algorithm feasible to run on a small quantum computer, we use variational quantum simulation to solve the Black-Scholes equation and compute the derivative price from the inner product between the solution and a probability distribution. This avoids the measurement bottleneck of the naive approach and would provide quantum speedup even in noisy quantum computers. We also conduct numerical experiments to validate our method. Our method will be an important breakthrough in derivative pricing using small-scale quantum computers. Copyright © 2022, The Authors. All rights reserved.

关键词： Computational complexity

Local variational quantum compilation of a large-scale Hamiltonian dynamics

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Mizuta, Kaoru Nakagawa, Yuya O. Mitarai, Kosuke Fujii, Keisuke QunaSys Inc. Aqua Hakusan Building 9F 1-13-7 Hakusan Bunkyo Tokyo113-0001 Japan Department of Physics Kyoto University Kyoto606-8502 Japan Graduate School of Engineering Science Osaka University 1-3 Machikaneyama Osaka Toyonaka560-8531 Japan Center for Quantum Information and Quantum Biology Osaka University Japan JST PRESTO 4-1-8 Honcho Saitama Kawaguchi332-0012 Japan Hirosawa 2-1 Saitama Wako351-0198 Japan Fujitsu Quantum Computing Joint Research Division at QIQB Osaka University 1-2 Machikaneyama Toyonaka560-0043 Japan

Implementing time evolution operators on quantum circuits is important for quantum simulation. However, the standard way, Trotterization, requires a huge numbers of gates to achieve desirable accuracy. Here, we propose a local variational quantum compilation (LVQC) algorithm, which allows to accurately and efficiently compile a time evolution operators on a large-scale quantum system by the optimization with smaller-size quantum systems. LVQC utilizes a subsystem cost function, which approximates the fidelity of the whole circuit, defined for each subsystem as large as approximate causal cones brought by the Lieb-Robinson (LR) bound. We rigorously derive its scaling property with respect to the subsystem size, and show that the optimization conducted on the subsystem size leads to the compilation of whole-system time evolution operators. As a result, LVQC runs with limited-size quantum computers or classical simulators that can handle such smaller quantum systems. For instance, finite-ranged and short-ranged interacting L-size systems can be compiled with O(L0)- or O(log L)-size quantum systems depending on observables of interest. Furthermore, since this formalism relies only on the LR bound, it can efficiently construct time evolution operators of various systems in generic dimension involving finite-, short-, and long-ranged interactions. We also numerically demonstrate the LVQC algorithm for one-dimensional systems. Employing classical simulation by time-evolving block decimation, we succeed in compressing the depth of a time evolution operators up to 40 qubits by the compilation for 20 qubits. LVQC not only provides classical protocols for designing large-scale quantum circuits, but also will shed light on applications of intermediate-scale quantum devices in implementing algorithms in larger-scale quantum devices. Copyright © 2022, The Authors. All rights reserved.

关键词： Quantum optics