• Title/Summary/Keyword: redundant structure

Search Result 153, Processing Time 0.028 seconds

Mass Memory Operation for Telemetry Processing of LEO Satellite (저궤도위성 원격측정 데이터 처리를 위한 대용량 메모리 운용)

  • Chae, Dong-Seok;Yang, Seung-Eun;Cheon, Yee-Jin
    • Aerospace Engineering and Technology
    • /
    • v.11 no.2
    • /
    • pp.73-79
    • /
    • 2012
  • Because the contact time between satellite and ground station is very limited in LEO (Low Earth Orbit) satellite, all telemetry data generated on spacecraft bus are stored in a mass memory and downlinked to the ground together with real time data during the contact time. The mass memory is initialized in the first system initialization phase and the page status of each memory block is generated step by step. After the completion of the system initialization, the telemetry data are continuously stored and the stored data are played back to the ground by command. And the memory scrubbing is periodically performed for correction of single bit error which can be generated on harsh space environment. This paper introduces the mass memory operation method for telemetry processing of LEO satellite. It includes a general mass memory data structure, the methods of mass memory initialization, scrubbing, data storage and downlink, and mass memory management of primary and redundant mass memory.

An Efficient Scheme to Create Data Delivery Tree for Community Group Communication (커뮤니티 그룹 통신을 위한 효율적인 데이터 전달 트리 구성 방안)

  • Oh, Je-Jun;Kang, Nam-Hi;Kim, Yong-Hyuk;Kim, Young-Han
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.10
    • /
    • pp.55-63
    • /
    • 2007
  • Multicast is an efficient transport mechanism for community communications and MANET is recently regarded as a promising solution for support ubiquitous computing as an underlying network technology. However, it is hard to deploy multicast mechanism into MANET owing to scarce resources in wireless networks and unpredictable changes in network topology. Several multicast mechanisms have been proposed in the literature to overcome the limitations. Especially, overlay multicasting schemes present several advantages over network based multicasting schemes. Yet, the overlay multicasting schemes still introduce redundant data transmissions that waste network bandwidth and battery of relay nodes. As a result the performance of the network is degraded. To reduce the redundancy, we propose an efficient way to construct an overlay structure as a multicast data delivery tree that utilizes a branch node which belongs to the tree. By using network simulation, we show that the proposed scheme presents higher packet delivery ratio and lower transmission cost than previously proposed schemes.

Approximate System Reliability Analysis Under Multiple Time Varying Loads (복합 하중하에서의 구조물 체계 신뢰도 해석)

  • 김상효
    • Computational Structural Engineering
    • /
    • v.1 no.2
    • /
    • pp.101-109
    • /
    • 1988
  • The evaluation of the system reliability is generally quite difficult and costly as the structure becomes large and complex, especially when it is subjected to multiple time varying loads, and for redundant structures which have many possible modes of failur, e.g., system collapse through the formation of plastic hinge mechanisms. In reality most loadings acting on the structures are random in intensity as well as in occurrence time and duration. To include the load variability in time, the loads are described in terms of stochastic processes. Based on a tri-modal upper bound, a point estimate for the system reliability has been developed for more accuracy without extensive computational effort. This tri-modal point estimate also ensures the continuity of the system reliability function, which is a necessary condition in many nonlinear programming techniques. In addition, the Load Coincidence method, by which the combined effect of time varying loads are taken into account, has been modified to suitable for cases with an always-on load.

  • PDF

