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

SICE Annual Conference

作者： Renta NOGUCHI Asahi SAKUMA Yuko KAKAZU Hiroshi IWATA Yosuke ASANO Yuichi ITOH Achyut Sapkota Atsushi SHIRAKI Ikusaburo KURIMOTO Dept. of Applied and Cognitive Infomatics Graduate School of Science and Engineering Chiba University Chiba Japan Dept. of Civil Engineering National Institute of Technology Kisarazu College Chiba Japan Dept. of Natural Science National Institute of Technology Kisarazu College Chiba Japan Dept. of Information Engineering National Institute of Technology Nara College Nara Japan Dept. of Electrical and Electronic Engineering National Institute of Technology Kisarazu College Chiba Japan Dept. of Mechanical Engineering National Institute of Technology Kisarazu College Chiba Japan Dept. of Information and Computer Engineering National Institute of Technology Kisarazu College Chiba Japan Graduate School of Engineering Chiba University Chiba Japan

ISBN: (数字)9784907764838

ISBN: (纸本)9798331544461

To obtain a stable supply of high-quality agricultural products, controlling the environment properly, such as temperature, humidity, and light, is necessary. Plant factories are attracting attention as a means to realize such an environment. In our laboratory, we have constructed and demonstrated the temperature and VPD control to control the spray pressure of fine mist cooling. However, the relationship between plants and water needs to be clarified to adapt to different regions, changing weather conditions, cultivars and plans, and quality objectives. Therefore, in this study, we developed an IoT system that can measure VPD and the amount of weight change due to transpiration in a plant canopy. Leaf area was measured using 3D model construction, and transpiration rate and vapor conductance were derived. As a result, the relationship between VPD and stomata was partially clarified.

关键词： Weight measurement Temperature measurement Transpiration Solid modeling Temperature Three-dimensional displays Area measurement Inspection mathematical models Time measurement

来源：评论

学校读者我要写书评

暂无评论

Is Gamification a Practical Solution for Increasing Repurchase Intention of Online Customers?

Is Gamification a Practical Solution for Increasing Repurcha...

引用

computer science, computer Engineering, & applied Computing (CSCE), Congress in

作者： Khalil Safari Zohreh Safari Fatemeh Keshavarzi Dept. of Business Management and Information Technology Payam Noor University Tehran Iran Dept. Computer Science Math Engineering Technology Elizabeth City State University Elizabeth City USA Dept.Information Technology Engineering Qazvin Islamic Azad University Qazvin Iran

With the growth of online shopping, organizations should update their portals and websites in response to changing conditions and competitors' actions. To attract and retain online customers, various tools such as reputation building, trust en-hancement, and gamification are utilized and reinforced. This study has investigated 243 users of DigiKala company through paper and electronic questionnaires. Due to the non-normality of the data, non-parametric statistical methods using SPSS and Smart-PLS3.0 software were employed to analyze structural relationships. Additionally, machine learning tools were utilized to optimize the analysis of customer behavior and identify patterns for effective customer retention strategies. The results show that contrary to the research background, the use of gamification on DigiKala's website has not had a positive and significant impact on customers using this company's website and their repurchase intention. Thus, it seems that DigiKala should focus on context and infrastructures, while simultaneously strengthening and revamping gamification dimensions.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Insight into Voting Problem Complexity Using Randomized Classes

arXiv

引用

arXiv 2022年

作者： Fitzsimmons, Zack Hemaspaandra, Edith Dept. of Math. and Computer Science College of the Holy Cross WorcesterMA01610 United States Department of Computer Science Rochester Institute of Technology RochesterNY14623 United States

The first step in classifying the complexity of an NP problem is typically showing the problem in P or NP-complete. This has been a successful first step for many problems, including voting problems. However, in this paper we show that this may not always be the best first step. We consider the problem of constructive control by replacing voters (CCRV) introduced by Loreggia et al. (2015) for the scoring rule First-Last, which is defined by (1, 0, ⋯;0, -1). We show that this problem is equivalent to Exact Perfect Bipartite Matching, and so CCRV for First-Last can be determined in random polynomial time. So on the one hand, if CCRV for First-Last is NP-complete then RP = NP, which is extremely unlikely. On the other hand, showing that CCRV for First-Last is in P would also show that Exact Perfect Bipartite Matching is in P, which would solve a well-studied 40-year-old open problem. By considering RP as an option we also gain insight into the complexity of CCRV for 2-Approval, ultimately showing it in P, which settles the complexity of the sole open problem in the comprehensive table from Erdélyi et al. (2021). Copyright © 2022, The Authors. All rights reserved.

