The semantic web is a vision which captures information from the web and makes it possible to help machines to understand complex human requests. Such intelligence based understanding requires important sources of information to be structured semantically so that the meaningful information can be accessed and provided to the users. The main outcome of the current idea is to derive the development of search engines to provide the users with artificial intelligence experience. The achievement of this idea requires integration of autonomous tools and standards. The technology can be realized to its task potentially by incorporating/deploying intelligent agents in semantic web.
{"title":"Evaluation of an Intelligent Approach for Semantic Web","authors":"V. Rana, Gurdev Singh","doi":"10.24297/IJCT.V7I1.3477","DOIUrl":"https://doi.org/10.24297/IJCT.V7I1.3477","url":null,"abstract":"The semantic web is a vision which captures information from the web and makes it possible to help machines to understand complex human requests. Such intelligence based understanding requires important sources of information to be structured semantically so that the meaningful information can be accessed and provided to the users. The main outcome of the current idea is to derive the development of search engines to provide the users with artificial intelligence experience. The achievement of this idea requires integration of autonomous tools and standards. The technology can be realized to its task potentially by incorporating/deploying intelligent agents in semantic web.","PeriodicalId":161820,"journal":{"name":"INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121609493","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 : 2018-06-21DOI: 10.24297/IJCT.V4I2C1.4175
K. A. Chaple
WSN is one of the dominant and emerging technology that shows great promise for various application in military, ecological and health related areas.WSN is highly vulnerable to attacks and inclusion of wireless communication technology incurs various types of security threats.WSN requires security measures due to sensitive data and as sensor may operate in hostile unattended environment.WSN suffer from constraints like low computational capability, small memory limited energy resources physical capture susceptibility and insecure wireless communication channel. These create security a challenge in WSN. In this article we provide a survey of security in WSN.We provide an outline with constraints and security requirement and attacks with their counter measures in WSN.
{"title":"TAXONOMY FOR WSN SECURITY-A SURVEY","authors":"K. A. Chaple","doi":"10.24297/IJCT.V4I2C1.4175","DOIUrl":"https://doi.org/10.24297/IJCT.V4I2C1.4175","url":null,"abstract":"WSN is one of the dominant and emerging technology that shows great promise for various application in military, ecological and health related areas.WSN is highly vulnerable to attacks and inclusion of wireless communication technology incurs various types of security threats.WSN requires security measures due to sensitive data and as sensor may operate in hostile unattended environment.WSN suffer from constraints like low computational capability, small memory limited energy resources physical capture susceptibility and insecure wireless communication channel. These create security a challenge in WSN. In this article we provide a survey of security in WSN.We provide an outline with constraints and security requirement and attacks with their counter measures in WSN.","PeriodicalId":161820,"journal":{"name":"INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114371438","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 : 2018-06-21DOI: 10.24297/ijct.v4i2c1.4178
I. Patel, R. Kulkarni, D. N. Rao
It has been read and also seen by physical encounters that there found to be seven near resembling humans by appearance .Many a times one becomes confused with respect to identification of such near resembling faces when one encounters them. The recognition of familiar faces plays a fundamental role in our social interactions. Humans are able to identify reliably a large number of faces and psychologists are interested in understanding the perceptual and cognitive mechanisms at the base of the face recognition process. As it is needed that an automated face recognition system should be faces specific, it should effectively use features that discriminate a face from others by preferably amplifying distinctive characteristics of face. Face recognition has drawn wide attention from researchers in areas of machine learning, computer vision, pattern recognition, neural networks, access control, information security, law enforcement and surveillance, smart cards etc. The paper shows that the most resembling faces can be recognized by having a unique value per face under different variations. Certain image transformations, such as intensity negation, strange viewpoint changes, and changes in lighting direction can severely disrupt human face recognition. It has been said again and again by research scholars that SVD algorithm is not good enough to classify faces under large variations but this paper proves that the SVD algorithm is most robust algorithm and can be proved effective in identifying faces under large variations as applicable to unique faces. This paper works on these aspects and tries to recognize the unique faces by applying optimized SVD algorithm.
{"title":"Robust Singular Value Decomposition Algorithm for Unique Faces","authors":"I. Patel, R. Kulkarni, D. N. Rao","doi":"10.24297/ijct.v4i2c1.4178","DOIUrl":"https://doi.org/10.24297/ijct.v4i2c1.4178","url":null,"abstract":"It has been read and also seen by physical encounters that there found to be seven near resembling humans by appearance .Many a times one becomes confused with respect to identification of such near resembling faces when one encounters them. The recognition of familiar faces plays a fundamental role in our social interactions. Humans are able to identify reliably a large number of faces and psychologists are interested in understanding the perceptual and cognitive mechanisms at the base of the face recognition process. As it is needed that an automated face recognition system should be faces specific, it should effectively use features that discriminate a face from others by preferably amplifying distinctive characteristics of face. Face recognition has drawn wide attention from researchers in areas of machine learning, computer vision, pattern recognition, neural networks, access control, information security, law enforcement and surveillance, smart cards etc. The paper shows that the most resembling faces can be recognized by having a unique value per face under different variations. Certain image transformations, such as intensity negation, strange viewpoint changes, and changes in lighting direction can severely disrupt human face recognition. It has been said again and again by research scholars that SVD algorithm is not good enough to classify faces under large variations but this paper proves that the SVD algorithm is most robust algorithm and can be proved effective in identifying faces under large variations as applicable to unique faces. This paper works on these aspects and tries to recognize the unique faces by applying optimized SVD algorithm.","PeriodicalId":161820,"journal":{"name":"INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY","volume":"211 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131895187","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 : 2018-06-21DOI: 10.24297/IJCT.V4I2C1.4180
S. Savita, A. Anjali, Gurpal Singh
In wireless communication It is important to find a reliable broadcasting protocol that is especially designed for an optimum performance of public-safety and data travelling related applications. Using RSU and OBU, there are four novel ideas presented in this research work, namely choosing the nearest following node as the network probe node, headway-based segmentation, non-uniform segmentation and application adaptive. The integration of these ideas results in a protocol that possesses minimum latency, minimum probability of collision in the acknowledgment messages and unique robustness at different speeds and traffic volumes. Wireless communications are becoming the dominant form of transferring information,and the most active research field. In this dissertation, we will present one of the most applicable forms of Ad-Hoc networks; the Vehicular Ad-Hoc Networks (VANETs). VANET is the technology of building a robust Ad-Hoc network between mobile vehicles and each other, besides, between mobile vehicles and roadside units.
{"title":"Analysis of MAC Protocol for Reliable Broadcast","authors":"S. Savita, A. Anjali, Gurpal Singh","doi":"10.24297/IJCT.V4I2C1.4180","DOIUrl":"https://doi.org/10.24297/IJCT.V4I2C1.4180","url":null,"abstract":"In wireless communication It is important to find a reliable broadcasting protocol that is especially designed for an optimum performance of public-safety and data travelling related applications. Using RSU and OBU, there are four novel ideas presented in this research work, namely choosing the nearest following node as the network probe node, headway-based segmentation, non-uniform segmentation and application adaptive. The integration of these ideas results in a protocol that possesses minimum latency, minimum probability of collision in the acknowledgment messages and unique robustness at different speeds and traffic volumes. Wireless communications are becoming the dominant form of transferring information,and the most active research field. In this dissertation, we will present one of the most applicable forms of Ad-Hoc networks; the Vehicular Ad-Hoc Networks (VANETs). VANET is the technology of building a robust Ad-Hoc network between mobile vehicles and each other, besides, between mobile vehicles and roadside units.","PeriodicalId":161820,"journal":{"name":"INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130454226","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}
Rama Mohan Babu Gatram, B. Babu, A. Srikrishna, N. V. Rao
This paper presents a novel approach for effective matching of similar shapes from skeleton and boundary features. The features identified from the shape are the junction points, end points, and maximum length from single pixel pruned skeleton of the shape. Another two features identified from the boundary are junctions and boundary length of the shape. These five features are then used for shape matching. We tested these features on Kimia shapes dataset and tools dataset. The matching process from these features has produced good results, showing the probable of the developed method in a variety of computer vision and pattern recognition domains. The results demonstrate these features are rotational and transform invariant.
{"title":"Shape Matching and Recognition using Hybrid Features from Skeleton and Boundary","authors":"Rama Mohan Babu Gatram, B. Babu, A. Srikrishna, N. V. Rao","doi":"10.24297/IJCT.V7I2.3457","DOIUrl":"https://doi.org/10.24297/IJCT.V7I2.3457","url":null,"abstract":"This paper presents a novel approach for effective matching of similar shapes from skeleton and boundary features. The features identified from the shape are the junction points, end points, and maximum length from single pixel pruned skeleton of the shape. Another two features identified from the boundary are junctions and boundary length of the shape. These five features are then used for shape matching. We tested these features on Kimia shapes dataset and tools dataset. The matching process from these features has produced good results, showing the probable of the developed method in a variety of computer vision and pattern recognition domains. The results demonstrate these features are rotational and transform invariant.","PeriodicalId":161820,"journal":{"name":"INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122656055","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 : 2018-06-21DOI: 10.24297/IJCT.V4I2C1.4176
C. Ghosh, A. Roy, S. K. Parui
An asymmetric DGS consisting of two square headed slots connected transversely with a rectangular slot is etched in the ground plane underneath a high-low impedance microstrip line. It provides a band-reject filtering characteristics with sharp transition. Thus, it may be modeled as m-derived filter section. Accordingly, T-type LC equivalent circuit is proposed and LC parameters are extracted. A planar composite lowpass filter is designed by image parameter method and implemented by different DGS units. A composite filter requires at least three filter sections, of which two m-derived sections and one constant k-section. In proposed scheme, one such m-derived section is directly replaced by proposed DGS unit, whose cut-off frequency is same as that of designed m-derived section. The other m-derived section implemented by proposed DGS unit divided into equivalent two L-sections which will act as a termination for impedance matching. A constant k-section has been realized by a dumbbell shaped DGS having same cutoff frequency. Here lumped LC parameters are directly replaced by the equivalent LC values of the DGSs and therefore, produce almost ideal filter characteristics by overcoming the limitations of microstrip technology.
{"title":"Composite Lowpass Filter Realized by Image Parameter method and Integrated with Defected Ground Structures","authors":"C. Ghosh, A. Roy, S. K. Parui","doi":"10.24297/IJCT.V4I2C1.4176","DOIUrl":"https://doi.org/10.24297/IJCT.V4I2C1.4176","url":null,"abstract":"An asymmetric DGS consisting of two square headed slots connected transversely with a rectangular slot is etched in the ground plane underneath a high-low impedance microstrip line. It provides a band-reject filtering characteristics with sharp transition. Thus, it may be modeled as m-derived filter section. Accordingly, T-type LC equivalent circuit is proposed and LC parameters are extracted. A planar composite lowpass filter is designed by image parameter method and implemented by different DGS units. A composite filter requires at least three filter sections, of which two m-derived sections and one constant k-section. In proposed scheme, one such m-derived section is directly replaced by proposed DGS unit, whose cut-off frequency is same as that of designed m-derived section. The other m-derived section implemented by proposed DGS unit divided into equivalent two L-sections which will act as a termination for impedance matching. A constant k-section has been realized by a dumbbell shaped DGS having same cutoff frequency. Here lumped LC parameters are directly replaced by the equivalent LC values of the DGSs and therefore, produce almost ideal filter characteristics by overcoming the limitations of microstrip technology.","PeriodicalId":161820,"journal":{"name":"INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124449427","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 : 2012-04-30DOI: 10.24297/IJCT.V2I2A.6783
Manju Pandey, N. Khare
In recent work authors have proposed four new aggregation operators for triangular and trapezoidal fuzzy numbers based on means of apex angles [1][2][3][4]. Subsequently authors have proposed [5] a new aggregation operator for TFNs based on the arithmetic mean of slopes of the L- and R- membership lines. In this paper the work is extended and a new aggregation operator for TFNs is proposed in which the L- and R- membership function lines of the aggregate TFN have slopes which are the geometric means of the corresponding L- and R- slopes of the individual TFNs. Computation of the aggregate is demonstrated with a numerical example. Corresponding arithmetic and geometric aggregates as well as results from the recent work of the authors on TFN aggregates have also been computed.
{"title":"New Aggregation Operator for Triangular Fuzzy Numbers based on the Geometric Means of the Slopes of the L- and R- Membership Functions","authors":"Manju Pandey, N. Khare","doi":"10.24297/IJCT.V2I2A.6783","DOIUrl":"https://doi.org/10.24297/IJCT.V2I2A.6783","url":null,"abstract":"In recent work authors have proposed four new aggregation operators for triangular and trapezoidal fuzzy numbers based on means of apex angles [1][2][3][4]. Subsequently authors have proposed [5] a new aggregation operator for TFNs based on the arithmetic mean of slopes of the L- and R- membership lines. In this paper the work is extended and a new aggregation operator for TFNs is proposed in which the L- and R- membership function lines of the aggregate TFN have slopes which are the geometric means of the corresponding L- and R- slopes of the individual TFNs. Computation of the aggregate is demonstrated with a numerical example. Corresponding arithmetic and geometric aggregates as well as results from the recent work of the authors on TFN aggregates have also been computed.","PeriodicalId":161820,"journal":{"name":"INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132398192","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
扫码关注我们
求助内容：
应助结果提醒方式：