Search

In this paper, to handle the problem of the quick evolution of cyber-security attacks, we developed the iMonsters board game and proposed the attack and defense knowledge self-evolving algorithm. Three versions of the iMonsters were launched in 2013, 2017, and 2019, respectively. Accordingly, the cyber-security ontology can be refined by the ontology fusion-or-splitting procedure for the newly collected cyber-security incidents, as well as the roles and rules of the iMonsters can be refined by the gaming portfolio mining procedure for the collected portfolio. Furthermore, we conducted game-based learning (GBL), a quasi-experiment of pre/post-testing, and concept map testing using the iMonsters board game in a children's summer camp. The experimental results indicate that the students can acquire up-to-date cyber-security knowledge with the iMonsters better than students who learn in a traditional classroom setting, and the students' satisfaction with acquiring cyber-security knowledge with the instructional design of the iMonsters is better compared with learning in a traditional classroom setting. Satisfaction with the new version has continuously increased. Besides, the results of the in-depth interviews show that the new version was easier to learn. Thus, we may conclude that using the self-evolving iMonsters can improve learning effectiveness and participation in GBL.

The development of visual tools for the timely identification of spatio-temporal clusters will assist in implementing control measures to prevent further damage. From January 2015 to June 2020, a total number of 1463 avian influenza outbreak farms were detected in Taiwan and further confirmed to be affected by highly pathogenic avian influenza subtype H5Nx. In this study, we adopted two common concepts of spatio-temporal clustering methods, the Knox test and scan statistics, with visual tools to explore the dynamic changes of clustering patterns. Since most (68.6%) of the outbreak farms were detected in 2015, only the data from 2015 was used in this study. The first two-stage algorithm performs the Knox test, which established a threshold of 7 days and identified 11 major clusters in the six counties of southwestern Taiwan, followed by the standard deviational ellipse (SDE) method implemented on each cluster to reveal the transmission direction. The second algorithm applies scan likelihood ratio statistics followed by AGC index to visualize the dynamic changes of the local aggregation pattern of disease clusters at the regional level. Compared to the one-stage aggregation approach, Knox-based and AGC mapping were more sensitive in small-scale spatio-temporal clustering., (© 2021. The Author(s).)

Due to the increasing cost of health insurance, for decades, many countries have endeavored to constrain the cost of insurance by utilizing a DRG payment system. In most cases, under the DRG payment system, hospitals cannot exactly know which DRG code inpatients are until they are discharged. This paper focuses on the prediction of what DRG code appendectomy patients will be classified with when they are admitted to hospital. We utilize two models (or classifiers) constructed using the C4.5 algorithm and back-propagation neural network (BPN). We conducted experiments with the data collected from two hospitals. The results show that the accuracies of these two classification models can be up to 97.84% and 98.70%, respectively. According to the predicted DRG code, hospitals can effectively arrange medical resources with certainty, then, in turn, improve the quality of the medical care patients receive. [ABSTRACT FROM AUTHOR]

The ship tracking and mapping capabilities that geospatial technology provides create an opportunity to observe fishing vessels as they move through established maritime boundaries. This paper connects data availability to ground-truthing research and explores the limits of vessel movement mapping in representing worker abuse at sea through three related themes. First, a conceptual background links the advancements in maritime remote sensing to critical GIS scholarship and provides a background on worker abuse aboard Taiwanese fishing vessels. Second, the paper examines the potential of machine learning algorithms to represent worker abuse at sea, arguing that more extensive ground-truthing research with workers could help address variations in the data and limited data sets. Third, I use remote sensing data to identify and unpack Taiwanese fishing across the three EEZs with the most concentrated Taiwanese fishing activity: starting with Taiwan, followed by the Falkland Islands, and Seychelles. I argue that fishing activity and the digital representation of vessel movements are governed by terrestrial geopolitics and subject to manipulation by ship captains. Finally, the conclusion offers recommendations for how future research can capitalize on the capabilities of AIS, particularly with respect to addressing problems of working conditions and abuse at sea. [ABSTRACT FROM AUTHOR]

This study uses MODIS observed phytoplankton absorption coefficient (aph) as a preferable index of pigmentation to characterize phytoplankton variability in optically complex waters. We chose a quasi-analytical bio-optical inversion algorithm (QAA) to derive aph from remote sensing reflectance (Rrs, both in situ and MODIS measured) and then evaluated the Rrs derived aph by comparing them with match-up in situ measured aph collected in both oceanic and very nearshore waters in the Taiwan Strait (TWS). For the data with matching spatial and temporal window, it is found that the average percentage error (ϵ) between MODIS Rrs derived aph at 443nm (aph(443), ab10 breviated as Aph) and field measured Aph is 33.8% (N=30, Aph ranges from 0.012- 0.537m-1), with a root mean square error in log scale (RMSE) of 0.226. By comparison, ϵis 28.0% (N=88, RMSE=0.150) between ship-borne Rrs derived Aph and field measured Aph. Values of ϵ as large as 135.6% (N=30, RMSE=0.383) are found between MODIS Rrs derived chlorophyll-a (chl-a, OC3M algorithm) and field measured chl-a. Based on these evaluation results, we applied QAA to MODIS Rrs data between 2003-2009 to derive climatological monthly mean Aph for the TWS. Three distinct features of phytoplankton dynamics are identified. First, Aph is low and the least variable in the Penghu Channel, where the South China Sea water enters the TWS. This region maintains slightly higher values in winter (∼17% higher than that in the other seasons)due to surface nutrient entrainment under winter wind-driven vertical mixing. Second, Aph is high and the most variable in the mainland nearshore water, with values peaking in summer (June-August) when river plumes and coastal upwelling enhance surface nutrient loads. Interannual variation of bloom intensity in Hanjiang River estuary in June is highly correlated with alongshore wind stress anomalies, as observed by QuikSCAT. The year of minimum and maximum bloom intensity is in the midst of an El Nino and a La Nina event, respectively. Third, a high Aph patch appears between April and September in the middle of the Southern TWS, corresponding to high thermal frontal probabilities, as observed by MODIS. Our results support the use of satellite observed Aph for time series analyses of phytoplankton dynamics in coastal ocean regions, where satellite chl-a retrievals can suffer from artifacts associated with non-biotic optically active materials. [ABSTRACT FROM AUTHOR]

