• Title/Summary/Keyword: Matching cost

Search Result 391, Processing Time 0.026 seconds

Employees' Preferences on Various Types of Matching Grants (매칭그랜트 기부방식에 대한 기부자 선호도)

  • Lee, Yeong-Ran;Park, Sang-June
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.38 no.1
    • /
    • pp.15-27
    • /
    • 2013
  • Because consumers tend to have negative opinion about a company that neglects social issues like poverty or pollution while it focuses on its own profit, a lot of companies have invested their resources in Corporate Social Responsibility(CSR). CSR has merits of image improving and profit gaining, on the other hand, it has also many shortcomings. First, the cost of CSR may become a heavy financial burden. Specifically, CSR tends to be implemented by a company's unilateral backup, and then this may impose a heavy burden on the company. Second, one cannot expect effects of CSR in a short-term. Because of these shortcomings, the unilateral CSR has gone into alteration of the type of CSR since 1980's. Instead of unilaterality, Cause-Related Marketing(CRM) began to be used for mutual profits among company, consumers, and society. That is, CRM has become to be spotlighted as a new type of CSR. It focuses on partnership between a company and consumers based on cause and mutual profit pursuing through this partnership. So, many contemporary companies prefer CRM activities that derive their positive corporate image, that increase their sales, and that reduce their financial cost. The IBM Matching Grants Program, which is the largest of the IBM-Employee partnership programs, is a typical CRM. This program enables employees and retirees to increase the value of their donations to educational institutions, hospitals, hospices, nursing homes, and cultural & environmental organizations with a matching gift from IBM. Hundreds of educational institutions and thousands of nonprofit organizations have benefited from the contributions by IBM. There might be various types of matching grants. For example, an employee might choose a lump-sum expense or partitioning a lump-sum into a series of small ongoing expenses for his (or her) donation, and a firm might match the employee's total contribution with a lump-sum expense or might match the employee's total contribution with a series of small ongoing expenses. However, it is not easy to find an academic research on which type of matching grant is preferred by employees. This paper shows that an employee prefers the type of matching grants that consists of a lump-sum expense for his (or her) contribution and a series of small ongoing expenses for a firm's contribution [or the type of matching grants that consists of a series of small ongoing expenses for an employee's contribution and a lump-sum expense for a firm's contribution] to the other types of matching grants.

An Efficient Subsequence Matching Method Based on Index Interpolation (인덱스 보간법에 기반한 효율적인 서브시퀀스 매칭 기법)

  • Loh Woong-Kee;Kim Sang-Wook
    • The KIPS Transactions:PartD
    • /
    • v.12D no.3 s.99
    • /
    • pp.345-354
    • /
    • 2005
  • Subsequence matching is one of the most important operations in the field of data mining. The existing subsequence matching algorithms use only one index, and their performance gets worse as the difference between the length of a query sequence and the site of windows, which are subsequences of a same length extracted from data sequences to construct the index, increases. In this paper, we propose a new subsequence matching method based on index interpolation to overcome such a problem. An index interpolation method constructs two or more indexes, and performs search ing by selecting the most appropriate index among them according to the given query sequence length. In this paper, we first examine the performance trend with the difference between the query sequence length and the window size through preliminary experiments, and formulate a search cost model that reflects the distribution of query sequence lengths in the view point of the physical database design. Next, we propose a new subsequence matching method based on the index interpolation to improve search performance. We also present an algorithm based on the search cost formula mentioned above to construct optimal indexes to get better search performance. Finally, we verify the superiority of the proposed method through a series of experiments using real and synthesized data sets.

