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

International Conference on Frontiers of Information Technology最新文献

筛选
英文 中文
SDNs, Clouds, and Big Data: New Opportunities sdn、云和大数据:新机遇
International Conference on Frontiers of Information Technology Pub Date : 2014-12-17 DOI: 10.1109/FIT.2014.14
Junaid Qadir, Nauman Ahad, Erum Mushtaq, Muhammad Bilal
{"title":"SDNs, Clouds, and Big Data: New Opportunities","authors":"Junaid Qadir, Nauman Ahad, Erum Mushtaq, Muhammad Bilal","doi":"10.1109/FIT.2014.14","DOIUrl":"https://doi.org/10.1109/FIT.2014.14","url":null,"abstract":"We are at the cusp of a technological revolution driven mainly by advances in hardware technology, network architectural support, and the ability to process big data. The hardware industry, driven by Moore's law, continues to provide steadily increasing computing capability with diminishing costs. With the support of hardware advances, platforms for distributed storage and processing of big data, such as Apache Hadoop, provide the ability to scalably and reliably process massive amounts of data using a cluster of commodity servers. In parallel, a revolution is ongoing in the networking world. The emergence of the software defined networking (SDN) architecture promises to rectify the ossified architecture of the Internet allowing network managers to flexibly program the network. In this paper, we argue that SDN and big data, two technological trends that promise to revolutionize all aspects of modern life, can leverage the freedom afforded by each other to jointly increase their value proposition. In particular, SDN can utilize the large amounts of operational data to optimize the network behavior, while big data platforms can benefit from the flexible architectural support provided by SDN. In this paper, we will provide a brief self-contained exposition on opportunities for SDN and big data to synergize and jointly optimize. We will also point out open research issues and will identify future directions of work.","PeriodicalId":434420,"journal":{"name":"International Conference on Frontiers of Information Technology","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126875755","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
A Robust Specification Theory for Modal Event-Clock Automata 模态事件时钟自动机的鲁棒规范理论
International Conference on Frontiers of Information Technology Pub Date : 2012-07-17 DOI: 10.4204/EPTCS.87.2
U. Fahrenberg, Axel Legay
{"title":"A Robust Specification Theory for Modal Event-Clock Automata","authors":"U. Fahrenberg, Axel Legay","doi":"10.4204/EPTCS.87.2","DOIUrl":"https://doi.org/10.4204/EPTCS.87.2","url":null,"abstract":"In a series of recent work, we have introduced a general framework for quantitative reasoning in specification theories. The contribution of this paper is to show how this framework can be applied to yield a robust specification theory for timed specifications.","PeriodicalId":434420,"journal":{"name":"International Conference on Frontiers of Information Technology","volume":"30 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132836492","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}
引用次数: 9
Sequentializing Parameterized Programs 顺序化参数化程序
International Conference on Frontiers of Information Technology Pub Date : 2012-07-15 DOI: 10.4204/EPTCS.87.4
S. L. Torre, P. Madhusudan, G. Parlato
{"title":"Sequentializing Parameterized Programs","authors":"S. L. Torre, P. Madhusudan, G. Parlato","doi":"10.4204/EPTCS.87.4","DOIUrl":"https://doi.org/10.4204/EPTCS.87.4","url":null,"abstract":"We exhibit assertion-preserving (reachability-preserving) transformations from parameterized concurrent shared-memory programs, under a k-round scheduling of processes, to sequential programs. The salient feature of the sequential program is that it tracks the local variables of only one thread at any point, and uses only O(k) copies of shared variables (it does not use extra counters, not even one counter to keep track of the number of threads). Sequentialization is achieved using the concept of a linear interface that captures the effect an unbounded block of processes have on the shared state in a k-round schedule. Linear interfaces in fact serve as summaries for parallel processes, and the sequentialization compiles these linear interfaces to procedural summaries in the sequential program. Our transformation utilizes linear interfaces to sequentialize the program, and to ensure the sequential program explores only reachable states and preserves local invariants.","PeriodicalId":434420,"journal":{"name":"International Conference on Frontiers of Information Technology","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124033342","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}
引用次数: 26
Refinement for Transition Systems with Responses 带响应的过渡系统的改进
International Conference on Frontiers of Information Technology Pub Date : 2012-07-01 DOI: 10.4204/EPTCS.87.5
Marco Carbone, Thomas T. Hildebrandt, Gian Perrone, A. Wąsowski
{"title":"Refinement for Transition Systems with Responses","authors":"Marco Carbone, Thomas T. Hildebrandt, Gian Perrone, A. Wąsowski","doi":"10.4204/EPTCS.87.5","DOIUrl":"https://doi.org/10.4204/EPTCS.87.5","url":null,"abstract":"Motivated by the response pattern for property specifications and applications within flexible workflow management systems, we report upon an initial study of modal and mixed transition systems in which the must transitions are interpreted as must eventually, and in which implementations can contain may behaviors that are resolved at run-time. We propose Transition Systems with Responses (TSRs) as a suitable model for this study. We prove that TSRs correspond to a restricted class of mixed transition systems, which we refer to as the action-deterministic mixed transition systems. We show that TSRs allow for a natural definition of deadlocked and accepting states. We then transfer the standard definition of refinement for mixed transition systems to TSRs and prove that refinement does not preserve deadlock freedom. This leads to the proposal of safe refinements, which are those that preserve deadlock freedom. We exemplify the use of TSRs and (safe) refinements on a small medication workflow.","PeriodicalId":434420,"journal":{"name":"International Conference on Frontiers of Information Technology","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126742389","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
A Parametric Counterexample Refinement Approach for Robust Timed Specifications 鲁棒定时规范的参数反例细化方法
International Conference on Frontiers of Information Technology Pub Date : 2012-07-01 DOI: 10.4204/EPTCS.87.3
Louis-Marie Traonouez
{"title":"A Parametric Counterexample Refinement Approach for Robust Timed Specifications","authors":"Louis-Marie Traonouez","doi":"10.4204/EPTCS.87.3","DOIUrl":"https://doi.org/10.4204/EPTCS.87.3","url":null,"abstract":"Robustness analyzes the impact of small perturbations in the semantics of a model. This allows to model hardware imprecision and therefore it has been applied to determine implementability of timed automata. In a recent paper, we extend this problem to a specification theory for real-timed systems based on timed input/output automata, that are interpreted as two-player games. We propose a construction that allows to synthesize an implementation of a specification that is robust under a given timed perturbation, and we study the impact of these perturbations when composing different specifications. \u0000To complete this work we present a technique that evaluates the greatest admissible perturbation. It consists in an iterative process that extracts a spoiling strategy when a game is lost, and through a parametric analysis refines the admissible values for the perturbation. We demonstrate this approach with a prototype implementation.","PeriodicalId":434420,"journal":{"name":"International Conference on Frontiers of Information Technology","volume":"212 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133956987","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
Contracts for Abstract Processes in Service Composition 服务组合中抽象过程的契约
International Conference on Frontiers of Information Technology Pub Date : 2011-01-24 DOI: 10.4204/EPTCS.46.2
M. Buscemi, Hernán C. Melgratti
{"title":"Contracts for Abstract Processes in Service Composition","authors":"M. Buscemi, Hernán C. Melgratti","doi":"10.4204/EPTCS.46.2","DOIUrl":"https://doi.org/10.4204/EPTCS.46.2","url":null,"abstract":"Contracts are a well-established approach for describing and analyzing behavioral aspects of web service compositions. The theory of contracts comes equipped with a notion of compatibility between clients and servers that ensures that every possible interaction between compatible clients and servers will complete successfully. It is generally agreed that real applications often require the ability of exposing just partial descriptions of their behaviors, which are usually known as abstract processes. We propose a formal characterization of abstraction as an extension of the usual symbolic bisimulation and we recover the notion of abstraction in the context of contracts.","PeriodicalId":434420,"journal":{"name":"International Conference on Frontiers of Information Technology","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125358777","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
An Algebra of Synchronous Scheduling Interfaces 同步调度接口的代数
International Conference on Frontiers of Information Technology Pub Date : 2011-01-24 DOI: 10.4204/EPTCS.46.3
Michael Mendler
{"title":"An Algebra of Synchronous Scheduling Interfaces","authors":"Michael Mendler","doi":"10.4204/EPTCS.46.3","DOIUrl":"https://doi.org/10.4204/EPTCS.46.3","url":null,"abstract":"In this paper we propose an algebra of synchronous scheduling interfaces which combines the expressiveness of Boolean algebra for logical and functional behaviour with the min-max-plus arithmetic for quantifying the non-functional aspects of synchronous interfaces. The interface theory arises from a realisability interpretation of intuitionistic modal logic (also known as Curry-Howard-Isomorphism or propositions-as-types principle). The resulting algebra of interface types aims to provide a general setting for specifying type-directed and compositional analyses of worst-case scheduling bounds. It covers synchronous control flow under concurrent, multi-processing or multi-threading execution and permits precise statements about exactness and coverage of the analyses supporting a variety of abstractions. The paper illustrates the expressiveness of the algebra by way of some examples taken from network flow problems, shortest-path, task scheduling and worst-case reaction times in synchronous programming.","PeriodicalId":434420,"journal":{"name":"International Conference on Frontiers of Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129121932","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
A Few Considerations on Structural and Logical Composition in Specification Theories 规范理论中关于结构与逻辑构成的几点思考
International Conference on Frontiers of Information Technology Pub Date : 2011-01-24 DOI: 10.4204/EPTCS.46.4
Axel Legay, A. Wąsowski
{"title":"A Few Considerations on Structural and Logical Composition in Specification Theories","authors":"Axel Legay, A. Wąsowski","doi":"10.4204/EPTCS.46.4","DOIUrl":"https://doi.org/10.4204/EPTCS.46.4","url":null,"abstract":"Over the last 20 years a large number of automata-based specification theories have been proposed for modeling of discrete, real-time and probabilistic systems. We have observed a lot of shared algebraic structure between these formalisms. In this short abstract, we collect results of our work in progress on describing and systematizing the algebraic assumptions in specification theories.","PeriodicalId":434420,"journal":{"name":"International Conference on Frontiers of Information Technology","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115234299","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
Interface Theories for (A)synchronously Communicating Modal I/O-Transition Systems 同步通信模态I/ o转换系统的接口理论
International Conference on Frontiers of Information Technology Pub Date : 2011-01-22 DOI: 10.4204/EPTCS.46.1
Sebastian S. Bauer, R. Hennicker, Stephan Janisch
{"title":"Interface Theories for (A)synchronously Communicating Modal I/O-Transition Systems","authors":"Sebastian S. Bauer, R. Hennicker, Stephan Janisch","doi":"10.4204/EPTCS.46.1","DOIUrl":"https://doi.org/10.4204/EPTCS.46.1","url":null,"abstract":"Interface specifications play an important role in component-based software development. An interface theory is a formal framework supporting composition, refinement and compatibility of interface specifications. We present different interface theories which use modal I/O-transition systems as their underlying domain for interface specifications: synchronous interface theories, which employ a synchronous communication schema, as well as a novel interface theory for asynchronous communication where components communicate via FIFO-buffers.","PeriodicalId":434420,"journal":{"name":"International Conference on Frontiers of Information Technology","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124052147","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
Validation of FS+LDDMM by automatic segmentation of caudate nucleus in brain MRI 脑MRI尾状核自动分割FS+LDDMM的验证
International Conference on Frontiers of Information Technology Pub Date : 2010-12-21 DOI: 10.1145/1943628.1943638
Shahab U. Ansari
{"title":"Validation of FS+LDDMM by automatic segmentation of caudate nucleus in brain MRI","authors":"Shahab U. Ansari","doi":"10.1145/1943628.1943638","DOIUrl":"https://doi.org/10.1145/1943628.1943638","url":null,"abstract":"For over last three decades, numerous automatic brain segmentation techniques in magnetic resonance (MR) images have been proposed. These techniques, however, need to be validated comprehensively. In this study, FS+LDDMM, a recently proposed fully automatic template-based brain segmentation technique, is validated. The validation method uses novel approach in which dependency of FS+LDDMM on initial segmentation parameters is evaluated. These segmentation parameters include choice of template, gross alignment, cropping size and initialization schemes. A database of 46 MR images from young ADHD subjects of an average age of 10.6 years is employed to segment caudate nucleus in subcortical region. The accuracy of the segmentation is computed by comparing FS+LDDMM segmentation with gold standard manual segmentation using metrics, such as, percent volume error, dice coefficient, L1 error and intraclass correlation coefficient (ICC). The FS+LDDMM shows robustness to all these parameters and outperforms FreeSurfer (FS) segmentation. To generalize the performance of FS+LDDMM, however, more experiments need to be conducted for various subcortical objects.","PeriodicalId":434420,"journal":{"name":"International Conference on Frontiers of Information Technology","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117115290","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
下一页 尾页
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学术官方微信