• Title/Summary/Keyword: Object Name Service

Search Result 23, Processing Time 0.024 seconds

Method of extracting context from media data by using video sharing site

  • Kondoh, Satoshi;Ogawa, Takeshi
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2009.01a
    • /
    • pp.709-713
    • /
    • 2009
  • Recently, a lot of research that applies data acquired from devices such as cameras and RFIDs to context aware services is being performed in the field on Life-Log and the sensor network. A variety of analytical techniques has been proposed to recognize various information from the raw data because video and audio data include a larger volume of information than other sensor data. However, manually watching a huge amount of media data again has been necessary to create supervised data for the update of a class or the addition of a new class because these techniques generally use supervised learning. Therefore, the problem was that applications were able to use only recognition function based on fixed supervised data in most cases. Then, we proposed a method of acquiring supervised data from a video sharing site where users give comments on any video scene because those sites are remarkably popular and, therefore, many comments are generated. In the first step of this method, words with a high utility value are extracted by filtering the comment about the video. Second, the set of feature data in the time series is calculated by applying functions, which extract various feature data, to media data. Finally, our learning system calculates the correlation coefficient by using the above-mentioned two kinds of data, and the correlation coefficient is stored in the DB of the system. Various other applications contain a recognition function that is used to generate collective intelligence based on Web comments, by applying this correlation coefficient to new media data. In addition, flexible recognition that adjusts to a new object becomes possible by regularly acquiring and learning both media data and comments from a video sharing site while reducing work by manual operation. As a result, recognition of not only the name of the seen object but also indirect information, e.g. the impression or the action toward the object, was enabled.

  • PDF

Study on Fire Service Development of Fire Organization (소방조직의 업무영역개발에 관한 연구)

  • Kong, Ha-Sung;Lee, Woo-Seoung
    • Fire Science and Engineering
    • /
    • v.22 no.3
    • /
    • pp.172-180
    • /
    • 2008
  • Recently, diversification of social environment forces a fire administration new works. It is the development of Blue Ocean that a vision and substantive object the fire authority should pursuit. Now I recommend a variety of alternatives from the analysis of a survey of students who major in the fire or related fields, through the example of 120 service call program and police unit to discover new works. We should reclaim the name of department and promote life-contractive business with utilizing infra in the organization to get an remarkable success and reclaim Blue Ocean.

A Study on Service-based Secure Anonymization for Data Utility Enhancement (데이터 유용성 향상을 위한 서비스 기반의 안전한 익명화 기법 연구)

  • Hwang, Chikwang;Choe, Jongwon;Hong, Choong Seon
    • Journal of KIISE
    • /
    • v.42 no.5
    • /
    • pp.681-689
    • /
    • 2015
  • Personal information includes information about a living human individual. It is the information identifiable through name, resident registration number, and image, etc. Personal information which is collected by institutions can be wrongfully used, because it contains confidential information of an information object. In order to prevent this, a method is used to remove personal identification elements before distributing and sharing the data. However, even when the identifier such as the name and the resident registration number is removed or changed, personal information can be exposed in the case of a linking attack. This paper proposes a new anonymization technique to enhance data utility. To achieve this, attributes that are utilized in service tend to anonymize at a low level. In addition, the anonymization technique of the proposal can provide two or more anonymized data tables from one original data table without concern about a linking attack. We also verify our proposal by using the cooperative game theory.

Developing Tool of Distributed Application Program Based on Distributed Object Group Framework (분산객체그룹 프레임워크 기반 분산응용 프로그램 개발 도구)

  • Lim Jeong-Taek;Shin Chang-Sun;Joo Su-Chong
    • Journal of Internet Computing and Services
    • /
    • v.6 no.6
    • /
    • pp.71-83
    • /
    • 2005
  • In this paper, we developed the Distributed Programming Developing Tool(DPDT) which can make distributed application program efficiency based on the distributed object group framework supporting group management and dynamic binding for object resources requested from clients on distributed systems. The distributed object group framework we constructed provides not only the group register/withdraw, the access right and the name/property services for server objects from a point of view of group management services, but also dynamic binding, replicated object supporting, load balance, and federation among the object groups from a point of view of the supporting services of distributed application, When developing distributed application, by using our tool, server programming developer implements objects in each server system, next registers the properties to need for service provision to the object group. Client programming developer can also develop client program easily by obtaining the access right for the object or the object group and using the properties of objects with the access right permitted to the client. For providing above application developing environment in this paper. we described the definition of object group, the architecture of the distributed object group framework which our tool supports, and its functionalities, then specified the 3 GUI environments of DPDT implemented for providing efficient interfaces between the distributed object group and distributed applications. Finally, by using the DPDT, we showed the group register/withdraw and the access right grant procedure of objects which are server programs, the developing process of client program, and the executing results of the distributed application developed.

  • PDF

