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

2009 International Conference on Future Computer and Communication最新文献

筛选
英文 中文
A Novel Game Theoretic Approach for Energy Efficient Modulation in MC-DS-CDMA MC-DS-CDMA节能调制的一种新的博弈论方法
2009 International Conference on Future Computer and Communication Pub Date : 2009-04-03 DOI: 10.1109/ICFCC.2009.18
V. Nagarajan, P. Dananjayan
{"title":"A Novel Game Theoretic Approach for Energy Efficient Modulation in MC-DS-CDMA","authors":"V. Nagarajan, P. Dananjayan","doi":"10.1109/ICFCC.2009.18","DOIUrl":"https://doi.org/10.1109/ICFCC.2009.18","url":null,"abstract":"In this paper a game theoretic approach to study the effect of constellation size on energy efficiency of MC DS CDMA system for M-QAM modulation is studied. A non cooperative game is proposed in which each user seeks to choose its transmit power, transmit symbol rate as well as the constellation size in order to maximize its own utility while satisfying its delay quality of service (QoS) constraint. The utility function used here measures the number of reliable bits transmitted per joule of energy consumed and it is particularly suitable for energy-constrained networks. It is shown that in order to maximize the user’s utility, a user must choose the lowest constellation size that can accommodate the user’s delay constraint. This strategy is different from one that could maximize spectral efficiency. Using this approach, the trade offs among energy efficiency, delay, throughput and constellation size are also studied and quantified. The effect of Trellis coded modulation on energy efficiency is discussed additionally.","PeriodicalId":338489,"journal":{"name":"2009 International Conference on Future Computer and Communication","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129393687","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
Knowledge-Based Approach of Building Plan Checker System Using Computer-Aided Design (CAD) Building Plan 基于计算机辅助设计(CAD)的建筑平面图校核系统的知识实现
2009 International Conference on Future Computer and Communication Pub Date : 2009-04-03 DOI: 10.1109/ICFCC.2009.65
N. Sanusi, Nuridawati Mustafa, E. Kasmuri, M. S. Azmi
{"title":"Knowledge-Based Approach of Building Plan Checker System Using Computer-Aided Design (CAD) Building Plan","authors":"N. Sanusi, Nuridawati Mustafa, E. Kasmuri, M. S. Azmi","doi":"10.1109/ICFCC.2009.65","DOIUrl":"https://doi.org/10.1109/ICFCC.2009.65","url":null,"abstract":"Current plan checking process has been a tedious and time consuming process for developers and local authorities with many errors and problems. This may result to a late of building development progress and can cost a big number amount of money. The aim of this research is to build a software information system that integrates development plan using computer-aided design (CAD) and to evaluate the development plan according to the standards. The compliance plan will be stored into knowledge-based repository for use by other local authorities for checking purposes. This building plan checking system (BPCS) will also acts as a repository for the development plan configuration standards in the data processing system. BPCS also serves as an assessor for the building components in the development plan to determine compliance of the development plan configuration with the development plan configuration standards using in the system.","PeriodicalId":338489,"journal":{"name":"2009 International Conference on Future Computer and Communication","volume":"2009 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127334769","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
Hybrid Algorithm for Locating Mobile Station in Cellular Network 蜂窝网络中移动基站定位的混合算法
2009 International Conference on Future Computer and Communication Pub Date : 2009-04-03 DOI: 10.1109/ICFCC.2009.73
Belal Al-Ifan, N. A. W. Hamid, M. Othman, S. Subramaniam
{"title":"Hybrid Algorithm for Locating Mobile Station in Cellular Network","authors":"Belal Al-Ifan, N. A. W. Hamid, M. Othman, S. Subramaniam","doi":"10.1109/ICFCC.2009.73","DOIUrl":"https://doi.org/10.1109/ICFCC.2009.73","url":null,"abstract":"Locating mobile stations have been attracting an increasing attention from both researchers and industry communities and it is one of the most popular research areas of cellular network. Locating mobile stations using Time of Arrival, Time Difference of Arrival, Angle of Arrival and Received Signal Strength techniques have been widely used. However, more accurate results have been achieved by combining two or more of these techniques. A hybrid algorithm for locating mobile station is proposed by combining Signal Attenuation, and Time of Arrival in this paper.","PeriodicalId":338489,"journal":{"name":"2009 International Conference on Future Computer and Communication","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130521970","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}
引用次数: 2
An Algorithm for Visibility Graph Recognition on Planar Graphs 一种基于平面图的可视性图识别算法
2009 International Conference on Future Computer and Communication Pub Date : 2009-04-03 DOI: 10.1109/ICFCC.2009.97
Gholamreza Dehghani, H. Morady
{"title":"An Algorithm for Visibility Graph Recognition on Planar Graphs","authors":"Gholamreza Dehghani, H. Morady","doi":"10.1109/ICFCC.2009.97","DOIUrl":"https://doi.org/10.1109/ICFCC.2009.97","url":null,"abstract":"To decide whether a given graph is the visibility graph of some simple polygon, is not known to be NP, nor is it known to be NP-hard. It is only known to be PSPACE. The problem of characterizing Visibility graphs of an arbitrary simple polygons and the related problem of efficiently recognizing such graphs have remained important open problem in computational geometry. In this paper, an algorithm for visibility graph recognition on embedded planar graphs is presented. Proposed algorithm gets a embedded planar graph and recognizes whether it is a visibility graph. Time Complexity of the algorithm is polynomial","PeriodicalId":338489,"journal":{"name":"2009 International Conference on Future Computer and Communication","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128817334","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}
引用次数: 5
A Framework for Context-Aware University Mobile Organizer 上下文感知大学移动组织者框架
2009 International Conference on Future Computer and Communication Pub Date : 2009-04-03 DOI: 10.1109/ICFCC.2009.84
S. H. Mirisaee, A. Zin
{"title":"A Framework for Context-Aware University Mobile Organizer","authors":"S. H. Mirisaee, A. Zin","doi":"10.1109/ICFCC.2009.84","DOIUrl":"https://doi.org/10.1109/ICFCC.2009.84","url":null,"abstract":"With appearance of mobile devices such as cell phones, PDAs and smart phones, context-aware applications are becoming increasingly popular. Therefore, developers are always seeking for new and powerful developing tools for context-aware programming. Developers prefer to use fast and convenient development tools that can support all required possibilities for implementing a complete and user-friendly context-aware systems. In this paper, we determined some essential principles for developing and implementing context-ware applications. Technologies for context-aware applications programming should support these principles. Among different technologies, we introduced four technologies, which are most practical for developing context-aware applications based on determined principles. Java agent development environment, java context-awareness framework and J2ME are java-based technologies, which were studied in this paper. We also introduced spring.net technology as a new technology for designing context-aware application because of its novel features that can present an easy interactive and easy developing area for context-aware applications. Eventually, the proposed context-aware framework for an intelligent university mobile organizer by using spring.net technology is illustrated. This framework draws on spring.net components for developing a context-aware application.","PeriodicalId":338489,"journal":{"name":"2009 International Conference on Future Computer and Communication","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126522678","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}
引用次数: 7
The Viewpoint of E-Commerce Security in the Digital Economy 数字经济中的电子商务安全观点
2009 International Conference on Future Computer and Communication Pub Date : 2009-04-03 DOI: 10.1109/ICFCC.2009.43
Iustin Priescu, V. Patriciu, S. Nicolăescu
{"title":"The Viewpoint of E-Commerce Security in the Digital Economy","authors":"Iustin Priescu, V. Patriciu, S. Nicolăescu","doi":"10.1109/ICFCC.2009.43","DOIUrl":"https://doi.org/10.1109/ICFCC.2009.43","url":null,"abstract":"The global market for information security services nearly tripled in 2007, up from about $6.7 billion in 2000, according to International Data Corporation.This trend that focuses on information security stresses the translation of strategic business objectives and models into an information systems architecture that combines data process, workflow, financial and simulation models. E-commerce security is a process, not an end result. Managers need to understand how advanced technology creates more robust, scalable and adaptable information systems for organizations dedicated to continuous improvement and innovation. The paper presents the key questions used for assessing the existing status and the operation mode, and proposes some alternative solutions and recommendations for organizations operating in the digital economy.","PeriodicalId":338489,"journal":{"name":"2009 International Conference on Future Computer and Communication","volume":"28 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121044653","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
Content Supply Computer System 内容供应计算机系统
2009 International Conference on Future Computer and Communication Pub Date : 2009-04-03 DOI: 10.1109/ICFCC.2009.13
W. Fang
{"title":"Content Supply Computer System","authors":"W. Fang","doi":"10.1109/ICFCC.2009.13","DOIUrl":"https://doi.org/10.1109/ICFCC.2009.13","url":null,"abstract":"This study presents a novel e-learning system, which automatically adjusts the content of the presentation. In contrast, a traditional learning system supplies the same content to all users, or supplies content based only on the behavior of users when learning. Based on the user's psychological analysis, study habits and characteristics of the use of the keyboard behavior analysis, this study presents ways to identify the needs of users effectively before they use the learning system, and reduce the time taken to adapt to needs of users. This study discusses the basic theory, and shows preliminary results.","PeriodicalId":338489,"journal":{"name":"2009 International Conference on Future Computer and Communication","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121079644","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
Algorithms for Generating Binary Reflected Gray Code Sequence: Time Efficient Approaches 生成二进制反射灰码序列的算法:时间效率方法
2009 International Conference on Future Computer and Communication Pub Date : 2009-04-03 DOI: 10.1109/ICFCC.2009.41
Mohsin Ali, Muhammad Nazrul Islam, Abu Foysal
{"title":"Algorithms for Generating Binary Reflected Gray Code Sequence: Time Efficient Approaches","authors":"Mohsin Ali, Muhammad Nazrul Islam, Abu Foysal","doi":"10.1109/ICFCC.2009.41","DOIUrl":"https://doi.org/10.1109/ICFCC.2009.41","url":null,"abstract":"In this paper, we propose two algorithms for generating a complete n-bit binary reflected Gray code sequence. The first one is called Backtracking. It generates a complete n-bit binary reflected Gray code sequence by generating only a sub-tree instead of the complete tree. In this approach, both the sequence and its reflection for n-bit is generated by concatenating a “0” and a “1” to the most significant bit position of the n-1 bit result generated at each leaf node of the sub-tree. The second one is called MOptimal. It is the modification of a Space and time optimal approach [8] by considering the minimization of the total number of outer and inner loop execution for this purpose. In this method, both a sequence and its reflection for n-bit is also generated during each inner loop execution instead of generating only one sequence by adding “0” and “2n-1” to the previous n-1 bit sequence. Finally, we evaluate the performance of the proposed and existing algorithms by measuring the execution time with respect to number of bits and compare the results with each other. Simulation results demonstrate that Backtracking takes small execution time up to 10 bits with maximum improvement of 17.02%. The evaluation also demonstrates that MOptimal also takes small execution time for more than 15 bits showing an improvement of 2.10% for 23 bits.","PeriodicalId":338489,"journal":{"name":"2009 International Conference on Future Computer and Communication","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125114816","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}
引用次数: 11
A New Design for Improvement of Scalable-RTCP 一种改进可扩展rtcp的新设计
2009 International Conference on Future Computer and Communication Pub Date : 2009-04-03 DOI: 10.1109/ICFCC.2009.9
S. Shahbazi, K. Jumari, M. Ismail
{"title":"A New Design for Improvement of Scalable-RTCP","authors":"S. Shahbazi, K. Jumari, M. Ismail","doi":"10.1109/ICFCC.2009.9","DOIUrl":"https://doi.org/10.1109/ICFCC.2009.9","url":null,"abstract":"Real-time Transport Control Protocol (RTCP) is the control protocol of Real-time Transport Protocol (RTP), with responsibilities such as Quality of Service (QoS) adaptation, implementation, and troubleshooting. Various problems with RTCP have led to alternative designs, one of which is a hierarchical design named Scalable-RTCP (S-RTCP). In this article, we explain about the weaknesses associated with S-RTCP (most of which are stability issues), and propose different approaches to solve the weaknesses, exposing each one’s pros and cons, in addition to proposing new features.","PeriodicalId":338489,"journal":{"name":"2009 International Conference on Future Computer and Communication","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125263958","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
Collimation Properties of Microstrip Patch Fed Dielectric Lens Antenna for Broadband Mobile Communication 宽带移动通信微带贴片馈电介质透镜天线的准直特性
2009 International Conference on Future Computer and Communication Pub Date : 2009-04-03 DOI: 10.1109/ICFCC.2009.135
S. Thakur, T. Rukmini, S. Ravishankar, A. Mahesh
{"title":"Collimation Properties of Microstrip Patch Fed Dielectric Lens Antenna for Broadband Mobile Communication","authors":"S. Thakur, T. Rukmini, S. Ravishankar, A. Mahesh","doi":"10.1109/ICFCC.2009.135","DOIUrl":"https://doi.org/10.1109/ICFCC.2009.135","url":null,"abstract":"This paper demonstrates collimation property of dielectric lens over a multiband set of small size patch antennas. The lenses provide collimation, wide angle steering and act as rugged radome providing an effective protection for the array. Lens antennas are better suited to an ocean environment and mobile communication applications. The primary radiator which is microstrip patch is designed at S band to provide the desired radiation source. The dielectric lens is designed as a secondary radiator to produce the desired collimation, with low insertion loss. The fabricated lens was tested with and without primary radiators, in an anechoic chamber. The experimental results obtained are in close agreement with the simulation results obtained from IE3D and are highly encouraging.","PeriodicalId":338489,"journal":{"name":"2009 International Conference on Future Computer and Communication","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134486989","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}
引用次数: 2
首页 上一页 下一页 尾页
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学术官方微信
小红书