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

Fundamenta Informaticae最新文献

筛选
英文 中文
A SAT-based Method for Solving the Two-dimensional Strip Packing Problem 基于sat的二维条形布局问题求解方法
IF 0.8 4区 计算机科学
Fundamenta Informaticae Pub Date : 2010-08-01 DOI: 10.5555/1890507.1890516
SohTakehide, InoueKatsumi, TamuraNaoyuki, BanbaraMutsunori, NabeshimaHidetomo
{"title":"A SAT-based Method for Solving the Two-dimensional Strip Packing Problem","authors":"SohTakehide, InoueKatsumi, TamuraNaoyuki, BanbaraMutsunori, NabeshimaHidetomo","doi":"10.5555/1890507.1890516","DOIUrl":"https://doi.org/10.5555/1890507.1890516","url":null,"abstract":"We propose a satisfiability testing (SAT) based exact approach for solving the two-dimensional strip packing problem (2SPP). In this problem, we are given a set of rectangles and one large rectangl...","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"1 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71123931","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
Hasse Diagram Generators and Petri Nets 哈斯图生成器和Petri网
IF 0.8 4区 计算机科学
Fundamenta Informaticae Pub Date : 2010-08-01 DOI: 10.3233/FI-2010-367
Mateus de Oliveira Oliveira
{"title":"Hasse Diagram Generators and Petri Nets","authors":"Mateus de Oliveira Oliveira","doi":"10.3233/FI-2010-367","DOIUrl":"https://doi.org/10.3233/FI-2010-367","url":null,"abstract":"In [18] Lorenz and Juhas raised the question of whether there exists a suitable formalism for the representation of infinite families of partial orders generated by Petri nets. Restricting ourselves to bounded p/t-nets, we propose Hasse diagram generators as an answer. We show that Hasse diagram generators are expressive enough to represent the partial order language of any bounded p/t net. We prove as well that it is decidable both whether the (possibly infinite) family of partial orders represented by a given Hasse diagram generator is included in the partial order language of a given p/t-net and whether their intersection is empty. Based on this decidability result, we prove that the partial order languages of two given Petri nets can be effectively compared with respect to inclusion. Finally we address the synthesis of k-safe p/t-nets from Hasse diagram generators.","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"22 1","pages":"183-203"},"PeriodicalIF":0.8,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73507506","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}
引用次数: 15
Learning Workflow Petri Nets 学习工作流程Petri网
IF 0.8 4区 计算机科学
Fundamenta Informaticae Pub Date : 2010-06-21 DOI: 10.3233/FI-2011-607
J. Esparza, M. Leucker, M. Schlund
{"title":"Learning Workflow Petri Nets","authors":"J. Esparza, M. Leucker, M. Schlund","doi":"10.3233/FI-2011-607","DOIUrl":"https://doi.org/10.3233/FI-2011-607","url":null,"abstract":"Workflow mining is the task of automatically producing a workflow model from a set of event logs recording sequences of workflow events; each sequence corresponds to a use case or workflow instance. Formal approaches to workflow mining assume that the event log is complete (contains enough information to infer the workflow) which is often not the case. We present a learning approach that relaxes this assumption: if the event log is incomplete, our learning algorithm automatically derives queries about the executability of some event sequences. If a teacher answers these queries, the algorithm is guaranteed to terminate with a correct model. We provide matching upper and lower bounds on the number of queries required by the algorithm, and report on the application of an implementation to some examples.","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"182 1","pages":"206-225"},"PeriodicalIF":0.8,"publicationDate":"2010-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76855650","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}
引用次数: 30
Counting Dependent and Independent Strings 计数依赖和独立字符串
IF 0.8 4区 计算机科学
Fundamenta Informaticae Pub Date : 2010-06-07 DOI: 10.1007/978-3-642-15155-2_60
Marius Zimand
{"title":"Counting Dependent and Independent Strings","authors":"Marius Zimand","doi":"10.1007/978-3-642-15155-2_60","DOIUrl":"https://doi.org/10.1007/978-3-642-15155-2_60","url":null,"abstract":"","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"173 4","pages":"689-700"},"PeriodicalIF":0.8,"publicationDate":"2010-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72393430","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
On Almost-Sure Properties of Probabilistic Discrete Event Systems 关于概率离散事件系统的几乎确定性质
IF 0.8 4区 计算机科学
Fundamenta Informaticae Pub Date : 2010-01-01 DOI: 10.3233/FI-2011-548
H. Yen
{"title":"On Almost-Sure Properties of Probabilistic Discrete Event Systems","authors":"H. Yen","doi":"10.3233/FI-2011-548","DOIUrl":"https://doi.org/10.3233/FI-2011-548","url":null,"abstract":"Although randomization often increases the degree of flexibility in system design, analyzing system properties in the probabilistic framework introduces additional difficulties and challenges in comparison with their nonprobabilistic counterparts. In this paper, we focus on probabilistic versions of two problems frequently encountered in discrete event systems, namely, the reachability and forbidden-state problems. Our main concern is to see whether there exists a (or for every) non-blocking or fair control policy under which a given finite- or infinite-state system can be guided to reach (or avoid) a set of goal states with probability one. For finite-state systems, we devise algorithmic approaches which result in polynomial time solutions to the two problems. For infinite-state systems modelled as Petri nets, the problems are undecidable in general. For the class of persistent Petri nets, we establish a valuation approach through which the convergence behavior of a system is characterized, which in turn yields solutions to the reachability and forbidden-state problems.","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"42 1","pages":"223-228"},"PeriodicalIF":0.8,"publicationDate":"2010-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80321316","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
Cellular Automata, Decidability and Phasespace 元胞自动机、可决性与相位空间
IF 0.8 4区 计算机科学
Fundamenta Informaticae Pub Date : 2010-01-01 DOI: 10.3233/FI-2010-340
Klaus Sutner
{"title":"Cellular Automata, Decidability and Phasespace","authors":"Klaus Sutner","doi":"10.3233/FI-2010-340","DOIUrl":"https://doi.org/10.3233/FI-2010-340","url":null,"abstract":"Cellular automata have rich computational properties and, at the same time, provide plausible models of physics-like computation. We study decidability issues in the phasespace of these automata, construed as automatic structures over infinite words. In dimension one, slightly more than the first order theory is decidable but the addition of an orbit predicate results in undecidability. We comment on connections between this “what you see is what you get” model and the lack of natural intermediate degrees.","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"21 1","pages":"17-30"},"PeriodicalIF":0.8,"publicationDate":"2010-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80850964","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}
引用次数: 8
3DM: Domain-oriented Data-driven Data Mining 3DM:面向领域的数据驱动数据挖掘
IF 0.8 4区 计算机科学
Fundamenta Informaticae Pub Date : 2009-12-01 DOI: 10.5555/1550947.1550952
WangGuo-yin, WangYan
{"title":"3DM: Domain-oriented Data-driven Data Mining","authors":"WangGuo-yin, WangYan","doi":"10.5555/1550947.1550952","DOIUrl":"https://doi.org/10.5555/1550947.1550952","url":null,"abstract":"Recent developments in computing, communications, digital storage technologies, and high-throughput data-acquisition technologies, make it possible to gather and store incredible volumes of data. I...","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"1 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71119992","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
Robust Candidate Pruning Approach Based on the PSO-SVM for Fast Corner Detection with Noise Tolerance in Gray-Level Images 基于PSO-SVM鲁棒候选剪枝的灰度图像抗噪角点快速检测
IF 0.8 4区 计算机科学
Fundamenta Informaticae Pub Date : 2009-12-01 DOI: 10.5555/1670662.1670668
LiuMing-Tsung, YuPao-Ta
{"title":"Robust Candidate Pruning Approach Based on the PSO-SVM for Fast Corner Detection with Noise Tolerance in Gray-Level Images","authors":"LiuMing-Tsung, YuPao-Ta","doi":"10.5555/1670662.1670668","DOIUrl":"https://doi.org/10.5555/1670662.1670668","url":null,"abstract":"This paper presents a fast two-stage corner detector with noise tolerance. In the first stage, a novel candidate pruning approach based on PSO-SVM is proposed to select candidatecorner pixels which...","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"1 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71121620","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 Multi-swarm Approach to Multi-objective Flexible Job-shop Scheduling Problems 多目标柔性作业车间调度问题的多群算法
IF 0.8 4区 计算机科学
Fundamenta Informaticae Pub Date : 2009-12-01 DOI: 10.5555/2365136.2365141
LiuHongbo, AbrahamAjith, WangZuwen
{"title":"A Multi-swarm Approach to Multi-objective Flexible Job-shop Scheduling Problems","authors":"LiuHongbo, AbrahamAjith, WangZuwen","doi":"10.5555/2365136.2365141","DOIUrl":"https://doi.org/10.5555/2365136.2365141","url":null,"abstract":"Swarm Intelligence (SI) is an innovative distributed intelligent paradigm whereby the collective behaviors of unsophisticated individuals interacting locally with their environment cause coherent f...","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"1 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71127190","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
Normalized-scale Relations and Their Concept Lattices in Relational Databases 关系型数据库中的归一化尺度关系及其概念格
IF 0.8 4区 计算机科学
Fundamenta Informaticae Pub Date : 2009-12-01 DOI: 10.5555/1606740.1606744
LeiYuxia, Suiyuefei, CaoCungen
{"title":"Normalized-scale Relations and Their Concept Lattices in Relational Databases","authors":"LeiYuxia, Suiyuefei, CaoCungen","doi":"10.5555/1606740.1606744","DOIUrl":"https://doi.org/10.5555/1606740.1606744","url":null,"abstract":"Formal Concept Analysis (FCA) is a valid tool for data mining and knowledge discovery, which identifies conceptual structures from (formal) contexts. As many practical applications involve non-bina...","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"1 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71120982","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
首页 上一页 下一页 尾页
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学术官方微信