关键词： Polynomial approximation

来源：评论

学校读者我要写书评

暂无评论

Circuit decompositions and scheduling for neutral atom devices with limited local addressability

arXiv

引用

arXiv 2023年

作者： Nottingham, Natalia Perlin, Michael A. Shah, Dhirpal White, Ryan Bernien, Hannes Chong, Frederic T. Baker, Jonathan M. Dept. of Computer Science University of Chicago ChicagoIL United States Global Technology Applied Research JPMorganChase New YorkNY United States Dept. of Physics University of Chicago ChicagoIL United States Pritzker School of Molecular Engineering University of Chicago ChicagoIL United States Dept. Electrical & Computer Engineering University of Texas at Austin AustinTX United States

Despite major ongoing advancements in neutral atom hardware technology, there remains limited work in systems-level software tailored to overcoming the challenges of neutral atom quantum computers. In particular, most current neutral atom architectures do not natively support local addressing of single-qubit rotations about an axis in the xy-plane of the Bloch sphere. Instead, these are executed via global beams applied simultaneously to all qubits. While previous neutral atom experimental work has used straightforward synthesis methods to convert short sequences of operations into this native gate set, these methods cannot be incorporated into a systems-level framework nor applied to entire circuits without imposing impractical amounts of serialization. Without sufficient compiler optimizations, decompositions involving global gates will significantly increase circuit dept., gate count, and accumulation of errors. No prior compiler work has addressed this, and adapting existing compilers to solve this problem is nontrivial. In this paper, we present an optimized compiler pipeline that translates an input circuit from an arbitrary gate set into a realistic neutral atom native gate set containing global gates. We focus on decomposition and scheduling passes that minimize the final circuit’s global gate count and total global rotation amount. As we show, these costs contribute the most to the circuit’s duration and overall error, relative to costs incurred by other gate types. Compared to the unoptimized version of our compiler pipeline, minimizing global gate costs gives up to 4.77x speedup in circuit duration. Compared to the closest prior existing work, we achieve up to 53.8x speedup. For large circuits, we observe a few orders of magnitude improvement in circuit fidelities. Copyright © 2023, The Authors. All rights reserved.

关键词： Program compilers

来源：评论

学校读者我要写书评

暂无评论

Utilizing Blockchain Technology for Financial Services in Parallel, Distributed, and Grid Computing Frameworks

Utilizing Blockchain Technology for Financial Services in Pa...

引用

Computing and Intelligent Reality Technologies (ICCIRT), International Conference on

作者： Prakash Chokkamreddy Anusha Palagati Akurathi Lakshmi Pathi Rao P Maheswari Vanitha Mahadevan Santhosh Kumar Balan School of Management Studies Guru Nanak Institutions Technical Campus Ibrahimpatnam Hyderabad India Dept. of Computer Science and Engineering Guru Nanak Institute of Technology Ibrahimpatnam Hyderabad India Department of Computer Applications KSR College of Arts and Science for Women Tiruchengode India College of Engineering and Technology University of Technology and Applied Sciences Al Mussanah Sultanate of Oman

ISBN: (数字)9798331510299

ISBN: (纸本)9798331510305

Application of blockchain in financial services has opened new ways of efficiency in transaction processing, assets management and security. The application of parallel, distributed, and grid computing with blockchain in improving the functionality of financial services like real time financial transactions, high frequency trading, portfolio and risk analysis is examined in this paper. It has been ascertained that namely parallel and distributed computing together with blockchain are the most suitable for facing increasing needs in data in the sphere of financial services. It also investigates the use of grid computing frameworks and their effects on the correspondingly balanced flows of medium amongst multiple systems. Various issues such as security, privacy violations, and adherence to the law are also reviewed, and existing prospects for developing through smart contracts and consensus mechanisms using blockchain. Exploring how some of the most successful pilot use-cases of blockchain are applicable for future growth in the financial services industry offers insights into how blockchain will soon enter mainstream as a disruptive technology in the broader global financial sector.

