• Title/Summary/Keyword: random table

Search Result 154, Processing Time 0.027 seconds

Space-Stretch Tradeoff Optimization for Routing in Internet-Like Graphs

  • Tang, Mingdong;Zhang, Guoqiang;Liu, Jianxun
    • Journal of Communications and Networks
    • /
    • v.14 no.5
    • /
    • pp.546-553
    • /
    • 2012
  • Compact routing intends to achieve good tradeoff between the routing path length and the memory overhead, and is recently considered as a main alternative to overcome the fundamental scaling problems of the Internet routing system. Plenty of studies have been conducted on compact routing, and quite a few universal compact routing schemes have been designed for arbitrary network topologies. However, it is generally believed that specialized compact routing schemes for peculiar network topologies can have better performance than universal ones. Studies on complex networks have uncovered that most real-world networks exhibit power-law degree distributions, i.e., a few nodes have very high degrees while many other nodes have low degrees. High-degree nodes play the crucial role of hubs in communication and inter-networking. Based on this fact, we propose two highest-degree landmark based compact routing schemes, namely HDLR and $HDLR^+$. Theoretical analysis on random power-law graphs shows that the two schemes can achieve better space-stretch trade-offs than previous compact routing schemes. Simulations conducted on random power-law graphs and real-world AS-level Internet graph validate the effectiveness of our schemes.

Block Unit Mapping Technique of NAND Flash Memory Using Variable Offset

  • Lee, Seung-Woo;Ryu, Kwan-Woo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.24 no.8
    • /
    • pp.9-17
    • /
    • 2019
  • In this paper, we propose a block mapping technique applicable to NAND flash memory. In order to use the NAND flash memory with the operating system and the file system developed on the basis of the hard disk which is mainly used in the general PC field, it is necessary to use the system software known as the FTL (Flash Translation Layer). FTL overcomes the disadvantage of not being able to overwrite data by using the address mapping table and solves the additional features caused by the physical structure of NAND flash memory. In this paper, we propose a new mapping method based on the block mapping method for efficient use of the NAND flash memory. In the case of the proposed technique, the data modification operation is processed by using a blank page in the existing block without using an additional block for the data modification operation, thereby minimizing the block unit deletion operation in the merging operation. Also, the frequency of occurrence of the sequential write request and random write request Accordingly, by optimally adjusting the ratio of pages for recording data in a block and pages for recording data requested for modification, it is possible to optimize sequential writing and random writing by maximizing the utilization of pages in a block.

Speech Synthesis for the Korean large Vocabulary Through the Waveform Analysis in Time Domains and Evauation of Synthesized Speech Quality (시간영역에서의 파형분석에 의한 무제한 어휘 합성 및 음절 유형별 규칙합성음 음질평가)

  • Kang, Chan-Hee;Chin, Yong-Ohk
    • The Journal of the Acoustical Society of Korea
    • /
    • v.13 no.1
    • /
    • pp.71-83
    • /
    • 1994
  • This paper deals with the improvement of the synthesized speech quality and naturality in the Korean TTS(Text-to-Speech) system. We had extracted the parameters(table2) such as its amplitude, duration and pitch period in a syllable through the analysis of speech waveforms(table1) in the time domain and synthesized syllables using them. To the frequencies of the Korean pronunciation large vocabulary dictionary we had synthesized speeches selected 229 syllables such as V types are 19, CV types are 80. VC types are 30 and CVC types are 100. According to the 4 Korean syllable types from the data format dictionary(table3) we had tested each 15 syllables with the objective MOS(Mean Opinion Score) evaluation method about the 4 items i.e., intelligibility, clearness, loudness, and naturality after selecting random group without the knowledge of them. As the results of experiments the qualities of them are very clear and we can control the prosodic elements such as durations, accents and pitch periods (fig9, 10, 11, 12).

  • PDF

Performance Analysis of Tree-based Indexing Scheme for Trajectories Processing of Moving Objects (이동객체의 궤적처리를 위한 트리기반 색인기법의 성능분석)

  • Shim, Choon-Bo;Shin, Yong-Won
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.7 no.4
    • /
    • pp.1-14
    • /
    • 2004
  • In this study, we propose Linktable based on extended TB-Tree(LTB-Tree) which can improve the performance of existing TB (Trajectory-Bundle)-tree proposed for indexing the trajectory of moving objects in GIS Applications. In addition, in order to evaluate proposed indexing scheme, we take into account as follows. At first, we select existing R*-tree, TB-tree, and LTB-tree as the subject of performance evaluation. Secondly, we make use of random data set and real data set as experimental data. Thirdly, we evaluate the performance with respect to the variation of size of memory buffer by considering the restriction of available memory of a given system. Fourth, we test them by using the experimental data set with a variation of data distribution. Finally, we think over insertion and retrieval performance of trajectory query and range query as experimental measures. The experimental results show that the proposed indexing scheme, LTB-tree, gains better performance than traditional other schemes with respect to the insertion and retrieval of trajectory query.

  • PDF

