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

Proceedings of the 2006 ACM symposium on Applied computing最新文献

筛选
英文 中文
A deterministic technique for extracting keyword based grammar rules from programs 从程序中提取基于关键字的语法规则的确定性技术
Proceedings of the 2006 ACM symposium on Applied computing Pub Date : 2006-04-23 DOI: 10.1145/1141277.1141659
Alpana Dubey, P. Jalote, S. Aggarwal
{"title":"A deterministic technique for extracting keyword based grammar rules from programs","authors":"Alpana Dubey, P. Jalote, S. Aggarwal","doi":"10.1145/1141277.1141659","DOIUrl":"https://doi.org/10.1145/1141277.1141659","url":null,"abstract":"This paper presents a technique for extracting grammar rules, given a set of programs and an approximate grammar. Grammar is an important artifact used in the generation of tools for program analysis, modification, etc. Current grammar extraction techniques are heuristic in nature. This work proposes a deterministic technique for extracting keyword based grammar rules. The technique uses CYK-parser and LR-parser to build a set of possible rules. For each rule it checks whether the grammar after including that rule is able to parse all the programs or not. As this results in a large set of possible rules, a set of optimizations are proposed to reduce the search space of possible rules. The proposed optimizations utilize the knowledge from multiple programs and exploit the abundance of unit productions in the grammar of programming languages. The proposed approach and optimizations are experimentally checked on a set of input programs.","PeriodicalId":269830,"journal":{"name":"Proceedings of the 2006 ACM symposium on Applied computing","volume":"484 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117168668","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
Analysis of deployment dependencies in software components 分析软件组件中的部署依赖关系
Proceedings of the 2006 ACM symposium on Applied computing Pub Date : 2006-04-23 DOI: 10.1145/1141277.1141445
Meriem Belguidoum, F. Dagnat
{"title":"Analysis of deployment dependencies in software components","authors":"Meriem Belguidoum, F. Dagnat","doi":"10.1145/1141277.1141445","DOIUrl":"https://doi.org/10.1145/1141277.1141445","url":null,"abstract":"Administration and deployment of software systems become increasingly complex. This complexity results from the need of uniform access to applications from heterogeneous terminals through different communication infrastructures. Moreover, applications consists in complex architectures of lot of small components connected together. A first step to simplify deployment is to have an unified and abstract model for representing deployment dependencies and managing them properly. Therefore, we propose here a deployment model and a conceptual foundation for component installation. Installation dependencies and installation rules are expressed in a logic language.","PeriodicalId":269830,"journal":{"name":"Proceedings of the 2006 ACM symposium on Applied computing","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116664624","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
Investigating 'Internet Crimes Against Children' (ICAC) cases in the state of Florida 在佛罗里达州调查“针对儿童的网络犯罪”(ICAC)案件
Proceedings of the 2006 ACM symposium on Applied computing Pub Date : 2006-04-23 DOI: 10.1145/1141277.1141345
Bob Breeden, J. Mulholland
{"title":"Investigating 'Internet Crimes Against Children' (ICAC) cases in the state of Florida","authors":"Bob Breeden, J. Mulholland","doi":"10.1145/1141277.1141345","DOIUrl":"https://doi.org/10.1145/1141277.1141345","url":null,"abstract":"The purpose of this article is to highlight efforts by the Computer Crime Center at the Florida Department of Law Enforcement (FDLE) to prosecute ICAC cases under their jurisdiction. Section 1 presents an overview of the FDLE ICAC Initiative, a project funded by the Florida Department of Children and Families (DCF) with respect to: (i) project goals and objectives, (ii) agent/analyst training and deployment, (iii) collaboration with other law enforcement agencies, (iv) arrest rates, and (v) community education programs. Section 2 focuses on the Internet and how it is contributing to the rising incidence of sexual exploitation of children by online predators. In particular, this section underscores the computer's appeal for both the offender and the victim. Section 3 describes noteworthy cases that have been investigated by the FDLE Computer Crime Center. The first three sections provide the context for the last two sections which focus exclusively on the type of forensics required to successfully prosecute ICAC cases. In section 4, the main investigative steps are delineated. To illustrate how ICAC cases are handled, the article depicts the two main components of an investigation: First, subpoenas are issued, search warrants are served and executed, and then, once the evidence is acquired, law enforcement officials conduct a forensic exam on the computers and other digital evidence that may have been seized during an investigation. Finally, section 5 concludes with a set of recommendations on 'best practices' for prosecuting ICAC cases.","PeriodicalId":269830,"journal":{"name":"Proceedings of the 2006 ACM symposium on Applied computing","volume":"494 1-2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116820381","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
A precise schedulability test algorithm for scheduling periodic tasks in real-time systems 一种用于实时系统周期任务调度的精确可调度性测试算法
Proceedings of the 2006 ACM symposium on Applied computing Pub Date : 2006-04-23 DOI: 10.1145/1141277.1141616
Wan-Chen Lu, Jen-Wei Hsieh, W. Shih
{"title":"A precise schedulability test algorithm for scheduling periodic tasks in real-time systems","authors":"Wan-Chen Lu, Jen-Wei Hsieh, W. Shih","doi":"10.1145/1141277.1141616","DOIUrl":"https://doi.org/10.1145/1141277.1141616","url":null,"abstract":"Rate monotonic analysis (RMA) has been shown to be effective in the schedulability analysis of various types of system. This paper focuses on reducing the run time of each RMA-tested system. Based on a new concept of tasks, denoted by the lift-utilization tasks, we propose a novel method to reduce the number of iterative calculations in the derivation of the worst-case response time of each task in its RMA test. The capability of the proposed method was evaluated and compared to related work, which revealed that our method produced savings of 26-33% in the number of RMA iterations.","PeriodicalId":269830,"journal":{"name":"Proceedings of the 2006 ACM symposium on Applied computing","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115142691","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
An implicit segmentation-based method for recognition of handwritten strings of characters 一种基于隐式分割的手写字符串识别方法
Proceedings of the 2006 ACM symposium on Applied computing Pub Date : 2006-04-23 DOI: 10.1145/1141277.1141468
P. Cavalin, A. Britto, Flávio Bortolozzi, R. Sabourin, Luiz Oliveira
{"title":"An implicit segmentation-based method for recognition of handwritten strings of characters","authors":"P. Cavalin, A. Britto, Flávio Bortolozzi, R. Sabourin, Luiz Oliveira","doi":"10.1145/1141277.1141468","DOIUrl":"https://doi.org/10.1145/1141277.1141468","url":null,"abstract":"This paper describes an implicit segmentation-based method for recognition of strings of characters (words or numerals). In a two-stage HMM-based method, an implicit segmentation is applied to segment either words or numeral strings, and in the verification stage, foreground and background features are combined to compensate the loss in terms of recognition rate when segmentation and recognition are performed in the same process. A rigorous experimental protocol shows the performance of the proposed method for isolated characters, numeral strings, and words.","PeriodicalId":269830,"journal":{"name":"Proceedings of the 2006 ACM symposium on Applied computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115283076","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}
引用次数: 38
Supporting transparent model update in distributed CASE tool integration 支持分布式CASE工具集成中的透明模型更新
Proceedings of the 2006 ACM symposium on Applied computing Pub Date : 2006-04-23 DOI: 10.1145/1141277.1141692
Prawee Sriplakich, Xavier Blanc, M. Gervais
{"title":"Supporting transparent model update in distributed CASE tool integration","authors":"Prawee Sriplakich, Xavier Blanc, M. Gervais","doi":"10.1145/1141277.1141692","DOIUrl":"https://doi.org/10.1145/1141277.1141692","url":null,"abstract":"Model Driven Architecture (MDA) is a software development approach that focuses on models. In order to support MDA, a lot of CASE tools have emerged; each of them provides a different set of modeling services (operations for automating model manipulation). We have proposed an open environment called ModelBus, which enables the integration of heterogeneous and distributed CASE tools. ModelBus enables tools to invoke the modeling services provided by other tools. In this paper, we focus on supporting a particular kind of modeling services: services that update models (i.e. they have inout parameters). Our contribution is to enable a tool to update models owned by another tool. We propose a parameter passing mechanism that hides the complexity of model update from tools. First, it enables a tool to update models transparently to heterogeneous model representations. Second, it enables a tool to update models located in the memory of another remote tool transparently, as if the models were local. Third, it ensures the integrity between the updated models and the tool that owns the models.","PeriodicalId":269830,"journal":{"name":"Proceedings of the 2006 ACM symposium on Applied computing","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116073246","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
Preliminary performance evaluation of an adaptive dynamic extensible processor for embedded applications 嵌入式应用自适应动态可扩展处理器的初步性能评价
Proceedings of the 2006 ACM symposium on Applied computing Pub Date : 2006-04-23 DOI: 10.1145/1141277.1141496
Hamid Noori, K. Murakami
{"title":"Preliminary performance evaluation of an adaptive dynamic extensible processor for embedded applications","authors":"Hamid Noori, K. Murakami","doi":"10.1145/1141277.1141496","DOIUrl":"https://doi.org/10.1145/1141277.1141496","url":null,"abstract":"In this research we investigate an approach for adaptive dynamic instruction set extension, tuning processors to specific applications after fabrication.","PeriodicalId":269830,"journal":{"name":"Proceedings of the 2006 ACM symposium on Applied computing","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116223857","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
Digital geometry image analysis for medical diagnosis 用于医学诊断的数字几何图像分析
Proceedings of the 2006 ACM symposium on Applied computing Pub Date : 2006-04-23 DOI: 10.1145/1141277.1141327
Jiandong Fang, S. Fang, Jeffrey Huang, M. Tuceryan
{"title":"Digital geometry image analysis for medical diagnosis","authors":"Jiandong Fang, S. Fang, Jeffrey Huang, M. Tuceryan","doi":"10.1145/1141277.1141327","DOIUrl":"https://doi.org/10.1145/1141277.1141327","url":null,"abstract":"This paper describes a new medical image analysis technique for polygon mesh surfaces of human faces for a medical diagnosis application. The goal is to explore the natural patterns and 3D facial features to provide diagnostic information for Fetal Alcohol Syndrome (FAS). Our approach is based on a digital geometry analysis framework that applies pattern recognition techniques to digital geometry (polygon mesh) data from 3D laser scanners and other sources. Novel 3D geometric features are extracted and analyzed to determine the most discriminatory features that best represent FAS characteristics. As part of the NIH Consortium for FASD, the techniques developed here are being applied and tested on real patient datasets collected by the NIH Consortium both within and outside the US.","PeriodicalId":269830,"journal":{"name":"Proceedings of the 2006 ACM symposium on Applied computing","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114695866","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
PackageBLAST: an adaptive multi-policy grid service for biological sequence comparison PackageBLAST:用于生物序列比较的自适应多策略网格服务
Proceedings of the 2006 ACM symposium on Applied computing Pub Date : 2006-04-23 DOI: 10.1145/1141277.1141313
Marcelo S. Sousa, A. Melo
{"title":"PackageBLAST: an adaptive multi-policy grid service for biological sequence comparison","authors":"Marcelo S. Sousa, A. Melo","doi":"10.1145/1141277.1141313","DOIUrl":"https://doi.org/10.1145/1141277.1141313","url":null,"abstract":"In this paper, we propose an adaptive task allocation framework to perform BLAST searches in a grid environment against sequence database segments. The framework, called PackageBLAST, provides an infrastructure to choose or incorporate task allocation strategies. Furthermore, we propose a mechanism to compute grid nodes execution weight, adapting the chosen allocation policy to the current computational power of the nodes. Our results present very good speedups and also show that no single allocation strategy is able to achieve the lowest execution times for all scenarios.","PeriodicalId":269830,"journal":{"name":"Proceedings of the 2006 ACM symposium on Applied computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116526172","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
Improving the compensated Horner scheme with a fused multiply and add 用融合乘加改进补偿霍纳方案
Proceedings of the 2006 ACM symposium on Applied computing Pub Date : 2006-04-23 DOI: 10.1145/1141277.1141585
S. Graillat, P. Langlois, N. Louvet
{"title":"Improving the compensated Horner scheme with a fused multiply and add","authors":"S. Graillat, P. Langlois, N. Louvet","doi":"10.1145/1141277.1141585","DOIUrl":"https://doi.org/10.1145/1141277.1141585","url":null,"abstract":"Several different techniques and softwares intend to improve the accuracy of results computed in a fixed finite precision. Here we focus on a method to improve the accuracy of the polynomial evaluation. It is well known that the use of the Fused Multiply and Add operation available on some microprocessors like Intel Itanium improves slightly the accuracy of the Horner scheme. In this paper, we propose an accurate compensated Horner scheme specially designed to take advantage of the Fused Multiply and Add. We prove that the computed result is as accurate as if computed in twice the working precision. The algorithm we present is fast since it only requires well optimizable floating point operations, performed in the same working precision as the given data.","PeriodicalId":269830,"journal":{"name":"Proceedings of the 2006 ACM symposium on Applied computing","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115611619","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
首页 上一页 下一页 尾页
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学术官方微信