{"title":"Stability criterion of angle tracking systems in real time under conditions of interference distorting direction finding characteristic","authors":"E. Markin","doi":"10.1109/SOCPAR.2010.5686615","DOIUrl":"https://doi.org/10.1109/SOCPAR.2010.5686615","url":null,"abstract":"The article considers stability of the automatic angle tracking systems under conditions of interference distorting direction finding characteristic. The automatic angle tracking is described in the system state. Since the estimation of the modulus of continuity in the theorem on continuous dependence of the characteristic roots on matrix elements accepts very significant roots change under small matrix perturbations of the such that these perturbations cannot be simulated by computer, hence, the stability criteria based on characteristic roots location analysis are not always convenient for practical applications. In this article a stability criterion is proposed which is determined by solving the differential equation system of the system. A computational procedure is obtained which allows us to determine the stability of automatic control system in real time. The solution is not sensitive to significant changes in the characteristic roots under small matrix perturbations of the system. Well-timed detection of the forthcoming loss of the automatic target tracking provides an opportunity to protect the system in automatic mode and therefore minimize jamming effects.","PeriodicalId":397384,"journal":{"name":"2010 International Conference of Soft Computing and Pattern Recognition","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122676804","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}
{"title":"Decision making under asynchronous time constraint among bilateral decision makers","authors":"H. Sasaki","doi":"10.1109/SOCPAR.2010.5686521","DOIUrl":"https://doi.org/10.1109/SOCPAR.2010.5686521","url":null,"abstract":"In this study, we discuss a theory on strategic points in process for decision making under time constraint which is uncommon or asynchronous among two or bilateral decision makers. We propose a formula to compute cost of time and two sets of strategic points under asynchronous time constraint among bilateral decision makers. We have conducted a feasibility check on our proposed formulas in their applications to a case study.","PeriodicalId":397384,"journal":{"name":"2010 International Conference of Soft Computing and Pattern Recognition","volume":"145 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123495617","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}
{"title":"An innovative algorithm for clustering retail items","authors":"P. Bala","doi":"10.1109/SOCPAR.2010.5686094","DOIUrl":"https://doi.org/10.1109/SOCPAR.2010.5686094","url":null,"abstract":"Dendrogram for clustering retail items is a tool used in customer relationship management (CRM) for implementing homogeneous schemes for all the items in one cluster. In agglomerative hierarchical clustering, dendrograms are developed based on the concept of ‘distance’ between the entities or, groups of entities. These entities may be the customers, retail items, business units etc. as per the business problem. The present paper focuses on agglomerative hierarchical clustering of retail items based on the concept of ‘similarity’ of the items which is regarded as the inverse of ‘distance’ (or ‘dissimilarity’). Similarity is measured based on the strength of association rule/s containing the candidate items to be merged. An algorithm has been proposed for developing dendrogram and it has been explained with an example in retail sale. The algorithm overcomes the negative impact of negative association between the items on the quality of clustering.","PeriodicalId":397384,"journal":{"name":"2010 International Conference of Soft Computing and Pattern Recognition","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127695666","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}
Jiuqiang Han, Dexing Zhong, Xinman Zhang, Yongli Liu
{"title":"Two-Dimensional Robust Neighborhood Discriminant Embedding in face recognition","authors":"Jiuqiang Han, Dexing Zhong, Xinman Zhang, Yongli Liu","doi":"10.1109/SOCPAR.2010.5686079","DOIUrl":"https://doi.org/10.1109/SOCPAR.2010.5686079","url":null,"abstract":"This paper explores the use of Two-Dimensional Robust Neighborhood Discriminant Embedding (2D-RNDE) as a means to improve the performance and robustness of face recognition. 2D-RNDE is based on graph embedding framework and Fisher's criterion, it can utilize the original two-dimensional image data directly and takes into account the Individual Discriminative Factor (IDF) which is proposed to describe the microscopic discriminative property of each sample. The purpose of our algorithm is to gather the within-class samples closer and separate the between-class samples further in the projected feature subspace after the dimensionality reduction. Furthermore, another informative feature extraction method called circular pixel distribution (CPD) is proposed and applied to enhance the robustness of our algorithm. Experiments with the Olivetti Research Laboratory (ORL) face dataset are conducted to evaluate our method in terms of classification accuracy, efficiency and robustness.","PeriodicalId":397384,"journal":{"name":"2010 International Conference of Soft Computing and Pattern Recognition","volume":"3 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126041744","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}
{"title":"A PSO algorithm to solve a real anaesthesiology nurse scheduling problem","authors":"L. Robles, M. Riff, L. Trilling","doi":"10.1109/SOCPAR.2010.5685868","DOIUrl":"https://doi.org/10.1109/SOCPAR.2010.5685868","url":null,"abstract":"In this paper we present an approach especially designed to solve the real world problem of Anesthesiology Nurse Scheduling (ANSP) at a French public hospital, where the anesthesiology nurses are one of the most shared resources. We propose a Particle Swarm Optimization algorithm to solve the ANSP. We compare our technique with previous results obtained using Integer Programming and Constraint Programming. The objective is the same for all methods: to maximize fairness of the schedule.","PeriodicalId":397384,"journal":{"name":"2010 International Conference of Soft Computing and Pattern Recognition","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126043871","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}
{"title":"Parallel protein sequence matching on multicore computers","authors":"Fadi N. Sibai, Nazar Zaki","doi":"10.1109/SOCPAR.2010.5686630","DOIUrl":"https://doi.org/10.1109/SOCPAR.2010.5686630","url":null,"abstract":"STRIKE was introduced and implemented to predict protein-protein interactions where proteins interact if they contain similar substrings of amino acids. On the yeast protein interaction literature, STRIKE was shown to improve upon the existing state-of-the-art methods for protein-protein interaction prediction. Herein, we describe the parallelization of STRIKE and its multithreaded implementation and performance enhancement on multicore systems. On large protein sequence sets, the execution time of a 16-thread implementation of this bioinformatics algorithm was reduced from about a week on a unithreaded implementation on a serial uniprocessor machine to 1.5 days on one quad core ×86 machine, down to 4.5 hours on 8 such quad core machines. Key optimizations to the implementation are also discussed.","PeriodicalId":397384,"journal":{"name":"2010 International Conference of Soft Computing and Pattern Recognition","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131355911","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}
{"title":"Integration of gesture and posture recognition systems for interpreting dynamic meanings using particle filter","authors":"O. Ahmed, A. Al-Hamadi, B. Michaelis","doi":"10.1109/SOCPAR.2010.5686421","DOIUrl":"https://doi.org/10.1109/SOCPAR.2010.5686421","url":null,"abstract":"This paper proposes a novel approach for determining the integration criteria using Particle filter for fusion of hand gesture and posture recognition system at decision level. For decision level fusion, integration framework requires the classification of hand gesture and posture symbols in which HMM and SVM are used to classify the alphabets and numbers from gesture and posture recognition system respectively. These classification results are input to integration framework to compute the contribution-weights. For this purpose, Condensation algorithm is employed to approximate optimal a-posterior probability using a-prior probability and Gaussian based likelihood function thus making the weights independent of classification ambiguities. Considering the recognition as a problem of regular grammar, we have developed the production rules based on Context Free Grammar for restaurant scenario. On the basis of contribution-weights, we mapped the recognized outcome over CFG rules and infer meaningful expressions. Experiments are conducted on 500 different combinations of restaurant orders with overall 98.3% inference accuracy which proves the significance of proposed approach.","PeriodicalId":397384,"journal":{"name":"2010 International Conference of Soft Computing and Pattern Recognition","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132568455","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}
{"title":"Use of neighborhood and stratification approaches to speed up instance selection algorithm","authors":"F. Ros, R. Harba, N. Piclin, M. Pintore","doi":"10.1109/SOCPAR.2010.5686648","DOIUrl":"https://doi.org/10.1109/SOCPAR.2010.5686648","url":null,"abstract":"This paper investigates a method for instance selection in the context of supervised classification adapted to large databases. Based on the scale up concept, the method reduces the time required to perform the selection procedure by enabling the application of known condensation instance techniques to only small data sets instead of the whole set. The novelty of our approach relies in the way of hybridizing neighborhood and stratification approaches. The key idea is to consider instances found out for a given strata to generate sub populations for the other strata representing critical regions of the feature space. Experiments performed with various data sets revealed the effectiveness and applicability of the proposed approach.","PeriodicalId":397384,"journal":{"name":"2010 International Conference of Soft Computing and Pattern Recognition","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132889807","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}
{"title":"Noise-enhanced nonlinear PDE for edge restoration in scalar images","authors":"A. Histace, D. Rousseau","doi":"10.1109/SOCPAR.2010.5685935","DOIUrl":"https://doi.org/10.1109/SOCPAR.2010.5685935","url":null,"abstract":"The report proposed an interpretation for the mechanism of noise-enhanced image restoration with nonlinear PDE (Partial Differential Equation) recently demonstrated in literature. A link is established between the action of noise in a nonlinear Perona-Malik anisotropic diffusion and stochastic resonance in memoryless nonlinear systems for 1-D signals.","PeriodicalId":397384,"journal":{"name":"2010 International Conference of Soft Computing and Pattern Recognition","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115368940","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}
{"title":"A new weighted rough set framework for imbalance class distribution","authors":"H. Own, N. A. Aal, A. Abraham","doi":"10.1109/SOCPAR.2010.5685849","DOIUrl":"https://doi.org/10.1109/SOCPAR.2010.5685849","url":null,"abstract":"Jaundice is the most common condition that requires medical attention in newborns. Although most newborns develop some degree of jaundice, a high level bilirubin puts a newborn at risk of bilirubin encephalopathy and kernicterus which are rare but still occur in Egypt. In this paper, a new weighted rough set framework is introduced for early intervention and prevention of neurological dysfunction and kernicterus that are catastrophic sequels of neonatal jaundice. The obtained results show that the weighted rough set can provide significantly more accurate and reliable predictive accuracy than well known algorithms such as weighted SVM and decision tree.","PeriodicalId":397384,"journal":{"name":"2010 International Conference of Soft Computing and Pattern Recognition","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114401381","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}