• Title/Summary/Keyword: approximation algorithm

Search Result 983, Processing Time 0.026 seconds

Reverse Link Interference Bounds in CDMA Cellular Systems (CDMA 셀룰라 시스템에서의 역방향 간섭 한계)

  • 김호준
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.7 no.3
    • /
    • pp.395-402
    • /
    • 2003
  • The capacity of a CDMA cellular system is determined by the amount of interference, therefore the exact estimation of interference is important to evaluate the system performance. In this paper, we propose an approximated equation which calculates reverse link other cell interference in the CDMA cellular systems. The equation using Riemann-Zeta function has a property that it is useful in case of any radio propagation loss exponents. And we compare calculation results with simulation results in other to verify it's usefulness. The upper bound of system capacity calculated with the proposed approximated equation gives almost alike result with the simulation. The proposed interference bound is useful to calculate system capacity and to evaluate some algorithm in a hierarchical cellular system which must be considered various propagation exponents.

A PROCESSOR SHARING MODEL FOR COMMUNICATION SYSTEMS

  • Lim, Jong Seul;Park, Chul Guen;Ahn, Seong Joon;Lee, Seoyoung
    • Journal of applied mathematics & informatics
    • /
    • v.15 no.1_2
    • /
    • pp.511-525
    • /
    • 2004
  • we model communication and computer systems that process interactive and several and several types of background jobs. The scheduling policy in use is to share the processor among all interactive jobs and, at most, one background job of each type at a time according to the process sharing discipline. Background jobs of each type are served on a first-come-first-served basis. Such scheduling policy is called Processor Sharing with Background jobs (PSBJ). In fact, the PSBJ policy is commonly used on many communication and computer systems that allow interactive usage of the systems and process certain jobs in a background mode. In this paper, the stability conditions for the PSBJ policy are given and proved. Since an exact analysis of the policy seems to be very difficult, an approximate analytic model is proposed to obtain the average job sojourn times. The model requires the solution of a set of nonlinear equations, for which an iterative algorithm is given and its convergence is proved. Our results reveal that the model provides excellent estimates of average sojourn times for both interactive and background jobs with a few percent of errors in most of the cases considered.

A STUDY ON THE EFFICIENCY OF AERODYNAMIC DESIGN OPTIMIZATION IN DISTRIBUTED COMPUTING ENVIRONMENT (분산컴퓨팅 환경에서 공력 설계최적화의 효율성 연구)

  • Kim Y.J.;Jung H.J.;Kim T.S.;Son C.H.;Joh C.Y.
    • Journal of computational fluids engineering
    • /
    • v.11 no.2 s.33
    • /
    • pp.19-24
    • /
    • 2006
  • A research to evaluate the efficiency of design optimization was carried out for aerodynamic design optimization problem in distributed computing environment. The aerodynamic analyses which take most of computational work during design optimization were divided into several jobs and allocated to associated PC clients through network. This is not a parallel process based on domain decomposition in a single analysis rather than a simultaneous distributed-analyses using network-distributed computers. GBOM(gradient-based optimization method), SAO(Sequential Approximate Optimization) and RSM(Response Surface Method) were implemented to perform design optimization of transonic airfoils and evaluate their efficiencies. dimensional minimization followed by direction search involved in the GBOM was found an obstacle against improving efficiency of the design process in the present distributed computing system. The SAO was found fairly suitable for the distributed computing environment even it has a handicap of local search. The RSM is apparently the most efficient algorithm in the present distributed computing environment, but additional trial and error works needed to enhance the reliability of the approximation model deteriorate its efficiency from the practical point of view.

Approximate Optimization of the Steel Wheel's Disc Hole (스틸휠 디스크 홀의 근사최적화)

  • Kim, Woo-Hyun;Cho, Jae-Seng;Yoo, Wan-Suk;Lim, O-Kaung
    • Proceedings of the KSME Conference
    • /
    • 2003.04a
    • /
    • pp.570-573
    • /
    • 2003
  • Wheels for passenger car support the car weight with tires. and they transmit rolling and braking power into the ground. Whittliing away at wheel weight is more effective to boost fuel economy that lighting vehicle body structure. A shape of hole in disk is optimized for minimizing the weight of steel wheel. Pro/ENGINEER program is used for formulating the design model. and ANSYS package is selected for analyzing the design model. It has difficulties 10 interface these commercial software directly. For combining both programs. response surface methodology is applied to construct approximation functions for maximum stresses and maximum displacements are obtained by full factorial design of five levels. This steel wheel is modeled in 14-inch diameter of rim. and wide parameter of hole in disk is only selected as design variable for reducing the weight of steel wheel. PLBA(Pshenichny·Lim-Belegundu_arora) algorithm. which uses the second-order information in the direction finding problem and uses the active set strategy. is used for solving optimization problems.

  • PDF

Multilevel Multiobjective Optimization for Structures (다단계 다목적함수 최적화를 이용한 구조물의 최적설계)

  • 한상훈;최홍식
    • Computational Structural Engineering
    • /
    • v.7 no.1
    • /
    • pp.117-124
    • /
    • 1994
  • Multi-level Multi-objective optimization(MLMO) for reinforced concrete framed structure is performed, and compared with the results of single-level single-objective optimization. MLMO method allows flexibility to meet the design needs such as deflection and cost of structures using weighting factors. Using Multi-level formulation, the numbers of constraints and variables are reduced at each levels, and the optimization formulation becomes simplified. The force approximation method is used to reflect the variation in design variables between the substructures, and thus coupling is maintained. And the linear approximated constraints and objective function are used to reduce the number of structural analysis in optimization process. It is shown that the developed algorithm with move limit can converge effectively to optimal solution.

  • PDF

