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

arXiv 2021年

作者： Stegehuis, Clara Department of Electrical Engineering Mathematics and Computer Science University of Twente Netherlands

We investigate the asymptotic number of induced subgraphs in power-law uniform random graphs. We show that these induced subgraphs appear typically on vertices with specific degrees, which are found by solving an optimization problem. Furthermore, we show that this optimization problem allows to design a linear-time, randomized algorithm that distinguishes between uniform random graphs and random graph models that create graphs with approximately a desired degree sequence: the power-law rank-1 inhomogeneous random graph. This algorithm uses the fact that some specific induced subgraphs appear significantly more often in uniform random graphs than in rank-1 inhomogeneous random graphs. Copyright © 2021, The Authors. All rights reserved.

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

Environmental tests and reliability characterization of pixel-sized colloidal QDs for next-generation display technologies

Next Nanotechnology

引用

Next Nanotechnology 2024年 5卷

作者： Parlak, Mehmet Ilban, Hatice Ilkben Karsli, Kivanc Unal, Emre Demir, Hilmi Volkan Department of Electrical and Electronics Engineering Ozyegin University Cekmekoy Istanbul 34794 Turkey Institute for ICT Electronics and Applied Mathematics (ICTEAM) UC Louvain Ottignies-Louvain-la-Neuve 1348 Belgium Vestel Electronics Manisa 45030 Turkey Department of Electrical and Electronics Engineering Department of Physics UNAM Institute of Materials Science and Nanotechnology Bilkent University Cankaya Ankara 06590 Turkey School of Electrical and Electronic Engineering School of Materials Science and Engineering Nanyang Technological University 639798 Singapore

This study investigates integrating pixelated colloidal quantum dot (QD) layers into LCDs to enhance color conversion and pixel-level enrichment for future display technologies. We developed miniature prototypes with pixel-sized QD color-converter layers seamlessly integrated into the backlight unit (BLU). The prototypes, featuring red- and green-emitting QD pixels with a single blue LED on glass substrates, underwent rigorous environmental tests such as Thermal Shock Test (TST), Thermal Cycle Test (TCT), High Temperature High Humidity Test (HHT), and Low Temperature Test (LTT). The assessment covered the uniformity of light, spectral radiance, and CIE color coordinates, revealing insights into the performance of the QD layers through the analysis of pre- and post-environmental tests. Despite a decrease in luminance, the QD layers exhibited resilience against rapid temperature variations, enduring thermal shock, and thermal cycle tests without cracking. However, high-temperature and high-humidity conditions revealed susceptibility. Low-temperature stress tests demonstrated stable color gamut coordinates with no discernible shifts. This research fills a notable gap in the existing literature by conducting comprehensive environmental tests on pixel-sized QD utilization in display technologies, providing valuable insights to enhance the stability, durability, and reliability of QD displays. © 2024 The Authors

关键词： Chromaticity coordinates Colloidal nanocrystals Color filter Color-converter Environmental tests Liquid crystal display Photoluminescence QD-LCD QDs pixelation Quantum dot characterization Quantum dot film Quantum dots Technology Wide-color gamut

来源：评论

学校读者我要写书评

暂无评论

Pseudorandom generators for read-once monotone branching programs 24

Pseudorandom generators for read-once monotone branching pro...

引用

24th International Conference on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2021 and 25th International Conference on Randomization and Computation, RANDOM 2021

作者： Doron, Dean Meka, Raghu Reingold, Omer Tal, Avishay Vadhan, Salil Department of Computer Science Stanford University CA United States Department of Computer Science University of California Los AngelesCA United States Department of Electrical Engineering and Computer Sciences University of California BerkeleyCA United States John A. Paulson School of Engineering and Applied Sciences Harvard University CambridgeMA United States

ISBN: (纸本)9783959772075