Determination of bearing type effect on elastomeric bearing selection with SREI-CAD

  • Atmaca, Barbaros;Ates, Sevket
    • Advances in Computational Design
    • /
    • v.2 no.1
    • /
    • pp.43-56
    • /
    • 2017
  • The aim of this paper is to develop software for designing of steel reinforced elastomeric isolator (SREI) according to American Association for State Highway and Transportation Officials Load and Resistance Factor Design (AASHTO LRFD) Specifications. SREI is used for almost all bridge types and special structures. SREI-structures interface defines support boundary conditions and may affect the seismic performance of bridges. Seismic performance of the bridge is also affected by geometrical and materials properties of SREI. The selection of SREI is complicated process includes satisfying all the design constraints arising from code provisions and maximizing performance at the lowest possible cost. In this paper, design stage of SREI is described up to AASHTO LRFD 2012. Up to AASHTO LRFD 2012 analysis and design program of SREI performed different geometrical and material properties are created with C# object-oriented language. SREI-CAD, name of the created software, allows an accurate design for economical estimation of a SREI in a short time. To determine types of SREI effects, two different types of bearings, rectangular and circular with similar materials and dimension properties are selected as an application. Designs of these SREIs are completed with SREI-CAD. It is seen that ensuring the stability of circular elastomer bearing at the service limit state is generally complicated than rectangular bearing.

A Study on Quantitative Modeling for EPCIS Event Data (EPCIS Event 데이터 크기의 정량적 모델링에 관한 연구)

  • Lee, Chang-Ho;Jho, Yong-Chul
    • Journal of the Korea Safety Management & Science
    • /
    • v.11 no.4
    • /
    • pp.221-228
    • /
    • 2009
  • Electronic Product Code Information Services(EPCIS) is an EPCglobal standard for sharing EPC related information between trading partners. EPCIS provides a new important capability to improve efficiency, security, and visibility in the global supply chain. EPCIS data are classified into two categories, master data (static data) and event data (dynamic data). Master data are static and constant for objects, for example, the name and code of product and the manufacturer, etc. Event data refer to things that happen dynamically with the passing of time, for example, the date of manufacture, the period and the route of circulation, the date of storage in warehouse, etc. There are four kinds of event data which are Object Event data, Aggregation Event data, Quantity Event data, and Transaction Event data. This thesis we propose an event-based data model for EPC Information Service repository in RFID based integrated logistics center. This data model can reduce the data volume and handle well all kinds of entity relationships. From the point of aspect of data quantity, we propose a formula model that can explain how many EPCIS events data are created per one business activity. Using this formula model, we can estimate the size of EPCIS events data of RFID based integrated logistics center for a one day under the assumed scenario.

Study on the Method of Building Library for Integrated Design in Construction (건설 통합 설계를 위한 라이브러리 구축 방법에 관한 연구)

  • Song, Choon-Dong;Jeon, Yoong-Il;Kim, Hual-Soo
    • Journal of The Korean Digital Architecture Interior Association
    • /
    • v.2 no.1
    • /
    • pp.16-23
    • /
    • 2002
  • The Subject of this research is building integrated library to supported to CAAD of the A.E.C field that is oriented to the environment of integrated design. In this research, we design and implement a new library model as a solution of design-data sharing and multi-displaying that is on the rise among many problems in construction integration. We name this integrated library ACO(Actual Component Object) and using the ACO, we can share data without loss in the fields such as construction, estimation, structure. Together with this, the different expressions along each field provide the solution of sharing both graphic data and non-graphic data. This ACO is a newly conceptualized Library that is able to supply a composite structure to an architect(designer) through the internet-based ACO System. To the ACO System that supplies those ACO service, we introduce the concept of DBMS in design and design administrator, and we investigate the solutions that enable an architect to use this ACO directly on the Web.

  • PDF

