• Title/Summary/Keyword: One-Way Network

Search Result 725, Processing Time 0.029 seconds

Policy-Based Security Management Model for Efficient Security Policy Management in Large-Scale Network (대규모 네트워크 망에서 효율적인 보안정책관리를 위한 정책기반 보안관리모델)

  • Hwang, Yoon-Cheol;Um, Nam-Kyeong;Lee, Sang-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.1B
    • /
    • pp.87-93
    • /
    • 2003
  • As Information Security Technology has become rather transparent, wide, and integrated than in part, exclusive, and separated, A necessity of the study about integrating the separated distributed security systems into one module, has grown However, there is no integrated framework which can manage all separate security systems as one integrated one yet. Accordingly, we propose a new policy based network admirustrative model in this paper which can integrate individual security systems and distributed control way into one effectively.

FracSys와 UDEC을 이용한 사면 파괴 양상 분석 통계적 절리망 생성 기법 및 Monte Carlo Simulation을 통한 사면 안정성 해석

  • 김태희;최재원;윤운상;김춘식
    • Proceedings of the Korean Geotechical Society Conference
    • /
    • 2002.03a
    • /
    • pp.651-656
    • /
    • 2002
  • In general, the most important problem in slope stability analysis is that there is no definite way to describe the natural three-dimensional Joint network. Therefore, the many approaches were tried to anlayze the slope stability. Numerical modeling approach is one of the branch to resolve the complexity of natural system. UDEC, FLAC, and SWEDGE are widely used commercial code for the purpose on stability analysis. For the purpose on the more appropriate application of these kind of code, however, three-dimensional distribution of joint network must be identified in more explicit way. Remaining problem is to definitely describe the three dimensional network of joint and bedding, but it is almost impossible in practical sense. Three dimensional joint generation method with random number generation and the results of generation to UDEC have been applied to settle the refered problems in field site. However, this approach also has a important problem, and it is that joint network is generated only once. This problem lead to the limitation on the application to field case, in practical sense. To get rid of this limitation, Monte Carlo Simulation is proposed in this study 1) statistical analysis of input values and definition of the applied system with statistical parameter, 2) instead of the consideration of generated network as a real system, generated system is just taken as one reliable system, 3) present the design parameters, through the statistical analysis of ouput values Results of this study are not only the probability of failure, but also area of failure block, shear strength, normal strength and failure pattern, and all of these results are described in statistical parameters. The results of this study, shear strength, failure area, pattern etc, can provide the direct basement on the design, cutoff angle, support pattern, support strength and etc.

  • PDF

An Efficient Shortcut Path Algorithm using Depth in Zigbee Network (Zigbee 네트워크에서 Depth를 이용한 효율적인 중간 경로 감소 알고리즘)

  • Kim, Duck-Young;Jung, Woo-Sub;Cho, Sung-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.12B
    • /
    • pp.1475-1482
    • /
    • 2009
  • In ZigBee network, using energy efficiently is necessary because ZigBee node works by battery. To use energy efficiently, it is one of the way to reduce unnecessary network traffic. In this paper, it presents efficient shortcut routing algorithm using depth of destination node in ZigBee network. In traditional tree routing, each node transfers data only to its own parent or child node, which is inefficient way. Efficient shortcut routing algorithm is also based on tree routing. However, we suggests the algorithm with using neighbor table and depth of destination that is able to transfer data to other neighbor node, not only to parent or child node. It minimizes coordinator bottleneck state and unnecessary intermediate routing path which happens in traditional tree routing.

An Extended Work Architecture for Online Threat Prediction in Tweeter Dataset

  • Sheoran, Savita Kumari;Yadav, Partibha
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.1
    • /
    • pp.97-106
    • /
    • 2021
  • Social networking platforms have become a smart way for people to interact and meet on internet. It provides a way to keep in touch with friends, families, colleagues, business partners, and many more. Among the various social networking sites, Twitter is one of the fastest-growing sites where users can read the news, share ideas, discuss issues etc. Due to its vast popularity, the accounts of legitimate users are vulnerable to the large number of threats. Spam and Malware are some of the most affecting threats found on Twitter. Therefore, in order to enjoy seamless services it is required to secure Twitter against malicious users by fixing them in advance. Various researches have used many Machine Learning (ML) based approaches to detect spammers on Twitter. This research aims to devise a secure system based on Hybrid Similarity Cosine and Soft Cosine measured in combination with Genetic Algorithm (GA) and Artificial Neural Network (ANN) to secure Twitter network against spammers. The similarity among tweets is determined using Cosine with Soft Cosine which has been applied on the Twitter dataset. GA has been utilized to enhance training with minimum training error by selecting the best suitable features according to the designed fitness function. The tweets have been classified as spammer and non-spammer based on ANN structure along with the voting rule. The True Positive Rate (TPR), False Positive Rate (FPR) and Classification Accuracy are considered as the evaluation parameter to evaluate the performance of system designed in this research. The simulation results reveals that our proposed model outperform the existing state-of-arts.

