• Title/Summary/Keyword: (non)arbitrary

Search Result 338, Processing Time 0.032 seconds

Software for biaxial cyclic analysis of reinforced concrete columns

  • Shirmohammadi, Fatemeh;Esmaeily, Asad
    • Computers and Concrete
    • /
    • v.17 no.3
    • /
    • pp.353-386
    • /
    • 2016
  • Realistic assessment of the performance of reinforced concrete structural members like columns is needed for designing new structures or maintenance of the existing structural members. This assessment requires analytical capability of employing proper material models and cyclic rules and considering various load and displacement patterns. A computer application was developed to analyze the non-linear, cyclic flexural performance of reinforced concrete structural members under various types of loading paths including non-sequential variations in axial load and bi-axial cyclic load or displacement. Different monotonic material models as well as hysteresis rules, were implemented in a fiber-based moment-curvature and in turn force-deflection analysis, using proper assumptions on curvature distribution along the member, as in plastic-hinge models. Performance of the program was verified against analytical results by others, and accuracy of the analytical process and the implemented models were evaluated in comparison to the experimental results. The computer application can be used to predict the response of a member with an arbitrary cross section and various type of lateral and longitudinal reinforcement under different combinations of loading patterns in axial and bi-axial directions. On the other hand, the application can be used to examine analytical models and methods using proper experimental data.

Online Non-preemptive Deadline Scheduling for Weighted Jobs (가중치 작업들의 온라인 비선점 마감시한 스케줄링)

  • Kim Jae-Hoon;Chang Jung-Hwan
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.32 no.2
    • /
    • pp.68-74
    • /
    • 2005
  • In deadline scheduling, jobs have deadlines by which they are completed. The scheduling algorithm determines which jobs are executed at each time. Then only the completed jobs contribute to the throughput or gain of the algorithm. The jobs have arbitrary weights and the gain of the algorithm is given as the sum of weights of the completed jobs. The goal of the scheduling algorithm is to maximize its gain. In this paper, we consider online non-preemptive scheduling, where jobs arrive online and the scheduling algorithm has no information about jobs arriving ahead. Also the jobs cannot be preempted or rejected while they are executed. For this problem, we obtain lower bounds for any online algorithms and also we propose an optimal online algorithm meeting the lower bounds.

Decoupled SVPWM for Five-Phase Permanent Magnet Machines with Trapezoidal Back-EMF

  • Lin, Zhipeng;Liu, Guohai;Zhao, Wenxiang;Chen, Qian
    • Journal of Power Electronics
    • /
    • v.18 no.5
    • /
    • pp.1424-1433
    • /
    • 2018
  • This paper presents a novel space vector pulse-width modulation (SVPWM) to synthesize an arbitrary non-sinusoidal phase voltage. The key of the proposed method is that the switching vectors used to comprise the reference vectors in the ${\alpha}_1-{\beta}_1$ frame and the ${\alpha}_3-{\beta}_3$ frame are decoupled. In the ${\alpha}_1-{\beta}_1$ frame, the reference vector is comprised by near two large vectors. The corresponding vector comprised by the two vectors in the ${\alpha}_3-{\beta}_3$ frame is considered as a disturbance, which is restrained by close-loop control. In the ${\alpha}_3-{\beta}_3$ frame, there are two methods to comprise the reference vector. Method I is a near two middle vectors method. Method II uses near four vectors (two middle and two little vectors). The proposed SVPWM using decoupled switching vectors can guarantee a maximum modulation index in the ${\alpha}_1-{\beta}_1$ frame. The effectiveness of the proposed method is verified by simulated and experimental results under various operation conditions.

A Study of T1 Relaxation and Data Management of Animal Images based on Marquardt Algorithm for MRI (비선형 Marquardt 알고리듬을 기초로 활용하는 동물실험을 위한 T1 영상의 예비연구)

  • Yoon, Seong-Ik;Choe, Bo-Young
    • Proceedings of the Korean Society of Medical Physics Conference
    • /
    • 2004.11a
    • /
    • pp.56-58
    • /
    • 2004
  • MRI analysis and weights of molecular differences of Volume of Interest(VOI) was studied in animal. The appearance of tiny voxels significant objects for evaluate of disease or irregular function of cells is simplified remodeling before making image. The method of Marquardt, A method of Non-linear mathematical approach can be used to get a quick calculations in arbitrary space. Results shows the relationships between accurate vivo signal and biochemical molecular solutions,

  • PDF

