SearcharxivSearch

arXiv subjects

Ning Zhao

Publications and source records attributed to Ning Zhao.

17 recordsLinked to original sources

Study on Thickness and Temperature Dependence of Thermoelectric Properties in SnS Nanofilms

SnS as an environmentally friendly, cost-effective, and earth-abundant narrow-bandgap semiconductor material, has demonstrated significant application potential in the field of medium-temperature thermoelectric conversion. However, the thermoelectric performance of its bulk counterpart is inherently constrained by intrinsic point defects (e.g., vacancies) and the material's specific band structure. Low-dimensional engineering has emerged as a pivotal strategy for overcoming these limitations and enhancing thermoelectric performance. In this work, we systematically investigate the thermoelectric properties of SnS nanofilms with distinct thicknesses (82 nm, 199 nm, 616 nm, and 813 nm) across a temperature range of 300-600 K. Measurements were conducted using time-domain thermoreflectance (TDTR) and a dedicated thin-film thermoelectric parameter test system (ZEM-3). Our results confirm that low-dimensionalization effectively boosts the thermoelectric performance of SnS, with the thermoelectric figure of merit (ZT) displaying a pronounced dependence on both film thickness and temperature. All four SnS thin films exhibit thermoelectric performance that is markedly superior to that of bulk SnS. This enhancement is primarily attributed to the quantum confinement effect, energy filtering effect, and intensified phonon scattering, all of which are induced by the low-dimensional structural characteristics. This work provides not only experimental evidence and theoretical insights for the performance optimization of SnS nanofilms but also establishes a foundational framework for the development of high-efficiency, eco-friendly medium-temperature thermoelectric materials, thereby holding significant scientific value and practical implications.

cond-mat.mtrl-sci

LabOS: The AI-XR Co-Scientist That Sees and Works With Humans

Modern science advances fastest when thought meets action. LabOS represents the first AI co-scientist that unites computational reasoning with physical experimentation through multimodal perception, self-evolving agents, and Extended-Reality(XR)-enabled human-AI collaboration. By connecting multi-model AI agents, smart glasses, and robots, LabOS allows AI to see what scientists see, understand experimental context, and assist in real-time execution. Across applications -- from cancer immunotherapy target discovery to stem-cell engineering and material science -- LabOS shows that AI can move beyond computational design to participation, turning the laboratory into an intelligent, collaborative environment where human and machine discovery evolve together.

cs.AI

Observation of Berry Curvature-Enhanced Anomalous Photo-Nernst Effect in Magnetic Weyl Semimetal

The anomalous Nernst effect is the thermoelectric counterpart of the anomalous Hall effect, which can emerge in magnetic materials or topological materials without magnetic field. Such effect is critical to both fundamental topological physics and various application fields, including energy harvesting, spintronics and optoelectronics. In this work, we observe the anomalous photo-Nernst effect, which use light excitation to generate temperature gradients for the thermoelectric response. Our experiments reveal a pronounced edge photocurrent response in magnetic Weyl semimetal Co3Sn2S2 under zero magnetic field, originating from the anomalous photo-Nernst effect. The pronounced photo-Nernst current benefits from the exceptional properties of Co3Sn2S2, including the large thermoelectric coefficient, topologically enhanced anomalous response of Weyl bands and the Shockley-Ramo nature of long-range photocurrent generation. Furthermore, by comparing the nominal anomalous Nernst coefficient under different wavelength excitations, we observe a clear enhancement in the mid-infrared region, originating from the topological contribution from the large Berry curvature of Weyl bands. Our results reveal the interplay among light, magnetism, and topological order in magnetic Weyl semimetals, which not only offers insights for fundamental physics but also advances potential applications in quantum devices.

cond-mat.mtrl-sci

A Microgravity Simulation Experimental Platform For Small Space Robots In Orbit

This study describes the development and validation of a novel microgravity experimental platform that is mainly applied to small robots such as modular self-reconfigurable robots. This platform mainly consists of an air supply system, a microporous platform and glass. By supplying air to the microporous platform to form an air film, the influence of the weight of the air foot and the ventilation hose of traditional air-float platforms on microgravity experiments is solved. The contribution of this work is to provide a platform with less external interference for microgravity simulation experiments on small robots.

cs.RO

Stochastic Multi-objective Multi-trip AMR Routing Problem with Time Windows

