• Title/Summary/Keyword: Common number network

Search Result 210, Processing Time 0.028 seconds

Analysis of common and characteristic actions of Panax ginseng and Panax notoginseng in wound healing based on network pharmacology and meta-analysis

  • Zhen Wang ;Xueheng Xie ;Mengchen Wang ;Meng Ding ;Shengliang Gu ;Xiaoyan Xing;Xiaobo Sun
    • Journal of Ginseng Research
    • /
    • v.47 no.4
    • /
    • pp.493-505
    • /
    • 2023
  • In recent years, an increasing number of reports have explored the wound healing mechanism of these two traditional Chinese herbal medicines- Panax ginseng and Panax notoginseng, but there is no systematic research on the related core functions and different mechanisms in the treatment of wound healing up to now. Based on network pharmacology and meta-analysis, the present work aimed to comprehensively review the commonality and diversity of P. ginseng and P. notoginseng in wound healing. In this study, a wound healing-related "ingredients-targets" network of two herbs was constructed. Thereafter, meta-analysis of the multiple target lists by Metascape showed that these two medicines significantly regulated blood vessel development, responses to cytokines and growth factors and oxygen levels, cell death, cell proliferation and differentiation, and cell adhesion. To better understand the discrepancy between these two herbs, it was found that common signaling pathways including Rap1, PI3K/AKT, MAPK, HIF-1 and Focal adhesion regulated the functions listed above. In parallel, the different pathways including renin-angiotensin system, RNA transport and circadian rhythm, autophagy, and the different metabolic pathways may also explained the discrepancies in the regulation of the above-mentioned functions, consistent with the Traditional Chinese Medicine theory about the effects of P. ginseng and P. notoginseng.

Performance Evaluation of the Common Channel Sinalling Module in TDX-1 (TDX-1 공통선 신호 모듈 성능 평가)

  • 기장근;이성재;정기석;한운용;김덕진;차균현
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.16 no.8
    • /
    • pp.732-744
    • /
    • 1991
  • In this paper, performance evaluation of the common channel signalling module which performs the message transfer part function of the CCITT No.7 in TDX 1 exchange is carried out. Simulation model is developed using SLAM II network nodes according to signalling mode and transrated into SLAM II statement, . The simulation results are compared with experimental results and analyzed in order to get the maximum throughput, processing delay time, bottleneck eiement. Also, in order to get the optimized structure of the CSM, simulation is performed on the vanous case, namely, change of the number of STB, change of STG bus or B bus speed, change of CSIOB, processing speed, change of the number of transfered message per one poll.

  • PDF

Identity-Based Multiple Key Agreement Scheme

  • Dehkordi, Massoud Hadian;Alimoradi, Reza
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.12
    • /
    • pp.2392-2402
    • /
    • 2011
  • In order to protect some important information communicated through an insecure network, a common hidden key must be used. One can produce the common hidden key using key agreement protocols; and this helps to have high security in modern data networks. Today, the designers of public key cryptography protocols try to set the public identity of a system's users (like their email addresses) as their public key. This not only makes a cryptographic protocol more efficient but also decreases its cost. These protocols are called "identity-based". In this article, an identity-based multiple key agreement scheme will be presented; this scheme uses the challenge-response method to do the verification. While the number of random values produced in our scheme is the same as other schemes, the number of keys generated in this scheme is much more than what many other key agreement schemes produce,. Therefore, we will have less computational complexities campered with other schems. In this paper, we consider the security of our scheme and consequently, we will show that it satisfies many security conditions such as strong security.