Secure Outsourced Computation of Multiple Matrix Multiplication Based on Fully Homomorphic Encryption

  • Wang, Shufang;Huang, Hai
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.11
    • /
    • pp.5616-5630
    • /
    • 2019
  • Fully homomorphic encryption allows a third-party to perform arbitrary computation over encrypted data and is especially suitable for secure outsourced computation. This paper investigates secure outsourced computation of multiple matrix multiplication based on fully homomorphic encryption. Our work significantly improves the latest Mishra et al.'s work. We improve Mishra et al.'s matrix encoding method by introducing a column-order matrix encoding method which requires smaller parameter. This enables us to develop a binary multiplication method for multiple matrix multiplication, which multiplies pairwise two adjacent matrices in the tree structure instead of Mishra et al.'s sequential matrix multiplication from left to right. The binary multiplication method results in a logarithmic-depth circuit, thus is much more efficient than the sequential matrix multiplication method with linear-depth circuit. Experimental results show that for the product of ten 32×32 (64×64) square matrices our method takes only several thousand seconds while Mishra et al.'s method will take about tens of thousands of years which is astonishingly impractical. In addition, we further generalize our result from square matrix to non-square matrix. Experimental results show that the binary multiplication method and the classical dynamic programming method have a similar performance for ten non-square matrices multiplication.

Magneto-thermo-elastic response of a rotating functionally graded cylinder

  • Hosseini, Mohammad;Dini, Ali
    • Structural Engineering and Mechanics
    • /
    • v.56 no.1
    • /
    • pp.137-156
    • /
    • 2015
  • In this paper, an analytical solution of displacement, strain and stress field for rotating thick-walled cylinder made of functionally graded material subjected to the uniform external magnetic field and thermal field in plane strain state has been studied. Stress, strain and displacement field as a function of radial coordinates considering magneto-thermo-elasticity are derived analytically. According to the Maxwell electro-dynamic equations, Lorentz force in term of displacement is obtained in cylindrical coordinates. Also, symmetric temperature distribution along the thickness of hollow cylinder is obtained by solving Fourier heat transfer equation in cylindrical coordinates. Using equation of equilibrium and thermo-mechanical constitutive equations associated with Lorentz force, a second-order inhomogeneous differential equation in term of displacement is obtained and will be solved analytically. Except Poisson's ratio, other mechanical properties such as elasticity modulus, density, magnetic permeability coefficient, heat conduction coefficient and thermal expansion coefficient are assumed to vary through the thickness according to a power law. In results analysis, non-homogeneity parameter has been chosen arbitrary and inner and outer surface of cylinder are assumed to be rich metal and rich ceramic, respectively. The effect of rotation, thermal, magnetic field and non-homogeneity parameter of functionally graded material which indicates percentages of cylinder's constituents are studied on displacement, Von Mises equivalent stress and Von Mises equivalent strain fields.

An Efficient Architecture for Modified Karatsuba-Ofman Algorithm (불필요한 연산이 없는 카라슈바 알고리즘과 하드웨어 구조)

  • Chang Nam-Su;Kim Chang-Han
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.43 no.3 s.345
    • /
    • pp.33-39
    • /
    • 2006
  • In this paper we propose the Modified Karatsuba-Ofman algorithm for polynomial multiplication to polynomials of arbitrary degree. Leone proposed optimal stop condition for iteration of Karatsuba-Ofman algorithm(KO). In this paper, we propose a Non-Redundant Karatsuba-Ofman algorithm (NRKOA) with removing redundancy operations, and design a parallel hardware architecture based on the proposed algorithm. Comparing with existing related Karatsuba architectures with the same time complexity, the proposed architecture reduces the area complexity. Furthermore, the space complexity of the proposed multiplier is reduced by 43% in the best case.