Time Domain Seismic Waveform Inversion based on Gauss Newton method (시간영역에서 가우스뉴튼법을 이용한 탄성파 파형역산)

  • Sheen, Dong-Hoon;Baag, Chang-Eob
    • 한국지구물리탐사학회:학술대회논문집
    • /
    • 2006.06a
    • /
    • pp.131-135
    • /
    • 2006
  • A seismic waveform inversion for prestack seismic data based on the Gauss-Newton method is presented. The Gauss-Newton method for seismic waveform inversion was proposed in the 80s but has rarely been studied. Extensive computational and memory requirements have been principal difficulties. To overcome this, we used different sizes of grids in the inversion stage from those of grids in the wave propagation simulation, temporal windowing of the simulation and approximation of virtual sources for calculating partial derivatives, and implemented this algorithm on parallel supercomputers. We show that the Gauss-Newton method has high resolving power and convergence rate, and demonstrate potential applications to real seismic data.

  • PDF

Social-Aware Collaborative Caching Based on User Preferences for D2D Content Sharing

  • Zhang, Can;Wu, Dan;Ao, Liang;Wang, Meng;Cai, Yueming
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.3
    • /
    • pp.1065-1085
    • /
    • 2020
  • With rapid growth of content demands, device-to-device (D2D) content sharing is exploited to effectively improve the service quality of users. Considering the limited storage space and various content demands of users, caching schemes are significant. However, most of them ignore the influence of the asynchronous content reuse and the selfishness of users. In this work, the user preferences are defined by exploiting the user-oriented content popularity and the current caching situation, and further, we propose the social-aware rate, which comprehensively reflects the achievable contents download rate affected by the social ties, the caching indicators, and the user preferences. Guided by this, we model the collaborative caching problem by making a trade-off between the redundancy of caching contents and the cache hit ratio, with the goal of maximizing the sum of social-aware rate over the constraint of limited storage space. Due to its intractability, it is computationally reduced to the maximization of a monotone submodular function, subject to a matroid constraint. Subsequently, two social-aware collaborative caching algorithms are designed by leveraging the standard and continuous greedy algorithms respectively, which are proved to achieve different approximation ratios in unequal polynomial-time. We present the simulation results to illustrate the performance of our schemes.

MINLP optimization of a composite I beam floor system

  • Zula, Tomaz;Kravanja, Stojan;Klansek, Uros
    • Steel and Composite Structures
    • /
    • v.22 no.5
    • /
    • pp.1163-1192
    • /
    • 2016
  • This paper presents the cost optimization of a composite I beam floor system, designed to be made from a reinforced concrete slab and steel I sections. The optimization was performed by the mixed-integer non-linear programming (MINLP) approach. For this purpose, a number of different optimization models were developed that enable different design possibilities such as welded or standard steel I sections, plastic or elastic cross-section resistances, and different positions of the neutral axes. An accurate economic objective function of the self-manufacturing costs was developed and subjected to design, resistance and deflection (in)equality constraints. Dimensioning constraints were defined in accordance with Eurocode 4. The Modified Outer-Approximation/Equality-Relaxation (OA/ER) algorithm was applied together with a two-phase MINLP strategy. A numerical example of the optimization of a composite I beam floor system, as presented at the end of this paper, demonstrates the applicability of the proposed approach. The optimal result includes the minimal produced costs of the structure, the optimal concrete and steel strengths, and dimensions.

A GENERAL ITERATIVE ALGORITHM COMBINING VISCOSITY METHOD WITH PARALLEL METHOD FOR MIXED EQUILIBRIUM PROBLEMS FOR A FAMILY OF STRICT PSEUDO-CONTRACTIONS

  • Jitpeera, Thanyarat;Inchan, Issara;Kumam, Poom
    • Journal of applied mathematics & informatics
    • /
    • v.29 no.3_4
    • /
    • pp.621-639
    • /
    • 2011
  • The purpose of this paper is to introduce a general iterative process by viscosity approximation method with parallel method to ap-proximate a common element of the set of solutions of a mixed equilibrium problem and of the set of common fixed points of a finite family of $k_i$-strict pseudo-contractions in a Hilbert space. We obtain a strong convergence theorem of the proposed iterative method for a finite family of $k_i$-strict pseudo-contractions to the unique solution of variational inequality which is the optimality condition for a minimization problem under some mild conditions imposed on parameters. The results obtained in this paper improve and extend the corresponding results announced by Liu (2009), Plubtieng-Panpaeng (2007), Takahashi-Takahashi (2007), Peng et al. (2009) and some well-known results in the literature.

The Meshfree Method Based on the Least-Squares Formulation for Elasto-Plasticity (탄소성 최소 제곱 수식화와 이를 이용한 무요소법)

  • Youn Sung-Kie;Kwon Kie-Chan
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.29 no.6 s.237
    • /
    • pp.860-875
    • /
    • 2005
  • A new meshfree method for the analysis of elasto-plastic deformations is presented. The method is based on the proposed first-order least-squares formulation, to which the moving least-squares approximation is applied. The least-squares formulation for the classical elasto-plasticity and its extension to an incrementally objective formulation for finite deformations are proposed. In the formulation, the equilibrium equation and flow rule are enforced in least-squares sense, while the hardening law and loading/unloading condition are enforced exactly at each integration point. The closest point projection method for the integration of rate-form constitutive equation is inherently involved in the formulation, and thus the radial-return mapping algorithm is not performed explicitly. Also the penalty schemes for the enforcement of the boundary and frictional contact conditions are devised. The main benefit of the proposed method is that any structure of cells is not used during the whole process of analysis. Through some numerical examples of metal forming processes, the validity and effectiveness of the method are presented.