• Title/Summary/Keyword: computer topology

Search Result 614, Processing Time 0.041 seconds

Study on Topology Optimization for Eigenfrequency of Plates with Composite Materials (복합재료판 구조물의 고유진동수 위상최적화에 관한 연구)

  • Kim, Hwa-Ill;Yun, Hyug-Gee;Han, Kyong-Min
    • Transactions of the Korean Society for Noise and Vibration Engineering
    • /
    • v.19 no.12
    • /
    • pp.1356-1363
    • /
    • 2009
  • The aim of this research is to construct eigenfrequency optimization codes for plates with Arbitrary Rank Microstructures. From among noise factors, resonance sound is main reason for floor's solid noise. But, Resonance-elusion design codes are not fixed so far. Besides, The prediction of composite material's capability and an resonance elusion by controlling natural frequency of plate depend on designer's experiences. In this paper, First, using computer program with arbitrary rank microstructure, variation on composite material properties is studied, and then natural frequency control is performed by plate topology optimization method. The results of this study are as followed. 1) Programs that calculate material properties along it's microstructure composition and control natural frequency on composite material plate are coded by Homogenization and Topology Optimization method. and it is examined by example problem. 2) Equivalent material properties, calculated by program, are examined for natural frequency. In this paper, Suggested programs are coded using $Matlab^{TM}$, Feapmax and Feap Library with Homogenization and Topology Optimization method. and Adequacy of them is reviewed by performing the maximization or minimization of natural frequency for plates with isotropic or anisotropic materials. Since the programs has been designed for widely use. If the mechanism between composite material and other structural member is identified, extension application may be possible in field of structure maintenance, reinforcement etc. through application of composite material.

Distributed Kinetic Delaunay Triangulation

  • Yoo Taewon;Choi Sunghee;Lee Hyonik;Lee Jinwon
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2005.11a
    • /
    • pp.964-966
    • /
    • 2005
  • This paper proposes a distributed algorithm to maintain the Delaunay triangulation of moving points. We assume that every point is a processor which can only communicate with the adjacent points connected by edges in the Delaunay triangulation. The topology changes of the Delaunay triangulation due to the movement of the points are updated automatically by local operations of the points without any centralized processor or global information.

  • PDF

Provision of VHE Services to Roaming Users

  • Roussaki, Ioanna;Chantzara, Maria;Xynogalas, Stavros;Anagnostou, Miltiades
    • Journal of Communications and Networks
    • /
    • v.4 no.4
    • /
    • pp.363-369
    • /
    • 2002
  • Towards the deployment of 3rd generation systems, Virtual Home Environment (VHE), stemming from 3GPP, appears to be a powerful concept advocating the provision and delivery of personalized services to roaming users across network and terminal boundaries. This paper aims to expose the pathway for materializing the VHE concept, via the specification, implementation and evaluation of a prototype. Core aspects for realizing the concept such as the business and roaming models are presented, while a VHE enabling architecture utilizing key technologies (OSA/Parlay, MExE, and USAT) is introduced. The proposed architecture has already been evaluated by performing an initial trial demonstration. Currently it is being extended to support VHE service provision to roaming users, an aspect to be addressed by the final trial.

Network Analysis of microRNAs, Genes and their Regulation in Mantle Cell Lymphoma

  • Deng, Si-Yu;Guo, Xiao-Xin;Wang, Ning;Wang, Kun-Hao;Wang, Shang
    • Asian Pacific Journal of Cancer Prevention
    • /
    • v.16 no.2
    • /
    • pp.457-463
    • /
    • 2015
  • The pathogenesis of mantle cell lymphoma, a special subtype of lymphoma that is invasive and indolent and has a median survival of 3 to 4 years, is still partially unexplained. Much research about genes and miRNAs has been conducted in recent years, but interactions and regulatory relations of genetic elements which may play a vital role in genesis of MCL have attracted only limited attention. The present study concentrated on regulatory relations about genes and miRNAs contributing to MCL pathogenesis. Numerous experimentally validated raw data were organized into three topology networks, comprising differentially expressed, associated and global examples. Comparison of similarities and dissimilarities of the three regulating networks, paired with the analysis of the interactions between pairs of elements in every network, revealed that the differentially expressed network illuminated the carcinogenicity mechanism of MCL and the related network further described the regulatory relations involved, including prevention, diagnosis, development and therapy. Three kinds of regulatory relations for host genes including miRNAs, miRNAs targeting genes and genes regulating miRNAs were concluded macroscopically. Regulation of the differentially expressed miRNAs was also analyzed, in terms of abnormal gene expression affecting the MCL pathogenesis. Special regulatory relations were uncovered. For example, auto-regulatory loops were found in the three topology networks, key pathways of the nodes being highlighted. The present study focused on a novel point of view revealing important influencing factors for MCL pathogenesis.

