2006 International Conference on Computer Engineering and Systems最新文献

筛选
英文 中文
A Cycle-Accurate Micro-Architecture Simulation Framework for Embedded Processors 一种周期精确的嵌入式处理器微结构仿真框架
2006 International Conference on Computer Engineering and Systems Pub Date : 2006-11-01 DOI: 10.1109/ICCES.2006.320428
A. Ghanem, A. El-Mahdy, I. A. El-Salam
{"title":"A Cycle-Accurate Micro-Architecture Simulation Framework for Embedded Processors","authors":"A. Ghanem, A. El-Mahdy, I. A. El-Salam","doi":"10.1109/ICCES.2006.320428","DOIUrl":"https://doi.org/10.1109/ICCES.2006.320428","url":null,"abstract":"The growth in embedded systems applications and sophistication increased the need for rapid development and modeling of embedded processors. Embedded processors are usually application specific. This causes the strong need for modeling environments that can be used for rapid generation of detailed micro-architecture processor simulators. However, existing simulation tools in this category are far less mature and mostly commercial. This paper presents a generic cycle-accurate micro-architecture simulation framework for embedded processors. The framework is designed to generate an RTL (register transfer level) cycle accurate simulator. The framework is built in Java to provide features like extensibility, ability to be changed easily and platform independence. It provides the above features while being as fast as most known available frameworks. The paper uses ARM1022E as an example for embedded processors due to its wide range of applications like modems, cellular phones and automobiles. It simulates its two instruction set architectures (ISA): ARM (32-bit ISA) and THUMB (16-bit ISA). The paper verifies the framework by comparing the ARM simulator with ARMulator (from ARM Ltd.). It also compares the current simulation speed with available known frameworks. Lastly, the paper provides a study of ADPCM (adaptive differential pulse code modulation) decode performance on the ARM1022E processor using the framework","PeriodicalId":261853,"journal":{"name":"2006 International Conference on Computer Engineering and Systems","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124570469","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
Software Projects Success Factors Identification using Data Mining 使用数据挖掘识别软件项目成功因素
2006 International Conference on Computer Engineering and Systems Pub Date : 2006-11-01 DOI: 10.1109/ICCES.2006.320489
A. Yousef, A. Gamal, A. Warda, M. Mahmoud
{"title":"Software Projects Success Factors Identification using Data Mining","authors":"A. Yousef, A. Gamal, A. Warda, M. Mahmoud","doi":"10.1109/ICCES.2006.320489","DOIUrl":"https://doi.org/10.1109/ICCES.2006.320489","url":null,"abstract":"Software project management is the art and science of planning and leading software projects to achieve predetermined corporate goals. It requires knowledge of the entire software development lifecycle. The project manager's main responsibility is to ensure a successful project outcome. Project success is normally defined as achieving desired project objectives and features within desired cost and schedule. Many factors affect project success including dealing with gathering requirements, customer involvements and project management. Several researchers have investigated the success or failure of software projects using statistical approaches. In this paper, a Web based survey and interviews are used to collect project data, about requirements, project sponsor and customers. Tools such as association, neural networks, clustering, Naive Bayes and decision tree are used to discover common characteristics and rules that govern project success and failure. The results show the power of data mining algorithms to discover the most important factors and associations in project success and failure. Results showed that each mining algorithm has a particular strength to provide knowledge and make predictions about project success opportunities","PeriodicalId":261853,"journal":{"name":"2006 International Conference on Computer Engineering and Systems","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117053761","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
Distributed Reconstruction of Implicit Surfaces 隐曲面的分布重构
2006 International Conference on Computer Engineering and Systems Pub Date : 2006-11-01 DOI: 10.1109/ICCES.2006.320417
M. Wahab, A. S. Hussein, A. Aziz
{"title":"Distributed Reconstruction of Implicit Surfaces","authors":"M. Wahab, A. S. Hussein, A. Aziz","doi":"10.1109/ICCES.2006.320417","DOIUrl":"https://doi.org/10.1109/ICCES.2006.320417","url":null,"abstract":"This paper presents an approach to use the partition of unity technique associated with the radial basis technique to provide implicit surface reconstruction over a distributed environment. The proposed algorithm acquires all the advantages of the partition of unity with better performance and capability of reconstructing surfaces from larger data sets. The global large implicit surface reconstruction problem is partitioned into smaller independent radial basis functions fitting problems. These local problems are distributed over the processing nodes solved independently then the recombined together over the master processing node using the partition of unity. The experimental results for the benchmark models demonstrated that the proposed algorithm can reduce the total radial basis functions fitting time with about 66% using 10 processing nodes. Also, the large models with size of O(106)points can be reconstructed with acceptable reconstruction time","PeriodicalId":261853,"journal":{"name":"2006 International Conference on Computer Engineering and Systems","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114581673","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
A Multi-Engine LUT-Based Synthesis Framework 基于多引擎lut的合成框架
2006 International Conference on Computer Engineering and Systems Pub Date : 2006-11-01 DOI: 10.1109/ICCES.2006.320435
B.A. Hamed, A. Salem, G. Aly
{"title":"A Multi-Engine LUT-Based Synthesis Framework","authors":"B.A. Hamed, A. Salem, G. Aly","doi":"10.1109/ICCES.2006.320435","DOIUrl":"https://doi.org/10.1109/ICCES.2006.320435","url":null,"abstract":"In this paper, we present a new synthesis framework. This framework, ASU-Synthesizer, is built for logic synthesis for LUT based FPGAs. The synthesis process is composed of logic optimization and technology mapping. We implemented the different categories of logic optimization algorithms. Then we used the well known technology mapping package, Flow-Map (Cong et al., 1996). We added to the framework, our online area estimator that we proposed before in (Hamed et al., 2004). This framework can be used to build any commercial synthesis tool for LUT-based designs","PeriodicalId":261853,"journal":{"name":"2006 International Conference on Computer Engineering and Systems","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128142077","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
Key Exchange by Synchronization of two Chaotic Systems 两个混沌系统的同步密钥交换
2006 International Conference on Computer Engineering and Systems Pub Date : 2006-11-01 DOI: 10.1109/ICCES.2006.320444
A. Eldin
{"title":"Key Exchange by Synchronization of two Chaotic Systems","authors":"A. Eldin","doi":"10.1109/ICCES.2006.320444","DOIUrl":"https://doi.org/10.1109/ICCES.2006.320444","url":null,"abstract":"In this paper, the idea of synchronization of two chaotic systems is used to solve the key exchange problem in cryptography. A proposal for a protocol is given and it is claimed that this method is simple and secure against known attack with the proof that the underlying chaotic systems model is a very hard problem to be solved, unlike the discrete logarithmic problem and other problems currently being used for key exchange which are only believed to be hard","PeriodicalId":261853,"journal":{"name":"2006 International Conference on Computer Engineering and Systems","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125832895","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
Realistic Missile Modeling for Guidance Applications 制导应用的逼真导弹建模
2006 International Conference on Computer Engineering and Systems Pub Date : 2006-11-01 DOI: 10.1109/ICCES.2006.320441
M. Sobh, M. Sheirah
{"title":"Realistic Missile Modeling for Guidance Applications","authors":"M. Sobh, M. Sheirah","doi":"10.1109/ICCES.2006.320441","DOIUrl":"https://doi.org/10.1109/ICCES.2006.320441","url":null,"abstract":"In this paper, a general missile modeling is presented. An accurate model for missiles is proposed taking into consideration the rigid body dynamics in 3D space with 6 degrees of freedom. Different coordinate systems, variation of missile mass, aerodynamics, air speed and density, gravity, propulsion system, actuators, measurement and tracking devices are also considered. The full model is implemented and integrated within a simulation environment to facilitate missile guidance design. The developed model is optimized for both high simulation speed and accurate calculations. Other modules are implemented to calculate aerodynamics coefficients, generate random signal, provide both conventional and intelligent control, and represents the missile-target engagement visually. The whole system is successfully used to implement different guidance techniques","PeriodicalId":261853,"journal":{"name":"2006 International Conference on Computer Engineering and Systems","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126854571","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 Method for Fast Revocation of Certificateless Public Key Cryptography 一种快速撤销无证书公钥加密的方法
2006 International Conference on Computer Engineering and Systems Pub Date : 2006-11-01 DOI: 10.1109/ICCES.2006.320456
Ibrahim I. Ibrahim, M. Ibrahim, Ali M. Allam
{"title":"A Method for Fast Revocation of Certificateless Public Key Cryptography","authors":"Ibrahim I. Ibrahim, M. Ibrahim, Ali M. Allam","doi":"10.1109/ICCES.2006.320456","DOIUrl":"https://doi.org/10.1109/ICCES.2006.320456","url":null,"abstract":"\"Certificateless public key cryptography\" has very appealing features, namely it does not require any public key certification (traditional public key cryptography) nor having key escrow problem (identity-based cryptography). Unfortunately, construction of certificateless public key encryption (CLPKE) schemes has so far depended on the use of identity-based encryption, which results in the bilinear pairing-based schemes that need costly operations. In this paper, we consider a relaxation of the original model of CLPKE and propose a new CLPKE scheme that does not depend on the bilinear pairings","PeriodicalId":261853,"journal":{"name":"2006 International Conference on Computer Engineering and Systems","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124404953","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
Analysis of Optical Code Division Multiple Access Passive Networks for Different Encoder Delay Elements 不同编码器时延的光码分多址无源网络分析
2006 International Conference on Computer Engineering and Systems Pub Date : 2006-11-01 DOI: 10.1109/ICCES.2006.320464
M. A. Morsy, K. M. Hassan, A. H. Morshed, A. Elhennawy
{"title":"Analysis of Optical Code Division Multiple Access Passive Networks for Different Encoder Delay Elements","authors":"M. A. Morsy, K. M. Hassan, A. H. Morshed, A. Elhennawy","doi":"10.1109/ICCES.2006.320464","DOIUrl":"https://doi.org/10.1109/ICCES.2006.320464","url":null,"abstract":"One of the most important core technologies in the development of optical code division multiple access (OCDMA) local area networks is the optical encoder/decoder embodiment technology which codes information to fixed patterns at the transmitting side and decodes information at the receiving side. The selection of optimized encoding method for network composition is necessary to accommodate a maximum number of subscribers that have simultaneous access over the local area network and the bandwidth of subscriber services available on it. When composing this encoder/decoder optically, passive elements are exclusively used, if possible, so as to make the composition method simple and economical. In this paper we present an analysis of OCDMA passive communication networks focusing on the modeling of optical encoder/decoder blocks for different types of delay elements. The main objective of the paper is to study the performance of these networks including the effect of the passive encoder/decoder parameters such as splitter and optical delay line losses. Different types of delay lines are proposed including optical fibers and fiber Bragg gratings (FBG) as delay elements for the selection of the optical delay line which achieves a better performance. A statistical model of an OCDMA network has been developed and used for this study, including the effect of different passive encoder/decoder parameters, multiple access interference and noise","PeriodicalId":261853,"journal":{"name":"2006 International Conference on Computer Engineering and Systems","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122475740","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}
引用次数: 8
A Hardware Accelerator for SAT Solving 求解SAT的硬件加速器
2006 International Conference on Computer Engineering and Systems Pub Date : 2006-11-01 DOI: 10.1109/ICCES.2006.320437
M. Safar, M. Shalan, M. El-Kharashi, A. Salem
{"title":"A Hardware Accelerator for SAT Solving","authors":"M. Safar, M. Shalan, M. El-Kharashi, A. Salem","doi":"10.1109/ICCES.2006.320437","DOIUrl":"https://doi.org/10.1109/ICCES.2006.320437","url":null,"abstract":"The Boolean satisfiability problem (SAT) is a central problem in artificial intelligence, mathematical logic and computing theory with wide range of practical applications. Being an NP-complete problem, the used SAT's solving algorithm execution time influences the performance of SAT-based applications. FPGAs represent a promising technology for accelerating SAT solvers. In this paper, we present an FPGA-based SAT solver based on depth-first search. Our architecture exploits the fine granularity and massive parallelism of FPGAs to evaluate the SAT formula and perform conflict diagnosis. Conflict diagnosis helps pruning the search space by allowing nonchronological conflict directed backtracking. We compare our SAT solver with three other SAT solvers. The gain in performance is validated through DIMACS benchmarks suite","PeriodicalId":261853,"journal":{"name":"2006 International Conference on Computer Engineering and Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123320107","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
A Comparison of Principal Component Analysis and Generalized Hebbian Algorithm for Image Compression and Face Recognition 主成分分析与广义Hebbian算法在图像压缩与人脸识别中的比较
2006 International Conference on Computer Engineering and Systems Pub Date : 2006-11-01 DOI: 10.1109/ICCES.2006.320450
M. Rizk, E. Koosha
{"title":"A Comparison of Principal Component Analysis and Generalized Hebbian Algorithm for Image Compression and Face Recognition","authors":"M. Rizk, E. Koosha","doi":"10.1109/ICCES.2006.320450","DOIUrl":"https://doi.org/10.1109/ICCES.2006.320450","url":null,"abstract":"In this paper we perform image compression and face recognition using principal component analysis (PCA) and the generalized Hebbian algorithm (GHA) which is one of the PCA techniques involving neural network. By implementing the PCA and GHA algorithms for image compression we found that PCA gives better compression ratio to the image than GHA and as for face recognition we found that GHA gives more recognition rate than PCA","PeriodicalId":261853,"journal":{"name":"2006 International Conference on Computer Engineering and Systems","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131682602","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}
引用次数: 9
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学术官方微信