• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.4 no.1
• /
• pp.50-55
• /
• 2004

We propose an intgrated Gill environment system having only integer fuzzy operations in the consequent part and the defuzzification stage. In this paper, we also propose an integrated Gill environment system with 4 parallel fuzzy processing units to be operated in parallel on the classification of the sensed image data. In this, we solve the problems of taking longer times as the fuzzy real computations of [0, 1] by using the integer pixel conversion algorithm to convert lines of each fuzzy linguistic term to the closest integer pixels. This procedure is performed automatically in the GUI application program. As a Gill environment, PCI transmission, image data pre-processing, integer pixel mapping and fuzzy membership tuning are considered. This system can be operated in parallel manner for MIMO or MISO systems.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.04a
• /
• pp.65-68
• /
• 2000

The problem of selecting a portfolio is to find Un investment plan that achieves a desired return while minimizing the risk involved. One stream of algorithms are based upon mixed integer linear programming models and guarantee an integer optimal solution. But these algorithms require too much time to apply to real problems. Another stream of algorithms are fur a near optimal solution and are fast enough. But, these also have a weakness in that the solution generated can't be guaranteed to be integer values. Since it is not a trivial job to tansform the scullion into integer valued one simutaneously maintaining the quality of the solution, they are not easy to apply to real world portfolio selection. To tackle the problem more efficiently, we propose an algorithm which generates a very good integer solution in reasonable amount of time. The algorithm is tested using Korean stock market data to verify its accuracy and efficiency.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.659-662
• /
• 1999

In this paper we implement MP3 encoder based on integer operations. To implement MP3 encoder presented in ［1］, floating-point operations are required. But we devise an MP3 encoding method which is based on integer operations. To verify the method presented in this paper, we implement MP3 encoder using ARM processor. In this paper we present the method to change floating point operations into integer operations, and the ARM assembly programming technique to implement fast MP3 encoder. The MP3 encoder implement using integer processor consumes less power than the encoder implemented using floating-point processor. So the encoder implemented in this paper is suitable lot portable applications which requires low power consumption.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.2395-2398
• /
• 2003

This paper focuses on lossless medical image compression methods for medical images that operate on two-dimensional(2D) reversible integer wavelet transform. We offer an application of the Set Partitioning in Hierarchical Trees(SPIHT) algorithm [1][3][9] to medical images, using a 2D wavelet decomposition and a 2D spatial dependence tree. The wavelet decomposition is accomplished with integer wavelet filters implemented with the lifting method, where careful scaling and truncations keep the integer precision small and the transform unitary. We have tested our encoder on medical images using different integer filters. Results show that our algorithm with certain filters performs as well and sometimes better in lossless coding than previous coding systems using 2D integer wavelet transforms on medical images.

• Journal of Institute of Control, Robotics and Systems
• /
• v.14 no.6
• /
• pp.587-594
• /
• 2008

In this paper, an efficient integer ambiguity resolution method for GNSS attitude determination system is described. The proposed method solves the integer least-squares with quadratic equality constraints(ILSQE) problem and shows an expansion of the LAMBDA method can be used to solve it. The solution of ILSQE is shown and an efficient implementation with a LAMBDA based method is given. The method is compared with some other methods. The results of static and dynamic tests show the dramatic improvement of the success rates of integer ambiguity resolution.

• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.114-117
• /
• 2004

This paper proposes a novel algorithm for hybrid lossless audio coding, which employs integer discrete cosine transform. The proposed algorithm divides the input signal into frames of a proper length, decorrelates the framed data using the integer DCT and finally entropy-codes the frame data. In particular, the adaptive Golomb-Rice coding method used for the entropy coding selects an optimal option which gives the best compression efficiency. Since the proposed algorithm uses integer operations, it significantly improves the computation speed in comparison with an algorithm using real or floating-point operations. When the coding algorithm is implemented in hardware, the system complexity as well as the power consumption is remarkably reduced. Finally, because each frame is independently coded and is byte-aligned with respect to the frame header, it is convenient to move, search, and edit the coded data.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.5 no.3
• /
• pp.274-279
• /
• 2005

For high-speed fuzzy control systems, an important problem is the improvement of speed for the fuzzy inference, particularly in the consequent part and the defuzzification stage. This paper introduces an algorithm to map real values of the fuzzy membership functions in the consequent part onto an integer grid, as well as a method of eliminating the unnecessary operations of the zero items in the defuzzification stage, allowing a center of gravity method to be implemented with only integer additions and one integer division. A VHDL implementation of the system is presented. The proposed system shows approximately an order of magnitude increase in speed as compared with conventional methods while introducing only a minimal error and can be used in many fuzzy controller applications.

• Proceedings of the Korean Society Of Semiconductor Equipment Technology
• /
• 2004.05a
• /
• pp.217-222
• /
• 2004

This paper focuses on lossy medical image compression methods for medical images that operate on two-dimensional(2D) integer wavelet transform. We offer an application of the Set Partitioning in Hierarchical Trees(SPIHT) algorithm to medical images, using a 2D wavelet decomposition and a 2D spatial dependence tree. The wavelet decomposition is accomplished with integer wavelet filters implemented with the lifting method, where careful scaling and truncations keep the integer precision small and the transform unitary. We have tested our encoder on medical images using different integer filters. Results show that our algorithm with certain filters performs as well and is sometimes better lossy coding using 2D integer wavelet transforms on medical images.

• Journal of Electrical Engineering and Technology
• /
• v.7 no.2
• /
• pp.151-156
• /
• 2012

The current study presents a zero-one integer programming approach to determine the minimum break point set for the coordination of directional relays. First, the network is reduced if there are any parallel lines or three-end nodes. Second, all the directed loops are enumerated to reduce the iteration. Finally, the problem is formulated as a set-covering problem, and the break point set is determined using the zero-one integer programming technique. Arbitrary starting relay locations and the arbitrary consideration of relay sequence to set and coordinate relays result in navigating the loops many times and futile attempts to achieve system-wide relay coordination. These algorithms are compared with the existing methods, and the results are presented. The problem is formulated as a setcovering problem solved by the zero-one integer programming approach using LINGO 12, an optimization modeling software.

• Journal of the Korea Society of Computer and Information
• /
• v.23 no.12
• /
• pp.1-9
• /
• 2018

The multiple-choice multidimensional knapsack problem (MMKP) is a variant of the well known 0-1 knapsack problem, which is known as an NP-hard problem. This paper proposes a method for solving the MMKP using the integer programming-based local search (IPbLS). IPbLS is a kind of a local search and uses integer programming to generate a neighbor solution. The most important thing in IPbLS is the way to select items participating in the next integer programming step. In this paper, three ways to select items are introduced and compared on 37 well-known benchmark data instances. Experimental results shows that the method using linear programming is the best for the MMKP. It also shows that the proposed method can find the equal or better solutions than the best known solutions in 23 data instances, and the new better solutions in 13 instances.