In this study, we propose a method for applying a temporal relation identification model to functional requirements. We discuss the limited availability of data in the requirements engineering domain ...compared to other fields when used for supervised learning, and therefore employ a corpus from the news domain for training. The experimental results demonstrate that the types of temporal relations present in functional requirements are limited, indicating that focusing on learning with a narrowed set of labels is effective. Additionally, We incorporate Dependency Path (DP) into the temporal relation identification model and report, through comparative experiments, that leveraging DP is effective, but minor modifications to DP do not lead to significant improvements in accuracy. By demonstrating specific application methods of temporal relation identification in requirements engineering, we anticipate contributing to the analysis of functional requirements in software development.
Purpose
The purpose of our study was to compare the safety and efficacy of hematopoietic cell transplantation (HCT) using fludarabine (Flu)-based reduced intensity conditioning (RIC) with busulfan ...(BU) or melphalan (Mel) for primary immunodeficiency diseases (PID).
Methods
We retrospectively analyzed transplant outcome, including engraftment, chimerism, immune reconstitution, and complications in 15 patients with severe combined immunodeficiency (SCID) and 27 patients with non-SCID PID. The patients underwent Flu-based RIC-HCT with BU (FluBU: 7 SCID, 16 non-SCID) or Mel (FluMel: 8 SCID, 11 non-SCID). The targeted low-dose BU with therapeutic drug monitoring was set to 30 mg hour/L for SCID.
Results
The 2-year overall survival of all patients was 79.6% and that of patients with SCID in the FluBU and FluMel groups was 100% and 62.5%, respectively. In the FluBU group, all seven patients achieved engraftment, good immune reconstitution, and long-term survival. All five patients receiving umbilical cord blood transplantation achieved complete or high-level mixed chimerism and sufficient specific IgG production. In the FluMel group, six of eight patients achieved complete or high-level mixed chimerism. Viral reactivation or new viral infection occurred in one FluBU group patient and four FluMel group patients. In the non-SCID group, 10 of 11 patients (91%) who received FluMel achieved complete or high-level mixed chimerism but had variable outcomes. Patients with WAS (2/2 patients), NEMO deficiency (2/2 patients), and X-linked hyper IgM syndrome (2/3 patients) who received FluBU achieved complete or high-level mixed chimerism and long-term survival.
Conclusions
RIC-HCT with FluBU is a safe and effective strategy for obtaining high-level donor chimerism, immune reconstitution including B cell function, and long-term survival in patients with SCID. In patients with non-SCID PID, the results varied according to the subtype of the disease. Further prospective studies are required to optimize the conditioning regimen for non-SCID PID.
In software development, ambiguities in requirements described in natural language (NL) prevent the application of formal approaches, posing a difficulty that has heretofore been avoided in two main ...ways: discovery based on formal specifications generated from NL requirements, and the creation of non-ambiguous NL requirements. In the former, NL is more expressive and does not rely on the user's expertise, but instead makes the automatic generation of formal specifications difficult. The latter facilitates the automatic generation of formal specifications and has the advantage of reduced syntactic complexity, but in exchange for reduced expressiveness of NL. In this paper, we take an approach that allows users to describe highly expressive NL requirements and reduces syntactic complexity to support the automatic generation of formal specifications from NL requirements. We also propose an information extraction method using syntactic patterns of low syntactic complexity. Applying our method to practical requirement sentences reveals that it is effective in reducing the complexity of information extraction rules. We expect that our method can support the automatic generation of formal specifications from NL requirements without compromising the expressive power of the language.
Model checking with a time aspect is often used in verification on hardware and embedded systems. Timed automata are often used for such models. UPPAAL is a world-wide famous model checking tool for ...timed automata; however, UPPAAL is a Computational Tree Logic (CTL)-based model checking tool and cannot use Linear Temporal Logic (LTL) properties. Bounded model checking uses LTL (Linear Time Logic) for a checking formula. Bounded model checking specifies a boundary k and obtains counterexamples by searching from the initial state of a system to states reachable by k-steps. There are several studies on bounded model checking. Sorea has proposed a concrete algorithm for a timed automaton. There are, however, no clear details on how to implement bounded model checking tools for timed automata, and study the performance. Another problem is that the timed automaton covered by the method does not support general variables except for clock variables. The objective of this study is to implement a bounded model checking tool using LTL for timed automata. We also improve Sorea's method so that it can handle extended timed automata that handle general variables. This paper also presents some LTL examples from texts on requirement specifications for embedded systems and the results of applying the tool to them.
PDF