• Journal of the Korean Society of Costume
• /
• v.55 no.8 s.99
• /
• pp.15-29
• /
• 2005

In these days, T-shirt is not only the simple wearing goods but also the suggestive communication, which is not showed outward as well as being intended. Also, it indicates expression of contemporary sensitive living, expression of substantial oneself, and the effective commercial promotion fer advertising fashion brand and promoting the object's sale. Following the above concept, the aim of this study is to understand the outstanding tendency of ' The T-shirt one-point graphic's functions and visual image ', which is appeared after 2001 in the fashion industry's commercial aspects. The visual image's applicative rate of the T-shirt one point graphic is the following; The best applicative rate on T-shirt one- point graphic is the visual image using the mix & match technique shown 42.8 percent applicative rate. The second one is the visual image using the typography shown 38.7 percent. The third one is the visual image using the animals and plants shown 8.5 percent. The fourth one is the visual image using the person's character shown 3.8 percent. The fifth one is the visual image using the geometry shown 2.4 percent. The least one is the visual image using the cartoon character shown 1.6 percent. On the other hand, another important function of t-shirt one-point graphic is the following; 1, The essential function as t-shirt design factor. 2, The promotional function as brand image marketing and brand advertisement. 3. The communicative function as discriminative strategy of object. 4. The achievable function as value added goods.

• Journal of Internet Computing and Services
• /
• v.10 no.4
• /
• pp.115-126
• /
• 2009

A software size estimation has to be analyzed in the beginning of the software life-cycle and helpful to the prediction of its size and cost. The software cost has been calculated by estimating software size from the user's point of view since the function point method based on international standards was introduced for the estimation of software size in 2004. However, the current function point method is not easy to be exploited for unfamiliar user, and has a problem that it cannot estimate the proper size for software such as engineering software, scientific calculations and simulation with complicated internal computational logic. This paper presents an improved model which can simplify the existing function point measurement procedure, and perform the estimation of software size in easy and fast way at the initial stage of project. Moreover, it presents a mathematical weighted value calculation model which can solve the problem of the fixed complexity weighted value and reflect the characteristics of organization as its data is pilled up. Our evaluation shows that the presented model has advantage that it can measure the size more rapidly than the existing FPA methods and has more correlation with LOC.

• The Journal of Society for e-Business Studies
• /
• v.14 no.3
• /
• pp.153-168
• /
• 2009

Many companies and governments perform information technology (IT) projections repeatedly for higher competitiveness and efficiency. Moreover, as the sizes of IT projects increase, the manpower and cost estimation of the projects are getting more important. In this research, we present a size estimation method of information system development projects on the basis of the function point method at the stage of information strategy planning(ISP), and illustrate the size calculation of an example IT project. According to the method, we first identify the types of projects, the scope and boundaries of size estimation, then count data and transaction functions from the artifacts of the ISP project. The unadjusted function points are adjusted to function point by the table of the Early Function Point. The way of calculating the sizes of IT projects will support successful IT projects by estimating reasonable manpower and cost for the projects.

• Bulletin of the Korean Mathematical Society
• /
• v.49 no.4
• /
• pp.749-759
• /
• 2012

A globally convergent algorithm for solving equilibrium problems is proposed. The algorithm is based on a proximal point algorithm (shortly (PPA)) with a positive definite matrix M which is not necessarily symmetric. The proximal function in existing (PPA) usually is the gradient of a quadratic function, namely, ${\nabla}({\parallel}x{\parallel}^2_M)$. This leads to a proximal point-type algorithm. We first solve pseudomonotone equilibrium problems without Lipschitzian assumption and prove the convergence of algorithms. Next, we couple this technique with the Banach contraction method for multivalued variational inequalities. Finally some computational results are given.

• Journal of the Korean Statistical Society
• /
• v.25 no.4
• /
• pp.471-487
• /
• 1996

In this paper we propose an efficient scoring type one-step GM-estimator, which has a bounded influence function and a high break-down point. The main point of the estimator is in the weighting scheme of the GM-estimator. The weight function we used depends on both leverage points and residuals So we construct an estimator which does not downweight good leverage points Unider some regularity conditions, we compute the finite-sample breakdown point and prove asymptotic normality Some simulation results are also presented.

• The Pure and Applied Mathematics
• /
• v.7 no.1
• /
• pp.61-69
• /
• 2000

Let($X^{\ast},\tau^{\ast}$) be the space with one point Lindeloffication topology of space (X,$\tau$). This paper offers the definition of the space with one point Lin-deloffication topology of a topological space and proves that the retraction regu-lar closed function f: $K^{\ast}(X^{\ast}$) defined f($A^{\ast})=A^{\ast}$ if p $\in A^{\ast}$ or ($f(A^{\ast})=A^{\ast}-{p}$ if $p \in A^{\ast}$ is a homomorphism. There are two examples in this paper to show that the retraction regular closed function f is neither a surjection nor an injection.

• Journal of applied mathematics & informatics
• /
• v.27 no.5_6
• /
• pp.981-1000
• /
• 2009

This paper considers asset liability management problems when their deterministic equivalent formulations are general nonlinear optimization problems. The presented approach uses a nonmonotone trust region strategy for solving a sequence of unconstrained subproblems parameterized by a scalar parameter. The objective function of each unconstrained subproblem is an augmented penalty-barrier function that involves both primal and dual variables. Each subproblem is solved approximately. The algorithm does not restrict a monotonic decrease of the objective function value at each iteration. If a trial step is not accepted, the algorithm performs a non monotone line search to find a new acceptable point instead of resolving the subproblem. We prove that the algorithm globally converges to a point satisfying the second-order necessary optimality conditions.

• Nonlinear Functional Analysis and Applications
• /
• v.26 no.1
• /
• pp.137-155
• /
• 2021

In this paper, first, we prove some common fixed point theorems for the generalized contraction condition under newly defined modified simulation function which generalize and include many results in the literature. Second, we give two numerical examples with graphical representations for verifying the proposed results. Third, we discuss and study a set of common fixed point theorems for two pairs (finite families) of self-mappings. Finally, we give some applications of our results in discrete and functional fractional economic systems.

• International Journal of Computer Science & Network Security
• /
• v.23 no.6
• /
• pp.84-90
• /
• 2023

In this article the problem of computing floating-point reciprocal cube root functions is considered. Our new algorithms for this task decrease the number of arithmetic operations used for computing $1/{\sqrt[3]{x}}$. A new approach for selection of magic constants is presented in order to minimize the computation time for reciprocal cube roots of arguments with movable decimal point. The underlying theory enables partitioning of the base argument range x∈[1,8) into 3 segments, what in turn increases accuracy of initial function approximation and decreases the number of iterations to one. Three best algorithms were implemented and carefully tested on 32-bit microcontroller with ARM core. Their custom C implementations were favourable compared with the algorithm based on cbrtf(x) function taken from C ＜math.h＞ library on three different hardware platforms. As a result, the new fast approximation algorithm for the function $1/{\sqrt[3]{x}}$ was determined that outperforms all other algorithms in terms of computation time and cycle count.

• Nonlinear Functional Analysis and Applications
• /
• v.29 no.2
• /
• pp.559-580
• /
• 2024

In this paper, we aim to prove coupled and common coupled fixed point theorems for contractive type conditions in the context of partial metric spaces by means of a control function, and to provide some corollaries of the established results. This paper presents a number of results that generalize and extend previous work in the field. In order to better illustrate the process, we provide examples.