• Title/Summary/Keyword: Selection probability

Search Result 643, Processing Time 0.02 seconds

A Study on the Catching Selectivity of the Ark Shell(Scapharca Broughtonii)Dredge (피조개 항망의 어획선택성에 관한 연구)

  • 조봉곤
    • Journal of the Korean Society of Fisheries and Ocean Technology
    • /
    • v.35 no.4
    • /
    • pp.366-376
    • /
    • 1999
  • In order to examine the catching selectivity of the ark shell(Scapharca broughtonii) dredge, the various factors affecting the selective action of the dredge are analyzed, and the probabilities of the ark shell not shifting through the gaps between the teeth, and the mesh of the netting bag, are calculated for the various shell lengths, using the relation between the posture and the length when the shell passes through these parts.Considering that the probability of making catch is the product of the both probabilities described above, and that this probability is proportional to the relative catching efficiency, the selectivity curves for the ark shell dredge were estimated for various gaps between the teeth and for the various mesh sizes of the netting bag. The obtained results are summarized as follows :1. The ratios of the shell length of ark shell to the distance between teeth indicating the relative catching efficiency of 0%, 50, 100% respectively were 1.0, 1.26~1.28, 1.47~1.44, and that the selection ranges of selective shell length by the distance between teeth were 0.47~0.44, where the distances between teeth were 3.2cm, 3.6cm, 4.0cm, 4.4cm and 4.8cm. 2. The ratios of the shell length of ark shell to the mesh size indicating the relative catching efficiency of 0%, 50%, 100% respectively were 0.67, 0.84, 0.97 and that the selection range of shell length for catching, that in the range of selective shell length by the mesh size was 0.31, where the distance of 4.0cm between teeth, mesh size of 6.0 cm and the smaller mesh angle of $60^{\circ}$3. Where the distance between teeth is 4.0 cm and the smaller mesh angle is $60^{\circ}$, the selection range of shell length for catching of the ark shell dredge is decreased according to the mesh size, and it is minimized by 0.20 in the mesh size of 9.0~10.0 cm, but increased in the mesh size of over 11.0 cm. 4. Where the distance between teeth is 4.0 cm, the selective action by the mesh size of netting bag is begun with the mesh size of over 10.0 cm.

  • PDF

Size selectivity of gill net for female snow crab, Chionoecetes opilio (자망에 대한 대게 암컷의 망목 선택성)

  • Park, Chang-Doo;An, Heui-Chun;Cho, Sam-Kwang;Bae, Bong-Seong;Park, Hae-Hoon;Bae, Jae-Hyun;Kim, Hyun-Young
    • Journal of the Korean Society of Fisheries and Ocean Technology
    • /
    • v.45 no.2
    • /
    • pp.122-127
    • /
    • 2009
  • A series of fishing experiments was carried out in the eastern coastal waters of Korea from January, 2002 to March, 2003, using gill nets of different mesh sizes (m 180, 210, 240, 270 and 300 mm) to determine the size selectivity of gill net for female snow crab, Chionoecetes opilio. The catch of experimental gears was mostly snow crab (97%), Chionoecetes opilio. The maximum carapace length (RL) of each female snow crab caught in the fishing experiments was measured. The master selection curve was estimated by applying the extended Kitahara s method. The selection curve showed that the gill nets of larger mesh size allowed more female crabs of small carapace size to escape. The optimum values of RL/m for 1.0 of retention probability was 0.563 and RL/m was estimated to be 0.249, 0.290, 0.319, 0.344 and 0.367 when the retention probability were 0.1, 0.2, 0.3, 0.4 and 0.5, respectively.

