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

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

筛选
英文 中文
An evaluation system for news video streams and blogs 新闻视频流和博客的评估系统
Proceedings of the 2006 ACM symposium on Applied computing Pub Date : 2006-04-23 DOI: 10.1145/1141277.1141593
D. Kitayama, K. Sumiya
{"title":"An evaluation system for news video streams and blogs","authors":"D. Kitayama, K. Sumiya","doi":"10.1145/1141277.1141593","DOIUrl":"https://doi.org/10.1145/1141277.1141593","url":null,"abstract":"When we want information on current events, we often view news programs on TV or news streams on Web sites. A news video stream consists of several scenes, and viewers often gain a broad understanding of the news by viewing scenes in the given order. Since a viewer's opinion of a news topic will depend on the scene order, we have developed a method for extracting blog entries expressing a particular point of view regarding news topics where we use a form of evaluation and categorization similar to that based on news scene order. In this paper, we describe our method of news evaluation based on news scene order and explain how a blog search can be done using a news stream.","PeriodicalId":269830,"journal":{"name":"Proceedings of the 2006 ACM symposium on Applied computing","volume":"19 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":"130591150","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
Abstract non-interference in a fragment of Java bytecode 抽象的不干扰在Java字节码片段
Proceedings of the 2006 ACM symposium on Applied computing Pub Date : 2006-04-23 DOI: 10.1145/1141277.1141706
D. Zanardini
{"title":"Abstract non-interference in a fragment of Java bytecode","authors":"D. Zanardini","doi":"10.1145/1141277.1141706","DOIUrl":"https://doi.org/10.1145/1141277.1141706","url":null,"abstract":"This work presents a program analyzer for checking Abstract Non-Interference in a fragment of Java bytecode. Abstract Non-Interference is an information flow property which is weaker and more general than standard Non-Interference, since it can allow some selected parts of secret information to flow into the public part of a program. The motivation for such a weakening is that some flows are indeed useful in real-life applications. The amount of allowed flows is encoded into abstract domains, which characterize the degree of precision of a potential attacker in observing data; flows are forbidden as long as they can be observed and exploited by attackers. Abstract values describe possible values of programs in different executions. Basic features of Java bytecode are considered; advanced topics, such as method calls, objects and exceptions, are also discussed. A program is said to be secure if analysis computes a state which does not contain private information in public places; information flows can exist only as long as the attacker has not enough observational power to see and exploit them.","PeriodicalId":269830,"journal":{"name":"Proceedings of the 2006 ACM symposium on Applied computing","volume":"223 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":"132392526","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
Session details: Model transformation (MT 2006) 会议细节:模型转换(MT 2006)
Proceedings of the 2006 ACM symposium on Applied computing Pub Date : 2006-04-23 DOI: 10.1145/3245482
J. Bézivin, A. Pierantonio, Antonio Vallecillo
{"title":"Session details: Model transformation (MT 2006)","authors":"J. Bézivin, A. Pierantonio, Antonio Vallecillo","doi":"10.1145/3245482","DOIUrl":"https://doi.org/10.1145/3245482","url":null,"abstract":"","PeriodicalId":269830,"journal":{"name":"Proceedings of the 2006 ACM symposium on Applied computing","volume":"178 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":"132422788","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
A-Brain: the multiple problems solver A-Brain:多重问题的解决者
Proceedings of the 2006 ACM symposium on Applied computing Pub Date : 2006-04-23 DOI: 10.1145/1141277.1141502
Mihai Oltean
{"title":"A-Brain: the multiple problems solver","authors":"Mihai Oltean","doi":"10.1145/1141277.1141502","DOIUrl":"https://doi.org/10.1145/1141277.1141502","url":null,"abstract":"Intelligence is strongly related to the ability of solving different problems by a single system. General problems solvers such as Artificial Neural Networks, Evolutionary Algorithms, Particle Swarm etc, have traditionally been tested against one problem at one time. The purpose of this research is to build a complex and adaptive system able to solve multiple (and different) problems. The proposed system, called A-Brain, consists of several connected components (a Decision Maker, a Trainer and several Problem Solvers) which provide a base for building complex problem solvers. The A-Brain system is applied for solving some well-known problems in the field of symbolic regression. Numerical experiments show that A-Brain system is able to perform very well on the considered test problems.","PeriodicalId":269830,"journal":{"name":"Proceedings of the 2006 ACM symposium on Applied computing","volume":"40 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":"132475029","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
Towards a model-driven join point model 转向模型驱动的连接点模型
Proceedings of the 2006 ACM symposium on Applied computing Pub Date : 2006-04-23 DOI: 10.1145/1141277.1141580
W. Cazzola, A. Cicchetti, A. Pierantonio
{"title":"Towards a model-driven join point model","authors":"W. Cazzola, A. Cicchetti, A. Pierantonio","doi":"10.1145/1141277.1141580","DOIUrl":"https://doi.org/10.1145/1141277.1141580","url":null,"abstract":"Aspect-Oriented Programming (AOP) is increasingly being adopted by developers to better modularize object-oriented design by introducing crosscutting concerns. However, due to tight coupling of existing approaches with the implementing code and to the poor expressiveness of the pointcut languages a number of problems became evident. We believe that such problems could be solved shifting the focus of software development from a programming language specific implementation to application design. This work presents a possible solution based on modeling aspects at a higher level of abstraction which are, in turn, transformed to specific targets.","PeriodicalId":269830,"journal":{"name":"Proceedings of the 2006 ACM symposium on Applied computing","volume":"35 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":"132039618","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
Implementing an embedded GPU language by combining translation and generation 采用翻译和生成相结合的方法实现了一种嵌入式GPU语言
Proceedings of the 2006 ACM symposium on Applied computing Pub Date : 2006-04-23 DOI: 10.1145/1141277.1141654
Calle Lejdfors, L. Ohlsson
{"title":"Implementing an embedded GPU language by combining translation and generation","authors":"Calle Lejdfors, L. Ohlsson","doi":"10.1145/1141277.1141654","DOIUrl":"https://doi.org/10.1145/1141277.1141654","url":null,"abstract":"Dynamic languages typically allow programs to be written at a very high level of abstraction. But their dynamic nature makes it very hard to compile such languages, meaning that a price has to be paid in terms of performance. However under certain restricted conditions compilation is possible. In this paper we describe how a domain specific language for image processing in Python can be compiled for execution on high speed graphics processing units. Previous work on similar problems have used either translative or generative compilation methods, each of which has its limitations. We propose a strategy which combine these two methods thereby achieving the benefits of both.","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":"132099098","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
Dynamic context adaptation in multimedia documents 多媒体文档中的动态上下文适应
Proceedings of the 2006 ACM symposium on Applied computing Pub Date : 2006-04-23 DOI: 10.1145/1141277.1141595
P. Bertolotti, O. Gaggi, M. Sapino
{"title":"Dynamic context adaptation in multimedia documents","authors":"P. Bertolotti, O. Gaggi, M. Sapino","doi":"10.1145/1141277.1141595","DOIUrl":"https://doi.org/10.1145/1141277.1141595","url":null,"abstract":"Multimedia documents are collections of media objects, synchronized by means of sets of temporal and spatial constraints. Any multimedia document definition is valid as long as the referred media objects are available and the constraints are satisfiable. Document validity depends on the context in which the document has to be presented. In this paper, we introduce a framework to characterize context adaptation, in the presence of both physical and user oriented context requirements. We define semantically equivalent presentation fragments as alternative to undeliverable ones. In the absence of equivalence, undeliverable media are replaced with candidates that minimize the loss of information/quality in the presentation.","PeriodicalId":269830,"journal":{"name":"Proceedings of the 2006 ACM symposium on Applied computing","volume":"37 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":"132263651","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
A branch and prune algorithm for the approximation of non-linear AE-solution sets 非线性ae解集逼近的分支与剪枝算法
Proceedings of the 2006 ACM symposium on Applied computing Pub Date : 2006-04-23 DOI: 10.1145/1141277.1141665
A. Goldsztejn
{"title":"A branch and prune algorithm for the approximation of non-linear AE-solution sets","authors":"A. Goldsztejn","doi":"10.1145/1141277.1141665","DOIUrl":"https://doi.org/10.1145/1141277.1141665","url":null,"abstract":"Non-linear AE-solution sets are a special case of parametric systems of equations where universally quantified parameters appear first. They allow to model many practical situations. A new branch and prune algorithm dedicated to the approximation of non-linear AE-solution sets is proposed. It is based on a new generalized interval (intervals whose bounds are not constrained to be ordered) parametric Hansen-Sengupta operator. In spite of some restrictions on the form of the AE-solution set which can be approximated, it allows to solve problems which were before out of reach of previous numerical methods. Some promising experimentations are presented.","PeriodicalId":269830,"journal":{"name":"Proceedings of the 2006 ACM symposium on Applied computing","volume":"24 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":"126678145","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}
引用次数: 28
Expanding the taxonomies of bibliographic archives with persistent long-term themes 扩展具有持久长期主题的书目档案分类
Proceedings of the 2006 ACM symposium on Applied computing Pub Date : 2006-04-23 DOI: 10.1145/1141277.1141419
R. Schult, M. Spiliopoulou
{"title":"Expanding the taxonomies of bibliographic archives with persistent long-term themes","authors":"R. Schult, M. Spiliopoulou","doi":"10.1145/1141277.1141419","DOIUrl":"https://doi.org/10.1145/1141277.1141419","url":null,"abstract":"As document collections accummulate over time, some of the discussion subjects in them become outfashioned, while new ones emerge. In this paper, we address the challenge of finding such emerging and persistent \"themes\", i.e. subjects that live long enough to be incorporated into a taxonomy or ontology describing the document collection. Our method is based on similarity-based clustering and cluster label construction and focusses on the identification of cluster labels that \"survive\" changes in the constitution of the underlying population of documents, including changes in the feature space of dominant words. We conducted a set of promising experiments on the identification of themes that manifested themselves in the ACM library within the last decade.","PeriodicalId":269830,"journal":{"name":"Proceedings of the 2006 ACM symposium on Applied computing","volume":"24 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":"126734395","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
An integrated computational proteomics method to extract protein targets for Fanconi Anemia studies 一种综合计算蛋白质组学方法提取范可尼贫血研究的蛋白质靶点
Proceedings of the 2006 ACM symposium on Applied computing Pub Date : 2006-04-23 DOI: 10.1145/1141277.1141316
J. Chen, Sarah L. Pinkerton, Changyu Shen, Mu Wang
{"title":"An integrated computational proteomics method to extract protein targets for Fanconi Anemia studies","authors":"J. Chen, Sarah L. Pinkerton, Changyu Shen, Mu Wang","doi":"10.1145/1141277.1141316","DOIUrl":"https://doi.org/10.1145/1141277.1141316","url":null,"abstract":"Fanconi Anemia (FA) is a rare autosomal genetic disease with multiple birth defects and severe childhood complications for its patients. The lack of sequence homology of the entire FA Complementation Group proteins in such as FANCC, FANCG, FANCA makes them extremely difficult to characterize using conventional bioinformatics methods. In this work, we describe how to use computational methods to extract protein targets for FA, using protein interaction data set collected for FANC group C protein (FANCC). We first generated an initial set of 130 FA-interacting proteins as \"FANCC seed proteins\" by merging an in-house experimental set of FANCC Tandem Affinity Purification (TAP) Pulldown Proteomics data identified from Mass Spectrometry methods with publicly available human FANCC-interacting proteins. Next, we expanded the FANCC seed proteins using a nearest-neighbor method to generate a FANCC protein interaction subnetwork of 948 proteins in 903 protein interactions. We show that this network is statistically significant, with high indices of aggregation and separations. We also show a visualization of the network, support the evidence that many well-connected proteins exists in the network. Further, we developed and applied an interaction network protein scoring algorithm, which allows us to calculate a ranked list of significant FA proteins. Our result has been supporting further biological investigations of disease biologists on our team. We believe our method can be generalized to other disease biology studies with similar problems.","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":"126287665","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
首页 上一页 下一页 尾页
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学术官方微信