bluuebunny/crossref_metadata_2025 huggingface dataset:
STRATEGI TRANFORMASI PERTAMINA EP FIELD LIRIK DENGAN ANALISIS STRATEGI 7S MCKINSEY
Authors: Sari Tiara Nira , Widjajanti Kesi , Wardoyo Paulus
Published: January 2025

Pertamina EP Field Lirik merupakan bagian strategis dari PT Pertamina EP yang berperan dalam mendukung produksi energi nasional di tengah tantangan globalisasi, volatilitas harga minyak, dan persaingan sektor energi. Penelitian ini bertujuan untuk menganalisis proses transformasi organisasi dengan menggunakan kerangka kerja 7S McKinsey sebagai pendekatan utama. Penelitian ini juga mengeksplorasi peran teknologi, regulasi keberlanjutan, serta pengelolaan sumber daya manusia dalam mendukung proses transformasi. Metode penelitian yang digunakan adalah pendekatan kualitatif deskriptif melalui studi kasus di Pertamina EP Field Lirik. Data dikumpulkan melalui wawancara mendalam, studi literatur, dan analisis dokumen perusahaan. Analisis dilakukan dengan mengidentifikasi tujuh elemen utama model 7S McKinsey, yaitu strategy, structure, systems, shared values, skills, style, dan staff, untuk menilai keselarasan antar elemen dalam mendukung transformasi. Hasil penelitian menunjukkan bahwa digitalisasi melalui teknologi seperti otomatisasi dan Internet of Things (IoT) dapat meningkatkan efisiensi operasional dan daya saing perusahaan. Selain itu, nilai-nilai bersama yang kuat membantu membangun budaya kerja adaptif dan inovatif. Kepemimpinan yang responsif dan gaya manajerial yang inklusif berperan signifikan dalam mendorong keterlibatan karyawan selama proses transformasi. Transformasi ini juga didukung oleh pengelolaan sumber daya manusia yang berfokus pada pengembangan keterampilan yang relevan. Penelitian ini menyimpulkan bahwa penerapan model 7S McKinsey dapat menjadi panduan efektif untuk membantu Pertamina EP Field Lirik meningkatkan efisiensi, mengelola risiko, dan memperkuat daya saing di pasar energi yang dinamis. Hasil penelitian diharapkan dapat menjadi referensi bagi perusahaan energi lain yang menghadapi tantangan serupa.
Towards OntoClean 2.0: A framework for rigidity
Authors: Welty Christopher , Andersen William
Published: January 2025

The OntoClean methodology was based on a set of formal meta-properties whose semantics were specified in S5 modal logic. One of these metaproperties, Rigidity, has come under more focused scrutiny by the ontology community, and several problems with the formalization have been discussed along with several solutions. In this paper, we attempt to reconcile these results in a larger framework that exposes different kinds of rigidity, as well as two new metaproperties, actuality and permanence, which deal more specifically with the behavior of properties with respect to time and existence.
A multi-layered ontology for comparing relationship semantics in	conceptual models of databases
Authors: Purao Sandeep , Storey Veda C.
Published: January 2025

Relationships are an integral part of the design of a database. Comparing and integrating relationships from heterogeneous databases requires that the relationships be mapped to each other or to a common classification. Identifying similarities and resolving differences in relationships across large data sources is a resource-intensive task that could benefit greatly from semi-automated approaches. A prerequisite to developing such approaches is a clear understanding of the semantics of relationships used in database design. This research presents a layered ontology for classifying the semantics of relationships. It consists of a core layer that captures the fundamental types of relationships between entities. A middle layer provides the internal context, obtained from entities surrounding the relationship, to interpret the fundamental types. The outer layer allows further interpretation using the external context, that is, the domain in which a relationship is being used. An initial assessment on relationships from a variety of application domains demonstrates that the ontology can be adequate and useful for comparing relationships across databases.
Problems in the ontology of computer programs
Authors: Eden Amnon H. , Turner Raymond
Published: January 2025

As a first step in the larger project of charting the ontology of computer programs, we pose three central questions: (1) Can programs, hardware, and metaprograms be organized into a meaningful taxonomy? (2) To what ontology are computer programs committed? (3) What explains the proliferation of programming languages and how do they come about? Taking the complementary perspectives software engineering and mathematical logic, we take inventory of programs and related objects and conclude that the notions of abstraction and concretization take a central role in this investigation.
Let's talk about our “being”: A linguistic-based ontology framework for coordinating agents
Authors: Pazienza Maria Teresa , Sguera Savino , Stellato Armando
Published: January 2025

