• 제목/요약/키워드: Cherry-Picking

검색결과 6건 처리시간 0.019초

웹로그데이터를 이용한 유인가격전략의 효용성 차이 분석

  • 염대성;채명신
    • 한국경영정보학회:학술대회논문집
    • /
    • 한국경영정보학회 2007년도 International Conference
    • /
    • pp.168-173
    • /
    • 2007
  • 인터넷 쇼핑몰들은 저조한 수익성에도 불구하고 소비자를 끌어들여 매출을 증대시키기 위해 다양한 유인가격전략을 사용하고 있으나 이러한 유인전략이 과연 효용성이 있는가 하는 문제를 주제로 6 개 인터넷 쇼핑몰의 실제 web logdata 를 활용하여 소비자의 실제 쇼핑행동을 파악하여 유인가격전략의 효용성을 실증적으로 측정하였다. 방대한 클릭데이터를 효과적으로 정리하는 방법을 제시했고 인터넷 쇼핑몰 업체의 유인가격전략 수립에 대한 가이드를 제시하였다.

  • PDF

생식용 체리 비가림 재배시 서양뒤영벌(Bombus terrestris L.)의 화분매개 곤충 활용 (Utilization of Bombus terrestris as a Sweet Cherry Pollinator in Rain-sheltered Growing)

  • 곽용범;김홍림;최영하;이재한
    • 생물환경조절학회지
    • /
    • 제21권3호
    • /
    • pp.294-298
    • /
    • 2012
  • 체리의 경우 유과기나 과실수확기에 비가 잦을 경우 각종 곰팡이에 의한 과실썩음병과 열과가 발생하여 고품질의 과실을 생산하기 어렵다. 따라서 우리나라와 같이 장마기가 있는 기후조건에서는 농약살포 횟수를 줄이고 고품질의 과실을 안정적으로 생산하기 위해서는 반드시 비가림 시설재배가 필요하다. 국내에서 체리의 개화시기는 4월 상 중순으로 개화기 저온에 의해 자연상태의 꿀벌을 통한 화분매개는 결실율이 불안정하며, 봄철에는 화분매개용 꿀벌 봉군을 구입하기가 어렵다. 따라서 본 연구에서는 최근 시설재배 방울토마토, 애호박 등에서 화분매개용으로 많이 이용되고 있는 서양뒤영벌을 비가림 재배 조건에서 꿀벌을 대신하여 체리에 대한 화분매개 곤충으로 이용코자 하였다. 방화활동력은 서양뒤영벌의 경우 한 꽃에 약 6초 정도 머물러 분당 11개 정도의 꽃을 방문하였고, 꿀벌의 경우 한 꽃에 약 15초씩 머물러 분당 4~5개 정도의 꽃을 방문하였다. 또한 결실율과 과실특성에 있어 두 벌 처리구 간에 통계적인 유의성은 없었다. 따라서 비가림 체리 재배에서 개화기에 화분매개용으로 꿀벌을 대신하여 서양뒤영벌을 이용하더라도 어떠한 부정적인 영향은 없었다.

ANALYSIS OF NEIGHBOR-JOINING BASED ON BOX MODEL

  • Cho, Jin-Hwan;Joe, Do-Sang;Kim, Young-Rock
    • Journal of applied mathematics & informatics
    • /
    • 제25권1_2호
    • /
    • pp.455-470
    • /
    • 2007
  • In phylogenetic tree construction the neighbor-joining algorithm is the most well known method which constructs a trivalent tree from a pairwise distance data measured by DNA sequences. The core part of the algorithm is its cherry picking criterion based on the tree structure of each quartet. We give a generalized version of the criterion based on the exact box model of quartets, known as the tight span of a metric. We also show by experiment why neighbor-joining and the quartet consistency count method give similar performance.

Combining Vehicle Routing with Forwarding : Extension of the Vehicle Routing Problem by Different Types of Sub-contraction

  • Kopfer, Herbert;Wang, Xin
    • 대한산업공학회지
    • /
    • 제35권1호
    • /
    • pp.1-14
    • /
    • 2009
  • The efficiency of transportation requests fulfillment can be increased through extending the problem of vehicle routing and scheduling by the possibility of subcontracting a part of the requests to external carriers. This problem extension transforms the usual vehicle routing and scheduling problems to the more general integrated operational transportation problems. In this contribution, we analyze the motivation, the chances, the realization, and the challenges of the integrated operational planning and report on experiments for extending the plain Vehicle Routing Problem to a corresponding problem combining vehicle routing and request forwarding by means of different sub-contraction types. The extended problem is formalized as a mixed integer linear programming model and solved by a commercial mathematical programming solver. The computational results show tremendous costs savings even for small problem instances by allowing subcontracting. Additionally, the performed experiments for the operational transportation planning are used for an analysis of the decision on the optimal fleet size for own vehicles and regularly hired vehicles.

QUARTET CONSISTENCY COUNT METHOD FOR RECONSTRUCTING PHYLOGENETIC TREES

  • Cho, Jin-Hwan;Joe, Do-Sang;Kim, Young-Rock
    • 대한수학회논문집
    • /
    • 제25권1호
    • /
    • pp.149-160
    • /
    • 2010
  • Among the distance based algorithms in phylogenetic tree reconstruction, the neighbor-joining algorithm has been a widely used and effective method. We propose a new algorithm which counts the number of consistent quartets for cherry picking with tie breaking. We show that the success rate of the new algorithm is almost equal to that of neighbor-joining. This gives an explanation of the qualitative nature of neighbor-joining and that of dissimilarity maps from DNA sequence data. Moreover, the new algorithm always reconstructs correct trees from quartet consistent dissimilarity maps.

Does Loss-Leader Pricing Work in Online Shopping Malls?

  • Yeum Dai-Sung;Chae Myungsin;Kim Ji-Young
    • Management Science and Financial Engineering
    • /
    • 제11권3호
    • /
    • pp.95-107
    • /
    • 2005
  • As online shopping malls have emerged as a substantial shopping channel, they have used various sales promotion strategies to acquire new customers. Most of these strategies have been applied by offline malls for years. One, loss-leader pricing, is a type of promotional pricing in which stores sell well known products below their marginal cost, in order to attract customers and induce them to purchase more goods through impulse buying. This strategy is based on the expectation that customers will factor transaction costs into their purchasing decisions. However, its application to online malls fails to recognize that transaction costs are lower online, and that customers will behave differently as a result. Our study predicts that loss-leader pricing will not work online because online malls entail lower searching and moving costs than offline malls The study examines the effectiveness of loss-leader pricing with empirical data from a survey as well as log data from a Korean online shopping mall. The results show that while loss-leader pricing does attract customers to online shopping malls, it encourages cherry-picking rather than impulse purchases of regular-price goods.