• 제목/요약/키워드: Homogeneous Link

검색결과 27건 처리시간 0.022초

Homogeneous Transformation Matrix의 곱셈을 위한 병렬구조 프로세서의 설계 (A Parallel-Architecture Processor Design for the Fast Multiplication of Homogeneous Transformation Matrices)

  • 권두올;정태상
    • 대한전기학회논문지:시스템및제어부문D
    • /
    • 제54권12호
    • /
    • pp.723-731
    • /
    • 2005
  • The $4{\times}4$ homogeneous transformation matrix is a compact representation of orientation and position of an object in robotics and computer graphics. A coordinate transformation is accomplished through the successive multiplications of homogeneous matrices, each of which represents the orientation and position of each corresponding link. Thus, for real time control applications in robotics or animation in computer graphics, the fast multiplication of homogeneous matrices is quite demanding. In this paper, a parallel-architecture vector processor is designed for this purpose. The processor has several key features. For the accuracy of computation for real application, the operands of the processors are floating point numbers based on the IEEE Standard 754. For the parallelism and reduction of hardware redundancy, the processor takes column vectors of homogeneous matrices as multiplication unit. To further improve the throughput, the processor structure and its control is based on a pipe-lined structure. Since the designed processor can be used as a special purpose coprocessor in robotics and computer graphics, additionally to special matrix/matrix or matrix/vector multiplication, several other useful instructions for various transformation algorithms are included for wide application of the new design. The suggested instruction set will serve as standard in future processor design for Robotics and Computer Graphics. The design is verified using FPGA implementation. Also a comparative performance improvement of the proposed design is studied compared to a uni-processor approach for possibilities of its real time application.

Improving the Performance of Multi-Hop Wireless Networks by Selective Transmission Power Control

  • Kim, Tae-Hoon;Tipper, David;Krishnamurthy, Prashant
    • Journal of information and communication convergence engineering
    • /
    • 제13권1호
    • /
    • pp.7-14
    • /
    • 2015
  • In a multi-hop wireless network, connectivity is determined by the link that is established by the receiving signal strength computed by subtracting the path loss from the transmission power. Two path loss models are commonly used in research, namely two-ray ground and shadow fading, which determine the receiving signal strength and affect the link quality. Link quality is one of the key factors that affect network performance. In general, network performance improves with better link quality in a wireless network. In this study, we measure the network connectivity and performance in a shadow fading path loss model, and our observation shows that both are severely degraded in this path loss model. To improve network performance, we propose power control schemes utilizing link quality to identify the set of nodes required to adjust the transmission power in order to improve the network throughput in both homogeneous and heterogeneous multi-hop wireless networks. Numerical studies to evaluate the proposed schemes are presented and compared.

National Brand, Tourism and Human Development: Analysis of the Relationship and Distribution

  • STRYZHAK, Olena;AKHMEDOVA, Olena;POSTUPNA, Olena;SHCHEPANSKIY, Eduard;TIURINA, Dina
    • 유통과학연구
    • /
    • 제19권12호
    • /
    • pp.33-43
    • /
    • 2021
  • Purpose: This paper aims to determine features of the relationship between human development, tourism and national brand. Research design, data and methodology: ranking indicators, cluster analysis, K means method, correlation analysis. Results: The analysis covers data for 95 countries for 2019. The number of countries is justified by the availability of comparable data for calculations. A direct relationship between the indicators for the entire sample has been revealed in the result of the correlation analysis. However, this relationship has not been confirmed for the groups of countries that were formed through the cluster analysis. Spearman Rank Order and Kendall Tau Correlations have been calculated for the five obtained clusters. In two of the five clusters, the relationship between the indicators has not been found. A strong negative link between all the indicators has been detected in the cluster with average index values. A strong positive link between TTCI and BSI has been revealed in the group of countries with the best index values. A strong positive link between TTCI and HDI has been found in the group of countries with the worst index values. Conclusions: The analysis demonstrates that there is a relationship between BSI, TTCI and HDI, and while this link is observed for the sample as a whole, it is not homogeneous for groups of countries.