关键词： Privacy Law Smart contracts Consensus algorithm Grid computing Real-time systems Blockchains Security Risk analysis Financial services

来源：评论

学校读者我要写书评

暂无评论

Czech medical coding assistant based on transformer networks

引用

computers in Biology and Medicine 2024年 178卷 108672-108672页

作者： Lenc, Ladislav Martínek, Jiří Baloun, Josef Přibáň, Pavel Prantl, Martin Taylor, Stephen Eugene Král, Pavel Kyliš, Jiří Dept. of Computer Science & Engineering Faculty of Applied Sciences University of West Bohemia Univerzitni 8 Plzeň30100 Czech Republic NTIS - New Technologies for the Information Society Faculty of Applied Sciences University of West Bohemia Univerzitni 8 Plzeň30100 Czech Republic ICZ Group Na Hřebenech II 1718/10 Praha14000 Czech Republic

The International Classification of Diseases (ICD) hierarchical taxonomy is used for so-called clinical coding of medical reports, typically presented in unstructured text. In the Czech Republic, it is currently carried out manually by a so-called clinical coder. However, due to the human factor, this process is error-prone and expensive. The coder needs to be properly trained and spends significant effort on each report, leading to occasional mistakes. The main goal of this paper is to propose and implement a system that serves as an assistant to the coder and automatically predicts diagnosis codes. These predictions are then presented to the coder for approval or correction, aiming to enhance efficiency and accuracy. We consider two classification tasks: main (principal) diagnosis;and all diagnoses. Crucial requirements for the implementation include minimal memory consumption, generality, ease of portability, and sustainability. The main contribution lies in the proposal and evaluation of ICD classification models for the Czech language with relatively few training parameters, allowing swift utilisation on the prevalent computer systems within Czech hospitals and enabling easy retraining or fine-tuning with newly available data. First, we introduce a small transformer-based model for each task followed by the design of a transformer-based "Four-headed" model incorporating four distinct classification heads. This model achieves comparable, sometimes even better results, against four individual models. Moreover this novel model significantly economises memory usage and learning time. We also show that our models achieve comparable results against state-of-the-art English models on the Mimic IV dataset even though our models are significantly smaller. © 2024 Elsevier Ltd

关键词： Network coding

来源：评论

学校读者我要写书评

暂无评论

Key Exchange in the Quantum Era: Evaluating a Hybrid System of Public-Key Cryptography and Physical-Layer Security

arXiv

引用

arXiv 2024年

作者： Staat, Paul Dörpinghaus, Meik Sheikholeslami, Azadeh Paar, Christof Fettweis, Gerhard Goeckel, Dennis Max Planck Institute for Security and Privacy Bochum Germany Vodafone Chair Mobile Communications Systems Technische Universität Dresden Dresden Germany Math and Computer Science Department Suffolk University Boston United States Dept. Electrical and Computer Engineering University of Massachusetts Amherst United States

Today’s information society relies on cryptography to achieve security goals such as confidentiality, integrity, authentication, and non-repudiation for digital communications. Here, public-key cryptosystems play a pivotal role to share encryption keys and create digital signatures. However, quantum computers threaten the security of traditional public-key cryptosystems as they can tame computational problems underlying the schemes, i.e., discrete logarithm and integer factorization. The prospective arrival of capable-enough quantum computers already threatens today’s secret communication in terms of their long-term secrecy when stored to be later decrypted. Therefore, researchers strive to develop and deploy alternative schemes. In this work, evaluate a key exchange protocol based on combining public-key schemes with physical-layer security, anticipating the prospect of quantum attacks. If powerful quantum attackers cannot immediately obtain private keys, legitimate parties have a window of short-term secrecy to perform a physical-layer jamming key exchange (JKE) to establish a long-term shared secret. Thereby, the protocol constraints the computation time available to the attacker to break the employed public-key cryptography. In this paper, we outline the protocol, discuss its security, and point out challenges to be resolved. © 2024, CC BY-NC-SA.