Intensity Based Stereo Matching Algorithm Including Boundary Information (경계선 영역 정보를 이용한 밝기값 기반 스테레오 정합)

  • Choi, Dong-Jun;Kim, Do-Hyun;Yang, Yeong-Yil
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.35S no.12
    • /
    • pp.84-92
    • /
    • 1998
  • In this paper, we propose the novel cost functions for finding the disparity between the left and the right images in the stereo matching problem. The dynamic programming method is used in solving the stereo matching problem by Cox et al[10]. In the reference[10], only the intensity of the pixels in the epipolar line is used as the cost functions to find the corresponding pixels. We propose the two new cost functions. The information of the slope of the pixel is introduced to the constraints in determining the weights of intensity and direction(the historical information). The pixels with the higher slope are matched mainly by the intensity of pixels. As the slope becomes lower, the matching is performed mainly by the direction. Secondly, the disparity information of the previous epipolar line the pixel is used to find the disparity of the current epipolar line. If the pixel in the left epipolar line, $p-i$ and the pixel in the right epipolar line, $p-j$ satisfy the following conditions, the higher matching probability is given to the pixels, $p-i$ and $p-j$. i) The pixels, $p-i$ and $p-j$ are the pixles on the edges in the left and the right images, respectively. ⅱ) For the pixels $p-k$ and $p-l$ in the previous epipolar line, $p-k$and $p-l$ are matched and are the pixels on the same edge with $p-i$ and $p-j$, respectively. The proposed method compared with the original method[10] finds the better matching results for the test images.

  • PDF

Motion estimation method using multiple linear regression model (다중선형회귀모델을 이용한 움직임 추정방법)

  • 김학수;임원택;이재철;이규원;박규택
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.34S no.10
    • /
    • pp.98-103
    • /
    • 1997
  • Given the small bit allocation for motion information in very low bit-rate coding, motion estimation using the block matching algorithm(BMA) fails to maintain an acceptable level of prediction errors. The reson is that the motion model, or spatial transformation, assumed in block matching cannot approximate the motion in the real world precisely with a small number of parameters. In order to overcome the drawback of the conventional block matching algorithm, several triangle-based methods which utilize triangular patches insead of blocks have been proposed. To estimate the motions of image sequences, these methods usually have been based on the combination of optical flow equation, affine transform, and iteration. But the compuataional cost of these methods is expensive. This paper presents a fast motion estimation algorithm using a multiple linear regression model to solve the defects of the BMA and the triange-based methods. After describing the basic 2-D triangle-based method, the details of the proposed multiple linear regression model are presented along with the motion estimation results from one standard video sequence, representative of MPEG-4 class A data. The simulationresuls show that in the proposed method, the average PSNR is improved about 1.24 dB in comparison with the BMA method, and the computational cost is reduced about 25% in comparison with the 2-D triangle-based method.

  • PDF

A New Block Matching Algorithm for Motion Estimation (움직임 추정을 위한 새로운 블록 정합 알고리즘)

  • Jung, Soo-Mok
    • Journal of Information Technology Services
    • /
    • v.2 no.2
    • /
    • pp.111-119
    • /
    • 2003
  • In this paper, an efficient block matching algorithm which is based on the Block Sum Pyramid Algorithm (BSPA) is presented. The cost of BSPA[1] was reduced in the proposed algorithm by using l2 norm and partial distortion elimination technique. Motion estimation accuracy of the proposed algorithm is equal to that of BSPA. The efficiency of the proposed algorithm was verified by experimental results.

A New Approach for Built-in Self-Test of 4.5 to 5.5 GHz Low-Noise Amplifiers

  • Ryu, Jee-Youl;Noh, Seok-Ho
    • ETRI Journal
    • /
    • v.28 no.3
    • /
    • pp.355-363
    • /
    • 2006
  • This paper presents a low-cost RF parameter estimation technique using a new RF built-in self-test (BIST) circuit and efficient DC measurement for 4.5 to 5.5 GHz low noise amplifiers (LNAs). The BIST circuit measures gain, noise figure, input impedance, and input return loss for an LNA. The BIST circuit is designed using $0.18\;{\mu}m$ SiGe technology. The test technique utilizes input impedance matching and output DC voltage measurements. The technique is simple and inexpensive.

  • PDF