In open scenarios, agents willing to cooperate must impact the communication barrier between them and their unknown partners. If agents are not relying on any agreement about the meaning they ascribe to the symbols used in the conversation, semantic misalignments will arise on the discourse domain as well, thus making the communication impossible. In wide and heterogeneous scenarios offered by the Web (and its newborn semantic incarnation), traditional and meaning-safe methodologies for communication need to keep abreast of new dynamic communicative interaction modalities. The uncertainties arising from communication between actors which base their behavior on different and heterogeneous knowledge models have to be taken into account, wisely balancing the extent of “reachable knowledge” with the trustworthiness of its information. Main objective of this work is to augment the FIPA Ontology Service Specification with linguistically-aware methodologies for communication, describing a wide-scope framework for multi-agent systems design, semantic integration and coordination.
Comparative analysis of aperiodic server approaches for real-time garbage collection
Authors: Park Eunjeong , Kim Taehyoun , Shin Heonshik
Published: January 2025

We analyze the characteristics of the deferrable and sporadic server approaches to real-time garbage collection implemented with single or dual servers. Comparative analysis addresses two problems: the scheduling of a garbage collector with hard real-time mutator tasks, and the worst-case memory requirement. Our analysis shows that it may be impractical to depend on the single-server approach to prepare a flexible, yet feasible schedule for embedded real-time systems. In contrast, dual servers enhance the scheduling flexibility, although it suffers additional overhead of the secondary server and memory space. According to the simulation study, the single-server approach prefers the sporadic server to the deferrable server, since the former has larger capacity than the latter. On the other hand, with dual servers have chosen the deferrable server is the more efficient solution.
Implementing a QoS-Aware MPEG-4 video system for embedded computing
Authors: Kee-Yin Ng Joseph , Kin-Cheung Hui Calvin
Published: January 2025

Until recently, watching on-demand video on a mobile device becomes a reality. With the advance in hand-held device and wireless network, the real-time interaction and the on-time delivery of multimedia data are becoming highly possible. It provides services for users to retrieving multimedia contents from hand-held devices over the Internet at anytime and anywhere. A variety of multimedia systems and Internet applications have been emerging, fulfilling the ever increasing demand on the Internet streaming applications. With the new features provided by the MPEG-4 standard, i.e. the object-based media with arbitrary-shaped and object-based QoS coding, we have designed and implemented our MPEG-4 video system. With object-based encoding in MPEG-4, it enables the system to discard the less important objects within the video stream when the network is congested. Our video system proposes a new transmission scheme for the system to transmit MPEG-4 video over an open network with a tight control on the quality of service. Based on the nature of the video objects and their frames, transmission priorities among video objects are assigned. The transmission scheme then regulates the flow of the video data and their frames so that important data are delivered on time to the video client regardless the delay fluctuation of the open network.
Reconfiguration in network of embedded systems: Challenges and adaptive tracking case study
Authors: Ghiasi Soheil , Nahapetian Ani , Moon Hyun J. , Sarrafzadeh Majid
Published: January 2025

Many applications utilize deeply embedded sensors and actuators that are tightly coupled with the physical environment in order to perform their functionality. Sensor, actuators and embedded computation resources used for implementing such systems usually exhibit regular local configurations, while the global structure of the subsystems is either not fixed a priori and can change at runtime or is not known. Examples include systems that use many randomly distributed sensing boards, each one having a fixed structure of computation resources and sensing devices, to autonomously detect events and take proper actions.

This paper discusses the requirements of the aforementioned systems, their advantages and the issues involved in developing them. Specifically we focus on dynamic adaptation of the system as a particular feature of such systems. This feature is discussed in depth in a collaborative and dynamically adaptive object tracking system that has been built in our lab as the experimental framework of this study. We exploit reconfigurable hardware devices embedded in a number of networked cameras in order to achieve our goal. We justify the need for dynamic adaptation of the system through scenarios and applications. Experimental results on a set of scenes advocate the fact that our system works effectively for different scenario of events through reconfiguration. Comparing results with non-adaptive implementations verify the fact that our approach improves system's robustness to scene variations and outperforms the traditional implementations.
Control-scheduling codesign of real-time systems: The control server approach
Authors: Cervin Anton , Eker Johan
Published: January 2025

The paper presents the control server, a real-time scheduling mechanism tailored to control and signal processing applications. A control server creates the abstraction of a control task with a specified period and a fixed input-output latency shorter than the period. Individual tasks can be combined into more complex components without loss of their individual guaranteed fixed-latency properties. I/O occurs at fixed predefined points in time, at which inputs are read or controller outputs become visible. The control server model is especially suited for codesign of real-time control systems. The single parameter linking the scheduling design and the controller design is the task utilization factor. The proposed server is an extension of the constant bandwidth server, which is based on the earliest-deadline-first scheduling algorithm. The server has been implemented in a real-time kernel and has also been validated in control experiments on a ball and beam process.
A methodology for designing hierarchical scheduling systems
Authors: Lipari Giuseppe , Bini Enrico
Published: January 2025

