• Title/Summary/Keyword: Social Computing

Search Result 491, Processing Time 0.024 seconds

An Estimated Closeness Centrality Ranking Algorithm for Large-Scale Workflow Affiliation Networks (대규모 워크플로우 소속성 네트워크를 위한 근접 중심도 랭킹 알고리즘)

  • Lee, Do-kyong;Ahn, Hyun;Kim, Kwang-hoon Pio
    • Journal of Internet Computing and Services
    • /
    • v.17 no.1
    • /
    • pp.47-53
    • /
    • 2016
  • A type of workflow affiliation network is one of the specialized social network types, which represents the associative relation between actors and activities. There are many methods on a workflow affiliation network measuring centralities such as degree centrality, closeness centrality, betweenness centrality, eigenvector centrality. In particular, we are interested in the closeness centrality measurements on a workflow affiliation network discovered from enterprise workflow models, and we know that the time complexity problem is raised according to increasing the size of the workflow affiliation network. This paper proposes an estimated ranking algorithm and analyzes the accuracy and average computation time of the proposed algorithm. As a result, we show that the accuracy improves 47.5%, 29.44% in the sizes of network and the rates of samples, respectively. Also the estimated ranking algorithm's average computation time improves more than 82.40%, comparison with the original algorithm, when the network size is 2400, sampling rate is 30%.

Clustering Algorithm using the DFP-Tree based on the MapReduce (맵리듀스 기반 DFP-Tree를 이용한 클러스터링 알고리즘)

  • Seo, Young-Won;Kim, Chang-soo
    • Journal of Internet Computing and Services
    • /
    • v.16 no.6
    • /
    • pp.23-30
    • /
    • 2015
  • As BigData is issued, many applications that operate based on the results of data analysis have been developed, typically applications are products recommend service of e-commerce application service system, search service on the search engine service and friend list recommend system of social network service. In this paper, we suggests a decision frequent pattern tree that is combined the origin frequent pattern tree that is mining similar pattern to appear in the data set of the existing data mining techniques and decision tree based on the theory of computer science. The decision frequent pattern tree algorithm improves about problem of frequent pattern tree that have to make some a lot's pattern so it is to hard to analyze about data. We also proposes to model for a Mapredue framework that is a programming model to help to operate in distributed environment.

A Study on Feature Information Parsing of Video Image Using Improved Moment Invariant (향상된 불변모멘트를 이용한 동영상 이미지의 특징정보 분석에 관한 연구)

  • Lee, Chang-Soo;Jun, Moon-Seog
    • Journal of Korea Multimedia Society
    • /
    • v.8 no.4
    • /
    • pp.450-460
    • /
    • 2005
  • Today, multimedia information is used on the internet and various social areas by rapid development of computer and communication technology. Therefor, the usage is growing dramatically. Multimedia information analysis system is basically based on text. So, there are many difficult problems like expressing ambiguity of multimedia information, excessive burden of works in appending notes and a lack of objectivity. In this study, we suggest a method which uses color and shape information of multimedia image partitions efficiently analyze a large amount of multimedia information. Partitions use field growth and union method. To extract color information, we use distinctive information which matches with a representative color from converting process from RGB(Red Green Blue) to HSI(Hue Saturation Intensity). Also, we use IMI(Improved Moment Invariants) which target to only outline pixels of an object and execute computing as shape information.

  • PDF

Operating model for A Value-For-Money evaluation of BTL Projects for Educational Facilities (교육시설 BTL 사업의 투자가치 평가를 위한 운영비 모형 구축)

  • Son, Ki-Young;Kim, Jang-Young;Kook, Dong-Hoon;Kim, Sun-Kuk
    • Korean Journal of Construction Engineering and Management
    • /
    • v.7 no.6
    • /
    • pp.141-150
    • /
    • 2006
  • As the law on the private sector investment in social infrastructure was amended in January of 2005, the government is aggressively promoting BTL projects but many trials and errors and problems are occurring. Especially, the Value-For-Money evaluation conducted by the responsible agencies to judge the appropriateness of the project found there was a conspicuous difference between the computed cost and the final contract sum. Accordingly, this study is aimed to grasp the problems in the current Value-For-Money evaluation and to improve it in order to proceed with BTL projects efficiently. To achieve this, through a relative comparison to the final contract sum, a clear standard for the items of Value-For-Money evaluation was presented and thus, a model that can ensure accuracy in computing the Value-For-Money was established so that a delay in negotiations can be avoided. If the Value-For-Money evaluation established in this study is used in assessing the appropriateness of unit prices for BTL projects for education facilities, a reasonable result can be expected to be drawn in selection and negotiations with contractors, and maintenance and Post-Operation-Evaluation(POE) of education facilities as well.