Application of the Preliminary Displacement Principle to the Temper Rolling Model

  • Lee, Won-Ho;Yuli Liu
    • Journal of Mechanical Science and Technology
    • /
    • v.15 no.2
    • /
    • pp.225-231
    • /
    • 2001
  • A mathematical model for the analysis of roll gap phenomena in the strip temper rolling process is described. A new approach to solve the roll indentation and diverging problem in modeling of severe temper rolling cases is obtained by adopting the preliminary displacement principle of two contacted rough bodies to describe the friction behavior in the roll gap. The mechanical peculiarities of the temper rolling process, such as a high friction value with high roughness rolls and a non-circular contact arc, low reduction and non-negligible entry and exit elastic zones as well as central preliminary displacement zone etc., are all taken into account. The deformation of work rolls is calculated with the influence function method and an arbitrary contact are shape is permitted. The strip deformation is modeled by the slab method and the entry and exit elastic deformation zones are included. The preliminary displacement principle is used to determine the boundaries and to calculate the friction of the central preliminary displacement zone. The model is calibrated against the production mill data and installed in the setup computer of a temper rolling mill in POSCO. The validity and precision of the model have been proven through a comparison of the measured roll forces and the predicted ones.

  • PDF

WEAK AND STRONG CONVERGENCE TO COMMON FIXED POINTS OF NON-SELF NONEXPANSIVE MAPPINGS

  • Su, Yongfu;Qin, Xiaolong
    • Journal of applied mathematics & informatics
    • /
    • v.24 no.1_2
    • /
    • pp.437-448
    • /
    • 2007
  • Suppose K is a nonempty closed convex nonexpansive retract of a real uniformly convex Banach space E with P as a nonexpansive retraction. Let $T_1,\;T_2\;and\;T_3\;:\;K{\rightarrow}E$ be nonexpansive mappings with nonempty common fixed points set. Let $\{\alpha_n\},\;\{\beta_n\},\;\{\gamma_n\},\;\{\alpha'_n\},\;\{\beta'_n\},\;\{\gamma'_n\},\;\{\alpha'_n\},\;\{\beta'_n\}\;and\;\{\gamma'_n\}$ be real sequences in [0, 1] such that ${\alpha}_n+{\beta}_n+{\gamma}_n={\alpha}'_n+{\beta'_n+\gamma}'_n={\alpha}'_n+{\beta}'_n+{\gamma}'_n=1$, starting from arbitrary $x_1{\in}K$, define the sequence $\{x_n\}$ by $$\{zn=P({\alpha}'_nT_1x_n+{\beta}'_nx_n+{\gamma}'_nw_n)\;yn=P({\alpha}'_nT_2z_n+{\beta}'_nx_n+{\gamma}'_nv_n)\;x_{n+1}=P({\alpha}_nT_3y_n+{\beta}_nx_n+{\gamma}_nu_n)$$ with the restrictions $\sum^\infty_{n=1}{\gamma}_n<\infty,\;\sum^\infty_{n=1}{\gamma}'_n<\infty,\; \sum^\infty_{n=1}{\gamma}'_n<\infty$. (i) If the dual $E^*$ of E has the Kadec-Klee property, then weak convergence of a $\{x_n\}$ to some $x^*{\in}F(T_1){\cap}{F}(T_2){\cap}(T_3)$ is proved; (ii) If $T_1,\;T_2\;and\;T_3$ satisfy condition(A'), then strong convergence of $\{x_n\}$ to some $x^*{\in}F(T_1){\cap}{F}(T_2){\cap}(T_3)$ is obtained.

Capacity Bounds on the Ergodic Capacity of Distributed MIMO Systems over K Fading Channels

  • Li, XingWang;Wang, Junfeng;Li, Lihua;Cavalcante, Charles C.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.7
    • /
    • pp.2992-3009
    • /
    • 2016
  • The performance of D-MIMO systems is not only affected by multipath fading but also from shadowing fading, as well as path loss. In this paper, we investigate the ergodic capacity of D-MIMO systems operating in non-correlated K fading (Rayleigh/Gamma) channels. With the aid of majorization and Minkowski theory, we derive analytical closed-form expressions of the upper and lower bounds on the ergodic capacity for D-MIMO systems over non-correlated K fading channels, which are quite general and applicable for arbitrary signal-to-noise ratio (SNR) and the number of transceiver antennas. To intuitively reveal the impacts of system and fading parameters on the ergodic capacity, we deduce asymptotic approximations in the high and low SNR regimes. Finally, we pursue the massive MIMO systems analysis for the lower bound and derive closed-form expressions when the number of antennas at BS grows large, and when the number of antennas at transceivers becomes large with a fixed and finite ratio. It is demonstrated that the proposed expressions on the ergodic capacity accurately match with the theoretical analysis.