发布求助
文献互助 智能选刊 最新文献

Theoretical and Applied Informatics最新文献

筛选
英文 中文
Merging of fuzzy models for neuro-fuzzy systems 神经模糊系统的模糊模型合并
Theoretical and Applied Informatics Pub Date : 2011-07-30 DOI: 10.2478/V10179-011-0008-6
Krzysztof Siminski
{"title":"Merging of fuzzy models for neuro-fuzzy systems","authors":"Krzysztof Siminski","doi":"10.2478/V10179-011-0008-6","DOIUrl":"https://doi.org/10.2478/V10179-011-0008-6","url":null,"abstract":"The merging of fuzzy model is widely used for reduction of rule number in fuzzy model. The supernumerosity of rules is mainly caused by grid partition of input domain. In the paper different cause for model merging is described. It is the need for creation of fuzzy model for large data set. In our solution the models are build basing data subset and then the submodels are merged into one. This approach enables quicker elaboration of submodels with relatively good knowledge generalisation ability without waiting for the whole data set to be processed. With passing time, the subsequent submodels are created and merged to create the better model.","PeriodicalId":413417,"journal":{"name":"Theoretical and Applied Informatics","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124785358","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}
引用次数: 1
Model of the network physical layer for modern wireless systems 现代无线系统的网络物理层模型
Theoretical and Applied Informatics Pub Date : 2011-07-30 DOI: 10.1007/978-3-642-25355-3_4
M. Wróbel, S. Nowak
{"title":"Model of the network physical layer for modern wireless systems","authors":"M. Wróbel, S. Nowak","doi":"10.1007/978-3-642-25355-3_4","DOIUrl":"https://doi.org/10.1007/978-3-642-25355-3_4","url":null,"abstract":"","PeriodicalId":413417,"journal":{"name":"Theoretical and Applied Informatics","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126279630","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}
引用次数: 0
Scattered context grammars generating sentences followed by derivation tree 分散的上下文语法生成句子，然后是派生树
Theoretical and Applied Informatics Pub Date : 2011-07-30 DOI: 10.2478/V10179-011-0007-7
A. Meduna, S. Židek
{"title":"Scattered context grammars generating sentences followed by derivation tree","authors":"A. Meduna, S. Židek","doi":"10.2478/V10179-011-0007-7","DOIUrl":"https://doi.org/10.2478/V10179-011-0007-7","url":null,"abstract":"Propagating scattered context grammars are used to generate sentences of languages defined by scatterd context grammars followed by the strings corresponding to the derivation trees. It is proved that for every language defined by a scattered context grammar, there exists a propagating scattered context grammar whose language consists of original language sentences followed by strings representing their derivation trees.","PeriodicalId":413417,"journal":{"name":"Theoretical and Applied Informatics","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133150941","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}
引用次数: 4
Security of the quantum direct communication based on pairs of completely entangled qudits 基于完全纠缠量子对的量子直接通信的安全性
Theoretical and Applied Informatics Pub Date : 2011-07-30 DOI: 10.2478/V10179-011-0006-8
P. Zawadzki
{"title":"Security of the quantum direct communication based on pairs of completely entangled qudits","authors":"P. Zawadzki","doi":"10.2478/V10179-011-0006-8","DOIUrl":"https://doi.org/10.2478/V10179-011-0006-8","url":null,"abstract":"Quantum secure direct communication protocols offer confidential transmission of classic information over the quantum channel without a prior key agreement. The ping-pong based protocols provide asymptotic security and detailed analysis of the security level provided by each variant of the protocol is required. The paper presents a general method of calculation of the eavesdropped information as a function of the attack detection probability. The method is applied to the ping-pong protocol based on completely entangled pairs of qudits. The lower and upper bound on the amount of the leaked information is provided.","PeriodicalId":413417,"journal":{"name":"Theoretical and Applied Informatics","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117003663","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}
引用次数: 0
Computational aspects of GPU - accelerated sparse matrix - vector multiplication for solving Markov models 计算方面的GPU加速稀疏矩阵向量乘法求解马尔可夫模型
Theoretical and Applied Informatics Pub Date : 2011-07-30 DOI: 10.2478/V10179-011-0009-5
B. Bylina, J. Bylina, M. Karwacki
{"title":"Computational aspects of GPU - accelerated sparse matrix - vector multiplication for solving Markov models","authors":"B. Bylina, J. Bylina, M. Karwacki","doi":"10.2478/V10179-011-0009-5","DOIUrl":"https://doi.org/10.2478/V10179-011-0009-5","url":null,"abstract":"In this article we investigate some computational aspects of GPU-accelerated matrix-vector multiplication where matrix is sparse. Particularly, we deal with sparse matrices appearing in modelling with Markovian queuing models. The model we use for research is a Markovian queuing model of a wireless device. This model describes the device’s behavior during possible channel occupation by other devices. We study the efficiency of multiplication of a sparse matrix by a dense vector with the use of an appropriate, ready-to-use GPU-accelerated mathematical library, namely CUSP. For the CUSP library we discuss data structures and their impact on the CUDA platform for the fine-grained parallel architecture of the GPU. Our aim is to find the best format for storing a sparse matrix for GPU-computation (especially one associated with the Markovian model of a wireless device). We compare the time, the performance and the speed-up for the card NVIDIA Tesla C2050 (with ECC ON). For unstructured matrices (as our Markovian matrices), we observe speed-ups (in respect to CPU-only computations) of over 8 times.","PeriodicalId":413417,"journal":{"name":"Theoretical and Applied Informatics","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121742355","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}
引用次数: 16
Adaptive improvement of resource utilization in goal-oriented multi-user systems 面向目标的多用户系统中资源利用的自适应改进
Theoretical and Applied Informatics Pub Date : 2011-03-30 DOI: 10.2478/V10179-011-0003-Y
M. Mlynski
{"title":"Adaptive improvement of resource utilization in goal-oriented multi-user systems","authors":"M. Mlynski","doi":"10.2478/V10179-011-0003-Y","DOIUrl":"https://doi.org/10.2478/V10179-011-0003-Y","url":null,"abstract":"The material presents a real problem inherent in the management of computer systems, namely that of finding the appropriate system settings and thus being able to achieve the expected performance. The material also presents a prototype which aims to adapt the system in such a way as to achieve the objective, defined as the application efficiency. The prototype uses a resource-oriented mechanism that is built into the OS Workload Manager and is focused on a proposed goal-oriented subsystem based on fuzzy logic, managing resources to make the best use of them, and pursuing translation to the use of system resources, including nondeterministic technology-related factors such as duration of allocation and release of the resources, sharing the resources with the uncapped mode, and the errors of performance measurement.","PeriodicalId":413417,"journal":{"name":"Theoretical and Applied Informatics","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123032060","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}
引用次数: 0
Improving efficiency of data-intensive applications in goal-oriented adaptive computer systems 提高面向目标的自适应计算机系统中数据密集型应用的效率
Theoretical and Applied Informatics Pub Date : 2011-03-30 DOI: 10.2478/V10179-011-0004-X
M. Mlynski, Przemysław Rumik
{"title":"Improving efficiency of data-intensive applications in goal-oriented adaptive computer systems","authors":"M. Mlynski, Przemysław Rumik","doi":"10.2478/V10179-011-0004-X","DOIUrl":"https://doi.org/10.2478/V10179-011-0004-X","url":null,"abstract":"An accurate use of the ability to steer computer efficiency is essential from the database point of view. Effective resource allocation is dependent on the performance indicators gathered from running systems. There must be an appropriate balance between accurate measurements, performance indicators and speed of the reallocation algorithms of the computing resources. The extended measurement of efficiency which the authors propose for applications is: the average number of queries within a time unit for particular groups of users. This paper presents an analysis of using the Workload Manager utility in the AIX 5L operating system to improve the efficiency of applications in the MySQL database environment, and an analysis of methods which allows the use of Workload Manager for steering efficiency dynamically.","PeriodicalId":413417,"journal":{"name":"Theoretical and Applied Informatics","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125633629","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}
引用次数: 1
Development and implementation of IEC 61131-3 virtual machine IEC 61131-3虚拟机的开发与实现
Theoretical and Applied Informatics Pub Date : 2011-03-30 DOI: 10.2478/V10179-011-0002-Z
B. Trybus
{"title":"Development and implementation of IEC 61131-3 virtual machine","authors":"B. Trybus","doi":"10.2478/V10179-011-0002-Z","DOIUrl":"https://doi.org/10.2478/V10179-011-0002-Z","url":null,"abstract":"Virtual machine described in the paper is a runtime program for controllers in small distributed systems. The machine executes intermediate universal code similar to an assembler, compiled in CPDev engineering environment from source programs written in control languages of IEC 61131-3 standard. The machine is implemented as a C program, so it can run on different target platforms. Data formats and commands of the machine code are presented, together with the machine's Petri-net model, C implementation involving universal and platform-dependent modules, target hardware interface, input/output programming mechanisms, and practical applications.","PeriodicalId":413417,"journal":{"name":"Theoretical and Applied Informatics","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127134488","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}
引用次数: 23
The modeling of business impact analysis for the loss of integrity, confidentiality and availability in business processes and data 对业务流程和数据中完整性、机密性和可用性损失的业务影响分析进行建模
Theoretical and Applied Informatics Pub Date : 2011-03-30 DOI: 10.2478/V10179-011-0005-9
J. Baginski, M. Rostanski
{"title":"The modeling of business impact analysis for the loss of integrity, confidentiality and availability in business processes and data","authors":"J. Baginski, M. Rostanski","doi":"10.2478/V10179-011-0005-9","DOIUrl":"https://doi.org/10.2478/V10179-011-0005-9","url":null,"abstract":"In this article, authors analyze methods of the analysis of data integrity, security and availability loss results for business processes. Assessing those results, one can judge the importance of a process in organization; thus, determine which business process requires more attention. The importance of those processes can be determined with Business Impact Analysis (BIA). In article, first phase of BIA is presented - in specific, a construction of Business Impact Category Tables, Loss Levels and process weight calculation methods. A variety of weight calculating methods is presented. Authors also present their proposed method - square sum percentage - as a solution eliminating problems of other weight calculation methods in business impact analysis.","PeriodicalId":413417,"journal":{"name":"Theoretical and Applied Informatics","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134343809","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}
引用次数: 7
On the search of efficient AQM for large delay networks 大延迟网络中高效AQM的搜索
Theoretical and Applied Informatics Pub Date : 2011-03-30 DOI: 10.2478/V10179-011-0001-0
A. Brachman, Łukasz Chróst
{"title":"On the search of efficient AQM for large delay networks","authors":"A. Brachman, Łukasz Chróst","doi":"10.2478/V10179-011-0001-0","DOIUrl":"https://doi.org/10.2478/V10179-011-0001-0","url":null,"abstract":"The main idea of all Active Queue Management algorithms, is to notify the TCP sender about incoming congestion by dropping packets, to prevent from the buffer overflow, and its negative consequences. However, most AQM algorithms proposed so far, neglect the impact of the high speed and long delay links. As a result, the algorithms' efficiency, in terms of throughput and/or queue stability, is usually significantly decreased. The contribution of this paper is twofold. First of all, the performance of the well known AQM algorithms in high speed and long delay scenarios is evaluated and compared. Secondly, a new AQM algorithm is proposed, to improve the throughput in the large delay scenarios and to exclude the usage of random number generator.","PeriodicalId":413417,"journal":{"name":"Theoretical and Applied Informatics","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128574427","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}
引用次数: 0
首页 上一页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信