Current Search: Computer Science (x)
View All Items
(1 - 11 of 11)
- Title
- The Relationship of Computer Science Immersion in Elementary Schools to Achievement of High Poverty Students.
- Creator
-
Erickson, Keith, Taylor, Rosemarye, Ceballos, Marjorie, Gordon, William, Clark, M. H., University of Central Florida
- Abstract / Description
-
The purpose of this study was to determine if a relationship existed between the implementation of a computer science immersive learning experience and achievement on the Florida Standards Assessment (FSA) English Language Arts (ELA) or the FSA Mathematics. Two research questions, each with two sub-questions, guided the research of the study. The sub-questions addressed historically underrepresented groups in computer science. These subgroups included African Americans, Hispanics, Mixed Race...
Show moreThe purpose of this study was to determine if a relationship existed between the implementation of a computer science immersive learning experience and achievement on the Florida Standards Assessment (FSA) English Language Arts (ELA) or the FSA Mathematics. Two research questions, each with two sub-questions, guided the research of the study. The sub-questions addressed historically underrepresented groups in computer science. These subgroups included African Americans, Hispanics, Mixed Race individuals, and females. Research Question 1 analyzed the relationship between the implementation of the computer science immersive learning experience when a cohort control group design was used. Research Question 2 determined if a relationship existed when the treatment schools were compared to demographically similar schools that did not receive the treatment of computer science immersion. A two-way analysis of variances (ANOVA) was run for each of the research questions with the subgroups of students used as moderators for the treatment. Statistical significance was found for the following groups; fourth grade ELA Hispanic cohort, fourth grade Hispanic mathematics cohort, third grade ELA cohort, third grade mathematics cohort, the ELA treatment group, and the mathematics treatment group. Statistically significant findings showed negative, positive, and neutral effects on the treatment groups. These findings provide implications for the implementation of computer science immersion in other elementary schools with similar student demographic variables. Further investigation is needed to determine other potential impacts on student achievement over time.
Show less - Date Issued
- 2019
- Identifier
- CFE0007627, ucf:52559
- Format
- Document (PDF)
- PURL
- http://purl.flvc.org/ucf/fd/CFE0007627
- Title
- A FRAMEWORK FOR EFFICIENT DATA DISTRIBUTION IN PEER-TO-PEER NETWORKS.
- Creator
-
Purandare, Darshan, Guha, Ratan, University of Central Florida
- Abstract / Description
-
Peer to Peer (P2P) models are based on user altruism, wherein a user shares its content with other users in the pool and it also has an interest in the content of the other nodes. Most P2P systems in their current form are not fair in terms of the content served by a peer and the service obtained from swarm. Most systems suffer from free rider's problem where many high uplink capacity peers contribute much more than they should while many others get a free ride for downloading the content...
Show morePeer to Peer (P2P) models are based on user altruism, wherein a user shares its content with other users in the pool and it also has an interest in the content of the other nodes. Most P2P systems in their current form are not fair in terms of the content served by a peer and the service obtained from swarm. Most systems suffer from free rider's problem where many high uplink capacity peers contribute much more than they should while many others get a free ride for downloading the content. This leaves high capacity nodes with very little or no motivation to contribute. Many times such resourceful nodes exit the swarm or don't even participate. The whole scenario is unfavorable and disappointing for P2P networks in general, where participation is a must and a very important feature. As the number of users increases in the swarm, the swarm becomes robust and scalable. Other important issues in the present day P2P system are below optimal Quality of Service (QoS) in terms of download time, end-to-end latency and jitter rate, uplink utilization, excessive cross ISP traffic, security and cheating threats etc. These current day problems in P2P networks serve as a motivation for present work. To this end, we present an efficient data distribution framework in Peer-to-Peer (P2P) networks for media streaming and file sharing domain. The experiments with our model, an alliance based peering scheme for media streaming, show that such a scheme distributes data to the swarm members in a near-optimal way. Alliances are small groups of nodes that share data and other vital information for symbiotic association. We show that alliance formation is a loosely coupled and an effective way to organize the peers and our model maps to a small world network, which form efficient overlay structures and are robust to network perturbations such as churn. We present a comparative simulation based study of our model with CoolStreaming/DONet (a popular model) and present a quantitative performance evaluation. Simulation results show that our model scales well under varying workloads and conditions, delivers near optimal levels of QoS, reduces cross ISP traffic considerably and for most cases, performs at par or even better than Cool-Streaming/DONet. In the next phase of our work, we focussed on BitTorrent P2P model as it the most widely used file sharing protocol. Many studies in academia and industry have shown that though BitTorrent scales very well but is far from optimal in terms of fairness to end users, download time and uplink utilization. Furthermore, random peering and data distribution in such model lead to suboptimal performance. Lately, new breed of BitTorrent clients like BitTyrant have shown successful strategic attacks against BitTorrent. Strategic peers configure the BitTorrent client software such that for very less or no contribution, they can obtain good download speeds. Such strategic nodes exploit the altruism in the swarm and consume resources at the expense of other honest nodes and create an unfair swarm. More unfairness is generated in the swarm with the presence of heterogeneous bandwidth nodes. We investigate and propose a new token-based anti-strategic policy that could be used in BitTorrent to minimize the free-riding by strategic clients. We also proposed other policies against strategic attacks that include using a smart tracker that denies the request of strategic clients for peer listmultiple times, and black listing the non-behaving nodes that do not follow the protocol policies. These policies help to stop the strategic behavior of peers to a large extent and improve overall system performance. We also quantify and validate the benefits of using bandwidth peer matching policy. Our simulations results show that with the above proposed changes, uplink utilization and mean download time in BitTorrent network improves considerably. It leaves strategic clients with little or no incentive to behave greedily. This reduces free riding and creates fairer swarm with very little computational overhead. Finally, we show that our model is self healing model where user behavior changes from selfish to altruistic in the presence of the aforementioned policies.
Show less - Date Issued
- 2008
- Identifier
- CFE0002260, ucf:47864
- Format
- Document (PDF)
- PURL
- http://purl.flvc.org/ucf/fd/CFE0002260
- Title
- On the design and performance of cognitive packets over wired networks and mobile ad hoc networks.
- Creator
-
Lent, Marino Ricardo, Gelenbe, Erol, Engineering and Computer Science
- Abstract / Description
-
University of Central Florida College of Engineering Thesis; This dissertation studied cognitive packet networks (CPN) which build networked learning systems that support adaptive, quality of service-driven routing of packets in wired networks and in wireless, mobile ad hoc networks.
- Date Issued
- 2003
- Identifier
- CFR0001374, ucf:52931
- Format
- Document (PDF)
- PURL
- http://purl.flvc.org/ucf/fd/CFR0001374
- Title
- An intelligent editor for natural language processing of unrestricted text.
- Creator
-
Glinos, Demetrios George, Gomez, Fernando, Arts and Sciences
- Abstract / Description
-
University of Central Florida College of Arts and Sciences Thesis; The understanding of natural language by computational methods has been a continuing and elusive problem in artificial intelligence. In recent years there has been a resurgence in natural language processing research. Much of this work has been on empirical or corpus-based methods which use a data-driven approach to train systems on large amounts of real language data. Using corpus-based methods, the performance of part-of...
Show moreUniversity of Central Florida College of Arts and Sciences Thesis; The understanding of natural language by computational methods has been a continuing and elusive problem in artificial intelligence. In recent years there has been a resurgence in natural language processing research. Much of this work has been on empirical or corpus-based methods which use a data-driven approach to train systems on large amounts of real language data. Using corpus-based methods, the performance of part-of-speech (POS) taggers, which assign to the individual words of a sentence their appropriate part of speech category (e.g., noun, verb, preposition), now rivals human performance levels, achieving accuracies exceeding 95%. Such taggers have proved useful as preprocessors for such tasks as parsing, speech synthesis, and information retrieval. Parsing remains, however, a difficult problem, even with the benefit of POS tagging. Moveover, as sentence length increases, there is a corresponding combinatorial explosing of alternative possible parses. Consider the following sentence from a New York Times online article: After Salinas was arrested for murder in 1995 and lawyers for the bank had begun monitoring his accounts, his personal banker in New York quietly advised Salinas' wife to move the money elsewhere, apparently without the consent of the legal department. To facilitate the parsing and other tasks, we would like to decompose this sentence into the following three shorter sentences which, taken together, convey the same meaning as the original: 1. Salinas was arrested for murder in 1995. 2. Lawyers for the bank had begun monitoring his accounts. 3. His personal banker in New York quietly advised Salinas' wife to move the money elsewhere, apparently without the consent of the legal department. This study investigates the development of heuristics for decomposing such long sentences into sets of shorter sentences without affecting the meaning of the original sentences. Without parsing or semantic analysis, heuristic rules were developed based on: (1) the output of a POS tagger (Brill's tagger); (2) the punctuation contained in the input sentences; and (3) the words themselves. The heuristic algorithms were implemented in an intelligent editor program which first augmented the POS tags and assigned tags to punctuation, and then tested the rules against a corpus of 25 New York Times online articles containing approximately 1,200 sentences and over 32,000 words, with good results. Recommendations are made for improving the algorithms and for continuing this line of research.
Show less - Date Issued
- 1999
- Identifier
- CFR0008181, ucf:53055
- Format
- Document (PDF)
- PURL
- http://purl.flvc.org/ucf/fd/CFR0008181
- Title
- Enterface : a novella.
- Creator
-
McLeod, Hubert Calip, Rushin, Pat, Arts and Sciences
- Abstract / Description
-
University of Central Florida College of Arts and Sciences Thesis; A computer screen places each of us in an interface and virtual reality provides a totally simulated environment, a virtual world that we can enter. Enterface is a novella that examines the question first posed by Michael Heim: How far can we enter cyberspace and still remain human? It also explores the power and the limitation of language and the role of stories to shape reality in human life. Its themes are death, technology...
Show moreUniversity of Central Florida College of Arts and Sciences Thesis; A computer screen places each of us in an interface and virtual reality provides a totally simulated environment, a virtual world that we can enter. Enterface is a novella that examines the question first posed by Michael Heim: How far can we enter cyberspace and still remain human? It also explores the power and the limitation of language and the role of stories to shape reality in human life. Its themes are death, technology, ethics, and love. It is informed by Wittgensteinian philosophy, Norse mythology, and the "metaphysics of virtual reality." The plot involves Moses Mackinow, a former Air Force officer and entrepreneur, who decides there should be a way to simply live forever. He hits upon the idea that life could be digitized, and a civilization, a world of complete, sentient humans could be created in cyberspace--a world he could enter upon his death and continue to live. A variety of technologies are available to digitize the physical human (x-rays, CTSCNS, Magnetic Resonance Images, graphic images, etc.), but the big problem is how to synthesize his human heart. Moses decides that the stories of his life are the keys to creating the "rag and bone shop" of his eternal heart. Getting the stories "right" is critical to the prospect of digitizing life and is a major focus of the novella action. The novella traces the reduction of Moses as a a human being as he pursues his obsession, compromising one principle after another. Everything in the environment of the novella, reflects this reduction. Everything becomes less than it was, a glimpse of humanity reduced to bits and bytes, floating 1's and 0's. Enterface is a work at war with itself.
Show less - Date Issued
- 1999
- Identifier
- CFR0011964, ucf:53091
- Format
- Document (PDF)
- PURL
- http://purl.flvc.org/ucf/fd/CFR0011964
- Title
- Larger-first partial parsing.
- Creator
-
Van Delden, Sebastian Alexander, Gomez, Fernando, Engineering and Computer Science
- Abstract / Description
-
University of Central Florida College of Engineering Thesis; Larger-first partial parsing is a primarily top-down approach to partial parsing that is opposite to current easy-first, or primarily bottom-up, strategies. A rich partial tree structure is captured by an algorithm that assigns a hierarchy of structural tags to each of the input tokens in a sentence. Part-of-speech tags are first assigned to the words in a sentence by a part-of-speech tagger. A cascade of Deterministic Finite State...
Show moreUniversity of Central Florida College of Engineering Thesis; Larger-first partial parsing is a primarily top-down approach to partial parsing that is opposite to current easy-first, or primarily bottom-up, strategies. A rich partial tree structure is captured by an algorithm that assigns a hierarchy of structural tags to each of the input tokens in a sentence. Part-of-speech tags are first assigned to the words in a sentence by a part-of-speech tagger. A cascade of Deterministic Finite State Automata then uses this part-of-speech information to identify syntactic relations primarily ina descending order of their size. The cascade is divided into four specialized sections: (1) a Comma Network, which identifies syntactic relations associated with commas; (2) a Conjunction Network, which partially disambiguates phrasal conjunctions and fully disambiguates clausal conjunctions; (3) a Clause Network, which identifies non-comma-delimited clauses; and (4) a Phrase Network, which identifies the remaining base phrases in the sentence. Each automaton is capable of adding one ore more levels of structural tags to the to the tokens in a sentence. The larger-first approach is compared against a well-known easy-first approach. The results indicate that this larger-first approach is capable of (1) producing a more detailed partial parse than an easy first approach; (2) providing better containment of attachment ambiguity; (3) handling overlapping syntactic relations; and (4) achieving a higher accuracy than the easy-first approach. The automata of each network were developed by an empirical analysis of several sources and are presented here in details.
Show less - Date Issued
- 2003
- Identifier
- CFR0000760, ucf:52932
- Format
- Document (PDF)
- PURL
- http://purl.flvc.org/ucf/fd/CFR0000760
- Title
- NEW COMPUTATIONAL APPROACHES FOR MULTIPLE RNA ALIGNMENT AND RNA SEARCH.
- Creator
-
DeBlasio, Daniel, Zhang, Shaojie, University of Central Florida
- Abstract / Description
-
In this thesis we explore the the theory and history behind RNA alignment. Normal sequence alignments as studied by computer scientists can be completed in $O(n^2)$ time in the naive case. The process involves taking two input sequences and finding the list of edits that can transform one sequence into the other. This process is applied to biology in many forms, such as the creation of multiple alignments and the search of genomic sequences. When you take into account the RNA sequence...
Show moreIn this thesis we explore the the theory and history behind RNA alignment. Normal sequence alignments as studied by computer scientists can be completed in $O(n^2)$ time in the naive case. The process involves taking two input sequences and finding the list of edits that can transform one sequence into the other. This process is applied to biology in many forms, such as the creation of multiple alignments and the search of genomic sequences. When you take into account the RNA sequence structure the problem becomes even harder. Multiple RNA structure alignment is particularly challenging because covarying mutations make sequence information alone insufficient. Existing tools for multiple RNA alignments first generate pair-wise RNA structure alignments and then build the multiple alignment using only the sequence information. Here we present PMFastR, an algorithm which iteratively uses a sequence-structure alignment procedure to build a multiple RNA structure alignment. PMFastR also has low memory consumption allowing for the alignment of large sequences such as 16S and 23S rRNA. Specifically, we reduce the memory consumption to $\sim O(band^2*m)$ where $band$ is the banding size. Other solutions are $\sim O(n^2*m)$ where $n$ and $m$ are the lengths of the target and query respectively. The algorithm also provides a method to utilize a multi-core environment. We present results on benchmark data sets from BRAliBase, which shows PMFastR outperforms other state-of-the-art programs. Furthermore, we regenerate 607 Rfam seed alignments and show that our automated process creates similar multiple alignments to the manually-curated Rfam seed alignments. While these methods can also be applied directly to genome sequence search, the abundance of new multiple species genome alignments presents a new area for exploration. Many multiple alignments of whole genomes are available and these alignments keep growing in size. These alignments can provide more information to the searcher than just a single sequence. Using the methodology from sequence-structure alignment we developed AlnAlign, which searches an entire genome alignment using RNA sequence structure. While programs have been readily available to align alignments, this is the first to our knowledge that is specifically designed for RNA sequences. This algorithm is presented only in theory and is yet to be tested.
Show less - Date Issued
- 2009
- Identifier
- CFE0002736, ucf:48166
- Format
- Document (PDF)
- PURL
- http://purl.flvc.org/ucf/fd/CFE0002736
- Title
- Information Propagation Algorithms for Consensus Formation in Decentralized Multi-Agent Systems.
- Creator
-
Hollander, Christopher, Wu, Annie, Shumaker, Randall, Wiegand, Rudolf, Turgut, Damla, Song, Zixia, University of Central Florida
- Abstract / Description
-
Consensus occurs within a multi-agent system when every agent is in agreement about the value of some particular state. For example, the color of an LED, the position or magnitude of a vector, a rendezvous location, the most recent state of data within a database, or the identity of a leader are all states that agents might need to agree on in order to execute their tasking.The task of the decentralized consensus problem for multi-agent systems is to design an algorithm that enables agents to...
Show moreConsensus occurs within a multi-agent system when every agent is in agreement about the value of some particular state. For example, the color of an LED, the position or magnitude of a vector, a rendezvous location, the most recent state of data within a database, or the identity of a leader are all states that agents might need to agree on in order to execute their tasking.The task of the decentralized consensus problem for multi-agent systems is to design an algorithm that enables agents to communicate and exchange information such that, in finite time, agents are able to form a consensus without the use of a centralized control mechanism. The primary goal of this research is to introduce and provide supporting evidence for Stochastic Local Observation/Gossip (SLOG) algorithms as a new class of solutions to the decentralized consensus problem for multi-agent systems that lack a centralized controller, with the additional constraints that agents act asynchronously, information is discrete, and all consensus options are equally preferable to all agents. Examples of where these constraints might apply include the spread of social norms and conventions in artificial populations, rendezvous among a set of specific locations, and task assignment.This goal is achieved through a combination of theory and experimentation. Information propagation process and an information propagation algorithm are derived by unifying the general structure of multiple existing solutions to the decentralized consensus problem. They are then used to define two classes of algorithms that spread information across a network and solve the decentralized consensus problem: buffered gossip algorithms and local observation algorithms. Buffered gossip algorithms generalize the behavior of many push-based solutions to the decentralized consensus problem. Local observation algorithms generalize the behavior of many pull-based solutions to the decentralized consensus problem. In the language of object oriented design, buffered gossip algorithms and local observation algorithms are abstract classes; information propagation processes are interfaces. SLOG algorithms combine the transmission mechanisms of buffered gossip algorithms and local observation algorithms into a single "hybrid" algorithm that is able to push and pull information within the local neighborhood. A common mathematical framework is constructed and used to determine the conditions under which each of these algorithms are guaranteed to produce a consensus, and thus solve the decentralized consensus problem. Finally, a series of simulation experiments are conducted to study the performance of SLOG algorithms. These experiments compare the average speed of consensus formation between buffered gossip algorithms, local observation algorithms, and SLOG algorithms over four distinct network topologies.Beyond the introduction of the SLOG algorithm, this research also contributes to the existing literature on the decentralized consensus problem by: specifying a theoretical framework that can be used to explore the consensus behavior of push-based and pull-based information propagation algorithms; using this framework to define buffered gossip algorithms and local observation algorithms as generalizations for existing solutions to the decentralized consensus problem; highlighting the similarities between consensus algorithms within control theory and opinion dynamics within computational sociology, and showing how these research areas can be successfully combined to create new and powerful algorithms; and providing an empirical comparison between multiple information propagation algorithms.
Show less - Date Issued
- 2015
- Identifier
- CFE0005629, ucf:50229
- Format
- Document (PDF)
- PURL
- http://purl.flvc.org/ucf/fd/CFE0005629
- Title
- INTERVENTIONS FOR CHILDHOOD OBESITY: EVALUATING TECHNOLOGICAL APPLICATIONS TARGETING PHYSICAL ACTIVITY LEVEL AND DIET.
- Creator
-
DiPietro, Jessica, Norris, Anne, University of Central Florida
- Abstract / Description
-
Overweight and obese children have increased risks for multiple preventable diseases and conditions which can impair their physiological health and significantly increases the overall cost of their healthcare. Free mobile applications and technology for weight loss, dietary tracking, and physical activity may be quite useful for monitoring nutritional intake and exercise to facilitate weight loss. If so, nurses are well positioned to recommend such tools as part of their efforts to prevent...
Show moreOverweight and obese children have increased risks for multiple preventable diseases and conditions which can impair their physiological health and significantly increases the overall cost of their healthcare. Free mobile applications and technology for weight loss, dietary tracking, and physical activity may be quite useful for monitoring nutritional intake and exercise to facilitate weight loss. If so, nurses are well positioned to recommend such tools as part of their efforts to prevent childhood obesity and help children and parents better manage childhood obesity when it is present. However, there are no guidelines that nurses can use to determine what applications or technologies are most beneficial to children and their parents. The purpose of this project is to develop such guidelines based on a review of the scientific literature published in the last 5 years. Articles regarding healthy-lifestyle promoting mobile applications and technological approaches to health and fitness interventions were identified by searching articles indexed by CINAHL, Psychinfo, Medline, ERIC, IEEE Xplore, and Academic Search Premier. Identified articles were assessed using Melnyk's hierarchy of evidence and organized into tables so that implications for research and suggestions for practice could be made.
Show less - Date Issued
- 2014
- Identifier
- CFH0004616, ucf:45255
- Format
- Document (PDF)
- PURL
- http://purl.flvc.org/ucf/fd/CFH0004616
- Title
- Light Matter Interaction in Single Molecule Magnets.
- Creator
-
Cebulka, Rebecca, Del Barco, Enrique, Klemm, Richard, Mucciolo, Eduardo, Luis, Fernando, University of Central Florida
- Abstract / Description
-
This dissertation includes a series of experimental realizations which focus on studying the coupling between photons and single-molecule magnets (SMMs) in both the weak and strong coupling regimes. In the weak coupling regime, the aim is to achieve coherent control over the time evolution of the spin of SMMs while applying rapid microwave pulses at sub-Kelvin temperatures, where polarization of the spin bath may be achieved without large magnetic fields, allowing the suppression of dipolar...
Show moreThis dissertation includes a series of experimental realizations which focus on studying the coupling between photons and single-molecule magnets (SMMs) in both the weak and strong coupling regimes. In the weak coupling regime, the aim is to achieve coherent control over the time evolution of the spin of SMMs while applying rapid microwave pulses at sub-Kelvin temperatures, where polarization of the spin bath may be achieved without large magnetic fields, allowing the suppression of dipolar dephasing. The continuing results of this experiment will be to provide a window into fundamental sources of decoherence in single-crystal SMMs in an energy range not thoroughly investigated. We expect that these conditions would allow us to study the quantum dynamics of the spins as governed by the intrinsic molecular magnetic anisotropy, which should give rise to non-well-defined Rabi oscillations of the spin state, including metastable precessional spin states. In the strong coupling regime, high quality factor superconducting CPW resonators have been designed and fabricated to investigate the vacuum Rabi splitting between a photon and the SMM spin. The proposed setup will permit measurements of coherent collective coupling between molecular spins and a low number of photons, ideally down to a single photon. This experiment may ultimately provide the opportunity for reaching the strong coupling regime with a single spin. Finally, this thesis also documents a research study into the impact of service-learning methodology on students' depth of learning and critical thinking skills during a novel nanoscale science and technology course offered in the UCF Physics Dept. The overall learning of students was assessed and results clearly showed improvement in both multiple choice pre/post-tests and critical reflection papers. We associate this improvement at least partially to the service-learning experience.
Show less - Date Issued
- 2019
- Identifier
- CFE0007442, ucf:52728
- Format
- Document (PDF)
- PURL
- http://purl.flvc.org/ucf/fd/CFE0007442
- Title
- EPISODIC MEMORY MODEL FOR EMBODIED CONVERSATIONAL AGENTS.
- Creator
-
Elvir, Miguel, Gonzalez, Avelino, University of Central Florida
- Abstract / Description
-
Embodied Conversational Agents (ECA) form part of a range of virtual characters whose intended purpose include engaging in natural conversations with human users. While works in literature are ripe with descriptions of attempts at producing viable ECA architectures, few authors have addressed the role of episodic memory models in conversational agents. This form of memory, which provides a sense of autobiographic record-keeping in humans, has only recently been peripherally integrated into...
Show moreEmbodied Conversational Agents (ECA) form part of a range of virtual characters whose intended purpose include engaging in natural conversations with human users. While works in literature are ripe with descriptions of attempts at producing viable ECA architectures, few authors have addressed the role of episodic memory models in conversational agents. This form of memory, which provides a sense of autobiographic record-keeping in humans, has only recently been peripherally integrated into dialog management tools for ECAs. In our work, we propose to take a closer look at the shared characteristics of episodic memory models in recent examples from the field. Additionally, we propose several enhancements to these existing models through a unified episodic memory model for ECAÂÂ's. As part of our research into episodic memory models, we present a process for determining the prevalent contexts in the conversations obtained from the aforementioned interactions. The process presented demonstrates the use of statistical and machine learning services, as well as Natural Language Processing techniques to extract relevant snippets from conversations. Finally, mechanisms to store, retrieve, and recall episodes from previous conversations are discussed. A primary contribution of this research is in the context of contemporary memory models for conversational agents and cognitive architectures. To the best of our knowledge, this is the first attempt at providing a comparative summary of existing works. As implementations of ECAs become more complex and encompass more realistic conversation engines, we expect that episodic memory models will continue to evolve and further enhance the naturalness of conversations.
Show less - Date Issued
- 2010
- Identifier
- CFE0003353, ucf:48443
- Format
- Document (PDF)
- PURL
- http://purl.flvc.org/ucf/fd/CFE0003353