In this paper, a new clustering algorithm based on gravitational search algorithm (CGSA) for solving unit commitment (UC) problem is proposed. The UC problem is a combinatorial optimization problem that minimizing quadratic objective function under system and unit constraints. The GSA is a recent introduced algorithm to solve optimization problem that inspired by Newtonian law of gravity. A novel version of GSA, named Clustered-GSA (CGSA) is a flexible and well-balanced mechanism for enhancing exploration and exploitation abilities. The proposed algorithm is tested for standard 100 unit system, IEEE 118 bus system and practical Taiwan 38 bus power system. The effectiveness of proposed algorithm results are compared to those reported in the literature. [ABSTRACT FROM AUTHOR]

In the transportation industry, crew management is typically decomposed into two phases: crew scheduling and crew rostering. Due to the complexity of scheduling and rostering, bus transportation is not an exception and many relevant studies do not consider both procedures simultaneously. However, such a decomposition can yield inferior schedules/rosters. To address this issue, this paper proposes an integrated scheduling and rostering model for bus drivers and devises a branch-and-price-and-cut (BPC) algorithm to solve the complex problem. The proposed solution framework is empirically applied to real-world instances with various problem sizes whose data is collected from H Bus Company located in southern Taiwan. To validate the effectiveness and evaluate the efficiency of the proposed solution framework, this paper compares the solution obtained from the BPC algorithm with that of a benchmark optimization package. The results show that the proposed BPC algorithm can solve problems with large real-world instances within a reasonable computational time. Moreover, in the numerical experiments, this paper finds that the scheduling and rostering results of the bus drivers are more sensitive to the rostering constraints. Also, the proposed integrated framework can yield a better solution than the solution from a conventional two-phase approach, which demonstrates the advantage of the integration in this paper. The proposed method provided can be employed to deal with the challenges in driver planning for bus companies. [ABSTRACT FROM AUTHOR]

In this paper, we study the forest harvesting problem (FHP). A forest is assumed to be divided into several identical square units, and each unit has its harvesting value based on its type. Harvesting a unit will affect the growth and values of its neighboring units. In this FHP, the best harvesting plan of a unit must be identified to maximize three various objectives simultaneously. The FHP is a multiobjective mathematical and an NP-hard problem. We apply three artificial intelligence algorithms, namely, immune algorithm, genetic algorithm, and particle swarm optimization, for maximizing the weighted objective to solve the FHP. We also solve the following two sets of test problems: (i) a set of randomly generated FHP problems and (ii) a practical problem in Taiwan. Numerical results show the performance of the three algorithms for the test problems. Finally, we compare and discuss the effects of various weights for the three objectives. [ABSTRACT FROM AUTHOR]

In the paper, we proposed a coarse-to-fine scheme to automatically detect the regions of interest (ROIs) for digitized cadastral images in Taiwan. To consider some issues such as the skew effect, image quality, and noise in digitized cadastral images, the proposed scheme is composed of four parts: pre-processing, skew correction, noise reduction, and ROI localization. In the pre-processing, each cadastral image is normalized and the prior knowledge is used to find the candidate region of the ROI. To reduce the impact of noise and poor contrast on line detection, an adaptive thresholding is adopted. To decrease the skew effect, the detected horizontal and vertical lines are analyzed to estimate the skew angle. After skew correction, an adaptive noise reduction algorithm is devised to reduce the effect of marginal, artificial, and random noise. The coordinates of the candidate region in the de-skew image with high resolution can be found and then the ROI boundary can be located correctly in the fine detection. Experimental results demonstrate that the proposed scheme can effectively and correctly localize ROIs in digitized cadastral images. [ABSTRACT FROM AUTHOR]

Purpose: The uncertainty in supply and the short shelf life of blood products have led to a substantial outdating of the collected donor blood. On the other hand, hospitals and blood centers experience severe blood shortage due to the very limited donor population. Therefore, the necessity to forecast the blood supply to minimize outdating as well as shortage is obvious. This study aims to efficiently forecast the supply of blood components at blood centers., Methods: Two different types of forecasting techniques, time series and machine learning algorithms, are developed and the best performing method for the given case study is determined. Under the time series, we consider the Autoregressive (AUTOREG), Autoregressive Moving Average (ARMA), Autoregressive Integrated Moving Average (ARIMA), Seasonal ARIMA, Seasonal Exponential Smoothing Method (ESM), and Holt-Winters models. Artificial neural network (ANN) and multiple regression are considered under the machine learning algorithms., Results: We leverage five years worth of historical blood supply data from the Taiwan Blood Services Foundation (TBSF) to conduct our study. On comparing the different techniques, we found that time series forecasting methods yield better results than machine learning algorithms. More specifically, the least value of the error measures is observed in seasonal ESM and ARIMA models., Conclusions: The models developed can act as a decision support system to administrators and pathologists at blood banks, blood donation centers, and hospitals to determine their inventory policy based on the estimated future blood supply. The forecasting models developed in this study can help healthcare managers to manage blood inventory control more efficiently, thus reducing blood shortage and blood wastage., Competing Interests: The authors declare that there are no conflicts of interest regarding the publication of this paper., (Copyright © 2019 Han Shih and Suchithra Rajendran.)

