• Title/Summary/Keyword: Heterogeneous Information Systems

Search Result 750, Processing Time 0.026 seconds

Event Cognition-based Daily Activity Prediction Using Wearable Sensors (웨어러블 센서를 이용한 사건인지 기반 일상 활동 예측)

  • Lee, Chung-Yeon;Kwak, Dong Hyun;Lee, Beom-Jin;Zhang, Byoung-Tak
    • Journal of KIISE
    • /
    • v.43 no.7
    • /
    • pp.781-785
    • /
    • 2016
  • Learning from human behaviors in the real world is essential for human-aware intelligent systems such as smart assistants and autonomous robots. Most of research focuses on correlations between sensory patterns and a label for each activity. However, human activity is a combination of several event contexts and is a narrative story in and of itself. We propose a novel approach of human activity prediction based on event cognition. Egocentric multi-sensor data are collected from an individual's daily life by using a wearable device and smartphone. Event contexts about location, scene and activities are then recognized, and finally the users" daily activities are predicted from a decision rule based on the event contexts. The proposed method has been evaluated on a wearable sensor data collected from the real world over 2 weeks by 2 people. Experimental results showed improved recognition accuracies when using the proposed method comparing to results directly using sensory features.

Ovarian Papillary Adenocarcinoma in a Yorkshire Terrier Dog (요크셔테리어에서 발생한 난소 유두모양샘암종)

  • Cho, Sue-Kyung;Kang, Byeong-Teck;Park, Chul;Yoo, Jong-Hyun;Jung, Dong-In;Lim, Chae-Young;Lee, Jong-Hwan;Woo, Eung-Je;Park, Hee-Myung
    • Journal of Veterinary Clinics
    • /
    • v.24 no.2
    • /
    • pp.251-254
    • /
    • 2007
  • A 10-year-old intact female Yorkshire terrier dog was referred for evaluation of marked abdominal distension and hemorrhagic effusion. Abdominal radiography and ultrasonography demonstrated abdominal effusion and intraabdominal mass with anechoic cystic components. On ascites cytology, neoplastic epithelial cells with vacuolated cytoplasm and prominent nucleoli were identified. Magnetic resonance imaging (MRI) showed the well-defined, heterogeneous, and large mass filled the intraabdominal cavity. At necropsy, a large mass arising from the right ovary was observed. Histopathologically, the mass was composed of papillary structures lined by neoplastic epithelial cells. The dog was definitively diagnosed as malignant ovarian adenocarcinoma with papillary pattern based on clinical and histopathological findings.

Improved Task Scheduling Algorithm Considering the Successive Communication Features of Heterogeneous Message-passing System (메시지 패싱 시스템의 통신 특성을 고려한 개선된 태스크 스케줄링 기법)

  • 노두호;김성천
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.31 no.5_6
    • /
    • pp.347-352
    • /
    • 2004
  • This thesis deals with a task scheduling on a message-passing system. Scheduling and allocation are very important issues since the inappropriate scheduling of tasks cannot exploit the true potential of the system and it can offset the grain from parallelization. It is difficult to apply previous schemes to message-passing system, because previous schemes assume the shared memory system. This thesis proposes an modified priority function and processor selection technique that consider the problems caused by the difference between previous models and message-passing environments. The priority function includes the cumulative communication cost which causes task execution to be delayed. The processor selection technique avoids the situation that a child task is assigned to the same Processor allocated to its parent task that has other unscheduled child tasks. We showed by some simulations that our modified features of task scheduling algorithm can make the better scheduling results than the previous algorithms.

QARA: Quality-Aware Rate Adaptation for Scalable Video Multicast in Multi-Rate Wireless LANs (다중 전송율 무선랜에서의 스케일러블 비디오 멀티캐스트를 위한 품질 기반 전송 속도 적응 기법)

  • Park, Gwangwoo;Jang, Insun;Pack, Sangheon
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.1 no.1
    • /
    • pp.29-34
    • /
    • 2012
  • Wireless multicast service can be used for video streaming service to save the network resources by sending the same popular multimedia contents to a group of users at once. For better multimedia streaming multicast service, we propose a quality-aware rate adaptation (QARA) scheme for scalable video multicast in rate adaptive wireless networks. In QARA, transmission rate is determined depending on the content's type and users' channel conditions. First, the base layer is transmitted by a low rate for high reliability. That means we provide basic service quality to all users. On the contrary, the transmission rate for enhancement layer is adapted by using channel condition feedback from a randomly selected node. So, the enhancement layer frames in a multimedia content is sent with various transmission rates. Therefore, each node can be provided with differentiated quality services. Consequently, QARA is capable of serving heterogeneous population of mobile nodes. Moreover, it can utilize network resources more efficiently. Our simulation results show that QARA outperforms utilization of the available transmission rate and reduces the data transmission time.

