A silicon solar cell with a power conversion efficiency (PCE)of 4% was born in Bell Lab in 1954, seven decades ago. Today,silicon solar cells have reached an efficiency above 25%and achieved pervasive commercial succe...
A silicon solar cell with a power conversion efficiency (PCE)of 4% was born in Bell Lab in 1954, seven decades ago. Today,silicon solar cells have reached an efficiency above 25%and achieved pervasive commercial success [1]. In spite of the steady improvement in efficiency, the interest and enthusiasm in search for new materials and innovative device architectures for newgeneration solar cells have never diminished or subsided;
Wide field of view and light weight optics are critical for advanced eyewear,with applications in augmented/virtual reality and night *** refractive lenses are often stacked to correct aberrations at a wide field of v...
详细信息
Wide field of view and light weight optics are critical for advanced eyewear,with applications in augmented/virtual reality and night *** refractive lenses are often stacked to correct aberrations at a wide field of view,leading to limited performance and increased size and *** particular,simultaneously achieving a wide field of view and large aperture for light collection is desirable but challenging to realize in a compact ***,we demonstrate a wide field of view(greater than 60°)meta-optic doublet eyepiece with an entrance aperture of 2.1 *** the design wavelength of 633 nm,the meta-optic doublet achieves comparable performance to a refractive lens-based eyepiece *** meta-doublet eyepiece illustrates the potential for meta-optics to play an important role in the development of high-quality monochrome near-eye displays and night vision systems.
The integration of Large Language Models (LLMs) like GPT-4 with Extended Reality (XR) technologies offers the potential to build truly immersive XR environments that interact with human users through natural language,...
详细信息
This paper presents a method for the optimized reconfiguration of radial distribution systems that explicitly considers the protection systems constraints. A fully automated method based on graph analysis is proposed ...
详细信息
Coping with noise in computing is an important problem to consider in large systems. With applications in fault tolerance (Hastad et al., 1987;Pease et al., 1980;Pippenger et al., 1991), noisy sorting (Shah and Wainwr...
详细信息
Coping with noise in computing is an important problem to consider in large systems. With applications in fault tolerance (Hastad et al., 1987;Pease et al., 1980;Pippenger et al., 1991), noisy sorting (Shah and Wainwright, 2018;Agarwal et al., 2017;Falahatgar et al., 2017;Heckel et al., 2019;Wang et al., 2024a;Gu and Xu, 2023;Kunisky et al., 2024), noisy searching (Berlekamp, 1964;Horstein, 1963;Burnashev and Zigangirov, 1974;Pelc, 1989;Karp and Kleinberg, 2007), among many others, the goal is to devise algorithms with the minimum number of queries that are robust enough to detect and correct the errors that can happen during the computation. In this work, we consider the noisy computing of the threshold-k function. For n Boolean variables x = (x1, ..., xn) ∈ {0, 1}n, the threshold-k function THk(·) computes whether the number of 1's in x is at least k or not, i.e., (Equation presented) The noisy queries correspond to noisy readings of the bits, where at each time step, the agent queries one of the bits, and with probability p, the wrong value of the bit is returned. It is assumed that the constant p ∈ (0, 1/2) is known to the agent. Our goal is to characterize the optimal query complexity for computing the THk function with error probability at most δ. This model for noisy computation of the THk function has been studied by Feige et al. (1994), where the order of the optimal query complexity is established;however, the exact tight characterization of the optimal number of queries is still open. In this paper, our main contribution is tightening this gap by providing new upper and lower bounds for the computation of the THk function, which simultaneously improve the existing upper and lower bounds. The main result of this paper can be stated as follows: for any 1 ≤ k ≤ n, there exists an algorithm that computes the THk function with an error probability at most δ = o(1), and the algorithm uses at most (Equation presented) queries in expectation. Here we define m (Eq
With increasing climate variability, extreme weather events like heatwaves pose significant challenges to the operation of interdependent power and gas networks. These events result in surges in electricity and gas de...
详细信息
As the modern bulk power system (BPS) expands and electricity users increase, an ever-growing amount of power data needs to be processed. The recommender system (RS), as an artificial intelligence (AI) algorithm, leve...
详细信息
Trevor S. Bird's discussion in IEEE Antennas and Propagation magazine (December 2023) provides an excellent overview of Michael Faraday's role in one of the most important aspects of the development of electro...
详细信息
This paper presents a method for detecting a known target (e.g., trees) in hyperspectral images using spectral matching techniques. The pure spectral signature of the target material is used to identify and locate the...
详细信息
A common challenge when applying transfer learning to specific domains is imbalanced datasets, where some classes have significantly fewer samples than others. This can skew the model's predictions toward the majo...
详细信息
暂无评论