Mt. Jade (or "Yushan" in Chinese) is the highest peak in northeast Asia. The topography is very rugged and complicated. Such terrain makes it difficult to obtain the correct results for terrain corrections (TCs). This paper developed an improved approach, named cone-section method, to compute the TCs of the Mt. Jade area using a high-resolution digital elevation model (DEM) on a 9" × 9" grid. The corrections were calculated to the distance of 100 km with an average rock density of 2.57 × 10³ kg·m-3. This investigation compared the results of TCs from the cone-section method with those from the cylinder prism and Gaussian quadrature methods using a 9" × 9" elevation grid for the inner zone and a 90" × 90" elevation grid for the outer zone. The inner and outer radii were set to 20 and 200 km, respectively. The comparisons showed that the cone-section algorithm is consistent with the Gaussian quadrature. Furthermore, the cone-section method is an appropriate approach for TCs in high elevation areas, yielding results that outperform the cylinder prism method. [ABSTRACT FROM AUTHOR]

To enhance the cost effectiveness of the distribution automation system (DAS), this paper proposes the immune algorithm (IA) to derive the optimal placement of switching devices by minimizing the total cost of customer service outage and investment cost of line switches. The reliability index of each service zone defined by the boundary switches is derived to solve the expected energy not served due to fault contingency, and the customer interruption cost is then determined according to the customer type and power consumption within the service zone. To demonstrate the effectiveness of proposed IA methodology to solve the optimal placement of line switches, a practical distribution system of Taiwan Power Company (Taipower) is selected for computer simulation to explore the cost benefit of line switch placement for DAS. [ABSTRACT FROM AUTHOR]

This paper presents a hardware authentication BLAKE algorithm based on physical unclonable functions (PUFs) in Taiwan Semiconductor Manufacturing Company low-power 65 nm CMOS. To support hardware authentication feature, PUFs have been organised in BLAKE algorithm as the salt value. The trials table method is used to improve the robust of PUFs, resulting in approximately 100% stability against supply voltage variations form 0.7 V to 1.6 V. By discussing the G-function of BLAKE algorithm, the hardware implementation is considered for acceleration, resulting in significant performance improvements. The die occupies 2.62 mm2and operates maximum frequency 1.0 GHz at 1.6 V. Measured results show that PUFs have great random characteristic and the authentication chip dissipates an average power of 91 mW under typical condition at 1.2 V and 780 MHz. In comparison with other works, the PUFs-based BLAKE algorithm has hardware authentication feature and improves throughput about 45%. [ABSTRACT FROM AUTHOR]

Bridge structures deteriorate due to various factors, and their maintenance can be made more efficient by utilizing relevant information. This paper describes an algorithm called Self-Organizing Map-based Cluster Merging (SOMCM) using a multi-dimensional matrix composite neural network, and a surface image identification system. The algorithm is designed to investigate the relevance between the main components of bridges and their types of deterioration. 6140 records on bridge maintenance were collected for all bridges in the Taoyuan region of Taiwan in 2021. The SOMCM algorithm involves finding the winner neuron through merging processes. 61 clusters were merged into 8 clusters after a predetermined number of iterations. Clustering analysis of the final 8 clusters revealed 9 major bridge maintenance association rules. Follow-up studies can apply the algorithm to integrate more technologies including GIS coordinates, material availability, real-time traffic conditions, and weather information to be of benefit to engineering practitioners. • The study is to develop a new algorithm, SOM-based Cluster Merging (SOMCM). • The paper is to investigate the relevance for bridge main components and their deterioration types. • The initial result involves 61 clusters being merged to 8 clusters with the predetermined iterations. • The clustering analysis for the final 8 clusters shows 9 major bridge maintenance association rules. [ABSTRACT FROM AUTHOR]

Objective. The Fugl-Meyer assessment for upper extremity (FMA-UE) is a measure for assessing upper extremity motor function in patients with stroke. However, the considerable administration time of the assessment decreases its feasibility. This study aimed to develop an accumulative assessment system of upper extremity motor function (AAS-UE) based on the FMA-UE to improve administrative efficiency while retaining sufficient psychometric properties. Methods. The study used secondary data from 3 previous studies having FMA-UE datasets, including 2 follow-up studies for subacute stroke individuals and 1 test-retest study for individuals with chronic stroke. The AAS-UE adopted deep learning algorithms to use patients' prior information (ie, the FMA-UE scores in previous assessments, time interval of adjacent assessments, and chronicity of stroke) to select a short and personalized item set for the following assessment items and reproduce their FMA-UE scores. Results. Our data included a total of 682 patients after stroke. The AAS-UE administered 10 different items for each patient. The AAS-UE demonstrated good concurrent validity (r =0.97-0.99 with the FMA-UE), high test-retest reliability (intra-class correlation coefficient=0.96), low random measurement error (percentage of minimal detectable change=15.6%), good group-level responsiveness (standardized response mean=0.65-1.07), and good individual-level responsiveness (30.5%-53.2% of patients showed significant improvement). These psychometric properties were comparable to those of the FMA-UE. Conclusion. The AAS-UE uses an innovative assessment method, which makes good use of patients' prior information to achieve administrative efficiency with good psychometric properties. Impact. This study demonstrates a new assessment method to improve administrative efficiency while retaining psychometric properties, especially individual-level responsiveness and random measurement error, by making good use of patients' basic information and medical records. [ABSTRACT FROM AUTHOR]

This paper presents a real-time lane detection algorithm and a fuzzy-based vehicle detection approach for autonomous vehicles. The fast adaptive lane detection algorithm is efficient and robust during the day and at night. Modified global lane models are proposed to increase the accuracy of the detection. Moreover, an automatic adjustment method is presented to adapt to the changes of lane width and the inclination of roads in different situations. The developed fuzzy-based vehicle detection method, contour size similarity (CSS), compares the projective sizes of vehicles with the estimated ones by fuzzy logic. Vehicle detection aims to detect the closest vehicle preceding the autonomous car in the same lane. Results of the experiments demonstrate that the proposed approach is effective in distance estimation and both lane and vehicle detection. Furthermore, the approach rapidly adjusts to changes of detection target when another car cuts in the lane of the autonomous vehicle. The obtained information supports the automatic driving of autonomous vehicles. This integrated algorithm of lane and vehicle detection was verified on the autonomous car, TAIWAN iTS-1, on express highways and in urban environments at velocities of 110 and 50 km/h, respectively. [ABSTRACT FROM AUTHOR]

