bluuebunny/crossref_metadata_2025_split huggingface dataset:
Тема смерти в творчестве И. С. Шмелёва К постановке проблемы
Authors: Макаров Д.В.д. 
Published: January 2025

Основная цель исследования — выявить авторское видение и особенности художественного изображения смерти в творчестве Ивана Сергеевича Шмелёва. В работе применяются системный, сравнительно-исторический методы и метод филологического анализа. Для достижения указанной цели анализируются художественные произведения И. С. Шмелёва, в которых встречается тема смерти, в частности, романы «История любовная», «Лето Господне», «Пути Небесные», повести «Богомолье», «Росстани», роман-эпопея «Солнце мёртвых» и другие. Наиболее важные результаты исследования: в целом изучаемый автор при изображении смерти исходит из основных догм православия, а также Священного Предания Православной Церкви, при этом его авторское видение и особенности художественного изображения смерти многокомпонентны. И. С. Шмелёв подходит к художественному осмыслению проблемы смерти многогранно и разносторонне, что само по себе создаёт проблему, которая требует, в свою очередь, комплексного исследования, поэтому внутри общей темы смерти необходимо выделить несколько подтем (мотивов), исследованию которых будут посвящены дальнейшие статьи данного цикла.
The main purpose of the study is to identify the author's vision and features of the artistic depiction of death in the work of Ivan Sergeevich Shmelev. The work uses systematic, comparative historical methods and the method of philological analysis. To achieve this goal, the works of I.S. Shmelev are analyzed, in which the theme of death occurs, in particular, the novels «Love Story», «Summer of the Lord», «Heavenly Paths», the novellas «Pilgrimage», «Rosstani», the epic novel «The Sun ofthe Dead» and others. The most important results of the study: in general, the author under study proceeds from the basic dogmas of Orthodoxy, as well as the Sacred Tradition of the Orthodox Church, while his author’s vision and features of the artistic depiction of death are multicomponent. I.S. Shmelev approaches the artistic understanding of the problem of death in a multifaceted and versatile way, which in itself creates a problem that requires the turn of a comprehensive study. Therefore, within the general theme of death, it is necessary to identify several subtopics (motives), the study of which will be devoted to further articles in this series.
Философское осмысление войны От Античности до начала XX века
Authors: Суханов Г.О. 
Published: January 2025

Основная цель исследования — хронологический обзор и сравнительный анализ философских взглядов на войну в период от Античности до конца Нового времени. В работе применяются сравнительно-исторический и герменевтический методы. Для достижения поставленной цели рассматриваются значимые философские труды, затрагивающие проблему войны и её осмысления. Для удобства восприятия исследование ограничено временными рамками. Философские взгляды классифицированы в соответствии с периодизацией: Древний мир, Средние века, Новое время. Классический философский анализ античных авторов сменяется господствующей богословской парадигмой средневековья. Теория справедливой войны и культ рыцарства уступают место юридическому осмыслению войны в Новое время. Война становится значимым объектом в системе международного права, а её осмыслением занимаются юристы и военные теоретики. Впрочем, остаётся место и для попыток философов построить модель идеального мира без войн. В исследовании обращается внимание на преимущества и недостатки восприятия войны в различные эпохи и на их отражение в исторических событиях.
The main purpose of the research is a chronological review and comparative analysis of philosophical views on war in the period from antiquity to the end of modern times. Comparative historical and hermeneutical methods are used in the work. To achieve this goal, significant philosophical works dealing with the problem of war and its understanding are considered. For ease of perception, the study is limited by time frames. Philosophical views are classified according to the periodization: The Ancient World, the Middle Ages, Modern Times. The classical philosophical analysis of ancient authors is replaced by the dominant theological paradigm of the Middle Ages. The theory of just war and the cult of chivalry are giving way to a legal understanding of war in Modern times. War is becoming a significant object in the system of international law, and lawyers and military theorists are engaged in its understanding. However, there is still room for philosophers to try to build a model of an ideal world without wars. The study draws attention to the advantages and disadvantages of the perception of war in different eras and finds their reflection in historical events.
DAMPAK IMPLEMENTASI SUSTAINABLE HUMAN RESOURCE MANAGEMENT PRACTICES TERHADAP INTENTION TO STAY
Authors: Nabil Afif Fauzan , Ekowati Dian 
Published: January 2025

