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

Fundamenta Informaticae最新文献

筛选
英文 中文
On Some Mathematical Structures of T-Fuzzy Rough Set Algebras in Infinite Universes of Discourse 无限论域中t -模糊粗糙集代数的若干数学结构
IF 0.8 4区 计算机科学
Fundamenta Informaticae Pub Date : 2011-08-01 DOI: 10.5555/2361314.2361323
WuWei-Zhi
{"title":"On Some Mathematical Structures of T-Fuzzy Rough Set Algebras in Infinite Universes of Discourse","authors":"WuWei-Zhi","doi":"10.5555/2361314.2361323","DOIUrl":"https://doi.org/10.5555/2361314.2361323","url":null,"abstract":"In this paper, a general framework for the study of fuzzy rough approximation operators determined by a triangular norm in infinite universes of discourse is investigated. Lower and upper approxima...","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"1 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2011-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71127139","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Refinement of Synchronizable Places with Multi-workflow Nets 多工作流网络中可同步位置的细化
IF 0.8 4区 计算机科学
Fundamenta Informaticae Pub Date : 2011-06-20 DOI: 10.3233/FI-2013-783
K. V. Hee, N. Sidorova, J. V. D. Werf
{"title":"Refinement of Synchronizable Places with Multi-workflow Nets","authors":"K. V. Hee, N. Sidorova, J. V. D. Werf","doi":"10.3233/FI-2013-783","DOIUrl":"https://doi.org/10.3233/FI-2013-783","url":null,"abstract":"Stepwise refinement is a well-known strategy in system modeling. The refinement rules should preserve essential behavioral properties, such as deadlock freedom, boundedness and weak termination. A well-known example is the refinement rule that replaces a safe place of a Petri net with a sound workflow net. In this case a token on the refined place undergoes a procedure that is modeled in detail by the refining workflow net.","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"420 1","pages":"149-168"},"PeriodicalIF":0.8,"publicationDate":"2011-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78763960","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
Minimal Coverability Set for Petri Nets: Karp and Miller Algorithm with Pruning Petri网的最小可覆盖性集:带修剪的Karp和Miller算法
IF 0.8 4区 计算机科学
Fundamenta Informaticae Pub Date : 2011-06-20 DOI: 10.3233/FI-2013-781
P. Reynier, Frédéric Servais
{"title":"Minimal Coverability Set for Petri Nets: Karp and Miller Algorithm with Pruning","authors":"P. Reynier, Frédéric Servais","doi":"10.3233/FI-2013-781","DOIUrl":"https://doi.org/10.3233/FI-2013-781","url":null,"abstract":"This paper presents the Monotone-Pruning algorithm (MP) for computing the minimal coverability set of Petri nets. The original Karp and Miller algorithm (K&M) unfolds the reachability graph of a Petri net and uses acceleration on branches to ensure termination. The MP algorithm improves the K&M algorithm by adding pruning between branches of the K&M tree. This idea was first introduced in the Minimal Coverability Tree algorithm (MCT), however it was recently shown to be incomplete. The MP algorithm can be viewed as the MCT algorithm with a slightly more aggressive pruning strategy which ensures completeness. Experimental results show that this algorithm is a strong improvement over the K&M algorithm. © 2011 Springer-Verlag.","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"12 1","pages":"69-88"},"PeriodicalIF":0.8,"publicationDate":"2011-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73304031","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 35
A Kleene-Schützenberger Theorem for Trace Series over Bounded Lattices 有界格上迹级数的kleene - sch<s:1>岑伯格定理
IF 0.8 4区 计算机科学
Fundamenta Informaticae Pub Date : 2011-04-01 DOI: 10.3233/FI-2011-586
Martin Huschenbett
{"title":"A Kleene-Schützenberger Theorem for Trace Series over Bounded Lattices","authors":"Martin Huschenbett","doi":"10.3233/FI-2011-586","DOIUrl":"https://doi.org/10.3233/FI-2011-586","url":null,"abstract":"We study weighted trace automata with weights in strong bimonoids. Traces form a generalization of words that allow to model concurrency; strong bimonoids are algebraic structures that can be regarded as “semirings without distributivity”. A very important example for the latter are bounded lattices, especially non-distributive ones. We show that if both operations of the bimonoid are locally finite, then the classes of recognizable and mc-rational trace series coincide and, in general, are properly contained in the class of c-rational series. Moreover, if, in addition, in the bimonoid the addition is idempotent and the multiplication is commutative, then all three classes coincide.","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"92 1","pages":"99-111"},"PeriodicalIF":0.8,"publicationDate":"2011-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76377805","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Unsupervised and Supervised Learning Approaches Together for Microarray Analysis 微阵列分析的无监督和监督学习方法
IF 0.8 4区 计算机科学
Fundamenta Informaticae Pub Date : 2011-01-01 DOI: 10.5555/1971700.1971703
SahaIndrajit, MaulikUjjwal, BandyopadhyaySanghamitra, PlewczynskiDariusz
{"title":"Unsupervised and Supervised Learning Approaches Together for Microarray Analysis","authors":"SahaIndrajit, MaulikUjjwal, BandyopadhyaySanghamitra, PlewczynskiDariusz","doi":"10.5555/1971700.1971703","DOIUrl":"https://doi.org/10.5555/1971700.1971703","url":null,"abstract":"In this article, a novel concept is introduced by using both unsupervised and supervised learning. For unsupervised learning, the problem of fuzzy clustering in microarray data as a multiobjective ...","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"1 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2011-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71124640","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Bit-Parallel Algorithm for the Constrained Longest Common Subsequence Problem 约束最长公共子序列问题的位并行算法
IF 0.8 4区 计算机科学
Fundamenta Informaticae Pub Date : 2010-12-01 DOI: 10.5555/1834610.1834613
DeorowiczSebastian
{"title":"Bit-Parallel Algorithm for the Constrained Longest Common Subsequence Problem","authors":"DeorowiczSebastian","doi":"10.5555/1834610.1834613","DOIUrl":"https://doi.org/10.5555/1834610.1834613","url":null,"abstract":"The problem of finding a constrained longest common subsequence (CLCS) for the sequences A and B with respect to the sequence P was introduced recently. Its goal is to find a longest subsequence C ...","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"1 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71123391","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Robust Multiple Classifier System for Pixel Classification of Remote Sensing Images 用于遥感图像像素分类的鲁棒多分类器系统
IF 0.8 4区 计算机科学
Fundamenta Informaticae Pub Date : 2010-12-01 DOI: 10.5555/1883472.1883475
MaulikUjjwal, ChakrabortyDebasis
{"title":"A Robust Multiple Classifier System for Pixel Classification of Remote Sensing Images","authors":"MaulikUjjwal, ChakrabortyDebasis","doi":"10.5555/1883472.1883475","DOIUrl":"https://doi.org/10.5555/1883472.1883475","url":null,"abstract":"Satellite image classification is a complex process that may be affected by many factors. This article addresses the problem of pixel classification of satellite images by a robust multiple classif...","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"18 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71123583","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Autonomous Knowledge-oriented Clustering Using Decision-Theoretic Rough Set Theory 基于决策粗糙集理论的自主知识聚类
IF 0.8 4区 计算机科学
Fundamenta Informaticae Pub Date : 2010-10-15 DOI: 10.3233/FI-2012-646
Hong Yu, Shuangshuang Chu, Dachun Yang
{"title":"Autonomous Knowledge-oriented Clustering Using Decision-Theoretic Rough Set Theory","authors":"Hong Yu, Shuangshuang Chu, Dachun Yang","doi":"10.3233/FI-2012-646","DOIUrl":"https://doi.org/10.3233/FI-2012-646","url":null,"abstract":"In many applications, clusters tend to have vague or imprecise boundaries. It is desirable that clustering techniques should consider such an issue. The decision-theoretic rough set (DTRS) model is a typical probabilistic rough set model, which has the ability to deal with imprecise, uncertain, and vague information. This paper proposes an autonomous clustering method using the decision-theoretic rough set model based on a knowledge-oriented clustering framework. In order to get the initial knowledge-oriented clustering, the threshold values are produced autonomously based on semantics of clustering without human intervention. Furthermore, this paper estimates the risk of a clustering scheme based on the decision-theoretic rough set by considering various loss functions, which can process the different granular overlapping boundary. An autonomous clustering algorithm is proposed, which is not only experimented with the synthetic data and the standard data but also applied in the web search results clustering. The results of experiments show that the proposed method is effective and efficient.","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"31 1","pages":"687-694"},"PeriodicalIF":0.8,"publicationDate":"2010-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90656714","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 38
Using a Time Granularity Table for Gradual Granular Data Aggregation 使用时间粒度表进行逐步粒度数据聚合
IF 0.8 4区 计算机科学
Fundamenta Informaticae Pub Date : 2010-09-20 DOI: 10.3233/FI-2014-1039
N. Iftikhar, T. Pedersen
{"title":"Using a Time Granularity Table for Gradual Granular Data Aggregation","authors":"N. Iftikhar, T. Pedersen","doi":"10.3233/FI-2014-1039","DOIUrl":"https://doi.org/10.3233/FI-2014-1039","url":null,"abstract":"The majority of today's systems increasingly require sophisticated data management as they need to store and to query large amounts of data for analysis and reporting purposes. In order to keep more \"detailed\" data available for longer periods, \"old\" data has to be reduced gradually to save space and improve query performance, especially on resource-constrained systems with limited storage and query processing capabilities. A number of data reduction solutions have been developed, however an effective solution particularly based on gradual data reduction is missing. This paper presents an effective solution for data reduction based on gradual granular data aggregation. With the gradual granular data aggregation mechanism, older data can be made coarse-grained while keeping the newest data fine-grained. For instance, when data is 3 months old aggregate to 1 minute level from 1 second level, when data is 6 months old aggregate to 2 minutes level from 1 minute level and so on. The proposed solution introduces a time granularity based data structure, namely a relational time granularity table that enables long term storage of old data by maintaining it at different levels of granularity and effective query processing due to a reduction in data volume. In addition, the paper describes the implementation strategy derived from a farming case study using standard technologies.","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"17 1","pages":"219-233"},"PeriodicalIF":0.8,"publicationDate":"2010-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76696634","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 10
Transformations Between Different Models of Unranked Bottom-Up Tree Automata 无排序自底向上树形自动机不同模型之间的转换
IF 0.8 4区 计算机科学
Fundamenta Informaticae Pub Date : 2010-08-10 DOI: 10.4204/EPTCS.31.18
Xiaoxue Piao, K. Salomaa
{"title":"Transformations Between Different Models of Unranked Bottom-Up Tree Automata","authors":"Xiaoxue Piao, K. Salomaa","doi":"10.4204/EPTCS.31.18","DOIUrl":"https://doi.org/10.4204/EPTCS.31.18","url":null,"abstract":"We consider the representational state complexity of unranked tree automata. The bottom-up computation of an unranked tree automaton may be either deterministic or nondeterministic, and further variants arise depending on whether the horizontal string languages defining the transitions are represented by a DFA or an NFA. Also, we consider for unranked tree automata the alternative syntactic definition of determinism introduced by Cristau et al. (FCT'05, LNCS 3623, pp. 68-79). We establish upper and lower bounds for the state complexity of conversions between different types of unranked tree automata.","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"138 1","pages":"159-168"},"PeriodicalIF":0.8,"publicationDate":"2010-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76567112","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 14
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信