Nurses play a crucial role in healthcare, directly influencing the quality of patient care. Facing a global nursing shortage, there is an urgent need for strategies to enhance nursing efficiency and care quality. This foundational study explores an NLP-based approach to determine NANDA nursing diagnoses, leveraging both subjective and objective patient data recorded by nurses. Employing text data similarity analysis and a prototype predictive model, our research aims to refine the nursing assessment process and pave the way for the potential automation of nursing diagnoses. This work highlights the potential of AI to support nursing practices and sets a platform for future research to fully realize AI’s benefits in addressing the challenges posed by the nursing shortage.

IEEE802.1Qbv (TAS: Time Aware Shaper) has been attracting attention as a technology to realize low-latency communications for industrial networks (NWs) and wireless networks. TAS achieves low latency by designing a transmission schedule called a Gate Control List (GCL) from NW information such as propagation delay and link speed and transmission information such as transmission period and frame size. The demand for low-latency communications between distant sites is increasing, and TAS is expected to be realized in Service Provider Network (SPNW). Applying TAS to SPNWs makes it difficult to design GCLs because GCLs need to be designed for all nodes that compose the large NW. Especially, when two or more transmissions with specific periods are multiplexed, the scheduling success rate deteriorates due to schedule collisions. In this paper, we aim to increase the success rate of scheduling by allowing for jitter in transmission. Experimental results show that the proposed method is able to schedule approximately 2.3 times more users with 5 μs of jitter tolerance than the method that does not tolerate jitter when multiplexing traffic with various periodicities. In addition, we found that by managing the jitter across all the nodes through which the transmission passes, the proposed method was able to suppress the jitter to about 13% on average compare to the method in which the jitter is managed independently at each node.

As mass customization has matured, there is a growing expectation to extend the scope of IEEE802.1Qbv (Time-aware Shaper: TAS) to not only user network but also service provider networks (SPNW). To control communication latency in SPNW, a deviation in the transmission schedule of one user should not affect other users’ time-sensitive traffic. Hellmanns et al. [1] proposed a convergent TAS scheduling model. Kim et al. [2] proposed adding the concept of protection band to the TAS algorithm to send urgent event traffic immediately. The above related studies have not considered the resistance to the violation traffic when multiple users are accommodated in TAS NW, which we will discuss in this paper. First, we use the user identifiers to address the problem of other users' traffic interrupting the queue at different timing from the schedule by setting up exclusive queues and gates for each user. Second, we propose a combination of time slots that enable transmission of time-sensitive traffic and idle time that prohibits transmission. We take measures to prevent the transmission of delay-guaranteed traffic from colliding during transmission of other frames. A numerical simulation shows end-to-end jitter of SPNW is minimized by our proposed method.

A time sensitive converged network that can aggregate fronthaul and machine-to-machine (M2M) streams is required for the fifth generation mobile communication system (5G) era. Recently, a time sensitive network (TSN) for fronthaul in IEEE 802.1CM has been attracting attention. A time aware shaper (TAS), which is a component technology of a TSN, is an effective way to realize a converged network. However, lower priority streams suffer from a lack of usable bandwidth and a huge latency when employing a TAS because the broad bandwidth is reserved for high priority streams in TAS schemes. In this paper, we propose a gate shrunk (GS-)TAS, where a GS-frame is added at the end of high priority streams. We evaluate bandwidth use efficiency by using a numerical simulation. We also simulate the cumulative distribution function (CDF) for the latency performance in a bridged node. We report that the latency reduction rate for the M2M stream is 55.2% for a CDF of 99.7%. In addition, the GS-TAS use does not affect the fronthaul streams.

A fronthaul bridged network has attracted attention as a way of efficiently constructing the centralized radio access network (C-RAN) architecture. If we change the functional split of C-RAN and employ time-division duplex (TDD), the data rate in fronthaul will become variable and the global synchronization of fronthaul streams will occur. This feature results in an increase in the queuing delay in fronthaul bridges among fronthaul flows. This paper proposes a novel low-latency routing scheme designed to satisfy the latency requirements in fronthaul networks with path-control protocols. The proposed scheme formulates the maximum queuing delay by defining competitive links and flows. It selects the set of paths that satisfy the latency requirements with the Markov chain Monte Carlo method using machine learning (MCMC-ML). The initial paths are selected from candidate paths using the learned solutions, and path-reselection is performed with the MCMC method. We confirmed with computer simulations that the proposed scheme can compute routes for all flows that satisfy the delay requirements. We also confirmed that the route computation is accelerated with the learned solutions, even if the flow distribution changes.

A method is proposed to predict the shape of a paper model of a three piece brassiere cup, which consists of several cloth and wire parts. Currently, the shape of each part is determined by creating a paper model and then refining the model. This process is repeated until the desired shape is achieved. However, predicting the 3D shape with a simulation would improve design efficiency. As a model is made of paper, each part is assumed to be inextensible and its surface is represented as combination of developable surfaces. The potential energy of a cup and geometric constraints imposed on the cup are formulated by use of the normal curvature and the direction of a generatrix of each developable surface. Minimizing the potential energy under geometric constraints derives a stable shape of the cup model. The computed and measured cup shapes coincided qualitatively.

This paper proposes a new type of fiber-optic relaying that extends the coverage of mobile networks. The antenna facing the evolved Node B is geographically separated from the antenna facing the user equipment, and the two antennas are connected by an optical fiber. This paper proposes a design approach for fiber-optic inband relaying in the presence of self-interference, which is the interference between the backhaul and access links. The theoretical desired-to-undesired- signal ratio (DUR) resulting from the interference is discussed for both uplink and downlink on the basis of a practical layout model. Moreover, we show the DUR performance for two types of path loss models.

This paper presents a new type of fiber-optic relaying that extends the coverage of mobile networks. The antenna facing the evolved Node B is geographically separated from the antenna facing the user equipment, and the two antennas are connected via an optical fiber. We propose a design approach for fiber-optic inband relaying in the presence of self-interference, which is the interference between the backhaul and access links. The theoretical desired-to-undesired-signal ratio due to the interference is discussed in terms of the carrier frequency, radio propagation condition, and optical fiber length. Moreover, we show that the performance of fiber-optic relaying is superior to that of double-hop relaying.

Various applications and services have been provided over broadband optical access networks such as passive optical networks (PONs). The data communication among optical network units (ONUs) in the same PON, i.e. inter-ONU communication, is expected to be one of the most attractive communication architectures in the future, since it can provide low-latency peer-to-peer (P2P) communication services. However, the current PON systems cannot provide the services which require precise time synchronization among ONUs, e.g. smart grid services. This paper proposes an inter-ONU time synchronization technique using jitter buffer in the optical line terminal (OLT) to make inter-arrival time of control messages for time synchronization a constant value. The practical effectiveness of the jitter compensation technique is verified by a numerical simulation. The simulation results show that the proposed technique provides small packet delay variation (PDV) of the control messages, and improves the synchronization accuracy.

The paper proposes a generation system of unit quarternion curves and surfaces to design fair curves and surfaces. Curvature and variation of curvature are the primary factors that determine the quality of fair curves and surfaces; however not so many methods have been explored to directly manipulate them, especially in three dimensional space. We use unit quaternion curves in integral forms to specify the tangent of a curve and the first derivative of a surface in one parameter direction. This enables us to control their curvature and variation of curvature more than is possible with traditional parametric representations like Bezier and NURBS curves and surfaces. Using unit quaternion curves balances the efficiency of the design process and the fairness of the designed curves and surfaces. Our system can generate fair curves and surfaces within a short time and their quality is acceptable for industrial applications as well as CG animation.