In recent years, with the rapidly aging population, alleviating the pressure on medical staff has become a critical issue. To improve the work efficiency of medical staff and reduce the risk of infection, we consider the multi-trip autonomous mobile robot (AMR) routing problem with the stochastic environment to find the solution to minimizing the total expected operating cost and maximizing the total service quality of patients so that each route violates the vehicle capacity and the time window with only a very small probability. The travel time of AMRs is stochastic affected by the surrounding environment, the demand for each ward is unknown until the AMR reaches the ward, and the service time is linearly related to the actual demand. We develop a population-based tabu search algorithm (PTS) that combines the genetic algorithm with the tabu search algorithm to solve the problem. Extensive numerical experiments were conducted on the modified Solomon instances to show that the PTS algorithm the efficient and reveals the impacts of the confidence level on the optimal solution, providing insights for the decision-maker to devise delivery schemes that trade-off the operating cost for patient satisfaction.

math.OC

Human-machine cooperation: optimization of drug retrieval sequencing in automated drug dispensing systems

Automated drug dispensing systems (ADDSs) are increasingly in demand in today's pharmacies, primarily driven by the growing ageing population. Recognizing the practical challenges faced by pharmacies implementing ADDSs, this study aims to optimize the layout design and sequencing issues within a human-machine cooperation environment to enhance the system throughput of ADDSs. Specifically, we develop models for drug retrieval sequencing under different system layout designs, taking into account the stochastic sorting time of pharmacists. The prescription order arrival pattern follows a successive arrival mode. To assess the efficiency of ADDSs with one input/output point and two input/output points, we propose dual command retrieval sequencing models that optimize the retrieval sequence of drugs in adjacent prescription orders. Notably, our models incorporate the stochastic sorting time of pharmacists to analyze its impact on ADDS performance. Through experimental comparisons of average picking times for prescription orders under various operational conditions, we demonstrate that a system layout design incorporating two input/output points significantly enhances the efficiency of prescription order fulfilment within a human-machine cooperation environment. Furthermore, our proposed retrieval sequencing method outperforms dynamic programming, greedy, and random strategies in terms of improving prescription order-picking efficiency. By addressing the layout design and sequencing challenges, our research contributes to the field of intelligent warehousing, particularly in smart pharmacies. The findings provide valuable insights for healthcare facilities and organizations seeking to optimize ADDS performance and enhance drug dispensing efficiency.

eess.SY

Order picking efficiency: A scattered storage and clustered allocation strategy in automated drug dispensing systems

In the smart hospital, optimizing prescription order fulfilment processes in outpatient pharmacies is crucial. A promising device, automated drug dispensing systems (ADDSs), has emerged to streamline these processes. These systems involve human order pickers who are assisted by ADDSs. The ADDS's robotic arm transports bins from storage locations to the input/output (I/O) points, while the pharmacist sorts the requested drugs from the bins at the I/O points. This paper focuses on coordinating the ADDS and the pharmacists to optimize the order-picking strategy. Another critical aspect of order-picking systems is the storage location assignment problem (SLAP), which determines the allocation of drugs to storage locations. In this study, we consider the ADDS as a smart warehouse and propose a two-stage scattered storage and clustered allocation (SSCA) strategy to optimize the SLAP for ADDSs. The first stage primarily adopts a scattered storage approach, and we develop a mathematical programming model to group drugs accordingly. In the second stage, we introduce a sequential alternating (SA) heuristic algorithm that takes into account the drug demand frequency and the correlation between drugs to cluster and locate them effectively. To evaluate the proposed SSCA strategy, we develop a double objective integer programming model for the order-picking problem in ADDSs to minimize the number of machines visited in prescription orders while maintaining the shortest average picking time of orders. The numerical results demonstrate that the proposed strategy can optimize the SLAP in ADDSs and improve significantly the order-picking efficiency of ADDSs in a human-robot cooperation environment.

stat.AP

A Quick Response Algorithm for Dynamic Autonomous Mobile Robot Routing Problem with Time Windows

This paper investigates the optimization problem of scheduling autonomous mobile robots (AMRs) in hospital settings, considering dynamic requests with different priorities. The primary objective is to minimize the daily service cost by dynamically planning routes for the limited number of available AMRs. The total cost consists of AMR's purchase cost, transportation cost, delay penalty cost, and loss of denial of service. To address this problem, we have established a two-stage mathematical programming model. In the first stage, a tabu search algorithm is employed to plan prior routes for all known medical requests. The second stage involves planning for real-time received dynamic requests using the efficient insertion algorithm with decision rules, which enables quick response based on the time window and demand constraints of the dynamic requests. One of the main contributions of this study is to make resource allocation decisions based on the present number of service AMRs for dynamic requests with different priorities. Computational experiments using Lackner instances demonstrate the efficient insertion algorithm with decision rules is very fast and robust in solving the dynamic AMR routing problem with time windows and request priority. Additionally, we provide managerial insights concerning the AMR's safety stock settings, which can aid in decision-making processes.

math.OC

The Multi-Trip Autonomous Mobile Robot Scheduling Problem with Time Windows in a Stochastic Environment at Smart Hospitals