When executing different real-time applications on a single processor system, one problem is how to compose these applications and guarantee at the same time that their timing requirements are not violated. A possible way of composing applications is through the resource reservation approach. Each application is handled by a dedicated server that is assigned a fraction of the processor. Using this approach, the system can be seen as a two-level hierarchical scheduler. A considerable amount of work has been recently addressed to the analysis of this kind of hierarchical systems. However, a question is still unanswered: given a set of real-time tasks to be handled by a server, how to assign the server parameters so that the task set is feasible? In this paper, we answer to the previous question for the case of fixed priority local scheduler by presenting a methodology for computing the class of server parameters that make the task set feasible.
Instruction level energy modeling for pipelined processors
Authors: Nikolaidis S. , Kavvadias N. , Laopoulos T. , Bisdounis L. , Blionas S.
Published: January 2025

A new method for creating instruction level energy models for pipelined processors is introduced. This method is based on measuring the instantaneous current drawn by the processor during the execution of the instructions. An appropriate instrumentation set up was established for this purpose. According to the proposed method the energy costs (base and inter-instruction costs) are modeled in relation to a reference instruction (e.g. NOP). These costs incorporate inter-cycle energy components, which cancel each other when they are summed to produce the energy consumption of a program resulting in estimates with high accuracy. This is confirmed by the results. Also the dependencies of the energy consumption on the instruction parameters (e.g. operands, addresses) are studied and modeled in an efficient way.
Integrating functional and power simulation in embedded systems design
Authors: Ayala José L. , López-Vallejo Marisa
Published: January 2025

This paper presents the design and use of INCAPE (INtegrated Cache Analysis and Power Estimation). The proposed tool integrates an extended analytical model for power estimation in caches within a retargetable cross-design environment. INCAPE has been used to perform experimental design space exploration and analysis of the main factors that strongly impact on the power dissipation of the cache hierarchy. The obtained results validate the usefulness of the proposed methodology and allow the designer to efficiently design the cache hierarchy when low power constraints are involved.
Optimized memory requirements for wavelet-based scalable multimedia codecs
Authors: Ferentinos V. , Geelen B. , Lafruit G. , Milia M. , Bormans J. , Catthoor F. , Stouraitis T.
Published: January 2025

Powerful multimedia applications are running more and more on very compact and resource-scarce, portable systems. As a consequence, system design optimization, its associated time-to-market constraints and the required automated tool support are becoming increasingly important issues, especially in situations where product derivatives and extensions introduce unforeseen and possibly dramatic constraints in the system optimization process. Nevertheless, the system designer remains an irreplaceable cornerstone for steering the whole system optimization process.

This paper presents the relationship of aforementioned aspects in the context of optimizing data access to memory, which is the dominant factor determining the system-on-a-chip area, data throughput and power consumption. The case study of a 1D and 2D forward and inverse wavelet transform, interacting with surrounding system modules imposed by current multimedia compression standards, leads the reader through the peculiar technical counter-measures and script-based optimization steps to be followed for reaching a satisfactory global optimization. In particular, the data dependencies between the different functional modules are shown to be crucial in the memory optimization process and lead to non-trivial/counter-intuitive decision takings that can increase the energy consumption gains compared to more commonly-accepted, though suboptimal approaches. An example is the counter-intuitive observation that though JPEG2000 uses independently entropy coded blocks over its wavelet subbands, it requires more memory because of “hidden” data dependencies, than its zero-tree based MPEG-4 counterpart, whose intricate entropy coding spreads over all the subbands. Hence, to achieve an overall optimal implementation with good trade-offs between efficiency and cost, it is strongly suggested that algorithmic and implementation designers should co-operate in early stages of the multimedia systems design, facilitated by high-level memory cost estimation analyses.
Page mapping for heterogeneously partitioned caches: Complexity and heuristics
Authors: Li Zhiyuan , Xu Rong
Published: January 2025

Embedded processors such as the Intel StrongARM SA-1110 and the Intel XScale utilize multiple caches at the same level in the cache hierarchy. The main cache and the mini-cache differ in both the size and the associativity. Furthermore, the processors allow programs to specify the cache mapping policy for each virtual page among three choices, i.e. whether to map the page to the main cache, the mini-cache, or neither. In the latter case, the page is marked as noncacheable. In this paper, we investigate the problem of optimal cache mapping, assuming that we can predict the trace of the memory reference in advance. On the theoretical side, we prove that the problem of finding the optimal cache mapping for an arbitrary memory trace is NP-hard. On the experimental side, we present a mapping heuristic and compare the result with the default policy which maps all pages to the main cache. Our measurement shows that, compared to the default policy, the heuristic can reduce the execution time from 1% to 21% for a set of test programs. As a byproduct of performance enhancement, we also save the energy by 4% to 28%.
Heap data allocation to scratch-pad memory in embedded systems
Authors: Dominguez Angel , Udayakumaran Sumesh , Barua Rajeev
Published: January 2025

