Results 131 to 140 of about 536,987 (307)

Intrinsic Photoactive Star ZnPc–Poly(glutamate) Nanoplatforms for Multimodal Glioblastoma Therapy and Brain‐Targeted Delivery

open access: yesAdvanced Functional Materials, EarlyView.
An intrinsic photoactive star‐shaped zinc phtalocyanine‐poly(L‐glutamic acid) (ZnPc‐PGA) nanoplatform for multimodal glioblastoma (GBM) therapy and brain‐targeted elivery. A ZnPc‐PGA‐based multifunctional theranostic nanocarrier platform enables image‐guided, multimodal GBM therapy. ZnPc‐PGA nanocarriers support the integration of fluorescence imaging,
Amina Benaicha‐Fernández   +14 more
wiley   +1 more source

A column generation approach to solve the crew re-scheduling problem

open access: yes
When tracks are out of service for maintenance during a certainperiod, trains cannot be operated on those tracks. This leads to amodified timetable, and results in infeasible rolling stock andcrew schedules. Therefore, these schedules need to be repaired.
Huisman, D.
core  

Problem set 8

open access: yes, 2011
This article introduces a regular problem section in the Australian Senior Mathematics Journal. It notes that the section aims to give readers an opportunity to exchange interesting mathematical problems and solutions.
Yevdokimov, Oleksiy
core  

Solution‐Processed Two‐Dimensional Indium Oxide on Sodium‐Embedded Alumina for Reconfigurable Optoelectronic Synaptic Transistors

open access: yesAdvanced Functional Materials, EarlyView.
Wafer‐scale two‐dimensioanl In2Se3 oxidized into InOx on sodium‐embedded beta‐alumina enables multifunctional reconfigurable electronics. Sodium ions accumulate within distinct spatial distribution under drain‐controlle and gate‐controlled operation. Drain‐control operation gives controllability of ultraviolet‐driven optoelectronic synaptic conductance
Jinhong Min   +13 more
wiley   +1 more source

Optimizing Bus Driver Scheduling: A Set Covering Approach for Reducing Transportation Costs

open access: yesApplied System Innovation
Cutting operational costs is a critical component for transportation agencies. To reduce these costs, agencies must optimize their scheduling. Typically, the total operating costs of transport include vehicle expenses and driver wages. Solving such tasks
Viktor Sándor Árgilán   +1 more
doaj   +1 more source

Integrated Field‐Free SOT Domain‐Wall Synapses and MTJ Stochastic Neurons for Hardware Boltzmann Machines

open access: yesAdvanced Functional Materials, EarlyView.
Field‐free spin‐orbit torque domain‐wall synapses integrated with stochastic MTJ neurons enable compact hardware Boltzmann machines. Leveraging intrinsic stochasticity and multi‐level conductance, the system achieves efficient probabilistic learning with high accuracy, demonstrating a scalable spintronic platform for energy‐efficient edge AI.
Aijaz H. Lone   +8 more
wiley   +1 more source

Set-covering-based algorithm for delay constrained relay node placement in Wireless Sensor Networks

open access: yes, 2016
As Wireless Sensor Networks (WSNs) are widely used in time-critical applications, e.g., factory automation and smart grid, the importance of Delay Constrained Relay Node Placement (DCRNP) problem is becoming increasingly noticeable. This paper proposes a
Ma CF(马超凡)   +2 more
core  

Historical Foundation and Practical Guideline for Ferroelectric Switching Kinetic Studies

open access: yesAdvanced Functional Materials, EarlyView.
The P and U pulses in the conventional PUND measurements are not identical because of the interplay between switching current and the measurement circuit components. This circuit effect can lead to a shift in polarization transients and misinterpreted physics in the switching kinetics.
Yi Liang, Pat Kezer, John T. Heron
wiley   +1 more source

An Experimental Study of Transfer Functions and Binarization Strategies in Binary Arithmetic Optimization Algorithms for the Set Covering Problem

open access: yesMathematics
Metaheuristics have proven to be effective in solving large-scale combinatorial problems by combining global exploration with local exploitation, all within a reasonably short time.
Broderick Crawford   +6 more
doaj   +1 more source

Approximation hardness of optimization problems in intersection graphs of d-dimensional boxes

open access: yes, 2005
The Maximum Independent Set problem in d-box graphs, i.e., in the intersection graphs of axis-parallel rectangles in R d , is a challenge open problem. For any fixed d ≥ 2 the problem is NP-hard and no approximation algorithm with ratio o(log d−1 n) is ...
Chlebikova, Janka   +5 more
core  

Home - About - Disclaimer - Privacy