A Simulation Model of Object Movement for Evaluating the Communication Load in Networked Virtual Environments

  • Lim, Mingyu;Lee, Yunjin
    • Journal of Information Processing Systems
    • /
    • v.9 no.3
    • /
    • pp.489-498
    • /
    • 2013
  • In this paper, we propose a common simulation model that can be reused for different performance evaluations of networked virtual environments. To this end, we analyzed the common features of NVEs, in which multiple regions compose a shared space, and where a user has his/her own interest area. Communication architecture can be client-server or peer-server models. In usual simulations, users move around the world while the number of users varies with the system. Our model provides various simulation parameters to customize the region configuration and user movement pattern. Furthermore, our model introduces a way to mimic a lot of users in a minimal experiment environment. The proposed model is integrated with our network framework, which supports various scalability approaches. We specifically applied our model to the interest management and load distribution schemes to evaluate communication overhead. With the proposed simulation model, a new simulation can be easily designed in a large-scale environment.

Security Vulnerability and Countermeasure on 5G Networks: Survey (5G 네트워크의 보안 취약점 및 대응 방안: 서베이)

  • Hong, Sunghyuck
    • Journal of Digital Convergence
    • /
    • v.17 no.12
    • /
    • pp.197-202
    • /
    • 2019
  • In line with the era of the 4th Industrial Revolution, 5G technology has become common technology, and 5G technology is evaluated as a technology that minimizes the speed and response speed compared to 4G using technologies such as network slicing and ultra-multiple access. 5G NR stands for 5G mobile communication standard, and network slicing cuts the network into parallel connections to optimize the network. In addition, the risk of hacking is increasing as data is processed in the base station unit. In addition, since the number of accessible devices per unit area increases exponentially, there is a possibility of base station attack after hacking a large number of devices in the unit area. To solve this problem, this study proposes the introduction of quantum cryptography and 5G security standardization.

On the Handling of Node Failures: Energy-Efficient Job Allocation Algorithm for Real-time Sensor Networks

  • Karimi, Hamid;Kargahi, Mehdi;Yazdani, Nasser
    • Journal of Information Processing Systems
    • /
    • v.6 no.3
    • /
    • pp.413-434
    • /
    • 2010
  • Wireless sensor networks are usually characterized by dense deployment of energy constrained nodes. Due to the usage of a large number of sensor nodes in uncontrolled hostile or harsh environments, node failure is a common event in these systems. Another common reason for node failure is the exhaustion of their energy resources and node inactivation. Such failures can have adverse effects on the quality of the real-time services in Wireless Sensor Networks (WSNs). To avoid such degradations, it is necessary that the failures be recovered in a proper manner to sustain network operation. In this paper we present a dynamic Energy efficient Real-Time Job Allocation (ERTJA) algorithm for handling node failures in a cluster of sensor nodes with the consideration of communication energy and time overheads besides the nodes' characteristics. ERTJA relies on the computation power of cluster members for handling a node failure. It also tries to minimize the energy consumption of the cluster by minimum activation of the sleeping nodes. The resulting system can then guarantee the Quality of Service (QoS) of the cluster application. Further, when the number of sleeping nodes is limited, the proposed algorithm uses the idle times of the active nodes to engage a graceful QoS degradation in the cluster. Simulation results show significant performance improvements of ERTJA in terms of the energy conservation and the probability of meeting deadlines compared with the other studied algorithms.

Mobility Management for ILNP-based Tactical Network (전술 네트워크를 위한 ILNP 기반 환경에서의 이동성 관리 기술)

  • Sun, Kyoungjae;Kim, Younghan;Noh, Hongjun;Park, Hyungwon;Han, Myounghun;Kwon, Daehoon
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.23 no.3
    • /
    • pp.246-256
    • /
    • 2020
  • In the future Network Centric Warfare(NCW), changing to IPv6 based network environment is required to enable various future technologies such as the Internet of Things(IoT) and cloud technology which are expected to be introduced to the tactical network evolution. With the change to the IPv6 network, an ID/LOC(Identifier/Location) separation protocol that decomposes context of the IP address to location and identifier can enhance network capacity of increasing number of device and provide efficient mobility management in the tactical network that changes topology dynamically. In this paper, we choose ILNP(Identifier-Locator Network Protocol) as an ID/LOC separation for tactical network environment. In addition to ILNP-based tactical network design, this paper proposes a network-based mobility management scheme for providing efficient mobility management. Through numerical performance analysis, we show that the proposed scheme can reduce network loads more effectively than the conventional IP-based mobility management scheme and common handover procedure in ILNP.

