• Title/Summary/Keyword: x-monotone

Search Result 34, Processing Time 0.015 seconds

ON STEIN TRANSFORMATION IN SEMIDEFINITE LINEAR COMPLEMENTARITY PROBLEMS

  • Song, Yoon J.;Shin, Seon Ho
    • Journal of applied mathematics & informatics
    • /
    • v.32 no.1_2
    • /
    • pp.285-295
    • /
    • 2014
  • In the setting of semidenite linear complementarity problems on $S^n$, we focus on the Stein Transformation $S_A(X)\;:=X-AXA^T$, and show that $S_A$ is (strictly) monotone if and only if ${\nu}_r(UAU^T{\circ}\;UAU^T)$(<)${\leq}1$, for all orthogonal matrices U where ${\circ}$ is the Hadamard product and ${\nu}_r$ is the real numerical radius. In particular, we show that if ${\rho}(A)$ < 1 and ${\nu}_r(UAU^T{\circ}\;UAU^T){\leq}1$, then SDLCP($S_A$, Q) has a unique solution for all $Q{\in}S^n$. In an attempt to characterize the GUS-property of a nonmonotone $S_A$, we give an instance of a nonnormal $2{\times}2$ matrix A such that SDLCP($S_A$, Q) has a unique solution for Q either a diagonal or a symmetric positive or negative semidenite matrix. We show that this particular $S_A$ has the $P^{\prime}_2$-property.

CONVERGENCE OF NEWTON'S METHOD FOR SOLVING A NONLINEAR MATRIX EQUATION

  • Meng, Jie;Lee, Hyun-Jung;Kim, Hyun-Min
    • East Asian mathematical journal
    • /
    • v.32 no.1
    • /
    • pp.13-25
    • /
    • 2016
  • We consider the nonlinear matrix equation $X^p+AX^qB+CXD+E=0$, where p and q are positive integers, A, B and E are $n{\times}n$ nonnegative matrices, C and D are arbitrary $n{\times}n$ real matrices. A sufficient condition for the existence of the elementwise minimal nonnegative solution is derived. The monotone convergence of Newton's method for solving the equation is considered. Several numerical examples to show the efficiency of the proposed Newton's method are presented.

A study of the Clothes and Embroidery Design in the Fashion Collection - Focused on 2004~2008 Collection - (패션 컬렉션에 나타난 의복디자인 특성과 자수디자인 특성과의 관계 연구 - 2004년~2008년 중심으로 -)

  • Park, In-Jo;Lee, Kyoung-Hee
    • Fashion & Textile Research Journal
    • /
    • v.13 no.6
    • /
    • pp.838-847
    • /
    • 2011
  • The object of this study is as follows. First, according to the silhouette of clothes, I will search the relationship with the embroidery design. Second, I will investigate the relation of coloration about the clothes color and embroidery color. Third, I will search the relation with the image in clothes and embroidery design characteristic. The data acquisition is selected to the total 447 pictures of embroidery clothing design from the www.style.com, www.samsungdesign.net which are the related information site. The data are limited from S/S season in 2004 till F/W season in 2008 in the Paris, Milano, and New York collection. The analytical method was made through the analyze method and statistical method. First, on the relation with the clothes silhouette and embroidery design, if the satin stitch technique is utilized as the X-shaped or A-line silhouette in the one-piece and dress, the image which is elegant and feminine can be expressed. if the satin stitch technique is utilized as the H-line silhouette in jacket and court, the mannish image can be expressed. Second, the embroidery color showed up as the contrast combination of the monotone when the clothes color was the monochrome. And the embroidery color showed up as the tone in which is bright and sober when clothes color had 2 or 3 or 4. So, if the embroidery color is utilized as the similar color scheme, it will be effective. Third, if the embroidery technique of the one-piece and dress is utilized as the the satin stitch technique and the bloom and leaf motive being stylized pattern is used in the all-over and border pattern, It will be effective to express the romantic/feminine, ethnic/folklore, active, and classic image.

An Efficient Top-k Query Processing Algorithm over Encrypted Outsourced-Data in the Cloud (아웃소싱 암호화 데이터에 대한 효율적인 Top-k 질의 처리 알고리즘)

  • Kim, Jong Wook;Suh, Young-Kyoon
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.4 no.12
    • /
    • pp.543-548
    • /
    • 2015
  • Recently top-k query processing has been extremely important along with the explosion of data produced by a variety of applications. Top-k queries return the best k results ordered by a user-provided monotone scoring function. As cloud computing service has been getting more popular than ever, a hot attention has been paid to cloud-based data outsourcing in which clients' data are stored and managed by the cloud. The cloud-based data outsourcing, though, exposes a critical secuity concern of sensitive data, resulting in the misuse of unauthorized users. Hence it is essential to encrypt sensitive data before outsourcing the data to the cloud. However, there has been little attention to efficient top-k processing on the encrypted cloud data. In this paper we propose a novel top-k processing algorithm that can efficiently process a large amount of encrypted data in the cloud. The main idea of the algorithm is to prune unpromising intermediate results at the early phase without decrypting the encrypted data by leveraging an order-preserving encrypted technique. Experiment results show that the proposed top-k processing algorithm significantly reduces the overhead of client systems from 10X to 10000X.