Performance of Multiple-Relay Cooperative Communication Networks under Soft-Decision-and-Forward Protocol (연판정 후 전송 방식을 적용한 다중 안테나 다중 릴레이 협동통신망의 성능 분석)

  • Song, Kyoung-Young;No, Jong-Seon;Kim, Tae-Guen;Sung, Joon-Hyun;Rim, Min-Joong;Lim, Dae-Woon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.5A
    • /
    • pp.431-439
    • /
    • 2010
  • In this paper, multiple-relay cooperative communication network with multiple antennas is considered. Applying the soft-decision-and-forward protocol to this system, pairwise error probability(PEP) is derived and then symbol error rate(SER) is also calculated. However, in general, signals are transmitted through the orthogonal channel in the multiple-relay cooperative communication network for the prevention of interference, which is inefficient in terms of the throughput. For the improvement of throughput, the relay selection is considered, where the relay having the maximum instantaneous end-to-end signal-to-noise ratio is chosen. Performance of the system is analyzed in terms of PEP and SER. As the number of the relay increases, relay selection method outperforms the conventional multiple-relay transmission system where all relays participate in the second time slot.

Improved Tag Selection for Tag-cloud using the Dynamic Characteristics of Tag Co-occurrence (태그 동시 출현의 동적인 특징을 이용한 개선된 태그 클라우드의 태그 선택 방법)

  • Kim, Du-Nam;Lee, Kang-Pyo;Kim, Hyoung-Joo
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.15 no.6
    • /
    • pp.405-413
    • /
    • 2009
  • Tagging system is the system that allows internet users to assign new meta-data which is called tag to article, photo, video and etc. for facilitating searching and browsing of web contents. Tag cloud, a visual interface is widely used for browsing tag space. Tag cloud selects the tags with the highest frequency and presents them alphabetically with font size reflecting their popularity. However the conventional tag selection method includes known weaknesses. So, we propose a novel tag selection method Freshness, which helps to find fresh web contents. Freshness is the mean value of Kullback-Leibler divergences between each consecutive change of tag co-occurrence probability distribution. We collected tag data from three web sites, Allblog, Eolin and Technorati and constructed the system, 'Fresh Tag Cloud' which collects tag data and creates our tag cloud. Comparing the experimental results between Fresh Tag Cloud and the conventional one with data from Allblog, our one shows 87.5% less overlapping average, which means Fresh Tag Cloud outperforms the conventional tag cloud.

Robust Backup Path Selection in Overlay Routing with Bloom Filters

  • Zhou, Xiaolei;Guo, Deke;Chen, Tao;Luo, Xueshan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.8
    • /
    • pp.1890-1910
    • /
    • 2013
  • Routing overlay offers an ideal methodology to improve the end-to-end communication performance by deriving a backup path for any node pair. This paper focuses on a challenging issue of selecting a proper backup path to bypass the failures on the default path with high probability for any node pair. For existing backup path selection approaches, our trace-driven evaluation results demonstrate that the backup and default paths for any node pair overlap with high probability and hence usually fail simultaneously. Consequently, such approaches fail to derive a robust backup path that can take over in the presence of failure on the default path. In this paper, we propose a three-phase RBPS approach to identify a proper and robust backup path. It utilizes the traceroute probing approach to obtain the fine-grained topology information, and systematically employs the grid quorum system and the Bloom filter to reduce the resulting communication overhead. Two criteria, delay and fault-tolerant ability on average, of the backup path are proposed to evaluate the performance of our RBPS approach. Extensive trace-driven evaluations show that the fault-tolerant ability of the backup path can be improved by about 60%, while the delay gain ratio concentrated at 14% after replacing existing approaches with ours. Consequently, our approach can derive a more robust and available backup path for any node pair than existing approaches. This is more important than finding a backup path with the lowest delay compared to the default path for any node pair.

Selection of the economically optimal parameters in the EWMA control chart (지수가중이동평균관리도의 경제적 최적모수의 선정)

  • 박창순;원태연
    • The Korean Journal of Applied Statistics
    • /
    • v.9 no.1
    • /
    • pp.91-109
    • /
    • 1996
  • Exponentially weighted moving averae(EWMA) control chart has been used widely for process monitoring and process adjustment recently, but there has not been many studies about the selection of the parameters. Design of the control chart can be classified into the statistical design and the economic design. The purpose of the economic design is to minimize the cost function in which all the possible costs occurring during the process are probability given the Type I error probability. In this paper the optimal parameters of the EWMA chart are selected for the economic design as well as for the statistical design. The optimal parameters for the economic design show significantly different from those of the statistical design, and especially the weight is always larger than that used in the statistical design. In the economic design, we divide the model into the single assignable cause model and the multiple assignable causes model caacording to number of which is used as the average context of the multiple assignable causes, it shows that the selection of the parameters may be misleading when the multiple assignable causes exist in practice.

  • PDF