This paper presents the first-ever compile-time method for allocating a portion of the heap data to scratch-pad memory. A scratch-pad is a fast directly addressed compiler-managed SRAM memory that replaces the hardware-managed cache. It is motivated by its better real-time guarantees vs cache and by its significantly lower overheads in access time, energy consumption, area and overall runtime. Existing compiler methods for allocating data to scratch-pad are able to place only global and stack data in scratch-pad memory; heap data is allocated entirely in DRAM, resulting in poor performance. Runtime methods based on software caching can place heap data in scratch-pad, but because of their high overheads from software address translation, they have not been successful, especially for heap data.

In this paper we present a dynamic yet compiler-directed allocation method for heap data that for the first time, (i) is able to place a portion of the heap data in scratch-pad; (ii) has no software-caching tags; (iii) requires no run-time per-access extra address translation; and (iv) is able to move heap data back and forth between scratch-pad and DRAM to better track the program's locality characteristics. With our method, global, stack and heap variables can share the same scratch-pad. When compared to placing all heap variables in DRAM and only global and stack data in scratch-pad, our results show that our method reduces the average runtime of our benchmarks by 34.6%, and the average power consumption by 39.9%, for the same size of scratch-pad fixed at 5% of total data size.
A cache design for high performance embedded systems
Authors: Foglia P. , Mangano D. , Prete C.A.
Published: January 2025

Future embedded applications will require high performance processors integrating fast and low-power cache. Dynamic Non-Uniform Cache Architectures (D-NUCA) have been proposed to overcome the performance limit introduced by wire delays when designing large cache. In this paper, we propose an alternative design of D-NUCA cache, namely Triangular D-NUCA Cache, to reduce power consumption and silicon area occupancy of D-NUCA cache. We compare the performances of Triangular D-NUCA cache with the ones achieved by conventional rectangular organization. Results show that our approach is particular useful in the embedded application domain, as it permits the utilization of half-sized NUCA cache with performance improvements.
Tiny split data-caches make big performance impact for embedded applications
Authors: Naz Afrin , Kavi Krishna , Li Wentong , Sweany Philip
Published: January 2025

This paper shows that even very small data caches, when split to serve data streams exhibiting temporal and spatial localities, can improve performance of embedded applications without consuming excessive silicon real estate or power. It also shows that large block sizes or higher set-associativities are unnecessary with split cache organizations. We use benchmark programs from MiBench to show that our cache organization outperforms other organizations in terms of miss rates, access times, energy consumption and silicon area.
Load squared: Adding logic close to memory to reduce the latency of indirect loads in embedded and general systems
Authors: Yehia Sami , Collard Jean-Francois , Temam Olivier
Published: January 2025