Edge Caching Strategy with User Mobility in Heterogeneous Cellular Network Environments (이종 셀룰러 네트워크 환경에서 사용자 이동성을 고려한 엣지 캐싱 기법)

  • Choi, Yoonjeong;Lim, Yujin
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.11 no.2
    • /
    • pp.43-50
    • /
    • 2022
  • As the use of mobile data increases, the proportion of video content is increasing steeply. In order to solve problems that arise when mobile users receive data from geographically remote cloud servers, methods of caching data in advance to edge servers geographically close to the users are attracting lots of attention. In this paper, we present a caching policy that stores data on Small Cell Base Station(SBS) to effectively provide content files to mobile users by applying a delayed offloading scheme in a cellular network. The goal of the proposed policy is to minimize the size of data transmitted from Macro Base Station(MBS) because the delayed offloading scheme requires more cost than when downloaded from MBS than from SBS. The caching policy is proposed to determine the size of content file and which content file to be cached to SBS using the probability of mobile users' paths and the popularity of content files, and to replace content files in consideration of the overlapping coverage of SBS. In addition, through performance evaluation, it has been proven that the proposed policy reduces the size of data downloaded from MBS compared to other algorithms.

A Dynamic Orchestration Framework for Supporting Sustainable Services in IT Ecosystem (IT 생태계의 지속적인 운영을 위한 동적 오케스트레이션 프레임워크)

  • Park, Soo Jin
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.6 no.12
    • /
    • pp.549-564
    • /
    • 2017
  • Not only services that are provided by a single system have been various with the development of the Internet of Things and autonomous software but also new services that are not possible before are provided through collaboration between systems. The collaboration between autonomous systems is similar to the ecosystem configuration in terms of biological viewpoints. Thus, it is called the IT Ecosystem, and this concept has arisen newly in recent years. The IT Ecosystem refers to a concept that achieves a mission of each of a number of heterogeneous systems rather than a single system utilizing their own autonomy as well as achieving the objectives of the overall system simultaneously in order to meet a single common goal. In our previous study, we proposed architecture of elementary level and as well as basic several meta-models to implement the IT Ecosystem. This paper proposes comprehensive reference architecture framework to implement the IT Ecosystem by cleansing the previous study. Among them, a utility function based on cost-benefit model is proposed to solve the dynamic re-configuration problem of system components. Furthermore, a measure of using genetic algorithm is proposed as a solution to reduce the dynamic re-configuration overhead that is increased exponentially according to the expansion of the number of entities of components in the IT Ecosystem. Finally, the utilization of the proposed orchestration framework is verified quantitatively through probable case studies on IT Ecosystem for unmanned forestry management.

Metadata Ontology Design for B2B Business Process Registries (기업간 비즈니스 프로세스 등록저장소를 위한 메타데이터 온톨로지 설계)

  • Kim, Jong-Woo;Kim, Hyoung-Do;Yun, Jung-Hee;Jung, Hyun-Chul
    • The KIPS Transactions:PartD
    • /
    • v.14D no.4 s.114
    • /
    • pp.435-446
    • /
    • 2007
  • B2B registries are information systems to register B2B related business information such as companies' profiles, business documents, business processes, and services and to provide query facilities to find information about potential business partners. Focusing on the design of the registry for B2B business processes, in this paper, a metadata ontology is designed to register B2B business processes. In practice, there are several competitive business process definition languages such as ebXML BPSS (Business Process Specification Schema), WSBPEL (Web Service Business Process Execution Language), BPMN (Business Process Modeling Notation), and so on. In order to register heterogeneous business processes based on different representation frameworks, the proposed metadata ontology consists of three layers, common metadata, language-specific metadata, and interrelationship metadata. To show the usefulness of the proposed metadata ontology, two examples which are represented by ebXML BPSS and WSBPEL respectively are described in order to show how the proposed metadata ontology is used to registry B2B business processes. To implement the proposed metadata ontology using ebXML registry, metadata mapping scheme to ebRIM (ebXML Registry Information Model) is also suggested.