Motivated by the derandomization of space-bounded computation, there has been a long line of work on constructing pseudorandom generators (PRGs) against various forms of read-once branching programs (ROBPs), with a goal of improving the O(log2 n) seed length of Nisan's classic construction [33] to the optimal O(log n). In this work, we construct an explicit PRG with seed length Oe(log n) for constant-width ROBPs that are monotone, meaning that the states at each time step can be ordered so that edges with the same labels never cross each other. Equivalently, for each fixed input, the transition functions are a monotone function of the state. This result is complementary to a line of work that gave PRGs with seed length O(log n) for (ordered) permutation ROBPs of constant width [7, 26, 12, 37], since the monotonicity constraint can be seen as the "opposite" of the permutation constraint. Our PRG also works for monotone ROBPs that can read the input bits in any order, which are strictly more powerful than read-once AC0. Our PRG achieves better parameters (in terms of the dependence on the depth of the circuit) than the best previous pseudorandom generator for read-once AC0, due to Doron, Hatami, and Hoza [13]. Our pseudorandom generator construction follows Ajtai and Wigderson's approach of iterated pseudorandom restrictions [1, 18]. We give a randomness-efficient width-reduction process which proves that the branching program simplifies to an O(log n)-junta after only O(log log n) independent applications of the Forbes-Kelley pseudorandom restrictions [16]. © Dean Doron, Raghu Meka, Omer Reingold, Avishay Tal, and Salil Vadhan;licensed under Creative Commons License CC-BY 4.0

关键词： Timing circuits

来源：评论

学校读者我要写书评

暂无评论

Extremal values of degree-based entropies of bipartite graphs

arXiv

引用

arXiv 2022年

作者： Cambie, Stijn Dong, Yanni Mazzamurro, Matteo Daejeon Korea Republic of School of Mathematics and Statistics Northwestern Polytechnical University China Faculty of Electrical Engineering Mathematics and Computer Science University of Twente Netherlands Department of Computer Science University of Warwick United Kingdom

We characterize the bipartite graphs that minimize the (first-degree based) entropy, among all bipartite graphs of given size, or given size and (upper bound on the) order. The extremal graphs turn out to be complete bipartite graphs, or nearly complete bipartite. Here we make use of an equivalent representation of bipartite graphs by means of Young tableaux, which make it easier to compare the entropy of related graphs. We conclude that the general characterization of the extremal graphs is a difficult problem, due to its connections with number theory, but they are easy to find for specific values of the order n and size m. We also give a direct argument to characterize the graphs maximizing the entropy given order and size. We indicate that some of our ideas extend to other degree-based topological indices as *** Codes 05C35, 94A17, 68R10, 05C09, 05C07 © 2022, CC BY.

关键词： Entropy

来源：评论

学校读者我要写书评

暂无评论

Global Dynamics of Ordinary Differential Equations: Wall Labelings, Conley Complexes, and Ramp Systems

arXiv

引用

arXiv 2024年

作者： Gameiro, Marcio Gedeon, Tomáš Kokubu, Hiroshi Mischaikow, Konstantin Oka, Hiroe Rivas, Bernardo Vieira, Ewerton Gameiro, Daniel Department of Mathematics Rutgers University PiscatawayNJ08854 United States Department of Mathematical Sciences Montana State University BozemanMT59717 United States Department of Mathematics Kyoto University Kyoto606-8502 Japan Ryukoku University Seta Otsu520-2123 Japan Department of Electrical and Computer Engineering Rutgers University PiscatawayNJ08854 United States

We introduce a combinatorial topological framework for characterizing the global dynamics of ordinary differential equations (ODEs). The approach is motivated by the study of gene regulatory networks, which are often modeled by ODEs that are not explicitly derived from first principles. The proposed method involves constructing a combinatorial model from a set of parameters and then embedding the model into a continuous setting in such a way that the algebraic topological invariants are preserved. In this manuscript, we build upon the software Dynamic Signatures Generated by Regulatory Networks (DSGRN), a software package that is used to explore the dynamics generated by a regulatory network. By extending its functionalities, we deduce the global dynamical information of the ODE and extract information regarding equilibria, periodic orbits, connecting orbits and bifurcations. We validate our results through algebraic topological tools and analytical bounds, and the effectiveness of this framework is demonstrated through several examples and possible future directions. Copyright © 2024, The Authors. All rights reserved.

