• Title/Summary/Keyword: GSO

Search Result 56, Processing Time 0.034 seconds

Conditional Branch Optimization in the Compilers for Superscalar Processors (수퍼스칼라 프로세서를 위한 컴파일러에서 조건부 분기의 최적화)

  • Kim, Myung-Ho;Choi, Wan
    • The Transactions of the Korea Information Processing Society
    • /
    • v.2 no.2
    • /
    • pp.264-276
    • /
    • 1995
  • In this paper, a technique for eliminating conditional branches in the compilers for superscalar processors is presented. The technique consists of three major steps. The first step transforms conditional branches into equivalent expressions using algebraic laws. The second step searches all possible instruction sequences for those expressions using GSO of Granlund/Kenner. Finally an optimal sequence that has the least dynamic count for the target superscalar processor is selected from the GSO output. Experiment result shows that for each conditional branch is the input program matched by one of the optimization patterns, the proposed technique outperforms more than 25% speedup of execution time over the original code when the GNU C compiler and the SuperSPARC processor are used.

  • PDF

Performance Characteristics of 3D GSO PET/CT Scanner (Philips GEMINI PET/DT) (3차원 GSO PET/CT 스캐너(Philips GEMINI PET/CT의 특성 평가)

  • Kim, Jin-Su;Lee, Jae-Sung;Lee, Byeong-Il;Lee, Dong-Soo;Chung, June-Key;Lee, Myung-Chul
    • The Korean Journal of Nuclear Medicine
    • /
    • v.38 no.4
    • /
    • pp.318-324
    • /
    • 2004
  • Purpose: Philips GEMINI is a newly introduced whole-body GSO PET/CT scanner. In this study, performance of the scanner including spatial resolution, sensitivity, scatter fraction, noise equivalent count ratio (NECR) was measured utilizing NEMA NU2-2001 standard protocol and compared with performance of LSO, BGO crystal scanner. Methods: GEMINI is composed of the Philips ALLEGRO PET and MX8000 D multi-slice CT scanners. The PET scanner has 28 detector segments which have an array of 29 by 22 GSO crystals ($4{\times}6{\times}20$ mm), covering axial FOV of 18 cm. PET data to measure spatial resolution, sensitivity, scatter fraction, and NECR were acquired in 3D mode according to the NEMA NU2 protocols (coincidence window: 8 ns, energy window: $409[\sim}664$ keV). For the measurement of spatial resolution, images were reconstructed with FBP using ramp filter and an iterative reconstruction algorithm, 3D RAMLA. Data for sensitivity measurement were acquired using NEMA sensitivity phantom filled with F-18 solution and surrounded by $1{\sim}5$ aluminum sleeves after we confirmed that dead time loss did not exceed 1%. To measure NECR and scatter fraction, 1110 MBq of F-18 solution was injected into a NEMA scatter phantom with a length of 70 cm and dynamic scan with 20-min frame duration was acquired for 7 half-lives. Oblique sinograms were collapsed into transaxial slices using single slice rebinning method, and true to background (scatter+random) ratio for each slice and frame was estimated. Scatter fraction was determined by averaging the true to background ratio of last 3 frames in which the dead time loss was below 1%. Results: Transverse and axial resolutions at 1cm radius were (1) 5.3 and 6.5 mm (FBP), (2) 5.1 and 5.9 mm (3D RAMLA). Transverse radial, transverse tangential, and axial resolution at 10 cm were (1) 5.7, 5.7, and 7.0 mm (FBP), (2) 5.4, 5.4, and 6.4 mm (3D RAMLA). Attenuation free values of sensitivity were 3,620 counts/sec/MBq at the center of transaxial FOV and 4,324 counts/sec/MBq at 10 cm offset from the center. Scatter fraction was 40.6%, and peak true count rate and NECR were 88.9 kcps @ 12.9 kBq/mL and 34.3 kcps @ 8.84 kBq/mL. These characteristics are better than that of ECAT EXACT PET scanner with BGO crystal. Conclusion: The results of this field test demonstrate high resolution, sensitivity and count rate performance of the 3D PET/CT scanner with GSO crystal. The data provided here will be useful for the comparative study with other 3D PET/CT scanners using BGO or LSO crystals.

Using the METHONTOLOGY Approach to a Graduation Screen Ontology Development: An Experiential Investigation of the METHONTOLOGY Framework

  • Park, Jin-Soo;Sung, Ki-Moon;Moon, Se-Won
    • Asia pacific journal of information systems
    • /
    • v.20 no.2
    • /
    • pp.125-155
    • /
    • 2010
  • Ontologies have been adopted in various business and scientific communities as a key component of the Semantic Web. Despite the increasing importance of ontologies, ontology developers still perceive construction tasks as a challenge. A clearly defined and well-structured methodology can reduce the time required to develop an ontology and increase the probability of success of a project. However, no reliable knowledge-engineering methodology for ontology development currently exists; every methodology has been tailored toward the development of a particular ontology. In this study, we developed a Graduation Screen Ontology (GSO). The graduation screen domain was chosen for the several reasons. First, the graduation screen process is a complicated task requiring a complex reasoning process. Second, GSO may be reused for other universities because the graduation screen process is similar for most universities. Finally, GSO can be built within a given period because the size of the selected domain is reasonable. No standard ontology development methodology exists; thus, one of the existing ontology development methodologies had to be chosen. The most important considerations for selecting the ontology development methodology of GSO included whether it can be applied to a new domain; whether it covers a broader set of development tasks; and whether it gives sufficient explanation of each development task. We evaluated various ontology development methodologies based on the evaluation framework proposed by G$\acute{o}$mez-P$\acute{e}$rez et al. We concluded that METHONTOLOGY was the most applicable to the building of GSO for this study. METHONTOLOGY was derived from the experience of developing Chemical Ontology at the Polytechnic University of Madrid by Fern$\acute{a}$ndez-L$\acute{o}$pez et al. and is regarded as the most mature ontology development methodology. METHONTOLOGY describes a very detailed approach for building an ontology under a centralized development environment at the conceptual level. This methodology consists of three broad processes, with each process containing specific sub-processes: management (scheduling, control, and quality assurance); development (specification, conceptualization, formalization, implementation, and maintenance); and support process (knowledge acquisition, evaluation, documentation, configuration management, and integration). An ontology development language and ontology development tool for GSO construction also had to be selected. We adopted OWL-DL as the ontology development language. OWL was selected because of its computational quality of consistency in checking and classification, which is crucial in developing coherent and useful ontological models for very complex domains. In addition, Protege-OWL was chosen for an ontology development tool because it is supported by METHONTOLOGY and is widely used because of its platform-independent characteristics. Based on the GSO development experience of the researchers, some issues relating to the METHONTOLOGY, OWL-DL, and Prot$\acute{e}$g$\acute{e}$-OWL were identified. We focused on presenting drawbacks of METHONTOLOGY and discussing how each weakness could be addressed. First, METHONTOLOGY insists that domain experts who do not have ontology construction experience can easily build ontologies. However, it is still difficult for these domain experts to develop a sophisticated ontology, especially if they have insufficient background knowledge related to the ontology. Second, METHONTOLOGY does not include a development stage called the "feasibility study." This pre-development stage helps developers ensure not only that a planned ontology is necessary and sufficiently valuable to begin an ontology building project, but also to determine whether the project will be successful. Third, METHONTOLOGY excludes an explanation on the use and integration of existing ontologies. If an additional stage for considering reuse is introduced, developers might share benefits of reuse. Fourth, METHONTOLOGY fails to address the importance of collaboration. This methodology needs to explain the allocation of specific tasks to different developer groups, and how to combine these tasks once specific given jobs are completed. Fifth, METHONTOLOGY fails to suggest the methods and techniques applied in the conceptualization stage sufficiently. Introducing methods of concept extraction from multiple informal sources or methods of identifying relations may enhance the quality of ontologies. Sixth, METHONTOLOGY does not provide an evaluation process to confirm whether WebODE perfectly transforms a conceptual ontology into a formal ontology. It also does not guarantee whether the outcomes of the conceptualization stage are completely reflected in the implementation stage. Seventh, METHONTOLOGY needs to add criteria for user evaluation of the actual use of the constructed ontology under user environments. Eighth, although METHONTOLOGY allows continual knowledge acquisition while working on the ontology development process, consistent updates can be difficult for developers. Ninth, METHONTOLOGY demands that developers complete various documents during the conceptualization stage; thus, it can be considered a heavy methodology. Adopting an agile methodology will result in reinforcing active communication among developers and reducing the burden of documentation completion. Finally, this study concludes with contributions and practical implications. No previous research has addressed issues related to METHONTOLOGY from empirical experiences; this study is an initial attempt. In addition, several lessons learned from the development experience are discussed. This study also affords some insights for ontology methodology researchers who want to design a more advanced ontology development methodology.

Group Search Optimization Data Clustering Using Silhouette (실루엣을 적용한 그룹탐색 최적화 데이터클러스터링)

  • Kim, Sung-Soo;Baek, Jun-Young;Kang, Bum-Soo
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.42 no.3
    • /
    • pp.25-34
    • /
    • 2017
  • K-means is a popular and efficient data clustering method that only uses intra-cluster distance to establish a valid index with a previously fixed number of clusters. K-means is useless without a suitable number of clusters for unsupervised data. This paper aimsto propose the Group Search Optimization (GSO) using Silhouette to find the optimal data clustering solution with a number of clusters for unsupervised data. Silhouette can be used as valid index to decide the number of clusters and optimal solution by simultaneously considering intra- and inter-cluster distances. The performance of GSO using Silhouette is validated through several experiment and analysis of data sets.

Dual-Algorithm Maximum Power Point Tracking Control Method for Photovoltaic Systems based on Grey Wolf Optimization and Golden-Section Optimization

  • Shi, Ji-Ying;Zhang, Deng-Yu;Ling, Le-Tao;Xue, Fei;Li, Ya-Jing;Qin, Zi-Jian;Yang, Ting
    • Journal of Power Electronics
    • /
    • v.18 no.3
    • /
    • pp.841-852
    • /
    • 2018
  • This paper presents a dual-algorithm search method (GWO-GSO) combining grey wolf optimization (GWO) and golden-section optimization (GSO) to realize maximum power point tracking (MPPT) for photovoltaic (PV) systems. First, a modified grey wolf optimization (MGWO) is activated for the global search. In conventional GWO, wolf leaders possess the same impact on decision-making. In this paper, the decision weights of wolf leaders are automatically adjusted with hunting progression, which is conducive to accelerating hunting. At the later stage, the algorithm is switched to GSO for the local search, which play a critical role in avoiding unnecessary search and reducing the tracking time. Additionally, a novel restart judgment based on the quasi-slope of the power-voltage curve is introduced to enhance the reliability of MPPT systems. Simulation and experiment results demonstrate that the proposed algorithm can track the global maximum power point (MPP) swiftly and reliably with higher accuracy under various conditions.

A Proposal of the Maximum Allowable Off-axis Level for HAPS Ground Station in 47/48GHz Bands (47/48GHz 대역의 HAPS 지상국을 위한 최대 허용 off-axis 레벨 제안)

  • Choi Mun-Hwan;Kang Young-Heung;Park Jong-Min;Ku Bon-Jun;Ahn Do-Seob
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2006.05a
    • /
    • pp.611-614
    • /
    • 2006
  • Resolution 122 requires to study power limitation applicable for HAPS ground stations to facilitate sharing with space station receivers in 47/48GHz bands. ITU-R Recommendation 1481-1 recommends to improve the side lobe characteristics of HAPS ground station antenna for sharing between FSS system and HAPS system. Thus, in this paper, we propose maximum allowable off-axis e.i.r.p. level of HAPS ground station antennas by considering power limitation to HAPS ground station in Resolution 122 in order to reduce unfeasible separate distance between HAPS and GSO FSS service coverage and improve the side lobe characteristics of HAPS ground station antennas in Recommendation SF.1481-1.

  • PDF

Research on Low-energy Adaptive Clustering Hierarchy Protocol based on Multi-objective Coupling Algorithm

  • Li, Wuzhao;Wang, Yechuang;Sun, Youqiang;Mao, Jie
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.4
    • /
    • pp.1437-1459
    • /
    • 2020
  • Wireless Sensor Networks (WSN) is a distributed Sensor network whose terminals are sensors that can sense and check the environment. Sensors are typically battery-powered and deployed in where the batteries are difficult to replace. Therefore, maximize the consumption of node energy and extend the network's life cycle are the problems that must to face. Low-energy adaptive clustering hierarchy (LEACH) protocol is an adaptive clustering topology algorithm, which can make the nodes in the network consume energy in a relatively balanced way and prolong the network lifetime. In this paper, the novel multi-objective LEACH protocol is proposed, in order to solve the proposed protocol, we design a multi-objective coupling algorithm based on bat algorithm (BA), glowworm swarm optimization algorithm (GSO) and bacterial foraging optimization algorithm (BFO). The advantages of BA, GSO and BFO are inherited in the multi-objective coupling algorithm (MBGF), which is tested on ZDT and SCH benchmarks, the results are shown the MBGF is superior. Then the multi-objective coupling algorithm is applied in the multi-objective LEACH protocol, experimental results show that the multi-objective LEACH protocol can greatly reduce the energy consumption of the node and prolong the network life cycle.

Topology, shape, and size optimization of truss structures using modified teaching-learning based optimization

  • Tejani, Ghanshyam G.;Savsani, Vimal J.;Patel, Vivek K.;Bureerat, Sujin
    • Advances in Computational Design
    • /
    • v.2 no.4
    • /
    • pp.313-331
    • /
    • 2017
  • In this study, teaching-learning based optimization (TLBO) is improved by incorporating model of multiple teachers, adaptive teaching factor, self-motivated learning, and learning through tutorial. Modified TLBO (MTLBO) is applied for simultaneous topology, shape, and size optimization of space and planar trusses to study its effectiveness. All the benchmark problems are subjected to stress, displacement, and kinematic stability constraints while design variables are discrete and continuous. Analyses of unacceptable and singular topologies are prohibited by seeing element connectivity through Grubler's criterion and the positive definiteness. Performance of MTLBO is compared to TLBO and state-of-the-art algorithms available in literature, such as a genetic algorithm (GA), improved GA, force method and GA, ant colony optimization, adaptive multi-population differential evolution, a firefly algorithm, group search optimization (GSO), improved GSO, and intelligent garbage can decision-making model evolution algorithm. It is observed that MTLBO has performed better or found nearly the same optimum solutions.

Evaluation of the 256ch Flat Panel PS-PMT on Positioning Image Histogram for PET

  • Orita, Narimichi;Murayama, Hideo;Kawai, Hideyuki;Inadama, Naoko;Umehara, Takaya;Kasahara, Takehiro;Tsuda, Tomoaki
    • Proceedings of the Korean Society of Medical Physics Conference
    • /
    • 2002.09a
    • /
    • pp.324-327
    • /
    • 2002
  • For a next generation PET that realizes high sensitivity and high resolution, we proposed a design of a depth of interaction detector. A unit of the detector is constructed of four stages rectangular blocks of 2 by 2 Gd$_2$SiO$\sub$5/: Ce (GSO) crystal array optically coupled to position sensitive photomultiplier tube (PS-PMT). The 256ch flat panel PS-PMT is under development by Hamamatsu Photonics K.K., JAPAN. It has large cathode area, 51.7 by 51.7 mm$^2$, and the ratio of the effective area to external size is about 90%. The feature will contribute high packing fraction, accordingly high sensitivity. The 256 anodes are arranged in 16 by 16 at intervals of 3.0 mm. So as to evaluate the detector capability for identifying crystal of interaction, we got positioning image histograms with coupling a 16 by 5 array of GSO crystals, 2.9 by 2.9 by 7.5 mm$^3$, to the PS-PMT by irradiating a gamma ray uniformly from a point source. Flat panel PS-PMT is a new promising device for PET. We need to evaluate it if its performance is sufficiency. The performance was compared to the one with a 16ch PS-PMT.

  • PDF

PREFERRED SHARING METHODS BETWEEN THE RADIO ASTRONOMY AND SATELLITE TELECOMMUNICATION SERVICES (전파천문 및 위성통신업무간의 주파수 공유방안)

  • CHUNG HYUNSOO;ROH CUK-GYOO;JE DO-HEUNG;KIM HYO-RYOUNG;PARK JONG-MIN;AHN DO-SEOB;OH DAE-SUB
    • Publications of The Korean Astronomical Society
    • /
    • v.19 no.1
    • /
    • pp.129-133
    • /
    • 2004
  • In the past, radio astronomers have sought isolation from man-made signals by placing their telescopes in remote locations. These measures may no longer safeguard scientific observations, since NGSO satellite systems, particularly low-Earth orbit (LEO) systems, are usually designed to provide global or wide regional coverage. Further, radio astronomers have historically made their observations in the frequency bands allocated for their use by the member countries of the International Telecommunication Union (ITU). The science of radio astronomy could be adversely impacted by the deployment of large constellations of new non-geostationary orbiting (NGSO) satellites for telecommunications, navigation and Earth observation, and the proliferation of new, high-power broadcasting and telecommunication satellites in geostationary (GSO) orbits. Radio telescopes are extremely sensitive, and, in certain situations, signals from satellites can overwhelm the signals from astronomical sources. This paper describes the problem in detail and identifies ways to mitigate it without adversely affecting the continued vigorous growth of commercial space-based telecommunications.