Analysis by data mining in the emergency medicine triage database at a Taiwanese regional hospital

“Emergency medicine” is the front line of medical service a hospital provides; also it is the department people seek medical care from immediately after an emergency happens. The statistics by the Department of Health, Executive Yuan, indicate that over years, the number of people at the emergency department has been increasing. The US has introduced and practiced the triage system in the emergency medicine in 1960, whereby to aid the emergency department in allocating the patients, to give them appropriate medical care by the fast decision of the nurses and doctors in case of the patients’ seriousness through their judgment.This study takes on the knowledge contained in the massive data of unknown characteristics in the triage database at a Taiwanese regional hospital, using the cluster analysis and the rough set theory as tools for data mining to extract, with the analysis software ROSE2 (Rough Sets Data Explorer) and through rule induction technique, the imprecise, uncertain and vague information of rules from the massive database, and builds the model that is capable of simplifying massive data while maintaining the accuracy in classifying rules. After analyzing and evaluating the knowledge obtained from relevant mining in the hospitals past medical data for the consumption of emergency medical resources, this thesis proposes suggestions as reference for the hospitals in subsequent elevation of medical quality and decrease in operative costs.     

A computer-enabled solution procedure for food wholesalers’ distribution decision in cities with a circular transportation infrastructure

This paper addresses the food distribution decision from a wholesaler's perspective, as the wholesalers are often faced with thorny issues such as when, where, how to deliver products at the lowest costs to best satisfy the retailers’ changing needs. This research relies on a distribution problem encountered at Northern Grocery Company in Beijing as an example to develop a two-stage solution procedure and subsequent computer-enabled programs for identifying efficient vehicle routing alternatives. The solution process, which integrates heuristic search algorithms and an integer programming model, can be applied to a wide range of distribution problems with specified route durations and a circular transportation network structure as exemplified by City of Beijing.     

An efficient image encryption algorithm based on a novel chaotic map

Multimedia Tools and Applications - In this paper, we propose a novel low dimensional chaotic map, namely, compounded piecewise linear map (CPLM) in order to balance between security and...     

Reachability determination in acyclic Petri nets by cell enumeration approach

Reachability is one of the most important behavioral properties of Petri nets. We propose in this paper a novel approach for solving the fundamental equation in the reachability analysis of acyclic Petri nets, which has been known to be NP-complete. More specifically, by adopting a revised version of the cell enumeration method for an arrangement of hyperplanes in discrete geometry, we develop an efficient solution scheme to identify firing count vector solution(s) to the fundamental equation on a bounded integer set, with a complexity bound of O((nu)^n−m), where n is the number of transitions, m is the number of places and u is the upper bound of the number of firings for all individual transitions.     

Efficient simplex computation for fixture layout design

Fixture, to hold an object by making multiple contacts, is a fundamental tool in manufacturing. A fixture layout is an arrangement of contacts on an object’s surface. Designing a fixture layout of an object can be reduced to computing the largest simplex and the resulting simplex is classified using the radius of the largest inscribed ball centered at the origin. We present three different algorithms to compute such a simplex: a simple randomized algorithm, an interchange algorithm, and a branch-and-bound algorithm. We also present methods to combine different algorithms to improve the performance and highlight their performance on complex 3D models consisting of thousands of triangles. Our randomized algorithm computes a feasible fixture layout in linear time and is well-suited for real-time applications. The interchange algorithm computes an optimal simplex in linear time such that no single vertex can be changed to enlarge the simplex, and it provides a practical method for complex 3D objects. The branch-and-bound algorithm computes the largest simplex by using lower and upper bounds on the radius of the inscribed ball, by which the computation time is reduced by a factor of five in comparison with the brute-force search.