{"title":"Basic consideration of MPEG-2 coded file entropy and lossless re-encoding","authors":"K. Ohzeki, Yuanyu Wei, Eizaburo Iwata, U. Speidel","doi":"10.1109/IMCSIT.2010.5679744","DOIUrl":"https://doi.org/10.1109/IMCSIT.2010.5679744","url":null,"abstract":"Re-encoding of once compressed files is one of the difficult challenges in measuring the efficiency of coding methods. Variable length coding with a variable source delimiting scheme is a promising method for improving re-encoding efficiency. Analyses of coded files with fixed length delimiting and with variable length delimiting are reviewed. Motion vector codes of MPEG-2 encoded files are modified as a variable-to-variable coding point of view. Length, bit-rates, and varieties of videos are examined. The largest file is 16 seconds of D1 full size at 720 ×480 among five video files. By entropy evaluation, an improvement of almost 20% in coding efficiency over the conventional MPEG-2 is obtained.","PeriodicalId":147803,"journal":{"name":"Proceedings of the International Multiconference on Computer Science and Information Technology","volume":"40 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132570012","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":"Obfuscation methods with controlled calculation amounts and table function","authors":"Yuanyu Wei, K. Ohzeki","doi":"10.1109/IMCSIT.2010.5680052","DOIUrl":"https://doi.org/10.1109/IMCSIT.2010.5680052","url":null,"abstract":"This paper describes a new obfuscation method with two techniques by which both computational complexity can be controlled and semantic obfuscation can be achieved. The computational complexity can be strictly controlled by using the technique of encryption. The computational complexity can be arbitrarily specified by the impossibility of factorization of prime numbers by length from one second to about one year. Semantic obfuscation is achieved by transforming a function into a table function. A nonlinear, arbitrary function can be incorporated into the functions, while only linear functions are used in the conventional methods. Because the explicit function form is hidden, it is thought that analysis takes time. The computational complexity technique and semantic technique can be used at the same time, and the effect of integrated obfuscation with both techniques is great. Introduction.","PeriodicalId":147803,"journal":{"name":"Proceedings of the International Multiconference on Computer Science and Information Technology","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127880324","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":"Generation of first-order expressions from a broad coverage HPSG grammar","authors":"R. Coote, Andreas Wotzlaw","doi":"10.1109/IMCSIT.2010.5680054","DOIUrl":"https://doi.org/10.1109/IMCSIT.2010.5680054","url":null,"abstract":"This paper describes an application for computing first-order semantic representations of English texts. It is based on a combination of hybrid shallow-deep components arranged within the middleware framework Heart of Gold. The shallow-deep semantic analysis employs Robust Minimal Recursion Semantics (RMRS) as a common semantic underspecification formalism for natural language processing components. In order to compute efficiently first-order representations of the input text, the intermediate RMRS results of the shallow-deep analysis are transformed into the dominance constraints formalism and resolved by the underspecification resolver UTool. First-order expressions can serve as a formal knowledge representation of natural text and thus can be utilized in knowledge engineering or textual reasoning. At the end of this paper, we describe their application for recognizing textual entailment.","PeriodicalId":147803,"journal":{"name":"Proceedings of the International Multiconference on Computer Science and Information Technology","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125962982","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":"Supervisory control and real-time constraints","authors":"W. Grega","doi":"10.1109/IMCSIT.2010.5679859","DOIUrl":"https://doi.org/10.1109/IMCSIT.2010.5679859","url":null,"abstract":"OPC (OLE for Process Control) protocol was developed as a solution which fulfills requirements of open data integration architecture for industrial control. OPC standard is not primarily intended for feedback control or communication with high-bandwidth hard real-time requirements. Adding OPC to a process could influence the dynamics of the control loop and could cause problems in controller design and implementation. The experiments presented in this paper have shown that OPC if properly configured, is capable of providing a loop time shorter than the time constants of many industrial processes.","PeriodicalId":147803,"journal":{"name":"Proceedings of the International Multiconference on Computer Science and Information Technology","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121990729","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":"The development features of the face recognition system","authors":"R. Sadykhov, I. Frolov","doi":"10.1109/IMCSIT.2010.5680047","DOIUrl":"https://doi.org/10.1109/IMCSIT.2010.5680047","url":null,"abstract":"Nowadays personal identification is a very important issue. There is a wide range of applications in different spheres, such as video surveillance security systems, control of documents, forensics systems and etc. We consider a range of most significant aspects of face identification system based on support vector machines in this paper. At first we propose improved face detector to get the region of interest for next face recognition. In paper the technique of face detection jointly image normalization is introduced. We compare three algorithms of feature extraction in application on face identification (PCA NIPALS, NNPCA, kernel PCA). The presented system is intended for process the image with low quality, the photo with the different facial expressions. Our goal is to develop face recognition techniques and create the system for face identification.","PeriodicalId":147803,"journal":{"name":"Proceedings of the International Multiconference on Computer Science and Information Technology","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128658228","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}
I. Shvartsman, K. Taveter, Merle Parmak, M. Meriste
{"title":"Agent-oriented modelling for simulation of complex environments","authors":"I. Shvartsman, K. Taveter, Merle Parmak, M. Meriste","doi":"10.1109/IMCSIT.2010.5679731","DOIUrl":"https://doi.org/10.1109/IMCSIT.2010.5679731","url":null,"abstract":"This article addresses the application of agent-oriented modelling to composing scenarios for simulating problem domains consisting of heterogeneous entities that include humans, physical subsystems, and software components whose behaviours depend on the situation at hand. The article presents an overview of agent-oriented modelling and addresses the application of agent-oriented modelling and simulation for context-aware crisis management and military urban operations. We develop an approach for constructing vignettes of situation-aware behaviour to be further simulated by means of software agents and describe the creation of practical context-aware training scenarios. Finally, the article explores a platform currently in use for possible execution of agent-based simulations. Our approach is applicable in practice for testing typical behavioural vignettes in specific scenarios using the platform. Unique benefit of the proposed approach is its usability to observe how real subjects form their decisions to behave in certain situations.","PeriodicalId":147803,"journal":{"name":"Proceedings of the International Multiconference on Computer Science and Information Technology","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124577989","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}
G. Gravvanis, P. I. Matskanidis, K. M. Giannoutakis, E. A. Lipitakis
{"title":"Finite element approximate inverse preconditioning using POSIX threads on multicore systems","authors":"G. Gravvanis, P. I. Matskanidis, K. M. Giannoutakis, E. A. Lipitakis","doi":"10.1109/IMCSIT.2010.5679955","DOIUrl":"https://doi.org/10.1109/IMCSIT.2010.5679955","url":null,"abstract":"Explicit finite element approximate inverse preconditioning methods have been extensively used for solving efficiently sparse linear systems on multiprocessor and multicomputer systems. New parallel computational techniques are proposed for the parallelization of explicit preconditioned biconjugate conjugate gradient type methods, based on Portable Operating System Interface for UniX (POSIX) Threads, for multicore systems. Parallelization is achieved by assigning every loop of the parallel explicit preconditioned bi-conjugate conjugate gradient-STAB (PEPBiCG-STAB) to the desired number of threads, thus achieving for-loop parallelization. Theoretical estimates on speedups and efficiency are also presented. Finally, numerical results for the performance of the PEPBiCG-STAB method for solving characteristic two dimensional boundary value problems on multicore computer systems are presented, which are favorably compared to corresponding results from multiprocessor systems. The implementation issues of the proposed method are also discussed using POSIX Threads on a multicore system.","PeriodicalId":147803,"journal":{"name":"Proceedings of the International Multiconference on Computer Science and Information Technology","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130564175","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 natural language parsing with probabilistic grammars","authors":"Pawel Skórzewski","doi":"10.1109/IMCSIT.2010.5679860","DOIUrl":"https://doi.org/10.1109/IMCSIT.2010.5679860","url":null,"abstract":"This paper presents an example of application of a PCFG parsing algorithm based on the A* search procedure in a machine translation system. We modified the existing CYK-based parser used in the machine translation system Translatica and applied the A* parsing algorithm in order to improve the performance of the parser.","PeriodicalId":147803,"journal":{"name":"Proceedings of the International Multiconference on Computer Science and Information Technology","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130596257","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":"Constructive volumetric modeling","authors":"Mihai Tudorache, M. Popescu, R. Tanasie","doi":"10.1109/IMCSIT.2010.5679930","DOIUrl":"https://doi.org/10.1109/IMCSIT.2010.5679930","url":null,"abstract":"In this article we intend to present a method of obtaining high complexity sinthetic scenes by using simple volumes as the building blocks. The below described method can be used to obtain both homogenous and heterogenous volumes. This is done by combining volumes of different voxel densities.","PeriodicalId":147803,"journal":{"name":"Proceedings of the International Multiconference on Computer Science and Information Technology","volume":"11 8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120824135","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":"Parallelization of SVD of a matrix-systolic approach","authors":"Halil Snopçe, Ilir Spahiu","doi":"10.1109/IMCSIT.2010.5679743","DOIUrl":"https://doi.org/10.1109/IMCSIT.2010.5679743","url":null,"abstract":"In this paper we investigate the parallelization of Hestenes-Jacobi method for computing the SVD of an MXN matrix using systolic arrays. In the case of real matrix an array of R2 processors is proposed, such that each row contains N columns. In order to extend this idea we have presented three transformations which are used for transforming the complex into the real matrix. After the additional computations, we show how the same array may be used for the SVD of a complex matrix.","PeriodicalId":147803,"journal":{"name":"Proceedings of the International Multiconference on Computer Science and Information Technology","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127668351","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}