Search

Abstract--Bacteria exist in a variety of groups of shapes, sizes, and single or multiple cell formations. In this paper, the level set shape reconstruction technique, the method of moments, and the marching cubes methods are integrated in the high frequency band for imaging three dimensional bacteria. The time step and the resolution of the marching cubes method are investigated to smooth the error function of the level set and hence speed up the convergence at high frequencies. The numerical results demonstrate the robustness of the level set algorithm for the detection of bacteria based on their shapes. The three dimensional shape reconstructions of unknown bacteria can be utilized to classify biological warfare agents. [ABSTRACT FROM AUTHOR]

This paper describes an improved retrieval algorithm of Total Precipitable Water (TPW) and Cloud Liquid Water (CLW) for the Advanced Microwave Scanning Radiometer - Earth Observing System (AMSR-E). The original algorithm has been developed to produce a standard AMSR-E TPW at the Japan Aerospace Exploration Agency (JAXA). In this study, the algorithm was improved and a new capability was introduced to retrieve CLW. The derived TPW products were compared with TPW from Radio Sonde Observations (RAOB) and Global Positioning System (GPS) Integrated Water Vapor (IWV). The retrieved CLW were assessed in term of cross talks with other geophysical parameters, such as sea surface temperature, sea surface wind speed and TPW. [ABSTRACT FROM AUTHOR]

We developed a 3D archive system for Japanese traditional performing arts. The system generates sequences of 3D actor models of the performances from multi-view video by using a graph-cuts algorithm and stores them with CG background models and related information. The system can show a scene from any viewpoint as follows; the 3D actor model is integrated with the background model and the integrated model is projected to a viewpoint that the user indicates with a viewpoint controller. A challenge of generating the actor models is how to reconstruct thin or slender parts. Japanese traditional costumes for performances include slender parts such as long sleeves, fans and strings that may be manipulated during the performance. The graph-cuts algorithm is a powerful 3D reconstruction tool but it tends to cut off those parts because it uses an energy-minimization process. Hence, the search for a way to reconstruct such parts is important for us to preserve these arts for future generations. We therefore devised an adaptive erosion method that works on the visual hull and applied it to the graph-cuts algorithm to extract interior nodes in the thin parts and to prevent the thin parts from being cut off. Another tendency of the reconstruction method using the graph-cuts algorithm is over-shrinkage of the reconstructed models. This arises because the energy can also be reduced by cutting inside the true surface. To avoid this tendency, we applied a silhouette-rim constraint defined by the number of the silhouette-rims passing through each node. By applying the adaptive erosion process and the silhouette-rim constraint, we succeeded in constructing a virtual performance with costumes including thin parts. This paper presents the results of the 3D reconstruction using the proposed method and some outputs of the 3D archive system. [ABSTRACT FROM AUTHOR]

The repletion rate of guide dogs for visually handicapped persons is roughly 10% nationwide. The reasons for this low rate are the long training period and the expense for obtaining a guide dog in Japan. Motivated by these two reasons, we are developing guide-dog robots. The major objective is to develop an intelligent human-robot interface. This paper describes two novel interface algorithms and strategy to guide visually handicapped person. We developed new leading edge searching method, which uses a single laser range finder (LRF) developed to find the center of the corridor in an indoor environment. We also developed a new twin cluster trace method that can recognize the led-person's walking conditions measured by the LRF. The algorithm allows the guide-dog robot to accurately estimate and anticipate the led-person's next move. We experimentally verified these algorithms. The results show that the algorithms are reliable enough to enable the guide-dog robot and the led-person to maneuver in a complex corridor environment. [ABSTRACT FROM AUTHOR]

In this paper, we describe an intelligent location-aware city guide system, which adapts to each user’s preferences, and uses an intuitive “metal detector” interface for navigation. Our system analyzes each user’s past location data history to estimate individual preferences, and allows users to find shops that match their tastes in the same way a metal detector would be used to detect metal objects. The procedure with which the system picks out shops that match each user’s preferences includes a newly developed place learning algorithm, which can efficiently find frequented places, complete with their proper names (e.g. “The Ueno Royal Museum”). We have conducted a series of evaluation tests at a popular shopping district inside Tokyo, and the results validate the effectiveness of our overall approach. [ABSTRACT FROM AUTHOR]

The Unazuki Reservoir is located on the Kurobe River, which is influenced by a catchment with one of the highest sediment yields in Japan. Due to a sufficiently available discharge during flood events, annual sediment flushing with full water-level drawdown (i.e., free-flow sediment flushing) is conducted to preserve the effective storage capacity of the reservoir. Nevertheless, the upstream half of the reservoir (i.e., study segment) suffers from the excessive deposition of coarser sediments. Remobilization of these coarser materials and their transportation further downstream of the reservoir is a priority of reservoir owners for sustainable reservoir functions, such as flood-risk management and hydroelectric energy generation. In this paper, an already conducted sediment-flushing operation in the Unazuki Reservoir is simulated, and its effects on sediment scouring from the study segment of the reservoir together with changes in bed morphodynamics are presented. A fully 3D numerical model using the finite volume approach in combination with a wetting/drying algorithm was utilized to reproduce the hydrodynamics and bed changes using the available onsite data. Afterwards, the effects of discharge adjustment on the morphological bed changes and flushing efficiency were analysed in the study segment using an additional single-discharge pulse supplied from upstream reservoirs. Simulation results showed that an approximately 75% increase in the average discharge during the free-flow stage changed the dominant morphological process from deposition into an erosive mode in the study segment. If the increase in discharge reaches up to 100%, the flushed volume of sediments from the target segment can increase 2.9 times compared with the initiation of the erosive mode. [ABSTRACT FROM AUTHOR]