Genetic and biochemical evidence for redundant pathways leading to mycosporine-like amino acid biosynthesis in the cyanobacterium Sphaerospermopsis torques-reginae ITEP-024

  • Geraldes, Vanessa;de Medeiros, Livia Soman;Lima, Stella T.;Alvarenga, Danillo Oliveira;Gacesa, Ranko;Long, Paul F.;Fiore, Marli Fatima;Pinto, Ernani
    • ALGAE
    • /
    • v.35 no.2
    • /
    • pp.177-187
    • /
    • 2020
  • Cyanobacteria have been widely reported to produce a variety of UV-absorbing mycosporine-like amino acids (MAAs). Herein, we reported production of the unusual MAA, mycosporine-glycine-alanine (MGA) in the cyanobacterium Sphaerospermopsis torques-reginae ITEP-024 using a newly developed UHPLC-DAD-MS/HRMS (ultra-high performance liquid chromatography-diode array detection-high resolution tandem mass spectrometry) method. MGA had previously been first identified in a red-algae, but S. torques-reginae strain ITEP-024 is the first cyanobacteria to be reported as an MGA producer. Herein, the chemical structure of MGA is fully elucidated from one-dimensional / two-dimensional nuclear magnetic resonance and HRMS data analyses. MAAs are unusually produced constitutively in S. torques-reginae ITEP-024, and this production was further enhanced following UV-irradiance. It has been proposed that MAA biosynthesis proceeds in cyanobacteria from the pentose phosphate pathway intermediate sedoheptulose 7-phosphate. Annotation of a gene cluster encoded in the genome sequence of S. torques-reginae ITEP-024 supports these gene products could catalyse the biosynthesis of MAAs. However, addition of glyphosate to cultures of S. torques-reginae ITEP-024 abolished constitutive and ultra-violet radiation induced production of MGA, shinorine and porphyra-334. This finding supports involvement of the shikimic acid pathway in the biosynthesis of MAAs by this species.

Speed Enhancement Technique for Ray Casting using 2D Resampling (2차원 리샘플링에 기반한 광선추적법의 속도 향상 기법)

  • Lee, Rae-Kyoung;Ihm, In-Sung
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.27 no.8
    • /
    • pp.691-700
    • /
    • 2000
  • The standard volume ray-tracing, optimized with octree, needs to repeatedly traverse hierarchical structures for each ray that often leads to redundant computations. It also employs the expensive 3D interpolation for producing high quality images. In this paper, we present a new ray-casting method that efficiently computes shaded colors and opacities at resampling points by traversing octree only once. This method traverses volume data in object-order, finds resampling points on slices incrementally, and performs resampling based on 2D interpolation. While the early ray-termination, which is one of the most effective optimization techniques, is not easily combined with object-order methods, we solved this problem using a dynamic data structure in image space. Considering that our new method is easy to implement, and need little additional memory, it will be used as very effective volume method that fills the performance gap between ray-casting and shear-warping.

  • PDF

The Multiple Continuous Query Fragmentation for the Efficient Sensor Network Management (효율적인 센서 네트워크 관리를 위한 다중 연속질의 분할)

  • Park, Jung-Up;Jo, Myung-Hyun;Kim, Hak-Soo;Lee, Dong-Ho;Son, Jin-Hyun
    • The KIPS Transactions:PartD
    • /
    • v.13D no.7 s.110
    • /
    • pp.867-878
    • /
    • 2006
  • In the past few years, the research of sensor networks is forced dramatically. Specially, while the research for maintaining the power of a sensor is focused, we are also concerned nth query processing related with the optimization of multiple continuous queries for decreasing in unnecessary energy consumption of sensor networks. We present the fragmentation algorithm to solve the redundancy problem in multiple continuous queries that increases in the count or the amount of transmitting data in sensor networks. The fragmentation algorithm splits one query into more than two queries using the query index (QR-4ree) in order to reduce the redundant query region between a newly created query and the existing queries. The R*-tree should be reorganized to the QR-tree right to the structure suggested. In the result, we preserve 20 percentage of the total energy in the sensor networks.

Development of Artificial Intelligence Janggi Game based on Machine Learning Algorithm (기계학습 알고리즘 기반의 인공지능 장기 게임 개발)

  • Jang, Myeonggyu;Kim, Youngho;Min, Dongyeop;Park, Kihyeon;Lee, Seungsoo;Woo, Chongwoo
    • Journal of Information Technology Services
    • /
    • v.16 no.4
    • /
    • pp.137-148
    • /
    • 2017
  • Researches on the Artificial Intelligence has been explosively activated in various fields since the advent of AlphaGo. Particularly, researchers on the application of multi-layer neural network such as deep learning, and various machine learning algorithms are being focused actively. In this paper, we described a development of an artificial intelligence Janggi game based on reinforcement learning algorithm and MCTS (Monte Carlo Tree Search) algorithm with accumulated game data. The previous artificial intelligence games are mostly developed based on mini-max algorithm, which depends only on the results of the tree search algorithms. They cannot use of the real data from the games experts, nor cannot enhance the performance by learning. In this paper, we suggest our approach to overcome those limitations as follows. First, we collects Janggi expert's game data, which can reflect abundant real game results. Second, we create a graph structure by using the game data, which can remove redundant movement. And third, we apply the reinforcement learning algorithm and MCTS algorithm to select the best next move. In addition, the learned graph is stored by object serialization method to provide continuity of the game. The experiment of this study is done with two different types as follows. First, our system is confronted with other AI based system that is currently being served on the internet. Second, our system confronted with some Janggi experts who have winning records of more than 50%. Experimental results show that the rate of our system is significantly higher.

