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

International Conference on Complex Information Systems最新文献

筛选
英文 中文
A Social Inspired Broker for M2M Protocols 面向M2M协议的社会激励代理
International Conference on Complex Information Systems Pub Date : 2019-05-02 DOI: 10.5220/0007765101010105
V. Carchiolo, A. Longheu, M. Malgeri, G. Mangioni
{"title":"A Social Inspired Broker for M2M Protocols","authors":"V. Carchiolo, A. Longheu, M. Malgeri, G. Mangioni","doi":"10.5220/0007765101010105","DOIUrl":"https://doi.org/10.5220/0007765101010105","url":null,"abstract":"Internet of things can be viewed as the shifting from a network of computers to a network of things.To support M2M communication, several protocols have been developed; many of them are endorsed by client-broker model with a publish-subscribe interaction mechanism. In this paper we introduce a multi broker solution where the network of brokers is inspired by social relationships. This allow data sharing among several IoT systems, leads to a reliable and effective query forwarding algorithm and the small world effect coming from mimic humans relations guarantees fast responses and good query recall.","PeriodicalId":414016,"journal":{"name":"International Conference on Complex Information Systems","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130576458","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}
引用次数: 3
An Analysis of Three Legal Citation Networks Derived from Austrian Supreme Court Decisions 奥地利最高法院判决衍生的三种法律引文网络分析
International Conference on Complex Information Systems Pub Date : 2019-05-02 DOI: 10.5220/0007749900850092
Markus Moser, Mark Strembeck
{"title":"An Analysis of Three Legal Citation Networks Derived from Austrian Supreme Court Decisions","authors":"Markus Moser, Mark Strembeck","doi":"10.5220/0007749900850092","DOIUrl":"https://doi.org/10.5220/0007749900850092","url":null,"abstract":"In this paper, we present a case study on the structural properties of three citations networks derived from \u0000Austrian Supreme Court decisions. In particular, we analyzed 250.984 Supreme Court decisions ranging from \u00001922 to 2017. As part of our case study, we analyzed the degree distributions, the structural properties of \u0000prominent court decisions, as well as changes in the frequency of legal citations over time.","PeriodicalId":414016,"journal":{"name":"International Conference on Complex Information Systems","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124235315","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}
引用次数: 2
How Complex is to Solve a Hard Problem with Accepting Splicing Systems 解决一个接受拼接系统的难题有多复杂
International Conference on Complex Information Systems Pub Date : 2019-05-02 DOI: 10.5220/0007715900270035
V. Mitrana, A. Paun, M. Păun
{"title":"How Complex is to Solve a Hard Problem with Accepting Splicing Systems","authors":"V. Mitrana, A. Paun, M. Păun","doi":"10.5220/0007715900270035","DOIUrl":"https://doi.org/10.5220/0007715900270035","url":null,"abstract":"We define a variant of accepting splicing system that can be used as a problem solver. A condition for halting the computation on a given input as well as a condition for making a decision as soon as the computation has stopped is considered. An algorithm based on this accepting splicing system that solves a well-known NP-complete problem, namely the 3-colorability problem is presented. We discuss an efficient solution in terms of running time and additional resources (axioms, supplementary symbols, number of splicing rules. More precisely, for a given graph with n vertices and m edges, our solution runs in O(nm) time, and needs O(mn2) other resources. Two variants of this algorithm of a reduced time complexity at an exponential increase of the other resources are finally discussed.","PeriodicalId":414016,"journal":{"name":"International Conference on Complex Information Systems","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126648273","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
The Fuzzy Mortality Model based on Quaternion Theory 基于四元数理论的模糊死亡率模型
International Conference on Complex Information Systems Pub Date : 2018-05-07 DOI: 10.5220/0006813201570165
A. Szymanski, Agnieszka Rossa
{"title":"The Fuzzy Mortality Model based on Quaternion Theory","authors":"A. Szymanski, Agnieszka Rossa","doi":"10.5220/0006813201570165","DOIUrl":"https://doi.org/10.5220/0006813201570165","url":null,"abstract":"The mortality models are of fundamental importance in many areas, such as the pension plans, the care of the elderly, the provision of health service, etc. In the paper, we propose a new class of mortality models based on a fuzzy version of the well-known Lee–Carter model (1992). Theoretical backgrounds are based on the algebraic approach to fuzzy numbers (Ishikawa, 1997, Kosiński, Prokopowicz, Ślęzak, 2003, Rossa, Socha, Szymański, 2015, Szymański, Rossa, 2014). The essential idea in our approach focuses on representing a membership function of a fuzzy number as an element of quaternion algebra. If the membership function μ(z) of a fuzzy number is strictly monotonic on two disjoint intervals, then it can be decomposed into strictly decreasing and strictly increasing functions Φ(z), Ψ(z), and the inverse functions f(u)=Φ−1(u) and g(u)=Ψ−1(u), u ∈ [0, 1] can be found. Thus, the membership function μ(z) can be represented by means of a complex-valued function f(u) + ig(u), where i is an imaginary unit. Then the pair (f, g) is a quaternion. The quaternion-valued, square integrable functions form a tool for constructing the new class of mortality models.","PeriodicalId":414016,"journal":{"name":"International Conference on Complex Information Systems","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128351652","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
A Novel Algorithm for Bi-Level Image Coding and Lossless Compression based on Virtual Ant Colonies 基于虚拟蚁群的双级图像编码和无损压缩新算法
International Conference on Complex Information Systems Pub Date : 2018-05-06 DOI: 10.5220/0006688400720078
Matthew Mouring, Khaldoon Dhou, M. Hadzikadic
{"title":"A Novel Algorithm for Bi-Level Image Coding and Lossless Compression based on Virtual Ant Colonies","authors":"Matthew Mouring, Khaldoon Dhou, M. Hadzikadic","doi":"10.5220/0006688400720078","DOIUrl":"https://doi.org/10.5220/0006688400720078","url":null,"abstract":"Ant colonies emerged as a topic of research and they are applied in different fields. In this paper, we develop an algorithm based on the concept of ant colonies and we utilize it for image coding and compression. To apply the algorithm on images, we represent each image as a virtual world which contains food and routes for ants to walk and search for it. Ants in the algorithm have certain type of movements depending on when and where they find food. When an ant finds food, it releases a pheromone, which allows other ants to follow the source of food. This increases the likelihood that food areas are covered. The chemical evaporates after a certain amount of time, which in turn helps ants move to cover another food area. In addition to the pheromone, ants use proximity awareness to detect other ants in the surrounding, which can help ants cover more food areas. When an ant finds food, it moves to that location and the movement and coordinates are recorded. If there is no food, an ant moves randomly to a location in the neighborhood and starts searching. We ran our algorithm on a set of 8 images and the empirical results showed that we could outperform many techniques in image compression including JBIG2.","PeriodicalId":414016,"journal":{"name":"International Conference on Complex Information Systems","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128287509","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}
引用次数: 17
Elephants, Donkeys, and Colonel Blotto 大象、驴子和布洛托上校
International Conference on Complex Information Systems Pub Date : 2018-05-01 DOI: 10.5220/0006761601130119
Ivan P. Yamshchikov, Sharwin Rezagholi
{"title":"Elephants, Donkeys, and Colonel Blotto","authors":"Ivan P. Yamshchikov, Sharwin Rezagholi","doi":"10.5220/0006761601130119","DOIUrl":"https://doi.org/10.5220/0006761601130119","url":null,"abstract":"This paper employs a novel method for the empirical analysis of political discourse and develops a model that demonstrates dynamics comparable with the empirical data. Applying a set of binary text classifiers based on convolutional neural networks, we label statements in the political programs of the Democratic and the Republican Party in the United States. Extending the framework of the Colonel Blotto game by a stochastic activation structure, we show that, under a simple learning rule, the simulated game exhibits dynamics that resemble the empirical data.","PeriodicalId":414016,"journal":{"name":"International Conference on Complex Information Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127569105","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
Using Tag based Semantic Annotation to Empower Client and REST Service Interaction 使用基于标记的语义注释来增强客户端和REST服务交互
International Conference on Complex Information Systems Pub Date : 2018-04-21 DOI: 10.5220/0006682500640071
Cong Peng, G. Bai
{"title":"Using Tag based Semantic Annotation to Empower Client and REST Service Interaction","authors":"Cong Peng, G. Bai","doi":"10.5220/0006682500640071","DOIUrl":"https://doi.org/10.5220/0006682500640071","url":null,"abstract":"The utilization of Web services is becoming a human labor consuming work as the rapid growth of Web. The semantic annotated service description can support more automatic ways on tasks such as serv ...","PeriodicalId":414016,"journal":{"name":"International Conference on Complex Information Systems","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124734242","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
Bitcoin Currency Fluctuation 比特币币值波动
International Conference on Complex Information Systems Pub Date : 2018-03-20 DOI: 10.5220/0006794000310041
Marius Kinderis, Marija Bezbradica, M. Crane
{"title":"Bitcoin Currency Fluctuation","authors":"Marius Kinderis, Marija Bezbradica, M. Crane","doi":"10.5220/0006794000310041","DOIUrl":"https://doi.org/10.5220/0006794000310041","url":null,"abstract":"Predicting currency prices remains a difficult endeavour. Investors are continually seeking new ways to extract \u0000meaningful information about the future direction of price changes. Recently, cryptocurrencies have attracted \u0000huge attention due to their unique way of transferring value as well as its value as a hedge. A method proposed \u0000in this project involves using data mining techniques: mining text documents such as news articles and tweets \u0000try to infer the relationship between information contained in such items and cryptocurrency price direction. \u0000The Long Short-Term Memory Recurrent Neural Network (LSTM RNN) assists in creating a hybrid model \u0000which comprises of sentiment analysis techniques, as well as a predictive machine learning model. The success \u0000of the model was evaluated within the context of predicting the direction of Bitcoin price changes. Findings \u0000reported here reveal that our system yields more accurate and real-time predictions of Bitcoin price fluctuations \u0000when compared to other existing models in the market.","PeriodicalId":414016,"journal":{"name":"International Conference on Complex Information Systems","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130759737","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
Stock Market Prediction based on Deep Long Short Term Memory Neural Network 基于深度长短期记忆神经网络的股票市场预测
International Conference on Complex Information Systems Pub Date : 2018-03-20 DOI: 10.5220/0006749901020108
X. Pang, Yanqiang Zhou, Pan Wang, Weiwei Lin, Victor Chang
{"title":"Stock Market Prediction based on Deep Long Short Term Memory Neural Network","authors":"X. Pang, Yanqiang Zhou, Pan Wang, Weiwei Lin, Victor Chang","doi":"10.5220/0006749901020108","DOIUrl":"https://doi.org/10.5220/0006749901020108","url":null,"abstract":"To study the influence of market characteristics on stock prices, traditional neural network algorithm may also fail to predict the stock market precisely, since the initial weight of the random selection problem can be easily prone to incorrect predictions. Based on the idea of word vector in deep learning, we demonstrate the concept of stock vector. The input is no longer a single index or single stock index, but multi-stock high-dimensional historical data. We propose the deep long-short term memory neural network (LSMN) with embedded layer to predict the stock market. In this model, we use the embedded layer to vectorize the data, in a bid to forecast the stock via long-short term memory neural network. The experimental results show that the deep long short term memory neural network with embedded layer is state-of-the-art in developing countries. Specifically, the accuracy of this model is 57.2% for the Shanghai A-shares composite index. Furthermore, this is 52.4% for individual stocks.","PeriodicalId":414016,"journal":{"name":"International Conference on Complex Information Systems","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122733893","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}
引用次数: 17
Proposing a Holistic Framework for the Assessment and Management of Manufacturing Complexity through Data-centric and Human-centric Approaches 通过以数据为中心和以人为中心的方法提出制造复杂性评估和管理的整体框架
International Conference on Complex Information Systems Pub Date : 2018-03-01 DOI: 10.5220/0006692000860093
Dominik Kohr, Mussawar Ahmad, Bugra Alkan, Malarvizhi Kaniappan Chinnathai, L. Budde, D. Vera, T. Friedli, R. Harrison
{"title":"Proposing a Holistic Framework for the Assessment and Management of Manufacturing Complexity through Data-centric and Human-centric Approaches","authors":"Dominik Kohr, Mussawar Ahmad, Bugra Alkan, Malarvizhi Kaniappan Chinnathai, L. Budde, D. Vera, T. Friedli, R. Harrison","doi":"10.5220/0006692000860093","DOIUrl":"https://doi.org/10.5220/0006692000860093","url":null,"abstract":"A multiplicity of factors including technological innovations, dynamic operating environments, and globalisation are all believed to contribute towards the ever-increasing complexity of manufacturing systems. Although complexity is necessary to meet functional needs, it is important to assess and monitor it to reduce life-cycle costs by simplifying designs and minimising failure modes. This research paper identifies and describes two key industrially relevant methods for assessing complexity, namely a data-centric approach using the information theoretic method and a human-centric approach based on surveys and questionnaires. The paper goes on to describe the benefits and shortcomings of each and contributes to the body of knowledge by proposing a holistic framework that combines both assessment methods.","PeriodicalId":414016,"journal":{"name":"International Conference on Complex Information Systems","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124372296","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}
引用次数: 6
首页 上一页 下一页 尾页
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学术官方微信