IntroductionTransthoracic echocardiogram (TTE) is routinely requested in the clinical setting as it is a non-invasive investigation that provides invaluable diagnostic information. However, ...inappropriate requests impact the quality of service provision to other patients in a timely and effective manner. Rejected TTE (rTTE) requests were evaluated over two months to determine common themes of inappropriate referrals in a tertiary unit.MethodsThe study design utilised both retrospective and prospective methods to analyse rTTE requests from September to October 2021. A collaboration with the local echocardiography unit identified rTTE requests within the aforementioned time frame. A retrospective cohort study was performed in the first month to evaluate the underlying reason of rTTE requests. This was accomplished by entering patient unique identifiable number on the electronic request system to obtain the data. On 01/10/2021, a trust-wide oral presentation aimed at medical practitioners was organised to facilitate the understanding of TTE indications and contraindications in accordance with British Society of Echocardiography (BSE) guidelines. Subsequently, a prospective cohort study observed a similar technique to generate reproducible data in the later half of the study duration. After compiling all anonymous data on a table, this information was translated into pie charts.ResultsA total of 329 rTTE requests were identified in the study. Duplicated requests and lack of indications contributed predominantly to the number of recognised cases, at 115 (34.95%) and 98 (29.79%) cases respectively. Other significant reasons including recent TTE performed (n=31; 9.42%), cancellation by clinician (n=28; 8.51%) and patient death (n=24; 7.29%) also led to similar outcomes. Additionally, trivial reasons formed less than five percent of cases each (table 1). Out of 98 (29.79%) cases as above, cardiac-suspected morbidities or symptoms prompted TTE requests – infective endocarditis (n=39; 39.80%), left or right ventricular failure (n=25; 25.51%) and syncope/arrhythmia (n=19; 19:39%) in that order – but insufficient clinical information entered saw these requests being rejected. The common reasons of rejection in these circumstances were no indications as per modified Duke criteria, normal B-natriuretic peptide (BNP) level and lack of clinical symptoms as per BSE guidelines respectively. Promoting the understanding of TTE indications and contraindications appeared to reduce the number of rTTE requests especially in the domains of duplicated requests and lack of indications, which observed a decrement of 11 (3.3%) and 14 (4%) cases respectively.Abstract 158 Figure 1Reasons of rejected transthoracic echocardiogram requests in September and October 2021Abstract 158 Figure 2Insufficient indication subclassificationConclusionsPromoting the understanding of TTE indications and contraindications amongst clinicians led to reduction of inappropriate referrals. This suggests the overall benefit may be enhanced by implementing a series of questions prior to electronic request submission.Conflict of InterestNone to declare
•Stochastic requests with stochastic realization times.•Prepositioning in an on-demand bus routing problem with a recourse action.•Combine prepositioning, removal of empty stations and dynamic ...insertion.•Numerical tests of forecast accuracy.•Bus station assignment contributes to prepositioning.
This paper presents the first application of prepositioning in the context of the dynamic stochastic on-demand bus routing problem (DODBRP). The DODBRP is a large-scale dial-a-ride problem that involves bus station assignment and aims to minimize the total user ride time (URT) by simultaneously assigning passengers to alternative stations and determining optimal bus routes.
In the DODBRP, transportation requests are introduced dynamically, and buses are dispatched to stations with known requests. This paper investigates the concept of prepositioning, which involves sending buses not only to currently known requests but also to requests that are likely to appear in the future, based on a given probability.
To solve this dynamic and stochastic ODBRP, the paper proposes a heuristic algorithm based on variable neighborhood search (VNS). The algorithm considers multiple scenarios to represent different realizations of the stochastic requests.
Experimental results demonstrate the superiority of the prepositioning approach over the DODBRP across various levels of forecast accuracy, lengths of time bucket, and probabilities of realization. Furthermore, the paper shows that removing empty stations as a recourse action can further enhance solution quality. Additionally, in situations with low prediction accuracy, increasing the number of scenarios can lead to improved solutions. Finally, a combination of prepositioning, empty station removal, and the insertion of dynamic requests proves to be effective.
Overall, the findings of this paper provide valuable insights into the application of prepositioning in the dynamic stochastic on-demand bus routing problem, highlighting its potential for addressing real-world transportation challenges.
One of the most effective ways to study the library activity success is to work with unsatisfied readers’ requests to receive information corresponding to the library profile. The article contains ...material obtained in the course of research activities within the framework of the scientific project, which assumes, in particular, the study of the level of users’ satisfaction with the quality of collections. Therefore, the purpose of the article is to present the results of the analysis of the current situation with unsatisfied requests in the departments of the State Scientific Technological Library of SB RAS, its impact on the quality of the library collections and reader service, on decisionmaking to improve working activities. In the course of work, the authors used scientific methods of analysis and generalization both of theoretical elaborations and library statistical data. The analysis of refusals over the past five years has allowed us to formulate a number of problems leading to the emergence of unsatisfied readers’ requests. The revealed considerable changes both in the organizational and functional structures of the library and the technology of servicing readers have led to decentralization of the process of work with unsatisfied requests thus negatively influencing its coordination and effectiveness. The basic stated reasons are deterioration of information resources and imperfection of reference apparatus. Special consideration deserves the situation within the categories of priority for the scientific library: proceeding from the received data, refusals to them made 34 % from the total amount of unsatisfied requests. The authors suppose that the conclusions drawn on the results of the study, though being the upper “cut off” the problem of unsatisfied requests, are an objectively necessary basis for optimizing the processes of stack formation and servicing readers of SPSTL SB RAS.
► The study examines e-mail requests sent by Greek Cypriot university students to faculty. ► Their e-mails are characterized by directness and lack of lexical/phrasal downgraders. ► There was an ...omission of greetings and closings and inappropriate or unacceptable forms of address. ► These e-mails can be perceived as status-incongruent and capable of causing pragmatic failure. ► They appear to give the faculty no choice and fail to acknowledge the imposition involved.
The present study examines e-mail requests sent by Greek Cypriot university students (non-native speakers of English) to faculty at a major, English-medium university in Cyprus, over a period of several semesters. It examines forms of address (salutations), the degree of directness employed, and the degree and type of supportive moves and lexical/phrasal modifiers used by students in order to soften or aggravate their e-requests. Findings from the study have shown that the NNS students’ e-mails are characterized by significant directness (particularly in relation to requests for information), an absence of lexical/phrasal downgraders, an omission of greetings and closings and inappropriate or unacceptable forms of address. This paper argues that such e-mails can be perceived as impolite and discourteous and therefore capable of causing pragmatic failure. This is primarily due to the fact that they appear to give the faculty no choice in complying with the request and fail to acknowledge the imposition involved.
Pushing and caching are recognized as promising techniques to improve network capacity and handle explosive growth in data traffic. Caching schemes for synchronous requests have been extensively ...investigated, but little attention has been paid to the asynchronous case. However, asynchronism is an inherent property of user requests. In this paper, request delay information (RDI) is introduced to characterize the asynchronous user requests. Based on RDI, a coded joint pushing and caching (C-JPC) method is proposed to minimize the network traffic by jointly determining when and which data packets are to be pushed and whether they should be cached. Optimal offline and online C-JPC policies for noncausal and causal RDI can be obtained by solving optimization problems, which however are intractable. Fountain coded caching (FCC) and generalized coded caching (GCC) methods are further proposed to give sub-optimal C-JPC policies with low complexity. In addition, lower and upper bounds on the optimal traffic volume are presented. It is shown that FCC and GCC achieve optimal or near-optimal volumes of traffic in some special cases. Simulation results demonstrate that C-JPC brings significant multicasting gains.
The aim of this article is to bring a contribution of useful information to ensure an efficient management of the European funding projects, according to the contractual provisions and the legal ...regulations in this field. In order to ensure an appropriate financial flow, it is necessary to know the tools available for the beneficiary of the funds in order to make the best decisions regarding the choice of payment mechanisms: pre-financing, payment requests, reimbursement requests.
The first-mile transportation system connects scattered requests in residential areas to mass transit networks and provides convenient and high-quality travelling services. The complicated road ...network and passenger mobility lead to potential multiple selections of passengers when choosing pick-up locations, which is ignored in the literature. This study develops a multi-objective optimisation model for the first-mile transportation system considering requests' preference ranks for multiple boarding stops. The objectives are to minimize the system cost and the number of unserved requests as a proxy for service quality, respectively. We devise a hybrid solution approach combining the fast elitist non-dominated sorting genetic algorithm (NSGA II) with a variable neighbourhood search (VNS) improvement method. The method is tested and compared with the classical NSGA II and an exact method on a number of instances. We also examine the effect of multiple stops and the discount scheme on the system performance.
In pliable index coding, we consider a server with <inline-formula> <tex-math notation="LaTeX">m </tex-math></inline-formula> messages and <inline-formula> <tex-math notation="LaTeX">n ...</tex-math></inline-formula> clients, where each client has as side information a subset of the messages. We seek to minimize the number of broadcast transmissions, so that each client can recover any one unknown message she does not already have. Previous work has shown that the pliable index coding problem is NP-hard and requires at most <inline-formula> <tex-math notation="LaTeX">\mathcal {O}(\log ^{2}(n)) </tex-math></inline-formula> broadcast transmissions, which indicates exponential savings over the conventional index coding that requires in the worst case <inline-formula> <tex-math notation="LaTeX">\mathcal {O}(n) </tex-math></inline-formula> transmissions. In this paper, building on a decoding criterion that we propose, we first design a deterministic polynomial-time algorithm that can realize the exponential benefits, by achieving, in the worst case, a performance upper bounded by <inline-formula> <tex-math notation="LaTeX">\mathcal {O}(\log ^{2}(n)) </tex-math></inline-formula> broadcast transmissions. We extend our algorithm to the <inline-formula> <tex-math notation="LaTeX">t </tex-math></inline-formula>-requests case, where each client requires <inline-formula> <tex-math notation="LaTeX">t </tex-math></inline-formula> unknown messages that she does not have, and show that our algorithm requires at most <inline-formula> <tex-math notation="LaTeX">\mathcal {O}(t\log (n)+\log ^{2}(n)) </tex-math></inline-formula> broadcast transmissions. We construct lower bound instances that require at least <inline-formula> <tex-math notation="LaTeX">\Omega (\log (n)) </tex-math></inline-formula> transmissions for linear pliable index coding and at least <inline-formula> <tex-math notation="LaTeX">\Omega (t+\log (n)) </tex-math></inline-formula> transmissions for the <inline-formula> <tex-math notation="LaTeX">t </tex-math></inline-formula>-requests case, indicating that both our upper and lower bounds are polynomials of <inline-formula> <tex-math notation="LaTeX">\log (n) </tex-math></inline-formula> and differ within a factor of <inline-formula> <tex-math notation="LaTeX">\mathcal {O}(\log (n)) </tex-math></inline-formula>. We provide a probabilistic analysis over random instances and show that the required number of transmissions is almost surely <inline-formula> <tex-math notation="LaTeX">\Theta (\log (n)) </tex-math></inline-formula>, as compared with the <inline-formula> <tex-math notation="LaTeX">\Theta (n/\log (n)) </tex-math></inline-formula> for index coding. In addition, we show that these upper and lower bounds also hold for vector pliable index coding in the worst case instances and the random graph instances, implying that vector coding does not provide benefits in terms of these bounds. Our numerical experiments show that our algorithm outperforms existing algorithms for pliable index coding by up to 50% less transmissions.
Enhancement of ChatGPT using API Wrappers Techniques Younis, Muhanad T.; Hussien, Nadia Mahmood; Mohialden, Yasmin Makki ...
Al-Mustansiriyah journal of science,
06/2023, Letnik:
34, Številka:
2
Journal Article
Recenzirano
Odprti dostop
This study looks at how API (Application Programming Interface) wrapper technology can make it easier to use complex functions by putting together a lot of API calls. These packages have ...non-real-time interfaces that are hard to use. ChatGPT is a chatbot-specific GPT-3 language paradigm. It lets developers create chatbots that respond intelligently to natural language user input, creating a more engaging user experience. This article shows that ChatGPT, Python, and API wrapper technology may be used to develop a smart chatbot. We show how to use the OpenAI API library to add ChatGPT to Python programs. This makes it easier for developers to make chatbots that sound and act more like real people when they talk. Our contribution to this field is showing that it is possible to make smart chatbots with ChatGPT and API wrapper technology. To reach this goal, we use a system that combines the OpenAI API with ChatGPT and Python. This gives us valuable information about how to make smart chatbots. The efficiency of the system has been tested many times while applying it to different environments, and the results are satisfactory.
PT XYZ is a subsidiary of one of the largest IT companies in Indonesia which is engaged in Information and Communication Technology (ICT). The company's business unit consists of many aspects, for ...example in the IT distribution business, providing retail for ICT products, outsourcing IT personnel, designing, installing and maintaining all things related to information technology. In order to run all of its businesses, this XYZ company requires a lot of high quality and high quality human resources, but with the outbreak of the Covid19 pandemic, the work process for PT. XYZ is disturbed because it is done in their respective homes. This results in difficulties for employees in processing administrative matters with the office. One of them is in the matter of taking care of leave permits because the previous leave licensing process was still done manually. The management decided to build an application that can be used by all employees in all subsidiaries. Therefore, the aim of this research is to make an application that can support the administrative needs of employees in the field of leave licensing called "LeaveRequest". This application is designed using the Java programming language with the Spring Boot framework and using the Waterfall software development method. This study found the results that the majority of respondents strongly agree with the design and usability of this application, so it can be concluded that the LeaveRequest application has succeeded in fulfilling the needs in serving the utility of PT. XYZ in work from home condition.
PDF
