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

Proceedings of the 29th Annual ACM Symposium on Applied Computing最新文献

筛选
英文 中文
Rethinking agribusiness models in Africa 反思非洲的农业综合企业模式
Proceedings of the 29th Annual ACM Symposium on Applied Computing Pub Date : 2014-03-24 DOI: 10.1145/2554850.2555108
Charity Wayua, Komminist Weldemariam, O. Stewart
{"title":"Rethinking agribusiness models in Africa","authors":"Charity Wayua, Komminist Weldemariam, O. Stewart","doi":"10.1145/2554850.2555108","DOIUrl":"https://doi.org/10.1145/2554850.2555108","url":null,"abstract":"This paper couples the agriculture scenario in Africa with requirement engineering method to develop a new business model that is configurable and scalable.","PeriodicalId":285655,"journal":{"name":"Proceedings of the 29th Annual ACM Symposium on Applied Computing","volume":"3 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133239288","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
Schedulability analysis support for automotive systems: from requirement to implementation 汽车系统的可调度性分析支持:从需求到实现
Proceedings of the 29th Annual ACM Symposium on Applied Computing Pub Date : 2014-03-24 DOI: 10.1145/2554850.2554929
E. Kang, Pierre-Yves Schobbens
{"title":"Schedulability analysis support for automotive systems: from requirement to implementation","authors":"E. Kang, Pierre-Yves Schobbens","doi":"10.1145/2554850.2554929","DOIUrl":"https://doi.org/10.1145/2554850.2554929","url":null,"abstract":"Modeling and analysis of precise non-functional properties, such as energy and timing constraints, is key to the correct development of automotive systems. Automotive applications development cost, in particular, is impacted by incorrect design made at the early development phases but only detected later, often after implementation. This late detection of design errors leads to additional cost. In this paper, we propose a model driven approach to perform non-functional properties verification and to enable scheduling analysis of automotive systems at the very early design level. The different phases of a design range from the requirements to a model allocated on a specific execution platform: East-adl and Marte are used together to specify the structure and energy/timing constraints of the software, as well as the hardware parts of the system. To prove the correctness of specification and perform the scheduling analysis, the semantics of the constraints is given as mapping to a formal interchange format Xfg (eXtended Function-block Graphs) language. The Xfg models are then automatically translated into priced timed automata for model checking. This later transformation is supported by a tool chain called A-BeTA. We demonstrate the applicability of our approach on the Brake-By-Wire case study.","PeriodicalId":285655,"journal":{"name":"Proceedings of the 29th Annual ACM Symposium on Applied Computing","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131695990","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}
引用次数: 24
Dealing with storage without forecasts in smart grids: problem transformation and online scheduling algorithm 智能电网无预测存储处理:问题转换与在线调度算法
Proceedings of the 29th Annual ACM Symposium on Applied Computing Pub Date : 2014-03-24 DOI: 10.1145/2554850.2554943
G. Georgiadis, M. Papatriantafilou
{"title":"Dealing with storage without forecasts in smart grids: problem transformation and online scheduling algorithm","authors":"G. Georgiadis, M. Papatriantafilou","doi":"10.1145/2554850.2554943","DOIUrl":"https://doi.org/10.1145/2554850.2554943","url":null,"abstract":"Renewable and distributed energy sources are today possible but these technologies bring benefits as well as challenges, such as their intermittent nature, that leads to utilization problems for the power grid. On the other hand, upcoming storage technologies, such as electric vehicles, hold the potential to store and utilize this intermittent supply at a later time but bring challenges of their own, for example efficient storage utilization and intermittent energy demand. In this paper we propose a novel modelling of the problem of unforecasted energy dispatch with storage as an online scheduling problem of tasks on machines, by transforming time constraints of energy requests into equivalent machine constraints as well as by modelling energy storage through the extension of existing online scheduling techniques with the concept of load credit. Based on this transformation, we also present an algorithm that dispatches load and utilizes efficiently any storage capabilities in order to mitigate the effect of unreliable or non-existent demand forecasts, and we prove that the resulting solution's competitive ratio is within a logarithmic factor of the optimal offline solution. Finally, we provide an extensive simulation study for a variety of scenarios based on data from a large network of consumers, showing that the presented algorithm is highly competitive even to methods that assume exact knowledge about the demand requests.","PeriodicalId":285655,"journal":{"name":"Proceedings of the 29th Annual ACM Symposium on Applied Computing","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133884013","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
A new local feature extraction approach for content-based 3D medical model retrieval using shape descriptor 一种基于内容的三维医学模型局部特征提取方法
Proceedings of the 29th Annual ACM Symposium on Applied Computing Pub Date : 2014-03-24 DOI: 10.1145/2554850.2554873
L. Bergamasco, Fátima L. S. Nunes
{"title":"A new local feature extraction approach for content-based 3D medical model retrieval using shape descriptor","authors":"L. Bergamasco, Fátima L. S. Nunes","doi":"10.1145/2554850.2554873","DOIUrl":"https://doi.org/10.1145/2554850.2554873","url":null,"abstract":"Three-dimensional models are being extensively used in our society. Global shape descriptors are more frequently used in the Content-Based Image Retrieval (CBIR) context due to their robustness and easy implementation, but this kind of descriptor is not adequate for retrieval models with specific characteristics. In this paper a local descriptor is proposed, which analyzes the 3D model shape in different locations of the object in order to increase the retrieval accuracy. Our method is compared with a global descriptor, Distance Histogram, using generic models and specific models which have shape deformations in specific areas. Results show that our method presented higher performance in both contexts.","PeriodicalId":285655,"journal":{"name":"Proceedings of the 29th Annual ACM Symposium on Applied Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127693257","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
Execution support for agenda-driven case management 为议程驱动的案例管理提供执行支持
Proceedings of the 29th Annual ACM Symposium on Applied Computing Pub Date : 2014-03-24 DOI: 10.1145/2554850.2554945
Marian Benner-Wickner, Matthias Book, Tobias Brückmann, V. Gruhn
{"title":"Execution support for agenda-driven case management","authors":"Marian Benner-Wickner, Matthias Book, Tobias Brückmann, V. Gruhn","doi":"10.1145/2554850.2554945","DOIUrl":"https://doi.org/10.1145/2554850.2554945","url":null,"abstract":"In recent years, mature workflow management technology has become available to support enterprises in engineering and executing well-known business processes. But in the domain of case management, no strict process can be prescribed for tasks due to their high variability. Rather, these tasks require the expertise of case managers who work with information from many different sources. We believe that such processes will benefit from an agenda-driven case management approach. However, implementing an information system supporting such an approach is challenging since it impacts and relies on many aspects of an enterprise's way of handling heterogeneous data. In this paper, we discuss requirements and design decisions arising from the adCM concept and present the results in implementing a corresponding support system.","PeriodicalId":285655,"journal":{"name":"Proceedings of the 29th Annual ACM Symposium on Applied Computing","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127694945","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
Cyber-secure communication architecture for active power distribution networks 有功配电网的网络安全通信体系结构
Proceedings of the 29th Annual ACM Symposium on Applied Computing Pub Date : 2014-03-24 DOI: 10.1145/2554850.2555082
T. Tesfay, J. Hubaux, J. Boudec, P. Oechslin
{"title":"Cyber-secure communication architecture for active power distribution networks","authors":"T. Tesfay, J. Hubaux, J. Boudec, P. Oechslin","doi":"10.1145/2554850.2555082","DOIUrl":"https://doi.org/10.1145/2554850.2555082","url":null,"abstract":"Active power distribution networks require sophisticated monitoring and control strategies for efficient energy management and automatic adaptive reconfiguration of the power infrastructure. Such requirements are realised by deploying a large number of various electronic automation and communication field devices, such as Phasor Measurement Units (PMUs) or Intelligent Electronic Devices (IEDs), and a reliable two-way communication infrastructure that facilitates transfer of sensor data and control signals. In this paper, we perform a detailed threat analysis in a typical active distribution network's automation system. We also propose mechanisms by which we can design a secure and reliable communication network for an active distribution network that is resilient to insider and outsider malicious attacks, natural disasters, and other unintended failure. The proposed security solution also guarantees that an attacker is not able to install a rogue field device by exploiting an emergency situation during islanding.","PeriodicalId":285655,"journal":{"name":"Proceedings of the 29th Annual ACM Symposium on Applied Computing","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127695333","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
Reachability vectors: features for link-based similarity measures 可达性向量:基于链接的相似性度量的特征
Proceedings of the 29th Annual ACM Symposium on Applied Computing Pub Date : 2014-03-24 DOI: 10.1145/2554850.2554906
Seok-Ho Yoon, Ji-Soo Kim, Jiwoon Ha, Sang-Wook Kim, Minsoo Ryu, Ho‐Jin Choi
{"title":"Reachability vectors: features for link-based similarity measures","authors":"Seok-Ho Yoon, Ji-Soo Kim, Jiwoon Ha, Sang-Wook Kim, Minsoo Ryu, Ho‐Jin Choi","doi":"10.1145/2554850.2554906","DOIUrl":"https://doi.org/10.1145/2554850.2554906","url":null,"abstract":"In this paper, we present a novel approach to computing link-based similarities among objects accurately. We discuss the problems with previous link-based similarity measures and propose a novel approach that does not suffer from these problems. In the proposed approach, each target object is represented by a vector. The elements of the vector denote all the objects in the given data set, and the value of each element indicates the weight of the corresponding object with respect to the target object. As for this weight value, we propose to utilize the probability of reaching from the target object to the specific object, computed using the \"Random Walk with Restart\" strategy. Then, we define the similarity between two objects as the cosine similarity of the two vectors representing the two objects. We also evaluate the performance of the proposed approach in comparison with existing link-based measures using two kinds of data sets. Our experimental results show that the proposed approach significantly outperform the existing measures.","PeriodicalId":285655,"journal":{"name":"Proceedings of the 29th Annual ACM Symposium on Applied Computing","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121162023","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
Complexity checking of ARM programs, by deduction ARM程序的复杂度检查，通过演绎
Proceedings of the 29th Annual ACM Symposium on Applied Computing Pub Date : 2014-03-24 DOI: 10.1145/2554850.2555012
Mário Pereira, S. Sousa
{"title":"Complexity checking of ARM programs, by deduction","authors":"Mário Pereira, S. Sousa","doi":"10.1145/2554850.2555012","DOIUrl":"https://doi.org/10.1145/2554850.2555012","url":null,"abstract":"In this paper we address two main questions: how to reason about the correctness of unstructured programs (particularly programs written in ARM Assembly) and how to use a proof-based system to check computational complexity of such programs. We approach the correctness issue by applying a flow sequentialization methodology and a formalized semantics of ARM instructions. An annotated ARM program is turned into a set of purely sequential programs, then each instruction is mapped into the corresponding formalized opcodes and finally Why3's VCGen is employed to generate proper Verification Conditions. Regarding complexity checking, we propose a methodology, based on the sequentialization process, by encoding instructions CPU-cost into their semantics and checking the program's calculated cost against user-supplied cost information (cost properties will be treated as normal functional annotations). Along with the formalization of correctness and complexity reasoning techniques, a prototype tool has been implemented and used to verify both the correctness and complexity of some practical examples.","PeriodicalId":285655,"journal":{"name":"Proceedings of the 29th Annual ACM Symposium on Applied Computing","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129218023","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
Splitting approaches for context-aware recommendation: an empirical study 上下文感知推荐的分离方法:一项实证研究
Proceedings of the 29th Annual ACM Symposium on Applied Computing Pub Date : 2014-03-24 DOI: 10.1145/2554850.2554989
Yong Zheng, R. Burke, B. Mobasher
{"title":"Splitting approaches for context-aware recommendation: an empirical study","authors":"Yong Zheng, R. Burke, B. Mobasher","doi":"10.1145/2554850.2554989","DOIUrl":"https://doi.org/10.1145/2554850.2554989","url":null,"abstract":"User and item splitting are well-known approaches to context-aware recommendation. To perform item splitting, multiple copies of an item are created based on the contexts in which it has been rated. User splitting performs a similar treatment with respect to users. The combination of user and item splitting: UI splitting, splits both users and items in the data set to boost context-aware recommendations. In this paper, we perform an empirical comparison of these three context-aware splitting approaches (CASA) on multiple data sets, and we also compare them with other popular context-aware collaborative filtering (CACF) algorithms. To evaluate those algorithms, we propose new evaluation metrics specific to contextual recommendation. The experiments reveal that CASA typically outperform other popular CACF algorithms, but there is no clear winner among the three splitting approaches. However, we do find some underlying patterns or clues for the application of CASA.","PeriodicalId":285655,"journal":{"name":"Proceedings of the 29th Annual ACM Symposium on Applied Computing","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128582631","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}
引用次数: 66
Input-output conformance testing based on featured transition systems 基于特征转换系统的输入输出一致性测试
Proceedings of the 29th Annual ACM Symposium on Applied Computing Pub Date : 2014-03-24 DOI: 10.1145/2554850.2554949
Harsh Beohar, M. Mousavi
{"title":"Input-output conformance testing based on featured transition systems","authors":"Harsh Beohar, M. Mousavi","doi":"10.1145/2554850.2554949","DOIUrl":"https://doi.org/10.1145/2554850.2554949","url":null,"abstract":"We extend the theory of input-output conformance testing to the setting of software product lines. In particular, we allow for input-output featured transition systems to be used as the basis for generating test suites and test cases. We introduce refinement operators both at the level of models and at the level of test suites that allow for projecting them into a specific product configuration (or a product sub-line). We show that the two sorts of refinement are consistent and lead to the same set of test-cases.","PeriodicalId":285655,"journal":{"name":"Proceedings of the 29th Annual ACM Symposium on Applied Computing","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115505542","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}
引用次数: 18
首页 上一页
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学术官方微信