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

Proceedings of the 2014 International C* Conference on Computer Science & Software Engineering最新文献

筛选
英文 中文
An Alternative View of Fairness in Petri Nets Petri网公平性的另一种观点
Proceedings of the 2014 International C* Conference on Computer Science & Software Engineering Pub Date : 2014-08-03 DOI: 10.1145/2641483.2641515
Martin Ibl
{"title":"An Alternative View of Fairness in Petri Nets","authors":"Martin Ibl","doi":"10.1145/2641483.2641515","DOIUrl":"https://doi.org/10.1145/2641483.2641515","url":null,"abstract":"In modelling and analysis of concurrent systems is usually placed the main emphasis on their accuracy and validity, i.e. the model meets the formal specification and also modelled the relevant facts. Moreover, in recent years in various fields, the importance of the concept of fairness starts to develop, which covers such requirements on system/model, such as uniformity of resource usage, fair queuing policy, the problem of starvation and many others. The aim of this work is to define a method of calculating the uniformity of the distribution of specific system states that can be used to investigate the uniformity of the workload of individual entities / elements of the system. The method is based on modelling by classical Place/Transition Petri nets and measuring the entropy of subsets of specific markings in the reachability graph of the Petri net. The presented method is an alternative view on the fairness of the already defined fairness which in the theory of Petri nets deals with transitions.","PeriodicalId":438325,"journal":{"name":"Proceedings of the 2014 International C* Conference on Computer Science & Software Engineering","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122582636","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
FDKeeper: A Quick and Open Failure Detector for Cloud Computing System FDKeeper:一个快速开放的云计算系统故障检测器
Proceedings of the 2014 International C* Conference on Computer Science & Software Engineering Pub Date : 2014-08-03 DOI: 10.1145/2641483.2641539
Feng-ling Wang, Hai Jin, Deqing Zou, Weizhong Qiang
{"title":"FDKeeper: A Quick and Open Failure Detector for Cloud Computing System","authors":"Feng-ling Wang, Hai Jin, Deqing Zou, Weizhong Qiang","doi":"10.1145/2641483.2641539","DOIUrl":"https://doi.org/10.1145/2641483.2641539","url":null,"abstract":"Failure detection is a basic service for building dependable cloud computing system. Unfortunately, the natural complexity of cloud computing system makes failure detectors much harder to build. In this work, we present the design, implementation, and evaluation of FDKeeper, a failure detector for cloud computing system with several features. First, FDKeeper is a failure detector with short detection time, high accuracy and low disruption. Second, FDKeeper is scalable, with communication cost and number of manager nodes scaling linearly with the number of physical nodes, which makes FDKeeper very suitable for large-scale cloud computing system. Third, FDKeeper provides a protocol for failure detection among many cloud computing systems. FDKeeper achieves these features by providing a layered failure detection mechanism, a cluster architecture and a cloud failure detection protocol. The evaluation results show that the detection time for app/kernel layer is less than 600 milliseconds, and 2 seconds for vmm/hardware layer, the accuracy is 100% for all layers, and the disruption is less than 0.27 times per year. As for scalability, the theoretical analysis and experimental results show that there is a linear relationship between the number of nodes used to accomplish the failure detection and the number of nodes in the computing systems, and the growth factor is less than 0.001. Thus we believe FDKeeper is the first failure detector that is fast, reliable, scalable, and viable. As such, it could change the way that a dependable cloud computing system is built.","PeriodicalId":438325,"journal":{"name":"Proceedings of the 2014 International C* Conference on Computer Science & Software Engineering","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125630294","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
Verification and Code Generation for Timed Transitions in pCharts pCharts中定时转换的验证和代码生成
Proceedings of the 2014 International C* Conference on Computer Science & Software Engineering Pub Date : 2014-08-03 DOI: 10.1145/2641483.2641522
Bojan Nokovic, E. Sekerinski
{"title":"Verification and Code Generation for Timed Transitions in pCharts","authors":"Bojan Nokovic, E. Sekerinski","doi":"10.1145/2641483.2641522","DOIUrl":"https://doi.org/10.1145/2641483.2641522","url":null,"abstract":"This paper describes timed transition in pCharts, a variation of statecharts extended with probabilistic transitions, costs/rewards, and state invariants. Timed transitions with nondeterministic and stochastic timing can be used for the specification and analysis of real-time systems. We present a translation scheme for timed transition of pCharts into probabilistic timed automata (PTA) and executable C code, as implemented in our tool pState. To illustrate the development process, we analyze the power consumption of a radio-frequency identification (RFID) tag and generate code for the PIC micro-controller.","PeriodicalId":438325,"journal":{"name":"Proceedings of the 2014 International C* Conference on Computer Science & Software Engineering","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131408191","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}
引用次数: 11
Application of PR Techniques to Mail Sorting in China 公关技术在中国邮件分拣中的应用
Proceedings of the 2014 International C* Conference on Computer Science & Software Engineering Pub Date : 2014-08-03 DOI: 10.1145/2641483.2641536
Li Liu, Shujing Lu, Yue Lu, C. Suen
{"title":"Application of PR Techniques to Mail Sorting in China","authors":"Li Liu, Shujing Lu, Yue Lu, C. Suen","doi":"10.1145/2641483.2641536","DOIUrl":"https://doi.org/10.1145/2641483.2641536","url":null,"abstract":"Mail sorting machines play an important role in postal automation. In this paper, we give a brief overview of mail sorting machines in China Post from a pattern recognition point of view. OCR techniques such as postcode recognition and address recognition are essential for mail sorting machines, which are considered as class imbalance problems in our study. In addition to OCR that mainly focuses on the characters in the image, some image-level features are exploited for near-duplicate envelope image matching, which is helpful in tracking pieces of mail in the network environment.","PeriodicalId":438325,"journal":{"name":"Proceedings of the 2014 International C* Conference on Computer Science & Software Engineering","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127009279","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
Toward Automated MAC Spoofer Investigations 迈向自动MAC欺骗调查
Proceedings of the 2014 International C* Conference on Computer Science & Software Engineering Pub Date : 2014-08-03 DOI: 10.1145/2641483.2641540
Serguei A. Mokhov, Michael J. Assels, J. Paquet, M. Debbabi
{"title":"Toward Automated MAC Spoofer Investigations","authors":"Serguei A. Mokhov, Michael J. Assels, J. Paquet, M. Debbabi","doi":"10.1145/2641483.2641540","DOIUrl":"https://doi.org/10.1145/2641483.2641540","url":null,"abstract":"We automate live and dead forensic evidence gathering for MAC spoofer investigations and formalize its encoding in Forensic Lucid for subsequent reasoning. The monitoring covers a Faculty's network focusing on 1000 analyst-managed clients. We describe initial operational deployment of the MAC Spoofer Analyzer's evidence gathering components. We also highlight immediate and future concerns regarding the automation of the reasoning aspects behind the analyzer to aid network system administrators in their daily network security monitoring, management, and maintenance activities.","PeriodicalId":438325,"journal":{"name":"Proceedings of the 2014 International C* Conference on Computer Science & Software Engineering","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133667083","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
Finding Periodic Regularities on Sequential Data: Converging, Diverging and Cyclic Patterns 寻找序列数据的周期规律:收敛、发散和循环模式
Proceedings of the 2014 International C* Conference on Computer Science & Software Engineering Pub Date : 2014-08-03 DOI: 10.1145/2641483.2641519
António Barreto, C. Antunes
{"title":"Finding Periodic Regularities on Sequential Data: Converging, Diverging and Cyclic Patterns","authors":"António Barreto, C. Antunes","doi":"10.1145/2641483.2641519","DOIUrl":"https://doi.org/10.1145/2641483.2641519","url":null,"abstract":"Temporal information has become one of the most important features when it comes to data analytics. The need to understand the dynamics and evolutionary behaviors of different domains has driven data analytics' processes to make use of the temporal information associated with the data. Therefore, several approaches have been proposed, in the field of Temporal Pattern Mining, in order to use this temporal information to disclose temporal trends that could help in the decision making process. However, there are still significant limitations regarding both the quality of the disclosed information or the efficiency of the processes. In this work we propose a new constraint-based sequential mining method, called ConstraintPrefixSpan, for mining three types of periodic regularities: Cyclic, Converging and Diverging. Our experiments on two different datasets show both the quality of patterns found and the efficiency and flexibility of or algorithm to deal with multiple types of regularities.","PeriodicalId":438325,"journal":{"name":"Proceedings of the 2014 International C* Conference on Computer Science & Software Engineering","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130430258","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
Exploring the diameter and broadcast time of general Knödel graphs using extensive simulations 利用广泛的模拟探索一般Knödel图形的直径和广播时间
Proceedings of the 2014 International C* Conference on Computer Science & Software Engineering Pub Date : 2014-08-03 DOI: 10.1145/2641483.2641531
Hovhannes A. Harutyunyan, Gul B. Oad
{"title":"Exploring the diameter and broadcast time of general Knödel graphs using extensive simulations","authors":"Hovhannes A. Harutyunyan, Gul B. Oad","doi":"10.1145/2641483.2641531","DOIUrl":"https://doi.org/10.1145/2641483.2641531","url":null,"abstract":"Efficient dissemination of information remains a central challenge for all types of networks. There are two ways to handle this issue. One way is to compress the amount of data being transferred and the second way is to minimize the delay of information distribution. Well-received approaches used in the second way either design efficient algorithms or implement reliable network architectures with optimal dissemination time. Among the well-known network architectures, the Knödel graph can be considered a suitable candidate for the problem of information dissemination. The Knödel graph Wd,n is a regular graph, of an even order n and degree d, 1 ≤ d ≤ ⌊log2 n⌋. The Knödel graph was introduced by W. Knödel almost four decades ago as network architecture with good properties in terms of broadcasting and gossiping in interconnected networks. Although the Knödel graph has a highly symmetric structure, its diameter is only known for, Wd2d. Recently, the general upper and lower bounds on diameter and broadcast time of the Knödel graph have been presented. In this paper, our motivation is to explore the communication properties of Knödel graph in terms of the diameter, the number of vertices at a particular distance and the broadcast time. Experimentally, we obtain the following results; (a) the diameter of some specific Knödel graphs, (b) the propositions on the number of vertices at a particular distance, and (c) the upper bound on the broadcast time of Knödel graph. We also construct a new graph, denoted as HWd2d by connecting Knödel graph Wd-1,2d-1 to hypercube Hd-1 and experimentally show that HWd2d have even a smaller diameter than Knödel graph Wd2d.","PeriodicalId":438325,"journal":{"name":"Proceedings of the 2014 International C* Conference on Computer Science & Software Engineering","volume":"197 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122681211","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
Identifying Questions & Requests in Conversation 识别对话中的问题和请求
Proceedings of the 2014 International C* Conference on Computer Science & Software Engineering Pub Date : 2014-08-03 DOI: 10.1145/2641483.2641534
Kevin Quinn, Osmar R Zaiane
{"title":"Identifying Questions & Requests in Conversation","authors":"Kevin Quinn, Osmar R Zaiane","doi":"10.1145/2641483.2641534","DOIUrl":"https://doi.org/10.1145/2641483.2641534","url":null,"abstract":"In building an automated conversation agent, that attempts to converse with a human with as human-like as possible manner, we require the agent to identify which dialogue act, or class, the sentence belongs to. Determining the sentence class of a spoken phrase is helpful in building an intelligent companion, because without it the response may seem out of place. In written language, sentences can be classified into three classes: Declarative, Interrogative, and Imperative. These classes indicate which dialogue act the sentence belongs to. What our system does is take spoken text, which contains no punctuation, and classify the text into the three aforementioned classes. In conversation, the type of spoken text can indicate the type of required response. Our system is able to classify spoken text with 82% accuracy on our semi-automatically constructed dataset.","PeriodicalId":438325,"journal":{"name":"Proceedings of the 2014 International C* Conference on Computer Science & Software Engineering","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128185366","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}
引用次数: 5
Proposed architecture and algorithm for academic personnel evaluation and decision support making 提出了学术人员评价与决策支持的体系结构和算法
Proceedings of the 2014 International C* Conference on Computer Science & Software Engineering Pub Date : 2014-08-03 DOI: 10.1145/2641483.2641518
D. Tomtsis, Sotirios Kontogiannis, G. Kokkonis, I. Kazanidis, S. Valsamidis
{"title":"Proposed architecture and algorithm for academic personnel evaluation and decision support making","authors":"D. Tomtsis, Sotirios Kontogiannis, G. Kokkonis, I. Kazanidis, S. Valsamidis","doi":"10.1145/2641483.2641518","DOIUrl":"https://doi.org/10.1145/2641483.2641518","url":null,"abstract":"This paper proposes a new methodology to perform personnel evaluation called Personnel Evaluation methodology. This methodology is based on a focused pair wise AHP process assisted by a proposed Performance Evaluation Superpositioning algorithm (PES-algo). That is, a modification of superpositioning algorithm clustering process (S-algo) [7, 8, 2]. Such process is used by Learning Management Systems (LMS) for course content evaluation. It also presents a decision support test bed system (Academic Evaluation System - AES), which is used to perform the PE-methodology. AES system is put to test at authors' academic environment and preliminary outcomes of personnel evaluation results based on PE-methodology are discussed.","PeriodicalId":438325,"journal":{"name":"Proceedings of the 2014 International C* Conference on Computer Science & Software Engineering","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126586382","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
Cloud Business Intelligence for Virtual Organizations 虚拟组织的云商业智能
Proceedings of the 2014 International C* Conference on Computer Science & Software Engineering Pub Date : 2014-08-03 DOI: 10.1145/2641483.2641520
J. Ricardo, Jorge Bernardino, A. Almeida
{"title":"Cloud Business Intelligence for Virtual Organizations","authors":"J. Ricardo, Jorge Bernardino, A. Almeida","doi":"10.1145/2641483.2641520","DOIUrl":"https://doi.org/10.1145/2641483.2641520","url":null,"abstract":"The evolution of business processes and the globalization of virtual organizations, stimulates the need to have available at any time, in any place, tools to produce information for decision support in order to increase their competitive advantage. In this context, Cloud Business Intelligence emerges as a paradigm of almost vital importance providing business analytics to organizations, reducing costs and increasing profits. In the context of virtual organizations are examined three of the most popular open source platforms for Cloud Business Intelligence market and selected the one that best suits the needs of virtual organizations. This paper evaluated SpagoBI, JaspersoftBI, and PentahoBI Cloud Business Intelligence platforms analyzing the features that best fit the needs of virtual organizations.","PeriodicalId":438325,"journal":{"name":"Proceedings of the 2014 International C* Conference on Computer Science & Software Engineering","volume":"192 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115118639","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
首页 上一页 下一页 尾页
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学术官方微信
小红书