Penelitian ini bertujuan untuk menganalisis pengaruh implementasi Sustainable Human Resource Management (SHRM) terhadap intention to stay karyawan pada institusi perbankan di Indonesia. Fokus penelitian ini adalah lima bank besar yang telah menerapkan praktik SHRM. Pendekatan kuantitatif dengan metode deskriptif digunakan dalam penelitian ini, dan data diperoleh melalui survei dengan skala Likert dari 138 karyawan tetap. Teknik analisis menggunakan Structural Equation Modeling – Partial Least Square (SEM-PLS) untuk menguji hubungan antara SHRM dan niat bertahan karyawan. Hasil penelitian menunjukkan bahwa penerapan SHRM memiliki pengaruh positif dan signifikan terhadap niat karyawan untuk bertahan di perusahaan. Praktik SHRM yang meliputi pelatihan berkelanjutan, pemberdayaan karyawan, penghargaan yang adil, dan lingkungan kerja yang mendukung berperan penting dalam meningkatkan loyalitas dan keterikatan karyawan. Indikator dengan nilai kepuasan tertinggi adalah kenaikan gaji tahunan dan stabilitas kerja, menunjukkan bahwa faktor-faktor ini sangat berkontribusi terhadap motivasi dan retensi karyawan. Implikasi penelitian ini menunjukkan pentingnya bagi perusahaan perbankan untuk terus mengembangkan kebijakan SHRM yang mendukung kesejahteraan dan pengembangan karier karyawan guna menciptakan lingkungan kerja yang mendukung loyalitas dan mengurangi turnover. Penelitian selanjutnya diharapkan dapat memperluas cakupan objek penelitian ke sektor lain dan menggunakan pendekatan longitudinal untuk melihat dampak jangka panjang SHRM.
Observing locally self-stabilization
Authors: Beauquier Joffroy , Pilard Laurence , Rozoy Brigitte 
Published: January 2025

A self-stabilizing algorithm cannot detect by itself that stabilization has been reached. For overcoming this drawback Lin and Simon introduced the notion of an external observer, i.e., a set of processes, one being located at each node, whose role is to detect stabilization. We propose here a less expensive approach, where there is a single observing process located at a unique node. This process is not allowed to detect false stabilization and it must eventually detect that stabilization is reached. Moreover it must not interfere with the observed self-stabilizing algorithm. Our result is that there exists such an observer for any problem on a distinguished network having a synchronous self-stabilizing solution. Note that our proof is constructive.
Stabilizing inter-domain routing in the Internet
Authors: Chen Yu , Datta Ajoy K. , Tixeuil Sébastien 
Published: January 2025

This paper reports the first self-stabilizing Border Gateway Protocol (BGP). BGP is the standard inter-domain routing protocol in the Internet. Self-stabilization is a technique to tolerate arbitrary transient faults. The routing instability in the Internet can occur due to errors in configuring the routing data structures, the routing policies, transient physical and data link problems, software bugs, and memory corruption. This instability can increase the network latency, slow down the convergence of the routing data structures, and can also cause the partitioning of networks. Most of the previous studies concentrated on routing policies to achieve the convergence of BGP while the oscillations due to transient faults were ignored. The purpose of self-stabilizing BGP is to solve the routing instability problem when this instability results from transient failures. The self-stabilizing BGP presented here provides a way to detect and automatically recover from this type of faults. Our protocol is combined with an existing protocol to make it resilient to policy conflicts as well.
Optimal snap-stabilizing PIF algorithms in un-oriented trees
Authors: Cournier Alain , Datta Ajoy K. , Petit Franck , Villain Vincent 
Published: January 2025