A Study on Stereo Matching Algorithm using Disparity Space Image (시차공간영상을 이용한 스테레오 영상 정합에 관한 연구)

  • Lee, Jong-Min;Kim, Dae-Hyun;Choi, Jong-Soo
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.41 no.6
    • /
    • pp.9-18
    • /
    • 2004
  • This paper proposes a new and simple stereo matching algorithm using the disparity space image (DSI) technique. First of all, we detect some salient feature points on each scan-line of the image pair and set the matching area using those points and define a simple cost matrix. And we take advantage of matching by pixel-by-pixel instead of using the matching window. While the pixel-by-pixel method boost up the speed of matching, because of no using neighbor information, the correctness of the matching may not be better. To cover this point, we expand the matching path using character of disparity-space-image for using neighbor information. In addition, we devise the compensated matching module using the volume of the disparity space image in order to improve the accuracy of the match. Consequently, we can reduce mismatches at the disparity discontinuities and can obtain the more detailed and correct disparity map.

The Matching Principle, Earnings Persistence and Information Asymmetry (수익비용대응, 이익지속성 및 정보비대칭)

  • Lee, Kyu-Jin
    • The Journal of the Korea Contents Association
    • /
    • v.19 no.5
    • /
    • pp.280-286
    • /
    • 2019
  • This study first examines whether the matching principle reduces information asymmetry and verifies the effect on earnings sustainability and information asymmetry. In the presence of information asymmetry between managers and information users, managers can reduce information asymmetry by increasing the quality of earnings. Information asymmetry is measured by the financial analysts' earnings forecast variance. When we look at the results of previous studies, verify whether information asymmetry decreases as the response to the revenue cost increases and whether negative relationship between profit persistence and information asymmetry appears when the response to the revenue cost is high. As a result, firms with high revenue cost response showed a decrease in information asymmetry. The persistence of the earningss from the high earnings-cost response shows that the analysts' earnings forecast dispersion decreases. This means that the better the response to the revenue cost, the better the quality of the earnings and the less the information risk about the uncertainty of the enterprise. This study is different from the previous studies in that it analyzed whether the persistence of the earnings that responded to the high revenue cost reduces the information asymmetry. The results of this study suggest that managers can reduce the information asymmetry by carrying out appropriate revenue - cost responses, which provides important implications for stakeholders who use accounting earnings information.

A stereo matching algorithm in pixel-based disparity space image (화소기반 변이공간영상에서의 스테레오 정합)

  • 김철환;이호근;하영호
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.6C
    • /
    • pp.848-856
    • /
    • 2004
  • In this paper, a fast stereo matching algorithm based on pixel-wise matching strategy, which can get a stable and accurate disparity map, is proposed. Since a stereo image pair has small differences each other and the differences between left and right images are just caused by horizontal shifts with some order, the matching using a large window will not be needed within a given search range. However, disparity results of conventional pixel-based matching methods are somewhat unstable and wrinkled, the principal direction of disparities is checked by the accumulated cost along a path on array with the dynamic programming method. Experimental results showed that the proposed method could remove almost all disparity noise and set a good quality disparity map in very short time.

Draft Guideline Matching the Treatment Technology to the Soil Contaminated Site Based on the Site Properties in Korea (국내 부지 특성을 고려한 오염토양 정화기술매칭기준안)

  • Lee, Jae-young;Lee, Minhee;Yu, Mokryun
    • Journal of Soil and Groundwater Environment
    • /
    • v.21 no.6
    • /
    • pp.1-13
    • /
    • 2016
  • The programmable logic array to match the treatment technology to the soil contaminated site based on the site properties in Korea was developed. Based on the previous technology screening system of FRTR (Federal Remediation Technology Roundtable) in USA, total 9 evaluation factors indicating the site characteristics were used for the technology matching process and 8 factors among them were quantitatively weighed in the order of importance. The class interval for each evaluation factor was linearly distributed to give the weighed score and 8 scores were summed up to prioritize the treatment technology. The optimal treatment technology for a specific site was determined according to the total score acquired from 8 evaluation factors used in this technology matching process. The reliability test for the developed technology matching system was done by using information of two real cleanup sites in Korea, suggesting that this guideline will be available to determine the most effective treatment technology to cleanup the soil contaminated site and also to assist the government or the company to design a successful and cost-effective site cleanup plan in Korea.