نتایج جستجو برای: distance from communication paths

تعداد نتایج: 5937778  

2016
Ling Ji Ai-Lin Yang Xiao-Feng Lin Xian-Min Jin

Multiple-degrees-of-freedom free-space communication combining polarization and high-order spatial modes promises high-capacity communication channel. While high-order spatial modes have been widely exploited for dense coding and high-dimensional quantum information processing, the properties of polarization preservation of high-order spatial beams propagating in turbulent atmosphere have not b...

Journal: :European Journal of Combinatorics 2000

Journal: :Applied Mathematics Letters 2011

Journal: :ACM Transactions on Spatial Algorithms and Systems 2023

Recommending a Point of Interest (PoI) or sequence PoIs to visit based on user’s preferences and geo-locations has been one the most popular applications Location-Based Services (LBS). Variants have also considered which take other factors into consideration, such as broader (implicit explicit) semantic constraints well limitations length trip. In this work, we present an efficient algorithmic ...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه کاشان - دانشکده علوم انسانی 1390

increasing academic and professional language demands around the world are not a deniable fact. the purpose of this study was to investigate english language needs and communication needs of the chemistry students at master and ph.d. levels at the iranian universities. in this research, different methods were used including un-structured interview, structured interview, and two sets of question...

2016
Yasin Yousif Al-Aboosi Ahmad Zuri Sha'ameri

The shallow water channel is an environment that is of particular interest to many research fields. An underwater acoustic channel is characterized as a multipath channel. Time-varying multipath propagation is one of the major factors that limit the acoustic communication performance in shallow water. This study conducts two underwater acoustic experiments in Tanjung Balau, Johor, Malaysia. A t...

A set of vertices $S$ in a connected graph $G$ is a different-distance set if, for any vertex $w$ outside $S$, no two vertices in $S$ have the same distance to $w$.The lower and upper different-distance number of a graph are the order of a smallest, respectively largest, maximal different-distance set.We prove that a different-distance set induces either a special type of path or an independent...

1999
Jyoti Raju J. J. Garcia-Luna-Aceves

We present and verify ROAM, an on-demand routing algorithm that maintains multiple loop-free paths to destinations. Each router maintains entries only for those destinations for which data flows through the router, which reduces storage space requirements and the amount of bandwidth needed to maintain correct routing tables. In ROAM, routes are established and maintained on demand using diffusi...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید