Marcus J. Huber, Sanjeev Kumar, Sean A. Lisse, David R. McGee
Many agents are fielded within environments requiring modeling traditional organizational structures such as military hierarchies and corporations, with their associated authority relationships and a strong form of responsibility associated with subordinate agents. Addressing the needs above, we have developed an integrated semantic framework for modeling and operationalizing authority relationships and deontic operators based upon joint intention theory. This allows us to not only regularize the representation and reasoning components of agents with respect to the two aspects of agency but to also realize: improved coordination due to enhanced agent teamwork through the persistence and robustness they exhibit toward successful achievement of goals even in the face of problems; improved conformance of the behavior of each agent according to its organizational role and authority related to other organizational positions; and improved bounding of the behavior of agents when faced with the imposition of deontic operators from various sources
{"title":"Authority, Deontics and Joint Intentions","authors":"Marcus J. Huber, Sanjeev Kumar, Sean A. Lisse, David R. McGee","doi":"10.1109/ITNG.2007.43","DOIUrl":"https://doi.org/10.1109/ITNG.2007.43","url":null,"abstract":"Many agents are fielded within environments requiring modeling traditional organizational structures such as military hierarchies and corporations, with their associated authority relationships and a strong form of responsibility associated with subordinate agents. Addressing the needs above, we have developed an integrated semantic framework for modeling and operationalizing authority relationships and deontic operators based upon joint intention theory. This allows us to not only regularize the representation and reasoning components of agents with respect to the two aspects of agency but to also realize: improved coordination due to enhanced agent teamwork through the persistence and robustness they exhibit toward successful achievement of goals even in the face of problems; improved conformance of the behavior of each agent according to its organizational role and authority related to other organizational positions; and improved bounding of the behavior of agents when faced with the imposition of deontic operators from various sources","PeriodicalId":198970,"journal":{"name":"Fourth International Conference on Information Technology (ITNG'07)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115141331","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 mobile-Internet specific methodology to capture the user behavior characteristics is still on the hot research agenda. Based on an ad hoc assumption that the user loyalty relates to Web visit regularity, the author explores regularity measures to track user behaviors. The author performed a 3-month transition pattern using regular users that visits a Web every month for three months. The author discusses the stability of the measures in the long-term behaviors
{"title":"Classification of Mobile Internet User Behaviors using Qualitative Transition Patterns","authors":"T. Yamakami","doi":"10.1109/ITNG.2007.47","DOIUrl":"https://doi.org/10.1109/ITNG.2007.47","url":null,"abstract":"The mobile-Internet specific methodology to capture the user behavior characteristics is still on the hot research agenda. Based on an ad hoc assumption that the user loyalty relates to Web visit regularity, the author explores regularity measures to track user behaviors. The author performed a 3-month transition pattern using regular users that visits a Web every month for three months. The author discusses the stability of the measures in the long-term behaviors","PeriodicalId":198970,"journal":{"name":"Fourth International Conference on Information Technology (ITNG'07)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115699662","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}
Farhad Mohamad Kazemi, Saeed Samadi, H. Pourreza, M. Akbarzadeh-Totonchi
This paper proposes the performance of a new algorithm for vehicles recognition system. This recognition system is based on extracted features on the performance of image's curvelet transform and achieving standard deviation of curvelet coefficients matrix in different scales and various orientations. The curvelet transform is a multiscale transform with frame elements indexed by location, scale and orientation parameters, and have time-frequency localization properties of wavelets but also shows a very high degree of directionality and anisotropy. This paper presents the application of three different types of classifiers to the vehicle recognition. They include of support vector machine (one versus one), k nearest-neighbor and support vector machine (one versus all). In addition, the proposed recognition system is obtained by using different scales information as feature vector. So, we could clarify the most important scales in aspect of having useful information. The performed numerical experiments for vehicles recognition have shown the superiority of curvelet and standard deviation preprocessing, which are associated with the support vector machine structure (one versus one). The results of this test show, the right recognition rate of vehicle's model in this recognition system, at the time of using total scales information numbers 3&4 curvelet coefficients matrix is about 99%. We've gathered a data set that includes of 300 images from 5 different classes of vehicles. These 5 classes of vehicles include of: PEUGEOT 206, PEUGEOT 405, Pride, RENAULT55 and Peykan. We've examined 230 pictures as our train data set and 70 pictures as our test data set
{"title":"Vehicle Recognition Using Curvelet Transform and SVM","authors":"Farhad Mohamad Kazemi, Saeed Samadi, H. Pourreza, M. Akbarzadeh-Totonchi","doi":"10.1109/ITNG.2007.205","DOIUrl":"https://doi.org/10.1109/ITNG.2007.205","url":null,"abstract":"This paper proposes the performance of a new algorithm for vehicles recognition system. This recognition system is based on extracted features on the performance of image's curvelet transform and achieving standard deviation of curvelet coefficients matrix in different scales and various orientations. The curvelet transform is a multiscale transform with frame elements indexed by location, scale and orientation parameters, and have time-frequency localization properties of wavelets but also shows a very high degree of directionality and anisotropy. This paper presents the application of three different types of classifiers to the vehicle recognition. They include of support vector machine (one versus one), k nearest-neighbor and support vector machine (one versus all). In addition, the proposed recognition system is obtained by using different scales information as feature vector. So, we could clarify the most important scales in aspect of having useful information. The performed numerical experiments for vehicles recognition have shown the superiority of curvelet and standard deviation preprocessing, which are associated with the support vector machine structure (one versus one). The results of this test show, the right recognition rate of vehicle's model in this recognition system, at the time of using total scales information numbers 3&4 curvelet coefficients matrix is about 99%. We've gathered a data set that includes of 300 images from 5 different classes of vehicles. These 5 classes of vehicles include of: PEUGEOT 206, PEUGEOT 405, Pride, RENAULT55 and Peykan. We've examined 230 pictures as our train data set and 70 pictures as our test data set","PeriodicalId":198970,"journal":{"name":"Fourth International Conference on Information Technology (ITNG'07)","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114644895","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 Super Iterator pattern, like the standard Iterator pattern, traverses an unknown data structure without exposing that structure. With the standard Iterator pattern, clients must create a different iterator for each new structure, and the object returned must be of the specific type stored in the structure, even when they share a common super class. With the Super Iterator pattern, the object returned is of the common super class, and the iterator itself need not be altered when adding a new subtype with custom data structures. The client, however, must change two lines of code to load and instantiate the new subclass
{"title":"Super Iterator A design pattern for Algorithm and Data structure collections","authors":"Andre Oboler, Charles R. Twardy, D. Albrecht","doi":"10.1109/ITNG.2007.188","DOIUrl":"https://doi.org/10.1109/ITNG.2007.188","url":null,"abstract":"The Super Iterator pattern, like the standard Iterator pattern, traverses an unknown data structure without exposing that structure. With the standard Iterator pattern, clients must create a different iterator for each new structure, and the object returned must be of the specific type stored in the structure, even when they share a common super class. With the Super Iterator pattern, the object returned is of the common super class, and the iterator itself need not be altered when adding a new subtype with custom data structures. The client, however, must change two lines of code to load and instantiate the new subclass","PeriodicalId":198970,"journal":{"name":"Fourth International Conference on Information Technology (ITNG'07)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117183428","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}
Upon development of m-commerce as one of the new branches of e-commerce, m-banking has emerged as one of the main divisions of m-commerce. As the m-banking was received very well, it has embarked upon supply of various services based on different systems and with the aid of various services such as the short messaging service (SMS). However, in spite of its advantages, m-banking is facing some challenges as well. One of these challenges is the issue of security of this system. This paper presents a method for increasing security of the information requested by users with the use of steganography method. In this method, instead of direct sending of the information, it is hidden in a picture by the password and is put on a site. Then the address of the picture is sent to the user. After receiving the address of the picture through SMS, the user downloads the picture by a special program. After entering the password, the user can witness the information extracted from the picture if the password is entered correctly. This project is written in J2ME language (Java 2 Micro Edition) and has been implemented on Nokia mobile phones, models N71 and 6680
{"title":"Improving Mobile Banking Security Using Steganography","authors":"M. Shirali-Shahreza","doi":"10.1109/ITNG.2007.108","DOIUrl":"https://doi.org/10.1109/ITNG.2007.108","url":null,"abstract":"Upon development of m-commerce as one of the new branches of e-commerce, m-banking has emerged as one of the main divisions of m-commerce. As the m-banking was received very well, it has embarked upon supply of various services based on different systems and with the aid of various services such as the short messaging service (SMS). However, in spite of its advantages, m-banking is facing some challenges as well. One of these challenges is the issue of security of this system. This paper presents a method for increasing security of the information requested by users with the use of steganography method. In this method, instead of direct sending of the information, it is hidden in a picture by the password and is put on a site. Then the address of the picture is sent to the user. After receiving the address of the picture through SMS, the user downloads the picture by a special program. After entering the password, the user can witness the information extracted from the picture if the password is entered correctly. This project is written in J2ME language (Java 2 Micro Edition) and has been implemented on Nokia mobile phones, models N71 and 6680","PeriodicalId":198970,"journal":{"name":"Fourth International Conference on Information Technology (ITNG'07)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127134175","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}
Xinming Duan, Yulu Yang, Mei Yang, Lei Li, Yingtao Jiang
In this paper, we present a novel network topology to build an on chip interconnection network. This so called PRDT(2, 1) structure offers a few distinct architectural features, including (i) high scalability, (ii) small diameter and average distance, (iii) reconfigurability with its embedded mesh/torus topology, and (iv) high degree of fault tolerance. Routing in a PRDT(2, 1)-based network can be performed using an efficient and deadlock-free binary routing scheme without using virtual channels. As an extension to this binary routing scheme, we further propose a fully adaptive routing algorithm which is also deadlock-free by using a few virtual channels. Comparisons between the proposed routing algorithms and a vector routing algorithm have been conducted though computer simulations, and the results show that the proposed routing algorithms can achieve better performance than the vector routing algorithm but require significantly less buffers
{"title":"Topology and Binary Routing Schemes of A PRDT-Based NoC","authors":"Xinming Duan, Yulu Yang, Mei Yang, Lei Li, Yingtao Jiang","doi":"10.1109/ITNG.2007.195","DOIUrl":"https://doi.org/10.1109/ITNG.2007.195","url":null,"abstract":"In this paper, we present a novel network topology to build an on chip interconnection network. This so called PRDT(2, 1) structure offers a few distinct architectural features, including (i) high scalability, (ii) small diameter and average distance, (iii) reconfigurability with its embedded mesh/torus topology, and (iv) high degree of fault tolerance. Routing in a PRDT(2, 1)-based network can be performed using an efficient and deadlock-free binary routing scheme without using virtual channels. As an extension to this binary routing scheme, we further propose a fully adaptive routing algorithm which is also deadlock-free by using a few virtual channels. Comparisons between the proposed routing algorithms and a vector routing algorithm have been conducted though computer simulations, and the results show that the proposed routing algorithms can achieve better performance than the vector routing algorithm but require significantly less buffers","PeriodicalId":198970,"journal":{"name":"Fourth International Conference on Information Technology (ITNG'07)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127214620","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}
In this paper, exponentially aggressive preservation of nearly depleted nodes is employed to discourage a node with considerably low residual energy from being selected as a routing node in wireless sensor networks (WSNs). Simulation model shows that geographical and energy aware routing (GEAR) with dynamically adaptive transmission power (DATP) and exponentially aggressive preservation of nearly depleted nodes can send over 65% more packets than the GEAR for both uniform and non-uniform traffic regardless of network size. The exponentially aggressive preservation of nearly depleted node can be applied to various existing energy aware routing protocols to potentially extend the life-spans of WSNs
{"title":"Exponentially Aggressive Preservation of Nearly Depleted Nodes for Wireless Sensor Networks","authors":"S. Ito, K. Yoshigoe","doi":"10.1109/ITNG.2007.92","DOIUrl":"https://doi.org/10.1109/ITNG.2007.92","url":null,"abstract":"In this paper, exponentially aggressive preservation of nearly depleted nodes is employed to discourage a node with considerably low residual energy from being selected as a routing node in wireless sensor networks (WSNs). Simulation model shows that geographical and energy aware routing (GEAR) with dynamically adaptive transmission power (DATP) and exponentially aggressive preservation of nearly depleted nodes can send over 65% more packets than the GEAR for both uniform and non-uniform traffic regardless of network size. The exponentially aggressive preservation of nearly depleted node can be applied to various existing energy aware routing protocols to potentially extend the life-spans of WSNs","PeriodicalId":198970,"journal":{"name":"Fourth International Conference on Information Technology (ITNG'07)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115093327","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}
A graph has a dominator coloring if it has a proper coloring in which each vertex of the graph dominates every vertex of some color class. The dominator chromatic number Xd(G) is the minimum number of color classes in a dominator coloring of a graph G. In this paper we study the dominator chromatic number for the hypercube, Qn = Qn- times K2 (with Q1 cong P2, n ges 2), and more generally for bipartite graphs. We then conclude it with open questions for further research
{"title":"On the Dominator Colorings in Bipartite Graphs","authors":"Ralucca Gera","doi":"10.1109/ITNG.2007.142","DOIUrl":"https://doi.org/10.1109/ITNG.2007.142","url":null,"abstract":"A graph has a dominator coloring if it has a proper coloring in which each vertex of the graph dominates every vertex of some color class. The dominator chromatic number <sub>Xd</sub>(G) is the minimum number of color classes in a dominator coloring of a graph G. In this paper we study the dominator chromatic number for the hypercube, Q<sub>n </sub> = Q<sub>n-</sub> times K<sub>2</sub> (with Q<sub>1</sub> cong P<sub>2</sub>, n ges 2), and more generally for bipartite graphs. We then conclude it with open questions for further research","PeriodicalId":198970,"journal":{"name":"Fourth International Conference on Information Technology (ITNG'07)","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122953138","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}
In this paper time-based random waypoint (TBRWP) model is analyzed in detail. Random waypoint model has been studied in mobility literature extensively. Traditional RWP model is based on the independency of the velocity and trajectory; TBR WP, instead, focuses on the independency of motion time and trajectory. Basic model is introduced and general method to evaluate the asymptotical probability density function (PDF) is presented. The model for the one-dimensional and two-dimensional cases with uniform destination distribution in unit square area is solved and exact closed form formulas is obtained. Moreover, normal distribution of nodes in one- and twodimensional models is investigated and practical approximations are derived for them. To verify the obtained results an extensive simulation is performed and tight results are obtained
{"title":"Analysis of Time-Based Random Waypoint Mobility Model for Wireless Mobile Networks","authors":"A. Nayebi, M. Rahimi, H. Sarbazi-Azad","doi":"10.1109/ITNG.2007.38","DOIUrl":"https://doi.org/10.1109/ITNG.2007.38","url":null,"abstract":"In this paper time-based random waypoint (TBRWP) model is analyzed in detail. Random waypoint model has been studied in mobility literature extensively. Traditional RWP model is based on the independency of the velocity and trajectory; TBR WP, instead, focuses on the independency of motion time and trajectory. Basic model is introduced and general method to evaluate the asymptotical probability density function (PDF) is presented. The model for the one-dimensional and two-dimensional cases with uniform destination distribution in unit square area is solved and exact closed form formulas is obtained. Moreover, normal distribution of nodes in one- and twodimensional models is investigated and practical approximations are derived for them. To verify the obtained results an extensive simulation is performed and tight results are obtained","PeriodicalId":198970,"journal":{"name":"Fourth International Conference on Information Technology (ITNG'07)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114177825","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}
MD5 and SHA-1 are the most common hash functions used in most security protocols and implementations. However, recent discoveries show that these hash functions are not secure as they should be, which necessitate the need for deploying a new hash function. This implies a number of changes for all major cryptographic protocols. This paper analyzes OpenPGP and SSL/TLS protocols showing all the necessary changes to make the transition to a new hash function
{"title":"Incorporating a New Hash Function in OpenPGP and SSL/TLS","authors":"C. N. Michael, Xiao Su","doi":"10.1109/ITNG.2007.109","DOIUrl":"https://doi.org/10.1109/ITNG.2007.109","url":null,"abstract":"MD5 and SHA-1 are the most common hash functions used in most security protocols and implementations. However, recent discoveries show that these hash functions are not secure as they should be, which necessitate the need for deploying a new hash function. This implies a number of changes for all major cryptographic protocols. This paper analyzes OpenPGP and SSL/TLS protocols showing all the necessary changes to make the transition to a new hash function","PeriodicalId":198970,"journal":{"name":"Fourth International Conference on Information Technology (ITNG'07)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129749618","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
扫码关注我们
求助内容：
应助结果提醒方式：