Abstract In IWOCA 2019, Ruangwises and Itoh introduced stable noncrossing matchings, where participants of each side are aligned on each of two parallel lines, and no two matching edges are allowed to cross each other. They defined two stability notions, strongly stable noncrossing matching (SSNM) and weakly stable noncrossing matching (WSNM), depending on the strength of blocking pairs. They proved that a WSNM always exists and presented an $$O(n^{2})$$ O ( n 2 ) -time algorithm to find one for an instance with n men and n women. They also posed open questions of the complexities of determining existence of an SSNM and finding a largest WSNM. In this paper, we show that both problems are solvable in polynomial time. Our algorithms are applicable to extensions where preference lists may include ties, except for one case which we show to be NP-complete. This NP-completeness holds even if each person's preference list is of length at most two and ties appear in only men's preference lists. To complement this intractability, we show that the problem is solvable in polynomial time if the length of preference lists of one side is bounded by one (but that of the other side is unbounded).

In this paper, we present an agent-based completion that cooperates with a physician to optimize parameter-text pairs collection from a medical note. Currently, in hospitals, there is a medical coding process, which collects certain parameter-text pairs from the medical note's narrative text. The process starts with categorizing the text into certain parameter-text pairs. Then, the collected pairs are studied by the coders to produce correct medical codes. However, since the physicians may not aware of the coders' requirements, the medical coding process is quite problematic, such as lack of parameter-text pairs. To address this problem, we propose an agent-based completion, which represents the coder's view to categorize the text into certain parameter-text pairs and recommend the parameters to be filled. This paper shows a basic design of the agent and the background technologies to support the completion system.

OBJECTIVE: For chronic diseases, medical history reconstruction is essential for retrospective database analyses. One important aspect is determining which prescriptions belong to the same episode. However, a standard framework for this task is still lacking, particularly for multitherapy datasets. This paper presents a medication episode construction framework for the medical history of patients with chronic diseases. METHODS: Allen's relaxed temporal relations (i.e., temporal relations with time constraints relaxed by ) is used to define the consecutive prescription relations considering the patients' behavior. For example, patients occasionally arrive earlier or later than their appointment. RESULTS: influences the generation of stable periods (i.e., periods of time, at least three months, in which a medication is continuously taken by a patient). When using the lowest selected value (7 days), considerably fewer shorter stable periods (for durations less than 300 days) are produced and more longer stable periods are produced compared to cases without using . Furthermore, the results show that by using , regarding the number of events, where a stable period continues the previous stable period, decreases and the number of medication transition events available to be observed increases. CONCLUSION: Using in medication episode construction from multitherapy prescription datasets enables the longer expression of short-duration fragmented prescriptions and pruning repetitive prescriptions. SIGNIFICANCE: Our proposed framework is designed for multitherapy datasets, which has not been addressed by previous studies. The concept of relaxes the prescription relation against noise caused by the patient behavior and consequently provides a compact, but informative search space for observing medication transition events in a longitudinal analysis.

In the stable marriage problem, we are given a set of men, a set of women, and each person's preference list. Our task is to find a stable matching, that is, a matching admitting no unmatched (man, woman)-pair each of which improves the situation by being matched together. It is known that any instance admits at least one stable matching. In this paper, we consider a natural extension where k (>= 2) sets of preference lists L_i (1 <= i <= k) over the same set of people are given, and the aim is to find a jointly stable matching, a matching that is stable with respect to all L_i. We show that the decision problem is NP-complete already for k=2, even if each person's preference list is of length at most four, while it is solvable in linear time for any k if each man's preference list is of length at most two (women's lists can be of unbounded length). We also show that if each woman's preference lists are same in all L_i, then the problem can be solved in linear time.

In this paper, we propose an autonomous microgrid operation by using multi-agent approach. The proposed multi-agent system consists of seven types of agent (AG). In a microgrid, load AGs act as consumers or buyers, generator AGs, photovoltaic AGs and wind-turbine generation AGs act as producers or sellers, and battery AGs act as prosumers or sellers/buyers. In order to verify the performance of the proposed system, it applied to a simple model system with different electrical power prices. From the simulation results, it can be seen the proposed multi-agent system could perform a smart-grid operation efficiently.

In this paper, we propose the utilization of code combining (CC) diversity branch combining scheme for diversity reception in mobile communications. The bit-error-rate (BER) performance of CC scheme is investigated by computer simulation at various conditions of transmission systems and channels, and compared with that of the counterpart systems using conventional maximal ratio combining (MRC) scheme. The simulation results show that CC scheme can directly improve the BER performance of the transmission systems by increasing the error correcting capability of the error control code after diversity branch combining, therefore, it is effective to combat not only the frequency flat fading, but also the frequency selective fading, co-channel interference, and so on. Furthermore, the system implementation of CC scheme is as simple as that of conventional selection combining (CC) scheme. It is confirmed that CC scheme is a better diversity branch combining scheme than conventional MRC scheme in mobile communications.