Memory-Efficient Time-Memory Trade-Off Cryptanalysis (메모리 효율적인 TMTO 암호 해독 방법)

  • Kim, Young-Sik;Lim, Dae-Woon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.1C
    • /
    • pp.28-36
    • /
    • 2009
  • Time-memory trade-off (TMTO) cryptanalysis proposed by Hellman can be applied for the various crypto-systems such as block ciphers, stream ciphers, and hash functions. In this paper, we propose a novel method to reduce memory size for storing TMTO tables. The starting points in a TMTO table can be substituted by the indices of n-bit samples from a sequence in a family of pseudo-random sequences with good cross-correlation, which results in the reduction of memory size for the starting points. By using this method, it is possible to reduce the memory size by the factor of 1/10 at the cost of the slightly increasing of operation time in the online phase. Because the memory is considered as more expensive resource than the time, the TMTO cryptanalysis will be more feasible for many real crypto systems.

Development of Context Awareness and Service Reasoning Technique for Handicapped People (장애인을 위한 상황인식 및 서비스 추론기술 개발)

  • Ko, Kwang-Eun;Shin, Dong-Jun;Sim, Kwee-Bo
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.18 no.4
    • /
    • pp.512-517
    • /
    • 2008
  • It is show that increasing of aged and handicapped people requires development of Ubiquitous computing technique to offer the specialized service for handicapped-people. For this, we need a development of Context Awareness and Service Reasoning Technique that the technique is supplied interaction between user and U-environment instead of the old unilateral relation. The old research of context awareness needed probabilistic presentation model like a Bayesian Network based on expert Systems for recognize given circumstance by a domain of uncertain real world. In this article, we define a domain of disorder activity assistant service application and context model based on ontology in diversified environment and minimized intervention of user and developer. By use this context model, we apply the structure learning of Bayesian Network and decide the service and activity to development of application service for handicapped people. Finally, we define the proper Conditional Probability Table of the structured Bayesian Network and if random situation is given to user, then present state variable of Activity and Service by given Causal relation of Bayesian Network based on Conditional Probability Table and it can be result of context awareness.

The Efficient Merge Operation in Log Buffer-Based Flash Translation Layer for Enhanced Random Writing (임의쓰기 성능향상을 위한 로그블록 기반 FTL의 효율적인 합병연산)

  • Lee, Jun-Hyuk;Roh, Hong-Chan;Park, Sang-Hyun
    • The KIPS Transactions:PartD
    • /
    • v.19D no.2
    • /
    • pp.161-186
    • /
    • 2012
  • Recently, the flash memory consistently increases the storage capacity while the price of the memory is being cheap. This makes the mass storage SSD(Solid State Drive) popular. The flash memory, however, has a lot of defects. In order that these defects should be complimented, it is needed to use the FTL(Flash Translation Layer) as a special layer. To operate restrictions of the hardware efficiently, the FTL that is essential to work plays a role of transferring from the logical sector number of file systems to the physical sector number of the flash memory. Especially, the poor performance is attributed to Erase-Before-Write among the flash memory's restrictions, and even if there are lots of studies based on the log block, a few problems still exists in order for the mass storage flash memory to be operated. If the FAST based on Log Block-Based Flash often is generated in the wide locality causing the random writing, the merge operation will be occur as the sectors is not used in the data block. In other words, the block thrashing which is not effective occurs and then, the flash memory's performance get worse. If the log-block makes the overwriting caused, the log-block is executed like a cache and this technique contributes to developing the flash memory performance improvement. This study for the improvement of the random writing demonstrates that the log block is operated like not only the cache but also the entire flash memory so that the merge operation and the erase operation are diminished as there are a distinct mapping table called as the offset mapping table for the operation. The new FTL is to be defined as the XAST(extensively-Associative Sector Translation). The XAST manages the offset mapping table with efficiency based on the spatial locality and temporal locality.

Study on the Estimate of Stand Volume in the Pitch Pine Forest (임분재적(林分材積) 추정(推定)에 관(關)한 연구(硏究))

  • Lee, Yeo Ha
    • Journal of Korean Society of Forest Science
    • /
    • v.18 no.1
    • /
    • pp.1-7
    • /
    • 1973
  • This survey was estimated under the ratio estimate such as single class method, simple random sampling method, compound ratio sampling method, separate ratio sampling method and average tree sampling method artificial forest pitch pine volume. The following results were realized by the ratio estimates. At the above table simple random sampling method and compound ratio sampling method are the only ones which is included the actual stand volume in the ratio estimatedstand volume. It is thought that the sampling was in a such good result was because of stand structual stands were simple forest. The most simple measurement and calcuation on the stand volume estimates, in order, would be (1) single class method, (2) simple random sampling method (3) average tree method (4) separate ratio sampling method and compound ratio sampling method, and at the planted evenaged forest the method has realized the best results in obtaining good accuracy and the measure stand volume with least time, expenses and labor in considerably.

  • PDF

