Results 71 to 80 of about 21,280 (301)

Evolution of single-particle structure and beta-decay near 78Ni

open access: yesEPJ Web of Conferences, 2012
The extended self-consistent beta-decay model has been applied for bet-decay rates and delayed neutron emission probabilities of spherical neutron-rich isotopes near the r-process paths.
Borzov I. N.
doaj   +1 more source

Pion–nucleon correlations in finite nuclei in a relativistic framework: Effects on the shell structure

open access: yesPhysics Letters B, 2016
The relativistic particle-vibration coupling (RPVC) model is extended by the inclusion of isospin-flip excitation modes into the phonon space, introducing a new mechanism of dynamical interaction between nucleons with different isospin in the nuclear ...
Elena Litvinova
doaj   +1 more source

Real‐World Safety and Effectiveness of JAK Inhibitors in Systemic Sclerosis: A Propensity‐Matched Study from the EUSTAR Cohort

open access: yesArthritis Care &Research, Accepted Article.
Objective JAK inhibitors (JAKis) have shown promising effects in early‐phase studies of SSc. We aimed to assess the safety and explore effectiveness of JAKis compared to conventional immunosuppressants in SSc. Methods A longitudinal retrospective study of the EUSTAR cohort was performed.
Stefano Di Donato   +27 more
wiley   +1 more source

Characterization of Defect Distribution in an Additively Manufactured AlSi10Mg as a Function of Processing Parameters and Correlations with Extreme Value Statistics

open access: yesAdvanced Engineering Materials, EarlyView.
Predicting extreme defects in additive manufacturing remains a key challenge limiting its structural reliability. This study proposes a statistical framework that integrates Extreme Value Theory with advanced process indicators to explore defect–process relationships and improve the estimation of critical defect sizes. The approach provides a basis for
Muhammad Muteeb Butt   +8 more
wiley   +1 more source

Blocking probabilities in multiservice networks with unicast and multicast connections

open access: yes, 2020
This paper is concerned with blocking probabilities in loss networks where both multicast and unicast connections are present. Each connection specifies a route and a bandwidth requirement.
Yarkina N., Samouylov K.
core  

Blocking probabilities in a loss system with arrivals in geometrically distributed batches and heterogeneous service requirements [PDF]

open access: yes, 1992
The authors analyze a generalization of the classical Erlang loss model. Customers of several types contend for access to a service facility consisting of a finite number of servers.
van Doorn, Erik A., Panken, Frans J.M.
core   +1 more source

Computing Call Blocking Probabilities in Wavelength Routing Networks

open access: yes, 1999
We study a class of circuit switched wavelength routing networks with fixed or alternate routing, with or without converts, and with various wavelength allocation policies.We first construct an exact Markov process and an approximate Markovprocess which
Zhu, Yuhong
core   +1 more source

A Channel Allocation Mechanism for Cellular Networks

open access: yesInventions, 2017
In cellular networks, call blocking causes lower customer satisfaction and economic loss. Therefore, the channel allocation for call block avoidance is an important issue.
Chi-Hua Chen   +3 more
doaj   +1 more source

What Do Large Language Models Know About Materials?

open access: yesAdvanced Engineering Materials, EarlyView.
If large language models (LLMs) are to be used inside the material discovery and engineering process, they must be benchmarked for the accurateness of intrinsic material knowledge. The current work introduces 1) a reasoning process through the processing–structure–property–performance chain and 2) a tool for benchmarking knowledge of LLMs concerning ...
Adrian Ehrenhofer   +2 more
wiley   +1 more source

A tight bound on the throughput of queueing networks with blocking [PDF]

open access: yes
In this paper, we present a bounding methodology that allows to compute a tight lower bound on the cycle time of fork--join queueing networks with blocking and with general service time distributions. The methodology relies on two ideas.
SEMAL, Pierre   +2 more
core  

Home - About - Disclaimer - Privacy