关键词： Ordinary differential equations

来源：评论

学校读者我要写书评

暂无评论

Faster Greedy Optimization of Resistance-based Graph Robustness

Faster Greedy Optimization of Resistance-based Graph Robustn...

引用

International Conference on Advances in Social Network Analysis and Mining, ASONAM

作者： Maria Predari Robert Kooij Henning Meyerhenke Department of Computer Science Humboldt-Universität zu Berlin Berlin Germany Faculty of Electrical Engineering Mathematics and Computer Science Delft University of Technology Delft The Netherlands

The total effective resistance, also called the Kirchhoff index, provides a robustness measure for a graph $G$ . We consider the optimization problem of adding $k$ new edges to $G$ such that the resulting graph has minimal total effective resistance (i. e., is most robust). The total effective resistance and effective resistances between nodes can be computed using the pseudoinverse of the graph Laplacian. The pseudoinverse may be computed explicitly via pseudoinversion; yet, this takes cubic time in practice and quadratic space. We instead exploit combinatorial and algebraic connections to speed up gain computations in established generic greedy heuristics. Moreover, we leverage existing randomized techniques to boost the performance of our approaches by introducing a sub-sampling step. Our different graph- and matrix-based approaches are indeed significantly faster than the state-of-the-art greedy algorithm, while their quality remains reasonably high and is often quite close. Our experiments show that we can now process large graphs for which the application of the state-of-the-art greedy approach was infeasible before. As far as we know, we are the first to be able to process graphs with $100K+$ nodes in the order of minutes.

关键词： Resistance Greedy algorithms Laplace equations Social networking (online) Robustness Indexes electrical resistance measurement

来源：评论

学校读者我要写书评

暂无评论

Robust Quadrotor Control: An Adaptive Synergetic Approach with Parallel Feedforward Compensation

Robust Quadrotor Control: An Adaptive Synergetic Approach wi...

引用

International Conference on Systems and Control (ICSC)

作者： Khalil Mokhtari Abdelhafid Elhadri Mourad Abdelaziz Saadi Achour Department of Electrical Engineering University Abbes Laghrour of Khenchela Algeria Laboratoire d'ingenierie des systemes de versailles Universite de Versailles Saint Quentin en Yvelines Velizy France Department of Electrical Engineering Laboratoire d’ Automatique de Setif Ferhat Abbas University of Setif Setif Algeria Laboratory of Pure and Applied Mathematics University Amar Telidji of Laghouat Laghouat Algeria

ISBN: (数字)9798331531812

ISBN: (纸本)9798331531829

This paper proposes an advanced approach for Quadrotor attitude control using robust adaptive control based on the property of almost passivity. The method addresses the inherent challenges of Quadrotor systems, particularly their lack of strict passivity, as well as the stability issues in the presence of uncertainties and external disturbances. To mitigate these challenges, a Parallel Feedforward Compensator (PFC) is introduced to render the Quadrotor Almost Strictly Passive (ASP), and an Adaptive Synergetic Control (ASC) method is implemented. The combination of PFC and ASC facilitates the stable implementation of the control system. The performance of the proposed ASC is evaluated through simulations and compared with PID and an adaptive backstepping controller.

关键词： Adaptation models Backstepping Uncertainty Simulation Control systems Stability analysis Trajectory Feedforward systems Thermal stability Quadrotors

来源：评论

学校读者我要写书评

暂无评论

Comparative performance of machine learning models for temperature prediction in vanadium redox flow batteries

Comparative performance of machine learning models for tempe...

引用

International Conference on Green Energy, Computing and Intelligent Technology 2024 (GEn-CITy 2024)