Indirect memory accesses, where a load is fed by another load, are ubiquitous because of rich data structures and sophisticated software conventions, such as the use of linkage tables and position independent code. Unfortunately, they can be costly: if both loads miss, two round trips to memory are required even though the role of the first load is often limited to fetching the address of the second load. To reduce the total latency of such indirect accesses, a new instruction called load squared is introduced. A load squared does two fetches, the first fetch reading the target address of the second. (An offset is optionally added to the result of the first fetch.) The load squared operation is performed by memory-side logic (typically, the memory controller if it isn't located on the main processor chip). In this study, load squared is not an architecturally visible instruction: the micro-architecture transparently decides which loads should be replaced by loads squared. We show that performance is sometimes improved significantly, and never degraded.
The impact of traffic aggregation on the memory performance of networking applications
Authors: Verdú Javier , García Jorge , Nemirovsky Mario , Valero Mateo
Published: January 2025

The trend of the networking processing is to increase the intelligence of the routers (i.e. security capacities). This means that there is an increment in the workload generated per packet and new types of applications are emerging, such as stateful programs. On the other hand, Internet traffic continues to grow vigorously. This fact involves an increment of the traffic aggregation levels and overloades the processing capacities of the routers.

In this paper we show the importance of traffic aggregation level on networking application studies. We also classify the applications according to the data management of the packet processing. Hence, we present the different impacts on the data cache performance depending on the application category. Our results show that traffic aggregation level may affect the cache performance depending on the networking application category. Stateful applications show a significant sensitivity to this impact.
Frame packing algorithms for automotive applications
Authors: Saket Rishi , Navet Nicolas
Published: January 2025

The set of frames exchanged in automotive applications must meet two constraints: it has to be feasible from a schedulability point of view and it should minimize the network bandwidth consumption. This latter point is important since it allows the use of low cost electronic components and it facilitates an incremental design process. The purpose of this study is to propose efficient algorithms for solving the NP-hard problem of generating a set of schedulable frames that minimize the bandwidth usage. This study presents novel algorithms for building bandwidth-minimizing sets of frames that meet the schedulability requirement. In our experiments, these proposals have proved to be more effective than the existing approaches.
Time-constrained loop scheduling with minimal resources
Authors: O'Neil Timothy W. , Sha Edwin H.-M.
Published: January 2025

Many applications commonly found in digital signal processing and image processing applications can be represented by data-flow graphs (DFGs). In our previous work, we proposed a new technique, extended retiming, which can be combined with minimal unfolding to transform a DFG into one which is rate-optimal. The result, however, is a DFG with split nodes, a concise representation for pipelined schedules. This model and the extraction of the pipelined schedule it represents have heretofore not been explored. In this paper, we develop new results regarding the construction of such graphs. We develop scheduling algorithms for such graphs, and then discuss a way to reduce the hardware requirements of such schedules. In the process, we state and prove a tight upper bound on the minimum number of processors required to execute the static schedule produced by our algorithms. We also construct an unfolding algorithm for split-node graphs and combine it with our scheduling methods to achieve rate-optimality in all cases. Finally, we demonstrate our methods on a specific example.
A fully polynomial-time approximation scheme for feasibility analysis in static-priority systems with bounded relative deadlines
Authors: Fisher Nathan , Baruah Sanjoy
Published: January 2025

Current feasibility tests for the static-priority scheduling of periodic task systems run in pseudo-polynomial time. We present a fully polynomial-time approximation scheme (FPTAS) for feasibility analysis in static-priority systems where each task's relative deadline is constrained to be at most its period. This test is an approximation with respect to the amount of processor capacity that must be “sacrificed” for the test to become exact. We show that an arbitrary level of accuracy, ε, may be chosen for the approximation scheme, and present a run-time bound that is polynomial in terms of ε and the number of tasks, n.
Non-preemptive fuzzy classification algorithm for non-traditional safety-critical systems
Authors: Fei Wang , Xu Ying-Tao
Published: January 2025

Non-traditional safety-critical systems are widely used in transportation control, banking and financial systems, and the management of water systems, which have different characteristics with traditional safety-critical systems. In those systems, tasks cannot be determined as critical or non-critical apparently but a few failures of some tasks are acceptable. This paper establishes a new schedule model for Non-traditional safety-critical systems and proposes a non-preemptive fuzzy classification (NFC) algorithm. NFC is consisted of two phrases, called initialized step and execution step. Afterwards, NFC and MUF are compared based on sample tasks abstracted from an existing financial system. It is concluded that NFC has fewer failed tasks and similar performance.
A method to improve interrupt latency in real-time OS kernels
Authors: Li Hong , Hu Qi , Zhang Peifeng , Gao Zhigang
Published: January 2025

Interrupt latency has great impact on the real time and predictability of real-time operating system kernels. In traditional implementation of real-time kernels, interrupts are frequently disabled in system service routines, critical sections, etc., which causes kernel interrupt latency. In this paper we propose a method called PIL (Predictive Interrupt Latency). PIL reduces interrupt latency by never disabling interrupts during any system service routines. Moreover, it makes interrupt latency vary little, which improves the predictability in the response time for external events. We have implemented the PIL method in an OSEK-compatible operating system – SmartOSEK OS. Experimental results show PIL improves real time and predictability of real-time systems with low time and space overheads.
CÁNCER: LAS CÉLULAS QUE NO NECESITAN OXÍGENO PARA SOBREVIVIR
Authors: Jimenez-Montiel Osvaldo , Caballero Norma A. , Meléndez Francisco J. , Castro María Eugenia
Published: January 2025

El oxígeno es el principal componente que requieren las células de un organismo vivo para obtener energía y de esta manera sea capaz de realizar sus actividades metabólicas de forma adecuada. Entonces, ¿podrán existir algunas células sin el suministro de oxígeno? La respuesta es sí. Por increíble que parezca, existen células en diversos padecimientos que son capaces de permanecer vivas a bajas concentraciones de oxígeno. Esto es posible debido a una serie de mecanismos moleculares que se activan al percibir este estado de hipoxia, como la expresión de la familia del factor inducido por hipoxia (HIF-1, 2 y 3), que protegen a las células en padecimientos como la anemia, la isquemia miocárdica, la hipertensión pulmonar, el cáncer, etc. Específicamente, la familia HIF brinda resistencia a las células presentes en cánceres sólidos contra las terapias actuales y aseguran la supervivencia del tumor cambiando de su metabolismo aerobio a un metabolismo anaerobio, generando nuevas vascularizaciones para una mayor irrigación sanguínea y activando genes encargados de aumentar la producción de células sanguíneas dentro del organismo, etc. Debido al papel tan importante que desempeña la familia HIF en la supervivencia de células cancerígenas, en esta investigación se propone describir el bloqueo de la actividad de HIF-1 empleando metodologías in silico. Se considera que un punto clave para su inactivación es evitar la dimerización de las subunidades proteicas que lo constituyen. Como resultado de este análisis, se pretende tener a un nuevo aliado en las terapias actuales contra el cáncer.
Rozšíření Evropské unie a NATO v kontextu německo-českých vztahů
Authors: Rudolf Seiters
Published: January 2025

Enlargement of the European Union and NATO in the Context of the German-Czech Relations
La gestión pública municipal en Argentina. Una reflexión sobre los procesos de cambio e innovación
Authors: Sili Marcelo , Cellucci Micaela
Published: January 2025

El objetivo de este trabajo es reflexionar sobre los modelos de gestión pública municipal y su capacidad de innovación en Argentina desde 1930 hasta la actualidad. Esta basada en el análisis de la problemática de los municipios. Se puede afirmar que los diferentes modelos de gestión pública municipal puestos en marcha en las últimas décadas fueron implementados en forma incompleta y aislada, razón por la cual no dieron los resultados esperados. Los procesos de innovación en materia de gestión territorial que se están generando en la actualidad permiten pensar que hacia el futuro podría emerger un nuevo modelo de gestión pública municipal basado en una lógica de gobernanza colaborativa.
Automation and Data Integrity in Regulatory Submissions: Innovations for Decentralized Clinical Trials
Authors: Vamsi Upputuri
Published: January 2025

This article explores the evolving landscape of regulatory submissions in clinical trials, with a particular focus on the challenges and opportunities presented by decentralized clinical trials (DCTs). It examines the role of automation in streamlining regulatory document preparation and validation processes, highlighting the benefits of improved accuracy, enhanced productivity, and accelerated timelines. The article delves into the unique data integrity challenges posed by DCTs, including the integration of diverse data sources such as wearables, mobile applications, and remote monitoring tools. It discusses innovative solutions for ensuring regulatory compliance, such as AI-driven monitoring systems, blockchain technology for audit trails, and automated query resolution workflows. The importance of traceability in regulatory submissions is emphasized, along with its role in enhancing reproducibility and accountability in clinical research. The article also addresses the impact of these changes on statistical programming, outlining the challenges faced by programmers and strategies for regulatory-compliant data processing. Finally, it looks toward future directions in automation and data integrity, exploring the potential of AI/ML integration for adaptive workflows and the development of seamless connections between clinical programming tools and regulatory platforms. Throughout, the article underscores the industry's ongoing efforts to balance technological advancement with regulatory compliance and data integrity in the pursuit of more efficient and effective clinical trials.
Scaling BERT for Healthcare: An End-to-End Framework for Medical Document Automation
Authors: Balamurugan Sivakolunthu Vel
Published: January 2025

This article proposes a comprehensive framework for implementing BERT-based language models at scale for automated medical document processing in healthcare environments. Recent studies have demonstrated BERT models achieving accuracy rates of up to 89.7% in medical entity recognition tasks [2], suggesting significant potential for healthcare applications. The proposed architecture introduces a novel hierarchical attention mechanism specifically engineered to capture the nested complexity of medical documentation while maintaining computational efficiency in production systems. Drawing inspiration from successful implementations in pharmacy settings [15, 16], this framework features a distributed training pipeline designed to process annotated medical documents across multiple specialties, coupled with a dynamic medical vocabulary injection system that aims to preserve BERT's contextual understanding while potentially reducing false positives in entity recognition. By leveraging distributed computing infrastructure and optimized model architecture, the framework could theoretically achieve substantial improvements over traditional approaches in both accuracy and processing efficiency, particularly in handling complex medical terminology and context-sensitive information extraction. The proposed system architecture anticipates addressing current challenges in healthcare documentation, where systems process an average of 6.2 million clinical documents annually [1]. This theoretical framework contributes to the field by proposing a scalable methodology for implementing advanced language models in healthcare settings while addressing the unique challenges of medical domain specificity and production deployment requirements.
Navigating Scalability Challenges in Distributed Systems
Authors: Abhishek Andhavarapu
Published: January 2025

Distributed computing has emerged as a transformative paradigm that fundamentally reshapes our understanding of computational infrastructure. This comprehensive analysis explores the intricate landscape of modern distributed systems, examining the critical challenges and innovative solutions that drive technological evolution. By exploring the complex interplay between scalability, performance optimization, resiliency, and emerging technologies, the article unveils the profound ways in which organizations are reimagining computational architectures. The article delves into the transition from monolithic systems to dynamic, adaptive infrastructures, highlighting the strategic importance of flexible, intelligent computing environments that can respond to increasingly sophisticated technological demands.
Procedural Law of Ancient Rome in the Imperial Period
Authors: Slynko D. V.
Published: January 2025

The scientific study is devoted to the consideration of procedural law in ancient Rome during the reign of the kings. It is noted that scientific research is usually devoted to the problems of substantive law, both civil and family law, and procedural law and its institutions have been considered by legal scholars much less frequently. The article examines the governing bodies of the Roman State, namely, the People’s Assembly, the king (rex) and the Senate. It is noted that at any time the People's Assembly could remove the king from office, i.e. he cannot be called an absolute monarch. The king was a military commander, a priest, who dealt with the day-to-day management of the polis-state and acted as the supreme judge. The boundaries of the governing bodies of Ancient Rome, their competence and powers were established by custom. Customs were the first source of law in ancient Rome, which regulated relations within the family and community with the help of religious norms and social principles. Later, customs were recognised and enforced by the state. The collection of the most widespread and applied customs, the Laws of the XII Tables, was approved by the People's Assembly in 451–450 BC.
The study describes the procedural order of consideration of civil and criminal cases. It is determined that the Roman criminal procedure concerned only the quirits, which constituted a small number of Roman citizens. The second group of the population was made up of commoners – plebs, the third group of the Roman population was clientis, and the fourth – slaves. The subjects and allies of Rome, a huge mass of slaves, whose number was many times higher than the number of Roman citizens, were subject to trial in a simplified manner, and slaves were generally subject to extrajudicial proceedings.
The originality of the Roman procedural law of that time is examined, and it is concluded that it had many common general features with the legal process of the first, initial stage of the aristocratic republic, which is more fully and reliably known in science.
Juridical facts in housing law
Authors: Kroitor V. A.
Published: January 2025

The article is focused on defining specific features of juridical facts in housing law. The relevance of the research topic is stipulated by modern challenges, in particular, military actions. Thus, there are new legal relations regarding compensation for destroyed housing, in regard to internal displacement. These juridical facts require separate scientific research in the field of housing law. The purpose of the article is to define juridical facts of housing law considering modern challenges. Achieving the research purpose became possible through the usage of a set of general scientific and special methods of scientific cognition, in particular, the dialectical, axiological, structural and logical, formal and legal methods were used. Juridical facts in the field of housing law are the dynamic legal category that is constantly being changed and updated under the influence of various external factors. Juridical fact related to the technical conditions of housing is of particular importance among them. Recognition of housing as uninhabitable serves as the basis for terminating legal relations related to ownership or residence and at the same time becomes a legal-based fact for realizing the rights to compensation, replacement, etc. It is especially relevant in terms of the martial law, when destruction of housing due to hostilities acts as a juridical fact that terminates the right to ownership or residence because of destruction, damage or loss of fitness for usage. As a result, new legal relations are formed, which are aimed at restoring housing rights, receiving compensation or providing new housing. It is worth noting that terminating and legal-based juridical facts in housing law are closely interrelated that determines their systemic interaction. It has been emphasized that specific feature of juridical facts in housing law is stipulated by the fact that a set of juridical facts is necessary in most cases for their emergence and termination. Thus, both the termination and emergence of housing legal relations are conditioned by the presence of a juridical fact of moving in or eviction from housing. The fact of moving in is the confirmation of the emergence of housing legal relations. The termination of housing legal relations is accompanied by the juridical fact of eviction from housing.
Typical forms of counteraction to the investigation of criminal offences related to interference with the activities of public authorities
Authors: Popov V. Yu.
Published: January 2025

The article substantiates the position that counteraction to an investigation is a complex phenomenon which may encompass various forms of behaviour implemented by interested parties with the aim of preventing detection of a criminal offence, and making it impossible to fulfil the tasks of criminal proceedings.
It is found that during the investigation of criminal offences related to interference with the activities of representatives of public authorities, suspects most often implement the following forms of behaviour as ways to counteract the investigation: 1) refuse to testify; 2) give false testimony; 3) hide from pre-trial investigation authorities; 4) fail to appear when summoned by the investigator, prosecutor, investigating judge; 5) exert influence on the victim, witnesses, refuse to provide biological samples, handwriting, voice samples, etc.
It is established that other interested persons at the stage of pre-trial investigation of criminal offences of the type under study most often implement the following forms of behaviour to counteract the investigation: exerting influence on participants to criminal proceedings; implementation of actions to conceal crimes, including: staging, falsification, disguise, destruction, etc.; giving false testimony; disclosure of the secret of pre-trial investigation; refusal to provide biological samples or samples of handwriting, voice, etc.; delaying the pre-trial proceedings, delaying the pre-trial investigation, for example, by ignoring the investigator's calls, prolonged familiarisation with the criminal proceedings; failure to appear when summoned; failure to fulfil procedural obligations acquired in connection with obtaining the relevant procedural status in criminal proceedings; hiding from the pre-trial investigation authorities, etc. It is also emphasised that the prospects for further research should be to identify effective ways to overcome the following forms of resistance to investigation.
РОЗВИТОК УСНОГО МОВЛЕННЯ МОЛОДШИХ ШКОЛЯРІВ У КЛАСАХ З ІНКЛЮЗИВНИМ НАВЧАННЯМ
Authors: Хома Ольга Михайлівна
Published: January 2025