An Applicability Study of Action-Benefit-Cost Model and Statistical Model Checking for System of Systems Goal Achievement Verification (시스템 오브 시스템즈 수준의 목표 달성 검증을 위한 행동-이익-비용 모델과 통계적 모델 체킹 적용 연구)

  • Kim, Junho;Shin, Donghwan;Bae, Doo-Hwan
    • KIISE Transactions on Computing Practices
    • /
    • v.23 no.4
    • /
    • pp.256-261
    • /
    • 2017
  • The notion of System of Systems (SoS), which is composed by many independent systems (i.e., Constituent Systems, CS), has emerged in various domains including social infrastructure. It is widely expected that complex requirements, which cannot be achieved in each CS-level, will be achieved in an SoS-level. While verification of SoS-level goal achievement is one of the most important problems, concrete case studies on SoS modeling and verification are still rare. In this paper, we focus on the fact that each CS performs an action for its own purpose by its own decision-making mechanism. We propose a novel Action-Benefit-Cost (ABC) SoS model which caters to the independent decision-making mechanisms of CSs. Using an abstract SoS example, this proposal provides a case study for the modeling and quantitative verification of the ABC SoS model.

Analysis of Regulations and Legal Systems for Making Better Use of Administrative Information (행정정보의 효율적인 활용을 위한 법.규제 분석)

  • Kim, Taisiya;Kim, Bo-Ra-Mi;Lee, Bong-Gyou
    • The Journal of Society for e-Business Studies
    • /
    • v.16 no.3
    • /
    • pp.211-224
    • /
    • 2011
  • Since appearance of smart devices and cloud computing services, the social and economical values of administrative information have been magnified as valuable information. In order to make better use of various administrative information by diverse government organizations efficiently and effectively, information sharing based on legal systems is essential because of several obstacles including privacy. To suggest practical ways for using administrative information, this study categorized the administrative information sharing process, and analyzed the regulations and legal systems that are contradictory to the regulations. The result of analysis appears that there is a need of legislative base for well-defined business use of information, and a need of the organizations, that available to collect and manufacture the information. The results of this study can be expected to make legislation contributions not only for industries, but also by suggesting the policy making and guidelines to protect privacy and improve the quality of citizens' life.

Digital Forensics: Review of Issues in Scientific Validation of Digital Evidence

  • Arshad, Humaira;Jantan, Aman Bin;Abiodun, Oludare Isaac
    • Journal of Information Processing Systems
    • /
    • v.14 no.2
    • /
    • pp.346-376
    • /
    • 2018
  • Digital forensics is a vital part of almost every criminal investigation given the amount of information available and the opportunities offered by electronic data to investigate and evidence a crime. However, in criminal justice proceedings, these electronic pieces of evidence are often considered with the utmost suspicion and uncertainty, although, on occasions are justifiable. Presently, the use of scientifically unproven forensic techniques are highly criticized in legal proceedings. Nevertheless, the exceedingly distinct and dynamic characteristics of electronic data, in addition to the current legislation and privacy laws remain as challenging aspects for systematically attesting evidence in a court of law. This article presents a comprehensive study to examine the issues that are considered essential to discuss and resolve, for the proper acceptance of evidence based on scientific grounds. Moreover, the article explains the state of forensics in emerging sub-fields of digital technology such as, cloud computing, social media, and the Internet of Things (IoT), and reviewing the challenges which may complicate the process of systematic validation of electronic evidence. The study further explores various solutions previously proposed, by researchers and academics, regarding their appropriateness based on their experimental evaluation. Additionally, this article suggests open research areas, highlighting many of the issues and problems associated with the empirical evaluation of these solutions for immediate attention by researchers and practitioners. Notably, academics must react to these challenges with appropriate emphasis on methodical verification. Therefore, for this purpose, the issues in the experiential validation of practices currently available are reviewed in this study. The review also discusses the struggle involved in demonstrating the reliability and validity of these approaches with contemporary evaluation methods. Furthermore, the development of best practices, reliable tools and the formulation of formal testing methods for digital forensic techniques are highlighted which could be extremely useful and of immense value to improve the trustworthiness of electronic evidence in legal proceedings.

