• Title/Summary/Keyword: Homogeneous Link

Search Result 27, Processing Time 0.018 seconds

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

  • Kwon Do-All;Chung Tae-Sang
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.54 no.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
    • /
    • v.13 no.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
    • Journal of Distribution Science
    • /
    • v.19 no.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
    • /
    • v.12 no.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
    • /
    • v.10 no.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)
    • /
    • v.14 no.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 (컴퓨터 그래픽스를 이용한 로보트 매니퓰레이터의 구현 방법)

  • Jang, Won;Chung, Myung Jin;Bien, Zeungnam
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.24 no.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 (자동차주행거리 추정방안 연구)

  • Ahn, Won-Chul;Park, Dong-Joo;Heo, Tae-Young;Yeon, Ji-Youn;Kim, Chan-Sung
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.13 no.6
    • /
    • pp.64-76
    • /
    • 2014
  • This study identified the causes of errors that could take place in the estimation process of vehicle miles traveled and quantified the effects of each of those causes on the estimation accuracy of vehicle miles traveled via error rate to propose an efficient way to estimate vehicle miles traveled. The study proceeded as follows: first, the study established survey data of vehicle miles traveled in the pilot test areas to test the accuracy of a method to estimate vehicle miles traveled. Second, the causes of errors with the estimation of vehicle miles traveled were categorized into errors with the sample size, sampling methods, and homogeneous link setting methods. In addition, many different methodologies were set to minimize errors with the estimation of vehicle miles traveled according to each of the causes. Third, error rates of estimation of vehicle miles traveled were compared and analyzed according to each of the methodologies. Finally, a toy network was established to propose a way of estimating vehicle miles traveled by taking the local characteristics into consideration. The study finds its significance in that it proposed an efficient way to estimate vehicle miles traveled through an experiment and planning approach and made use of survey data of vehicle miles traveled to test estimation accuracy. The proposed way of estimating vehicle miles traveled by taking into account the local characteristics will make a contribution to the estimation of vehicle miles traveled by the areas in future along with the level of data offered in the study.

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

  • 김호준;박병훈;이진호;황금찬
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.23 no.4
    • /
    • pp.957-966
    • /
    • 1998
  • In this paper an imrpoved Signal-to-Interference ratio(SIR)-based call admission control(CAC) algorithm for DS-CDMA cellular system is proposed and its performance is analyzed. This algorithm uses Residual-Capacity defined asthe additional number of initial calls that a base station can accept such that system-wide outage probability will guaranteed to remain below a certain level. the residual capcity at each cell is calculated according to the reverse-link SIR measured not only at the home cell but also the adjacent cells. Then the adjacent cell interference-coupling coefficient .betha. is used. In this work we propose an improved algorithm that .betha. varies according to the traffic load of the home cell. The influence of traffic condition on system performance, namely blocking probability and outage probability, is then examined via simulation. The performance of the improved algorithm is evaluated both under homogeneous and hot spot traffic loads. The results show that the improved algorithm outperforms conventional algorithms under all load values. Under over-load situation, especially, the improved algorithm gives almost constant outage performance the QoS(quality of service) can be guranted.

  • 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)
    • /
    • v.9 no.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.