Discovering periodic-frequent patterns in temporal databases is a challenging problem of great importance in many real-world applications. Though several algorithms were described in the literature to tackle the problem of periodic-frequent pattern mining, most of these algorithms use the traditional horizontal (or row) database layout, that is, either they need to scan the database several times or do not allow asynchronous computation of periodic-frequent patterns. As a result, this kind of database layout makes the algorithms for discovering periodic-frequent patterns both time and memory inefficient. One cannot ignore the importance of mining the data stored in a vertical (or columnar) database layout. It is because real-world big data is widely stored in columnar database layout. With this motivation, this paper proposes an efficient algorithm, Periodic Frequent-Equivalence CLass Transformation (PF-ECLAT), to find periodic-frequent patterns in a columnar temporal database. Experimental results on sparse and dense real-world and synthetic databases demonstrate that PF-ECLAT is memory and runtime efficient and highly scalable. Finally, we demonstrate the usefulness of PF-ECLAT with two case studies. In the first case study, we have employed our algorithm to identify the geographical areas in which people were periodically exposed to harmful levels of air pollution in Japan. In the second case study, we have utilized our algorithm to discover the set of road segments in which congestion was regularly observed in a transportation network. [ABSTRACT FROM AUTHOR]

In this paper the authors report on a new algorithm used to separate an object from its background using a background image. In the past, simple background subtraction has been used because of its low processing costs and ease of implementation. However, because this method depends solely on brightness patterns in the object and shadows, it has problems such as an inability to deal with poor lighting conditions and an inability to detect regions in which the brightness levels of the object and shadows are similar. In order to resolve these problems, in this paper the authors propose a new filter process called a Radial Reach Filter (RRF). The authors define a new statistic called a Radial Reach Correlation (RRC) used to determine on a pixel-by-pixel basis the similar and dissimilar areas between a background image and a current scene. They then evaluate the local texture at pixel-level resolution while reducing the effects of variations in lighting. In addition, by introducing a mechanism to adjust the defined region adaptively based on local characteristics of the background image, the authors are able to work with various shadows and objects in the scene. The authors perform a theoretical evaluation and experiments using real images to demonstrate the validity of their proposed method. © 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(10): 63–73, 2004; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/scj.10590 [ABSTRACT FROM AUTHOR]

Kron's Diakoptics is well known as a solution method of large-scale network problems by tiering. It interconnects all tiered subnetworks with tiered branches simultaneously by one step. We introduce Multistep Diakoptics (MSD), which interconnects tiered subnetworks partially with subsets of tiered branches step-by-step, and completes interconnections by multiple steps. By using the parallel computation method, the MSD algorithm uses less computation time than is the case with the standard Diakoptics algorithm. This paper introduces the MSD algorithm and the program that is executed by each computer in a multiple computer system and solves only a tiered subnetwork problem. We also explain the contents of data which must be transmitted to other computers. Furthermore, computation complexity, communication complexity, and organization of block data used in each computer for simulation of large-scale nonlinear networks are discussed, and a simple method for applying MSD in practice is introduced. It is concluded that, characteristically, MSD reduces the computation time in accordance with the number of computers if the data transmission time can be neglected. [ABSTRACT FROM AUTHOR]

This paper presents a method for designing neural networks using a genetic algorithm (GA) with deterministic mutation (DM) based on learning. The GA presented in this paper has a large framework including DM, which is performed on the basis of the results from neural network learning. It can achieve better convergence properties than traditional GAs. This framework is an evolutional system based on mutual interaction between DM and traditional genetic operators including stochastic mutation. It is also a model of transcription and reverse transcription in DNA. We show that the present method is better than conventional GAs with respect to convergence in learning. © 1998 Scripta Technica. Syst. Comp Jpn, 29(3): 10–17, 1998 [ABSTRACT FROM AUTHOR]

This paper proposes a new method in which the speech recognition processing is executed framewise on the time axis by local parallel operations using the Markov random fields (MRF). There have not been many studies presented concerning the parallel execution of the speech processing. On the hand, it is anticipated that parallel processing algorithms for the recognition process proposed in this paper will be very useful in high-performance continuous speech recognition systems, for example, where a strong computational power is required. The essence of parallel execution is to estimate the optimal state sequence by a parallel process based on the iterated conditional modes (ICM) for the given model parameters and the sequence of observed values. The local probability for the state sequence is indispensable for this purpose. It is shown that the local probability can be derived by representing the generation probability of the state sequence in a HMM (hidden Markov model) as a Gibbs distribution and calculating its conditional distribution. The foregoing property implies that the one-sided Markov chain used in HMM can be converted into a two-sided Markov chain in the one-dimensional MRF. Through the speaker-independent digit speech recognition experiment, it is shown that the proposed parallel processing algorithm has recognition performance comparable to that of the Viterbi algorithm. [ABSTRACT FROM AUTHOR]

This paper discusses the structural analysis algorithm for line patterns, based on the distance transformation of a line pattern by iterative local parallel processing. Although parallel processors have been applied recently to image processing, the processing of line patterns in the past was based primarily on the transformation of the object pattern into the list structure or symbol strings. Few studies have been made on the parallel processing algorithm for a line pattern. From such a viewpoint, this paper presents parallel-type algorithms for loop counting, loop extraction and arc decomposition, among the procedures for processing line patterns. Properties of these algorithms also are discussed. The method proposed here is based on the distance transformation (Min. type) for line patterns we developed, and can be performed by iterative local parallel processing, in the same way as the distance transformation itself. [ABSTRACT FROM AUTHOR]

Impedance cardiography (ICG) and peripheral bioimpedance may be useful for monitoring several cardiovascular parameters such as cardiac output, stroke volume, blood pressure and heart rate. It is a noninvasive and low‐cost method and could be useful for diagnosis and treatment in different clinical situations. This study involved 100 volunteers and their age ranging from 18 to 26 years. The acquired bioimpedance signal was pre‐processed and used to estimate the heart rate. Thus, heart rates of each subject were calculated and then compared with actual measurement from FUZZY model MP3 digital blood pressure monitor. The results showed high precision with a 1.38 mean error a high sensitivity of 99.81% and a positive predictivity value of 99.63%, respectively. Compared with six other methods selected from the literature review and which are initially dedicated to ECG signals, the proposed method has been found to be more efficient and more precise with an error in determining the percentile HR = 1.78%. © 2022 Institute of Electrical Engineers of Japan. Published by Wiley Periodicals LLC. [ABSTRACT FROM AUTHOR]