A snap-stabilizing protocol, starting from any arbitrary initial system configuration, always behaves according to its specification. In other words, a snap-stabilizing protocol is a self-stabilizing protocol which stabilizes in zero steps. In this paper, we first prove the number of states required on processors to design a snap-stabilizing Propagation of Information with Feedback (PIF) algorithm in arbitrary un-oriented trees running under any distributed daemon (four states per processor for the middle processors and two states for each of the two extreme end processors). Then, we propose two snap-stabilizing PIF algorithms for un-oriented trees. The former works under any (fair or unfair, central or distributed) daemon. It matches the lower bound in terms of number of states we established in this paper. The latter works under any (fair or unfair) central daemon. It uses only three states for the internal processors (two states for the root and the leaves). It is optimal in terms of number of states assuming a central daemon. Thus, both algorithms are optimal both in terms of the stabilization time (zero steps) and state requirement per processor.
Stabilizing causal deterministic merge
Authors: Kulkarni Sandeep S. , Ravikant  
Published: January 2025

In this paper, we focus on causal deterministic merge – that combines causal delivery and uniform total order – in semi-synchronous publish-subscribe systems that provide simple guarantees related to clock values and message delays. We consider two properties of the timestamps used to obtain causal deterministic merge: (1) they should be bounded, i.e., for a given system, the maximum size of the timestamp should be independent of the length of the computation, and (2) they should be scalar, i.e., the time required to compare/update timestamps should be independent of the size of the system. By making certain assumptions about how the timestamps are compared, we show that it is impossible to obtain a solution that uses scalar and bounded timestamps. Hence, we focus on solutions that achieve one of these properties. We present two solutions where the size of the timestamps is bounded; the size of the timestamps in the first solution is logarithmic in the number of processes whereas in the second solution, it is linear in the number of processes. We also present a solution where the timestamp consists of O(1) integers that can grow unbounded; we further show that the timestamps in this solution can be bounded if the application provides a simple guarantee about event creation. Each of these solutions is stabilizing fault-tolerant in that even if the system is perturbed by faults that improperly initialize processes, lose/corrupt messages and temporarily violate system guarantees, the system recovers to states from where subsequent computation satisfies the requirements of causal deterministic merge. Our solutions improve previously known solutions in several ways: In previous solutions, the timestamps consist of O(n2) unbounded integers where n is the number of processes. By contrast, one of our solutions uses O(1) unbounded integers and the remaining three solutions use bounded integers.
On modeling and tolerating incorrect software
Authors: Arora Anish , Theimer Marvin 
Published: January 2025

Distributed systems have to deal with the following scenarios in practice: bugs in components; incorrect specifications of components and, therefore, incorrect use of components; unanticipated faults due to complex interactions or to not containing the effects of faults in lower-level components; and evolution of components. Extant fault tolerance models deal with such scenarios in only a limited manner. In particular, we point out that state corruption is inevitable in practice and that therefore one must accept it and seek to correct it. The well-known concepts of detectors and correctors can be used to find and repair state corruption. However, these concepts have traditionally been employed to immediately detect and correct errors caused by misbehaving system components. Immediate detection and correction is often too expensive to perform and hence we consider the implications of running detectors and correctors only intermittently. More specifically, we address issues that must be dealt with when state corruption may persist within a system for a period of time. We show how to both detect and correct state corruption caused by infrequently occurring “transient” errors despite the ability for it to actively spread to other parts of the system. We also show how to eventually detect all state corruption, even in cases where continually recurring errors are constantly introducing new state corruption. Finally, we discuss the minimum set of capabilities needed from a trusted base of software in order to guarantee the correctness of our algorithms.
SCIT-DNS: Critical infrastructure protection through secure DNS server dynamic updates
Authors: Huang Yih , Arsenault David , Sood Arun 
Published: January 2025

