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

ACM SE '10最新文献

筛选
英文 中文
Incorporating real-world projects in teaching computer science courses 在计算机科学课程教学中结合实际项目
ACM SE '10 Pub Date : 2010-04-15 DOI: 10.1145/1900008.1900042
Richard C. Detmer, Cen Li, Zhijiang Dong, J. Hankins
{"title":"Incorporating real-world projects in teaching computer science courses","authors":"Richard C. Detmer, Cen Li, Zhijiang Dong, J. Hankins","doi":"10.1145/1900008.1900042","DOIUrl":"https://doi.org/10.1145/1900008.1900042","url":null,"abstract":"Research has shown students are more motivated and more likely to perform active learning when working on real-world projects that have societal impact. The Computer Science Department at Middle Tennessee State University has embarked on the task of incorporating real-world projects into multiple courses across the curriculum. This paper describes the real world project collection process and a management framework being developed to collect and track the usage of real-world projects for Computer Science courses. It discusses pilot courses that used real-world projects in teaching various computing subjects, as well as lessons learned from these pilot studies.","PeriodicalId":333104,"journal":{"name":"ACM SE '10","volume":"57 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132738487","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
Aiding prediction algorithms in detecting high-dimensional malicious applications using a randomized projection technique 利用随机投影技术帮助预测算法检测高维恶意应用程序
ACM SE '10 Pub Date : 2010-04-15 DOI: 10.1145/1900008.1900117
T. Atkison
{"title":"Aiding prediction algorithms in detecting high-dimensional malicious applications using a randomized projection technique","authors":"T. Atkison","doi":"10.1145/1900008.1900117","DOIUrl":"https://doi.org/10.1145/1900008.1900117","url":null,"abstract":"This research paper describes an on-going effort to design, develop and improve upon malicious application detection algorithms. This work looks specifically at improving a cosine similarity, information retrieval technique to enhance detection of known and variances of known malicious applications by applying the feature extraction technique known as randomized projection. Document similarity techniques, such as cosine similarity, have been used with great success in several document retrieval applications. By following a standard information retrieval methodology, software, in machine readable format, can be regarded as documents in the corpus. These \"documents\" may or may not have a known malicious functionality. The query is software, again in machine readable format, which contains a certain type of malicious software. This methodology provides an ability to search the corpus with a query and retrieve/identify potentially malicious software as well as other instances of the same type of vulnerability. Retrieval is based on the similarity of the query to a given document in the corpus. There have been several efforts to overcome what is known as 'the curse of dimensionality' that can occur with the use of this type of information retrieval technique including mutual information and randomized projections. Randomized projections are used to create a low-order embedding of the high dimensional data. Results from experimentation have shown promise over previously published efforts.","PeriodicalId":333104,"journal":{"name":"ACM SE '10","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133101431","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
Optimizing memory access on GPUs using morton order indexing 使用morton顺序索引优化gpu上的内存访问
ACM SE '10 Pub Date : 2010-04-15 DOI: 10.1145/1900008.1900035
Anthony E. Nocentino, P. J. Rhodes
{"title":"Optimizing memory access on GPUs using morton order indexing","authors":"Anthony E. Nocentino, P. J. Rhodes","doi":"10.1145/1900008.1900035","DOIUrl":"https://doi.org/10.1145/1900008.1900035","url":null,"abstract":"High performance computing environments are not freely available to every scientist or programmer. However, massively parallel computational devices are available in nearly every workstation class computer and laptop sold today. The programmable GPU gives immense computational power to a user in a standard office environment; however, programming a GPU to function efficiently is not a trivial task. An issue of primary concern is memory latency, if not managed properly it can cost the GPU in performance resulting in increased runtimes waiting for data. In this paper we describe an optimization of memory access methods on GPUs using Morton order indexing, sometimes referred to as Z-order index.","PeriodicalId":333104,"journal":{"name":"ACM SE '10","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133179706","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
Using the online webwork for student's homework practice in education 利用在线网络进行学生作业实践教育
ACM SE '10 Pub Date : 2010-04-15 DOI: 10.1145/1900008.1900121
Shangrong Deng, C. Hung, K. Qian
{"title":"Using the online webwork for student's homework practice in education","authors":"Shangrong Deng, C. Hung, K. Qian","doi":"10.1145/1900008.1900121","DOIUrl":"https://doi.org/10.1145/1900008.1900121","url":null,"abstract":"The goal of this project is to increase the success of students in learning mathematics and improve retention in STEM discipline via implementation of online WebWork in STEM education. This project will have broader impact on the teaching and learning mathematics by providing more effective and efficient homework practice. Students will benefit from the instant feedback since every homework problem is graded online. Instructors will also benefit greatly being relieved from the burden of manually checking homework and simultaneously being able to determine how well the students are learning the subject. The WebWork system has been adopted by over 100 colleges and universities in U.S. for Mathematics and Science homework delivery.","PeriodicalId":333104,"journal":{"name":"ACM SE '10","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129008164","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
The Snake-in-the-Box problem 盒子里的蛇问题
ACM SE '10 Pub Date : 2010-04-15 DOI: 10.1145/1900008.1900079
K. Krafka, W. Potter, T. Horton
{"title":"The Snake-in-the-Box problem","authors":"K. Krafka, W. Potter, T. Horton","doi":"10.1145/1900008.1900079","DOIUrl":"https://doi.org/10.1145/1900008.1900079","url":null,"abstract":"The Snake-in-the-Box problem finds its roots in graph theory and computer science with applications in electrical engineering, coding theory, analog-to-digital conversion, disjunctive normal form simplification, electronic combination locking, and computer network topologies. This fascinating problem has puzzled scholars for over 50 years, but research has produced steady progress. Here, we provide an overview of the problem, its history, and current research, including a potential solution.","PeriodicalId":333104,"journal":{"name":"ACM SE '10","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125563281","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}
引用次数: 16
On the performance of fitness uniform selection for non-deceptive problems 非欺骗问题的适应度均匀选择性能
ACM SE '10 Pub Date : 2010-04-15 DOI: 10.1145/1900008.1900053
Ruben Ramirez-Padron, Feras A. Batarseh, K. Heyne, A. Wu, Avelino J. Gonzalez
{"title":"On the performance of fitness uniform selection for non-deceptive problems","authors":"Ruben Ramirez-Padron, Feras A. Batarseh, K. Heyne, A. Wu, Avelino J. Gonzalez","doi":"10.1145/1900008.1900053","DOIUrl":"https://doi.org/10.1145/1900008.1900053","url":null,"abstract":"Genetic algorithms (GAs) are probabilistic search techniques inspired by natural evolution. Selection schemes are used by GAs to choose individuals from a population to breed the next generation. Proportionate, ranking and tournament selection are standard selection schemes. They focus on choosing individuals with high fitness values. Fitness Uniform Selection Scheme (FUSS) is a recently proposed selection scheme that focuses on fitness diversity. FUSS have shown better performance than standard selection schemes for deceptive and NP-complete problems. In general, it is difficult to determine whether a real-life problem is deceptive or not. However, there is no information about the relative performance of FUSS on non-deceptive problems. In this paper, the standard selection schemes mentioned above were compared to FUSS on two non-deceptive problems. A GA using FUSS was able to find high-fitness solutions faster than expected. Consequently, FUSS could be a good first-choice selection scheme regardless of whether a problem at hand is deceptive or not.","PeriodicalId":333104,"journal":{"name":"ACM SE '10","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126998926","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
AD-NEMO: adaptive dynamic network expansion with mobile robots AD-NEMO:移动机器人自适应动态网络扩展
ACM SE '10 Pub Date : 2010-04-15 DOI: 10.1145/1900008.1900036
G. Rudolph, S. Banik, W. Gilbert
{"title":"AD-NEMO: adaptive dynamic network expansion with mobile robots","authors":"G. Rudolph, S. Banik, W. Gilbert","doi":"10.1145/1900008.1900036","DOIUrl":"https://doi.org/10.1145/1900008.1900036","url":null,"abstract":"Consider a situation in which a mobile wireless user needs connectivity to the Internet. One such situation arises in battlefield or at disaster recovery site where it may not be feasible to set up a fixed network. An alternative solution to this problem is to send out a team of mobile robots to establish and maintain the connection between the user and an established network that is connected to the Internet. This includes the possibility of sending out new robots to join the team as needed, when the user moves beyond the range of the existing team, or if the signal becomes degraded for some reason. In this paper we propose a framework called AD-NEMO (Adaptive Dynamic Network Expansion with Mobile rObots) where the mobile robots will create a dynamic and adaptive ad-hoc network to provide connectivity to the mobile user. We have developed a prototype of our solution with actual hardware to study the feasibility of our solution.","PeriodicalId":333104,"journal":{"name":"ACM SE '10","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125831647","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
Simple XML messaging framework 简单XML消息传递框架
ACM SE '10 Pub Date : 2010-04-15 DOI: 10.1145/1900008.1900149
T. Toland
{"title":"Simple XML messaging framework","authors":"T. Toland","doi":"10.1145/1900008.1900149","DOIUrl":"https://doi.org/10.1145/1900008.1900149","url":null,"abstract":"In a global economy, there is clearly a need to have remote access to information. Organizations provide this access to their customers via Service-Oriented Architecture (SOA) or Web Services (WS). These technologies use the Extensible Markup Language (XML) to exchange information. In this paper, the Simple XML Messaging Framework is presented. This framework can be used to exchange information in either a SOA or a WS environment. A prototype has been implemented and used in a course at the University of South Carolina Upstate to simulate a SOA environment. An analysis from this course is presented.","PeriodicalId":333104,"journal":{"name":"ACM SE '10","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125875466","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
Visualizations for the spyglass ontology-based information analysis and retrieval system 基于本体的望远镜信息分析与检索系统的可视化
ACM SE '10 Pub Date : 2010-04-15 DOI: 10.1145/1900008.1900061
Hong Lin, J. Rushing, T. Berendes, Cara Stein, S. Graves
{"title":"Visualizations for the spyglass ontology-based information analysis and retrieval system","authors":"Hong Lin, J. Rushing, T. Berendes, Cara Stein, S. Graves","doi":"10.1145/1900008.1900061","DOIUrl":"https://doi.org/10.1145/1900008.1900061","url":null,"abstract":"Spyglass is an ontology-based information retrieval system designed to help analysts explore very large collections of unstructured text documents. The tool includes two main components: server and client. The server is a web-based service that uses a specific domain ontology to index a collection of documents, answer queries from the client, and provide retrieval and visualization services based on the ontology and the resulting index. The client is a graphical user interface which allows analysts to explore the document collections, query single or multiple entities of interest of the ontology and retrieve the documents relevant to the query. The rich set of visualization tools in Spyglass will be presented in this paper.","PeriodicalId":333104,"journal":{"name":"ACM SE '10","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130189786","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
An ontology-driven rote extractor for pattern disambiguation 用于模式消歧的本体驱动的机械提取器
ACM SE '10 Pub Date : 2010-04-15 DOI: 10.1145/1900008.1900049
Sheng Yin, I. Arpinar
{"title":"An ontology-driven rote extractor for pattern disambiguation","authors":"Sheng Yin, I. Arpinar","doi":"10.1145/1900008.1900049","DOIUrl":"https://doi.org/10.1145/1900008.1900049","url":null,"abstract":"In this paper, we describe an ontology-driven pattern disambiguation process for Rote Extractors. Our approach can generate lexical patterns for a particular relation from unrestricted text. Then patterns can be used to recognize concepts, which have the same relation in other text. We test our experiments with/without the ontology. The results show that our approach can dramatically improve the performance of existing pattern-based Rote Extractors.","PeriodicalId":333104,"journal":{"name":"ACM SE '10","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125793755","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
首页 上一页
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学术官方微信