• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.12 no.3
• /
• pp.250-255
• /
• 2012

Face recognition has wide applications in security and surveillance systems as well as in robot vision and machine interfaces. Conventional challenges in face recognition include pose, illumination, and expression, and face recognition at a distance involves additional challenges because long-distance images are often degraded due to poor focusing and motion blurring. This study investigates the effectiveness of applying photon-counting linear discriminant analysis (Pc-LDA) to face recognition in harsh environments. A related technique, Fisher linear discriminant analysis, has been found to be optimal, but it often suffers from the singularity problem because the number of available training images is generally much smaller than the number of pixels. Pc-LDA, on the other hand, realizes the Fisher criterion in high-dimensional space without any dimensionality reduction. Therefore, it provides more invariant solutions to image recognition under distortion and degradation. Two decision rules are employed: one is based on Euclidean distance; the other, on normalized correlation. In the experiments, the asymptotic equivalence of the photon-counting method to the Fisher method is verified with simulated data. Degraded facial images are employed to demonstrate the robustness of the photon-counting classifier in harsh environments. Four types of blurring point spread functions are applied to the test images in order to simulate long-distance acquisition. The results are compared with those of conventional Eigen face and Fisher face methods. The results indicate that Pc-LDA is better than conventional facial recognition techniques.

• Journal of Communications and Networks
• /
• v.6 no.1
• /
• pp.68-77
• /
• 2004

In the near future packet networks should support applications which can not predict their traffic requirements in advance, but still have tight quality of service requirements, e.g., guaranteed bandwidth, jitter, and packet loss. These dynamic characteristics mean that the sources can be made to modify their data transfer rates according to network conditions. Depending on the customer&; needs, network operator can differentiate incoming connections and handle those in the buffers and the interfaces in different ways. In this paper, dynamic QoS-aware scheduling algorithm is presented and investigated in the single node case. The purpose of the algorithm is in addition to fair resource sharing to different types of traffic classes with different priorities ?to maximize revenue of the service provider. It is derived from the linear type of revenue target function, and closed form globally optimal formula is presented. The method is computationally inexpensive, while still producing maximal revenue. Due to the simplicity of the algorithm, it can operate in the highly nonstationary environments. In addition, it is nonparametric and deterministic in the sense that it uses only the information about the number of users and their traffic classes, not about call density functions or duration distributions. Also, Call Admission Control (CAC) mechanism is used by hypothesis testing.

• IE interfaces
• /
• v.17 no.2
• /
• pp.233-241
• /
• 2004

The main subject to become a hub port is automation. The automated container terminal has already operated in advanced ports and it has been planned for the basic planning and operation design in domestic case. The key of automated container terminal is effective operation of both ATC(automated transfer crane) and AGV(automated guided vehicle) which is automated handling equipments. This is essential to productivity of automated container terminal. This study suggests the most optimal method of equipment operation in order to minimize loading time using each three types of effective ATC operation methods and AGV dispatching rules in automated container terminals. As the automated equipment operation causes unexpected deadlocks or interferences, it should be proceeded on event-based real time. Therefore we propose the most effective ATC operation methods and AGV dispatching rules in this paper. The various states occurred in real automated container terminals are simulated to evaluate these methods. This experiment will show the most robust automated equipment operation method on various parameters(the degree of yard re-marshaling, the number of containers and AGV)

• IE interfaces
• /
• v.20 no.2
• /
• pp.112-120
• /
• 2007

As the market rapidly changes, the speed of new product development is highlighted as a critical element which determines the success of firms. While firms endeavor to accelerate the development speed, frequent iterations in a development process hinders the effort of acceleration. For this reason, many previous researches tried to find the optimal structure of the development process which minimizes the number of iterations. However, such researches have a limitation in that they can be applied to only a single-project environment. In a multi-project environment, waiting time induced by lack of resources also delays the process as well as the iterations do. In this paper, we propose dynamic sequencing method focusing on both iterations and waiting time for reducing the durations of development projects in a multi-project environment. This method reduces the waiting time by changing the sequence of development tasks according to the states of resources. While the method incurs additional iterations, they are expected to be offset by the reduced waiting time. The results of simulation show that the dynamic sequencing method dramatically improves the efficiency of a development process. Especially, the improvement is more salient as projects are more crowded and the process is more unbalanced. This method gives a new insight in researches on managing multiple development projects.