EXECUTION TIME AND POWER CONSUMPTION OPTIMIZATION in FOG COMPUTING ENVIRONMENT

  • Alghamdi, Anwar;Alzahrani, Ahmed;Thayananthan, Vijey
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.1
    • /
    • pp.137-142
    • /
    • 2021
  • The Internet of Things (IoT) paradigm is at the forefront of present and future research activities. The huge amount of sensing data from IoT devices needing to be processed is increasing dramatically in volume, variety, and velocity. In response, cloud computing was involved in handling the challenges of collecting, storing, and processing jobs. The fog computing technology is a model that is used to support cloud computing by implementing pre-processing jobs close to the end-user for realizing low latency, less power consumption in the cloud side, and high scalability. However, it may be that some resources in fog computing networks are not suitable for some kind of jobs, or the number of requests increases outside capacity. So, it is more efficient to decrease sending jobs to the cloud. Hence some other fog resources are idle, and it is better to be federated rather than forwarding them to the cloud server. Obviously, this issue affects the performance of the fog environment when dealing with big data applications or applications that are sensitive to time processing. This research aims to build a fog topology job scheduling (FTJS) to schedule the incoming jobs which are generated from the IoT devices and discover all available fog nodes with their capabilities. Also, the fog topology job placement algorithm is introduced to deploy jobs into appropriate resources in the network effectively. Finally, by comparing our result with the state-of-art first come first serve (FCFS) scheduling technique, the overall execution time is reduced significantly by approximately 20%, the energy consumption in the cloud side is reduced by 18%.

QLGR: A Q-learning-based Geographic FANET Routing Algorithm Based on Multi-agent Reinforcement Learning

  • Qiu, Xiulin;Xie, Yongsheng;Wang, Yinyin;Ye, Lei;Yang, Yuwang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.11
    • /
    • pp.4244-4274
    • /
    • 2021
  • The utilization of UAVs in various fields has led to the development of flying ad hoc network (FANET) technology. In a network environment with highly dynamic topology and frequent link changes, the traditional routing technology of FANET cannot satisfy the new communication demands. Traditional routing algorithm, based on geographic location, can "fall" into a routing hole. In view of this problem, we propose a geolocation routing protocol based on multi-agent reinforcement learning, which decreases the packet loss rate and routing cost of the routing protocol. The protocol views each node as an intelligent agent and evaluates the value of its neighbor nodes through the local information. In the value function, nodes consider information such as link quality, residual energy and queue length, which reduces the possibility of a routing hole. The protocol uses global rewards to enable individual nodes to collaborate in transmitting data. The performance of the protocol is experimentally analyzed for UAVs under extreme conditions such as topology changes and energy constraints. Simulation results show that our proposed QLGR-S protocol has advantages in performance parameters such as throughput, end-to-end delay, and energy consumption compared with the traditional GPSR protocol. QLGR-S provides more reliable connectivity for UAV networking technology, safeguards the communication requirements between UAVs, and further promotes the development of UAV technology.

Control of Distributed Micro Air Vehicles for Varying Topologies and Teams Sizes

  • Collins, Daniel-James;Arvin Agah
    • Transactions on Control, Automation and Systems Engineering
    • /
    • v.4 no.2
    • /
    • pp.176-187
    • /
    • 2002
  • This paper focuses on the study of simulation and evolution of Micro Air Vehicles. Micro Air Vehicles or MAVs are small flying robots that are used for surveillance, search and rescue, and other missions. The simulated robots are designed based on realistic characteristics and the brains (controllers) of the robots are generated using genetic algorithms, i .e., simulated evolution. The objective for the experiments is to investigate the effects of robot team size and topology (simulation environment) on the evolution of simulated robots. The testing of team sizes deals with finding an ideal number of robots to be deployed for a given mission. The goal of the topology experiments is to see if there is an ideal topology (environment) to evolve the robots in order to increase their utility in most environments. We compare the results of the various experiments by evaluating the fitness values of the robots i .e., performance measure. In addition, evolved robot teams are tested in different situation in order to determine if the results can be generalized, and statistical analysis is performed to evaluate the evolved results.

The Network Designs And Traffic Grooming Algorithm to Maximize the Throughput in WDM Ring Networks (WDM 링에서 트래픽 전송효율을 최대화하기 위한 네크워크 설계방법 및 트래픽 그루밍 알고리즘)

  • Yoon, Seung-Jin
    • Journal of IKEEE
    • /
    • v.13 no.2
    • /
    • pp.200-207
    • /
    • 2009
  • In this paper, novel traffic gromming algorithms are proposed with a primary goal of maximize the throughput in WDM(Wavelength Division Multiplexing) ring networks. To achieve this goal, we analyze two network designs that are Lightpath Designs and Virtual Topology Designs and simulate the throughput in various traffic environments. From this methods, we propose novel traffic gromming algorithms to maximize the throughput.

  • PDF

Reliability analysis of failure models in circuit-switched networks (회선교환망에서의 고장모델에 대한 신뢰도 분석)

  • 김재현;이종규
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.32A no.8
    • /
    • pp.1-10
    • /
    • 1995
  • We have analyzed the reliability of failure models in circuit-switched networks. These models are grid topology circuit-switched networks, and each node transmits a packet to a destination node using a Flooding routing method. We have assumed that the failure of each link and node is independent. We have considered two method to analyze reliability in these models : The Karnaugh Map method and joint probability method. In this two method, we have analyzed the reliability in a small grid topology circuit switched network by a joint probability method, and comared analytic results with simulated ones. For a large grid enormous. So, we have evaluated the reliability of the network by computer simulation techniques. As results, we have found that the analytic results are very close to simulated ones in a small grid topology circuit switched network. And, we have found that network reliability decreases exponentially, according to increment of link or node failure, and network reliability is almost linearly decreased according to increment of the number of links, by which call has passed. Finally, we have found an interesting result that nodes in a center of the network are superior to the other nodes from the reliability point of view.

  • PDF