Performance Comparison of Relay Selection-Based Amplify-and-Forward Relaying Systems using Full or Partial Channel Information (전체 채널 정보와 부분 채널 정보를 이용하는 중계 노드 선택 기반 증폭 후 전달 중계 시스템의 성능 비교)

  • Lee, In-Ho
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.11 no.6
    • /
    • pp.70-80
    • /
    • 2012
  • In this paper, we consider the amplify-and-forward relaying systems with the relay selection (AF-RS) using full channel information (FCI) and using partial channel information (PCI), respectively, in which the direct communication link between a source and a destination is available. And, the outage probabilities for the AF-RS using FCI and using PCI are investigated in Rayleigh fading channels, respectively. We provide exact outage probabilities, tight outage probability lower bounds, and asymptotic outage probabilities, respectively. And also, we present coding gains achievable by the AF-RS using FCI and using PCI. Through numerical investigation, all the analytic expressions are verified, and the coding gains are respectively evaluated with different average channel powers for the first and the second hop as well as different numbers of relays.

Comparison of confidence intervals for testing probabilities of a system (시스템의 확률 값 시험을 위한 신뢰구간 비교 분석)

  • Hwang, Ik-Soon
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.5 no.5
    • /
    • pp.435-443
    • /
    • 2010
  • When testing systems that incorporate probabilistic behavior, it is necessary to apply test inputs a number of times in order to give a test verdict. Interval estimation can be used to assert the correctness of probabilities where the selection of confidence interval is one of the important issues for quality of testing. The Wald interval has been widely accepted for interval estimation. In this paper, we compare the Wald interval and the Agresti-Coull interval for various sizes of samples. The comparison is carried out based on the test pass probability of correct implementations and the test fail probability of incorrect implementations when these confidence intervals are used for probability testing. We consider two-sided confidence intervals to check if the probability is close to a given value. Also one-sided confidence intervals are considered in the comparison in order to check if the probability is not less than a given value. When testing probabilities using two-sided confidence intervals, we recommend the Agresti-Coull interval. For one-sided confidence intervals, the Agresti-Coull interval is recommended when the size of samples is large while either one of two confidence intervals can be used for small size samples.

Performance Analysis of Amplify-and-Forward Relaying in Cooperative Networks with Partial Relay Selection (부분 중계노드 선택 기반의 협력 네트워크에서 증폭 후 전송 방식에 대한 성능분석)

  • Hwang, Ho-seon;Ahn, Kyung-seung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.12
    • /
    • pp.2317-2323
    • /
    • 2015
  • In this paper, we analyze the performance of dual-hop amplify-and-forward (AF) relaying in cooperative networks with partial relay selection. An AF relay gain considered in this paper includes channel-noise-assisted relay gain. Leveraging a received signal-to-noise ratio (SNR) model, we derive exact closed-form expressions for the probability density function (pdf) and cumulative distribution function (cdf) of the end-to-end SNR. Moreover, an exact closed-form expression of the ergodic capacity for dual-hop AF relaying with channel-noise-assisted relay gain and partial relay selection is investigated. The analytical results shown in this paper are confirmed by Monte-Carlo simulations.

Modified AntNet Algorithm for Network Routing (네트워크 라우팅을 위한 개선된 AntNet 알고리즘)

  • Kang, Duk-Hee;Lee, Mal-Rey
    • Journal of KIISE:Software and Applications
    • /
    • v.36 no.5
    • /
    • pp.396-400
    • /
    • 2009
  • During periods of large data transmission, routing selection methods are used to efficiently manage data traffic and improve the speed of transmission. One approach in routing selection is AntNet that applies the Ant algorithm in transmissions with uniform probability. However, this approach uses random selection, which can cause excessive data transmission rates and fail to optimize data This paper presents the use of the Genetic Algorithm (GA) to efficiently route and disperse data transmissions, during periods with "unnecessary weight increases for random selection". This new algorithm for improved performance provides highly accurate estimates of the transmission time and the transmission error rate.