Representation and Reasoning of User Context Using Fuzzy OWL (Fuzzy OWL을 이용한 사용자 Context의 표현 및 추론)

  • Sohn, Jong-Soo; Chung, In-Jeong
    • Journal of Intelligence and Information Systems
    • /
    • v.14 no.1
    • /
    • pp.35-45
    • /
    • 2008
  • In order to constructan ubiquitous computing environment, it is necessary to develop a technology that can recognize users and circumstances. In this regard, the question of recognizing and expressing user Context regardless of computer and language types has emerged as an important task under the heterogeneous distributed processing system. As a means to solve this task of representing user Context in the ubiquitous environment, this paper proposes to describe user Context as the most similar form of human thinking by using semantic web and fuzzy concept independentof language and computer types. Because the conventional method of representing Context using an usual collection has some limitations in expressing the environment of the real world, this paper has chosen to use Fuzzy OWL language, a fusion of fuzzy concept and standard web ontology language OWL. Accordingly, this paper suggests the following method. First we represent user contacted environmental information with a numerical value and states, and describe it with OWL. After that we transform the converted OWL Context into Fuzzy OWL. As a last step, we prove whether the automatic circumstances are possible in this procedure when we use fuzzy inference engine FiRE. With use the suggested method in this paper, we can describe Context which can be used in the ubiquitous computing environment. This method is more effective in expressing degree and status of the Context due to using fuzzy concept. Moreover, on the basis of the stated Context we can also infer the user contacted status of the environment. It is also possible to enable this system to function automatically in compliance with the inferred state.

  • PDF

A Folksonomy Ranking Framework: A Semantic Graph-based Approach (폭소노미 사이트를 위한 랭킹 프레임워크 설계: 시맨틱 그래프기반 접근)

  • Park, Hyun-Jung;Rho, Sang-Kyu
    • Asia pacific journal of information systems
    • /
    • v.21 no.2
    • /
    • pp.89-116
    • /
    • 2011
  • In collaborative tagging systems such as Delicious.com and Flickr.com, users assign keywords or tags to their uploaded resources, such as bookmarks and pictures, for their future use or sharing purposes. The collection of resources and tags generated by a user is called a personomy, and the collection of all personomies constitutes the folksonomy. The most significant need of the folksonomy users Is to efficiently find useful resources or experts on specific topics. An excellent ranking algorithm would assign higher ranking to more useful resources or experts. What resources are considered useful In a folksonomic system? Does a standard superior to frequency or freshness exist? The resource recommended by more users with mere expertise should be worthy of attention. This ranking paradigm can be implemented through a graph-based ranking algorithm. Two well-known representatives of such a paradigm are Page Rank by Google and HITS(Hypertext Induced Topic Selection) by Kleinberg. Both Page Rank and HITS assign a higher evaluation score to pages linked to more higher-scored pages. HITS differs from PageRank in that it utilizes two kinds of scores: authority and hub scores. The ranking objects of these pages are limited to Web pages, whereas the ranking objects of a folksonomic system are somewhat heterogeneous(i.e., users, resources, and tags). Therefore, uniform application of the voting notion of PageRank and HITS based on the links to a folksonomy would be unreasonable, In a folksonomic system, each link corresponding to a property can have an opposite direction, depending on whether the property is an active or a passive voice. The current research stems from the Idea that a graph-based ranking algorithm could be applied to the folksonomic system using the concept of mutual Interactions between entitles, rather than the voting notion of PageRank or HITS. The concept of mutual interactions, proposed for ranking the Semantic Web resources, enables the calculation of importance scores of various resources unaffected by link directions. The weights of a property representing the mutual interaction between classes are assigned depending on the relative significance of the property to the resource importance of each class. This class-oriented approach is based on the fact that, in the Semantic Web, there are many heterogeneous classes; thus, applying a different appraisal standard for each class is more reasonable. This is similar to the evaluation method of humans, where different items are assigned specific weights, which are then summed up to determine the weighted average. We can check for missing properties more easily with this approach than with other predicate-oriented approaches. A user of a tagging system usually assigns more than one tags to the same resource, and there can be more than one tags with the same subjectivity and objectivity. In the case that many users assign similar tags to the same resource, grading the users differently depending on the assignment order becomes necessary. This idea comes from the studies in psychology wherein expertise involves the ability to select the most relevant information for achieving a goal. An expert should be someone who not only has a large collection of documents annotated with a particular tag, but also tends to add documents of high quality to his/her collections. Such documents are identified by the number, as well as the expertise, of users who have the same documents in their collections. In other words, there is a relationship of mutual reinforcement between the expertise of a user and the quality of a document. In addition, there is a need to rank entities related more closely to a certain entity. Considering the property of social media that ensures the popularity of a topic is temporary, recent data should have more weight than old data. We propose a comprehensive folksonomy ranking framework in which all these considerations are dealt with and that can be easily customized to each folksonomy site for ranking purposes. To examine the validity of our ranking algorithm and show the mechanism of adjusting property, time, and expertise weights, we first use a dataset designed for analyzing the effect of each ranking factor independently. We then show the ranking results of a real folksonomy site, with the ranking factors combined. Because the ground truth of a given dataset is not known when it comes to ranking, we inject simulated data whose ranking results can be predicted into the real dataset and compare the ranking results of our algorithm with that of a previous HITS-based algorithm. Our semantic ranking algorithm based on the concept of mutual interaction seems to be preferable to the HITS-based algorithm as a flexible folksonomy ranking framework. Some concrete points of difference are as follows. First, with the time concept applied to the property weights, our algorithm shows superior performance in lowering the scores of older data and raising the scores of newer data. Second, applying the time concept to the expertise weights, as well as to the property weights, our algorithm controls the conflicting influence of expertise weights and enhances overall consistency of time-valued ranking. The expertise weights of the previous study can act as an obstacle to the time-valued ranking because the number of followers increases as time goes on. Third, many new properties and classes can be included in our framework. The previous HITS-based algorithm, based on the voting notion, loses ground in the situation where the domain consists of more than two classes, or where other important properties, such as "sent through twitter" or "registered as a friend," are added to the domain. Forth, there is a big difference in the calculation time and memory use between the two kinds of algorithms. While the matrix multiplication of two matrices, has to be executed twice for the previous HITS-based algorithm, this is unnecessary with our algorithm. In our ranking framework, various folksonomy ranking policies can be expressed with the ranking factors combined and our approach can work, even if the folksonomy site is not implemented with Semantic Web languages. Above all, the time weight proposed in this paper will be applicable to various domains, including social media, where time value is considered important.