关键词： Quantum computers

来源：评论

学校读者我要写书评

暂无评论

Deep Learning-based Spectral Efficiency Maximization in Massive MIMO-NOMA Systems with STAR-RIS

Deep Learning-based Spectral Efficiency Maximization in Mass...

引用

International Conference on Artificial Intelligence in Information and Communication (ICAIIC)

作者： Ridho Hendra Yoga Perdana Toan-Van Nguyen Yushintia Pramitarini Kyusung Shim Beongku An Dept. of Software and Communications Engineering in Graduate School Hongik University Republic of Korea School of Computer Science and Engineering International University - Vietnam National University HCM City Vietnam School of Computer Engineering and Applied Mathematics Hankyong National University Republic of Korea Dept. of Software and Communications Engineering Hongik University Republic of Korea

This paper studies a deep learning-based framework for spectral efficiency maximization problem in massive multiple-input multiple-output (MIMO)-non-orthogonal multiple access (NOMA) systems with simultaneously transmitting and reflecting reconfigurable intelligent surface (STAR-RIS). We formulate the spectral efficiency maximization with a joint design of power allocation of the users, phase shift matrix of transmission and reflection element at the STAR-RIS. Since the problem is non-convex and power allocation of the users and reflector/transmitter elements at a STAR-RIS are coupled, it is very challenging to solve optimally. We propose a low-complexity iterative algorithm based on the inner approximation (IA) method to solve this problem with guaranteed convergence at a relatively optimal level. For real-time optimization, we design a deep learning (DL) framework to predict the optimal solution of power allocation of users, phase shift matrix of transmission and reflection elements at the STAR-RIS according to distances and channel gains from the base station (BS) to STAR-RIS and from STAR-RIS to users. Simulation results show that the suggested scheme improves the spectral efficiency (SE) compared to the massive MIMO system with direct link and without STAR-RIS. Besides, the DL framework can predict the optimal solution within a short time under the suggested scheme.

关键词： Deep learning Base stations Spectral efficiency Simulation Massive MIMO Reflection Real-time systems

来源：评论

学校读者我要写书评

暂无评论

Accelerating potential evaluation over unstructured meshes in two dimensions

arXiv

引用

arXiv 2022年

作者： Shen, Zewen Serkh, Kirill Dept. of Computer Science University of Toronto TorontoONM5S 2E4 Canada Dept. of Math. and Computer Science University of Toronto TorontoONM5S 2E4 Canada

The accurate and efficient evaluation of potentials is of great importance for the numerical solution of partial differential equations. When the integration domain of the potential is irregular and is discretized by an unstructured mesh, the function spaces of near field and self-interactions are non-compact, and, thus, their computations cannot be easily accelerated. In this paper, we propose three novel and complementary techniques for accelerating the evaluation of potentials over unstructured meshes. Firstly, we rigorously characterize the geometry of the near field, and show that this analysis can be used to eliminate all the unnecessary near field interaction computations. Secondly, as the near field can be made arbitrarily small by increasing the order of the far field quadrature rule, the expensive near field interaction computation can be efficiently offloaded onto the FMM-based far field interaction computation, which leverages the computational efficiency of highly optimized parallel FMM libraries. Finally, we show that a separate interpolation mesh that is staggered to the quadrature mesh dramatically reduces the cost of constructing the interpolants. Besides these contributions, we present a robust and extensible framework for the evaluation and interpolation of 2-D volume potentials over complicated geometries. We demonstrate the effectiveness of the techniques with several numerical experiments. © 2022, CC BY.

关键词： Poisson equation

来源：评论

学校读者我要写书评

暂无评论

On polynomial interpolation in the monomial basis

arXiv

引用

arXiv 2022年

作者： Shen, Zewen Serkh, Kirill Dept. of Computer Science University of Toronto TorontoONM5S 2E4 Canada Dept. of Math. and Computer Science University of Toronto TorontoONM5S 2E4 Canada

In this paper, we show that the monomial basis is generally as good as a well-conditioned polynomial basis for interpolation, provided that the condition number of the Vandermonde matrix is smaller than the reciprocal... 详细信息

关键词： Interpolation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：