Pub Date : 2014-05-22DOI: 10.1109/AQTR.2014.6857853
I. Árpád
During the testing and analysis for robustness of pixel sieve and bit sieve cryptographic methods few weaknesses emerged. Some of them are related to the cryptographic key itself. Not any kind of key is secure to use for encryption. Some serious restrictions regarding the keys are reducing the number of usable keys in a given keys-pace. On one issue for a key length of n only n/3 keys are safe to use and those keys ar also subject for restrictions. Within this paper thees weaknesses will be shown among with some proposed solutions. The solutions found are using techniques like: key expansion, XORing, circular permutation and key shifting. With the solutions presented here some of the key related issues are solved increasing the robustness and security of the method.
{"title":"Cryptographic key issues and solutions for the bit sieve/pixel-sieve method","authors":"I. Árpád","doi":"10.1109/AQTR.2014.6857853","DOIUrl":"https://doi.org/10.1109/AQTR.2014.6857853","url":null,"abstract":"During the testing and analysis for robustness of pixel sieve and bit sieve cryptographic methods few weaknesses emerged. Some of them are related to the cryptographic key itself. Not any kind of key is secure to use for encryption. Some serious restrictions regarding the keys are reducing the number of usable keys in a given keys-pace. On one issue for a key length of n only n/3 keys are safe to use and those keys ar also subject for restrictions. Within this paper thees weaknesses will be shown among with some proposed solutions. The solutions found are using techniques like: key expansion, XORing, circular permutation and key shifting. With the solutions presented here some of the key related issues are solved increasing the robustness and security of the method.","PeriodicalId":297141,"journal":{"name":"2014 IEEE International Conference on Automation, Quality and Testing, Robotics","volume":"1993 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131355564","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 : 2014-05-22DOI: 10.1109/AQTR.2014.6857838
M. Muntean, L. Cabulea, H. Valean
Clustering of text data is a widely studied data mining problem and has a number of applications such as spam detection, document organization and indexing, IP-address streams, credit-card transaction streams, and so on. However, the clustering of text data is still in early stage, because the research focused so far on the case of quantitative or categorical data. In this paper we propose a new method for improving the clustering accuracy of text data. Our method encodes the string values of a dataset using Huffman encoding algorithm, and declares these attributes as integer in the cluster evaluation phase. In the experimental part, we compared the cluster label assigned by the proposed method to each instance of the dataset with its real category, and we obtained a better clustering accuracy than the one found with traditional methods. This method is useful when the dataset to be clustered has only string attributes, because in this case, a traditional clustering method does not recognize, or recognize with a low accuracy, the category of instances.
{"title":"A new text clustering method based on Huffman encoding algorithm","authors":"M. Muntean, L. Cabulea, H. Valean","doi":"10.1109/AQTR.2014.6857838","DOIUrl":"https://doi.org/10.1109/AQTR.2014.6857838","url":null,"abstract":"Clustering of text data is a widely studied data mining problem and has a number of applications such as spam detection, document organization and indexing, IP-address streams, credit-card transaction streams, and so on. However, the clustering of text data is still in early stage, because the research focused so far on the case of quantitative or categorical data. In this paper we propose a new method for improving the clustering accuracy of text data. Our method encodes the string values of a dataset using Huffman encoding algorithm, and declares these attributes as integer in the cluster evaluation phase. In the experimental part, we compared the cluster label assigned by the proposed method to each instance of the dataset with its real category, and we obtained a better clustering accuracy than the one found with traditional methods. This method is useful when the dataset to be clustered has only string attributes, because in this case, a traditional clustering method does not recognize, or recognize with a low accuracy, the category of instances.","PeriodicalId":297141,"journal":{"name":"2014 IEEE International Conference on Automation, Quality and Testing, Robotics","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116606315","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 : 2014-05-22DOI: 10.1109/AQTR.2014.6857861
I. Stefan, Ioan Ivan, L. Miclea
The paper proposes a method to use contextual data from the web applications DOM (Document Object Model) to aid test cases generation for functional testing. The objective is to enhance the automation by reducing the time allocated to obtain the input values and the rough steps of the test cases. The DOM architecture for Web applications will be considered the starting point in the development of the method. The discussion remains if the tester inspection is needed in order to choose between the diversity of test cases automatically generated or the tests will be entirely executed without exception. The required system resources will be taken in consideration to repeatedly run all the tests in regression testing. In the case of applying this method to several user interfaces, by saving the extracted properties and the generated test cases and results, statistical data regarding effective templates to use would emerge.
{"title":"Assisted test case design using contextual information by DOM exploration","authors":"I. Stefan, Ioan Ivan, L. Miclea","doi":"10.1109/AQTR.2014.6857861","DOIUrl":"https://doi.org/10.1109/AQTR.2014.6857861","url":null,"abstract":"The paper proposes a method to use contextual data from the web applications DOM (Document Object Model) to aid test cases generation for functional testing. The objective is to enhance the automation by reducing the time allocated to obtain the input values and the rough steps of the test cases. The DOM architecture for Web applications will be considered the starting point in the development of the method. The discussion remains if the tester inspection is needed in order to choose between the diversity of test cases automatically generated or the tests will be entirely executed without exception. The required system resources will be taken in consideration to repeatedly run all the tests in regression testing. In the case of applying this method to several user interfaces, by saving the extracted properties and the generated test cases and results, statistical data regarding effective templates to use would emerge.","PeriodicalId":297141,"journal":{"name":"2014 IEEE International Conference on Automation, Quality and Testing, Robotics","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127203824","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 : 2014-05-22DOI: 10.1109/AQTR.2014.6857930
A. Cioloca, R. Both, R. Festila
Cryogenic air separation plants are widely used in industry but are energy consuming processes. The operating costs justify the need for an efficient control of the distillation process. Dynamic models of separation columns are complex and of high order making their use in control design practically impossible. This paper focuses on nonlinear wave models which are commonly used to provide a reduced order description of distillation column dynamic, highlighting the wide range of applicability.
{"title":"Advanced models for cryogenic distillation columns","authors":"A. Cioloca, R. Both, R. Festila","doi":"10.1109/AQTR.2014.6857930","DOIUrl":"https://doi.org/10.1109/AQTR.2014.6857930","url":null,"abstract":"Cryogenic air separation plants are widely used in industry but are energy consuming processes. The operating costs justify the need for an efficient control of the distillation process. Dynamic models of separation columns are complex and of high order making their use in control design practically impossible. This paper focuses on nonlinear wave models which are commonly used to provide a reduced order description of distillation column dynamic, highlighting the wide range of applicability.","PeriodicalId":297141,"journal":{"name":"2014 IEEE International Conference on Automation, Quality and Testing, Robotics","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129562784","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 : 2014-05-22DOI: 10.1109/AQTR.2014.6857900
C. Pascal, D. Panescu
This paper introduces a Colored Petri net model for a distributed constraint satisfaction algorithm to be applied in holonic schemes. The developed model allows analyzing various scenarios, highlighting the qualities of the mechanism that facilitates agents' planning phase within a manufacturing holonic architecture.
{"title":"A Petri net model for constraint satisfaction application in holonic systems","authors":"C. Pascal, D. Panescu","doi":"10.1109/AQTR.2014.6857900","DOIUrl":"https://doi.org/10.1109/AQTR.2014.6857900","url":null,"abstract":"This paper introduces a Colored Petri net model for a distributed constraint satisfaction algorithm to be applied in holonic schemes. The developed model allows analyzing various scenarios, highlighting the qualities of the mechanism that facilitates agents' planning phase within a manufacturing holonic architecture.","PeriodicalId":297141,"journal":{"name":"2014 IEEE International Conference on Automation, Quality and Testing, Robotics","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115018024","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
扫码关注我们
求助内容：
应助结果提醒方式：