Bayesian Analysis of Binary Non-homogeneous Markov Chain with Two Different Time Dependent Structures

  • Sung, Min-Je
    • Management Science and Financial Engineering
    • /
    • 제12권2호
    • /
    • pp.19-35
    • /
    • 2006
  • We use the hierarchical Bayesian approach to describe the transition probabilities of a binary nonhomogeneous Markov chain. The Markov chain is used for describing the transition behavior of emotionally disturbed children in a treatment program. The effects of covariates on transition probabilities are assessed using a logit link function. To describe the time evolution of transition probabilities, we consider two modeling strategies. The first strategy is based on the concept of exchangeabiligy, whereas the second one is based on a first order Markov property. The deviance information criterion (DIC) measure is used to compare models with two different time dependent structures. The inferences are made using the Markov chain Monte Carlo technique. The developed methodology is applied to some real data.

Proper orthogonal decomposition in wind engineering - Part 2: Theoretical aspects and some applications

  • Carassale, Luigi;Solari, Giovanni;Tubino, Federica
    • Wind and Structures
    • /
    • 제10권2호
    • /
    • pp.177-208
    • /
    • 2007
  • Few mathematical methods attracted theoretical and applied researches, both in the scientific and humanist fields, as the Proper Orthogonal Decomposition (POD) made throughout the last century. However, most of these fields often developed POD in autonomous ways and with different names, discovering more and more times what other scholars already knew in different sectors. This situation originated a broad band of methods and applications, whose collation requires working out a comprehensive viewpoint on the representation problem for random quantities. Based on these premises, this paper provides and discusses the theoretical foundations of POD in a homogeneous framework, emphasising the link between its general position and formulation and its prevalent use in wind engineering. Referring to this framework, some applications recently developed at the University of Genoa are shown and revised. General remarks and some prospects are finally drawn.

A Network Partition Approach for MFD-Based Urban Transportation Network Model

  • Xu, Haitao;Zhang, Weiguo;zhuo, Zuozhang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제14권11호
    • /
    • pp.4483-4501
    • /
    • 2020
  • Recent findings identified the scatter and shape of MFD (macroscopic fundamental diagram) is heavily influenced by the spatial distribution of link density in a road network. This implies that the concept of MFD can be utilized to divide a heterogeneous road network with different degrees of congestion into multiple homogeneous subnetworks. Considering the actual traffic data is usually incomplete and inaccurate while most traffic partition algorithms rely on the completeness of the data, we proposed a three-step partitioned algorithm called Iso-MB (Isoperimetric algorithm - Merging - Boundary adjustment) permitting of incompletely input data in this paper. The proposed algorithm was implemented and verified in a simulated urban transportation network. The existence of well-defined MFD in each subnetwork was revealed and discussed and the selection of stop parameter in the isoperimetric algorithm was explained and dissected. The effectiveness of the approach to the missing input data was also demonstrated and elaborated.

컴퓨터 그래픽스를 이용한 로보트 매니퓰레이터의 구현 방법 (Realization of Robot Maniqulators Using Computer Graphics)

  • 장원;정명진;변증남
    • 대한전자공학회논문지
    • /
    • 제24권2호
    • /
    • pp.207-214
    • /
    • 1987
  • In this paper, we developed a method of describing the structure of robot arms and a systematic way to use it as a robt-design-aid tool. To describe the structure of robot arms, a robot was regarded as a collection of various links in the form of polygonal pillars. With the aid of the homogeneous transformation, a set of commands for describing the information on how all the links in the robot are connected was defined and used in graphically realizing complex link-based structures including robot manipulators.

  • PDF

