Informatica

This study proposes a novel method called the “Integrative Reference Point Approach (IRPA)” as an alternative method to existing MCDM methods. The basis of the newly proposed method is the satisfaction function and the reference set approach. Three different applications are performed to verify the validity of the proposed method from the perspective of optimal alternative rankings and sensitivity to changes in criteria weights. All results of comparative and sensitivity analyses show that the novel method is moderately sensitive to changes in criteria weights and compatible with other methods.

Conventional parking lots struggle to meet demand, prompting the rise of Fully Automated Parking Systems (FAPS), offering eco-friendly alternatives with advanced technology. However, operational challenges persist, especially in planning and scheduling. Real-time responsiveness necessitates dispatching rules and heuristics. This study comprehensively explores FAPS operational dynamics, assessing various rule combinations’ impact on customer wait times and system utilization. Utilizing a six-month MATLAB simulation, results favour the Nearest-Available-Slot (NAS) allocation rule coupled with First-Come-First-Served (FCFS) sequencing, emphasizing allocation’s pivotal role in system efficiency. Future research will refine allocation strategies to further optimize FAPS operational performance.

We consider here the optimization problems of simple competitive model. There are two servers providing the some service. Each server fix the price and the rate of service. The rate of service defines the customer losses waiting in line for the service. The customer go to the server with lesser total service cost. The total cost includes the service price plus waiting losses. A customer goes away, if the total cost exceeds some critical level. The flow of customers and the service time both are stochastic. There is no known analytical solution for this model. We get the results by Monte Carlo simulation. We get the analytical solution of the simplyfied model.

The model of the HIV/AIDS infection spread is proposed and investigated. The paper deals with some specific features of the disease spread at the initial stage, i.e., when the infection extent is small enough. We propose a model characterizing any risk group by three differential equations. These equations describe the dynamics of active susceptible, active infected, and passive infected individuals. The evaluation of parameters from demographical and medical data is discussed. The package for the investigation of infection is presented, and possibilities to control the infection are shown. Two general directions of control may be distinguished: the HIV/AIDS blood tests and the publicity and availability of protective means. The investigations showed under what conditions the HIV/AIDS infection may be stopped.

The aggregate approach to the formal description, verification and simulation of computer network protocols is considered in the paper. With this approach, the offered design stages can be performed using a single mathematical scheme. The reachability analysis method and the program proof technique are viewed as methods for correctness analysis. The proposed approach for correctness analysis and model construction was used in creating the protocol analysis system PRANAS.