Due to the unavailability of accurate data and the limitations of the existing methods, reliable input–output tables (IOTs) may not be available for all the regions in a country. This study proposes a novel approach to estimate the regional input coefficients. It harnesses the capabilities of machine-learning (ML) algorithms to estimate the regional input coefficients of one region based on the IOTs of multiple other regions for which reliable data are available. The application of three ML algorithms is investigated using data from Japan. The results highlight the superior performance of the ML models compared with location quotient models. [ABSTRACT FROM AUTHOR]

Objectives: To investigate the prevalence of hoarseness and its association with the severity of dysphagia in patients with sarcopenic dysphagia. Design: Cross-sectional study using the Japanese sarcopenic dysphagia database. Setting: 19 hospitals including 9 acute care hospitals, 8 rehabilitation hospitals, 2 long-term care hospitals, and 1 home visit rehabilitation team. Participants: 287 patients with sarcopenic dysphagia, aged 20 years and older. Measurements: Sarcopenic dysphagia was diagnosed using a reliable and validated diagnostic algorithm for the condition. The presence and characteristics of hoarseness classified as breathy, rough, asthenic, and strained were assessed. The prevalence of hoarseness and the relationship between hoarseness and Food Intake LEVEL Scale (FILS) were examined. Order logistic regression analysis adjusted for age, sex, naso-gastric tube, and handgrip strength was used to examine the relationship between hoarseness and FILS at baseline and at follow-up. Results: The mean age was 83 ± 10 years. Seventy-four (26%) patients had hoarseness, while 32 (11%), 20 (7%), 22 (8%), and 0 (0%) patients had breathy, rough, asthenic, and strained hoarseness, respectively. Median FILS at the initial evaluation was 7 (interquartile range, 5–8). Hoarseness (β=0.747, 95% confidence intervals= 0.229, 1.265, p=0.005), age, sex, naso-gastric tube, and handgrip strength were associated independently with baseline FILS, while hoarseness (β=0.213, 95% confidence intervals= −0.324, 0.750, p=0.438) was not associated independently with the FILS at follow-up. Conclusions: Hoarseness was associated with the severity of dysphagia at baseline, however not a prognostic factor for sarcopenic dysphagia. Resistance training of swallowing and respiratory muscles and voice training as part of rehabilitation nutrition might be useful for treating sarcopenic dysphagia. [ABSTRACT FROM AUTHOR]

Privacy preserving data mining for medical information is an important issue to guarantee confidentiality of integrated multiple data sets. In this paper, we propose a secured scheme to estimate related risk of cancers accurately and effectively in a privacy-preserving way. We study models to configure the appropriate set of attributes to reduce risk of identity of an individual from being determined. We examine the proposed privacy preserving protocol for encrypted hypothesis test, using actual cohort data supplied by National Cancer Center. [ABSTRACT FROM AUTHOR]

Summary: Areal BMD (aBMD) from DXA is not a sufficiently accurate predictor of fracture. Novel volumetric BMD derived from 3D modeling of the hip from DXA images significantly improved the predictive ability for hip fracture relative to aBMD at the femoral neck, but not aBMD at the total hip. Introduction: To clarify whether volumetric and geometric indices derived from novel three-dimensional (3D) modeling of the hip using dual-energy X-ray absorptiometric (DXA) images improve hip fracture prediction relative to areal bone mineral density (aBMD). Methods: We examined 1331 women who had completed the baseline survey and at least one follow-up survey over 20 years (age 40–79 years at baseline). Each survey included aBMD measurement at the hip by DXA. Volumetric and geometric indices of the hip at baseline and the 10-year follow-up were estimated from DXA images using a 3D modeling algorithm. Incident hip fractures during the 20-year follow-up period were identified through self-report. Cox proportional hazards regression models allowing for repeated measurements of predictors and outcomes were constructed, and their predictive ability for hip fracture was evaluated using areas under receiver operating characteristic curves (AUCs) and net reclassification improvement (NRI) over aBMD at the femoral neck (FN) and total hip (TH) as references. Results: During a median follow-up of 19.8 years, 68 incident hip fractures were identified (2.22/1000 person-years). A significantly larger AUC of trabecular volumetric BMD (vBMD) at the total hip (AUC = 0.741), femoral neck (AUC = 0.748), and intertrochanter (AUC = 0.738) and significant NRI (0.177, 0.149, and 0.195, respectively) were observed compared with FN-aBMD (AUC = 0.701), but not TH-aBMD. Conclusions: vBMD obtained from 3D modeling using routinely obtained hip DXA images significantly improved hip fracture risk prediction over conventional FN-aBMD, but not TH-aBMD. Trial registration: The Japanese Population-Based Osteoporosis (JPOS) Cohort Study was retrospectively registered as UMIN000032869 in the UMIN Clinical Trials Registry on July 1, 2018. [ABSTRACT FROM AUTHOR]

We propose a method to improve the performance of R-learning, a reinforcement learning algorithm, by using multiple state-action value tables. Unlike Q- or Sarsa learning, R-learning learns a policy to maximize undiscounted rewards. Multiple state-action value tables cause substantial explorations as needed and make R-learning work well. Efficiency of the proposed method is verified through experiments in a simulated environment. © 2007 Wiley Periodicals, Inc. Electr Eng Jpn, 159(3): 34– 47, 2007; Published online in Wiley InterScience (www.interscience. wiley.com). DOI 10.1002/eej.20473 [ABSTRACT FROM AUTHOR]

In this paper, the authors describe symbolic model checking for real-time systems based on approximation. It is important to determine how to reduce the increase in verification cost due to timed-state processing during symbolic model checking of a real-time system. Verification techniques that use a set of approximate states instead of exact timed states in a reachability analysis of a real-time system have been proposed to increase the effect in reducing the verification cost. Therefore, the authors propose a symbolic model checking technique for real-time systems that uses a set of approximate states. The verification algorithm calculates the set of approximate states by performing fixpoint calculations based on an approximation corresponding to a computation tree logic (CTL) formula. The authors implemented the proposed algorithm and compared it with existing real-time symbolic model checkers. They obtained results showing that the proposed technique is effective for verifying a large-scale system that includes many clock variables. © 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(10): 83–101, 2004; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/scj.10565 [ABSTRACT FROM AUTHOR]

