• Title/Summary/Keyword: Network Log

Search Result 372, Processing Time 0.041 seconds

A Study on Life-log Analysis and Monitoring System for Disabled Person Using Smart Media (스마트 미디어를 활용한 장애인 라이프 로그의 분석 및 모니터링 시스템에 관한 연구)

  • Hwang, Myong-Gu;Lee, Sang-Moon;Seo, Jeong-Min
    • Journal of the Korea Society of Computer and Information
    • /
    • v.17 no.8
    • /
    • pp.99-106
    • /
    • 2012
  • In recent years, many researchers studies to promote the welfare of disabled people using IT technology. In particular, their suggestions are used a lot of mobile sensor installed on the street. These systems are acquired and to store the data sent to the server over the network, and by analyzing the users life log to judge of their risk state. In particular, persons with disabilities are exposed to various risks. So, they must need to the guardians if he go out. Thus, this study is a method for alleviating these so much pressure to smart appliances and impaired life log analysis system.

온라인 목록 검색 행태에 관한 연구-LINNET 시스템의 Transaction log 분석을 중심으로-

  • 윤구호;심병규
    • Journal of Korean Library and Information Science Society
    • /
    • v.21
    • /
    • pp.253-289
    • /
    • 1994
  • The purpose of this study is about the search pattern of LINNET (Library Information Network System) OPAC users by transaction log, maintained by POSTECH(Pohang University of Science and Technology) Central Library, to provide feedback information of OPAC system design. The results of this study are as follows. First, for the period of this analysis, there were totally 11, 218 log-ins, 40, 627 transaction logs and 3.62 retrievals per a log-in. Title keyword was the most frequently used, but accession number, bibliographic control number or call number was very infrequently used. Second, 47.02% of OPAC, searches resulted in zero retrievals. Bibliographic control number was the least successful search. User displayed 2.01% full information and 64.27% local information per full information. Third, special or advanced retrieval features are very infrequently used. Only 22.67% of the searches used right truncation and 0.71% used the qualifier. Only 1 boolean operator was used in every 22 retrievals. The most frequently used operator is 'and (&)' with title keywords. But 'bibliographical control number (N) and accessionnumber (R) are not used at all with any operators. The causes of search failure are as follows. 1. The item was not used in the database. (15, 764 times : 79.42%). 2. The wrong search key was used. (3, 761 times : 18.95%) 3. The senseless string (garbage) was entered. (324 times : 1.63%) On the basis of these results, some recommendations are suggested to improve the search success rate as follows. First, a n.0, ppropriate user education and online help function let users retrieve LINNET OPAC more efficiently. Second, several corrections of retrieval software will decrease the search failure rate. Third, system offers right truncation by default to every search term. This methods will increase success rate but should considered carefully. By a n.0, pplying this method, the number of hit can be overnumbered, and system overhead can be occurred. Fourth, system offers special boolean operator by default to every keyword retrieval when user enters more than two words at a time. Fifth, system assists searchers to overcome the wrong typing of selecting key by automatic korean/english mode change.

  • PDF

Learning Predictive Models of Memory Landmarks based on Attributed Bayesian Networks Using Mobile Context Log (모바일 컨텍스트 로그를 사용한 속성별 베이지안 네트워크 기반의 랜드마크 예측 모델 학습)

  • Lee, Byung-Gil;Lim, Sung-Soo;Cho, Sung-Bae
    • Korean Journal of Cognitive Science
    • /
    • v.20 no.4
    • /
    • pp.535-554
    • /
    • 2009
  • Information collected on mobile devices might be utilized to support user's memory, but it is difficult to effectively retrieve them because of the enormous amount of information. In order to organize information as an episodic approach that mimics human memory for the effective search, it is required to detect important event like landmarks. For providing new services with users, in this paper, we propose the prediction model to find landmarks automatically from various context log information based on attributed Bayesian networks. The data are divided into daily and weekly ones, and are categorized into attributes according to the source, to learn the Bayesian networks for the improvement of landmark prediction. The experiments on the Nokia log data showed that the Bayesian method outperforms SVMs, and the proposed attributed Bayesian networks are superior to the Bayesian networks modelled daily and weekly.

  • PDF

Analysis of Network Log based on Hadoop (하둡 기반 네트워크 로그 시스템)

  • Kim, Jeong-Joon;Park, Jeong-Min;Chung, Sung-Taek
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.17 no.5
    • /
    • pp.125-130
    • /
    • 2017
  • Since field control equipment such as PLC has no function to log key event information in the log, it is difficult to analyze the accident. Therefore, it is necessary to secure information that can analyze when a cyber accident occurs by logging the main event information of the field control equipment such as PLC and IED. The protocol analyzer is required to analyze the field control device (the embedded device) communication protocol for event logging. However, the conventional analyzer, such as Wireshark is difficult to process the data identification and extraction of the large variety of protocols for event logging is difficult analysis of the payload data based and classification. In this paper, we developed a system for Big Data based on field control device communication protocol payload data extraction for event logging of large studies.

