Pub Date : 2009-09-25DOI: 10.1109/ICICT.2009.5267214
Omar Tayan
The rate of increase of silicon capacity in Integrated Circuits (IC) will enable system integration of several billion transistors to reside on a single chip in the near future. Future System-on-Chip (SoC) systems must therefore integrate upto several hundreds of cores within a single chip, and SoC designs will employ on-chip communication networks (NoCs) as a result. This paper discusses the problems with many current SoC systems, surveys the challenges and trends facing future SoC designs and proposes a mechanism for enhancing NoC strategies of the future by enhancing memory management and utilization techniques within an NoC.
{"title":"Networks-on-Chip: Challenges, trends and mechanisms for enhancements","authors":"Omar Tayan","doi":"10.1109/ICICT.2009.5267214","DOIUrl":"https://doi.org/10.1109/ICICT.2009.5267214","url":null,"abstract":"The rate of increase of silicon capacity in Integrated Circuits (IC) will enable system integration of several billion transistors to reside on a single chip in the near future. Future System-on-Chip (SoC) systems must therefore integrate upto several hundreds of cores within a single chip, and SoC designs will employ on-chip communication networks (NoCs) as a result. This paper discusses the problems with many current SoC systems, surveys the challenges and trends facing future SoC designs and proposes a mechanism for enhancing NoC strategies of the future by enhancing memory management and utilization techniques within an NoC.","PeriodicalId":147005,"journal":{"name":"2009 International Conference on Information and Communication Technologies","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128693763","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}
Pub Date : 2009-09-25DOI: 10.1109/ICICT.2009.5267197
M. Zamani, Hamed Taherdoost, A. Manaf, R. Ahmad, A. Zeki
Steganography is a technique used to transmit hidden information by modifying an audio signal in an imperceptible manner. The transmission must be possible in spite of subsequent imperceptible alterations (attacks) of the modified signal. We propose a novel approach of substitution technique of audio steganography. Using genetic algorithm, message bits are embedded into multiple, vague and higher LSB layers, resulting in increased robustness. The robustness specially would be increased against those intentional attacks which try to reveal the hidden message and also some unintentional attacks like noise addition as well.
{"title":"Robust audio steganography via genetic algorithm","authors":"M. Zamani, Hamed Taherdoost, A. Manaf, R. Ahmad, A. Zeki","doi":"10.1109/ICICT.2009.5267197","DOIUrl":"https://doi.org/10.1109/ICICT.2009.5267197","url":null,"abstract":"Steganography is a technique used to transmit hidden information by modifying an audio signal in an imperceptible manner. The transmission must be possible in spite of subsequent imperceptible alterations (attacks) of the modified signal. We propose a novel approach of substitution technique of audio steganography. Using genetic algorithm, message bits are embedded into multiple, vague and higher LSB layers, resulting in increased robustness. The robustness specially would be increased against those intentional attacks which try to reveal the hidden message and also some unintentional attacks like noise addition as well.","PeriodicalId":147005,"journal":{"name":"2009 International Conference on Information and Communication Technologies","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130464161","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}
Pub Date : 2009-09-25DOI: 10.1109/ICICT.2009.5267187
Muhammad Ubaid, Nauman Atique, Saira Begum
In object oriented scenario, inheritance is a process to make new classes by using classes that have already been defined. Inheritance helps to reuse existing code, by adding together of properties will enhance all new child objects without interfering with their existing ties. In object-oriented programming, an object is instance of class that consists of data and the methods, allows binding for them and operate on that data, stored in the memory of a running application. This paper presents a methodology of class hierarchy with the normalization in object oriented databases. CHNF (Class Hierarchy Normal Form) is good concept for implementing the normalization in class schema. The dilemma is that CHNF has not defined the levels for depth of inheritance; it is possible that CHNF base architecture invalidate the depth of Inheritance and other metrics, which is defined by CK Metrics1. As the database expends, heavy objects become complicated to handle. Although the more deep hierarchy tree implies that we have good reuse of code but it sound awful effects on memory and performance. For avoiding the heavy objects we have discovered a pattern CHNFP (Class Hierarchy Normal Form Pattern). It follows the concept of CHNF as well as it validates the CK Metrics.
在面向对象的场景中，继承是通过使用已经定义的类来生成新类的过程。继承有助于重用现有代码，通过将属性添加在一起将增强所有新的子对象，而不会干扰它们现有的联系。在面向对象编程中，对象是由数据和方法组成的类的实例，允许对这些数据进行绑定并对这些数据进行操作，这些数据存储在运行中的应用程序的内存中。提出了一种面向对象数据库中类层次结构的规范化方法。CHNF (Class Hierarchy Normal Form)是实现类模式规范化的一个很好的概念。困境在于CHNF没有定义继承深度的级别;CHNF基础架构有可能使继承深度和其他指标无效，这些指标是由CK metrics定义的。随着数据库的扩展，沉重的对象变得难以处理。虽然更深层次的树意味着我们可以很好地重用代码，但它对内存和性能的影响听起来很糟糕。为了避免沉重的对象，我们发现了一个模式CHNFP(类层次范式模式)。它遵循CHNF的概念，并验证了CK指标。
{"title":"A pattern for the effective use of object oriented databases","authors":"Muhammad Ubaid, Nauman Atique, Saira Begum","doi":"10.1109/ICICT.2009.5267187","DOIUrl":"https://doi.org/10.1109/ICICT.2009.5267187","url":null,"abstract":"In object oriented scenario, inheritance is a process to make new classes by using classes that have already been defined. Inheritance helps to reuse existing code, by adding together of properties will enhance all new child objects without interfering with their existing ties. In object-oriented programming, an object is instance of class that consists of data and the methods, allows binding for them and operate on that data, stored in the memory of a running application. This paper presents a methodology of class hierarchy with the normalization in object oriented databases. CHNF (Class Hierarchy Normal Form) is good concept for implementing the normalization in class schema. The dilemma is that CHNF has not defined the levels for depth of inheritance; it is possible that CHNF base architecture invalidate the depth of Inheritance and other metrics, which is defined by CK Metrics1. As the database expends, heavy objects become complicated to handle. Although the more deep hierarchy tree implies that we have good reuse of code but it sound awful effects on memory and performance. For avoiding the heavy objects we have discovered a pattern CHNFP (Class Hierarchy Normal Form Pattern). It follows the concept of CHNF as well as it validates the CK Metrics.","PeriodicalId":147005,"journal":{"name":"2009 International Conference on Information and Communication Technologies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130623106","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}
Pub Date : 2009-09-25DOI: 10.1109/ICICT.2009.5267213
Waseem Arain, S. Ghani
Mobile ad hoc networks are increasingly finding their existence in the marketplace heading to a new paradigm of pervasive computing. However there are many areas open to research in the field. Due to node mobility resulting in an ever-changing network topology, conventional routing methods cannot be applied in MANETS. Therefore, this is one of the core areas of research. Researchers are challenged to design protocols that can potentially scale to anything from thousand to tens of thousands of nodes and to reduce the route discovery latency. In this paper a different instantiation of Way Point Routing (WPR) model is proposed, where a route is divided into sub-routes to decrease route-latency in frequently occurring subsequent-route-discoveries and to adapt varying topologies in MANET, and future simulations are suggested to evaluate the performance of the proposed routing protocol.
{"title":"An instantiation of Way Point Routing for Mobile ad hoc Networks","authors":"Waseem Arain, S. Ghani","doi":"10.1109/ICICT.2009.5267213","DOIUrl":"https://doi.org/10.1109/ICICT.2009.5267213","url":null,"abstract":"Mobile ad hoc networks are increasingly finding their existence in the marketplace heading to a new paradigm of pervasive computing. However there are many areas open to research in the field. Due to node mobility resulting in an ever-changing network topology, conventional routing methods cannot be applied in MANETS. Therefore, this is one of the core areas of research. Researchers are challenged to design protocols that can potentially scale to anything from thousand to tens of thousands of nodes and to reduce the route discovery latency. In this paper a different instantiation of Way Point Routing (WPR) model is proposed, where a route is divided into sub-routes to decrease route-latency in frequently occurring subsequent-route-discoveries and to adapt varying topologies in MANET, and future simulations are suggested to evaluate the performance of the proposed routing protocol.","PeriodicalId":147005,"journal":{"name":"2009 International Conference on Information and Communication Technologies","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124664494","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}
Pub Date : 2009-09-25DOI: 10.1109/ICICT.2009.5267189
Reza Entezari-Maleki, Seyyed Mehdi Iranmanesh, B. Minaei-Bidgoli
In this paper, the precisions of the logistic regression, Naïve-Bayes and linear data classification methods, with regard to the Area Under Curve (AUC) metric have been compared. The effect of parameters including size of the dataset, kind of the independent attributes, number of the discrete attributes, and their values have been investigated. From the results, it can be concluded that in datasets consisting of both discrete and continuous attributes, the AUC of the three mentioned classifiers is the same. With increasing the number of the discrete attributes, the AUC of the logistic regression is increased and the precision related to this classifier become more than the other two classifiers. Also considering impact of the discrete attributes it can be seen that with increasing the number of values in discrete attributes the AUC related to the logistic regression classifier increases and linear regressions' AUC decreases, but the AUC of the Naïve-Bayes classifier remains constant. The results of this research can help data miners in selecting the more efficient classifiers based on the conditions of feature that exist in their datasets.
{"title":"An experimental investigation of the effect of discrete attributes on the precision of classification methods","authors":"Reza Entezari-Maleki, Seyyed Mehdi Iranmanesh, B. Minaei-Bidgoli","doi":"10.1109/ICICT.2009.5267189","DOIUrl":"https://doi.org/10.1109/ICICT.2009.5267189","url":null,"abstract":"In this paper, the precisions of the logistic regression, Naïve-Bayes and linear data classification methods, with regard to the Area Under Curve (AUC) metric have been compared. The effect of parameters including size of the dataset, kind of the independent attributes, number of the discrete attributes, and their values have been investigated. From the results, it can be concluded that in datasets consisting of both discrete and continuous attributes, the AUC of the three mentioned classifiers is the same. With increasing the number of the discrete attributes, the AUC of the logistic regression is increased and the precision related to this classifier become more than the other two classifiers. Also considering impact of the discrete attributes it can be seen that with increasing the number of values in discrete attributes the AUC related to the logistic regression classifier increases and linear regressions' AUC decreases, but the AUC of the Naïve-Bayes classifier remains constant. The results of this research can help data miners in selecting the more efficient classifiers based on the conditions of feature that exist in their datasets.","PeriodicalId":147005,"journal":{"name":"2009 International Conference on Information and Communication Technologies","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127895677","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}
Pub Date : 2009-08-01DOI: 10.1109/ICICT.2009.5267208
J. Al-Muhtadi, A. Basit, M. Mahmud
Many systems have been developed by mathematicians using symmetric and Asymmetric Cryptography e.g. Ceaser Cipher, Stream Ciphers, RSA, DES, IDEA, RC-4, ElGamal signatures, LFSR, Ext. Euclidean Algorithm, Lamport Signatures, Merkle Hellman Knapsack. Etc [1]. Some of them are very strong to be broken by cryptanalysts. Some are very easy and even can be broken by the measuring the frequency of alphabets in a specific cipher text. All these system carries some overhead of key with which a plain text is encrypted, for the communication channel. I thought of an idea in which product component which will be 5*1 matrix will be carried on the communication channel rather than 5*5. This 5*5 will be obtained on the receiver side inversing and producting the received matrix with symmetric key which will be known to both sender and receiver. This idea is achieved by peeping into the systems of CDMA (Code Division Multiple Access) [6] in which Walsh tables are minimized by multiplying and less overhead is achieved by communication channel. I am applying that idea in the context of cryptosystems. My Cryptosystem is that much strong enough to be broken by cryptanalyst but fewer loads for communication channel especially for Wireless Networks, Ad-Hoc Networks and Sensor Networks in minimum energy and less memory usage is main goal. The name suggested for this cryptosystem is as BasitMaxCryptoSystem.
{"title":"Development of symmetric cryptosystem using matrices with less overhead on communication channel","authors":"J. Al-Muhtadi, A. Basit, M. Mahmud","doi":"10.1109/ICICT.2009.5267208","DOIUrl":"https://doi.org/10.1109/ICICT.2009.5267208","url":null,"abstract":"Many systems have been developed by mathematicians using symmetric and Asymmetric Cryptography e.g. Ceaser Cipher, Stream Ciphers, RSA, DES, IDEA, RC-4, ElGamal signatures, LFSR, Ext. Euclidean Algorithm, Lamport Signatures, Merkle Hellman Knapsack. Etc [1]. Some of them are very strong to be broken by cryptanalysts. Some are very easy and even can be broken by the measuring the frequency of alphabets in a specific cipher text. All these system carries some overhead of key with which a plain text is encrypted, for the communication channel. I thought of an idea in which product component which will be 5*1 matrix will be carried on the communication channel rather than 5*5. This 5*5 will be obtained on the receiver side inversing and producting the received matrix with symmetric key which will be known to both sender and receiver. This idea is achieved by peeping into the systems of CDMA (Code Division Multiple Access) [6] in which Walsh tables are minimized by multiplying and less overhead is achieved by communication channel. I am applying that idea in the context of cryptosystems. My Cryptosystem is that much strong enough to be broken by cryptanalyst but fewer loads for communication channel especially for Wireless Networks, Ad-Hoc Networks and Sensor Networks in minimum energy and less memory usage is main goal. The name suggested for this cryptosystem is as BasitMaxCryptoSystem.","PeriodicalId":147005,"journal":{"name":"2009 International Conference on Information and Communication Technologies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130434963","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：