Autonomous mobile robots (AMRs) play a crucial role in transportation and service tasks at hospitals, contributing to enhanced efficiency and meeting medical demands. This paper investigates the optimization problem of scheduling strategies for AMRs at smart hospitals, where the service and travel times of AMRs are stochastic. A stochastic mixed-integer programming model is formulated to minimize the total cost of the hospital by reducing the number of AMRs and travel distance while satisfying constraints such as AMR battery state of charge, AMR capacity, and time windows for medical requests. To address this objective, some properties of the solutions with time window constraints are identified. The variable neighborhood search (VNS) algorithm is adjusted by incorporating the properties of the AMR scheduling problem to solve the model. Experimental results demonstrate that VNS generates high-quality solutions. Both enhanced efficiency and the meeting of medical demands are achieved through intelligently arranging the driving routes of AMRs for both charging and service requests, resulting in substantial cost reductions for hospitals and enhanced utilization of medical resources.

cs.RO

Stochastic scheduling of autonomous mobile robots at hospitals

This paper studies the scheduling of autonomous mobile robots (AMRs) at hospitals where the stochastic travel times and service times of AMRs are affected by the surrounding environment. The routes of AMRs are planned to minimize the daily cost of the hospital (including the AMR fixed cost, penalty cost of violating the time window, and transportation cost). To efficiently generate high-quality solutions, some properties are identified and incorporated into an improved tabu search (I-TS) algorithm for problem-solving. Experimental evaluations demonstrate that the I-TS algorithm outperforms existing methods by producing high-quality solutions. Based on the characteristics of healthcare requests and the AMR working environment, scheduling AMRs reasonably can effectively provide medical services, improve the utilization of medical resources, and reduce hospital costs.

cs.RO

Fully Automated Deep Learning-enabled Detection for Hepatic Steatosis on Computed Tomography: A Multicenter International Validation Study

Despite high global prevalence of hepatic steatosis, no automated diagnostics demonstrated generalizability in detecting steatosis on multiple international datasets. Traditionally, hepatic steatosis detection relies on clinicians selecting the region of interest (ROI) on computed tomography (CT) to measure liver attenuation. ROI selection demands time and expertise, and therefore is not routinely performed in populations. To automate the process, we validated an existing artificial intelligence (AI) system for 3D liver segmentation and used it to purpose a novel method: AI-ROI, which could automatically select the ROI for attenuation measurements. AI segmentation and AI-ROI method were evaluated on 1,014 non-contrast enhanced chest CT images from eight international datasets: LIDC-IDRI, NSCLC-Lung1, RIDER, VESSEL12, RICORD-1A, RICORD-1B, COVID-19-Italy, and COVID-19-China. AI segmentation achieved a mean dice coefficient of 0.957. Attenuations measured by AI-ROI showed no significant differences (p = 0.545) and a reduction of 71% time compared to expert measurements. The area under the curve (AUC) of the steatosis classification of AI-ROI is 0.921 (95% CI: 0.883 - 0.959). If performed as a routine screening method, our AI protocol could potentially allow early non-invasive, non-pharmacological preventative interventions for hepatic steatosis. 1,014 expert-annotated liver segmentations of patients with hepatic steatosis annotations can be downloaded here: https://drive.google.com/drive/folders/1-g_zJeAaZXYXGqL1OeF6pUjr6KB0igJX.

eess.IV

Convex Optimization of Speed and Energy Management System for Fuel Cell Hybrid Trains

We look into minimizing the hydrogen fuel consumption of hydrogen hybrid trains by optimizing their operation. The powertrain considered is a fuel cell charge-sustaining hybrid. Convex optimization is utilized to compute optimal speed and energy management trajectories. The barrier method is used to solve the optimization problems quickly on the order of tens of seconds for the entire journey. Simulations show a considerable reduction in fuel consumption when both trajectories -- speed and energy management -- are optimized concurrently within a single optimization problem in comparison to being optimized separately in a sequential manner -- optimizing energy management after optimizing speed. It is concluded that the concurrent method greatly benefits from its holistic powertrain knowledge while optimizing all trajectories together within a single optimization problem.

eess.SY

Is the Skip Connection Provable to Reform the Neural Network Loss Landscape?