The Design and Implementation of an Agent for Resolving the Problem of Redundant Input of Distributed Human Resources Information (산재된 인력정보의 중복입력 문제 해결을 위한 에이전트 설계 및 구현 방법에 관한 연구)

  • Shon, Kang-Ryul;Han, Hee-Jun;Lim, Jong-Tae
    • Journal of Information Management
    • /
    • v.38 no.1
    • /
    • pp.75-98
    • /
    • 2007
  • Each domain of web services increased in geometrical progression by remarkable growth of the Internet serves various services or functions, and earns an income. And all services are divided by individual goal in each domain. What counts is that we must offer a personal data, our human resource information to use web service in the majority of cases. Otherwise we have to act under constraint in using the many web services. In this paper, we analyze the database structure or schema for managing human resource information from several web sites or service demands, and propose an agent design and implementation method for preventing duplication input of personal human resource information and sharing the human resource data.

Novel Robust High Dynamic Range Image Watermarking Algorithm Against Tone Mapping

  • Bai, Yongqiang;Jiang, Gangyi;Jiang, Hao;Yu, Mei;Chen, Fen;Zhu, Zhongjie
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.9
    • /
    • pp.4389-4411
    • /
    • 2018
  • High dynamic range (HDR) images are becoming pervasive due to capturing or rendering of a wider range of luminance, but their special display equipment is difficult to be popularized because of high cost and technological problem. Thus, HDR images must be adapted to the conventional display devices by applying tone mapping (TM) operation, which puts forward higher requirements for intellectual property protection of HDR images. As the robustness presents regional diversity in the low dynamic range (LDR) watermarked image after TM, which is different from the traditional watermarking technologies, a concept of watermarking activity is defined and used to distinguish the essential distinction of watermarking between LDR image and HDR image in this paper. Then, a novel robust HDR image watermarking algorithm is proposed against TM operations. Firstly, based on the hybrid processing of redundant discrete wavelet transform and singular value decomposition, the watermark is embedded by modifying the structure information of the HDR image. Distinguished from LDR image watermarking, the high embedding strength can cause more obvious distortion in the high brightness regions of HDR image than the low brightness regions. Thus, a perceptual brightness mask with low complexity is designed to improve the imperceptibility further. Experimental results show that the proposed algorithm is robust to the existing TM operations, with taking into account the imperceptibility and embedded capacity, which is superior to the current state-of-art HDR image watermarking algorithms.

Protein Disorder/Order Region Classification Using EPs-TFP Mining Method (EPs-TFP 마이닝 기법을 이용한 단백질 Disorder/Order 지역 분류)

  • Lee, Heon Gyu;Shin, Yong Ho
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.17 no.6
    • /
    • pp.59-72
    • /
    • 2012
  • Since a protein displays its specific functions when disorder region of protein sequence transits to order region with provoking a biological reaction, the separation of disorder region and order region from the sequence data is urgently necessary for predicting three dimensional structure and characteristics of the protein. To classify the disorder and order region efficiently, this paper proposes a classification/prediction method using sequence data while acquiring a non-biased result on a specific characteristics of protein and improving the classification speed. The emerging patterns based EPs-TFP methods utilizes only the essential emerging pattern in which the redundant emerging patterns are removed. This classification method finds the sequence patterns of disorder region, such sequence patterns are frequently shown in disorder region but relatively not frequently in the order region. We expand P-tree and T-tree conceptualized TFP method into a classification/prediction method in order to improve the performance of the proposed algorithm. We used Disprot 4.9 and CASP 7 data to evaluate EPs-TFP technique, the results of order/disorder classification show sensitivity 73.6, specificity 69.51 and accuracy 74.2.