Because of rapid hardware design's evolution, hardware circuits are more complex. Hardware designer would not spend too much time to produce the circuits. One of hardware designers' problems is redesigning of circuit occurring when specifications were changed. The existing research proves that object-oriented concept can be applied efficiently in hardware design covering both combinational and sequential logic circuits. Aspect-oriented is a new paradigm in software development. It can solve some problems such as crosscutting concerns where object oriented concept cannot. This paper proposes the idea that aspect-oriented concept can be implemented to the sequential logic circuit resulting in reducing time in hardware design process.
{"title":"An applying aspect-oriented concept to sequential logic design","authors":"Petcharat Burapathana, Proadpran Pitsatorn, Boonchai Sowanwanichkul","doi":"10.1109/ITCC.2005.69","DOIUrl":"https://doi.org/10.1109/ITCC.2005.69","url":null,"abstract":"Because of rapid hardware design's evolution, hardware circuits are more complex. Hardware designer would not spend too much time to produce the circuits. One of hardware designers' problems is redesigning of circuit occurring when specifications were changed. The existing research proves that object-oriented concept can be applied efficiently in hardware design covering both combinational and sequential logic circuits. Aspect-oriented is a new paradigm in software development. It can solve some problems such as crosscutting concerns where object oriented concept cannot. This paper proposes the idea that aspect-oriented concept can be implemented to the sequential logic circuit resulting in reducing time in hardware design process.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"220 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115599785","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}
TUG (Tree Unified with Grammar) was developed to support a system to be developed through an integration of conventional software development, operational specification, rapid prototyping via software transformations, software reuse, and analysis of specifications and programs via testing and proofs. The language integrates various software development paradigms into a coherent whole to fit specific needs of developing organizations. This paper shows how to write reusable specifications in TUG. Compared to other existing specification languages, the advantages, disadvantages, limitations, and strengths of the language is discussed. The language improves the reusability of formal specifications in the following ways: (i) a developer can run a TUG specification as a prototype to study its behavior due to its executability at the front-end of the software life cycle, (ii) a developer can easily write a parametric program corresponding to its parametric specification due to the similar semantics.
{"title":"An introduction to TUG: a language for writing reusable formal program specifications","authors":"C. Chiang","doi":"10.1109/ITCC.2005.83","DOIUrl":"https://doi.org/10.1109/ITCC.2005.83","url":null,"abstract":"TUG (Tree Unified with Grammar) was developed to support a system to be developed through an integration of conventional software development, operational specification, rapid prototyping via software transformations, software reuse, and analysis of specifications and programs via testing and proofs. The language integrates various software development paradigms into a coherent whole to fit specific needs of developing organizations. This paper shows how to write reusable specifications in TUG. Compared to other existing specification languages, the advantages, disadvantages, limitations, and strengths of the language is discussed. The language improves the reusability of formal specifications in the following ways: (i) a developer can run a TUG specification as a prototype to study its behavior due to its executability at the front-end of the software life cycle, (ii) a developer can easily write a parametric program corresponding to its parametric specification due to the similar semantics.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116885698","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}
We propose the n-state quantum coin flipping protocol by generalizing the three states protocol. Furthermore, we conduct security analysis on our protocol and show that in our protocol we can reduce the bias of one player arbitrarily, but at the cost of increase of the bias of the other.
{"title":"n-state quantum coin flipping protocol","authors":"A. Waseda, Masakazu Soshi, A. Miyaji","doi":"10.1109/ITCC.2005.208","DOIUrl":"https://doi.org/10.1109/ITCC.2005.208","url":null,"abstract":"We propose the n-state quantum coin flipping protocol by generalizing the three states protocol. Furthermore, we conduct security analysis on our protocol and show that in our protocol we can reduce the bias of one player arbitrarily, but at the cost of increase of the bias of the other.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116978179","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}
Perfect phylogeny is one of the most popular character-based models. This model assumes the states of the characters are discrete. Although it provides a simple abstraction of characters, valuable information could be lost during the discretization of the experimental data. Indeed, fuzzy boundaries between species and degrees of character development are commonly found in nature. Therefore, we proposed the fuzzy perfect phylogeny model that extends the perfect phylogeny model to allow for a fuzzy membership of the characters. The properties of this model, such as uniqueness and backward compatibility, were then shown. We also showed how the fuzzy perfect phylogeny problem can be transformed to the perfect phylogeny problem in O(mv) time where m is the number of objects and v is the number of distinct value of characters. As a result, valuable information from the experimental data can be used without substantially increasing the problem complex.
{"title":"A new phylogenetic tree model for fuzzy characters","authors":"A. Auyeung","doi":"10.1109/ITCC.2005.22","DOIUrl":"https://doi.org/10.1109/ITCC.2005.22","url":null,"abstract":"Perfect phylogeny is one of the most popular character-based models. This model assumes the states of the characters are discrete. Although it provides a simple abstraction of characters, valuable information could be lost during the discretization of the experimental data. Indeed, fuzzy boundaries between species and degrees of character development are commonly found in nature. Therefore, we proposed the fuzzy perfect phylogeny model that extends the perfect phylogeny model to allow for a fuzzy membership of the characters. The properties of this model, such as uniqueness and backward compatibility, were then shown. We also showed how the fuzzy perfect phylogeny problem can be transformed to the perfect phylogeny problem in O(mv) time where m is the number of objects and v is the number of distinct value of characters. As a result, valuable information from the experimental data can be used without substantially increasing the problem complex.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"142 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116332782","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}
Handheld devices or personal digital assistants (PDAs) are increasingly being used for purposes other than storing personal information. A wide variety of applications are being developed to take advantage of computing power available on PDAs. Also a need is being felt in non-English speaking countries like India to develop applications in local languages. Such applications are expected to be useful in field like education, health and census etc., for data collection and dissemination. It is the purpose of this paper to show how support for local language can be built on low cost PDAs.
{"title":"Local language support for handheld devices","authors":"Yaswanth Narvaneni, M. B. Srinivas","doi":"10.1109/ITCC.2005.185","DOIUrl":"https://doi.org/10.1109/ITCC.2005.185","url":null,"abstract":"Handheld devices or personal digital assistants (PDAs) are increasingly being used for purposes other than storing personal information. A wide variety of applications are being developed to take advantage of computing power available on PDAs. Also a need is being felt in non-English speaking countries like India to develop applications in local languages. Such applications are expected to be useful in field like education, health and census etc., for data collection and dissemination. It is the purpose of this paper to show how support for local language can be built on low cost PDAs.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"190 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116388841","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}
The client puzzles have been proposed as an important mechanism in defending against distributed denial-of-service (DDoS) attacks. In this paper we propose a new IP layer client puzzles scheme, password puzzles (PP). In this scheme a puzzle issuer; on the behalf of a receiver, responds to requests with puzzles that a sender must solve before sending in any packet to a receiver. We design two new puzzle types, hash-chain-reversal puzzles and multiple-hash-chains-reversal puzzles, with which a sender is expected to reverse one (multiple) hash chain(s) and send in packets with valid passwords (i.e., solutions of puzzles) to the receiver. Our design achieves three main properties. First, the PP scheme is able to generate puzzles with different difficulties flexibly for various clients. Second, a puzzle issuer is able to generate puzzles at a per-flow and per-packet basis. Third, the PP scheme is able to converge to be a "non-puzzle " protocol.
{"title":"Mitigating denial of service attacks with password puzzles","authors":"M. Ma","doi":"10.1109/ITCC.2005.200","DOIUrl":"https://doi.org/10.1109/ITCC.2005.200","url":null,"abstract":"The client puzzles have been proposed as an important mechanism in defending against distributed denial-of-service (DDoS) attacks. In this paper we propose a new IP layer client puzzles scheme, password puzzles (PP). In this scheme a puzzle issuer; on the behalf of a receiver, responds to requests with puzzles that a sender must solve before sending in any packet to a receiver. We design two new puzzle types, hash-chain-reversal puzzles and multiple-hash-chains-reversal puzzles, with which a sender is expected to reverse one (multiple) hash chain(s) and send in packets with valid passwords (i.e., solutions of puzzles) to the receiver. Our design achieves three main properties. First, the PP scheme is able to generate puzzles with different difficulties flexibly for various clients. Second, a puzzle issuer is able to generate puzzles at a per-flow and per-packet basis. Third, the PP scheme is able to converge to be a \"non-puzzle \" protocol.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123641685","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}
Hidden Markov model has been successfully applied to bacterial gene finders and mRNA splicing modeling. Using a set of observing DNA sequences, HMM is derived for homologous search. In this paper we develop profile HMM in detecting p53, a tumor suppressor, binding sites along genes. Without assuming the constant number of nucleotides in p53 binding site, profile HMM and viterbi algorithms are designed to detect the embedded p53 binding sites from the promoter genes chosen from GenBank. The p53 regulated genes containing either single or multiple p53 binding sites distributed as clusters can be identified and classified into 7 functional groups including cell cycle regulation, DNA damage repair, signaling transduction, transcriptional factor, stress response, tumor suppressor, and oncogen.
{"title":"Mining p53 binding sites using profile hidden Markov model","authors":"Jeffrey Huang, Shijun Li","doi":"10.1109/ITCC.2005.197","DOIUrl":"https://doi.org/10.1109/ITCC.2005.197","url":null,"abstract":"Hidden Markov model has been successfully applied to bacterial gene finders and mRNA splicing modeling. Using a set of observing DNA sequences, HMM is derived for homologous search. In this paper we develop profile HMM in detecting p53, a tumor suppressor, binding sites along genes. Without assuming the constant number of nucleotides in p53 binding site, profile HMM and viterbi algorithms are designed to detect the embedded p53 binding sites from the promoter genes chosen from GenBank. The p53 regulated genes containing either single or multiple p53 binding sites distributed as clusters can be identified and classified into 7 functional groups including cell cycle regulation, DNA damage repair, signaling transduction, transcriptional factor, stress response, tumor suppressor, and oncogen.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"23 3 Suppl 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123957696","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}
G. Hadjichristofi, W. J. Adams, IV NathanielJ.Davis
Recently proposed key management systems (KMSs) provide limited functionality in highly partitioned mobile ad hoc networks. In this paper we present a framework for key management that provides redundancy and robustness for security association (SA) establishment between pairs of nodes in mobile ad hoc networks. Our KMS uses a modified hierarchical trust public key infrastructure (PKI) model in which nodes can dynamically assume management roles. The system ensures high service availability for the network members through a number of schemes. A novel behavior grading mechanism provides security criteria for the network nodes and aids the management functions of the KMS to revoke or reissue certificates for nodes. This mechanism is based on the notion of trust, and more specifically on SAs among nodes in the entire network. In this paper we give an overview of the framework of the system and present a performance analysis of the system based on certificate issuance and acquisition. Finally, we compare our KMS with threshold cryptography schemes.
{"title":"A framework for key management in mobile ad hoc networks","authors":"G. Hadjichristofi, W. J. Adams, IV NathanielJ.Davis","doi":"10.1109/ITCC.2005.10","DOIUrl":"https://doi.org/10.1109/ITCC.2005.10","url":null,"abstract":"Recently proposed key management systems (KMSs) provide limited functionality in highly partitioned mobile ad hoc networks. In this paper we present a framework for key management that provides redundancy and robustness for security association (SA) establishment between pairs of nodes in mobile ad hoc networks. Our KMS uses a modified hierarchical trust public key infrastructure (PKI) model in which nodes can dynamically assume management roles. The system ensures high service availability for the network members through a number of schemes. A novel behavior grading mechanism provides security criteria for the network nodes and aids the management functions of the KMS to revoke or reissue certificates for nodes. This mechanism is based on the notion of trust, and more specifically on SAs among nodes in the entire network. In this paper we give an overview of the framework of the system and present a performance analysis of the system based on certificate issuance and acquisition. Finally, we compare our KMS with threshold cryptography schemes.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124040979","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}
This paper introduces a new scheduling scheme that provides fair access to all stations in 802.11b WLANs. The scheme divides the transmission opportunities between wireless stations according to their operating conditions. Stations that face errors and can't communicate with the access point are given more transmission time at the moment these errors reduce to compensate for their loss of service. In 802.11b wireless stations can operate at different data rates 11, 5.5, 2 and 1 Mbps. From the literature and our simulation we found that operating at lower data rates would degrade the overall performance of the system. Still, it is impractical in developing a schedule scheme to assume that a wireless station can only operate at full data rate as similar previous work. Our scheduling scheme takes in consideration that some stations may operate at data rates lower than 11 Mbps. Simulation results show that fairness between mobile stations is almost achieved.
{"title":"A TDMA based scheduling scheme in 802.11b WLANs with access point","authors":"O. Abu-Sharkh, A. Tewfik","doi":"10.1109/ITCC.2005.44","DOIUrl":"https://doi.org/10.1109/ITCC.2005.44","url":null,"abstract":"This paper introduces a new scheduling scheme that provides fair access to all stations in 802.11b WLANs. The scheme divides the transmission opportunities between wireless stations according to their operating conditions. Stations that face errors and can't communicate with the access point are given more transmission time at the moment these errors reduce to compensate for their loss of service. In 802.11b wireless stations can operate at different data rates 11, 5.5, 2 and 1 Mbps. From the literature and our simulation we found that operating at lower data rates would degrade the overall performance of the system. Still, it is impractical in developing a schedule scheme to assume that a wireless station can only operate at full data rate as similar previous work. Our scheduling scheme takes in consideration that some stations may operate at data rates lower than 11 Mbps. Simulation results show that fairness between mobile stations is almost achieved.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124073114","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}
Distinct features of handheld devices, such as their mobility, personalization and location-awareness, engender a new class of consumer-oriented software applications. While simple shopping assistant programs were one of the first to emerge for this class of devices, many modern m-commerce applications become more complex and utilize a wide range of features of pervasive computing. In this paper, we discuss a number of design issues pertinent to the development of these applications including context-awareness, personalization, ubiquitous access, and intelligent interfaces. We applied these and other principles in the design and development of SMMART, an intelligent context-aware framework for delivery of personalized and targeted promotions to the users of mobile devices, which is used as a case study throughout this paper.
{"title":"Using principles of pervasive computing to design m-commerce applications","authors":"S. Kurkovsky","doi":"10.1109/ITCC.2005.287","DOIUrl":"https://doi.org/10.1109/ITCC.2005.287","url":null,"abstract":"Distinct features of handheld devices, such as their mobility, personalization and location-awareness, engender a new class of consumer-oriented software applications. While simple shopping assistant programs were one of the first to emerge for this class of devices, many modern m-commerce applications become more complex and utilize a wide range of features of pervasive computing. In this paper, we discuss a number of design issues pertinent to the development of these applications including context-awareness, personalization, ubiquitous access, and intelligent interfaces. We applied these and other principles in the design and development of SMMART, an intelligent context-aware framework for delivery of personalized and targeted promotions to the users of mobile devices, which is used as a case study throughout this paper.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129758075","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
扫码关注我们
求助内容：
应助结果提醒方式：