У статті розглядаються актуальні питання розвитку усного мовлення учнів у класі з інклюзивним навчанням. З’ясовано підходи вчених щодо означеної проблеми. Вказується на важливості знань сучасних методів навчання, уміння адаптувати освітній процес до індивідуальних потреб учнів, на розуміння психологічних особливостей дітей, які мають порушення мовлення. Наголошено, що учні з особливими освітніми потребами є учасниками освітнього процесу, тому добірка завдань учителем, асистентом учителя для розвитку усного мовлення молодших школярів має бути диференційованою. Підкреслено, що Державний стандарт початкової освіти мовно-літературної освітньої галузі, Типові освітні програми спрямовують освітню діяльність учнів на формування комунікативних умінь. Змістові лінії «Взаємодіємо усно», «Взаємодіємо письмово», «Досліджуємо мовні явища», «Досліджуємо медіа» та інші передбачають розвиток зв’язного мовлення учнів за різними напрямами, включаючи й оволодіння мовними компетенціями. Вони взаємопов’язані й у сукупності сприяють формуванню усного діалогічного та монологічного мовлення. Метою статті є: з’ясування сучасних підходів до розвитку усного зв’язного мовлення учнів у класах з інклюзивним навчанням. Рекомендуються етапи розвитку усного мовлення та методи, прийоми навчання: пропедевтичний (методи та прийоми формування вимовних та лексичних умінь); конструктивно-творчий (методи конструювання словосполучень, речень); текстотворчий (імітативні, творчо-продуктивні, комунікативні методи). З-поміж методів й прийомів виокремлено такі: розгортання чи згортання речень, «скрайбінг» (складання речення із графічним зображенням), «гронування» (добір слів-асоціацій до ключового), «кубування», «моя позиція», дидактичні ігри; прийоми, що спрямовані на аналітико-синтетичні дії: тематичне складання речень, побудова за початком, поширення речення другорядними членами, редагування словосполучення, речення, деформованого речення, дослідження конкретного мовного явища та інші. Сформульовано особливості методичної роботи щодо розвитку усного мовлення у класах з інклюзивним навчанням: взаємозв’язок етапів та методів навчання; співпраця асистента вчителя й учителя з розвитку усного мовлення учнів; індивідуальна спрямованість розвитку мовлення дитини з ООП; розробка корекційно-розвиткових вправ та завдань; застосування сучасних засобів навчання (мультимедійні технології; слова-підказки, ілюстрації, взірці текстів, використання мнемотехніки як методу запам’ятовування для учня з ООП). Увагу закцентовано на ігрових методах навчання, наведено окремі із них.
ВИКОРИСТАННЯ ІННОВАЦІЙНИХ ТЕХНОЛОГІЙ В ОРГАНІЗАЦІЇ ДОЗВІЛЛЯ СТУДЕНТІВ
Authors: Білик Вікторія Миколаївна , Ялліна Вікторія Леонідівна
Published: January 2025