Strategic Framework for $Web^2$ Mobile Marketing

  • Lee, Bong-Gyou;Seo, Hyun-Sik;Kim, Yong-Beom;Park, Soo-Kyung;Kim, Taisiya
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.11
    • /
    • pp.2087-2102
    • /
    • 2011
  • The purpose of this study is to develop and present a strategic framework for mobile Internet marketing in the $Web^2$ environment. The $Web^2$ mobile Internet marketing is characterized by services, such as augmented reality and social network services. Considering the changes in the effects and types of advertisements in the mobile Internet, few studies of mobile advertisements have been conducted thus far in the $Web^2$ environment, including the cloud computing environment. Accordingly, this research aims to identify the relationships between importance and satisfaction and to uncover the characteristics of mobile advertisements through smart phones using the IPA (Importance-performance Analysis) methodology in the $Web^2$ environment. To induce the minimum required characteristics of a mobile advertisement in terms of the importance and satisfaction of IPA, Kano's model is applied to this analysis. The study also probes the relationships between the overall satisfaction and factors of each dimension of IPA through a regression analysis. As a result, this study presents four types of $Web^2$ mobile Internet marketing strategies. It was also confirmed that the maintenance reinforcement factors of the IPA dimension affect the degree of overall satisfaction. This study has implications for businesses and researchers preparing $Web^2$ mobile services and marketing.

A Context-aware Messenger for Sharing User Contextual Information (사용자 컨텍스트 공유를 위한 상황인지 메신저)

  • Hong, Jin-Hyuk;Yang, Sung-Ihk;Cho, Sung-Bae
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.9
    • /
    • pp.906-910
    • /
    • 2008
  • As the mobile environment becomes widely used, there is a growth on the concern about recognizing and sharing user context. Sharing context makes the interaction between human more plentiful as well as helps to keep a good social relationship. Recently, it has been applied to some messengers or mobile applications with sharing simple contexts, but it is still required to recognize and share more complex and diverse contexts. In this paper, we propose a context-aware messenger that collects various sensory information, recognizes representative user contexts such as emotion, stress, and activity by using dynamic Bayesian networks, and visualizes them. It includes a modular model that is effective to recognize various contexts and displays them in the form of icons. We have verified the proposed method with the scenario evaluation and usability test.

An Information Diffusion Model Considering Non-explicit Relationships in the Blog World (블로그 월드에서 비명시적 관계를 고려한 정보 파급 모델)

  • Kwon, Yong-Suk;Kim, Sang-Wook;Park, Sun-Ju;Lim, Seung-Hwan;Lee, Jae-Bum
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.15 no.5
    • /
    • pp.360-364
    • /
    • 2009
  • Analyzing information diffusion in a blog world is a very useful research issue, which can be used for predicting information diffusion, abnormally detection, marketing, and revitalizing the blog world. Existing studies on information diffusion in blog networks establish explicit relationship between blogs, and analyze only the word-of-mouth effect through such explicit relationships. However, we observed that more than 85% of all information diffusion in a blog world occurs through non-explicit relationships. In this paper, we propose a new model that considers both explicit and non-explicit relationships between blogs in order to explain all information diffusion phenomena in a blog world. We verify the superiority of our proposed models through extensive experiments of information diffusions at a real blog net-work.