New Secure Network Coding Scheme with Low Complexity (낮은 복잡도의 보안 네트워크 부호화)

  • Kim, Young-Sik
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38A no.4
    • /
    • pp.295-302
    • /
    • 2013
  • In the network coding, throughput can be increased by allowing the transformation of the received data at the intermediate nodes. However, the adversary can obtain more information at the intermediate nodes and make troubles for decoding of transmitted data at the sink nodes by modifying transmitted data at the compromised nodes. In order to resist the adversary activities, various information theoretic or cryptographic secure network coding schemes are proposed. Recently, a secure network coding based on the cryptographic hash function can be used at the random network coding. However, because of the computational resource requirement for cryptographic hash functions, networks with limited computational resources such as sensor nodes have difficulties to use the cryptographic solution. In this paper, we propose a new secure network coding scheme which uses linear transformations and table lookup and safely transmits n-1 packets at the random network coding under the assumption that the adversary can eavesdrop at most n-1 nodes. It is shown that the proposed scheme is an all-or-nothing transform (AONT) and weakly secure network coding in the information theory.

Studies on the soybean varieties in Korea. -IV relationships between the seed yields and some characteristics on the several sowing dates- (대두의 품종에 관한 연구 -제4보 파종기별 수량과 제특성과의 관계-)

  • Kwon-Yawl Chang
    • KOREAN JOURNAL OF CROP SCIENCE
    • /
    • v.2
    • /
    • pp.30-37
    • /
    • 1964
  • Experiments were carried out to clarify the relationships between seed yields and some ecological characteristics, seed yields and some morphological characteristics, and the relationships among the varietal yields on the several sowing plots when grown under different climatic conditions. Twenty-four soybean varieties were used as the material, selected at random from 138 varieties which were cultivated the year before. These varieties were grown in the Experimental Farm, Chinju Agricultural College, Kyung Sang Namdo, Korea, and seed sowing was conducted at 5 times, from April to July, in 1962 and 1963. The results obtained are summarized as follows: 1. Correlations between seed yields and some ecological characteristics on the sowing date bases are shown in Table 1. Among some ecological characteristics, it was observed that there wert close relationships between seed yields and days to flowering, and between seed yields and the total growing length, except on the late sowing, i.e. July sowing plots, However, there was no clear correlation between seed yields and durations of flowering, and between seed yields and days from flowering to maturity. 2. Correlations between seed yields and some morphological characteristics on the sowing date bases are shown in Table 2. From this table, it was also observed that there were some close relationships between seed yields and branch number for plant, stem diameter, plant weight, pod number per plant, and grain number per plant, but there was no clear relationship between seed yields and stem length, and between seed yields and 100 grain weight, on every sowing plot. 3. Relations between varietal yields and the sowing dates are shown in Table 3. Our leading varieties such as Ulsan, Sangdoo, Changdan Backmok, Iksan, Haman, Barchongdeo, and Anion Daerip, which belong to the maturity groups of IV, V, and VI, have been significantly high in yield at each sowing date plot, but the extreme early varieties, that frequently are damaged by insects, moisture and diseases, and the extreme late varieties, that frequently are caught by frost suffering reduced yield, are showed a lower yield than the others. However, extreme early varieties, for instance, Black Hawk, an American variety, and Chung Buk Baek, a Korean early variety, showed high productivity on the late sowing, June and July sowing plots, and Do san No. 6, which is late Japanese variety, showed a high yield on the extreme early sowing, i.e. April sowing plots. 4. Relations between seed yields and the sowing dates on the varietal bases are shown in Table 4. It was observed that, the early varieties did not differ much in yields at the various sowing dates while the yields of late varieties decreased progressively with subsequent dates. However, the extreme late varieties, such as Tamanishiki, that frequently are caught by frost suffering reduced yield, may be difficult to harvest at this location. The results in these experiments showed that in most cases maximum yields were obtained when leading varieties, which are medium or late varieties, were shown in Mid-May, and progressively lower yields were produced from June and July sowings. On the other hand, the late sowings of the early varieties, such as Black Hawk and Chung Buk Baek, in these experiments showed favorable yields compared with the others. From these results, we can predict that our local medium or late varieties produce higher yields at this location than was produced by early varieties in most of the sowing dates, especially the May sowing, and early varieties such as Black Hawk and Chung Buk Baek should be used in the late sowing, June sowing time.

  • PDF