This paper summarizes international experience of significant clustered photovoltaic systems. Based on the operation experience, major system impacts and corresponding solutions have been studied. Among them, voltage raise of power distribution line due to the reverse power flow from the PV system has been one of the main problems. Therefore, this paper proposes the dynamic and steady-state simulations to evaluate the effectiveness of battery-integrated PV system on avoiding the over voltage problem. Furthermore, different types of battery control modes have been compared. In the simulations, the actual product specifications were adopted as the parameters of the component models, and the largest PV cluster system in Taiwan was chosen as the analyzed demonstration site. The simulation results reveal that the developed control algorithms could avoid voltage rise by setting appropriate control parameter values. In addition, these control algorithms could be applicable to other power grids if appropriate settings are made. [ABSTRACT FROM AUTHOR]

In this paper, an expert system is designed to derive the rephasing strategy of laterals and distribution transformers to enhance three-phase balancing of distribution systems. The heuristic rules adopted by distribution engineers are incorporated in the knowledge base of the expert system in the problem-solving process. The neutral current reduction algorithm is developed to support the inference engine to derive the rephasing strategy to reduce the neutral current of distribution feeder so that the tripping of over-current relay can be prevented and the customer service interruption cost and labor cost to execute the rephasing strategy can be justified by the power loss reduction obtained. To demonstrate the effectiveness of the proposed expert system to enhance three-phase balance, a practical distribution feeder in Taiwan Power Company (Taipower) is selected for computer simulation. By minimizing the objective function subjected to the rephasing rules, the rephasing strategy has been derived to identify the laterals and distribution transformers for phasing adjustment. After executing the proposed rephasing strategy by Taipower engineers, the phase currents and neutral current of test feeder has been collected by the SCADA system to verify the reduction of neutral current. The power loss reduction obtained by three-phase balancing has been solved by three-phase load flow analysis, which is then used to justify the customer service interruption cost and labor cost for rephasing of test feeder. [ABSTRACT FROM AUTHOR]

