Although it takes O(n2) worst-case time to solve a stable marriage problem instance with n men and n women, a trivial O(n) algorithm suffices if all men are known to have identical preference lists and all women also are known to have identical preference lists. Since real-world instances often involve men or women with similar but not necessarily identical preference lists, this motivates us to introduce the notion of an adaptive stable marriage algorithm --- an algorithm whose running time is of the form O(n + k), where k describes the aggregate amount of disagreement between the preference lists in our instance versus a pair of specified "consensus" preference lists, one for the men and one for women. The running time of an adaptive stable matching algorithm therefore gracefully scales from O(n2) in the worse case down to O(n) in the case where preference lists are all in close agreement. We show how the O(n+k) running time bound can be achieved if all women are known to have identical preference lists, leaving the case where both men and women can have non-identical but similar preference lists as an open question. We also show how this special case may serve as a good model for sports drafts.
{"title":"Adaptive stable marriage algorithms","authors":"John Dabney, B. C. Dean","doi":"10.1145/1900008.1900057","DOIUrl":"https://doi.org/10.1145/1900008.1900057","url":null,"abstract":"Although it takes O(n2) worst-case time to solve a stable marriage problem instance with n men and n women, a trivial O(n) algorithm suffices if all men are known to have identical preference lists and all women also are known to have identical preference lists. Since real-world instances often involve men or women with similar but not necessarily identical preference lists, this motivates us to introduce the notion of an adaptive stable marriage algorithm --- an algorithm whose running time is of the form O(n + k), where k describes the aggregate amount of disagreement between the preference lists in our instance versus a pair of specified \"consensus\" preference lists, one for the men and one for women. The running time of an adaptive stable matching algorithm therefore gracefully scales from O(n2) in the worse case down to O(n) in the case where preference lists are all in close agreement. We show how the O(n+k) running time bound can be achieved if all women are known to have identical preference lists, leaving the case where both men and women can have non-identical but similar preference lists as an open question. We also show how this special case may serve as a good model for sports drafts.","PeriodicalId":333104,"journal":{"name":"ACM SE '10","volume":"12 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":"114828448","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}
Trust Management (TM) systems are frameworks for managing security in decentralized environments. Recently two TM systems were presented that support authorization in variable-threat environments: the first one deals with unanticipated network activities, the second with unanticipated user behavior. A trust agent is used to monitor the threat levels in each domain of the system. When the level is elevated, access to resources may be revoked, independently of other trust mechanisms that may apply (based on discretionary or mandatory controls). When the threat level is later lowered, services get restored---this is termed rollback access. In this paper we explore the application of Markov chains and hidden Markov models to trace anomalous domain and/or user behavior. Our model for TM in variable-threat environments provides for real-time proactive system defenses, based on anomalous behavior. Such behavior is not necessarily caused by adversarial actions: it is triggered by atypical behavior during a certain time-period. This is because with security critical applications it is not always possible to distinguish malicious from atypical behavior---of course our model also defends against malicious behavior that can be identified (using Intrusion Detection mechanisms). Our approach supports a new control layer, the Threat Level Control (TLC) layer, above the existing MAC and DAC layers, and implements a novel real-time Markov stochastic anomaly analyzer that defends system resources by using threat level controls. This work is part of ongoing research to develop dynamic, real-time trigger mechanisms for rollback-access Trust Management systems.
{"title":"Markov anomaly modeling for trust management in variable threat environments","authors":"W. O. Redwood, M. Burmester","doi":"10.1145/1900008.1900155","DOIUrl":"https://doi.org/10.1145/1900008.1900155","url":null,"abstract":"Trust Management (TM) systems are frameworks for managing security in decentralized environments. Recently two TM systems were presented that support authorization in variable-threat environments: the first one deals with unanticipated network activities, the second with unanticipated user behavior. A trust agent is used to monitor the threat levels in each domain of the system. When the level is elevated, access to resources may be revoked, independently of other trust mechanisms that may apply (based on discretionary or mandatory controls). When the threat level is later lowered, services get restored---this is termed rollback access.\u0000 In this paper we explore the application of Markov chains and hidden Markov models to trace anomalous domain and/or user behavior. Our model for TM in variable-threat environments provides for real-time proactive system defenses, based on anomalous behavior. Such behavior is not necessarily caused by adversarial actions: it is triggered by atypical behavior during a certain time-period. This is because with security critical applications it is not always possible to distinguish malicious from atypical behavior---of course our model also defends against malicious behavior that can be identified (using Intrusion Detection mechanisms).\u0000 Our approach supports a new control layer, the Threat Level Control (TLC) layer, above the existing MAC and DAC layers, and implements a novel real-time Markov stochastic anomaly analyzer that defends system resources by using threat level controls.\u0000 This work is part of ongoing research to develop dynamic, real-time trigger mechanisms for rollback-access Trust Management systems.","PeriodicalId":333104,"journal":{"name":"ACM SE '10","volume":"36 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":"114910506","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}
Wenbo Wang, Christopher Thomas, A. Sheth, Victor Chan
Many research studies adopt manually selected patterns for semantic relation extraction. However, manually identifying and discovering patterns is time consuming and it is difficult to discover all potential candidates. Instead, we propose an automatic pattern construction approach to extract verb synonyms and antonyms from English newspapers. Instead of relying on a single pattern, we combine results indicated by multiple patterns to maximize the recall.
{"title":"Pattern-based synonym and antonym extraction","authors":"Wenbo Wang, Christopher Thomas, A. Sheth, Victor Chan","doi":"10.1145/1900008.1900094","DOIUrl":"https://doi.org/10.1145/1900008.1900094","url":null,"abstract":"Many research studies adopt manually selected patterns for semantic relation extraction. However, manually identifying and discovering patterns is time consuming and it is difficult to discover all potential candidates. Instead, we propose an automatic pattern construction approach to extract verb synonyms and antonyms from English newspapers. Instead of relying on a single pattern, we combine results indicated by multiple patterns to maximize the recall.","PeriodicalId":333104,"journal":{"name":"ACM SE '10","volume":"49 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":"123182808","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}
Although the two-year curriculum guide includes coverage of all eight software engineering core topics, the computer science courses taught in the Alabama community colleges limit student exposure to the programming, or coding, phase of the software development lifecycle and offer little experience in requirements analysis, design, testing, and maintenance. We propose that some software engineering principles can be incorporated into the introductory level of the computer science curriculum. Our vision is to give community college students a broader exposure to the software development lifecycle. For those students who plan to transfer to a baccalaureate program subsequent to their community college education, our vision is to prepare them sufficiently to move seamlessly into mainstream computer science and software engineering degrees. For those students who plan to move from the community college to a programming career, our vision is to equip them with the foundational knowledge and skills required by the software industry.
{"title":"Imprinting community college computer science education with software engineering principles: work in progress","authors":"Jacqueline Hundley","doi":"10.1145/1900008.1900082","DOIUrl":"https://doi.org/10.1145/1900008.1900082","url":null,"abstract":"Although the two-year curriculum guide includes coverage of all eight software engineering core topics, the computer science courses taught in the Alabama community colleges limit student exposure to the programming, or coding, phase of the software development lifecycle and offer little experience in requirements analysis, design, testing, and maintenance. We propose that some software engineering principles can be incorporated into the introductory level of the computer science curriculum. Our vision is to give community college students a broader exposure to the software development lifecycle. For those students who plan to transfer to a baccalaureate program subsequent to their community college education, our vision is to prepare them sufficiently to move seamlessly into mainstream computer science and software engineering degrees. For those students who plan to move from the community college to a programming career, our vision is to equip them with the foundational knowledge and skills required by the software industry.","PeriodicalId":333104,"journal":{"name":"ACM SE '10","volume":"137 3 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":"128656546","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}
As software becomes more prevalent in society and attacks and faults grow, it is important to have software that can survive. Autopoietic software exists to continuously repair, recreate, and improve itself without producing any computational result or providing any service. Replicated software introduces redundancy into software with diverse, redundant components doing tasks. This research proposes to work in an unbounded environment with agents used to search for software components that exhibit signs of faults, or attacks. The autopoietic agents would kill these processes and similar processes to make the healthy components more available and able to proactively deal with attacks, faults and errors.
{"title":"Using allopoietic agents in replicated software to respond to errors, faults, and attacks","authors":"C. Bandy","doi":"10.1145/1900008.1900091","DOIUrl":"https://doi.org/10.1145/1900008.1900091","url":null,"abstract":"As software becomes more prevalent in society and attacks and faults grow, it is important to have software that can survive. Autopoietic software exists to continuously repair, recreate, and improve itself without producing any computational result or providing any service. Replicated software introduces redundancy into software with diverse, redundant components doing tasks. This research proposes to work in an unbounded environment with agents used to search for software components that exhibit signs of faults, or attacks. The autopoietic agents would kill these processes and similar processes to make the healthy components more available and able to proactively deal with attacks, faults and errors.","PeriodicalId":333104,"journal":{"name":"ACM SE '10","volume":"168 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":"116492284","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}
Active contours represent a widely used segmentation technique. Classical developments often involve great algorithmic complexity, inconveniences with local minima and low convergence to boundary concavities. This paper describes an approach based on a Coarse-to-Fine Normal Neighborhoods strategy (CoFiN2) which leads to lower computational costs, being robust to local minima, and encourages convergence to boundary concavities. This approach is compared with classical methods and is applied on Magnetic Resonance Imaging (MRI) in a real time application.
{"title":"On real time active contours","authors":"Cheng Jin","doi":"10.1145/1900008.1900073","DOIUrl":"https://doi.org/10.1145/1900008.1900073","url":null,"abstract":"Active contours represent a widely used segmentation technique. Classical developments often involve great algorithmic complexity, inconveniences with local minima and low convergence to boundary concavities. This paper describes an approach based on a Coarse-to-Fine Normal Neighborhoods strategy (CoFiN2) which leads to lower computational costs, being robust to local minima, and encourages convergence to boundary concavities. This approach is compared with classical methods and is applied on Magnetic Resonance Imaging (MRI) in a real time application.","PeriodicalId":333104,"journal":{"name":"ACM SE '10","volume":"71 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":"126257499","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}
In this paper, we present a novel algorithm for shot boundary detection and key frame extraction from video sequences. Saliency maps representing the attended regions are produced from the color and luminance features of the video frames. Introducing a novel signal fidelity measurement -saliency based structural similarity index- the similarity of the maps is measured. Based on the similarities, shot boundaries and key frames are determined. Proposed algorithm is tested on neurosurgical videos and precision and recall performances are measured. Experimental results validate effectiveness of the proposed shot boundary detection and key frame extraction algorithm. Moreover, the algorithm is robust to dissolving digital video effects used in shot transition.
{"title":"Shot boundary detection and key frame extraction using salient region detection and structural similarity","authors":"E. Mendi, Coskun Bayrak","doi":"10.1145/1900008.1900096","DOIUrl":"https://doi.org/10.1145/1900008.1900096","url":null,"abstract":"In this paper, we present a novel algorithm for shot boundary detection and key frame extraction from video sequences. Saliency maps representing the attended regions are produced from the color and luminance features of the video frames. Introducing a novel signal fidelity measurement -saliency based structural similarity index- the similarity of the maps is measured. Based on the similarities, shot boundaries and key frames are determined. Proposed algorithm is tested on neurosurgical videos and precision and recall performances are measured. Experimental results validate effectiveness of the proposed shot boundary detection and key frame extraction algorithm. Moreover, the algorithm is robust to dissolving digital video effects used in shot transition.","PeriodicalId":333104,"journal":{"name":"ACM SE '10","volume":"36 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":"126165689","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}
Sammi is a 3-Dimensional Virtual Human Information Kiosk for use by the Computer Science department at The University of North Carolina Wilmington. Sammi's purpose is to provide information to users about UNCW's Computer Science department, including the faculty, staff, building, and courses offered. She is also able to answer general questions about UNCW and has the ability to carry on an intelligent conversation when the statements or questions are outside the domain of UNCW. Sammi, once fully functional, is to be located in the Computer Information Systems Building. The majority of users will be UNCW students. Sammi will take speech as input and will output speech and graphics (such as maps and diagrams). We describe the design, development, and architecture of Sammi and will discuss the accuracy of her responses to questions from users in our field test.
{"title":"Sammi: a 3-dimensional virtual human information kiosk","authors":"J. Vandeventer, B. Barbour","doi":"10.1145/1900008.1900024","DOIUrl":"https://doi.org/10.1145/1900008.1900024","url":null,"abstract":"Sammi is a 3-Dimensional Virtual Human Information Kiosk for use by the Computer Science department at The University of North Carolina Wilmington. Sammi's purpose is to provide information to users about UNCW's Computer Science department, including the faculty, staff, building, and courses offered. She is also able to answer general questions about UNCW and has the ability to carry on an intelligent conversation when the statements or questions are outside the domain of UNCW. Sammi, once fully functional, is to be located in the Computer Information Systems Building. The majority of users will be UNCW students. Sammi will take speech as input and will output speech and graphics (such as maps and diagrams). We describe the design, development, and architecture of Sammi and will discuss the accuracy of her responses to questions from users in our field test.","PeriodicalId":333104,"journal":{"name":"ACM SE '10","volume":"24 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":"125737847","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}
This paper discusses the development of Open Math Content Dictionaries (CDs) for Geometric Algebra (GA) in support of efforts towards developing a Physics Markup Language (PML). This paper introduces the underlying principles of a PML. The background on the various bodies of knowledge that are being leveraged including markup languages, GA, and OpenMath are introduced. The approach for the creation of CDs specific to GA is presented with an amplifying example. Four GA CDs were constructed proving the capabilities for standardizing GA semantics and PML development.
{"title":"Defining geometric algebra semantics","authors":"Samantha Zambo","doi":"10.1145/1900008.1900157","DOIUrl":"https://doi.org/10.1145/1900008.1900157","url":null,"abstract":"This paper discusses the development of Open Math Content Dictionaries (CDs) for Geometric Algebra (GA) in support of efforts towards developing a Physics Markup Language (PML). This paper introduces the underlying principles of a PML. The background on the various bodies of knowledge that are being leveraged including markup languages, GA, and OpenMath are introduced. The approach for the creation of CDs specific to GA is presented with an amplifying example. Four GA CDs were constructed proving the capabilities for standardizing GA semantics and PML development.","PeriodicalId":333104,"journal":{"name":"ACM SE '10","volume":"68 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":"125190141","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}
Discrete mathematics is an important foundation of computer science. Especially during the last decade, resources for instructors have been designed to meet the needs in computer science education. These resources try to present relevant concepts in an engaging way. But the students do not necessarily recognize how discrete mathematics applies to their profession. This paper presents exercises and problems that relate directly to the material a computer science student encounters during his or her studies, so students are more motivated to delve into discrete mathematics.
{"title":"Making discrete mathematics relevant","authors":"Anja Remshagen","doi":"10.1145/1900008.1900060","DOIUrl":"https://doi.org/10.1145/1900008.1900060","url":null,"abstract":"Discrete mathematics is an important foundation of computer science. Especially during the last decade, resources for instructors have been designed to meet the needs in computer science education. These resources try to present relevant concepts in an engaging way. But the students do not necessarily recognize how discrete mathematics applies to their profession. This paper presents exercises and problems that relate directly to the material a computer science student encounters during his or her studies, so students are more motivated to delve into discrete mathematics.","PeriodicalId":333104,"journal":{"name":"ACM SE '10","volume":"30 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":"130876902","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：