A simple and fast diagnostic method for multiple open‐circuit faults in voltage‐source inverters based on the current vector phase is proposed. The characteristics of the current vector phase in both healthy and faulty conditions are analyzed in detail, and simple fault symptom variables are defined to extract the features for fault isolation. The proposed method can diagnose 21 types of open‐circuit faults only by using current vector phase information, and it is fast, robust and easy to implement in existing systems without additional sensors. Several experimental results verify that the diagnostic algorithm has no false alarms under speed and load transient conditions, and the fault can be isolated within 15% of the current fundamental cycle in the case of the fastest diagnostic process and no more than 80% of the current cycle in the worst cases. © 2021 Institute of Electrical Engineers of Japan. Published by Wiley Periodicals LLC. [ABSTRACT FROM AUTHOR]

The specification for a communication protocol is generally represented by a finite-state machine, and the operation of the machine is represented by transitions among states. The device implementing such specification is called the implementation under test (IUT). It is important for the IUT that its operation should be verified for all state transitions on the finite-state machine given in the specification. This test is called the conformance testing. In such testing it is important to generate efficiently a route containing all state transitions from the initial state. This problem is called the test sequence generation problem. This paper considers the test sequence generation problem for a communication protocol and proposes an application of an algorithm for satisfiability problem (SAT) that can flexibly handle various constraints, such as the order constraint and the time constraint among multiple constraints. The proposed method is applied to the dynamic host configuration protocol (DHCP) and its effectiveness is demonstrated. © 2003 Wiley Periodicals, Inc. Syst Comp Jpn, 34(11): 20–29, 2003; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/scj.10482 [ABSTRACT FROM AUTHOR]

Over the past decade, several inductive logic programming (ILP) systems have been developed. However, the normal ILP system does not have enough power to induce logic programs in some domains. Therefore, various new ILP systems, such as nonmonotonic ILP, that apply new learning tasks, have been proposed. In the present paper, a new learning task, called relational learning from nondichotomizable examples, is proposed for relational domains. The scheme of this task is similar to that of normal ILP, with the exception of the training examples. Normally, conventional ILP uses positive and negative examples in the training process. However, the examples of the proposed learning task are not strictly positive or negative: the training examples have a continuous scale. This new learning task is defined and a new method for learning this task is proposed. A new ILP system, SYNGIP (for SYNthesized system using Genetic programming and Inductive logic Programming), is developed based on this method and the performance of SYNGIP is compared experimentally to that of the conventional ILP method for the task of human feeling acquisition. © 2001 Scripta Technica, Syst Comp Jpn, 32(14): 34–40, 2001 [ABSTRACT FROM AUTHOR]

In general, systems are comprised of a large number of elements and might be very symmetric. In verification of such systems, they are reduced while upkeeping their global structure and verified with the intuitive expectation that the verification of such reduced systems will yield almost the same results as those of the original ones. However, such verifications do not guarantee the success of original system verifications. In this paper, the target is verification of arbitrary scale systems with star-shape configuration which can be expressed by Petri nets. The proposed algorithm explores the reachable state space with no dependency on system scale. © 2001 Scripta Technica, Syst Comp Jpn, 32(14): 41–53, 2001 [ABSTRACT FROM AUTHOR]

Reliability information of satellite precipitation products is required for various applications. This study describes and evaluates a reliability flag of the Global Satellite Mapping of Precipitation Near-Real-Time precipitation product (GSMaP_NRT). This flag was developed to characterize the reliability of GSMaP_NRT data simply and qualitatively by considering its algorithm characteristics. The reliability at each pixel is represented by any one of ten levels (10 being the best and 1 the worst) by considering three major factors: 1) "surface type reliability"--which takes into account that estimation of rainfall using passive microwave sensors is better over the oceans than over land and coastal areas; 2) "low-temperature reliability"--which takes into account the lower reliability due to surface snow cover in low-temperature conditions; and 3) "Moving Vector with Kalman Filter (MVK) propagation reliability"--which means that the reliability gets worse with the increase in time since the last overpass of the passive microwave sensor. To evaluate the utility of the reliability flag, statistical indices are calculated for each reliability level using gauge-calibrated ground radar data around Japan. It is found that the reliability flag represents the differences in GSMaP accuracy: the accuracy worsens as the reliability decreases. The GSMaP errors exhibit seasonal changes that are well represented by the ten levels of the reliability flag, indicating that the reliability flag can be used to catch seasonal variations in GSMaP accuracy due to changes in environmental factors. This study also raises the possibility of improving the reliability flag by using information related to heavy orographic rainfall. It is shown how the error features of heavy orographic rainfall differ from those of the total rainfall, and it is suggested that heavy orographic rainfall information can be utilized to further improve the reliability flag. [ABSTRACT FROM AUTHOR]

The communication network of wide‐area protection may be interrupted because of the severe environment or artificial damage. The delay of communication will increase so much that the wide‐area protection cannot work normally in some severe cases mentioned above. That is one of the factors which affect the application of wide‐area protection. A reconstruction algorithm including different circuitous modes for different situations is proposed to maintain the transmission of the data on the interrupted channel. On the one hand, a single‐path circuitous mode is proposed when the data in the shut path is small. In this situation, the best circuitous path can be found out by Floyd considering the several reference factors affection. On the other hand, a multi‐paths circuitous model is proposed to solve the congestion which is caused by detouring under single‐path circuitous mode. The available margin of the bandwidth of the weakest channel called the short‐board channel in each circuitous path is the focus of the algorithm. In this situation, the optimal shunt coefficients are determined according to the bandwidth margin ratio of the short‐board channel. Then the data on the interrupted channel is divided into several streams based on the shunt coefficients. Therefore, the balance of the communication network can be ensured after the interrupted channel is divided. Finally, with OPNET communication simulation software, the IEEE14 nodes network is built. Delay and balance of system based on this reconstruction algorithm are tested. © 2021 Institute of Electrical Engineers of Japan. Published by Wiley Periodicals LLC. [ABSTRACT FROM AUTHOR]