Design of MAHA Supercomputing System for Human Genome Analysis (대용량 유전체 분석을 위한 고성능 컴퓨팅 시스템 MAHA)

  • Kim, Young Woo;Kim, Hong-Yeon;Bae, Seungjo;Kim, Hag-Young;Woo, Young-Choon;Park, Soo-Jun;Choi, Wan
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.2 no.2
    • /
    • pp.81-90
    • /
    • 2013
  • During the past decade, many changes and attempts have been tried and are continued developing new technologies in the computing area. The brick wall in computing area, especially power wall, changes computing paradigm from computing hardwares including processor and system architecture to programming environment and application usage. The high performance computing (HPC) area, especially, has been experienced catastrophic changes, and it is now considered as a key to the national competitiveness. In the late 2000's, many leading countries rushed to develop Exascale supercomputing systems, and as a results tens of PetaFLOPS system are prevalent now. In Korea, ICT is well developed and Korea is considered as a one of leading countries in the world, but not for supercomputing area. In this paper, we describe architecture design of MAHA supercomputing system which is aimed to develop 300 TeraFLOPS system for bio-informatics applications like human genome analysis and protein-protein docking. MAHA supercomputing system is consists of four major parts - computing hardware, file system, system software and bio-applications. MAHA supercomputing system is designed to utilize heterogeneous computing accelerators (co-processors like GPGPUs and MICs) to get more performance/$, performance/area, and performance/power. To provide high speed data movement and large capacity, MAHA file system is designed to have asymmetric cluster architecture, and consists of metadata server, data server, and client file system on top of SSD and MAID storage servers. MAHA system softwares are designed to provide user-friendliness and easy-to-use based on integrated system management component - like Bio Workflow management, Integrated Cluster management and Heterogeneous Resource management. MAHA supercomputing system was first installed in Dec., 2011. The theoretical performance of MAHA system was 50 TeraFLOPS and measured performance of 30.3 TeraFLOPS with 32 computing nodes. MAHA system will be upgraded to have 100 TeraFLOPS performance at Jan., 2013.