The residual network is now one of the most effective structures in deep learning, which utilizes the skip connections to ``guarantee" the performance will not get worse. However, the non-convexity of the neural network makes it unclear whether the skip connections do provably improve the learning ability since the nonlinearity may create many local minima. In some previous works \cite{freeman2016topology}, it is shown that despite the non-convexity, the loss landscape of the two-layer ReLU network has good properties when the number $m$ of hidden nodes is very large. In this paper, we follow this line to study the topology (sub-level sets) of the loss landscape of deep ReLU neural networks with a skip connection and theoretically prove that the skip connection network inherits the good properties of the two-layer network and skip connections can help to control the connectedness of the sub-level sets, such that any local minima worse than the global minima of some two-layer ReLU network will be very ``shallow". The ``depth" of these local minima are at most $O(m^{(η-1)/n})$, where $n$ is the input dimension, $η<1$. This provides a theoretical explanation for the effectiveness of the skip connection in deep learning.

cs.LG

Second-Order Convergence of Asynchronous Parallel Stochastic Gradient Descent: When Is the Linear Speedup Achieved?

In machine learning, asynchronous parallel stochastic gradient descent (APSGD) is broadly used to speed up the training process through multi-workers. Meanwhile, the time delay of stale gradients in asynchronous algorithms is generally proportional to the total number of workers, which brings additional deviation from the accurate gradient due to using delayed gradients. This may have a negative influence on the convergence of the algorithm. One may ask: How many workers can we use at most to achieve a good convergence and the linear speedup? In this paper, we consider the second-order convergence of asynchronous algorithms in non-convex optimization. We investigate the behaviors of APSGD with consistent read near strictly saddle points and provide a theoretical guarantee that if the total number of workers is bounded by $\widetilde{O}(K^{1/3}M^{-1/3})$ ($K$ is the total steps and $M$ is the mini-batch size), APSGD will converge to good stationary points ($||\nabla f(x)||\leq ε, \nabla^2 f(x)\succeq -\sqrtε\bm{I}, ε^2\leq O(\sqrt{\frac{1}{MK}}) $) and the linear speedup is achieved. Our works give the first theoretical guarantee on the second-order convergence for asynchronous algorithms. The technique we provide can be generalized to analyze other types of asynchronous algorithms to understand the behaviors of asynchronous algorithms in distributed asynchronous parallel training.

cs.LG

Generalized bioinspired approach to a daytime radiative cooling "skin"

Energy-saving cooling materials with strong operability are desirable towards sustainable thermal management. Inspired by the cooperative thermo-optical effect in fur of polar bear, we develop a flexible and reusable cooling skin via laminating a polydimethylsiloxane film with a highly-scattering polyethylene aerogel. Owing to its high porosity of 97.9% and tailored pore size of 3.8 +- 1.4 micrometers, superior solar reflectance of 0.96 and high transparency to irradiated thermal energy of 0.8 can be achieved at a thickness of 2.7 mm. Combined with low thermal conductivity of 0.032 W/m/K of the aerogel, the cooling skin exerts midday sub-ambient temperature drops of 5-6 degrees in a metropolitan environment, with an estimated limit of 14 degrees under ideal service conditions. We envision that this generalized bilayer approach will construct a bridge from night-time to daytime radiative cooling and pave the way for economical, scalable, flexible and reusable cooling materials.

physics.app-ph

Biomimetic Polymer Film with Brilliant Brightness Using a One-Step Water Vapor-Induced Phase Separation Method

The scales of the white Cyphochilus beetles are endowed with unusual whiteness arising from the exceptional scattering efficiency of their disordered ultrastructure optimized through millions of years of evolution. Here, a simple, one-step method based on water vapor-induced phase separation (VIPS) is developed to prepare ultra-thin polystyrene (PS) films with similar microstructure and comparable optical performance. A typical biomimetic 3.5 um PS film exhibits a diffuse reflectance of 61% at 500 nm, which translates into a transport mean free path below 1 um. A complete optical characterization through Monte Carlo simulations reveals how such scattering performance arises from the scattering coefficient and scattering anisotropy, whose interplay provides insight into the morphological properties of the material. The potential of bright-white coatings as smart sensors or wearable devices is highlighted using a treated ultra-thin film as a real-time sensor for human exhalation.

physics.app-ph

Analysis and Approximation of Dual Tandem Queues with Finite Buffer Capacity

Tandem queues with finite buffer capacity commonly exist in practical applications. By viewing a tandem queue as an integrated system, an innovative approach has been developed to analyze its performance through the insight from reduction method. In our approach, the starvation at the bottleneck caused by service time randomness is modeled and captured by interruptions. Fundamental properties of tandem queues with finite buffer capacity are examined. We show that in general system service rate of a dual tandem queue with finite buffer capacity is equal or smaller than its bottleneck service rate, and virtual interruptions, which are the extra idle period at the bottleneck caused by the non-bottlenecks, depend on arrival rates. Hence, system service rate is a function of arrival rate when the buffer capacity of a tandem queue is finite. Approximation for the mean queue time of a dual tandem queue has been developed through the concept of virtual interruptions.

cs.PF