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

International Workshop on Concurrency, Specification and Programming最新文献

筛选
英文 中文
A Bi-objective Optimization Framework for Heterogeneous CPU/GPU Query Plans 异构CPU/GPU查询计划的双目标优化框架
International Workshop on Concurrency, Specification and Programming Pub Date : 2014-10-01 DOI: 10.3233/FI-2014-1136
Piotr Przymus, Krzysztof Kaczmarski, K. Stencel
{"title":"A Bi-objective Optimization Framework for Heterogeneous CPU/GPU Query Plans","authors":"Piotr Przymus, Krzysztof Kaczmarski, K. Stencel","doi":"10.3233/FI-2014-1136","DOIUrl":"https://doi.org/10.3233/FI-2014-1136","url":null,"abstract":"Graphics Processing Units (GPU) have significantly more applications than just rendering images. They are also used in general-purpose computing to solve problems that can benefit from massive parallel processing. However, there are tasks that either hardly suit GPU or fit GPU only partially. The latter class is the focus of this paper. We elaborate on hybrid CPU/GPU computation and build optimization methods that seek the equilibrium between these two computation platforms. The method is based on heuristic search for bi-objective Pareto optimal execution plans in presence of multiple concurrent queries. The underlying model mimics the commodity market where devices are producers and queries are consumers. The value of resources of computing devices is controlled by supply-and-demand laws. Our model of the optimization criteria allows finding solutions of problems not yet addressed in heterogeneous query processing. Furthermore, it also offers lower time complexity and higher accuracy than other methods.","PeriodicalId":286395,"journal":{"name":"International Workshop on Concurrency, Specification and Programming","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129914548","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
Genetic Algorithm with Path Relinking for the Orienteering Problem with Time Windows 带时间窗定向运动问题的路径重链接遗传算法
International Workshop on Concurrency, Specification and Programming Pub Date : 2014-10-01 DOI: 10.3233/FI-2014-1132
Joanna Karbowska-Chilinska, Paweł Zabielski
{"title":"Genetic Algorithm with Path Relinking for the Orienteering Problem with Time Windows","authors":"Joanna Karbowska-Chilinska, Paweł Zabielski","doi":"10.3233/FI-2014-1132","DOIUrl":"https://doi.org/10.3233/FI-2014-1132","url":null,"abstract":"The Orienteering Problem with Time Windows (OPTW) is an optimisation NP-hard problem. This paper proposes a hybrid genetic algorithm (GAPR) for approximating a solution to the OPTW. Instead of a crossover we use a path relinking (PR) strategy as a form of intensification solution. PR generates a new solution by exploring trajectories between two random solutions: genes not present in one solution are included in the other one. Experiments performed on popular benchmark instances show that the proposed GAPR gives good quality solutions using short computing times. Moreover, GAPR gives new best solutions for some test instances.","PeriodicalId":286395,"journal":{"name":"International Workshop on Concurrency, Specification and Programming","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123060160","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}
引用次数: 14
Identification of Formal Fallacies in a Natural Dialogue 自然对话中形式谬误的识别
International Workshop on Concurrency, Specification and Programming Pub Date : 2014-10-01 DOI: 10.3233/FI-2014-1131
M. Kacprzak, A. Sawicka
{"title":"Identification of Formal Fallacies in a Natural Dialogue","authors":"M. Kacprzak, A. Sawicka","doi":"10.3233/FI-2014-1131","DOIUrl":"https://doi.org/10.3233/FI-2014-1131","url":null,"abstract":"This paper is a continuation of the work [26] in which the LND dialogue system was proposed. LND reconstructs the dialogical logic introduced by Lorenzen using the terminology of persuasion dialogue games as specified by Prakken [18]. The aim of the LND system is to recognize formal fallacies in natural dialogues and remove them. Now we extend this system to include a new protocol enabling the reconstruction of natural dialogues in which parties can commit formal fallacies. We then present the implementation of the protocols applied.","PeriodicalId":286395,"journal":{"name":"International Workshop on Concurrency, Specification and Programming","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132904141","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}
引用次数: 8
Preprocessing for Network Reconstruction: Feasibility Test and Handling Infeasibility 网络重构预处理:可行性测试与不可行性处理
International Workshop on Concurrency, Specification and Programming Pub Date : 2014-10-01 DOI: 10.3233/FI-2014-1138
Annegret K. Wagler, Jan-Thierry Wegener
{"title":"Preprocessing for Network Reconstruction: Feasibility Test and Handling Infeasibility","authors":"Annegret K. Wagler, Jan-Thierry Wegener","doi":"10.3233/FI-2014-1138","DOIUrl":"https://doi.org/10.3233/FI-2014-1138","url":null,"abstract":"The context of this work is the reconstruction of Petri net models for biological systems from experimental data. Such methods aim at generating all network alternatives fitting the given data. For a successful reconstruction, the data need to satisfy two properties: reproducibility and monotonicity. In this paper, we focus on a necessary preprocessing step for a recent reconstruction approach. We test the data for reproducibility, provide a feasibility test to detect cases where the reconstruction from the given data may fail, and provide a strategy to cope with the infeasible cases. After having performed the preprocessing step, it is guaranteed that the (given or modified) data are appropriate as input for the main reconstruction algorithm.","PeriodicalId":286395,"journal":{"name":"International Workshop on Concurrency, Specification and Programming","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116742943","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
Checking MTL Properties of Discrete Timed Automata via Bounded Model Checking 用有界模型检验检验离散时间自动机的MTL性质
International Workshop on Concurrency, Specification and Programming Pub Date : 2014-10-01 DOI: 10.3233/FI-2014-1140
B. Wozna, A. Zbrzezny
{"title":"Checking MTL Properties of Discrete Timed Automata via Bounded Model Checking","authors":"B. Wozna, A. Zbrzezny","doi":"10.3233/FI-2014-1140","DOIUrl":"https://doi.org/10.3233/FI-2014-1140","url":null,"abstract":"We investigate a SAT-based bounded model checking (BMC) method for MTL (metric temporal logic) that is interpreted over linear discrete infinite time models generated by discrete timed automata. In particular, we translate the existential model checking problem for MTL to the existential model checking problem for a variant of linear temporal logic (called HLTL), and we provide a SAT-based BMC technique for HLTL. We show how to implement the BMC technique for HLTL and discrete timed automata, and as a case study we apply the technique in the analysis of GTPP, a Generic Timed Pipeline Paradigm modelled by a network of discrete timed automata.","PeriodicalId":286395,"journal":{"name":"International Workshop on Concurrency, Specification and Programming","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133988047","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}
引用次数: 10
DNA Tiles, Wang Tiles and Combinators DNA瓷砖，王瓷砖和组合器
International Workshop on Concurrency, Specification and Programming Pub Date : 2014-04-01 DOI: 10.3233/FI-2014-1065
M. Bellia, M. Occhiuto
{"title":"DNA Tiles, Wang Tiles and Combinators","authors":"M. Bellia, M. Occhiuto","doi":"10.3233/FI-2014-1065","DOIUrl":"https://doi.org/10.3233/FI-2014-1065","url":null,"abstract":"We investigate the relation between Combinatory Logic and Wang Tiles with the aim of studying Combinators as a programming language for Self-Assembly and DNA computing. We introduce a subset of Combinatory Logic, SKI#, which is Turing Complete, includes simply Typed Combinatory Logic and contains only combinators whose computations require finitely many different redexes. Then, we define a language of Tiles, SKI-Tile, for the representation and the computation of the terms of SKI# in Self-Assembly. Moreover, we introduce a program development methodology that given any computable function, expressed in SKI#, provides a finite set of Tiles that self-assemble to return the computations of the function applications. Finally, the methodology is applied to the derivation of a SKI-Tile program that self-assemble to compute the factorial function.","PeriodicalId":286395,"journal":{"name":"International Workshop on Concurrency, Specification and Programming","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128681491","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
Discovery of Cancellation Regions within Process Mining Techniques 过程挖掘技术中抵消区域的发现
International Workshop on Concurrency, Specification and Programming Pub Date : 2014-04-01 DOI: 10.3233/FI-2014-1071
A. Kalenkova, I. Lomazova
{"title":"Discovery of Cancellation Regions within Process Mining Techniques","authors":"A. Kalenkova, I. Lomazova","doi":"10.3233/FI-2014-1071","DOIUrl":"https://doi.org/10.3233/FI-2014-1071","url":null,"abstract":"Process mining is a relatively new field of computer science which deals with process discovery and analysis based on event logs. In this work we consider the problem of discovering workflow nets with cancellation regions from event logs. Cancellations occur in the majority of real-life event logs. In spite of huge amount of process mining techniques little has been done on cancellation regions discovery. We show that the state-based region algorithm gives labeled Petri nets with overcomplicated control flow structure for logs with cancellations. We propose a novel method to discover cancellation regions from the transition systems built on event logs and show the way to construct equivalent workflow net with reset arcs to simplify the control flow structure.","PeriodicalId":286395,"journal":{"name":"International Workshop on Concurrency, Specification and Programming","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115628537","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}
引用次数: 20
Floating Channels Between Communicating Nets 通信网络之间的浮动信道
International Workshop on Concurrency, Specification and Programming Pub Date : 2014-04-01 DOI: 10.3233/FI-2014-1066
L. Czaja
{"title":"Floating Channels Between Communicating Nets","authors":"L. Czaja","doi":"10.3233/FI-2014-1066","DOIUrl":"https://doi.org/10.3233/FI-2014-1066","url":null,"abstract":"A network system is given as a set of Petri net-like structures called agents. Each agent has a singled out place interpreted as a communication port with ingoing edges labelled with send(p1,..., pn) and receive(q1,..., qm) commands, where pi, qj are names of ports of its interlocutors. Every such edge exits a transition emiting a request for send or receive message. A transmission channel between the agent and its intelocutors is established when its port holds a send or receive command, while ports of its interlocutors hold respective (matching) communication commands. This gives rise to communication between the agent and its interlocutors, after which the channel is disrupted: hence floating channels. Some behavioural properties of such network system are examined, their decision complexity, deadlock and fairness in their number.","PeriodicalId":286395,"journal":{"name":"International Workshop on Concurrency, Specification and Programming","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127177720","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
Interactive Complex Granules 相互作用复合颗粒
International Workshop on Concurrency, Specification and Programming Pub Date : 2014-04-01 DOI: 10.3233/FI-2014-1070
A. Jankowski, A. Skowron, R. Swiniarski
{"title":"Interactive Complex Granules","authors":"A. Jankowski, A. Skowron, R. Swiniarski","doi":"10.3233/FI-2014-1070","DOIUrl":"https://doi.org/10.3233/FI-2014-1070","url":null,"abstract":"Information granules (infogranules, for short) are widely discussed in the literature. In particular, let us mention here the rough granular computing approach based on the rough set approach and its combination with other approaches to soft computing. However, the issues related to interactions of infogranules with the physical world and to perception of interactions in the physical world by infogranules are not well elaborated yet. On the other hand the understanding of interactions is the critical issue of complex systems. We propose to model complex systems by interactive computational systems (ICS) created by societies of agents. Computations in ICS are based on complex granules (c-granules, for short). In the paper we concentrate on some basic issues related to interactive computations based on c-granules performed by agents in the physical world.","PeriodicalId":286395,"journal":{"name":"International Workshop on Concurrency, Specification and Programming","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126757370","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}
引用次数: 19
Analysis of Multilayer Neural Networks with Direct and Cross-Forward Connection 具有直接和交叉前向连接的多层神经网络分析
International Workshop on Concurrency, Specification and Programming Pub Date : 2014-04-01 DOI: 10.3233/FI-2014-1073
S. Placzek, B. Adhikari
{"title":"Analysis of Multilayer Neural Networks with Direct and Cross-Forward Connection","authors":"S. Placzek, B. Adhikari","doi":"10.3233/FI-2014-1073","DOIUrl":"https://doi.org/10.3233/FI-2014-1073","url":null,"abstract":"Artificial Neural Networks are of much interest for many practical reasons. As of today, they are widely implemented. Of many possible ANNs, the most widely used one is the back-propagation model with direct connection. In this model the input layer is fed with input data and each subsequent layers are fed with the output of preceding layer. This model can be extended by feeding the input data to each layer. This article argues that this new model, named Cross Forward Connection, is optimal than the widely used Direct Connection.","PeriodicalId":286395,"journal":{"name":"International Workshop on Concurrency, Specification and Programming","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127801631","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}
引用次数: 13
首页 上一页 下一页 尾页
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学术官方微信