자동차주행거리 추정방안 연구 (A Study on Estimation of Vehicle Miles Traveled)

  • 안원철;박동주;허태영;연지윤;김찬성
    • 한국ITS학회 논문지
    • /
    • 제13권6호
    • /
    • pp.64-76
    • /
    • 2014
  • 본 연구는 자동차주행거리 추정과정에서 발생할 수 있는 오차발생 원인을 규명하였다. 그리고 각 원인이 자동차주행거리 추정 정확도에 미치는 영향을 오차율로 정량화하여 효율적인 자동차주행거리 추정방안을 제시하였다. 이를 위한 연구과정은 다음과 같다. 첫째, 시범조사 지역을 대상으로 자동차주행거리 추정 방법론의 정확도를 검증하기 위한 자동차주행거리 관측 자료를 구축하였다. 둘째, 자동차주행거리 추정 오차발생 원인은 표본크기, 표본추출방법, 단위구간 설정방법의 오류로 구분하였다. 그리고 각 원인에 따른 자동차주행거리 추정오차를 최소화하기 위한 다양한 방법론을 설정하였다. 셋째, 각 방법론에 의한 자동차주행거리 추정 오차율을 비교분석 하였다. 마지막으로 Toy-Network를 구축하여 지역특성을 고려한 자동차주행거리 추정방안을 제시하였다. 본 연구는 실험 계획적 접근방법을 통하여 효율적인 자동차주행거리 추정방안을 제시하였으며, 추정 정확도 검증을 위하여 자동차주행거리 관측 자료를 활용했다는 점에서 의의를 갖는다. 또한 본 연구에서 제시한 자료수준과 지역특성을 고려한 자동차주행거리 추정 방안은 향후 지역별 자동차주행거리 추정에 기여할 것으로 판단된다.

DS-CDMA 셀룰라 시스템을 위한 SIR기반의 개선된 호 수락 제어 (Improved SIR-based call admission control for DS-CDMA cellular system)

  • 김호준;박병훈;이진호;황금찬
    • 한국통신학회논문지
    • /
    • 제23권4호
    • /
    • pp.957-966
    • /
    • 1998
  • 본 논문에서는 OS-COMA 셀룰라 시스템에서 추정된 SIR (signal-to-interference ratio) 값을 기반으로 하는 개선된 호 수락 제어(call admission control) 알고리즘을 제안하고 성능을 분석하였다. 제안된 알고리즘은 기지국에서 추정된 역방향 SIR 값에 따라 알고리즘에 의해 계산된 여유용량(residual capacity)을 호 수락 제어의 기준으로 하며, 여유용량은 시스탬의 통화품질 저하 확률(outage probability)을 일정 수준 이하로 유지하면서 추가로 허용 가능한 호의 수로 계산한다. 여유용량 계산 시 자기 셀 뿐만 아니라 인접 셀의 SIR 값을 참조하며 이때 인접 셀 간섭 결합계수 $\beta$를 사용한다. 본 논문에서는 자기 셀의 통화 부하량에 따라 $\beta$값을 가변한 개선된 알고리즘을 제안하고, 시스템의 통화 부하량에 따른 호차단확률(call blocking probability) 및 통화품질저하확률 성능을 시뮬레이션을 통해 분석하였다, 성능 평가를 위해 동일 부하(homogeneous load) 빛 밀집 부하(hot spot load) 조건을 고려했으며 개선된 알고리즘이 모든 부하량에서 기존의 알고리즘에 비해 성능이 우수함을 알았다. 특히 과부하 상황에서 통화품질저하확률이 일정한 값 이하로 유지되어 QoS(quality of service)를 확보할 수 있는 효과를 얻었다.

  • PDF

Connectivity Analysis of Cognitive Radio Ad-hoc Networks with Shadow Fading

  • Dung, Le The;An, Beongku
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권9호
    • /
    • pp.3335-3356
    • /
    • 2015
  • In this paper, we analyze the connectivity of cognitive radio ad-hoc networks in a log-normal shadow fading environment. Considering secondary user and primary user's locations and primary user's active state are randomly distributed according to a homogeneous Poisson process and taking into account the spectrum sensing efficiency of secondary user, we derive mathematical models to investigate the connectivity of cognitive radio ad-hoc networks in three aspects and compare with the connectivity of ad-hoc networks. First, from the viewpoint of a secondary user, we study the communication probability of that secondary user. Second, we examine the possibility that two secondary users can establish a direct communication link between them. Finally, we extend to the case of finding the probability that two arbitrary secondary users can communicate via multi-hop path. We verify the correctness of our analytical approach by comparing with simulations. The numerical results show that in cognitive radio ad-hoc networks, high fading variance helps to remarkably improve connectivity behavior in the same condition of secondary user's density and primary user's average active rate. Furthermore, the impact of shadowing on wireless connection probability dominates that of primary user's average active rate. Finally, the spectrum sensing efficiency of secondary user significantly impacts the connectivity features. The analysis in this paper provides an efficient way for system designers to characterize and optimize the connectivity of cognitive radio ad-hoc networks in practical wireless environment.