Results 131 to 140 of about 3,659,008 (292)

A Generalizable Framework for Building Executable Domain‐Specific Large Language Models Under Data Scarcity: Demonstration on Semiconductor Technology Computer‐Aided Design Simulation

open access: yesAdvanced Intelligent Systems, EarlyView.
A schema‐first alignment framework builds compact, executable domain‐specific language models under data scarcity. Large‐scale synthetic question‐answer generation instills domain knowledge, and a code‐centric IR‐to‐DPO pipeline aligns generation with tool‐executable syntax.
Di Wang   +4 more
wiley   +1 more source

On graphs with prescribed chromatic number and subset index [PDF]

open access: yesContributions to Mathematics, 2022
Gary Chartrand   +2 more
doaj   +1 more source

HeaTrace: A Parametric Design‐to‐Fabrication Workflow for Thermally Programmable Soft Robots

open access: yesAdvanced Intelligent Systems, EarlyView.
A programmable thermal actuation workflow enables soft robots to be designed and fabricated with embedded heaters that drive multiple responses. By combining performance‐driven heater design with multimaterial fabrication, the system supports thermally triggered shape change, stiffness tuning, and thermochromic visual response, as demonstrated through ...
Naresh Kumar Thanigaivel   +9 more
wiley   +1 more source

Direct UV-written Bragg gratings for waveguide characterisation and advanced applications

open access: yes, 2013
Direct UV writing is an established fabrication technique allowing channel waveguides and photonic circuits to be defined in a photosensitive glass via an inscription method.
Rogers, Helen L.
core  

Algebraic methods for chromatic polynomials [PDF]

open access: yes, 2003
The chromatic polynomials of certain families of graphs can be calculated by a transfer matrix method. The transfer matrix commutes with an action of the symmetric group on the colours.
Reinfeld, Philipp Augustin
core  

Machine‐Learning‐Guided Discovery of Boron‐Free Narrowband Blue Thermally Activated Delayed Fluorescence Emitters

open access: yesAngewandte Chemie, Volume 138, Issue 39, 21 September 2026.
A data‐driven discovery engine—exhaustive enumeration of carbazole‐containing polycyclic aromatic hydrocarbons (Cz‐PAHs) followed by machine learning—identifies boron‐free, narrowband blue thermally activated delayed fluorescence emitters for organic light‐emitting diodes (OLEDs).
Masaya Hagai   +6 more
wiley   +1 more source

Chromatic Index of Hypergraphs and Shannon’s Theorem

open access: yesEuropean Journal of Combinatorics, 2000
Let \(G\) be a multigraph without loops and let \(\chi '(G)\) be its chromatic index. A classical theorem of Shannon states that \(\chi '(G)\leq \lfloor \frac{3}{2}\Delta (G)\rfloor \). For a hypergraph \(H\), the 2-section of \(H\) is a multigraph \([H]_{2}\) without loops on the vertex set \(V(H)\), with \(k\) parallel edges between vertices \(u ...
openaire   +2 more sources

One Molecular Platform, Three Distinct Narrowband Organoboron TADF Emitters: A Divergent One‐Pot Strategy From Green to Red

open access: yesAngewandte Chemie, EarlyView.
One platform–three emitters: Divergent one‐pot borylation of a single indolocarbazole platform exploits competing mono‐ and double‐borylation pathways to generate three spectrally distinct organoboron MR‐TADF emitters spanning green to red, enabling color‐tunable narrowband OLEDs with external quantum efficiencies over 30%.
Jun Hyeon Lee   +2 more
wiley   +1 more source

The irregular chromatic index of trees

open access: yes, 2013
A graph G is locally irregular if adjacent vertices of G have distinct degrees. An edge colouring of G is locally irregular if each of its colours induces a locally irregular subgraph of G. The irregular chromatic index of G refers to the least number of
Baudon, Olivier   +2 more
core   +3 more sources

Strong chromatic index of subcubic planar multigraphs

open access: yes, 2016
The strong chromatic index of a multigraph is the minimum k such that the edge set can be k-colored requiring that each color class induces a matching. We verify a conjecture of Faudree, Gyarfas, Schelp and Tuza, showing that every planar multigraph with
Kostochka, A. V.   +3 more
core   +1 more source

Home - About - Disclaimer - Privacy