With the prevalence of mobile computing devices such as smart phones we are interested in expanding their usage to resource intensive software. The challenges we face include lack of software libraries to run various applications limited battery life limited computational power vs. regular desktops and workstations and network connectivity. In this poster, we propose a desktop grid framework in which a mobile device accepts the input for a resource intensive application, dispatches it to a remote workstation (an agent) via Bluetooth or wireless network. Specifically, we discuss what we propose to research in terms of developing this framework. The agent workstation then uses peer to peer desktop grid computing to execute an application and returns the results back to the mobile device.
{"title":"Executing resource intensive applications on mobile devices","authors":"Kenny King, Justine Rutherford, P. Uppuluri","doi":"10.1145/1900008.1900124","DOIUrl":"https://doi.org/10.1145/1900008.1900124","url":null,"abstract":"With the prevalence of mobile computing devices such as smart phones we are interested in expanding their usage to resource intensive software. The challenges we face include lack of software libraries to run various applications limited battery life limited computational power vs. regular desktops and workstations and network connectivity. In this poster, we propose a desktop grid framework in which a mobile device accepts the input for a resource intensive application, dispatches it to a remote workstation (an agent) via Bluetooth or wireless network. Specifically, we discuss what we propose to research in terms of developing this framework. The agent workstation then uses peer to peer desktop grid computing to execute an application and returns the results back to the mobile device.","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":"125400425","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}
Reinforcement Programming (RP) is a new technique for automatically generating a computer program using reinforcement learning methods. This paper describes how RP learned to generate code for three binary addition problems: simulate a full adder circuit, increment a binary number, and add two binary numbers. Each problem is presented as an extension of the one previous to it, which provides an introduction to the practical application of RP. Each solution uses a dynamic, episodic form of delayed Q-Learning algorithm. "Dynamic" means that grows the policy during learning, and prunes it before the policy is translated to source code. This is different from Q-Learning models that use fixed-size tables or neural net function approximators to store q-values associated with (state, action) pairs. The states, actions, rewards, other parameters, and results of experiments are presented for each of the three problems.
{"title":"Generating three binary addition algorithms using reinforcement programming","authors":"S. White, T. Martinez, G. Rudolph","doi":"10.1145/1900008.1900072","DOIUrl":"https://doi.org/10.1145/1900008.1900072","url":null,"abstract":"Reinforcement Programming (RP) is a new technique for automatically generating a computer program using reinforcement learning methods. This paper describes how RP learned to generate code for three binary addition problems: simulate a full adder circuit, increment a binary number, and add two binary numbers. Each problem is presented as an extension of the one previous to it, which provides an introduction to the practical application of RP. Each solution uses a dynamic, episodic form of delayed Q-Learning algorithm. \"Dynamic\" means that grows the policy during learning, and prunes it before the policy is translated to source code. This is different from Q-Learning models that use fixed-size tables or neural net function approximators to store q-values associated with (state, action) pairs. The states, actions, rewards, other parameters, and results of experiments are presented for each of the three problems.","PeriodicalId":333104,"journal":{"name":"ACM SE '10","volume":"41 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":"126127026","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}
The rapid growth of embedded systems has resulted in a shortage of professionals in embedded software development. Despite the high demand of embedded system professionals, the embedded system curriculum is not well represented in current academic programs. Existing instruction models rely on two prerequisites: 1) significant investment in resources (e.g., embedded system labs), and 2) a higher knowledge base requirement for instructors (e.g., faculty whose expertise not in this area). The universities and colleges lacking in the resources and build-ups in this field are difficult to meet such requirements to offer embedded systems curriculum. We are developing a new embedded system curriculum with real hands-on "Labs In A Box" (LIAB) that is portable, modular, and easy to be adopted worldwide. The modern technologies including wireless and smart sensor network are infused into the courseware to meet the industrial demand. The proposed courseware targets on universities/colleges that have limited resources for teaching undergraduate embedded system curriculum. The new courseware includes teaching modules on foundational and emerging topics, real hands-on lab modules, and projects based on the inexpensive portable LIAB. Accompanying with the LIAB is a textbook entitled "Embedded Software Development with C" published by the Springer publisher.
{"title":"A novel embedded system curriculum with portable hands-on labs in a box","authors":"K. Qian, D. Lo","doi":"10.1145/1900008.1900081","DOIUrl":"https://doi.org/10.1145/1900008.1900081","url":null,"abstract":"The rapid growth of embedded systems has resulted in a shortage of professionals in embedded software development. Despite the high demand of embedded system professionals, the embedded system curriculum is not well represented in current academic programs. Existing instruction models rely on two prerequisites: 1) significant investment in resources (e.g., embedded system labs), and 2) a higher knowledge base requirement for instructors (e.g., faculty whose expertise not in this area). The universities and colleges lacking in the resources and build-ups in this field are difficult to meet such requirements to offer embedded systems curriculum. We are developing a new embedded system curriculum with real hands-on \"Labs In A Box\" (LIAB) that is portable, modular, and easy to be adopted worldwide. The modern technologies including wireless and smart sensor network are infused into the courseware to meet the industrial demand. The proposed courseware targets on universities/colleges that have limited resources for teaching undergraduate embedded system curriculum. The new courseware includes teaching modules on foundational and emerging topics, real hands-on lab modules, and projects based on the inexpensive portable LIAB. Accompanying with the LIAB is a textbook entitled \"Embedded Software Development with C\" published by the Springer publisher.","PeriodicalId":333104,"journal":{"name":"ACM SE '10","volume":"62 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":"127638753","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}
Fei Teng, Aik Min Choong, S. Gustafson, Dwight Waddell, Pamela B. Lawhead, Yixin Chen
The sum of sine waves was used to evoke Steady State Visual Evoked Potentials (SSVEP). The SSVEP responses were elicited by visual stimuli in the form of a flickering light emitting diode (LED). We recorded EEG responses to these stimuli and analyzed the observed spectral differences due to square waves, triangle waves and sine waves. We showed that the resolution of the dual stimuli, which is defined as the difference between two frequencies, is essential to SSVEP experiments. Reliable dual SSVEP spikes from EEG signals can only be acquired if the dual stimuli are at least 4Hz apart. We also tested tri-stimuli and showed that consistent EEG responses are not achievable, even though the stimuli were 4Hz apart. The essence of these experiments is to demonstrate the resolutions under which dual sine waves can generate consistent SSVEP responses.
{"title":"Steady state visual evoked potentials by dual sine waves","authors":"Fei Teng, Aik Min Choong, S. Gustafson, Dwight Waddell, Pamela B. Lawhead, Yixin Chen","doi":"10.1145/1900008.1900077","DOIUrl":"https://doi.org/10.1145/1900008.1900077","url":null,"abstract":"The sum of sine waves was used to evoke Steady State Visual Evoked Potentials (SSVEP). The SSVEP responses were elicited by visual stimuli in the form of a flickering light emitting diode (LED). We recorded EEG responses to these stimuli and analyzed the observed spectral differences due to square waves, triangle waves and sine waves. We showed that the resolution of the dual stimuli, which is defined as the difference between two frequencies, is essential to SSVEP experiments. Reliable dual SSVEP spikes from EEG signals can only be acquired if the dual stimuli are at least 4Hz apart. We also tested tri-stimuli and showed that consistent EEG responses are not achievable, even though the stimuli were 4Hz apart. The essence of these experiments is to demonstrate the resolutions under which dual sine waves can generate consistent SSVEP responses.","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":"129947866","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}
The teaching of the development of library units seems to lack the attention it deserves in undergraduate education. References to such topic can be found mainly for the professional programer. CS2 provides a great opportunity to teach an initial set of best practices and patterns for the design library units which provide students with a strong foundation for later use in the development of APIs. We present a carefully selected set of patterns and best practices culled through several years teaching data structures. These patterns and practices are aimed to guide the student in the specification, implementation and testing of library units.
{"title":"Library unit development fundamentals","authors":"Jaime Niño","doi":"10.1145/1900008.1900041","DOIUrl":"https://doi.org/10.1145/1900008.1900041","url":null,"abstract":"The teaching of the development of library units seems to lack the attention it deserves in undergraduate education. References to such topic can be found mainly for the professional programer. CS2 provides a great opportunity to teach an initial set of best practices and patterns for the design library units which provide students with a strong foundation for later use in the development of APIs. We present a carefully selected set of patterns and best practices culled through several years teaching data structures. These patterns and practices are aimed to guide the student in the specification, implementation and testing of library units.","PeriodicalId":333104,"journal":{"name":"ACM SE '10","volume":"23 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":"123114882","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}
We present the theory and implementation of the acoustic Doppler effect in which a sequence of digital audio samples recorded at a sound source is transformed into a sequence of samples to represent the sounds perceived by an observer. The computational model alters the frequencies and amplitude of the original sequence, taking into account the simultaneous effects of a moving source, a moving observer, and a moving medium of propagation. One application is the real-time generation of the sounds of moving objects in a computer game as perceived by players of the game.
{"title":"Synthesizing the acoustic Doppler effect in software","authors":"P. Sonnek, S. V. Rice","doi":"10.1145/1900008.1900103","DOIUrl":"https://doi.org/10.1145/1900008.1900103","url":null,"abstract":"We present the theory and implementation of the acoustic Doppler effect in which a sequence of digital audio samples recorded at a sound source is transformed into a sequence of samples to represent the sounds perceived by an observer. The computational model alters the frequencies and amplitude of the original sequence, taking into account the simultaneous effects of a moving source, a moving observer, and a moving medium of propagation. One application is the real-time generation of the sounds of moving objects in a computer game as perceived by players of the game.","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":"115844410","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}
Various optimization methods are used along with the standard clustering algorithms to make the clustering process simpler and quicker. In this paper we propose a new hybrid technique of clustering known as K-Evolutionary Particle Swarm Optimization (KEPSO) based on the concept of Particle Swarm Optimization (PSO). The proposed algorithm uses the K-means algorithm as the first step and the Evolutionary Particle Swarm Optimization (EPSO) algorithm as the second step to perform clustering. The experiments were performed using the clustering benchmark data. This method was compared with the standard K-means and EPSO algorithms. The results show that this method produced compact results and performed faster than other clustering algorithms. Later, the algorithm was used to cluster web pages. The web pages were clustered by first cleaning the unnecessary data and then labeling the obtained web pages to categorize them.
{"title":"Applying hybrid Kepso clustering to web pages","authors":"Teng-Sheng Moh, Ameya Sabnis","doi":"10.1145/1900008.1900027","DOIUrl":"https://doi.org/10.1145/1900008.1900027","url":null,"abstract":"Various optimization methods are used along with the standard clustering algorithms to make the clustering process simpler and quicker. In this paper we propose a new hybrid technique of clustering known as K-Evolutionary Particle Swarm Optimization (KEPSO) based on the concept of Particle Swarm Optimization (PSO). The proposed algorithm uses the K-means algorithm as the first step and the Evolutionary Particle Swarm Optimization (EPSO) algorithm as the second step to perform clustering. The experiments were performed using the clustering benchmark data. This method was compared with the standard K-means and EPSO algorithms. The results show that this method produced compact results and performed faster than other clustering algorithms. Later, the algorithm was used to cluster web pages. The web pages were clustered by first cleaning the unnecessary data and then labeling the obtained web pages to categorize them.","PeriodicalId":333104,"journal":{"name":"ACM SE '10","volume":"15 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":"131174771","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}
We present a channelization protocol based on frequency division multiplexing to enable fast, reliable, multi-hop data transmission with minimal protocol overhead in wireless sensor networks. The protocol enables data transmission to occur at a high rate by eliminating intra-path collisions along a multi-hop routing path. This is achieved by staggering communication frequencies such that no two adjacent nodes transmit data at the same radio frequency. We describe the design and implementation of the protocol and present extensive experimental results to validate its efficacy.
{"title":"A channelization protocol for multi-hop wireless sensor networks using frequency division multiplexing","authors":"B. Mazumder, V. Venugopalan, J. Hallstrom","doi":"10.1145/1900008.1900018","DOIUrl":"https://doi.org/10.1145/1900008.1900018","url":null,"abstract":"We present a channelization protocol based on frequency division multiplexing to enable fast, reliable, multi-hop data transmission with minimal protocol overhead in wireless sensor networks. The protocol enables data transmission to occur at a high rate by eliminating intra-path collisions along a multi-hop routing path. This is achieved by staggering communication frequencies such that no two adjacent nodes transmit data at the same radio frequency. We describe the design and implementation of the protocol and present extensive experimental results to validate its efficacy.","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":"127036947","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 continuous research on data analysis based on our previous work on cluster-outlier iterative detection approach in subspace. Based on the observation that, for noisy data sets, clusters and outliers can not be processed efficiently when they are handled separately from each other, we proposed a cluster-outlier iterative detection algorithm in full data space in our previous work [22]. Due to the fact that the real data sets normally have high dimensionality, and natural clusters and outliers do not exist in the full data space, we proposed an algorithm (SubCOID) to detect clusters and outliers in subspace [21]. However, it is not a trivial task to associate each cluster and each outlier with different subsets of dimensions. In this paper, we present the improved SubCOID algorithm, applying some novel approach to choosing a unique subset of dimensions for each cluster and each outlier. The selection is based on the intra-relationship within clusters, the intra-relationship within outliers, and the inter-relationship between clusters and outliers. This process is performed iteratively until a certain termination condition is reached. This data processing algorithm can be applied in many fields such as pattern recognition, data clustering and signal processing.
{"title":"Towards improving subspace data analysis","authors":"Yong Shi","doi":"10.1145/1900008.1900093","DOIUrl":"https://doi.org/10.1145/1900008.1900093","url":null,"abstract":"In this paper, we present continuous research on data analysis based on our previous work on cluster-outlier iterative detection approach in subspace. Based on the observation that, for noisy data sets, clusters and outliers can not be processed efficiently when they are handled separately from each other, we proposed a cluster-outlier iterative detection algorithm in full data space in our previous work [22]. Due to the fact that the real data sets normally have high dimensionality, and natural clusters and outliers do not exist in the full data space, we proposed an algorithm (SubCOID) to detect clusters and outliers in subspace [21]. However, it is not a trivial task to associate each cluster and each outlier with different subsets of dimensions. In this paper, we present the improved SubCOID algorithm, applying some novel approach to choosing a unique subset of dimensions for each cluster and each outlier. The selection is based on the intra-relationship within clusters, the intra-relationship within outliers, and the inter-relationship between clusters and outliers. This process is performed iteratively until a certain termination condition is reached. This data processing algorithm can be applied in many fields such as pattern recognition, data clustering and signal processing.","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":"114596951","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 presents work in progress on the research and development of a robotic air-hockey opponent. We discuss implementation issues, software design and continuing development goals.
本文介绍了一种机器人空气曲棍球对手的研究和开发工作。我们讨论实现问题、软件设计和持续开发目标。
{"title":"Simulation coupled learning for a robotic opponent","authors":"J. Reid","doi":"10.1145/1900008.1900078","DOIUrl":"https://doi.org/10.1145/1900008.1900078","url":null,"abstract":"This paper presents work in progress on the research and development of a robotic air-hockey opponent. We discuss implementation issues, software design and continuing development goals.","PeriodicalId":333104,"journal":{"name":"ACM SE '10","volume":"39 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":"114605495","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
扫码关注我们
求助内容：
应助结果提醒方式：