A Genetic Algorithm Approach for Logistics Network Integrating Forward and Reverse Flows (역물류를 고려한 통합 물류망 구축을 위한 유전 알고리듬 해법)

  • Ko, Hyun-Jeung;Ko, Chang-Seong;Chung, Ki-Ho
    • IE interfaces
    • /
    • v.17 no.spc
    • /
    • pp.141-151
    • /
    • 2004
  • As today's business environment has become more and more competitive, forward as well as backward flows of products among members belonging to a supply chain have been increased. The backward flows of products, which are common in most industries, result from increasing amount of products that are returned, recalled, or need to be repaired. Effective management for the backward flows of products has become an important issue for businesses because of opportunities for simultaneously enhancing profitability and customer satisfaction from returned products. Since third party logistics service providers (3PLs) are playing an important role in reverse logistics operations, they should perform two simultaneous logistics operations for a number of different clients who want to improve their logistics operations for both forward and reverse flows. In this case, distribution networks have been independently designed with respect to either forward or backward flows so far. This paper proposes a mixed integer programming model for the design of network integrating both forward and reverse logistics. Since the network design problem belongs to a class of NP-hard problems, we present an efficient heuristic algorithm based on genetic algorithm (GA), of which the performance is compared to the lower bound by Lagrangian relaxation. Finally, the validity of proposed algorithm is tested using numerical examples.

Model and Algorithm for Logistics Network Integrating Forward and Reverse Flows (역물류를 고려한 통합 물류망 구축에 대한 모델 및 해법에 관한 연구)

  • Ko Hyun Jeung;Ko Chang Seong;Chung Ki Ho
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2004.10a
    • /
    • pp.375-388
    • /
    • 2004
  • As today's business environment has become more and more competitive, forward as well as backward flows of products among members belonging to a supply chain have been increased. The backward flows of products, which are common in most industries, result from increasing amount of products that are returned, recalled, or need to be repaired. Effective management for these backward flows of products has become an important issue for businesses because of opportunities for simultaneously enhancing profitability and customer satisfaction from returned products. Since third party logistics service providers (3PLs) are playing an important role in reverse logistics operations, the 3PLs should perform two simultaneous logistics operations for a number of different clients who want to improve their logistics operations for both forward and reverse flows. In this case, distribution networks have been independently designed with respect to either forward or backward flows so far. This paper proposes a mixed integer programming model for the design of network integrating both forward and reverse logistics. Since this network design problem belongs to a class of NP-hard problems, we present an efficient heuristic based on Lagrangean relaxation and apply it to numerical examples to test the validity of proposed heuristic.

  • PDF

EP-MAC: Early Preamble MAC To Achieve Low Delay And Energy Consumption In Duty Cycle Based Asynchronous Wireless Sensor Networks

  • Oak, Jeong-Yeob;Choi, Young-June;Pak, Wooguil
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.11
    • /
    • pp.2980-2991
    • /
    • 2012
  • Since wireless sensor networks are broadly used in various areas, there have been a number of protocols developed to satisfy specific constraints of each application. The most important and common requirements regardless of application types are to provide a long network lifetime and small end-to-end delay. In this paper, we propose Early Preamble MAC (EP-MAC) with improved energy conservation and low latency. It is based on CMAC but adopts a new preamble type called 'early preamble'. In EP-MAC, a transmitting node can find quickly when a next receiving node wakes up, so EP-MAC enables direct data forwarding in the next phase. From numerical analysis, we show that EP-MAC improves energy consumption and latency greatly compared to CMAC. We also implemented EP-MAC with NS-2, and through extensive simulation, we confirmed that EP-MAC outperforms CMAC.