Sequential Pattern Mining for Intrusion Detection System with Feature Selection on Big Data

  • Fidalcastro, A;Baburaj, E
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.10
    • /
    • pp.5023-5038
    • /
    • 2017
  • Big data is an emerging technology which deals with wide range of data sets with sizes beyond the ability to work with software tools which is commonly used for processing of data. When we consider a huge network, we have to process a large amount of network information generated, which consists of both normal and abnormal activity logs in large volume of multi-dimensional data. Intrusion Detection System (IDS) is required to monitor the network and to detect the malicious nodes and activities in the network. Massive amount of data makes it difficult to detect threats and attacks. Sequential Pattern mining may be used to identify the patterns of malicious activities which have been an emerging popular trend due to the consideration of quantities, profits and time orders of item. Here we propose a sequential pattern mining algorithm with fuzzy logic feature selection and fuzzy weighted support for huge volumes of network logs to be implemented in Apache Hadoop YARN, which solves the problem of speed and time constraints. Fuzzy logic feature selection selects important features from the feature set. Fuzzy weighted supports provide weights to the inputs and avoid multiple scans. In our simulation we use the attack log from NS-2 MANET environment and compare the proposed algorithm with the state-of-the-art sequential Pattern Mining algorithm, SPADE and Support Vector Machine with Hadoop environment.

VLBI NETWORK SIMULATOR: AN INTEGRATED SIMULATION TOOL FOR RADIO ASTRONOMERS

  • Zhao, Zhen;An, Tao;Lao, Baoqiang
    • Journal of The Korean Astronomical Society
    • /
    • v.52 no.5
    • /
    • pp.207-216
    • /
    • 2019
  • In this paper we introduce a software package, the Very long baseline interferometry Network SIMulator (VNSIM), which provides an integrated platform assisting radio astronomers to design Very Long Baseline Interferometry (VLBI) experiments and evaluate the network performance, with a user-friendly interface. Though VNSIM is primarily motivated by the East Asia VLBI Network, it can also be used for other VLBI networks and generic interferometers. The software package not only integrates the functionality of plotting (u, v) coverage, scheduling the observation, and displaying the dirty and CLEAN images, but also adds new features including sensitivity calculations for a given VLBI network. VNSIM provides flexible interactions on both command line and graphical user interface and offers friendly support for log reports and database management. Multi-processing acceleration is also supported, enabling users to handle large survey data. To facilitate future developments and updates, all simulation functions are encapsulated in separate Python modules, allowing independent invoking and testing. In order to verify the performance of VNSIM, we performed simulations and compared the results with other simulation tools, showing good agreement.

Discovering Temporal Work Transference Networks from Workflow Execution Logs

  • Pham, Dinh-Lam;Ahn, Hyun;Kim, Kwanghoon Pio
    • Journal of Internet Computing and Services
    • /
    • v.20 no.2
    • /
    • pp.101-108
    • /
    • 2019
  • Workflow management systems (WfMSs) automate and manage workflows, which are implementations of organizational processes operated in process-centric organizations. In this paper, wepropose an algorithm to discover temporal work transference networks from workflow execution logs. The temporal work transference network is a special type of enterprise social networks that consists of workflow performers, and relationships among them that are formed by work transferences between performers who are responsible in performing precedent and succeeding activities in a workflow process. In terms of analysis, the temporal work transference network is an analytical property that has significant value to be analyzed to discover organizational knowledge for human resource management and related decision-making steps for process-centric organizations. Also, the beginning point of implementinga human-centered workflow intelligence framework dealing with work transference networks is to develop an algorithm for discovering temporal work transference cases on workflow execution logs. To this end, we first formalize a concept of temporal work transference network, and next, we present a discovery algorithm which is for the construction of temporal work transference network from workflow execution logs. Then, as a verification of the proposed algorithm, we apply the algorithm to an XES-formatted log dataset that was released by the process mining research group and finally summarize the discovery result.