The authors have previously proposed an efficient affine transformation algorithm for the two-dimensional binary image, where the image is represented by the run format called PXY table and the transformation is executed combining the skew and the transpose manipulations. This paper proposes a new affine transformation algorithm for the three-dimensional object (three-dimensional binary image) represented by the three-dimensional run format, called SPXY table. The SPXY table is composed by stacking the two-dimensional PXY tables. The affine transformation on the SPXY table is realized as a combination of the three-dimensional skew and the transpose manipulations, as an extension of the case of the two-dimensional PXY table. As the result of experiment, it is shown that the proposed method is faster, by a factor of 36 to 389, than the primitive method which applies the transformation to each voxel. It is also shown that the CPU time for the affine transformation by the proposed method is proportional to the number of runs in the representation of the three-dimensional object. The result of the affine transformation by the proposed method contains an error, which may be greater than the rounding error when the result is converted to an integer by rounding the subdecimal. The error analysis is applied to the three-dimensional rotation, which is used most frequently among the affine transformations. As a result, it is seen that the absolute error of each coordinate in the proposed method is 1.4 at the maximum. © 1998 Scripta Technica. Syst Comp Jpn, 29(3): 18–27, 1998 [ABSTRACT FROM AUTHOR]

This paper proposes a quasi-competitive network in which the mass reaction intensity of the elements in the intermediate layer is kept constant as a model that approximates the continuous nonlinear function. As the loss function, the local loss function is considered. It is composed of the error and the local model loss term reflecting the local model size. The learning algorithm of the quasi-competitive network including the change of the number of elements is derived from the local loss function. It is shown by numerical experiment that the quasi-competitive network can form quickly the structure reflecting the target function and has a high generalization power. It is shown also that the high generalization power is due to the constant mass reaction intensity of the elements in the intermediate layer of the quasi-competitive network. [ABSTRACT FROM AUTHOR]

This paper proposes an algorithm for a data-driven segmentation of an image consisting of multiple textures. The method uses hierarchical Markov random fields (MRF) consisting of two layers: the first layer MRF representing invisible regional images; and the second layer MRF representing a different texture in each region. This method is based on the EM algorithm for estimating the maximum likelihood of incomplete data, to treat invisible regional processes. The algorithm repeats an estimation of the MRF parameters and a segmentation (estimation of region processes). The former is carried out by maximizing a pseudolikelihood function; the latter is carried out by applying ‘the deterministic iterative relaxation algorithm’ (developed by the authors) to the textured images. The proposed algorithm has been confirmed successfully by computer simulations using artificially composed textures. [ABSTRACT FROM AUTHOR]

Although it is pointed often that multilayer neural networks should have a certain degree of fault tolerance, very few discussions based on the rigorous definition of fault tolerance have been made so far. Also, there have been few discussions on the mechanisms that bring out the fault tolerance. This paper shows that a learning algorithm that directly reduces a measure of fault tolerance can be derived in a similar way to the conventional backpropagation. By analyzing the resulting networks, the mechanism that realizes the fault tolerance and the properties of the fault-tolerant networks are investigated. Simulation results show the effectiveness of the proposed learning algorithm. It also is revealed that the utilization of the redundant hidden units and the saturation property of the sigmoid function realizes the fault tolerance. Moreover, it is shown that a good influence on generalization ability can be expected from the learning algorithm for fault tolerance. [ABSTRACT FROM AUTHOR]

This paper describes algorithms of magnifying/reducing, rotation, and border following for binary document images by using a segmented block code. Document images such as facsimile images are composed of a large number of binary data. Thus it is difficult for a small-sized conventional computer to process efficiently a whole document image in a pixel-by-pixel manner. Our algorithms described herein use segmented block coded data instead of pixel data. In the segmented block coding scheme, blocks which are two-dimensional contiguous black pixel areas are extracted and coded by their locations and shapes. Since this coding scheme compresses the amount of data required to process and produce the data form which is suitable to deal with by conventional computer, our algorithms using this coded data work efficiently. Also, there is another advantage in that the results of magnifying/reducing or rotation of Images are obtained in the form of a segmented block code. This means that we can manage document images in a unified manner. [ABSTRACT FROM AUTHOR]

This paper presents basic concepts and fundamental algorithms for processing three- dimensional digitized images (3D images). A 3D image is a pictorial datum obtained by measuring physical quantities distributed at every point in 3D space and arranging the measurements on a 3D array. First, we present several basic concepts concerning geometrical properties of 3D images, which include connectivity, the connected component, the Euler number, and deletability. Then we explain outlines of basic algorithms derived by using the forementioned concepts based on research results by the authors' group. Procedures referred to here are as follows: calculation of the Euler number, deletability test of 1-voxels, shrinking, thinning, and border following. Finally, we add 51 refer- ences which may aid more detailed research; these references also will supplement the brief explanations and small number of procedures we are limited to in this article. [ABSTRACT FROM AUTHOR]

The median filter is used frequently in image processing for smoothing while retaining edges. This paper describes an efficient method to calculate the rank filter, which is a generalization of the median filter and includes it as a special case. The presented method is simpler than the method proposed previously by Danielsson. A strict proof is given for its validity. An application to the construction of a logical circuit realizing the algorithm is also described. [ABSTRACT FROM AUTHOR]

In order to solve the problem of low accuracy in indoor positioning, a system based on ultra‐wideband and optimized time difference of arrival (TDOA) is designed. The optimized algorithm of TDOA is adopted to solve the problem of synchronization between anchors and improve the positioning accuracy. The use of LoRa technology for wireless data transmission between anchors improves the flexibility of anchor layout. According to the test, the system can work stably in corridors, rooms, warehouses and other scenarios, and the positioning error is controlled at about 13 cm. The positioning accuracy is 10 times that of the positioning system using WiFi and Bluetooth technology, which can meet the requirements of accurate mobile positioning in complex indoor environment. © 2020 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc. [ABSTRACT FROM AUTHOR]