ARCHIVE OF BOHYUNSAN OPTICAL ASTRONOMY OBSERVATORY(BOAO) ASTRONOMICAL DATA (보현산천문대 관측자료 Archive 시스템 설계 및 구축)

  • Sung, Hyun-Il;Kim, Sang-Chul;Nam, Hyun-Woong;Kim, Bong-Gyu;Yim, In-Sung
    • Publications of The Korean Astronomical Society
    • /
    • v.18 no.1
    • /
    • pp.43-49
    • /
    • 2003
  • Korean Astronomical Data Center (KADC, http://kadc.kao.re.kr) in Korea Astronomy Observatory (KAO) has constructed an archive of Bohyunsan Optical Astronomy Observatory (BOAO) 1.8m telescope data. The archive is consisted of photometric (1KCCD, 2KCCD) and spectroscopic data of 400GB amount for the period of 1997 to 2002,and the first web service is made of the data from 1997 to 2001. In the search page, primary search criterion of object name or coordinates is used. Users can also refine the search criteria using parameters such as observation date, observer(s), data type, and/or instrument. The data identified from the search can be uploaded to the FTP site for further downloading in FITS format. This archive is the first DB of astronomical data made in Korea.

Collaboration and Node Migration Method of Multi-Agent Using Metadata of Naming-Agent (네이밍 에이전트의 메타데이터를 이용한 멀티 에이전트의 협력 및 노드 이주 기법)

  • Kim, Kwang-Jong;Lee, Yon-Sik
    • The KIPS Transactions:PartD
    • /
    • v.11D no.1
    • /
    • pp.105-114
    • /
    • 2004
  • In this paper, we propose a collaboration method of diverse agents each others in multi-agent model and describe a node migration algorithm of Mobile-Agent (MA) using by the metadata of Naming-Agent (NA). Collaboration work of multi-agent assures stability of agent system and provides reliability of information retrieval on the distributed environment. NA, an important part of multi-agent, identifies each agents and series the unique name of each agents, and each agent references the specified object using by its name. Also, NA integrates and manages naming service by agents classification such as Client-Push-Agent (CPA), Server-Push-Agent (SPA), and System-Monitoring-Agent (SMA) based on its characteristic. And, NA provides the location list of mobile nodes to specified MA. Therefore, when MA does move through the nodes, it is needed to improve the efficiency of node migration by specified priority according to hit_count, hit_ratio, node processing and network traffic time. Therefore, in this paper, for the integrated naming service, we design Naming Agent and show the structure of metadata which constructed with fields such as hit_count, hit_ratio, total_count of documents, and so on. And, this paper presents the flow of creation and updating of metadata and the method of node migration with hit_count through the collaboration of multi-agent.

Personalized Recommendation System for IPTV using Ontology and K-medoids (IPTV환경에서 온톨로지와 k-medoids기법을 이용한 개인화 시스템)

  • Yun, Byeong-Dae;Kim, Jong-Woo;Cho, Yong-Seok;Kang, Sang-Gil
    • Journal of Intelligence and Information Systems
    • /
    • v.16 no.3
    • /
    • pp.147-161
    • /
    • 2010
  • As broadcasting and communication are converged recently, communication is jointed to TV. TV viewing has brought about many changes. The IPTV (Internet Protocol Television) provides information service, movie contents, broadcast, etc. through internet with live programs + VOD (Video on demand) jointed. Using communication network, it becomes an issue of new business. In addition, new technical issues have been created by imaging technology for the service, networking technology without video cuts, security technologies to protect copyright, etc. Through this IPTV network, users can watch their desired programs when they want. However, IPTV has difficulties in search approach, menu approach, or finding programs. Menu approach spends a lot of time in approaching programs desired. Search approach can't be found when title, genre, name of actors, etc. are not known. In addition, inserting letters through remote control have problems. However, the bigger problem is that many times users are not usually ware of the services they use. Thus, to resolve difficulties when selecting VOD service in IPTV, a personalized service is recommended, which enhance users' satisfaction and use your time, efficiently. This paper provides appropriate programs which are fit to individuals not to save time in order to solve IPTV's shortcomings through filtering and recommendation-related system. The proposed recommendation system collects TV program information, the user's preferred program genres and detailed genre, channel, watching program, and information on viewing time based on individual records of watching IPTV. To look for these kinds of similarities, similarities can be compared by using ontology for TV programs. The reason to use these is because the distance of program can be measured by the similarity comparison. TV program ontology we are using is one extracted from TV-Anytime metadata which represents semantic nature. Also, ontology expresses the contents and features in figures. Through world net, vocabulary similarity is determined. All the words described on the programs are expanded into upper and lower classes for word similarity decision. The average of described key words was measured. The criterion of distance calculated ties similar programs through K-medoids dividing method. K-medoids dividing method is a dividing way to divide classified groups into ones with similar characteristics. This K-medoids method sets K-unit representative objects. Here, distance from representative object sets temporary distance and colonize it. Through algorithm, when the initial n-unit objects are tried to be divided into K-units. The optimal object must be found through repeated trials after selecting representative object temporarily. Through this course, similar programs must be colonized. Selecting programs through group analysis, weight should be given to the recommendation. The way to provide weight with recommendation is as the follows. When each group recommends programs, similar programs near representative objects will be recommended to users. The formula to calculate the distance is same as measure similar distance. It will be a basic figure which determines the rankings of recommended programs. Weight is used to calculate the number of watching lists. As the more programs are, the higher weight will be loaded. This is defined as cluster weight. Through this, sub-TV programs which are representative of the groups must be selected. The final TV programs ranks must be determined. However, the group-representative TV programs include errors. Therefore, weights must be added to TV program viewing preference. They must determine the finalranks.Based on this, our customers prefer proposed to recommend contents. So, based on the proposed method this paper suggested, experiment was carried out in controlled environment. Through experiment, the superiority of the proposed method is shown, compared to existing ways.