• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.2
• /
• pp.55-67
• /
• 2005

Separation between computation and communication in system design allows the system designer to explore the communication architecture independently of component selection and mapping. In this paper we present an iterative two-step exploration methodology for bus-based on-chip communication architecture and memory allocation, assuming that memory traces from the processing elements are given from the mapping stage. The proposed method uses a static performance estimation technique to reduce the large design space drastically and quickly, and applies a trace-driven simulation technique to the reduced set of design candidates for accurate Performance estimation. Since local memory traffics as well as shared memory traffics are involved in bus contention, memory allocation is considered as an important axis of the design space in our technique. The viability and efficiency of the proposed methodology arc validated by two real -life examples, 4-channel digital video recorder (DVR) and an equalizer for OFDM DVB-T receiver.

• Structural Engineering and Mechanics
• /
• v.87 no.3
• /
• pp.255-272
• /
• 2023

Spatial cable systems can provide more transverse stiffness and torsional stiffness without sacrificing the vertical bearing capacity compared with conventional vertical cable systems, which is quite lucrative for long-span earth-anchored suspension bridges' development. Higher economy highlights the importance of refined form-finding analysis. Meanwhile, the internal connection between the lateral and vertical sags has not yet been specified. Given this, an analytic algorithm of form-finding for the earth-anchored suspension bridge with spatial cables is proposed in this paper. Through the geometric compatibility condition and mechanical equilibrium condition, the expressions for cable segment, the recurrence relationship between catenary parameters and control equations of spatial cable are established. Additionally, the nonlinear general reduced gradient method is introduced into fast and high-precision numerical analysis. Furthermore, the analytic expression of the lateral and vertical sags is deduced and discussed. This is very significant for the space design above the bridge deck and the optimization of the sag-to-span ratio in the preliminary design stage of the bridge. Finally, the proposed method is verified with the aid of two examples, one being an operational self-anchored suspension bridge (with spatial cables and a 260 m main span), and the other being an earth-anchored suspension bridge under design (with spatial cables and a 500 m main span). The necessity of an iterative calculation for hanger tensions on earth-anchored suspension bridges is confirmed. It is further concluded that the main cable and their connected hangers are in very close inclined planes.

• The Journal of Fisheries Business Administration
• /
• v.21 no.2
• /
• pp.55-84
• /
• 1990

The objective of this study is to develop an inventory model for the inventory management of a stocking point which sells processed fisheries products. The study, first of all, sets up fisheries processing companies, food companies, apparel companies, pharmaceutical companies and electronic and electrical companies as a population. Then, a comparative study is empirically applied to obtain the inventory characteristics of final products by industry through a survey of a sample selected by a random sampling procedure. The major inventory characteristics of processed fisheries products obtained from the above analysis can be summarized as follows : 1) The major demand characteristics of processed fisheries products is to have wide seasonal fluctuations because the supply of raw materials (i.e., fisheries products) heavily depends on the productive capacity of nature. 2) It has found that fisheries processing companies are the worst in inventory management among the various industries selected in the sample. However, the self-rating of inventory management system by inventory managers of companies shows that the fisheries processing companies are relatively higher than the other companies. 3) The portion of inventory holding cost out of inventory relevant cost is very high for processed fisheries products compared with final products of the other industries. 4) Processed fisheries products are distributed to final consumers through roughly two distribution echelons and take a parallel type inventory system for their distribution structure. In order to develop an inventory model which reflects the inventory characteristics of processed fisheries products mentioned in the above, an inventory model with partial backorders is developed under the situation of stochastic lead time under the consideration of the inventory characteristics of processed fisheries products and then an iterative solution method is provided for the model. Then this study analyzes sensitivity for the standard deviation of lead time in the model by numerical examples.

• Journal of Intelligence and Information Systems
• /
• v.19 no.4
• /
• pp.55-79
• /
• 2013

In this paper, we propose a hybrid genetic algorithm (HGA) approach to effectively solve the reverse logistics network with centralized centers (RLNCC). For the proposed HGA approach, genetic algorithm (GA) is used as a main algorithm. For implementing GA, a new bit-string representation scheme using 0 and 1 values is suggested, which can easily make initial population of GA. As genetic operators, the elitist strategy in enlarged sampling space developed by Gen and Chang (1997), a new two-point crossover operator, and a new random mutation operator are used for selection, crossover and mutation, respectively. For hybrid concept of GA, an iterative hill climbing method (IHCM) developed by Michalewicz (1994) is inserted into HGA search loop. The IHCM is one of local search techniques and precisely explores the space converged by GA search. The RLNCC is composed of collection centers, remanufacturing centers, redistribution centers, and secondary markets in reverse logistics networks. Of the centers and secondary markets, only one collection center, remanufacturing center, redistribution center, and secondary market should be opened in reverse logistics networks. Some assumptions are considered for effectively implementing the RLNCC The RLNCC is represented by a mixed integer programming (MIP) model using indexes, parameters and decision variables. The objective function of the MIP model is to minimize the total cost which is consisted of transportation cost, fixed cost, and handling cost. The transportation cost is obtained by transporting the returned products between each centers and secondary markets. The fixed cost is calculated by opening or closing decision at each center and secondary markets. That is, if there are three collection centers (the opening costs of collection center 1 2, and 3 are 10.5, 12.1, 8.9, respectively), and the collection center 1 is opened and the remainders are all closed, then the fixed cost is 10.5. The handling cost means the cost of treating the products returned from customers at each center and secondary markets which are opened at each RLNCC stage. The RLNCC is solved by the proposed HGA approach. In numerical experiment, the proposed HGA and a conventional competing approach is compared with each other using various measures of performance. For the conventional competing approach, the GA approach by Yun (2013) is used. The GA approach has not any local search technique such as the IHCM proposed the HGA approach. As measures of performance, CPU time, optimal solution, and optimal setting are used. Two types of the RLNCC with different numbers of customers, collection centers, remanufacturing centers, redistribution centers and secondary markets are presented for comparing the performances of the HGA and GA approaches. The MIP models using the two types of the RLNCC are programmed by Visual Basic Version 6.0, and the computer implementing environment is the IBM compatible PC with 3.06Ghz CPU speed and 1GB RAM on Windows XP. The parameters used in the HGA and GA approaches are that the total number of generations is 10,000, population size 20, crossover rate 0.5, mutation rate 0.1, and the search range for the IHCM is 2.0. Total 20 iterations are made for eliminating the randomness of the searches of the HGA and GA approaches. With performance comparisons, network representations by opening/closing decision, and convergence processes using two types of the RLNCCs, the experimental result shows that the HGA has significantly better performance in terms of the optimal solution than the GA, though the GA is slightly quicker than the HGA in terms of the CPU time. Finally, it has been proved that the proposed HGA approach is more efficient than conventional GA approach in two types of the RLNCC since the former has a GA search process as well as a local search process for additional search scheme, while the latter has a GA search process alone. For a future study, much more large-sized RLNCCs will be tested for robustness of our approach.