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

2008 11th International Conference on Computer and Information Technology最新文献

筛选
英文 中文
A study of major Mobile payment systems' functionality in Europe 欧洲主要移动支付系统的功能研究
2008 11th International Conference on Computer and Information Technology Pub Date : 2008-12-01 DOI: 10.1109/ICCITECHN.2008.4802995
S. Mohammadi, H. Jahanshahi
{"title":"A study of major Mobile payment systems' functionality in Europe","authors":"S. Mohammadi, H. Jahanshahi","doi":"10.1109/ICCITECHN.2008.4802995","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2008.4802995","url":null,"abstract":"Mobile payment is an exciting domain, which will rapidly evolve in the years to come. The key to mobile payment acceptance is in the hands of customers. In this paper first some of the major European mobile payment systems are introduced and evaluated base on security, cost , convenes and functionality requirement criteria, then the results of past researches about the customer and merchant adoption of mobile payment systems (mp) are reviewed and barriers and drivers from both customer and merchant view are compared. Here by, this paper tries to find shortcomings in major mp systems and presents the major barriers and drivers to wide spread adoption of mobile payment from both customer and merchant point of view.","PeriodicalId":335795,"journal":{"name":"2008 11th International Conference on Computer and Information Technology","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114657948","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}
引用次数: 15
Parallel performance of domain decomposition method on distributed computing environment 领域分解方法在分布式计算环境下的并行性能
2008 11th International Conference on Computer and Information Technology Pub Date : 2008-12-01 DOI: 10.1109/ICCITECHN.2008.4803010
A. Mukaddes, A. Uragami
{"title":"Parallel performance of domain decomposition method on distributed computing environment","authors":"A. Mukaddes, A. Uragami","doi":"10.1109/ICCITECHN.2008.4803010","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2008.4803010","url":null,"abstract":"Distributed parallel computing, which uses general-purpose workstations connected by a network as a large parallel computing resource, is one of the most promising trends in parallel computing. Over the last two decades, the growth in the use of such parallel computing environment has ensured the interest on the parallel finite element method. In this work, parallel finite element method using domain decomposition technique has been adapted to the distributed parallel environment of networked workstations and the supercomputer. Using the developed code, several model problems are solved and the parallel performances are analyzed on the network of eight Pentium IV PC cluster and GP7000F workstations. Finally, very large size of problem over 11 million DOFs has been solved using 1024 SR8000 supercomputer.","PeriodicalId":335795,"journal":{"name":"2008 11th International Conference on Computer and Information Technology","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114739228","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
Solar cell efficiency improvement using compound parabolic concentrator and an implementation of sun tracking system 利用复合抛物面聚光器提高太阳能电池效率并实现太阳跟踪系统
2008 11th International Conference on Computer and Information Technology Pub Date : 2008-12-01 DOI: 10.1109/ICCITECHN.2008.4803090
E. Hossain, R. Muhida, Ahmad Faris Dzulkipli, Khairul Azizi Abdul Rahman
{"title":"Solar cell efficiency improvement using compound parabolic concentrator and an implementation of sun tracking system","authors":"E. Hossain, R. Muhida, Ahmad Faris Dzulkipli, Khairul Azizi Abdul Rahman","doi":"10.1109/ICCITECHN.2008.4803090","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2008.4803090","url":null,"abstract":"This paper presents how the efficiency of solar cell can be increased with the design of compound parabolic concentrator and the implementation of sun tracking system. Sun tracking systems is an application of the machine vision (MV) and collaboration with data acquisition (DAQ) to systems by using a Web camera as a sensor and sound card as an output channel to drive a motor. The motors react as the mechanism of the camera to make sure it always focuses on the target of sun. By using a MatLab software programming environment, closes loop control is implemented to provide interaction between camera and sound card as a device to control the motor to track the sun.","PeriodicalId":335795,"journal":{"name":"2008 11th International Conference on Computer and Information Technology","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117023059","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}
引用次数: 15
Decision Tree based Routine Generation (DRG) algorithm: A data mining advancement to generate academic routine for open credit system 基于决策树的例程生成(DRG)算法:一种基于数据挖掘的开放性学分制例程生成算法
2008 11th International Conference on Computer and Information Technology Pub Date : 2008-12-01 DOI: 10.1109/ICCITECHN.2008.4803011
A. Rahman, S. Giasuddin, R. Rahman
{"title":"Decision Tree based Routine Generation (DRG) algorithm: A data mining advancement to generate academic routine for open credit system","authors":"A. Rahman, S. Giasuddin, R. Rahman","doi":"10.1109/ICCITECHN.2008.4803011","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2008.4803011","url":null,"abstract":"Mining data from a database using classification algorithm is not an innovative technique. This paper presents a technique namely decision tree based routine generation (DRG) algorithm to create an academic routine. The concept of open credit course registration system (after completion of pre-requisite courses any student may choose any course in any semester) makes the research more challenging and complex to accomplish. This is an NP-hard problem and hence unsolvable to satisfy all students and teachers at the same time. A level of tolerance has to be added to make the evaluation efficient and effective to achieve the goal, a conflict free routine. OLAP representation helps to classify the courses along with the proposed algorithm to eliminate some constraints. Day-based pattern, minimum Manhattan distance between courses of same teacher, minimum conflicted course distribution has been stage-managed to classify the courses. To alleviate the algorithm, decision tree based models and sequential search methods are espoused with computational results.","PeriodicalId":335795,"journal":{"name":"2008 11th International Conference on Computer and Information Technology","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124054818","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
Achieving guaranteed performance on computational Grid 在计算网格上实现有保证的性能
2008 11th International Conference on Computer and Information Technology Pub Date : 2008-12-01 DOI: 10.1109/ICCITECHN.2008.4802996
A. Sarkar, Dibyajyoti Ghosh, Rupam Mukhopadhyay, N. Mukherjee
{"title":"Achieving guaranteed performance on computational Grid","authors":"A. Sarkar, Dibyajyoti Ghosh, Rupam Mukhopadhyay, N. Mukherjee","doi":"10.1109/ICCITECHN.2008.4802996","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2008.4802996","url":null,"abstract":"For the dynamic nature of the grid, the applications need to adapt to the changing resource status and usage scenarios. This is required to ensure that the performances of the components do not suffer. Objective of this paper is to present an adaptive execution scheme for achieving guaranteed performance as has been agreed upon through service level agreements (SLAs). The scheme has been implemented based on the notion of performance properties and by deploying a set of autonomous agents within an integrated performance-based resource management framework.","PeriodicalId":335795,"journal":{"name":"2008 11th International Conference on Computer and Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129658376","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
A unifying viewpoint of some clustering techniques using Bregman divergences and extensions to mixed data sets 用Bregman散度和扩展对混合数据集的聚类技术的统一观点
2008 11th International Conference on Computer and Information Technology Pub Date : 2008-12-01 DOI: 10.1109/ICCITECHN.2008.4803110
C. Levasseur, B. Burdge, K. Kreutz-Delgado, U. Mayer
{"title":"A unifying viewpoint of some clustering techniques using Bregman divergences and extensions to mixed data sets","authors":"C. Levasseur, B. Burdge, K. Kreutz-Delgado, U. Mayer","doi":"10.1109/ICCITECHN.2008.4803110","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2008.4803110","url":null,"abstract":"We present a general viewpoint using Bregman divergences and exponential family properties that contains as special cases the three following algorithms: 1) exponential family principal component analysis (exponential PCA), 2) Semi-Parametric exponential family principal component analysis (SP-PCA) and 3) Bregman soft clustering. This framework is equivalent to a mixed data-type hierarchical Bayes graphical model assumption with latent variables constrained to a low-dimensional parameter subspace. We show that within this framework exponential PCA and SPPCA are similar to the Bregman soft clustering technique with the addition of a linear constraint in the parameter space. We implement the resulting modifications to SP-PCA and Bregman soft clustering for mixed (continuous and/or discrete) data sets, and add a nonparametric estimation of the point-mass probabilities to exponential PCA. Finally, we compare the relative performances of the three algorithms in a clustering setting for mixed data sets.","PeriodicalId":335795,"journal":{"name":"2008 11th International Conference on Computer and Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130013359","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
Performance evaluation of a wireless Orthogonal Frequency Division Multiplexing system under various concatenated FEC channel-coding schemes 不同串联FEC信道编码方案下无线正交频分复用系统的性能评价
2008 11th International Conference on Computer and Information Technology Pub Date : 2008-12-01 DOI: 10.1109/ICCITECHN.2008.4802994
M. Haque, S. Ullah, M. R. Ahmed
{"title":"Performance evaluation of a wireless Orthogonal Frequency Division Multiplexing system under various concatenated FEC channel-coding schemes","authors":"M. Haque, S. Ullah, M. R. Ahmed","doi":"10.1109/ICCITECHN.2008.4802994","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2008.4802994","url":null,"abstract":"In this paper, we study the effect of various concatenated forward error correction (FEC) codes on the performance of a wireless orthogonal frequency division multiplexing (OFDM) system. In FEC concatenated channel code, the OFDM system incorporates Reed-Solomon (RS) encoder of (255,239,8), Cyclic Encoder of (15,11), Bose-Chadhuri-Hocquenghem (BCH) encoder of (127,64) with Convolution encoder of 2/3 and frac34-rated codes under different combinations of digital modulation (QPSK, 8PSK, 32-QAM and 64-QAM). The simulation study is made with the development of a computer program written in Matlab source code on the processing of recorded audio signal under additive white Gaussian noise (AWGN) channel. The simulation results of estimated Bit error rate (BER) show that the implementation of concatenated RS(255,239,8) code with frac34-rated Convolutional code under QPSK modulation technique is highly effective to combat inherent interference in the communication system. Due to constraint in data handling capability of the Matlab editor, a segment of the recorded audio signal is used for analysis. The transmitted audio message is found to have retrieved effectively under noisy situation.","PeriodicalId":335795,"journal":{"name":"2008 11th International Conference on Computer and Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130117505","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}
引用次数: 22
A novel fuzzy method to traffic light control based on unidirectional selective cellular automata for urban traffic 基于单向选择元胞自动机的模糊交通信号灯控制新方法
2008 11th International Conference on Computer and Information Technology Pub Date : 2008-12-01 DOI: 10.1109/ICCITECHN.2008.4803071
M. Shakeri, H. Deldari, A. Rezvanian, H. Foroughi
{"title":"A novel fuzzy method to traffic light control based on unidirectional selective cellular automata for urban traffic","authors":"M. Shakeri, H. Deldari, A. Rezvanian, H. Foroughi","doi":"10.1109/ICCITECHN.2008.4803071","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2008.4803071","url":null,"abstract":"Vehicular travel which demands on the concurrent operations and parallel activities is increasing throughout the world. In this paper to control urban traffic, we study the optimization of traffic light controller in a city and present a fuzzy algorithm based on cellular automata. In existent system factors like priority of streets of intersection and width/length of streets are assumed equal. However, in real situations parameters like time during the day, density of vehicles of street and number of shopping centers have determinant effects on amount of traffic of streets. To overcome such limitations we propose a three leveled fuzzy system. At first level priority of street is computed based on fuzzy rules. At second level real velocity of vehicles is calculated. We use CA for simulating vehicles' density transmission. At third level by regarding priority of street and amount of density, decision for changing status of traffic light is done.","PeriodicalId":335795,"journal":{"name":"2008 11th International Conference on Computer and Information Technology","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128888979","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 system for locating users of WLAN using dynamic mapping in indoor and outdoor environment-LOIDS 一种在室内和室外环境中使用动态映射定位WLAN用户的系统
2008 11th International Conference on Computer and Information Technology Pub Date : 2008-12-01 DOI: 10.1109/ICCITECHN.2008.4802971
K. Naik, M.N. Giri Prasad
{"title":"A system for locating users of WLAN using dynamic mapping in indoor and outdoor environment-LOIDS","authors":"K. Naik, M.N. Giri Prasad","doi":"10.1109/ICCITECHN.2008.4802971","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2008.4802971","url":null,"abstract":"The development of portable, light weight, hand held computing devices and high speed wireless local area networks enable user to remain connected while moving in indoor and outdoor environment. Wireless local area network has a wide range of utilization in moving from one location to another location. When a user is moving from one location to another, how the other user knows about the required station inside WLAN, for that we designed and implemented a system to locate a mobile user inside the wireless local area network based on RSSI. We designed four different architectures and used dynamic radio mapping of indoor and outdoor locations. These architectures are based on dynamic configuration of radio map in indoor and outdoor environment with the help of Sniffer, a specially designed application to locate a station at that time. We found a better location of a mobile user in WLAN with the help of Pamvotis a WLAN simulator. We tested this work in indoor and outdoor environment with different locations practically.","PeriodicalId":335795,"journal":{"name":"2008 11th International Conference on Computer and Information Technology","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130553390","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}
引用次数: 6
Smallest and some new equiprojective polyhedra 最小和一些新的等射影多面体
2008 11th International Conference on Computer and Information Technology Pub Date : 2008-12-01 DOI: 10.1109/ICCITECHN.2008.4803063
M. Hasan, M.M. Hossain, S. Nusrat, A. López-Ortiz
{"title":"Smallest and some new equiprojective polyhedra","authors":"M. Hasan, M.M. Hossain, S. Nusrat, A. López-Ortiz","doi":"10.1109/ICCITECHN.2008.4803063","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2008.4803063","url":null,"abstract":"A convex polyhedron P is k-equiprojective if for all of its orthogonal projections, except those parallel to the faces of P, the number of vertices in the shadow boundary is k. Finding an algorithm to construct all equiprojective polyhedra is an open problem first posed in 1968. In this paper we give lower bounds on the value of k and the size of an equiprojective polyhedron. We prove that there is no 3- or 4-equiprojective polyhedra and a triangular prism is the only 5-equiprojective polyhedron. We also discover some new equiprojective polyhedra.","PeriodicalId":335795,"journal":{"name":"2008 11th International Conference on Computer and Information Technology","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132185450","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学术文献互助群
群 号：481959085
Book学术官方微信