1 / 18

Smart TV Search

Smart TV Search. Naver 연관 검색. 문제점 : 검색 키워드에서 직접적인 NER 매핑이 불가능. 마지막 회 , 첫 회. Input:. “ 시크릿 가든 , 10 회 ” 에 해당되는 NER 거쳐 나온 Ontology Instance. “ 시크릿 가든 ”,“ 마지막 ”,” 회 ” 라는 keywords. Constraint: 1<= x. 회 <=16. SWCL:. Goal: Maximize x. 회. Solver Output:. 제일 큰 회 ( 숫자 ). Output:.

walker-clay
Download Presentation

Smart TV Search

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Smart TV Search

  2. Naver연관 검색 • 문제점: 검색 키워드에서 직접적인 NER매핑이 불가능.

  3. 마지막 회, 첫 회 Input: “시크릿 가든, 10회”에 해당되는 NER거쳐 나온 Ontology Instance “시크릿 가든”,“마지막”,”회”라는 keywords Constraint: 1<= x.회<=16 SWCL: Goal: Maximize x.회 Solver Output: 제일 큰 회(숫자) Output: “시크릿 가든, 마지막 회”에 해당하는 Ontology Instance

  4. 다음 회 Goal: Minimize? Maximize?확장? • 할 일들(~10.20) • 간단한 테스트 온톨로지만듬 • Manchester Syntax Parsing부분(일부) • SWCL구성 • Solver • Solver Output가지고 해당 인스턴스return • 할 일들(10.20~)

  5. 온톨로지 TVProgram episodeOf hasEpisode TVEpisode episodeNum int

  6. 시크릿 가든 • hasEpisode 시크릿 가든1회 시크릿 가든2회 시크릿 가든3회 • episodeNum 1 2 3

  7. Virtual Enterprise

  8. Specific Requirement Example 1) • Customers’ requirements • Product : Personal Computer • BOM (Bill of Material) PC 1EA – consist of 2EA Memory 1EA CPU • Demand of PC 1st week : 50, 2nd week : 40, 3rd week : 55, 4th week : 60, 5th week : 50 Demand of Memory = Demand of PC X 2 Demand of CPU = Demand of PC • Capabilities of service and product providers • Vendor 1 (Memory) Goods in stock : 30 Capacity - 1st week : 70, 2nd week : 60, 3rd week : 60, 4th week : 40 Already accepted order - 1st week : 20, 3rd week : 10 Price – 50$/EA, Stock cost – 5$/EA 1). 2007,졸업논문 - 정균범

  9. Vendor 3 (CPU) Goods in stock : 70 Capacity – 1st week : 40, 2nd week : 70, 3rd week : 65, 4th week : 60 Already accepted order – 2nd week : 10, 4th week : 10 Price – 70$/EA, Stock cost – 5$/EA • Assembling company (Vendor 4) Spending time to assemble - 1 week Goods in stock : 10 Capacity - 1st week : 40, 2nd week : 50, 3rd week : 70, 4th week : 40, 5th week : 50 Already accepted order - 2nd week : 20, 3rd week : 10 Price – 30$/EA, Stock cost – 10$/EA

  10. VE Ontology

  11. VE Solution minimize 30*X11+40*X12+50*X13+60*X14+30*X22+40*X23+50*X24+30*X33+40*X34+30*X44+10*Y1+20*Y2+30*Y3+40*Y4 +50*A11+55*A12+60*A13+65*A14+50*A22+55*A23+60*A24+50*A33+55*A34+50*A44+5*Z1+10*Z2+15*Z3+20*Z4 +40*B11+50*B12+60*B13+70*B14+40*B22+50*B23+60*B24+40*B33+50*B34+40*B44+10*K1+20*K2+30*K3+40*K4 +70*C11+75*C12+80*C13+85*C14+70*C22+75*C23+80*C24+70*C33+75*C34+70*C44+5*P1+10*P2+15*P3+20*P4; subject to { // constraints for Vendor-4 X11+X12+X13+X14<=50; X22+X23+X24<=60; X33+X34<=65; X44<=50; Y1+Y2+Y3+Y4==10; X11+Y1>=50; X12+X22+Y2>=60; X13+X23+X33+Y3>=65; X14+X24+X34+X44+Y4>=60;

  12. // constraints for Vendor-1,2 A11+A12+A13+A14<=90; //90으로 했을때 솔루션 있음.. 80일때-나옴 A22+A23+A24<=40; A33+A34<=60; A44<=50; Z1+Z2+Z3+Z4==30; B11+B12+B13+B14<=50; B22+B23+B24<=40; B33+B34<=50; B44<=60; K1+K2+K3+K4==40; (A11+Z1-20)+(B11+K1-10)>=2*(X11+X12+X13+X14); (A12+A22+Z2)+(B12+B22+K2-10)>=2*(X22+X23+X24); (A13+A23+A33+Z3-10)+(B13+B23+B33+K3)>=2*(X33+X34); (A14+A24+A34+A44+Z4)+(B14+B24+B34+B44+K4)>=2*X44; // constraints for Vendor-3 C11+C12+C13+C14<=40; C22+C23+C24<=50; C33+C34<=65; C44<=60; P1+P2+P3+P4==50; C11+P1>=X11+X12+X13+X14; C12+C22+P2>=X22+X23+X24+10; C13+C23+C33>=X33+X34; C14+C24+C34+C44>=X44+10; }

  13. VE Ontology Schema Vendor hasInventory hasProduceWeek hasSpendWeek spendInventory ProduceWeek SpendWeek Inventory ownDemand hasAmount inventoryCost int produceCapability spend produce veDemand int int int int Supplying supplyAmount supplyCost InverseProperties: hasProduceWeekproduceWeekOf spendInventoryivSpentBy hasInventoryinventoryOf Produce producedBy Spend spentBy int int

  14. Constraints sharing among vendors Constraint-1: 매주 생산량은 매주 생산 가능한 량보다 적어야 한다 Constraint-2: 그 주의 요구량은 제공하는 량과 재고 중에서 쓴 량보다 적어야 한다.

  15. Constraints sharing among vendors Constraint-3: 매 Vendor가 가지고 있는 재고는 매주 쓴 재고량의 합과 같다. Constraint-4,5: Vendor1과 Vendor2 의 매주 소모량합, Vendor 3의 매주 소모량은 가상기업의 생산량보다 커야 한다.

  16. Goal Goal:모든 vendor에서 쓴 돈의 최저값 minimize

  17. Issues

  18. 코멘트: Des->Domain Des 한칸으로Des 선택 편집 Property_URI로 변수 이름 명명

More Related