Dental radiography plays an important role in clinical diagnosis, treatment and surgery. In recent years, efforts have been made on developing computerized dental X-ray image analysis systems for clinical usages. A novel framework for objective evaluation of automatic dental radiography analysis algorithms has been established under the auspices of the IEEE International Symposium on Biomedical Imaging 2015 Bitewing Radiography Caries Detection Challenge and Cephalometric X-ray Image Analysis Challenge. In this article, we present the datasets, methods and results of the challenge and lay down the principles for future uses of this benchmark. The main contributions of the challenge include the creation of the dental anatomy data repository of bitewing radiographs, the creation of the anatomical abnormality classification data repository of cephalometric radiographs, and the definition of objective quantitative evaluation for comparison and ranking of the algorithms. With this benchmark, seven automatic methods for analysing cephalometric X-ray image and two automatic methods for detecting bitewing radiography caries have been compared, and detailed quantitative evaluation results are presented in this paper. Based on the quantitative evaluation results, we believe automatic dental radiography analysis is still a challenging and unsolved problem. The datasets and the evaluation software will be made available to the research community, further encouraging future developments in this field. (http://www-o.ntust.edu.tw/~cweiwang/ISBI2015/)., (Copyright © 2016 The Authors. Published by Elsevier B.V. All rights reserved.)

The local magnitude scale ML is defined by the difference between the observed amplitude (log A ) and the anchored attenuation amplitude (log A 0 ). A previous study in Taiwan established a model of the anchored amplitude as a function of the hypocentral distance R by matching the ML to the corresponding moment magnitude MW. Although the overall performance of the model is adequate, there remain some drawbacks, namely, the correlated empirical station correction problem and relatively low sample size. In this paper, we adopt the concept of the expectation-maximization (EM) algorithm to develop a new method that can simultaneously estimate the anchored amplitude model coefficients and station corrections. The revised catalog using the latest dataset in Taiwan provides an up-to-date accurate estimate of ML. Additionally, the proposed method can systematically obtain statistically meaningful results and be applied to datasets of other regions in the future. [ABSTRACT FROM AUTHOR]

Recently, the use of social media for health information exchange is expanding among patients, physicians, and other health care professionals. In medical areas, social media allows non-experts to access, interpret, and generate medical information for their own care and the care of others. Researchers paid much attention on social media in medical educations, patient-pharmacist communications, adverse drug reactions detection, impacts of social media on medicine and healthcare, and so on. However, relatively few papers discuss how to extract useful knowledge from a huge amount of textual comments in social media effectively. Therefore, this study aims to propose a Fuzzy adaptive resonance theory network based Information Retrieval (FIR) scheme by combining Fuzzy adaptive resonance theory (ART) network, Latent Semantic Indexing (LSI), and association rules (AR) discovery to extract knowledge from social media. In our FIR scheme, Fuzzy ART network firstly has been employed to segment comments. Next, for each customer segment, we use LSI technique to retrieve important keywords. Then, in order to make the extracted keywords understandable, association rules mining is presented to organize these extracted keywords to build metadata. These extracted useful voices of customers will be transformed into design needs by using Quality Function Deployment (QFD) for further decision making. Unlike conventional information retrieval techniques which acquire too many keywords to get key points, our FIR scheme can extract understandable metadata from social media. [ABSTRACT FROM AUTHOR]

Over the past century, conscientiousness has become seen as the preeminent trait for predicting performance. This consensus is due in part to these employees' ability to work with traditional 20th-century technology. Such pairings balance the systematic nature of conscientious employees with the technology's need for user input and direction to perform tasks--resulting in a complementary match. However, the 21st century has seen the incorporation of intelligent machines (e.g., artificial intelligence, robots, and algorithms) into employees' jobs. Unlike traditional technology, these new machines are equipped with the capability to make decisions autonomously. Thus, their nature overlaps with the orderliness subdimension of conscientious employees--resulting in a non-complementary mismatch. This calls into question whether the consensus about conscientious employees' effectiveness with 20th-century technology applies to 21st-century jobs. Integrating complementarity and role theory, we refine this consensus. Across three studies using distinct samples (an experience sampling study, a field experiment, and an online experiment from working adults in Malaysia, Taiwan, and the United States), each focused on a different type of intelligent machine, we show not only that using intelligent machines has benefits and consequences, but, importantly, that conscientious (i.e., orderly) employees are less likely to benefit from working with them. [ABSTRACT FROM AUTHOR]

A discernible correlation emerged between global bridge disasters and bridge deterioration in recent years. To assist bridge inspectors in conducting deterioration identification, this paper presents a Pilgrimage Walk Optimization (PWO) algorithm inspired by Taiwan's unique Matsu bobee custom. The search behavior of the PWO algorithm simulates the gathering of devotees following Matsu's palanquin and their collective movements based on folk belief activities, including divination block casting, pilgrimage, the leisure ceremony, crawling beneath the palanquin, palanquin robbing, and the return palanquin ceremony. Analysis results show that the PWO outperformed contemporary metaheuristic algorithms on various multidimensional benchmark functions and was effectively applied to image segmentation for multiple types of bridge deterioration collected by an unmanned aerial vehicle. In the increasing number of engineering problems requiring edge computing to process big data, the proposed PWO algorithm is a low-cost and robust method with fault tolerance. • Presenting the innovative Pilgrimage Walk Optimization (PWO) algorithm, a revolutionary metaheuristic approach. • The new algorithm is tested on benchmark functions and applied to optimize image segmentation. • PWO algorithm outperforms contemporary metaheuristic algorithms in terms of achieving optimal solutions. • Exploring diverse bridge deterioration patterns auto-segmented using metaheuristic clustering algorithms. • PWO algorithm holds potential applications in AIoT technology and automation within the construction industry. [ABSTRACT FROM AUTHOR]

Background: Aging leads to changes in the body system, such as sarcopenia. This can result in several health issues, particularly physical and mobility dysfunction. Asian people typically have little awareness of sarcopenia. Thus, this study incorporated nursing instruction into the mobile application design to allow users to easily learn about sarcopenia. Objective: This study evaluated a model for predicting high-risk populations for sarcopenia in home settings. We further developed a sarcopenia nursing guidance mobile application and assessed the effectiveness of this application in influencing sarcopenia-related knowledge and self-care awareness among participants. Methods: Using a one-group pretest–posttest design, data were collected from 120 participants at a teaching hospital in northern Taiwan. This study used an artificial intelligence algorithm to evaluate a model for predicting high-risk populations for sarcopenia. We developed and assessed the sarcopenia nursing guidance mobile application using a questionnaire based on the Mobile Application Rating Scale. Results: The application developed in this study enhanced participants' sarcopenia-related knowledge and awareness regarding self-care. After the three-month intervention, the knowledge and awareness was effectively increase, total score was from 4.15 ± 2.35 to 6.65 ± 0.85 and were significant for all questionnaire items (p values < 0.05). On average, 96.1% of the participants were satisfied with the mobile app. The artificial intelligence algorithm positively evaluated the home-use model for predicting high-risk sarcopenia groups. Conclusions: The mobile application of the sarcopenia nursing guidance for public use in home settings may help alleviate sarcopenia symptoms and reduce complications by enhancing individuals' self-care awareness and ability. Trial registration: NCT05363033, registered on 02/05/2022. [ABSTRACT FROM AUTHOR]

In recent years, the issue of environmental protection has received considerable attention. This paper adds to the literature by investigating a scheduling problem in the manufacturing of a glass recycling factory in Taiwan. The objective is to minimize the sum of the total holding cost and loss cost. We first represent the problem as an integer programming (IP) model, and then develop two heuristics based on the IP model to find near-optimal solutions for the problem. To validate the proposed heuristics, comparisons between optimal solutions from the IP model and solutions from the current method are conducted. The comparisons involve two problem sizes, small and large, where the small problems range from 15 to 45 jobs, and the large problems from 50 to 100 jobs. Finally, a genetic algorithm is applied to evaluate the proposed heuristics. Computational experiments show that the proposed heuristics can find good solutions in a reasonable time for the considered problem., (Copyright © 2011 Elsevier Ltd. All rights reserved.)

Since the year 1973, more than 54,000 M ≥ 3.0 earthquakes have occurred around Taiwan, and their magnitude-frequency relationship was found following with the Gutenberg-Richter recurrence law with b value equal to 0.923 from the least-square calculation. However, using this b value with the McGuire-Arabasz algorithm results in some disagreement between observations and expectations in magnitude probability. This study introduces a simple approach to optimize the b value for better modeling of the magnitude probability, and its effectiveness is demonstrated in this paper. The result shows that the optimal b value can better model the observed magnitude distribution, compared with two customary methods. For example, given magnitude threshold = 5.0 and maximum magnitude = 8.0, the optimal b value of 0.835 is better than 0.923 from the least-square calculation and 0.913 from maximum likelihood estimation for simulating the earthquake's magnitude probability distribution around Taiwan. [ABSTRACT FROM AUTHOR]

In this paper, we present a new method to predict the Taiwan Stock Exchange Capitalization Weighted Stock Index (TAIEX) based on fuzzy-trend logical relationship groups (FTLRGs). The proposed method divides fuzzy logical relationships into FTLRGs based on the trend of adjacent fuzzy sets appearing in the antecedents of fuzzy logical relationships. First, we apply an automatic clustering algorithm to cluster the historical data into intervals of different lengths. Then, we define fuzzy sets based on these intervals of different lengths. Then, the historical data are fuzzified into fuzzy sets to derive fuzzy logical relationships. Then, we divide the fuzzy logical relationships into FTLRGs for forecasting the TAIEX. Moreover, we also apply the proposed method to forecast the enrollments and the inventory demand, respectively. The experimental results show that the proposed method gets higher average forecasting accuracy rates than the existing methods.

For common biomedical imaging facilities, such as CT, MRI, and confocal microscopy, the acquired scans are sequential parallel sections. The object of interest in each section image can be extracted by segmentation procedure to form serial parallel planar contours. How to reconstruct a trustworthy surface from these contours is a crucial issue in biomedical 3D visualization. In this paper, we propose an automatic, fast, and reliable surface reconstruction system. An improved correspondence-determining algorithm is proposed in the system to provide more reasonable contour-correspondences than the existing algorithms. It can handle more general input data, and does not produce wrong reconstruction results. A hybrid tiling algorithm is presented to tile the corresponding contours without the requirement of a contour-matching procedure. It can also handle the branching problem without any modification. For degenerate cases and branches, intermediate contours are introduced by means of contour interpolation to enhance the reconstruction results. The surface area and volume are also calculated to facilitate the practical applications.

This paper illustrates a sustained conceptual service quality improvement process for the management of software development within a healthcare enterprise. Our proposed process is revised from Niland's healthcare quality information system (HQIS). This process includes functions to survey the satisfaction of system functions, describe the operation bylaws on-line, and provide on-demand training. To achieve these goals, we integrate five information systems in National Taiwan University Hospital, including healthcare information systems, health quality information system, requirement management system, executive information system, and digital learning system, to form a full Deming cycle. A preliminary user satisfaction survey showed that our outpatient information system scored an average of 71.31 in 2006.

In this paper, we design a data transformer to transform Comma Separated Value (CSV) format into Health Level Seven (HL7) messages without losing syntax and semantics. The algorithm of the data transformer is similar to a generic parser for solving scheme-level mapping problems. It can be extended to transform non-uniform formats for exchanges among different hospital information systems. To show the flexibility and scalability of the algorithm, we use it for the transformation of reported data in the Vaccination Reporting System (VRS). Through the data transformer, different formats of vaccination data can be reported directly to the Taiwan's Center for Disease Control.

A conventional FCM algorithm does not fully utilize the spatial information in the image. In this paper, we present a fuzzy c-means (FCM) algorithm that incorporates spatial information into the membership function for clustering. The spatial function is the summation of the membership function in the neighborhood of each pixel under consideration. The advantages of the new method are the following: (1) it yields regions more homogeneous than those of other methods, (2) it reduces the spurious blobs, (3) it removes noisy spots, and (4) it is less sensitive to noise than other techniques. This technique is a powerful method for noisy image segmentation and works for both single and multiple-feature data with spatial information.

This paper proposes a novel approach to the generation of Chinese sentences from ill-formed Taiwanese Sign Language (TSL) for people with hearing impairments. First, a sign icon-based virtual keyboard is constructed to provide a visualized interface to retrieve sign icons from a sign database. A proposed language model (LM), based on a predictive sentence template (PST) tree, integrates a statistical variable n-gram LM and linguistic constraints to deal with the translation problem from ill-formed sign sequences to grammatical written sentences. The PST tree trained by a corpus collected from the deaf schools was used to model the correspondence between signed and written Chinese. In addition, a set of phrase formation rules, based on trigger pair category, was derived for sentence pattern expansion. These approaches improved the efficiency of text generation and the accuracy of word prediction and, therefore, improved the input rate. For the assessment of practical communication aids, a reading-comprehension training program with ten profoundly deaf students was undertaken in a deaf school in Tainan, Taiwan. Evaluation results show that the literacy aptitude test and subjective satisfactory level are significantly improved.

Purpose – The purpose of this paper is to establish customers' markets and rules of dynamic customer relationship management (CRM) systems for online retailers. Design/methodology/approach – This research proposes a procedure to discover customers' markets and rules, which adopts the recency, frequency, monetary value (RFM) variables, transaction records, and socioeconomic data of the online shoppers to be the research variables. The research methods aim at the supervised apriori algorithm, C5.0 decision tree algorithm, and RFM model. Findings – This research discovered eight RFM markets and six rules of online retailers. Practical implications – The proposed framework and research results can help retailer managers to retain and expand high value markets via their dynamic CRM and POS systems. Originality/value – This research uses data mining technologies to extract high value markets and rules for marketing plans. The research variables are easy to obtain via retailers' systems. The found customer values, RFM markets, shopping association rules, and marketing decision rules can be discovered via the framework of this research. [ABSTRACT FROM AUTHOR]

This paper employed two classical, popular decision-tree algorithms (C5.0 and CART), and traditional Regression to deal with reservoir operations regarding decision of the releases from a reservoir system during floods. The experiment site was in Shihmen Reservoir, located in northern Taiwan. In a typical single-peak typhoon, the rules derived include two operational stages, the stage before peakflow (Stage I) and the stage after peakflow (Stage II). This study collected 50 typhoons (1987-2009). Four cases are designed, that are discretized class labels (target fields) are run by C5.0 and CART (i.e., Cases 1 and 2, respectively), while numeric class labels are run by CART and Regression (i.e., Cases 3 and 4, respectively). The criteria of root mean square error (RMSE), coefficient of efficiency (CE), and relative error of peak discharge (EQ) were used to evaluate the forecasts. Results showed that the decision trees are skillful in the prediction of reservoir releases in the studied site. Furthermore, it was found that CART regression trees with numeric targets are more appropriate and precise than C5.0 classification trees and Regression for the prediction of releases. [ABSTRACT FROM AUTHOR]

The article discusses a study which examined the shortcoming of using ordinary digital measures in electronic medical record (EMR), along with the proposed use of forward secure digital measure in signing EMR. Topics covered include the reasons for the revocation of healthcare certificate, the use of digital signature for the authentication and non-repudiation and the advantage of forward digital signature scheme.

Abstract: This paper proposes a new algorithm to construct the optimal radial basic function (RBF) neural network for fast restoration of distribution systems with load variations. Service restoration of distribution systems is to restore power to the blacked out but unfaulted area. Basically, it is a stressful and urgent task that must be performed by system operators. In this paper, a new algorithm which combines orthogonal least-squares (OLS) and enhanced differential evolution (EDE) methods is developed to construct the optimal RBF network that shall further achieve the fast restoration of distribution systems. The proposed scheme comprises training data creation phase and network construction phase. In the training data creation phase, a heuristic-based fuzzy inference (HBFI) method is employed to build the restoration plans under various load levels. Then an optimal RBF network is constructed by OLS and EDE algorithms in the network construction phase. Once the RBF network is constructed properly, the desired restoration plan can be produced as soon as the inputs are given. The proposed method was tested on a typical distribution system of the Taiwan Power Company (TPC). Results show that the proposed method outperforms the existing methods in terms of convergence performance and forecasting accuracy. [Copyright &y& Elsevier]

Jaccard index similarity measure which applies the extension principle approach to obtain fuzzy maximum and fuzzy minimum has been proposed in ranking fuzzy numbers. However, the extension principle used is only applicable to normal fuzzy numbers and, therefore, fails to rank non-normal ones. Apart from that, the extension principle does not preserve the type of membership function of fuzzy numbers and also involves laborious mathematical operations. In this paper, a simple vertex fuzzy arithmetic operation, namely the function principle is applied. This paper also proposes the degree of optimism concept in aggregating the fuzzy evidence. The method is capable to rank both normal and non-normal fuzzy numbers in a simpler manner from all decision makers' perspectives. [ABSTRACT FROM AUTHOR]

For the recent years, there are more and more surveillance cameras set on lanes, train/bus stations, hospitals, schools, banks, supermarkets, shopping malls, etc., to improve the safety of people around them. In Taiwan, the so-called “E-Patrol” system is used to support policemen for providing patrol services and several criminal cases have been solved with the use of surveillance cameras of “E-Patrol” system. It is well known that inappropriate settings of surveillance cameras will result in some dead angles and oversetting of surveillance cameras will waste limited resources. The setting of surveillance cameras is an important issue and a complicated NP problem. In this paper, we consider the design problem of multiple-type surveillance cameras on various lanes in which two kinds of variables have to be decided simultaneously, namely, discrete variables for types of surveillance cameras and continuous variables for locations of surveillance cameras. The main purposes of this paper are (i) to propose an immune based two-phase approach for solving the optimal design of multiple-type surveillance camera problem, and (ii) to show the excellent performance of the proposed two-phase approach. [Copyright &y& Elsevier]

In this paper, the time series based damage detection algorithms developed by Nair, et al. (2006) and Nair and Kiremidjian (2007) are applied to the benchmark experimental data from the National Center for Research on Earthquake Engineering (NCREE) in Taipei, Taiwan. Both acceleration and strain data are analyzed. The data are modeled as autoregressive (AR) processes, and damage sensitive features (DSF) and feature vectors are defined in terms of the first three AR coefficients. In the first algorithm developed by Nair, et al. (2006), hypothesis tests using the t-statistic are applied to evaluate the damaged state. A damage measure (DM) is defined to measure the damage extent. The results show that the DSF's from the acceleration data can detect damage while the DSF from the strain data can be used to localize the damage. The DM can be used for damage quantification. In the second algorithm developed by Nair and Kiremidjian (2007) a Gaussian Mixture Model (GMM) is used to model the feature vector, and the Mahalanobis distance is defined to measure damage extent. Additional distance measures are defined and applied in this paper to quantify damage. The results show that damage measures can be used to detect, quantify, and localize the damage for the high intensity and the bidirectional loading cases. [ABSTRACT FROM AUTHOR]

This paper develops a nonlinear programming model to optimally design a settling basin for a small-scale drainage area with a minimum total cost. It is assumed that the shape of the settling basin is rectangular parallelepiped, and it is connected to an open channel at both ends. Therefore, the decision variables include the scales of the settling basin (i.e., length, width, and height) and the scales of the channel (i.e., width and height). The design trap efficiency requirement, which must be greater than or equal to the required one of the considered watershed, makes up the main constraint. Other constraints consist of the upper and lower bounds of the decision variables, the equations for computing the trap efficiency, and the average flow velocity in the settling basin. The objective function is to minimize the total annual cost, which is the sum of the land, capital, and maintenance-operation cost. The developed model is solved by using a genetic algorithm. This model is applied to a subwatershed of the Wu-She Reservoir watershed in central Taiwan. The obtained results effectively demonstrate the applicability and practicability of the model. [ABSTRACT FROM AUTHOR]

In this paper, we develop an intercity bus scheduling model for a variable market share. The proposed model, unlike the past intercity bus scheduling models, does not assume a fixed market share. Instead, passenger choice behaviors in competitive markets are considered. The model is formulated as a nonlinear mixed integer program that is characterized as nondeterministic polynomial-time hard. We develop a solution algorithm to efficiently solve the model. The test results, which are based on a major Taiwan intercity bus carrier, show the good performance of the model and the solution algorithm. [ABSTRACT FROM AUTHOR]

Earthquake early warning (EEW) has been implemented in several regions around the world. However, because of natural randomness and uncertainty, false alarm and missed alarm can be expected in EEW. The key scope of this study is to evaluate the reliability of an on-site EEW in Taiwan, by testing the system's algorithm with 17,836 earthquake data from 1999 to 2013. The analysis shows that the on-site EEW system, empirically speaking, should have a false-alarm probability of 2.5%, and a missed-alarm probability of 14.1%. Considering missed alarm should be more critical to EEW, a new algorithm that could reduce the system's missed-alarm occurrences to 6% is also discussed in this paper. [ABSTRACT FROM AUTHOR]

Evaluating the magnitude of overdiagnosis associated with stool-based service screening for colorectal cancer (CRC) beyond a randomized controlled trial is often intractable and understudied. We aim to estimate the proportion of overdiagnosis in population-based service screening programs for CRC with the fecal immunochemical test (FIT). The natural process of overdiagnosis-embedded disease was first built up to learn transition parameters that quantify the pathway of non-progressive and progressive screen-detected cases calibrated with sensitivity, while also taking competing mortality into account. The Markov algorithms were then developed for estimating these transition parameters based on Taiwan FIT service CRC screening data on 5,417,699 residents aged 50–69 years from 2004 to 2014. Following the digital twin design with the parallel universe structure for emulating the randomized controlled trial, the screened twin, mirroring the control group without screening, was virtually recreated by the application of the above-mentioned trained parameters to predict CRC cases containing overdiagnosis. The ratio of the predicted CRCs derived from the screened twin to the observed CRCs of the control group minus 1 was imputed to measure the extent of overdiagnosis. The extent of overdiagnosis for invasive CRCs resulting from FIT screening is 4.16% (95% CI: 2.61–5.78%). The corresponding figure is increased to 9.90% (95% CI: 8.41–11.42%) for including high grade dysplasia (HGD) and further inflated to 15.83% (95% CI: 15.23–16.46%) when the removal adenoma is considered. The modest proportion of overdiagnosis modelled by the digital twin method, dispensing with the randomized controlled trial design, suggests the harm done to population-based FIT service screening is negligible. [ABSTRACT FROM AUTHOR]

Sequence alignment lies at heart of the bioinformatics. The Smith-Waterman algorithm is one of the key sequence search algorithms and has gained popularity due to improved implementations and rapidly increasing compute power. Recently, the Smith-Waterman algorithm has been successfully mapped onto the emerging general-purpose graphics processing units (GPUs). In this paper, we focused on how to improve the mapping, especially for short query sequences, by better usage of shared memory. We performed and evaluated the proposed method on two different platforms (Tesla C1060 and Tesla K20) and compared it with two classic methods in CUDASW++. Further, the performance on different numbers of threads and blocks has been analyzed. The results showed that the proposed method significantly improves Smith-Waterman algorithm on CUDA-enabled GPUs in proper allocation of block and thread numbers. [ABSTRACT FROM AUTHOR]

Abstract: This paper sampled approximately 9.3 million entries of data, concerning payments from 300,000 credit card customers over the past two years of Bank A in Taiwan. By applying data mining techniques to decipher customers’ behavior and perform risk analysis, the clustering algorithms divides card users into 9 groups of different levels of contributions and risk profiles, according to their consumption patterns. We generalize a set of clustering rules to identify high risk customer groups in advance. Therefore, the proposed suggestions could tell who was a bad risk and either deny their application or, for those who were already cardholders, start shrinking their available credit and increasing minimum payments to squeeze out as much cash as possible before they defaulted. On the other hand, banks are advised to adjust credit limits in a timely manner for the customer groups whose risks are low and contributions are high, in addition to the provision of value added services, in order to enhance earnings. [Copyright &y& Elsevier]

This paper introduces a multi-level morphological active contour (MMAC) algorithm to identify and delineate tree crowns in mountainous forest based on rasterized airborne lidar data. MMAC is a generalized tree crown mapping algorithm which can accommodate multiple heads in a crown as well as overlapping crowns. The MMAC algorithm comprises three steps: bottom up erosion (BUE) which identifies stand candidates, top down dilation (TDD) which estimates the crown periphery, and an active contour model (ACM) which delineates crown contours. Three sample plots were selected in Alishan National Scenic Area, Taiwan, (predominantly alder, sugi, and red cypress) for evaluation of the algorithm. When compared with ground survey data, the algorithm achieved an average detection accuracy of 24 percent omission error and 13 percent commission error in identifying individual trees in mountainous forest stands. Detection accuracy is potentially related to stand density. [ABSTRACT FROM AUTHOR]

Abstract: The multimodal trip planning system (MTPS) described in this paper can efficiently identify reasonable journeys. Our methodologies could be implemented in future transit trip information systems. An effective MTPS would be of value to transit agencies or administrators due to the large number of different yet related characteristics of the transit network. In Taiwan, no successful MTPS exists owing to the fact that there are many intercity transit options, including airlines, ships, intercity buses, rail, high-speed rail, local buses, and mass rapid transit. The purpose of this study is to develop an MTPS that will ensure that transit stops are accurately sequenced and integrated into appropriate route patterns, including schedule and route data, as well as intermodal transfer locations and multi-agency transit center walking directions. The MTPS will provide landmark-to-landmark journey planning for transit users. We combine a data structure and multimodal trip planning algorithm in the MTPS that can swiftly propose reasonable travel plans. Finally, we develop a transit trip planning system for Taiwan. [Copyright &y& Elsevier]

Abstract: Dynamic voltage scaling (DVS) is a key technique for embedded real-time systems to reduce energy consumption by lowering the supply voltage and operating frequency. Many existing DVS algorithms have to generate the canonical schedules or estimate the lengths of slack time in advance for generating the voltage scaling decisions. Therefore, these methods have to compute the schedules with exponential time complexities in general. In this paper, we consider a set of jitter-controlled, independent, periodic, hard real-time tasks scheduled according to preemptive pinwheel model. Our approach constructs a tree structure corresponding to a schedule and maintains the data structure at each early-completion point. Our approach consists of off-line and on-line algorithms which consider the effects of transition time and energy. The off-line and on-line algorithm takes O(k + n log n) and O(k +(p max/p min)) time complexity, respectively, where n, k, p max and p min denotes the number of tasks, jobs, longest and shortest task period, respectively. Experimental results show that the proposed approach is effective in reducing computational complexity, transition time and energy overhead. [Copyright &y& Elsevier]