T-Chord Ring System based on Overlay Network for Service Discovery and Delivery in MANET (MANET에서 서비스 발견 및 전달을 위한 오버레이 네트워크 기반의 T-Chord 링 시스템)

  • Han, Insung;Jeong, Hongsik;Park, Moosung
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.1
    • /
    • pp.51-63
    • /
    • 2013
  • Recently with base apply MANET with the application for the service discovery and delivery which are various techniques are being proposed the result of such MANET base research techniques from actual inside. This dissertation proposes T-Chord(Trustworthy-based Chord) Ring system for MANET to guarantees from such requirements. T-Chord Ring system in order to manage Efficiently the services which the mobile nodes provide is the service discovery system which uses P2P overlay network Technique in mobile environment. The system which is proposed MANET communications in order to accomplish a service discovery operation with physical network class and logical network class will be able to minimize problems from about MANET service discoveries, and uses the dispersive hash table technique for a service discovery and effectiveness of service discovery improves and will be able to guarantee the expandability of network size. The mobile nodes(mobile device) have a mobility from MANET and operate with service request node, service provide node and service transmit node. The mobile nodes will be able to elect cluster header using Trustworthy that was evaluated service request, provision and delivery in each other. The system which is proposed a service discovery and a delivery efficiently will compose the cluster head which will grow of P2P overlay networks and will be able to accomplish. The system which proposes from dissertation is composed of Trustworthy evaluations of MANET mobile nodes, service information collection which is dispersed and P2P overlay networks that composed of Chord algorithm modules which provide O(Log N) efficiencies. The system comparison evaluation analyzes an efficiency from the expandability side of effectiveness and the network of service discovery technique and the service discovery message over head, service discovery and delivery of former times and service discovery and delivery is excellent gives proof from MANET.

Position of Hungarian Merino among other Merinos, within-breed genetic similarity network and markers associated with daily weight gain

  • Attila, Zsolnai;Istvan, Egerszegi;Laszlo, Rozsa;David, Mezoszentgyorgyi;Istvan, Anton
    • Animal Bioscience
    • /
    • v.36 no.1
    • /
    • pp.10-18
    • /
    • 2023
  • Objective: In this study, we aimed to position the Hungarian Merino among other Merinoderived sheep breeds, explore the characteristics of our sampled animals' genetic similarity network within the breed, and highlight single nucleotide polymorphisms (SNPs) associated with daily weight-gain. Methods: Hungarian Merino (n = 138) was genotyped on Ovine SNP50 Bead Chip (Illumina, San Diego, CA, USA) and positioned among 30 Merino and Merino-derived breeds (n = 555). Population characteristics were obtained via PLINK, SVS, Admixture, and Treemix software, within-breed network was analysed with python networkx 2.3 library. Daily weight gain of Hungarian Merino was standardised to 60 days and was collected from the database of the Association of Hungarian Sheep and Goat Breeders. For the identification of loci associated with daily weight gain, a multi-locus mixed-model was used. Results: Supporting the breed's written history, the closest breeds to Hungarian Merino were Estremadura and Rambouillet (pairwise FST values are 0.035 and 0.036, respectively). Among Hungarian Merino, a highly centralised connectedness has been revealed by network analysis of pairwise values of identity-by-state, where the animal in the central node had a betweenness centrality value equal to 0.936. Probing of daily weight gain against the SNP data of Hungarian Merinos revealed five associated loci. Two of them, OAR8_17854216.1 and s42441.1 on chromosome 8 and 9 (-log10P>22, false discovery rate<5.5e-20) and one locus on chromosome 20, s28948.1 (-log10P = 13.46, false discovery rate = 4.1e-11), were close to the markers reported in other breeds concerning daily weight gain, six-month weight, and post-weaning gain. Conclusion: The position of Hungarian Merino among other Merino breeds has been determined. We have described the similarity network of the individuals to be applied in breeding practices and highlighted several markers useful for elevating the daily weight gain of Hungarian Merino.

A Study of the Intelligent Researcher Connection Network Build-up that Merges the Recommendation System and Social Network (추천시스템과 소셜 네트워크를 융합한 지능형 연구자연결망 구축)

  • Lee, Choong-Moo;Lee, Sang-Gi;Lee, Byeong-Seop
    • Journal of Information Management
    • /
    • v.40 no.1
    • /
    • pp.199-215
    • /
    • 2009
  • The web 2.0 concept rapidly spreads to the various field which is based on an opening, the participation, and a share. And the research about the recommendation system, that is the personalize feature, and social network is very active. In the case of the recommendation system and social network, it had been developing in the respectively different area and the new research toward the service model of a form that it fuses these is insignificant. In this paper, I'm going to introduce efficient social network which is called the researcher connection network. It is possible to recommend the researcher intellectually who studies the similar field by analyzing the usage log and user profile. Through this study, we could solved the network expandability problem which is due to the user passive participation and the difficulty of the initial network construction that is the conventional social network problem.