Domain Name Systems (DNS) provide the mapping between easily remembered host names and their IP addresses. While domain name information is typically created and updated off-line, dynamic DNS updates allow clients to manage domain names online, in real time. The current secure DNS standards (DNSSEC) require private keys to be kept online to sign dynamic updates, leaving private keys subject to network-based attacks. In this work, we develop a secure implementation framework of DNS servers that voids the above requirement. Our approach, called Self-Cleansing Intrusion Tolerance (SCIT), strengthens DNSSEC through hardware redundancy. Our system uses a highly integrated cluster of DNS servers that constantly rotates the role of individual servers, handles one-server failures gracefully, confines the damages of successful intrusion to a limited time, and digitally signs dynamic updates by a clean server using the DNS zone key while keeping the key offline at all times. It is our belief that the availability and integrity of critical communications infrastructure, such as DNS, far outweigh the costs of hardware redundancy. In this paper, we present (1) the architecture of SCIT DNS clusters that achieves the above goals, (2) a secure Cluster Coordination Protocol (CCP) that servers in the cluster use to coordinate role changes without ever opening a port, and (3) the designs of our ongoing SCIT DNS cluster prototype. Preliminary experiences of our prototype show that role rotation and self-cleansing cycles are in the range of minutes, restricting the damages of even undetected but successful attacks to short time windows.
On autonomic optimization of firewall policy organization
Authors: Hamed Hazem , Al-Shaer Ehab 
Published: January 2025

Security policies play a critical role in many of the current network security technologies such as firewalls, IPSec and IDS devices. The configuration of these policies not only determines the functionality of such devices, but also substantially affects their performance. The optimization of filtering policy configuration is critically important to provide high performance packet filtering particularly for high speed network security. Current packet filtering techniques exploit the characteristics of the filtering policies, but they do not consider the traffic behavior in optimizing their search data structures. This often results in impractically high space complexity, which undermines the performance gain offered by these techniques. Also, these techniques offer upper bounds for the worst case search times; nevertheless, the more common average case scenarios are not necessarily optimized. Moreover, the types of packet filtering fields used in most of these techniques are limited to IP header fields and cannot be generalized to cover transport and application layer filtering. In this paper, we present a novel technique that utilizes Internet traffic characteristics to optimize the organization of firewall policies. The proposed technique timely adapts to the traffic conditions using actively calculated statistics to dynamically optimize the ordering of packet filtering rules. The rule importance in traffic matching as well as its dependency on other rules are both considered in our optimization algorithm. Through extensive evaluation experiments using simulated and real Internet traffic traces, the proposed mechanism is shown to be efficient and easy to deploy in practical firewall implementations.
Supporting heterogeneous middleware security policies in WebCom
Authors: Foley Simon N. , Mulcahy Barry P. , Quillinan Thomas B. , O'Connor Meabh , Morrison John P. 
Published: January 2025

With the growing interest in service-oriented architectures, achieving seamless interoperability between heterogeneous middleware technologies has become increasingly important. While much work investigating functional interoperability between different middleware architectures has been reported, little practical work has been done on providing a unified and/or interoperable view of security between the different approaches. In this paper we describe how the Secure WebCom distributed architecture provides access control policy interoperability support between a number of middleware security architectures. Secure WebCom uses the KeyNote trust management system to help coordinate the trust relationships between the different middleware systems and their associated access control policies. Middleware authorisation policies can be encoded in terms of cryptographic certificates, and vice-versa. This provides a unified view of access control across heterogeneous middleware systems and also provides the basis for decentralised support of middleware access control policies.
International Internet2 connectivity and performance in medical imaging applications: Bridging the Americas to Asia
Authors: Liu Brent J. , Zhou Zheng , Gutierrez Marco A. , Documet Jorge , Chan Lawrence , Huang H.K. 
Published: January 2025

