发布求助
文献互助 智能选刊 最新文献

7'th International Symposium on Telecommunications (IST'2014)最新文献

筛选
英文 中文
The closed-form frequency-independent solution for physical optics integrals on conducting quadratic surfaces using rectangular meshing 用矩形网格法求解导电二次曲面上物理光学积分的闭式频率无关解
7'th International Symposium on Telecommunications (IST'2014) Pub Date : 2014-09-01 DOI: 10.1109/ISTEL.2014.7000684
Farzad Mokhtari Koushyar, A. A. Shishegar
{"title":"The closed-form frequency-independent solution for physical optics integrals on conducting quadratic surfaces using rectangular meshing","authors":"Farzad Mokhtari Koushyar, A. A. Shishegar","doi":"10.1109/ISTEL.2014.7000684","DOIUrl":"https://doi.org/10.1109/ISTEL.2014.7000684","url":null,"abstract":"In this paper, we propose a closed-form frequency-independent solution for highly oscillatory Physical Optics (PO) integrals on a quadratic surface. These integrals are highly oscillatory integrals with second order polynomial phase and amplitude functions. First, using an affine transform, the quadratic complete form of the phase function is converted into a simple canonical form. Then, the resulted integration domain is divided to some rectangles. Finally, the closed-form solution is represented on each rectangle. Actually, by adjusting the integrand and the integration domain, we could use the closed-form solution. The accuracy and computation time efficiency of proposed method are studied using some numerical examples.","PeriodicalId":417179,"journal":{"name":"7'th International Symposium on Telecommunications (IST'2014)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130149270","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
MPAC: Maximizing Product Adoption considering the profitability of communities MPAC:考虑社区的盈利能力，最大化产品采用
7'th International Symposium on Telecommunications (IST'2014) Pub Date : 2014-09-01 DOI: 10.1109/ISTEL.2014.7000765
Milad Vadoodparast, F. Taghiyareh, Vahid Erfanifar
{"title":"MPAC: Maximizing Product Adoption considering the profitability of communities","authors":"Milad Vadoodparast, F. Taghiyareh, Vahid Erfanifar","doi":"10.1109/ISTEL.2014.7000765","DOIUrl":"https://doi.org/10.1109/ISTEL.2014.7000765","url":null,"abstract":"Maximizing product adoption in viral marketing is the task of choosing a small set of seed nodes in a social network so that by their approval to adopt the product, they influence others and lead to large number of adoptions. In this paper, a special case is investigated in which nodes, because of their potential profitability, are not of the same importance to the sales manager. We assign importance weight values to the communities of nodes that are most likely to share the same characteristics and are of the same importance to the seeker of seed nodes. We define MPAC, Maximizing Product Adoption considering the profitability of Communities that is the problem of selecting seed nodes such that the spread of influence results in maximum profit. This is done by activating nodes residing within weighted communities which worth the cost of activating. Three algorithms are proposed to solve MPAC. Our empirical studies on an online social network consisted of 23628 nodes show that one of them outperforms the others by the overall profits gained and as more as the weighting method assigns larger values to small communities, the proposed algorithm performs better.","PeriodicalId":417179,"journal":{"name":"7'th International Symposium on Telecommunications (IST'2014)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130250279","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Online multiple people tracking-by-detection in crowded scenes 在线多人在拥挤的场景中进行检测跟踪
7'th International Symposium on Telecommunications (IST'2014) Pub Date : 2014-09-01 DOI: 10.1109/ISTEL.2014.7000725
Sahar Rahmatian, R. Safabakhsh
{"title":"Online multiple people tracking-by-detection in crowded scenes","authors":"Sahar Rahmatian, R. Safabakhsh","doi":"10.1109/ISTEL.2014.7000725","DOIUrl":"https://doi.org/10.1109/ISTEL.2014.7000725","url":null,"abstract":"Multiple people detection and tracking is a challenging task in real-world crowded scenes. In this paper, we have presented an online multiple people tracking-by-detection approach with a single camera. We have detected objects with deformable part models and a visual background extractor. In the tracking phase we have used a combination of support vector machine (SVM) person-specific classifiers, similarity scores, the Hungarian algorithm and inter-object occlusion handling. The proposed method does not require prior training and does not impose any constraints on environmental conditions. Our evaluation showed that the proposed method outperformed the state of the art approaches by 10% and 15% or achieved comparable performance.","PeriodicalId":417179,"journal":{"name":"7'th International Symposium on Telecommunications (IST'2014)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114391409","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Robust approach for people detection and tracking by stereo vision 基于立体视觉的鲁棒人检测与跟踪方法
7'th International Symposium on Telecommunications (IST'2014) Pub Date : 2014-09-01 DOI: 10.1109/ISTEL.2014.7000723
M. Abbaspour, M. Yazdi, M. Shirazi
{"title":"Robust approach for people detection and tracking by stereo vision","authors":"M. Abbaspour, M. Yazdi, M. Shirazi","doi":"10.1109/ISTEL.2014.7000723","DOIUrl":"https://doi.org/10.1109/ISTEL.2014.7000723","url":null,"abstract":"In this paper, a novel method for people detection and tracking is proposed, based on stereo vision. Each person is represented by a group of the feature points. In this method feature point extraction and 2D space construction of projected points on the ground plane is performed in order to provide top view. Occlusion, as a main challenge in tracking systems, can be addressed by top view scene. A robust kernel density estimation method is employed to categorize points. Then Kalman filter is applied to reduce the detection computation complexity from second frame by predicting center of the groups in the next frame. Our method is more practical than existing methods since it has lower computation cost of detection, because of using feature extraction instead of depth map. This low computational complexity makes our method suitable to be used in real time applications.","PeriodicalId":417179,"journal":{"name":"7'th International Symposium on Telecommunications (IST'2014)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114308278","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Low complexity robust coordinated beamforming in multicell network with channel uncertainties 信道不确定多小区网络的低复杂度鲁棒协调波束形成
7'th International Symposium on Telecommunications (IST'2014) Pub Date : 2014-09-01 DOI: 10.1109/ISTEL.2014.7000680
M. Akbari, V. Vakili
{"title":"Low complexity robust coordinated beamforming in multicell network with channel uncertainties","authors":"M. Akbari, V. Vakili","doi":"10.1109/ISTEL.2014.7000680","DOIUrl":"https://doi.org/10.1109/ISTEL.2014.7000680","url":null,"abstract":"Multicell coordinated beamforming, where multiple base stations (BSs) collaborate with each other in the beam-vectors design to mitigate the intercell interference (ICI), has been a subject of great attention recently. With perfect channel information available at the base stations, we first present a fast converging algorithm that solves the weighted sum rate maximization (WSRM) problem. Then, the assumption is relaxed to the case where the error vectors in the channel estimates are assumed to lie in an uncertainty set bounded by an ellipsoid. We propose a linear beamforming across a set of coordinated cells only with limiting backhaul signaling. This robust beamforming method allows that all existing (perfect Channel state information (CSI)) beamforming algorithms can be also usable in imperfect CSI condition with only adding an extra step that used for computing worst-case CSI. Indeed in proposed algorithm, beam vectors first computed based on estimated CSI, and then worst-case CSI is computed, beam vectors recomputed again and this process is repeated alternatively until convergence occurs. We evaluate robust beam design through simulation and observe that the proposed strategies has sufficient robust in front of channel uncertainties.","PeriodicalId":417179,"journal":{"name":"7'th International Symposium on Telecommunications (IST'2014)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134148755","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
BODMA: A novel metaheuristic algorithm for binary optimization problems based on open source Development Model Algorithm 基于开源开发模型算法的二元优化问题元启发式新算法
7'th International Symposium on Telecommunications (IST'2014) Pub Date : 2014-09-01 DOI: 10.1109/ISTEL.2014.7000668
Hamed Behzadi Khormouji, Hossein Hajipour, H. Rostami
{"title":"BODMA: A novel metaheuristic algorithm for binary optimization problems based on open source Development Model Algorithm","authors":"Hamed Behzadi Khormouji, Hossein Hajipour, H. Rostami","doi":"10.1109/ISTEL.2014.7000668","DOIUrl":"https://doi.org/10.1109/ISTEL.2014.7000668","url":null,"abstract":"Open source Development Model Algorithm (ODMA) is one of the recently proposed heuristic algorithms that is inspired by open source software development mechanism and community's behaviors. The superior performance of this algorithm has been proven among the other most well-known algorithms such as genetic algorithm (GA) and particle swarm optimization (PSO). However, the original version of this algorithm is suitable for continuous problems, so it cannot be applied to binary problems directly. In this paper, a binary version of this algorithm is proposed. A comparative study with binary PSO and GA over 7 benchmark functions is conducted to draw a conclusion. The results prove that the proposed binary Open source Development Model Algorithm (BODMA) is able to significantly outperform others on majority of the benchmark functions.","PeriodicalId":417179,"journal":{"name":"7'th International Symposium on Telecommunications (IST'2014)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134410998","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Enhancing achievable sum-rate by making strong and weak interference in an ad-hoc network 通过在自组网中制造强干扰和弱干扰来提高可实现的和速率
7'th International Symposium on Telecommunications (IST'2014) Pub Date : 2014-09-01 DOI: 10.1109/ISTEL.2014.7000881
K. Baghery, B. Abdolmaleki, B. Seyfe
{"title":"Enhancing achievable sum-rate by making strong and weak interference in an ad-hoc network","authors":"K. Baghery, B. Abdolmaleki, B. Seyfe","doi":"10.1109/ISTEL.2014.7000881","DOIUrl":"https://doi.org/10.1109/ISTEL.2014.7000881","url":null,"abstract":"In this study, we enhance achievable sum-rate in an ad hoc network consisting of two source-destination pairs and k half-duplex Decode-and-Forward (DF) relays. We assume that two receivers use strong interference cancellation technique and can cancel strong interference. Then, in order to enhance the achievable sum-rate, we propose a novel relay selection scheme that can make Strong and Weak Interference (SWI) at both receivers. Furthermore, in the proposed scheme, we aim to allocate resources fairly among two transmitters. Simulation results show that with the proposed relay selection scheme, SWI can be made with high probability (greater than 0.95 in crowded environments) at both receivers. Also simulations show that by using the proposed scheme, the transmitters achieve sufficient rates and their achievable rates increase linearly with power of relays.","PeriodicalId":417179,"journal":{"name":"7'th International Symposium on Telecommunications (IST'2014)","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134479005","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Bandwidth enhancement of patch antennas loaded with complementary split-ring resonators 加载互补分环谐振器的贴片天线的带宽增强
7'th International Symposium on Telecommunications (IST'2014) Pub Date : 2014-09-01 DOI: 10.1109/ISTEL.2014.7000702
F. Alizadeh, C. Ghobadi, J. Nourinia, R. Zayer
{"title":"Bandwidth enhancement of patch antennas loaded with complementary split-ring resonators","authors":"F. Alizadeh, C. Ghobadi, J. Nourinia, R. Zayer","doi":"10.1109/ISTEL.2014.7000702","DOIUrl":"https://doi.org/10.1109/ISTEL.2014.7000702","url":null,"abstract":"This letter presents a broadband, high efficiency patch antenna that utilizes a novel complementary split ring resonators (CSRRs) embedded on the ground plane. The demonstrated approach results in a significant improvement in impedance bandwidth, efficiency, compactness and directivity in comparison to a conventional microstrip antenna. A coaxial-fed microstrip antenna (MA) is integrated with a simple CSRRs structure that is cut from the ground plane. Then, two crossovers are introduced to the conventional CSRRs structure in order to both compactness of the structure and reverse the current flow along the strips. Inserting crossovers with via bridges to the CSRRs structure facilitates a nearly complete impedance match to the source over a wider bandwidth and also maintain a high, 89%, radiation efficiency. The designs and their performance characteristics were simulated with the High Frequency Structure Simulator (HFSS) and verified using the time domain CST Microwave studio simulator and Sonnet EM software. Test results of the fabricated designs show a good correlation with simulated outcomes, validating the design principles.","PeriodicalId":417179,"journal":{"name":"7'th International Symposium on Telecommunications (IST'2014)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134550204","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 14
Privacy preserving quantitative association rule mining using convex optimization technique 基于凸优化技术的隐私保护定量关联规则挖掘
7'th International Symposium on Telecommunications (IST'2014) Pub Date : 2014-09-01 DOI: 10.1109/ISTEL.2014.7000816
Elham Hatefi, Abdolreza Mirzaei, M. Safayani
{"title":"Privacy preserving quantitative association rule mining using convex optimization technique","authors":"Elham Hatefi, Abdolreza Mirzaei, M. Safayani","doi":"10.1109/ISTEL.2014.7000816","DOIUrl":"https://doi.org/10.1109/ISTEL.2014.7000816","url":null,"abstract":"Privacy preserving data mining (PPDM) has been a new research area in the past two decades. The aim of PPDM algorithms is to modify data in the dataset so that sensitive data and confidential knowledge, even after mining data be kept confidential. Association rule hiding is one of the techniques of PPDM to avoid extracting some rules that are recognized as sensitive rules and should be extracted and placed in the public domain. Most of the work has been done in the area of privacy preserving data mining are limited to binary data, however many real world datasets include quantitative data too. In this paper a new methods is proposed to hide sensitive quantitative association rules which is based on convex optimization technique. In this method, fuzzy association rule hiding is formulated as a convex optimization problem and experiments have been carried out on the real dataset. The results of experiments indicate that the proposed method outperformed exiting methods at this field in the term of percentage of missing rules and changes made in the dataset.","PeriodicalId":417179,"journal":{"name":"7'th International Symposium on Telecommunications (IST'2014)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132975888","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
ICA based PolSAR images speckle noise reduction 基于ICA的PolSAR图像散斑噪声抑制
7'th International Symposium on Telecommunications (IST'2014) Pub Date : 2014-09-01 DOI: 10.1109/ISTEL.2014.7000735
S. Karimifar, A. Pourmohammad
{"title":"ICA based PolSAR images speckle noise reduction","authors":"S. Karimifar, A. Pourmohammad","doi":"10.1109/ISTEL.2014.7000735","DOIUrl":"https://doi.org/10.1109/ISTEL.2014.7000735","url":null,"abstract":"Multifrequency polarimetric Synthetic Aperture Radar (PolSAR) imagery provides a rich data set of an earth surface's single scene. These images are degraded by speckle noise as single PolSAR images. Moreover, the redundancies exist between different polarizations and bands. In this paper, Fast Fixed-Point Independent Component Analysis (Fixed-Point ICA) algorithm is used for separating of the speckle noise component from increased number of input PolSAR images. The theoretically analysis and the simulation results confirm that increasing the number of input PolSAR images leads to have a better separation of speckle noise and PolSAR images components using Fixed-Point ICA. Furthermore, this method can be effective for information compression and redundancy elimination. The simulation results and comparisons with the results of optimal weighting filter method results based on using NASA/JPL PolSAR imagery of P, L, and C bands in three polarizations confirms improvement in the separations.","PeriodicalId":417179,"journal":{"name":"7'th International Symposium on Telecommunications (IST'2014)","volume":"399 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133234469","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
首页 上一页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信