The presence of lateral lymph node (LLN) metastasis was associated with higher local recurrence risk in patients with lower rectal cancer. The role of LLN dissection has not been fully determined despite prolonged debate that last for few decades. The practical difference between Japan and the West was the main culprit. Japanese used to rely on surgical removal of LLN as local control while the West believed that LLN dissection could be spared after giving neoadjuvant chemoradiotherapy. As time passed, it is getting more common to combine both treatments. With the quality improvement in magnetic resonance imaging, we can now predict the chance of LLN metastasis and evaluate the treatment response with good accuracy. Few large analyses have been published recently and provided us more insight into this topic. In this review, we summarized and provided an update on the latest evidence. We have proposed a treatment algorithm on the management of LLNs which may help clinical decision and provide idea for further research. [ABSTRACT FROM AUTHOR]

Purpose: Adverse events (AEs) caused by polypharmacy have recently become a clinical problem, and it is important to monitor the safety profile of drug-drug interactions (DDIs). Mining signals using the spontaneous reporting systems is a very effective method for single drug-induced AE monitoring as well as early detection of DDIs. The objective of this study was to compare signal detection algorithms for DDIs based on frequency statistical models. Methods: Five frequency statistical models: the Ω shrinkage measure, additive (risk difference), multiplicative (risk ratio), combination risk ratio, and chi-square statistics models were compared using the Japanese Adverse Drug Event Report (JADER) database as the spontaneous reporting system in Japan. The drugs targeted for the survey are all registered and classified as "suspect drugs" in JADER, and the AEs targeted for this study were the same as those in a previous study on Stevens-Johnson syndrome (SJS). Results: Of 3924 pairs that reported SJS, the number of signals detected by the Ω shrinkage measure, additive, multiplicative, combination risk ratio, and chi-square statistics models was 712, 3298, 2252, 739, and 1289 pairs, respectively. Among the five models, the Ω shrinkage measure model showed the most conservative signal detection tendency. Conclusion: Specifically, caution should be exercised when the number of reports is low because results differ depending on the statistical models. This study will contribute to the selection of appropriate statistical models to detect signals of potential DDIs. [ABSTRACT FROM AUTHOR]

This study aimed to leverage computer vision (CV) technology to develop a technique for quantifying postural control. A conventional quantitative index, occupational therapists' qualitative clinical evaluations, and CV-based quantitative indices using an image analysis algorithm were applied to evaluate the postural control of 34 typically developed preschoolers. The effectiveness of the CV-based indices was investigated relative to current methods to explore the clinical applicability of the proposed method. The capacity of the CV-based indices to reflect therapists' qualitative evaluations was confirmed. Furthermore, compared to the conventional quantitative index, the CV-based indices provided more detailed quantitative information with lower costs. CV-based evaluations enable therapists to quantify details of motor performance that are currently observed qualitatively. The development of such precise quantification methods will improve the science and practice of occupational therapy and allow therapists to perform to their full potential. [ABSTRACT FROM AUTHOR]

Copyright of Advances in Atmospheric Sciences is the property of Springer Nature and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Acta Oto-Laryngologica is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Background: To date, there have been few conventional algorithms for the treatment of idiopathic sudden sensorineural hearing loss (SSNHL), as there have been only limited reports with high evidence levels. Objectives: To propose an evidence- and trend-based treatment algorithm for SSNHL. Methods: We referred not only to the evidence for each treatment, but also to trends related to treatment selection in Japan based on epidemiologic surveys, and considered the balance of the advantages and disadvantages with regard to each patient’s condition. Results: We propose an algorithm that begins with the grade of SSNHL severity as the prognosis of SSNHL is strongly related to the severity of hearing loss. We selected systemic corticosteroid therapy as the first-line therapy, and Intra-tympanic corticosteroid therapy as salvage therapy. We also proposed the use of prostaglandin E1 with corticosteroids for the treatment of SSNHL patients with severe hearing loss. According to the data obtained from an epidemiologic survey, we decided time limits for the application of each treatment. Conclusion: An algorithm for the treatment for SSNHL is presented according to the results of epidemiologic surveys in Japan. It is expected that this algorithm can provide a guide to choosing the suitable treatment for SSNHL patients. [ABSTRACT FROM AUTHOR]

Purpose: Large inter-individual differences in warfarin maintenance dose are mostly due to the effect of genetic polymorphisms in multiple genes, including vitamin K epoxide reductase complex 1 (VKORC1), cytochromes P450 2C9 (CYP2C9), and cytochrome P450 4F2 (CYP4F2). Thus, several algorithms for predicting the warfarin dose based on pharmacogenomics data with clinical characteristics have been proposed. Although these algorithms consider these genetic polymorphisms, the formulas have different coefficient values that are critical in this context. In this study, we assessed the mutual validity among these algorithms by specifically considering racial differences. Methods: Clinical data including actual warfarin dose (AWD) of 125 Japanese patients from our previous study (Eur J Clin Pharmacol 65(11):1097–1103, 2009) were used as registered data that provided patient characteristics, including age, sex, height, weight, and concomitant medications, as well as the genotypes of CYP2C9 and VKORC1. Genotyping for CYP4F2*3 was performed by the PCR method. Five algorithms that included these factors were selected from peer-reviewed articles. The selection covered four populations, Japanese, Chinese, Caucasian, and African-American, and the International Warfarin Pharmacogenetics Consortium (IWPC). Results: For each algorithm, we calculated individual warfarin doses for 125 subjects and statistically evaluated its performance. The algorithm from the IWPC had the statistically highest correlation with the AWD. Importantly, the calculated warfarin dose (CWD) using the algorithm from African-Americans was less correlated with the AWD as compared to those using the other algorithms. The integration of CYP4F2 data into the algorithm did not improve the prediction accuracy. Conclusion: The racial difference is a critical factor for warfarin dose predictions based on pharmacogenomics. [ABSTRACT FROM AUTHOR]

