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

2008 International Multiconference on Computer Science and Information Technology最新文献

筛选
英文 中文
Runtime resource assurance and adaptation with Qinna framework: A case study 运行时资源保证和适应与秦纳框架:一个案例研究
2008 International Multiconference on Computer Science and Information Technology Pub Date : 2008-10-01 DOI: 10.1109/IMCSIT.2008.4747307
L. Gonnord, Jean-Philippe Babau
{"title":"Runtime resource assurance and adaptation with Qinna framework: A case study","authors":"L. Gonnord, Jean-Philippe Babau","doi":"10.1109/IMCSIT.2008.4747307","DOIUrl":"https://doi.org/10.1109/IMCSIT.2008.4747307","url":null,"abstract":"Even if hardware improvements have increased the performance of embedded systems in the last years, resource problems are still acute. The persisting problem is the constantly growing complexity of systems. New devices for service such as PDAs or smartphones increase the need for flexible and adaptive open software. Component-based software engineering tries to address these problems and one key point for development is the Quality of Service (QoS) coming from resource constraints. In this paper, we recall the concepts behind Qinna, a component-based QoS Architecture, which was designed to manage QoS issues, and we illustrate the developpement of a image viewer application within this framework. We focus on the general developpement methodology of resource-aware applications with Qinna framework, from the specification of resource constraints to the use of generic Qinnapsilas algorithms for negotiating QoS contracts at runtime.","PeriodicalId":267715,"journal":{"name":"2008 International Multiconference on Computer Science and Information Technology","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125297948","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
Simulator generation using an automaton based pipeline model for timing analysis 模拟器的生成采用基于自动机的流水线模型进行时序分析
2008 International Multiconference on Computer Science and Information Technology Pub Date : 2008-10-01 DOI: 10.1109/IMCSIT.2008.4747313
Rola Kassem, M. Briday, Jean-Luc Béchennec, Y. Trinquet, G. Savaton
{"title":"Simulator generation using an automaton based pipeline model for timing analysis","authors":"Rola Kassem, M. Briday, Jean-Luc Béchennec, Y. Trinquet, G. Savaton","doi":"10.1109/IMCSIT.2008.4747313","DOIUrl":"https://doi.org/10.1109/IMCSIT.2008.4747313","url":null,"abstract":"Hardware simulation is an important part of the design of embedded and/or real-time systems. It can be used to compute the Worst Case Execution Time (WCET) and to provide a mean to run software when final hardware is not yet available. Building a simulator is a long and difficult task, especially when the architecture of processor is complex. This task can be alleviated by using a Hardware Architecture Description Language and generating the simulator. In this article we focus on a technique to generate an automata based simulator from the description of the pipeline. The description is transformed into an automaton and a set of resources which, in turn, are transformed into a simulator. The goal is to obtain a cycle-accurate simulator to verify timing characteristics of embedded real-time systems. An experiment compares an Instruction Set Simulator with and without the automaton based cycle-accurate simulator.","PeriodicalId":267715,"journal":{"name":"2008 International Multiconference on Computer Science and Information Technology","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122211681","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}
引用次数: 12
PAFSV: A process algebraic framework for SystemVerilog SystemVerilog的进程代数框架
2008 International Multiconference on Computer Science and Information Technology Pub Date : 2008-10-01 DOI: 10.1109/IMCSIT.2008.4747295
K. L. Man
{"title":"PAFSV: A process algebraic framework for SystemVerilog","authors":"K. L. Man","doi":"10.1109/IMCSIT.2008.4747295","DOIUrl":"https://doi.org/10.1109/IMCSIT.2008.4747295","url":null,"abstract":"We develop a process algebraic framework, called process algebraic framework for IEEE 1800trade SystemVerilog (PAFSV), for formal specification and analysis of IEEE 1800trade SystemVerilog designs. The formal semantics of PAFSV is defined by means of deduction rules that associate a time transition system with a PAFSV process. A set of properties of PAFSV is presented for a notion of bisimilarity. PAFSV may be regarded as the formal language of a significant subset of IEEE 1800trade SystemVerilog. To show that PAFSV is useful for the formal specification and analysis of IEEE 1800trade SystemVerilog designs, we illustrate the use of PAFSV with some examples: a MUX, a synchronous reset D flip-flop and an arbiter.","PeriodicalId":267715,"journal":{"name":"2008 International Multiconference on Computer Science and Information Technology","volume":"427 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116720945","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
On the hidden discrete logarithm for some polynomial stream ciphers 若干多项式流密码的隐离散对数
2008 International Multiconference on Computer Science and Information Technology Pub Date : 2008-10-01 DOI: 10.1109/IMCSIT.2008.4747255
V. Ustimenko
{"title":"On the hidden discrete logarithm for some polynomial stream ciphers","authors":"V. Ustimenko","doi":"10.1109/IMCSIT.2008.4747255","DOIUrl":"https://doi.org/10.1109/IMCSIT.2008.4747255","url":null,"abstract":"The paper is devoted to the special key management algorithm for the stream ciphers defined in via finite automata corresponding to the family of directed algebraic graphs of high girth and two affine transformation. Security of the key based on the complexity of the discrete logarithm problem. It has additional heuristic security because of the ldquohidden baserdquo and ldquohidden valuerdquo of the discrete logarithm function. We consider the heuristic evaluation of the complexity for different attack by the adversary on our private key cipher. The detailed description of the whole algorithm is given. Implemented software package has been used for the evaluation of mixing properties and speed of the private key encryption.","PeriodicalId":267715,"journal":{"name":"2008 International Multiconference on Computer Science and Information Technology","volume":"127 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129708659","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
Performance evaluation of a machine learning algorithm for early application identification 用于早期应用识别的机器学习算法的性能评估
2008 International Multiconference on Computer Science and Information Technology Pub Date : 2008-10-01 DOI: 10.1109/IMCSIT.2008.4747340
G. Verticale, P. Giacomazzi
{"title":"Performance evaluation of a machine learning algorithm for early application identification","authors":"G. Verticale, P. Giacomazzi","doi":"10.1109/IMCSIT.2008.4747340","DOIUrl":"https://doi.org/10.1109/IMCSIT.2008.4747340","url":null,"abstract":"The early identification of applications through the observation and fast analysis of the associated packet flows is a critical building block of intrusion detection and policy enforcement systems. The simple techniques currently used in practice, such as looking at the transport port numbers or at the application payload, are increasingly less effective for new applications using random port numbers and/or encryption. Therefore, there is increasing interest in machine learning techniques capable of identifying applications by examining features of the associated traffic process such as packet lengths and inter-arrival times. However, these techniques require that the classification algorithm is trained with examples of the traffic generated by the applications to be identified, possibly on the link where the the classifier will operate. In this paper we provide two new contributions. First, we apply the C4.5 decision tree algorithm to the problem of early application identification (i.e. looking at the first packets of the flow) and show that it has better performance than the algorithms proposed in the literature. Moreover, we evaluate the performance of the classifier when training is performed on a link different from the link where the classifier operates. This is an important issue, as a pre-trained portable classifier would greatly facilitate the deployment and management of the classification infrastructure.","PeriodicalId":267715,"journal":{"name":"2008 International Multiconference on Computer Science and Information Technology","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129862565","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
Solving a kind of BVP for second-order ODEs using novel data formats for dense matrices 利用新颖的密集矩阵数据格式求解一类二阶ode的BVP
2008 International Multiconference on Computer Science and Information Technology Pub Date : 2008-10-01 DOI: 10.1109/IMCSIT.2008.4747254
Przemysław Stpiczyński
{"title":"Solving a kind of BVP for second-order ODEs using novel data formats for dense matrices","authors":"Przemysław Stpiczyński","doi":"10.1109/IMCSIT.2008.4747254","DOIUrl":"https://doi.org/10.1109/IMCSIT.2008.4747254","url":null,"abstract":"The aim of this paper is to show that a kind of boundary value problem for second-order ordinary differential equations which reduces to the problem of solving tridiagonal systems of linear equations can be efficiently solved on modern multicore computer architectures. A new method for solving such tridiagonal systems of linear equations, based on recently developed algorithms for solving linear recurrence systems with constant coefficients, can be easily vectorized and parallelized. Further improvements can be achieved when novel data formats for dense matrices are used.","PeriodicalId":267715,"journal":{"name":"2008 International Multiconference on Computer Science and Information Technology","volume":"23 23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128436981","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
A Context-Risk-Aware Access Control model for Ubiquitous environments 面向泛在环境的上下文风险感知访问控制模型
2008 International Multiconference on Computer Science and Information Technology Pub Date : 2008-10-01 DOI: 10.1109/IMCSIT.2008.4747331
A. Ahmed, Ning Zhang
{"title":"A Context-Risk-Aware Access Control model for Ubiquitous environments","authors":"A. Ahmed, Ning Zhang","doi":"10.1109/IMCSIT.2008.4747331","DOIUrl":"https://doi.org/10.1109/IMCSIT.2008.4747331","url":null,"abstract":"This paper reports our ongoing work to design a context-risk-aware access control (CRAAC) model for ubiquitous computing (UbiComp) environments. CRAAC is designed to augment flexibility and generality over the current solutions. Risk assessment and authorization level of assurance play a key role in CRAAC. Through risk assessment, resources are classified into groups according to their sensitivity levels and potential impacts should any unauthorized access occurs. The identified risks are mapped onto their required assurance levels, called object level of assurance (OLoA). Upon receiving an object access request, the requesterpsilas run-time contextual information is assessed to establish a requesterpsilas level of assurance (RLoA) denoting the level of confidence in identifying that requester. The access request is granted if RLoA ges OLoA. This paper describes the motivation for, and the design of, the CRAAC model, and reports a case study of further illustrate the model.","PeriodicalId":267715,"journal":{"name":"2008 International Multiconference on Computer Science and Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128775468","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
The quasi-one-way function and its applications to image watermarking 准单向函数及其在图像水印中的应用
2008 International Multiconference on Computer Science and Information Technology Pub Date : 2008-10-01 DOI: 10.1109/IMCSIT.2008.4747290
K. Ohzeki, Engyoku Gi
{"title":"The quasi-one-way function and its applications to image watermarking","authors":"K. Ohzeki, Engyoku Gi","doi":"10.1109/IMCSIT.2008.4747290","DOIUrl":"https://doi.org/10.1109/IMCSIT.2008.4747290","url":null,"abstract":"This paper describes a one-way function for use in an image watermark to improve authentication ability. The one-way function is popular in cryptography and can prove encryption security. The existence of the one-way function has not been proved yet, while the public key encryption procedure is widely used in practical commerce. The authors proposed a quasi-one-way function, which is weakly defined for practical use. The differences between the strict one-way-function and the proposed quasi-one-way function are discussed. Applications of the quasi-one-way function to image watermarking are shown. Two watermarking systems with SVD method and Jordan canonical form are tried. The robustness of the proposed watermarking method is high.","PeriodicalId":267715,"journal":{"name":"2008 International Multiconference on Computer Science and Information Technology","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129018114","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
Definition extraction: Improving Balanced Random Forests 定义提取:改善平衡随机森林
2008 International Multiconference on Computer Science and Information Technology Pub Date : 2008-10-01 DOI: 10.1109/IMCSIT.2008.4747264
Lukasz Degórski, Lukasz Kobylinski, A. Przepiórkowski
{"title":"Definition extraction: Improving Balanced Random Forests","authors":"Lukasz Degórski, Lukasz Kobylinski, A. Przepiórkowski","doi":"10.1109/IMCSIT.2008.4747264","DOIUrl":"https://doi.org/10.1109/IMCSIT.2008.4747264","url":null,"abstract":"The article discusses methods of improving the ways of applying balanced random forests (BRFs), a machine learning classification algorithm, used to extract definitions from written texts. These methods include different approaches to selecting attributes, optimising the classifier prediction threshold for the task of definition extraction and initial filtering by a very simple grammar.","PeriodicalId":267715,"journal":{"name":"2008 International Multiconference on Computer Science and Information Technology","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127038103","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
Real-time service-oriented communication protocols on resource constrained devices 资源受限设备上面向服务的实时通信协议
2008 International Multiconference on Computer Science and Information Technology Pub Date : 2008-10-01 DOI: 10.1109/IMCSIT.2008.4747318
Guido Moritz, Steffen Prüter, D. Timmermann, F. Golatowski
{"title":"Real-time service-oriented communication protocols on resource constrained devices","authors":"Guido Moritz, Steffen Prüter, D. Timmermann, F. Golatowski","doi":"10.1109/IMCSIT.2008.4747318","DOIUrl":"https://doi.org/10.1109/IMCSIT.2008.4747318","url":null,"abstract":"Service-oriented architecture (SOA) become more and more important in connecting devices with each other. The main advantages of service-oriented architectures are a higher abstraction level and interoperability of devices. In this area, Web services have become an important standard for communication between devices. However, this upcoming technology is only available on devices with sufficient resources. Therefore, embedded devices are often excluded from the deployment of Web services due to a lack of computing power and memory. Furthermore, embedded devices often require real-time capabilities for communication, and process control. This paper presents a new table driven approach to handle real-time capable Web services communication, on embedded hardware through the devices profile for Web services.","PeriodicalId":267715,"journal":{"name":"2008 International Multiconference on Computer Science and Information Technology","volume":"292 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123384560","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
下一页 尾页
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学术官方微信