• IE interfaces
• /
• v.16 no.4
• /
• pp.450-462
• /
• 2003

In this paper, we deal with a process and layout design for producing a planned amount of Sikhye in a given limited time period under a reasonable production schedule. We represent a Sikhye production line as a vector N, the element of which denotes the number of tanks required in each process and our objective is to find an appropriate vector which minimizes the total investment cost. We suggest a systematic method for finding an appropriate N and an appropriate layout to N. In detail, first, we decide the required sequence of processes and the required operations for each process and we estimate standard operating times. Second, constructing a precedence diagram, we find a critical path in order to reduce the total production lead time for a batch of Sikhye. Third, given a limited N space, we manage to construct manually each production schedule using both the processing times of the critical operations and transfer times. Finally, we find an optimal vector N which gives a minimum investment cost and meets both the time constraint and quantity constraint. In addition, with the estimated relative size of each tank, we suggest an appropriate conceptual layout design including an expansion area for future demands, based on the span technique used in the field of architectural design.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.1
• /
• pp.68-82
• /
• 2011

Wireless mesh networks (WMNs) provide high-speed backbone networks without any wired cable. Many researchers have tried to increase network throughput by using multi-channel and multi-radio interfaces. A multi-radio multi-channel WMN requires channel assignment algorithm to decide the number of channels needed for each link. Since the channel assignment affects routing and interference directly, it is a critical component for enhancing network performance. However, the optimal channel assignment is known as a NP complete problem. For high performance, most of previous works assign channels in a centralized manner but they are limited in being applied for dynamic network environments. In this paper, we propose a simple flow estimation algorithm and a hybrid channel assignment algorithm. Our flow estimation algorithm obtains aggregated flow rate information between routers by packet sampling, thereby achieving high scalability. Our hybrid channel assignment algorithm initially assigns channels in a centralized manner first, and runs in a distributed manner to adjust channel assignment when notable traffic changes are detected. This approach provides high scalability and high performance compared with existing algorithms, and they are confirmed through extensive performance evaluations.

• Journal of Biomedical Engineering Research
• /
• v.31 no.3
• /
• pp.199-209
• /
• 2010

The locking compression plates-distal femur(LCP-DF) are being widely used for surgical management of the extra-articular complex fractures of the distal femur. They feature locking mechanism between the screws and the screw holes of the plate to provide stronger fixation force with less number of screws than conventional compression bone plate. However, their biomechanical efficacies are not fully understood, especially regarding the number of the screws inserted and their optimal configurations. In this study, we investigated effects of various screw configurations in the shaft and the condylar regions of the femur in relation to structural stability of LCP-DF system. For this purpose, a baseline 3-D finite element (FE) model of the femur was constructed from CT-scan images of a normal healthy male and was validated. The extra-articular complex fracture of the distal femur was made with a 4-cm defect. Surgical reduction with LCP-DF and bone screws were added laterally. To simulate various cases of post-op screw configurations, screws were inserted in the shaft (3~5 screws) and the condylar (4~6 screws) regions. Particular attention was paid at the shaft region where screws were inserted either in clustered or evenly-spaced fashion. Tied-contact conditions were assigned at the bone screws-plate whereas general contact condition was assumed at the interfaces between LCP-DF and bone screws. Axial compressive load of 1,610N(2.3 BW) was applied on the femoral head to reflect joint reaction force. An average of 5% increase in stiffness was found with increase in screw numbers (from 4 to 6) in the condylar region, as compared to negligible increase (less than 1%) at the shaft regardless of the number of screws inserted or its distribution, whether clustered or evenly-spaced. At the condylar region, screw insertion at the holes near the fracture interface and posterior locations contributed greater increase in stiffness (9~13%) than any other locations. Our results suggested that the screw insertion at the condylar region can be more effective than at the shaft during surgical treatment of fracture of the distal femur with LCP-DF. In addition, screw insertion at the holes close to the fracture interface should be accompanied to ensure better fracture healing.