This article presents an optimization method of the parallelism extraction algorithm using spanning tree that automatically exploits the parallelism and determines an execution order of multiple kernel programs in a distributed environment. In stream‐based computing, efficient parallel execution requires careful scheduling of the invocation of the kernel programs. By mapping a kernel to a node and an I/O stream to an edge, the entire stream process can be treated as a spanning tree. The spanning tree, which allows feedback and feedforward edges, is effective for expressing dependencies that exist among kernels. In spanning tree, the nodes at the same depth do not have edges between them, and thus can be executed in parallel in the case parent nodes have been already executed. The series of the nodes can be executed in a pipelined manner. Thus, the proposed algorithm can extract both spatial and temporal parallelism. However, if the algorithm is applied for feedbacks as it is, because of waiting for the completion of the loop among the nodes, it causes the waste of time. To solve this problem, the parallel pattern can be optimized in the step of generating the communication pattern to increase the degree of parallelism. In addition, because of the difference in execution time among kernels, the load balancing can be considered for an optimization for the algorithm. To evaluate the effectiveness of the optimized algorithm, a k‐means application was developed and parallelized especially for the feedback processing. The results show that the parallel execution using two nodes of a graphics processing unit (GPU) cluster obtained 1.5 times speedup. With load balancing, the parallel execution using four nodes of the cluster obtained up to 3.5 times speedup in 2D‐FFT and 3.0 times speedup in LU decomposition, compared to the execution on a single GPU. © 2019 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc. [ABSTRACT FROM AUTHOR]

Abstract: Background: The PainFree Smart Shock Technology (SST) study showed a low implantable cardioverter‐defibrillator (ICD) inappropriate shock rate. However, the majority of patients were from Western countries with patient characteristics different from those in Japan. ICD shock rates using the novel SST algorithms in Japanese patients are still unknown. Methods: All 2,770 patients in the PainFree SST study (Japan [JPN]: N = 181, other geographies [OJPN]: N = 2,589) were included in this analysis. Results: Japanese patients had higher average left ventricular ejection fraction (P < 0.0001), higher prevalence of secondary prevention indications (P < 0.0001), nonischemic cardiomyopathy (P < 0.0001), and permanent atrial fibrillation (P < 0.0001). The appropriate shock rate at 12 months was not different between JPN and OJPN: 6.4% and 6.3%, respectively (P = 0.95). The inappropriate shock rate at 12 months was significantly higher in Japanese patients (2.9% vs 1.7%, P = 0.017). However, after propensity score matching to adjust for the difference in baseline characteristics, the difference in inappropriate shock rate was not statistically significant (P = 0.51). Conclusions: There was no difference in the appropriate shock rate between Japan and other geographies. The inappropriate shock rate in Japan was low, although it was slightly higher compared to other geographies due to baseline characteristics, including a higher prevalence of permanent AF. There was not a statistically significant difference after adjusting for baseline characteristics. [ABSTRACT FROM AUTHOR]

Schizophrenia is an etiologically and clinically heterogeneous disorder. Although neuroimaging studies have revealed brain alterations in schizophrenia, most studies have assumed that the disorder is a single entity, neglecting the diversity of alterations observed in the disorder. The current study sought to explore the distinct patterns of altered cortical thickness in patients with schizophrenia and healthy individuals using a data-driven approach. Unsupervised clustering using self-organizing maps followed by a K-means algorithm was applied to regional cortical thickness data in 108 schizophrenia patients and 121 healthy controls. After clustering, the clinical characteristics and cortical thickness patterns of each cluster were assessed. Unsupervised clustering revealed that a 6-cluster solution was the most appropriate in this sample. There was substantial overlap between the patterns of cortical thickness in schizophrenia patients and healthy controls, although the distributions of the patients and controls differed across the clusters. The patterns of altered cortical thickness in schizophrenia exhibited cluster-specific features; patients within a cluster exhibited the most extensive cortical thinning, particularly in the medial prefrontal and temporal regions, while those in other clusters exhibited reduced cortical thickness in the medial frontal region or temporal lobe. Furthermore, in the schizophrenia group, extensive cortical thinning was correlated with a higher dosage of antipsychotic medication, while preserved cortical thickness appeared to be linked to less negative symptoms. This data-driven neuroimaging approach revealed distinct patterns of cortical thinning in schizophrenia, possibly reflecting the etiological heterogeneity of the disorder. [ABSTRACT FROM AUTHOR]

The article focuses on a study which examines large-scale observational evidence of cross-cultural differences in facial behavior using advanced in computer science. Topics discussed include the automated facial coding used, the reliability of the facial action unit detection algorithms across different testing subsets, multilevel regression estimates predicting each facial action's base rate percentage.

What is known and objective Multicriteria decision analysis ( MCDA) has been generally considered a promising decision-making methodology for the assessment of drug benefit-risk profiles. There have been many discussions in both public and private sectors on its feasibility and applicability, but it has not been employed in official decision-makings. For the purpose of examining to what extent MCDA would reflect the first-hand, intuitive preference of evaluators in practical pharmaceutical assessments, we conducted a questionnaire survey involving the participation of employees of pharmaceutical companies. Methods Showing profiles of the efficacy and safety of four hypothetical drugs, each respondent was asked to rank them following the standard MCDA process and then to rank them intuitively (i.e. without applying any analytical framework). Results and discussion These two approaches resulted in substantially different ranking patterns from the same individuals, and the concordance rate was surprisingly low (17%). Although many respondents intuitively showed a preference for mild, balanced risk-benefit profiles over profiles with a conspicuous advantage in either risk or benefit, the ranking orders based on MCDA scores did not reflect the intuitive preference. What is new and conclusion Observed discrepancies between the rankings seemed to be primarily attributed to the structural characteristics of MCDA, which assumes that evaluation on each benefit and risk component should have monotonic impact on final scores. It would be difficult for MCDA to reflect commonly observed non-monotonic preferences for risk and benefit profiles. Possible drawbacks of MCDA should be further investigated prior to the real-world application of its benefit-risk assessment. [ABSTRACT FROM AUTHOR]

