• 제목/요약/키워드: Network Discovery

검색결과 463건 처리시간 0.031초

E-Discovery를 위한 디지털 증거 전송시스템에 대한 연구 (A Study on Digital Evidence Transmission System for E-Discovery)

  • 이창훈;백승조;김태완;임종인
    • 정보보호학회논문지
    • /
    • 제18권5호
    • /
    • pp.171-180
    • /
    • 2008
  • 2006년 12월 미국의 민사소송규칙(FRCP) 개정으로 e-discovery(전자증거개시) 제도가 시행되고 있으나, 이 제도는 디지털 증거의 관리와 제출과정에서 발생할 수 있는 과도한 비용과 시간의 낭비와 같은 다양한 문제점들을 가지고 있다. 현재 e-discovery 제도의 국내 도입 논의가 진행되고 있는 상황에서 본 논문에서는 e-discovery의 절차 중 디지털 증거를 소송상대방에게 제출하는 production 단계에서 발생할 수 있는 민감한 자료 유출, 읽기 불가능, 위 변조 및 손상 등과 같은 문제점에 대해 살펴보고, 이 문제점들을 해결하고 비용과 시간의 낭비를 최소화 할 수 있는 안전한 온라인 디지털 증거 전송 시스템을 제안한다.

Development of a Knowledge Discovery System using Hierarchical Self-Organizing Map and Fuzzy Rule Generation

  • Koo, Taehoon;Rhee, Jongtae
    • 한국지능정보시스템학회:학술대회논문집
    • /
    • 한국지능정보시스템학회 2001년도 The Pacific Aisan Confrence On Intelligent Systems 2001
    • /
    • pp.431-434
    • /
    • 2001
  • Knowledge discovery in databases(KDD) is the process for extracting valid, novel, potentially useful and understandable knowledge form real data. There are many academic and industrial activities with new technologies and application areas. Particularly, data mining is the core step in the KDD process, consisting of many algorithms to perform clustering, pattern recognition and rule induction functions. The main goal of these algorithms is prediction and description. Prediction means the assessment of unknown variables. Description is concerned with providing understandable results in a compatible format to human users. We introduce an efficient data mining algorithm considering predictive and descriptive capability. Reasonable pattern is derived from real world data by a revised neural network model and a proposed fuzzy rule extraction technique is applied to obtain understandable knowledge. The proposed neural network model is a hierarchical self-organizing system. The rule base is compatible to decision makers perception because the generated fuzzy rule set reflects the human information process. Results from real world application are analyzed to evaluate the system\`s performance.

  • PDF

Structure-based Functional Discovery of Proteins: Structural Proteomics

  • Jung, Jin-Won;Lee, Weon-Tae
    • BMB Reports
    • /
    • 제37권1호
    • /
    • pp.28-34
    • /
    • 2004
  • The discovery of biochemical and cellular functions of unannotated gene products begins with a database search of proteins with structure/sequence homologues based on known genes. Very recently, a number of frontier groups in structural biology proposed a new paradigm to predict biological functions of an unknown protein on the basis of its three-dimensional structure on a genomic scale. Structural proteomics (genomics), a research area for structure-based functional discovery, aims to complete the protein-folding universe of all gene products in a cell. It would lead us to a complete understanding of a living organism from protein structure. Two major complementary experimental techniques, X-ray crystallography and NMR spectroscopy, combined with recently developed high throughput methods have played a central role in structural proteomics research; however, an integration of these methodologies together with comparative modeling and electron microscopy would speed up the goal for completing a full dictionary of protein folding space in the near future.

IPv6 네트워크에서 SEND 프로토콜의 구현 (Implementation of SEND Protocol in IPv6 Networks)

  • 안개일;나재훈
    • 한국통신학회논문지
    • /
    • 제32권7B호
    • /
    • pp.403-410
    • /
    • 2007
  • IPv6 유무선 로컬 네트워크에서 이웃하는 호스트와 라우터를 발견하기 위한 목적으로 ND (Neighbor Discovery) 프로토콜이 제안되었다. 그러나 ND 프로토콜은 악의 있는 사용자가 프로토콜 메시지를 위조하여 정상적인 호스트나 라우터로 위장하는 것이 가능하기 때문에 네트워크 공격에 취약한 문제를 가지고 있다. ND 프로토콜을 보호하기 위한 목적으로 SEND (Secure Neighbor Discovery) 프로토콜이 제안되었다. SEND 프로토콜은 주소 소유권 증명, 메시지 보호, 재현 공격 방지, 그리고 라우터 인증 메커니즘을 제공한다. 본 논문에서는 IPv6 네트워크상에서 핵심적으로 운용될 프로토콜중의 하나인 SEND 프로토콜을 설계 및 구현하다. 또한 본 논문에서 구현한 SEND 프로토콜을 IPv6 네트워크상에서 실험함으로써 SEND 프로토콜의 공격 방어 능력과 프로토콜의 성능을 평가하고 분석한다.

A Graph-based Model for RSUs Deployment in Vehicular Networks by Considering Urban and Network Limitations and QoS Requirements of Service Advertisement and Discovery

  • Balouchzahi, Nik Mohammad;Fathy, Mahmood;Akbari, Ahmad
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권5호
    • /
    • pp.1662-1681
    • /
    • 2015
  • The efficient send and receive of information in VANET improves the efficiency of the safety and traffic services advertisment and discovery. However, if the V2V is the only communication system used, the restrictions of the urban environment and network drop the performance of VANET. In order to improve the performance of the network, it is necessary to use V2I communication as well as V2V communication. Therefore, RSUs must be placed in the environment. However due to the high costs of placement, the full coverage of the environment would not be possible. Therefore, it is necessary to optimally install a limited number of RSUs in the environment.

An On Demand Routing Algorithm for Mobile Wireless Networks

  • Yan, Huai-Zhi;Ajith, P.K.;Park, Dong-Won;Joo, Gi-Ho
    • 공학논문집
    • /
    • 제7권1호
    • /
    • pp.37-51
    • /
    • 2005
  • An and hoc network is a collection of wireless mobile nodes forming a temporary network without the centralized administration. Due to the limited transmission range of wireless work interface, multiple networks "hops" maybe needed for one node to exchange data with adjacent node. In recent years, a variety of new routing protocol about ad hoc network was developed. This paper presents a new routing protocol based on the Dynamic Source Routing which is not suitable for the high mobility ad hoc network. The Enhanced DR adapts quickly to routing changes when node movement is frequent. When a trunk route is broken, this protocol will utilize the alternative route saved in the route to discovery quickly the new route. It improves the performance of the existing DSR algorithm, so that the negative impacts from weakness of DSR are reduced.

  • PDF

The Construction of Regulatory Network for Insulin-Mediated Genes by Integrating Methods Based on Transcription Factor Binding Motifs and Gene Expression Variations

  • Jung, Hyeim;Han, Seonggyun;Kim, Sangsoo
    • Genomics & Informatics
    • /
    • 제13권3호
    • /
    • pp.76-80
    • /
    • 2015
  • Type 2 diabetes mellitus is a complex metabolic disorder associated with multiple genetic, developmental and environmental factors. The recent advances in gene expression microarray technologies as well as network-based analysis methodologies provide groundbreaking opportunities to study type 2 diabetes mellitus. In the present study, we used previously published gene expression microarray datasets of human skeletal muscle samples collected from 20 insulin sensitive individuals before and after insulin treatment in order to construct insulin-mediated regulatory network. Based on a motif discovery method implemented by iRegulon, a Cytoscape app, we identified 25 candidate regulons, motifs of which were enriched among the promoters of 478 up-regulated genes and 82 down-regulated genes. We then looked for a hierarchical network of the candidate regulators, in such a way that the conditional combination of their expression changes may explain those of their target genes. Using Genomica, a software tool for regulatory network construction, we obtained a hierarchical network of eight regulons that were used to map insulin downstream signaling network. Taken together, the results illustrate the benefits of combining completely different methods such as motif-based regulatory factor discovery and expression level-based construction of regulatory network of their target genes in understanding insulin induced biological processes and signaling pathways.

Multiple token-based neighbor discovery for directional sensor networks

  • Nagaraju, Shamanth;Gudino, Lucy J.;Sood, Nipun;Chandran, Jasmine G.;Sreejith, V.
    • ETRI Journal
    • /
    • 제42권3호
    • /
    • pp.351-365
    • /
    • 2020
  • Directional sensor networks (DSNs) can significantly improve the performance of a network by employing energy efficient communication protocols. Neighbor discovery is a vital part of medium access control (MAC) and routing protocol, which influences the establishment of communication between neighboring nodes. Neighbor discovery is a challenging task in DSNs due to the limited coverage provided by directional antennas. Furthermore, in these networks, communication can only take place when the beams of the directional antennas are pointed toward each other. In this article, we propose a novel multiple token-based neighbor discovery (MuND) protocol, in which multiple tokens are transmitted based on an area exploration algorithm. The performance of the protocol is evaluated using the Cooja simulator. The simulation results reveal that the proposed MuND protocol achieves lower neighbor discovery latency, with a 100% neighbor discovery ratio, and has a relatively low communication overhead and low energy consumption.

Reliable Distributed Lookup Service Scheme for Mobile Ad-hoc Networks

  • Malik Muhammad Ali;Kim Jai-Hoon
    • 한국정보과학회:학술대회논문집
    • /
    • 한국정보과학회 2006년도 한국컴퓨터종합학술대회 논문집 Vol.33 No.1 (D)
    • /
    • pp.124-126
    • /
    • 2006
  • Mobile Ad hoc networking is an emerging technology and in these days many applications are being developed to run on these networks. In these networks lookup services are very important because all nodes do not have same resources in term of memory and computing power. Nodes need to use different services offered by different servers. Reliable and efficient scheme should be available for lookup services due to limited bandwidth and low computing power of devices in mobile ad hoc networks. Due to mobility and rapid change in network topology, lookup mechanism used in wired network is not appropriate. Service discovery mechanism can be divided into two main categories Centralized and Distributed. Centralized mechanism is not reliable as there is no central node in these networks. Secondly centralized mechanism leads toward single point failure. We can handle the service discovery mechanism by distributing server's information to each node. But this approach is also not appropriate due to limited bandwidth and rapid change in network. In this paper, we present reliable lookup service scheme which is based on distributed mechanism. We are not using replication approach as well due to low bandwidth of wireless networks. In this scheme service discovery mechanism will be handled through different lookup servers. Reliability is the key feature of our proposed scheme.

  • PDF