Results 231 to 240 of about 323,104 (281)

Real‐World Investigation of Satralizumab in Patients With Neuromyelitis Optica Spectrum Disease

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Satralizumab, a monoclonal antibody targeting the interleukin‐6 receptor, has demonstrated efficacy in clinical trials for neuromyelitis optica spectrum disorder (NMOSD). However, its real‐world effectiveness and safety compared to conventional immunosuppressive therapies remain uncertain.
Li‐Tsung Lin   +2 more
wiley   +1 more source

Fibrinogen Changes Before and After Intravenous Thrombolysis as Predictors of Cerebral Injury and Clinical Outcomes in Acute Ischemic Stroke: A Multicenter Prospective Cohort Study

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Plasma fibrinogen is essential in thrombosis and fibrinolysis, yet its dynamic changes pre‐ and post‐intravenous thrombolysis (IVT) for predicting brain injury severity and prognosis in acute ischemic stroke (AIS) patients remain unclear.
Wenhai Zhai   +28 more
wiley   +1 more source

Predicting Essential Proteins Based on Weighted Degree Centrality

IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2014
Essential proteins are vital for an organism's viability under a variety of conditions. There are many experimental and computational methods developed to identify essential proteins. Computational prediction of essential proteins based on the global protein-protein interaction (PPI) network is severely restricted because of the insufficiency of the ...
Xiwei, Tang   +3 more
openaire   +4 more sources

Time Scale Degree Centrality: A Time-Variant Approach to Degree Centrality Measures

2011 International Conference on Advances in Social Networks Analysis and Mining, 2011
In this paper, we introduce a time-variant approach to degree centrality measure - time scale degree centrality (TSDC), which considers both presence and duration of links among actors within a network, whereas, the traditional degree centrality approach regards only the presence or absence of links. We illustrate the difference between traditional and
Hossain, L, Uddin, S
openaire   +2 more sources

The Star Degree Centrality Problem: A Decomposition Approach

INFORMS Journal on Computing, 2022
We consider the problem of identifying the induced star with the largest cardinality open neighborhood in a graph. This problem, also known as the star degree centrality (SDC) problem, is shown to be [Formula: see text]-complete. In this work, we first propose a new integer programming (IP) formulation, which has a smaller number of constraints and ...
Mustafa C. Camur   +2 more
openaire   +1 more source

Managing liquidity: Optimal degree of centralization

Journal of Banking & Finance, 2011
Abstract Large banking groups face the question of how to optimally allocate and generate liquidity: in a central liquidity hub or in many decentralized branches. We translate this question into a facility location problem under uncertainty. We show that volatility is the key driver behind (de-)centralization.
Pokutta, Sebastian, Schmaltz, Christian
openaire   +1 more source

Degree centrality and eigenvector centrality in twitter

2014 8th International Conference on Telecommunication Systems Services and Applications (TSSA), 2014
Network formed between users in a social media can be used to encourage information spreading among them. This research applied Social Network Analysis which further can be used to social media marketing to improve the marketing process effectively. Based on previous research, information spreading speed among the social media is affected by the users'
Warih Maharani   +2 more
openaire   +1 more source

The stochastic pseudo-star degree centrality problem

European Journal of Operational Research, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mustafa C. Camur   +2 more
openaire   +2 more sources

Sub-graph degree-based bridge centrality algorithm

International Journal of Modern Physics C, 2021
The design of centrality metric algorithms to distinguish influential nodes on networks has become a very attractive research interest lately. This recent development is due to the fact that detection of powerful nodes can be very helpful in various situations such as containment of epidemic spread and so on. Many useful centrality algorithms had been
Chinenye Ezeh   +4 more
openaire   +1 more source

Estimating the degree centrality ranking

2016 8th International Conference on Communication Systems and Networks (COMSNETS), 2016
Complex networks have gained more attention from the last few years. The size of the real world complex networks, such as online social networks, WWW networks, collaboration networks, is exponentially increasing with time. It is not feasible to completely collect, store and process these networks.
Akrati Saxena   +2 more
openaire   +1 more source

Home - About - Disclaimer - Privacy