Performance Evaluation of Tree Routing in Large-Scale Wireless Sensor Networks (대규모 센서네트워크에서의 트리라우팅 성능평가)

  • Beom-Kyu Suh;Ki-Il Kim
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.18 no.2
    • /
    • pp.67-73
    • /
    • 2023
  • Tree routing is one of appropriate routing schemes in wireless sensor network because the complexity of this approach is relatively low. But, congestion at a specific node may happen because a parent node toward a sink node is usually selected in one hop way, specially where large number of node are deployed. As feasible solution for this problem, multiple paths and sinks schemes can be applied. However, the performance of these schemes are not proved and analyzed yet. In this paper, we conduct diverse simulaton scenarios performance evaluation for these cases to identify the improvement and analyze the impact of schemes. The performance is measured in the aspects of packet transmission rate, throughput, and end-to-end delay as a function of amount of network traffic.

SOFTWARE STREAMING TECHNOLOGY FOR TELEMETICS APPLICATIONS

  • Kim, Jung-Sook;Choi, Ji-Hoon;Choi, Jung-Dan
    • Proceedings of the KSRS Conference
    • /
    • 2005.10a
    • /
    • pp.597-600
    • /
    • 2005
  • The software streaming technology enables telematics software to be automatically updated through a wireless network. When the software starts running, software streaming system inspects its version and then, automatically download latest one. The software streaming system breaks the software into several pieces that are streamed to the user as needed. In this way, software streaming system can improves the telematics application load time while updating the software through wireless network. In our experiments, the application load time was reduced about 7 times compared to downloading whole software at best case.

  • PDF

Study of Energy Save upon Result of CSMA/CA Collision on IEEE 802.15.4 (IEEE 802.15.4 기반 CSMA/CA 충돌에 대한 실험결과에 근거한 Energy Save에 대한 연구)

  • Shin, Jin-Chul;Park, Hong-Sung
    • Proceedings of the KIEE Conference
    • /
    • 2007.04a
    • /
    • pp.445-447
    • /
    • 2007
  • This paper is seeing as one big cause that reduce Life Time of sensor node become soft if BackOff Time is prolonged in CDMA/CA of competition way that consist at data transmission of each sensor nodes base sensor network environment. So solution method uses GTS, wish to reduce competition Node's, and minimise data transmission delay.

  • PDF

A Study on the Structure of Family Social network (가족의 사회관계망 구조와 관련변수)

  • 옥선화
    • Journal of Families and Better Life
    • /
    • v.11 no.1
    • /
    • pp.176-190
    • /
    • 1993
  • This study intended to analyze the size and composition of social network and to identify their related variables in urban nuclear families. Data were collected through the questionnaires by wives living in Seoul area. The methods of statistical analysis used in the study were the frequency mean percentile and one-way ANOVA. The findings were as follows; 1) The size of social network in urban nuclear families was 10.0 in average and 2-33 in range. 2) The composition of social network were 45.5% in relatives 20.6% in neighbors. 21.8% in friends. 4,7% in coworkers, 4.1% religious group members 2.1% in associational members. and 1.4% in formal supporters. 3) The birth order of husbands was related to the size of social network. The composition of social network was influenced by SES family life cycle husband's birth order housing type residence duration age education employment religion and familism.

  • PDF

A Study on the Accuracy Improvement of One-repetition Maximum based on Deep Neural Network for Physical Exercise

  • Lee, Byung-Hoon;Kim, Myeong-Jin;Kim, Kyung-Seok
    • International journal of advanced smart convergence
    • /
    • v.8 no.2
    • /
    • pp.147-154
    • /
    • 2019
  • In this paper, we conducted a study that utilizes deep learning to calculate appropriate physical exercise information when basic human factors such as sex, age, height, and weight of users come in. To apply deep learning, a method was applied to calculate the amount of fat needed to calculate the amount of one repetition maximum by utilizing the structure of the basic Deep Neural Network. By applying Accuracy improvement methods such as Relu, Weight initialization, and Dropout to existing deep learning structures, we have improved Accuracy to derive a lean body weight that is closer to actual results. In addition, the results were derived by applying a formula for calculating the one repetition maximum load on upper and lower body movements for use in actual physical exercise. If studies continue, such as the way they are applied in this paper, they will be able to suggest effective physical exercise options for different conditions as well as conditions for users.

Preserving User Anonymity in Context-Aware Location-Based Services: A Proposed Framework

  • Teerakanok, Songpon;Vorakulpipat, Chalee;Kamolphiwong, Sinchai;Siwamogsatham, Siwaruk
    • ETRI Journal
    • /
    • v.35 no.3
    • /
    • pp.501-511
    • /
    • 2013
  • Protecting privacy is an important goal in designing location-based services. Service providers want to verify legitimate users and allow permitted users to enjoy their services. Users, however, want to preserve their privacy and prevent tracking. In this paper, a new framework providing users with more privacy and anonymity in both the authentication process and the querying process is proposed. Unlike the designs proposed in previous works, our framework benefits from a combination of three important techniques: k-anonymity, timed fuzzy logic, and a one-way hash function. Modifying and adapting these existing schemes provides us with a simpler, less complex, yet more mature solution. During authentication, the one-way hash function provides users with more privacy by using fingerprints of users' identities. To provide anonymous authentication, the concept of confidence level is adopted with timed fuzzy logic. Regarding location privacy, spatial k-anonymity prevents the users' locations from being tracked. The experiment results and analysis show that our framework can strengthen the protection of anonymity and privacy of users by incurring a minimal implementation cost and can improve functionality.