作者： Anxiu Zhang Filbert H. Juwono Hongfei Li Erick Purwanto W. K. Wong Linfeng Liu Telecommunications Engineering Program Xi'an Jiaotong-Liverpool University Suzhou People's Republic of China Department of Electrical and Electronic Engineering Xi'an Jiaotong-Liverpool University Suzhou People's Republic of China Applied Mathematics Program Xi'an Jiaotong-Liverpool University Suzhou People's Republic of China Department of Computing Xi'an Jiaotong-Liverpool University Suzhou People's Republic of China Department of Electrical and Computer Engineering Curtin University Malaysia Miri Malaysia Sustainable Energy Technology Program Xi'an Jiaotong-Liverpool University Suzhou People's Republic of China

ISBN: (数字)9781837242863

Vanadium Redox Flow Batteries (VRFB) are promising for large-scale energy storage due to their long life and environmental benefits. Accurate temperature prediction is key to optimizing VRFB performance and longevity. This study compares the performance of four machine learning models, i.e., 1D CNN, Particle Swarm Optimization - Support Vector Regressor (PSO-SVR), Decision Tree (DT), and K-Nearest Neighbors (KNN), using a publicly available dataset. Results show that KNN achieves the best results with test Root Mean Square Error (RMSE) of 0.0424 (average) and test R2 of 0.9746 (average), demonstrating strong predictive accuracy. 1D CNN, however, shows poor generalization. These findings suggest that non-parametric models like KNN and DT are highly effective for VRFB temperature prediction.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A $(k, n)$-Secret Image Sharing With Steganography Using Generalized Tent Map

A $(k, n)$-Secret Image Sharing With Steganography Using Gen...

引用

International Conference on Modern Circuits and Systems Technologies (MOCAST)

作者： Bishoy K. Sharobim Salwa K. Abd-El-Hafiz Ahmed G. Radwan Heba K. Aslan Nanoelectronics Integrated Systems Center (NISC) Nile University Giza Egypt Centre of Informatics Science Faculty of Information Technology and Computer Science Nile University Giza Egypt Engineering Mathematics and Physics Department Faculty of Engineering Cairo University Giza Egypt School of Engineering and Applied Sciences Nile University Giza Egypt

ISBN: (数字)9798350385427

ISBN: (纸本)9798350385434

Secret Image Sharing (SIS) transfers an image to mutually suspicious receivers as $n$ meaningless shares, where $k$ or more shares must be present to recover the secret. This paper proposes a $(k, n)$ -SIS system for any image type using polynomial interpolation based on Lagrange polynomials, where the generated shares are of size $1/k$ of the secret image size. A full encryption system, consisting of substitution and permutation stages, is employed by using the generalized Tent map as a source of randomness. In addition to using a long and sensitive system key, steganography using the Least Significant Bits (LSBs) embedding technique is utilized to improve security. Detailed experimental analysis of the security, robustness and performance of the proposed system is provided, which is more comprehensive than the analyses given in other related works. Security is demonstrated using statistical tests, and robustness against noise and cron attacks is validated.

关键词： Steganography Interpolation Circuits and systems Noise Receivers Robustness Polynomials

来源：评论

学校读者我要写书评

暂无评论

A Stochastic Gradient Approach for Communication Efficient Confederated Learning

A Stochastic Gradient Approach for Communication Efficient C...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Bin Wang Jun Fang Hongbin Li Yonina C. Eldar Yangtze Delta Region Institute (Huzhou) University of Electronic Science and Technology of China (UESTC) Huzhou China National Key Laboratory of Wireless Communications UESTC China Department of Electrical and Computer Engineering Stevens Institute of Technology USA Faculty of Mathematics and Computer Science Weizmann Institute of Science Israel

In this work, we consider a multi-server federated learning (FL) framework, referred to as Confederated Learning (CFL), in order to accommodate a larger number of users. To reduce the communication overhead of the CFL system, we propose a linearly convergent stochastic gradient method. The proposed algorithm incorporates a conditionally-triggered user selection (CTUS) mechanism as the central component. Simulation results show that it achieves advantageous communication efficiency over GT-SAGA.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：