{"title":"A tool for morphologically ambiguous text processing","authors":"E. Klyshinsky, N. Kochetkova","doi":"10.1109/DIPDMWC.2016.7529377","DOIUrl":"https://doi.org/10.1109/DIPDMWC.2016.7529377","url":null,"abstract":"The main course of preliminary natural texts processing is tagging and disambiguating texts. Hence, most of modern language tools are specified for such purposes. In our projects, we carry out a shallow syntax of untagged texts. For this purpose we developed a new query language based on regular expressions. This language allows write queries according to words' ambiguity.","PeriodicalId":298218,"journal":{"name":"2016 Third International Conference on Digital Information Processing, Data Mining, and Wireless Communications (DIPDMWC)","volume":"326 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132949938","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":"Effective strategy for competences forming","authors":"S. Kulik, K. Tkachenko","doi":"10.1109/DIPDMWC.2016.7529396","DOIUrl":"https://doi.org/10.1109/DIPDMWC.2016.7529396","url":null,"abstract":"The problem of searching for the optimal strategy has been researched in the paper. The main aim of this paper is to present a strategies and new Lemma for strategies. The special curriculum has been developed for the set competences. The curriculum contains the main basic and specialized disciplines. Strategies comprise effectiveness indicators. A new Lemma related to effective strategies and the two disciplines was proved. All these strategies are compared to each other. As a result, the optimal strategy for the given competence was found.","PeriodicalId":298218,"journal":{"name":"2016 Third International Conference on Digital Information Processing, Data Mining, and Wireless Communications (DIPDMWC)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130954270","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":"Multi-objective selection approach for association mining based on interesting measures","authors":"P. Leesutthipornchai","doi":"10.1109/DIPDMWC.2016.7529359","DOIUrl":"https://doi.org/10.1109/DIPDMWC.2016.7529359","url":null,"abstract":"In the era of digital information, the size of data collection has been growing significantly. Knowledge results in term of association rules obtained from the set of data are numerous and hard to select. This paper proposes the approach for selecting the interesting subsets of association rules from big association results. The selective criterion is based on well-known interesting measures including confidence, support and lift. The interesting measures are simultaneously considered in multi-objective context. While, confidence guarantees the accuracy of the association results. Support promotes popular association patterns and lift indicates rare association patterns. Thai stock market data in period of April 10, 2013 to September 5, 2014 were investigated and applied to the selection approach. The results showed that multi-objective selection approach reduces 246,084 association rules into 11 nondominated association rules.","PeriodicalId":298218,"journal":{"name":"2016 Third International Conference on Digital Information Processing, Data Mining, and Wireless Communications (DIPDMWC)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134457437","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":"Two layers of beam alignment for millimeter-wave communications","authors":"Yi Wang, Zhenyu Shi, Kun Zeng, Peiying Zhu","doi":"10.1109/DIPDMWC.2016.7529400","DOIUrl":"https://doi.org/10.1109/DIPDMWC.2016.7529400","url":null,"abstract":"Beam alignment based on antenna array is a promising technique for millimeter wave communication in 5G. In this paper, we investigate the key parameters design under the framework of a two-layer beam alignment which includes wide beam training and narrow beam alignment. Firstly, an equivalent channel model with variant angles is proposed to simplify simulations. Secondly, the period of beam training and beam pattern design are investigated based on the practical phase-shifted antenna array. Analysis and numerical results show that the period of wide beam training and narrow beam training are about 200ms and 100ms, respectively, at a speed of 10m/s environment at 72 GHz.","PeriodicalId":298218,"journal":{"name":"2016 Third International Conference on Digital Information Processing, Data Mining, and Wireless Communications (DIPDMWC)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114506423","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}
K. Piad, Menchita F. Dumlao, Melvin A. Ballera, Shaneth C. Ambat
{"title":"Predicting IT employability using data mining techniques","authors":"K. Piad, Menchita F. Dumlao, Melvin A. Ballera, Shaneth C. Ambat","doi":"10.1109/DIPDMWC.2016.7529358","DOIUrl":"https://doi.org/10.1109/DIPDMWC.2016.7529358","url":null,"abstract":"Researchers in higher education are beginning to explore the potential of data mining in analyzing data for the purpose of giving quality service and needs of their graduates. Thus, educational data mining emerges as one tools to study academic data to identify patterns and help for decision making affecting the education. This paper predicts the employability of IT graduates using nine variables. First, different classification algorithms in data mining were tested making logistic regression with accuracy of 78.4 is implemented. Based on logistic regression analysis, three academic variables directly affect; IT_Core, IT_Professional and Gender identified as significant predictors for employability. The data were collected based on the five year profiles of 515 students randomly selected at the placement office tracer study.","PeriodicalId":298218,"journal":{"name":"2016 Third International Conference on Digital Information Processing, Data Mining, and Wireless Communications (DIPDMWC)","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117268019","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 computational model for refining Data domains in the property reconciliation","authors":"Viacheslav Wolfengagen, L. Ismailova, S. Kosikov","doi":"10.1109/DIPDMWC.2016.7529364","DOIUrl":"https://doi.org/10.1109/DIPDMWC.2016.7529364","url":null,"abstract":"A computational model for refining of data domains which are selected out in the property recognition over the Big Data sources is developed and considered. Data sources can originate both from natural and/or human activities. Thus discovered in a problem domain data objects - the individuals, - are considered as processes in a mathematical sense depending on parameters. The proposed parametrization is based on two-dimensional model using cross-referencing over assignments/crowdsoucers and recognizable properties/domains and is aimed to support the iteration procedure. This gives rise to the computational model based on the variable domains assumption. Such a vision is able to take into account the interaction of crowdsourcers and properties when they are varying with the evolving the events. The property recognition stage-by-stage model enables the fine tuning of the target data domains and has the representable functor. This model as may be shown is faithfully embedded into a category of indexed sets. The proposed (f, g)-tuning of the data domains leads to a neighborhood structure for cognition activity and gives a flexible computing model.","PeriodicalId":298218,"journal":{"name":"2016 Third International Conference on Digital Information Processing, Data Mining, and Wireless Communications (DIPDMWC)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116571834","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":"Identification of JPEG files fragments on digital media using binary patterns based on Huffman code table","authors":"A. Sorokin, Ekaterina Makushenko","doi":"10.1109/DIPDMWC.2016.7529378","DOIUrl":"https://doi.org/10.1109/DIPDMWC.2016.7529378","url":null,"abstract":"File fragmentation proves to be a major challenge for the majority of file carving techniques. Following the works of Simson Garfinkel, Nasir Memon and other authors we seek to find a technique to identify digital fragments (clusters or sectors) of JPEG-files on the digital storage medium or at least sort all the fragments of the storage based on their probability of being the part of JPEG-file from the most probable to the least probable. This paper offers the technique of identifying clusters of JPEG-files on the storage medium based on binary patterns and the experimental results of an attempt to build a similar technique for sector identifying.","PeriodicalId":298218,"journal":{"name":"2016 Third International Conference on Digital Information Processing, Data Mining, and Wireless Communications (DIPDMWC)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122427678","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}
Yu-Han Cheng, Chen-Xi Wang, Min Wei, Yun-yi Li, Xie-Feng Cheng
{"title":"Research of heart failure based on heart model and S1 complexity","authors":"Yu-Han Cheng, Chen-Xi Wang, Min Wei, Yun-yi Li, Xie-Feng Cheng","doi":"10.1109/DIPDMWC.2016.7529357","DOIUrl":"https://doi.org/10.1109/DIPDMWC.2016.7529357","url":null,"abstract":"To study the internal and external characteristics of heart failure, a lumped-parameter cardiovascular simulation model is designed to analyze the internal characteristics, and a method is proposed that uses the complexity of the first heart sound (S1) amplitude sequence to analyze the external characteristics. State variable method is used to establish the mathematical expression of the cardiovascular model which includes three sub-models: systemic circulation sub-model, pulmonary circulation sub-model and heart sub-model. Based on this model the heart physiological feature is studied, especially under heart failure. Then, the complexity of S1 amplitude sequence is analyzed based on multiscale base-scale entropy algorithm. Simulation experiment shows that, one of the internal characteristics of heart failure is the reduction of myocardial elasticity coefficient, and one of the external characteristics is the reduction of the complexity of S1 amplitude sequence. Simulation result being in accord with clinical data indicates that the proposed approach has feasibility and practicability in heart failure diagnosis.","PeriodicalId":298218,"journal":{"name":"2016 Third International Conference on Digital Information Processing, Data Mining, and Wireless Communications (DIPDMWC)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125065663","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 adaptive image mixed noise removal algorithm based on MMTD","authors":"Ningning Zhou, Shaobai Zhang","doi":"10.1109/DIPDMWC.2016.7529370","DOIUrl":"https://doi.org/10.1109/DIPDMWC.2016.7529370","url":null,"abstract":"Mixed noise composed by Gaussian noise and Salt-Pepper noise is an ever-present noise model in the image. This paper proposes an adaptive image mixed removal algorithm based on measure of medium truth degree(MMTD). According to the feature and density of noise, it adaptively alters the detection window size. Then it defines the predicates and establishes the relation between gray level and truth interval of predicates. Finally, uses the distance ratio function to measure the similarity degree between the considered pixel and the normal pixel in the detection window and to remove the noise pixel. By sample simulation and classic PSNR evaluation, it shows the adaptive image mixed noise removal algorithm (AdpMMTD) brings about a good performance in removing mixed noise and preserving fine details.","PeriodicalId":298218,"journal":{"name":"2016 Third International Conference on Digital Information Processing, Data Mining, and Wireless Communications (DIPDMWC)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126827660","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":"Recognition for objects by relationship between attributes","authors":"Hiroka Horiguchi, Kazuo Ikeshiro, H. Imamura","doi":"10.1109/DIPDMWC.2016.7529408","DOIUrl":"https://doi.org/10.1109/DIPDMWC.2016.7529408","url":null,"abstract":"The object recognition method based on attributes has been studied. The conventional method recognizes objects by the presence or absence of attributes. However, the conventional method has two problems. Firstly, the conventional method is not able to recognize a target object of which a part of attribute is occluded. Secondly, the conventional method misrecognizes a target object which has irrelevant attributes. Therefore, to solve these two problems, we propose the object recognition by relationship between attributes. In this paper, we focus on the face as recognition object. The proposed method uses relationship as constraints for object recognition using attributes. The proposed method applies two major type constraints. First constraint is a local constraint which is applied to a part of attributes. To achieve robust face recognition against occlusion scenes, the proposed method uses the local constraint. And then, Second constraint is a global constraint which is applied to all attributes. To achieve robust face recognition against irrelevant attributes, the proposed method uses the global constraint. In this paper, to evaluate effectiveness of the proposed method, we compare the proposed method with the conventional method. We experimented in normal face, occlusion and irrelevant attributes. We used 43 images of a face which are changed in scale and rotation. Experimental results showed that the recognition ratio of the proposed method is equal to or more than the conventional method in normal face, occlusion and irrelevant attributes.","PeriodicalId":298218,"journal":{"name":"2016 Third International Conference on Digital Information Processing, Data Mining, and Wireless Communications (DIPDMWC)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132778977","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}