We present the convergent splitting and convergent multi splitting for linear system of algebraic equations Ax=b when the coefficient matrix is a non-hermitian positive definite matrix. Furthermore, we also establish the comparison theorems of different splitting or multisplittings by numerical radius. Finally, we give an application to solve the complex linear system.
{"title":"The Convergences of Multisplitting Parallel Methods for Non-Hermitian Positive Definite Systems","authors":"Chuan-Long Wang, Yan-Ping Wang","doi":"10.1109/NSS.2010.29","DOIUrl":"https://doi.org/10.1109/NSS.2010.29","url":null,"abstract":"We present the convergent splitting and convergent multi splitting for linear system of algebraic equations Ax=b when the coefficient matrix is a non-hermitian positive definite matrix. Furthermore, we also establish the comparison theorems of different splitting or multisplittings by numerical radius. Finally, we give an application to solve the complex linear system.","PeriodicalId":127173,"journal":{"name":"2010 Fourth International Conference on Network and System Security","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133346631","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}
There are many global optimization problems arisen in various fields of applications. It is very important to design effective algorithms for these problems. However, one of the key drawbacks of the existing global optimization methods is that they are not easy to escape from the local optimal solutions and can not find the global optimal solution quickly. In order to escape from the local optimal solutions and find the global optimal solution fast, first, a smoothing function, which can flatten the landscape of the original function and eliminate all local optimal solutions which are no better than the best one found so far, is proposed. This can make the search of the global optimal solution much easier. Second, to cooperate the smoothing function, a tailor-made search scheme called circle search is presented, which can quickly jump out the flattened landscape and fall in a lower landscape quickly. Third, a better solution than the best one found so far can be found by local search. Fourth, a crossover operator is designed based on uniform design. Based on these, a smoothing evolutionary algorithm for global optimization is proposed. At last, the numerical simulations for eight high dimensional and very challenging standard benchmark problems are made. The performance of the proposed algorithm is compared with that of nine evolutionary algorithms published recently. The results indicate that the proposed algorithm is statistically sound and has better performance for these test functions.
{"title":"A Smoothing Evolutionary Algorithm with Circle Search for Global Optimization","authors":"Yuping Wang, Lei Fan","doi":"10.1109/NSS.2010.92","DOIUrl":"https://doi.org/10.1109/NSS.2010.92","url":null,"abstract":"There are many global optimization problems arisen in various fields of applications. It is very important to design effective algorithms for these problems. However, one of the key drawbacks of the existing global optimization methods is that they are not easy to escape from the local optimal solutions and can not find the global optimal solution quickly. In order to escape from the local optimal solutions and find the global optimal solution fast, first, a smoothing function, which can flatten the landscape of the original function and eliminate all local optimal solutions which are no better than the best one found so far, is proposed. This can make the search of the global optimal solution much easier. Second, to cooperate the smoothing function, a tailor-made search scheme called circle search is presented, which can quickly jump out the flattened landscape and fall in a lower landscape quickly. Third, a better solution than the best one found so far can be found by local search. Fourth, a crossover operator is designed based on uniform design. Based on these, a smoothing evolutionary algorithm for global optimization is proposed. At last, the numerical simulations for eight high dimensional and very challenging standard benchmark problems are made. The performance of the proposed algorithm is compared with that of nine evolutionary algorithms published recently. The results indicate that the proposed algorithm is statistically sound and has better performance for these test functions.","PeriodicalId":127173,"journal":{"name":"2010 Fourth International Conference on Network and System Security","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121723087","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}
F. C. Dias, R. Azevedo, C. Rodrigues, E. Galvão, Guilherme Ataíde Dias, Roberto Souto Maior de Barros
Mental illness has always been target of debate and criticism by the society (modern or ancient). Several problems and challenges regarding Psychiatry, Telepsychiatry specifically are found in literature. The lack of information and the fear of the unknown have long been seen as a barrier for people with mental illness as well as all those involved in the process, such as family and the medical team. In the past, the lack of knowledge led the society to adopt harsh punishment for the patients, under the pretext that the same were possessed by some supernatural force. In this context, the lack of a public, formal and standardized model regarding any sort of information about this field was and remains as the central problem. Therefore, this paper proposes the OntoPsic, a domain-ontology for psychiatry applied to Healthcare Information System to define a common vocabulary about mental illness and Telepsychiatry. Besides relying on this base of knowledge to assist all involved in the treatment of mental disorders, this article also describes the OntoConsult, a system for the deduction of facts to support the decision making. In order to motivate the use of OntoPsic, the article reviews some applications and some practical results with the ontology.
{"title":"OntoPsic: Leveraging the Knowledge in the Treatment and Diagnosis of Telepsychiatry","authors":"F. C. Dias, R. Azevedo, C. Rodrigues, E. Galvão, Guilherme Ataíde Dias, Roberto Souto Maior de Barros","doi":"10.1109/NSS.2010.33","DOIUrl":"https://doi.org/10.1109/NSS.2010.33","url":null,"abstract":"Mental illness has always been target of debate and criticism by the society (modern or ancient). Several problems and challenges regarding Psychiatry, Telepsychiatry specifically are found in literature. The lack of information and the fear of the unknown have long been seen as a barrier for people with mental illness as well as all those involved in the process, such as family and the medical team. In the past, the lack of knowledge led the society to adopt harsh punishment for the patients, under the pretext that the same were possessed by some supernatural force. In this context, the lack of a public, formal and standardized model regarding any sort of information about this field was and remains as the central problem. Therefore, this paper proposes the OntoPsic, a domain-ontology for psychiatry applied to Healthcare Information System to define a common vocabulary about mental illness and Telepsychiatry. Besides relying on this base of knowledge to assist all involved in the treatment of mental disorders, this article also describes the OntoConsult, a system for the deduction of facts to support the decision making. In order to motivate the use of OntoPsic, the article reviews some applications and some practical results with the ontology.","PeriodicalId":127173,"journal":{"name":"2010 Fourth International Conference on Network and System Security","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121536186","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}
Aashis Sharma, Z. Kalbarczyk, R. Iyer, James Barlow
This paper analyses the forensic data on credential stealing incidents over a period of 5 years across 5000 machines monitored at the National Center for Supercomputing Applications at the University of Illinois. The analysis conducted is the first attempt in an open operational environment (i) to evaluate the intricacies of carrying out SSH-based credential stealing attacks, (ii) to highlight and quantify key characteristics of such attacks, and (iii) to provide the system level characterization of such incidents in terms of distribution of alerts and incident consequences
{"title":"Analysis of Credential Stealing Attacks in an Open Networked Environment","authors":"Aashis Sharma, Z. Kalbarczyk, R. Iyer, James Barlow","doi":"10.1109/NSS.2010.56","DOIUrl":"https://doi.org/10.1109/NSS.2010.56","url":null,"abstract":"This paper analyses the forensic data on credential stealing incidents over a period of 5 years across 5000 machines monitored at the National Center for Supercomputing Applications at the University of Illinois. The analysis conducted is the first attempt in an open operational environment (i) to evaluate the intricacies of carrying out SSH-based credential stealing attacks, (ii) to highlight and quantify key characteristics of such attacks, and (iii) to provide the system level characterization of such incidents in terms of distribution of alerts and incident consequences","PeriodicalId":127173,"journal":{"name":"2010 Fourth International Conference on Network and System Security","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117111795","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}
Wavelet Analysis method is considered as one of the most efficient methods for detecting DDoS attacks. However, during the peak data communication hours with a large amount of data transactions, this method is required to collect too many samples that will greatly increase the computational complexity. Therefore, the real-time response time as well as the accuracy of attack detection becomes very low. To address the above problem, we propose a new DDoS detection method called Modified Wavelet Analysis method which is based on the existing Isomap algorithm and wavelet analysis. In the paper, we present our new model and algorithm for detecting DDoS attacks and demonstrate the reasons of why we enlarge the Hurst’s value of the self-similarity in our new approach. Finally we present an experimental evaluation to demonstrate that the proposed method is more efficient than the other traditional methods based on wavelet analysis.
{"title":"An Improved Wavelet Analysis Method for Detecting DDoS Attacks","authors":"L. Lu, M. Huang, M. Orgun, Jiawan Zhang","doi":"10.1109/nss.2010.23","DOIUrl":"https://doi.org/10.1109/nss.2010.23","url":null,"abstract":"Wavelet Analysis method is considered as one of the most efficient methods for detecting DDoS attacks. However, during the peak data communication hours with a large amount of data transactions, this method is required to collect too many samples that will greatly increase the computational complexity. Therefore, the real-time response time as well as the accuracy of attack detection becomes very low. To address the above problem, we propose a new DDoS detection method called Modified Wavelet Analysis method which is based on the existing Isomap algorithm and wavelet analysis. In the paper, we present our new model and algorithm for detecting DDoS attacks and demonstrate the reasons of why we enlarge the Hurst’s value of the self-similarity in our new approach. Finally we present an experimental evaluation to demonstrate that the proposed method is more efficient than the other traditional methods based on wavelet analysis.","PeriodicalId":127173,"journal":{"name":"2010 Fourth International Conference on Network and System Security","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131315376","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}
McKay D. Williams, Sheldon A. Munns, M. Temple, M. Mendenhall
Wireless communication security is addressed using device-specific RF-DNA fingerprints in a localized regional air monitor. The targeted application includes IEEE 802.16 WiMax-based airport communications such as being proposed by the Euro control and FAA organizations–concept validation is currently underway using the Aeronautical Mobile Airport Communications System (AeroMACS) network. Security enhancement via RF-DNA fingerprinting is motivated by earlier RF-DNA work using GMSK-based intra-cellular GSM signals and OFDM-based 802.11a peer-to-peer WiFi signals. The commonality that WiMax shares with these two existing communication systems, i.e., the cellular control structure of GSM and the multi-carrier OFDM modulation of 802.11a, suggests that RF-DNA fingerprinting may be effective for WiMax device discrimination. This is important given that WiMax shares some common features that may prove detrimental, to include bit-level authentication, privacy, and security mechanisms. It is reasonable to assume that these bit-level mechanisms will come under attack as ``hackers'' apply lessons learned from their previous successes. The contributions of this paper include: 1) the introduction of a Spectral Domain (SD) RF-DNA fingerprinting technique to augment previous Time Domain (TD) and Wavelet Domain (WD) techniques, and 2) a first look at AeroMACS physical waveform features and the potential applicability of RF-DNA fingerprinting using operationally collected signals.
{"title":"RF-DNA Fingerprinting for Airport WiMax Communications Security","authors":"McKay D. Williams, Sheldon A. Munns, M. Temple, M. Mendenhall","doi":"10.1109/NSS.2010.21","DOIUrl":"https://doi.org/10.1109/NSS.2010.21","url":null,"abstract":"Wireless communication security is addressed using device-specific RF-DNA fingerprints in a localized regional air monitor. The targeted application includes IEEE 802.16 WiMax-based airport communications such as being proposed by the Euro control and FAA organizations–concept validation is currently underway using the Aeronautical Mobile Airport Communications System (AeroMACS) network. Security enhancement via RF-DNA fingerprinting is motivated by earlier RF-DNA work using GMSK-based intra-cellular GSM signals and OFDM-based 802.11a peer-to-peer WiFi signals. The commonality that WiMax shares with these two existing communication systems, i.e., the cellular control structure of GSM and the multi-carrier OFDM modulation of 802.11a, suggests that RF-DNA fingerprinting may be effective for WiMax device discrimination. This is important given that WiMax shares some common features that may prove detrimental, to include bit-level authentication, privacy, and security mechanisms. It is reasonable to assume that these bit-level mechanisms will come under attack as ``hackers'' apply lessons learned from their previous successes. The contributions of this paper include: 1) the introduction of a Spectral Domain (SD) RF-DNA fingerprinting technique to augment previous Time Domain (TD) and Wavelet Domain (WD) techniques, and 2) a first look at AeroMACS physical waveform features and the potential applicability of RF-DNA fingerprinting using operationally collected signals.","PeriodicalId":127173,"journal":{"name":"2010 Fourth International Conference on Network and System Security","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126650800","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, a certificateless proxy signature scheme is introduced. The advantage of our scheme is that it can be extended into a certificateless proxy blind signature scheme very easily.
介绍了一种无证书代理签名方案。该方案的优点是可以很容易地扩展为无证书代理盲签名方案。
{"title":"Certificateless Proxy Signature and Its Extension to Blind Signature","authors":"R. Tso, X. Yi","doi":"10.1109/NSS.2010.96","DOIUrl":"https://doi.org/10.1109/NSS.2010.96","url":null,"abstract":"In this paper, a certificateless proxy signature scheme is introduced. The advantage of our scheme is that it can be extended into a certificateless proxy blind signature scheme very easily.","PeriodicalId":127173,"journal":{"name":"2010 Fourth International Conference on Network and System Security","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122933790","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 a masquerade attack, an adversary who has stolen a legitimate user's credentials attempts to impersonate him to carry out malicious actions. Automatic detection of such attacks is often undertaken constructing models of normal behaviour of each user and then measuring significant departures from them. One potential vulnerability of this approach is that anomaly detection algorithms are generally susceptible of being deceived. In this paper, we first investigate how a resourceful masquerader can successfully evade detection while still accomplishing his goals. We then propose an algorithm based on the Kullback-Leibler divergence which attempts to identify if a sufficiently anomalous attack is present within an apparently normal request. Our experimental results indicate that the proposed scheme achieves considerably better detection quality than adversarial-unaware approaches.
{"title":"Information-Theoretic Detection of Masquerade Mimicry Attacks","authors":"J. Tapiador, J. A. Clark","doi":"10.1109/NSS.2010.55","DOIUrl":"https://doi.org/10.1109/NSS.2010.55","url":null,"abstract":"In a masquerade attack, an adversary who has stolen a legitimate user's credentials attempts to impersonate him to carry out malicious actions. Automatic detection of such attacks is often undertaken constructing models of normal behaviour of each user and then measuring significant departures from them. One potential vulnerability of this approach is that anomaly detection algorithms are generally susceptible of being deceived. In this paper, we first investigate how a resourceful masquerader can successfully evade detection while still accomplishing his goals. We then propose an algorithm based on the Kullback-Leibler divergence which attempts to identify if a sufficiently anomalous attack is present within an apparently normal request. Our experimental results indicate that the proposed scheme achieves considerably better detection quality than adversarial-unaware approaches.","PeriodicalId":127173,"journal":{"name":"2010 Fourth International Conference on Network and System Security","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121799202","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 inherent freedom in self-organized mobile ad-hoc networks (MANETs) introduces challenges for trust management; particularly when nodes do not have any prior knowledge of each other. Furthermore in MANETs, the nodes themselves should be responsible for their own security. We propose a novel approach for trust management in MANETs that is based on the nodes’ own responsibility of building their trust level and node-level trust monitoring. The main contribution of this work is in the introduction of a Node based Trust Management (NTM) scheme in MANET based on the assumption that individual nodes are themselves responsible for their own trust level. We explore and develop the mathematical framework of trust in NTM. Finally, in this context, we demonstrate our scheme with notations, algorithms, analytical model and prove of its correctness.
{"title":"A Node-based Trust Management Scheme for Mobile Ad-Hoc Networks","authors":"Raihana Ferdous, V. Muthukkumarasamy, A. Sattar","doi":"10.1109/NSS.2010.67","DOIUrl":"https://doi.org/10.1109/NSS.2010.67","url":null,"abstract":"The inherent freedom in self-organized mobile ad-hoc networks (MANETs) introduces challenges for trust management; particularly when nodes do not have any prior knowledge of each other. Furthermore in MANETs, the nodes themselves should be responsible for their own security. We propose a novel approach for trust management in MANETs that is based on the nodes’ own responsibility of building their trust level and node-level trust monitoring. The main contribution of this work is in the introduction of a Node based Trust Management (NTM) scheme in MANET based on the assumption that individual nodes are themselves responsible for their own trust level. We explore and develop the mathematical framework of trust in NTM. Finally, in this context, we demonstrate our scheme with notations, algorithms, analytical model and prove of its correctness.","PeriodicalId":127173,"journal":{"name":"2010 Fourth International Conference on Network and System Security","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116950931","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}
Network congestion in the heterogeneous Internet, which is connected by millions of asynchronous systems, poses a serious threat to communication and intermediate nodes that falls under its path. The primary cause of network congestion is that data in networks are overloaded and available resources are inadequate to contain such traffic loads. An enormous amount of proposed approach towards network congestion is based on conventional control methods in the form of mathematical and linear models. However, the explosive growth of the Internet, its traffic and diversification of network applications has limited conventional control mechanism from scaling up and providing an effective solution. Although conventional congestion methods improve the level of control, the vulnerability of linearisation and varying network parameters makes it difficult to provide an efficient solution. In this paper, the problem of congestion is addressed via exploring computational intelligence (CI) methodology and proposing a fuzzy inference engine for congestion control in network edge and bottleneck link environments. Furthermore, through extensive simulation experiments, the results demonstrate that the proposed CI method improves network edge performance during congestion prior to conventional control methods.
{"title":"Computational Intelligence Utilisation in Simulation of Congestion Control in TCP/IP Edge Network","authors":"Reginald Lal, A. Chiou","doi":"10.1109/NSS.2010.43","DOIUrl":"https://doi.org/10.1109/NSS.2010.43","url":null,"abstract":"Network congestion in the heterogeneous Internet, which is connected by millions of asynchronous systems, poses a serious threat to communication and intermediate nodes that falls under its path. The primary cause of network congestion is that data in networks are overloaded and available resources are inadequate to contain such traffic loads. An enormous amount of proposed approach towards network congestion is based on conventional control methods in the form of mathematical and linear models. However, the explosive growth of the Internet, its traffic and diversification of network applications has limited conventional control mechanism from scaling up and providing an effective solution. Although conventional congestion methods improve the level of control, the vulnerability of linearisation and varying network parameters makes it difficult to provide an efficient solution. In this paper, the problem of congestion is addressed via exploring computational intelligence (CI) methodology and proposing a fuzzy inference engine for congestion control in network edge and bottleneck link environments. Furthermore, through extensive simulation experiments, the results demonstrate that the proposed CI method improves network edge performance during congestion prior to conventional control methods.","PeriodicalId":127173,"journal":{"name":"2010 Fourth International Conference on Network and System Security","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115639198","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
扫码关注我们
求助内容：
应助结果提醒方式：