Internet-2 is an advanced high-speed computer network, which has been widely used for medical imaging applications such as teleradiology and teleconsultation. Internet-2 can fulfill the requirements for high-speed data transmission and short turn-around time with low operation cost once installed. However, high performance may not necessarily be retained for global access from international network peers as well as commercial Internet Service Provider (ISP) solutions. This paper describes the methodology of establishing international Internet-2 connections between three different internationally linked sites: the Imaging Processing and Informatics (IPI) Laboratory, University of Southern California, Los Angeles, California; the Hong Kong Polytechnic University (PolyU), Hong Kong, and the Heart Institute (InCor) of the University of São Paulo, Brazil. Two major factors will be discussed including network looping in the US and bottleneck of the connection, raising the round-trip time and limiting the available bandwidth respectively. In addition to the three site International Internet2 Connectivity, a consistent and repeatable tuning protocol for international Internet2 applications in the clinical environment will be presented. The experimental results of the FTP and DICOM transmission using the automatic tuning protocol at both sending and receiving sites will be presented and compared with results for the combinations where this protocol is used at either one site only or no site at all in order to demonstrate the improvement in overall network throughput by this proposed tuning method. These performance numbers will also be compared to commercially available ISP connections to further show the differences between International Internet-2 and its ability to support medical imaging applications.
Aortic Valve Surgery in Patients Over 75 Years Old: Early Results and Predictors of Hospital Mortality
Authors: Dumani Selman , Dibra Laureta , Likaj Ermal , Kuci Saimir , Rruci Edlira , Veseli Aferdita , Krakulli Klodian , Kacani Andi , Prifti Edvin , Tanku Ilir , Pellumbi Devis , Mehmeti Alessia , Musliu Adelina , Refatllari Ali , Veshti Altin 
Published: January 2025

Background: Aortic valve surgery is the most essential part of worldwide heart valve surgery. In recent decades, the patient profile has changed even in our country, with the age of patients undergoing aortic valve surgery increasing significantly.
The primary objectives of this study are the early results of aortic valve replacement surgery in patients over 75 years old and the negative predictors that affect hospital mortality.
Materials and Methods: This is a retrospective study of 73 patients over 75 who underwent aortic valve surgery in 2014-2021 in our Cardiac Surgery Service, University Hospital Center “Mother Theresa” in Tirana. The patients' data regarding demographic, preoperative, operative, and postoperative variables were collected from the hospital's medical records. The data are presented in mean values and standard deviation. T-test and chi-squared test are also used.
Results: This study involved 73 patients, 50 males and 23 females. The age range was 75-85, averaging 77.12±2.31 years. Hospital mortality was 4.1%. The incidence of major perioperative complications such as low cardiac output, stroke, respiratory problems, bleeding, atrial fibrillation, wound infection, and conduction disturbances was 6.8%, 2.7 %, 4.1%, 2.7 %, 21.9 %, 2.6%, and 4.2 %.
Conclusions: Aortic valve surgery for elderly patients over 75 can be performed well. Concomitant procedures, prolonged extracorporeal circulation, and emergency intervention expose the patient to a high operative risk.
Damage Control Laparotomy in Trauma Patients: A Level I Trauma Center Experience
Authors: Duncan Anthony J. , Hopper Wade A. , Ahmeti Mentor 
Published: January 2025

Introduction: The surgical management of traumatic injury is an evolving and controversial topic. We present outcomes of laparotomy performed for blunt and penetrating trauma at a level I trauma center over a nearly 10-year period.
Material and Methods: Retrospective single-center cohort study of patients who received either damage control laparotomy or definitive laparotomy with fascial closure at the time of index procedure. The primary outcome was in-hospital mortality. Secondary outcomes were length of stay, complications, intensive care requirements, and vasopressor use.
Results: Out of 125 included patients, 69 received damage control laparotomy, and 56 received definitive laparotomy. Damage control laparotomy was associated with significantly higher mortality (20.9% vs 1.8%, p=.0015) and length of stay (16.1 vs. 9.3 days, p=.0005) than definitive laparotomy. Complications occurred significantly more frequently among damage control laparotomy patients (53.6% vs. 14.3%, p<.0001). Damage control laparotomy patients were substantially more likely to require intensive care unit admission, mechanical ventilation, and vasopressor support.
Conclusion: Patients undergoing damage control laparotomy are at significantly increased risk for adverse outcomes, including increased in-hospital mortality, prolonged length of stay, more significant complication burden, and increased need for mechanical ventilation and pressure support as compared to patients undergoing definitive laparotomy.