В останнє десятиліття ХХ століття і на початку ХХІ століття змінилося ставлення до сприйняття дозвілля, як у суспільстві, так і в науковому середовищі. Дозвілля стали розглядати як самостійне явище в житті людини, на відміну від попередніх досліджень. Звернення до цієї проблеми не є випадковим, оскільки студентська молодь є однією з найактивніших соціальних груп людей, яка найбільш сприйнятлива до соціальних, економічних, соціальних і культурних інновацій. Проблема дозвілля розглядається вченими давно, пропонувалися різні трактування цього явища. Розмежовуються поняття «дозвілля» і «вільний час». Зроблено спробу проаналізувати, які заняття у вільний час є кращими для студентів, як вони воліють проводити свій вільний час наодинці чи в компанії друзів. Представлені за результатами анкетування студентів емпіричні дані дозволяють виявити ступінь поширеності серед молоді окремих способів проведення позанавчального часу та визначити структуру вільного часу студентів. Автори дійшли висновку, що у дозвіллі студентів переважає неорганізований вільний час, що дозвіллєва інфраструктура міста використовується слабо, а дозвілля є спонтанним, реалізованим переважно у віртуальній реальності з тенденцією до споживання, а не до розвитку та творення. Свій вільний час студенти проводять переважно з друзями або вдома, а культурне середовище студентів використовується слабо. Схильності молоді до самовдосконалення немає, лише менша частина відвідує заклади культури, що можна пояснити браком часу. Значна частина студентів бачить на дозвіллі можливість реалізації моделі поведінки на основі вільного вибору особистості. У статті наведено приклади педагогічних технологій, які використовуються в курсі «Провайдинг освітних технологій» модуль Педагогіка дозвілля. Обґрунтовано необхідність пошуку нових форм організації вільного часу студентів в умовах глобалізації інформаційного простору. Значна увага приділяється інноваційним заходам щодо стимулювання розвитку творчого середовища та підтримки студентської ініціативи з метою формування активної життєвої позиції.
Кібербезпека в сучасному світі: актуальні виклики : матеріали Міжнар. наук.-практич. конф. (м. Одеса, 22 листоп. 2024 р.)
Authors:   Національний університет «Одеська юридична академія»
Published: January 2025

У конференції взяли участь студенти, аспіранти, молоді вчені, викладачі та науковці. Конференція проводиться на базі Національного університету «Одеська юридична академія».