Background: It is unclear whether health related quality of life (HRQL) may have a predictive value for mortality in idiopathic pulmonary fibrosis (IPF). We investigated the relationship between HRQL assessed using the St. George's Respiratory Questionnaire (SGRQ) and survival time in patients with IPF, and tried to determine a clinical meaningful cut off value to predict poorer survival rates.Methods: We retrospectively analyzed consecutive patients with IPF who underwent an initial evaluation from May 2007 to December 2012. The diagnosis of IPF was made according to the 2011 international consensus guidelines. We used Cox proportional hazard models to identify independent predictors for mortality rate in patients with IPF.Results: We examined 182 eligible cases, average age was 66 years old, and 86% were male. Mean levels of percent predicted FVC, DLco, six-minute-walk test distance, and the SGRQ total score were around 80%, 58%, 580 m, and 34 points. On multivariate analysis, the SGRQ total score (hazard ratio [HR], 1.012; 95% confidence interval [CI] 1.001-1.023; P = .029) and percent predicted FVC (HR, 0.957; 95% CI 0.944-0.971, P < .001) were independent predictors for mortality rate. Moreover, a score higher than 30 points in the SGRQ total score showed higher mortality rate (HR, 2.047; 95% CI, 1.329-3.153; P = .001).Conclusions: The SGRQ total score was one of independent prognostic factors in patients with IPF. Total scores higher than 30 points were associated with higher mortality rates.Trial Registration: This study was retrospective, observational study, so it is not applicable. [ABSTRACT FROM AUTHOR]

Background: Rapid dissemination of information regarding adverse drug reactions is a key aspect for improving pharmacovigilance. There is a possibility that unknown adverse drug reactions will become apparent through post-marketing administration. Currently, although there have been studies evaluating the relationships between a drug and adverse drug reactions using the JADER database which collects reported spontaneous adverse drug reactions, an efficient approach to assess the association between adverse drug reactions of drugs with the same indications as well as the influence of demographics (e.g. gender) has not been proposed. Methods and Findings: We utilized the REAC and DEMO tables from the May 2015 version of JADER for patients taking antidepressant drugs (SSRI, SNRI, and NaSSA). We evaluated the associations using association analyses with an apriori algorithm. Support, confidence, lift, and conviction were used as indicators for associations. The highest score in adverse drug reactions for SSRI was obtained for "aspartate aminotransferase increased", "alanine aminotransferase increased", with values of 0.0059, 0.93, 135.5, and 13.9 for support, confidence, lift and conviction, respectively. For SNRI, "international normalized ratio increased", "drug interaction" were observed with 0.0064, 1.00, 71.9, and NA. For NaSSA, "anxiety", "irritability" were observed with 0.0058, 0.80, 49.9, and 4.9. For female taking SSRI, the highest support scores were observed in "twenties", "suicide attempt", whereas "thirties", "neuroleptic malignant syndrome" were observed for male. Second, for SNRI, "eighties", "inappropriate antidiuretic hormone secretion" were observed for female, whereas "interstitial lung disease" and "hepatitis fulminant" were for male. Finally, for NaSSA, "suicidal ideation" was for female, and "rhabdomyolysis" was for male. Conclusions: Different combinations of adverse drug reactions were noted between the antidepressants. In addition, the reported adverse drug reactions differed by gender. This approach using a large database for examining the associations can improve safety monitoring during the post-marketing phase. [ABSTRACT FROM AUTHOR]

Aims: Electrocardiographic diagnosis of wide QRS complex tachycardia (WCT) continues to be challenging as none one of the available methods is specific for ventricular tachycardia (VT) diagnosis. We aimed to construct a method for WCT differentiation based on a scoring system, in which ECGs are graded according to the number of VT-specific features. This novel method was validated and compared with Brugada algorithm and other methods.Methods and Results: A total of 786 WCTs (512 VTs) from 587 consecutive patients with a proven diagnosis were analysed by two blinded observers. The VT score method was based on seven ECG features: initial R wave in V1, initial r > 40 ms in V1/V2, notched S in V1, initial R in aVR, lead II R wave peak time ≥50 ms, no RS in V1-V6, and atrioventricular dissociation. Atrioventricular dissociation was assigned two points, and each of the other features was assigned one point. The overall accuracy of VT score ≥1 for VT diagnosis (83%) was higher than that of the aVR (72%, P = 0.001) and Brugada (81%) algorithms. Ventricular tachycardia score ≥3 was present in 66% of VTs and was more specific (99.6%) than any other algorithm/criterion for VT diagnosis. Ventricular tachycardia score ≥4 was present in 33% of VTs and was 100% specific for VT.Conclusion: The new ECG-based method provides a certain diagnosis of VT in the majority of patients with VT, identifies unequivocal ECGs, and has superior overall diagnostic accuracy to other ECG methods. [ABSTRACT FROM AUTHOR]

Surveillance and diagnostic algorithms for hepatocellular carcinoma (HCC) have already been described in guidelines published by the American Association for the Study of Liver Diseases (AASLD), the European Association for the Study of the Liver and the European Organisation for Research and Treatment of Cancer (EASL-EORTC), and the Japan Society of Hepatology (JSH), but the content of these algorithms differs slightly. The JSH algorithm mainly differs from the other two algorithms in that it is highly sophisticated and considers the functional imaging techniques of gadolinium ethoxybenzyl diethylenetriamine pentaacetic acid-enhanced MRI (EOB-MRI) and Sonazoid contrast-enhanced ultrasound (CEUS) to be very important diagnostic modalities. In contrast, the AASLD and EASL-EORTC algorithms are less advanced and suggest that a diagnosis be made based solely on hemodynamic findings using dynamic CT/MRI and biopsy findings. A consensus meeting regarding the JSH surveillance and diagnostic algorithm was held at the 50th Liver Cancer Study Group of Japan Congress, and a 2014 update of the algorithm was completed. The new algorithm reaffirms the very important role of EOB-MRI and Sonazoid CEUS in the surveillance and diagnosis of liver cancer and is more sophisticated than those currently used in the United States and Europe. This is now an optimized algorithm that can be used to diagnose early-stage to classical HCC easily and highly accurately. © 2014 S. Karger AG, Basel [ABSTRACT FROM AUTHOR]