Current Search:  transactional (x)

View All Items

  • CSV Spreadsheet
(1 - 9 of 9)
A Phenomenological Study on the Implementation of Louise Rosenblatt's Transactional Theory and its Impact on Teacher-Efficacy for Literacy Instruction in an Online Environment
Title
A Phenomenological Study on the Implementation of Louise Rosenblatt's Transactional Theory and its Impact on Teacher-Efficacy for Literacy Instruction in an Online Environment.
Creator
Vu, Marcus, Olan, Elsie, Vitale, Thomas, Hewitt, Randall, Owens, J. Thomas, University of Central Florida
Abstract / Description
The present study sought to examine the teacher-efficacy for literacy instruction (TELI) of instructors who teach in an online environment. The phenomenological methodology sought to answer the following research questions: (1) What pedagogical practices do instructors use to provide literacy instruction in an online environment? (2) How do instructors perceive their TELI in an online environment? and (3) What impact, if any, will a Professional Learning Community (PLC) focused on Rosenblatt...
Show moreThe present study sought to examine the teacher-efficacy for literacy instruction (TELI) of instructors who teach in an online environment. The phenomenological methodology sought to answer the following research questions: (1) What pedagogical practices do instructors use to provide literacy instruction in an online environment? (2) How do instructors perceive their TELI in an online environment? and (3) What impact, if any, will a Professional Learning Community (PLC) focused on Rosenblatt's Transactional Theory have on TELI in an online environment?The study consisted of a group of seven online instructors. The researcher the acting as facilitator administered the initial interviews and exit interviews and adapted an Action Research PLC with activities modeled after those that influence self-efficacy. In initial interviews, the participants described their literacy practices as mostly dialogic conversations with students in which they provide examples and non-examples for students. They used some aesthetic strategies, but their practices were mainly efferent and low taxonomically. The initial interviews also revealed that instructors felt that they did not know their students well and that their literacy instructional practices were mostly silenced by the dominant role of the standardized curriculum. It was observed that teachers sourced their confidence in TELI in an online environment not from the practices they used in an online environment, but in the practices they once used in the traditional classroom which are now silenced in an online environment. During the Action Research PLC, the researcher and participants collaborated in creating questions and instructional resources that helped students take a more aesthetic stance while still meeting the standards of the curriculum through the use of aesthetic questions and discussions, semantic association, and narrative-centered learning. The PLC structure also incorporated the four influential experiences on self-efficacy. The results of the exit interviews revealed that the teachers either remained confident or increased in confidence in their TELI in an online environment. In addition, viewing TELI through Rosenblatt's Transactional Theory aided in closing the gap in transactional distance observed by the participants because they were able to engage in more positive dialogues with their students. The PLC provided a creative space for teachers to work and deliver their personalized instruction enabling them to voice their once silenced literacy instructional practices. It can be determined that the transactions that teachers have with students mediated in an online environment have a far greater impact on TELI. Viewing literacy instruction through Rosenblatt's Transactional Theory provides a reflective experience where teachers revisit whether or not an instructional practice can improve their teaching through more aesthetic dialogue thus improving their TELI.
Show less
Date Issued
2017
Identifier
CFE0006818, ucf:51790
Format
Document (PDF)
PURL
http://purl.flvc.org/ucf/fd/CFE0006818
Exploring new boundaries in team cognition: Integrating knowledge in distributed teams
Title
Exploring new boundaries in team cognition: Integrating knowledge in distributed teams.
Creator
Zajac, Stephanie, Salas, Eduardo, Bowers, Clint, Burke, Shawn, University of Central Florida
Abstract / Description
Distributed teams continue to emerge in response to the complex organizational environments brought about by globalization, technological advancements, and the shift toward a knowledge-based economy. These teams are comprised of members who hold the disparate knowledge necessary to take on cognitively demanding tasks. However, knowledge coordination between team members who are not co-located is a significant challenge, often resulting in process loss and decrements to the effectiveness of...
Show moreDistributed teams continue to emerge in response to the complex organizational environments brought about by globalization, technological advancements, and the shift toward a knowledge-based economy. These teams are comprised of members who hold the disparate knowledge necessary to take on cognitively demanding tasks. However, knowledge coordination between team members who are not co-located is a significant challenge, often resulting in process loss and decrements to the effectiveness of team level knowledge structures. The current effort explores the configuration dimension of distributed teams, and specifically how subgroup formation based on geographic location, may impact the effectiveness of a team's transactive memory system and subsequent team process. In addition, the role of task cohesion as a buffer to negative intergroup interaction is explored.
Show less
Date Issued
2014
Identifier
CFE0005449, ucf:50393
Format
Document (PDF)
PURL
http://purl.flvc.org/ucf/fd/CFE0005449
GENERATION AND THE GOOGLE EFFECT: TRANSACTIVE MEMORY SYSTEM PREFERENCE ACROSS AGE
Title
GENERATION AND THE GOOGLE EFFECT: TRANSACTIVE MEMORY SYSTEM PREFERENCE ACROSS AGE.
Creator
Siler, Jessica, Hancock, Peter, University of Central Florida
Abstract / Description
A transactive memory system (TMS) is a means by which people may store information externally; in such a system the task of remembering is offloaded by remembering where information is located, rather than remembering the information itself. As Sparrow et al. (2011) suggest in the article Google Effects on Memory: Cognitive Consequences of Having Information at Our Fingertips, people are beginning to use the internet and computers as a TMS, and this use is changing the way people encounter...
Show moreA transactive memory system (TMS) is a means by which people may store information externally; in such a system the task of remembering is offloaded by remembering where information is located, rather than remembering the information itself. As Sparrow et al. (2011) suggest in the article Google Effects on Memory: Cognitive Consequences of Having Information at Our Fingertips, people are beginning to use the internet and computers as a TMS, and this use is changing the way people encounter and treat information. The purpose of this thesis is to investigate whether preference for TMS type (either with books or with computers) varies across age groups. An interaction between TMS preference and age was hypothesized. Before the onset of the internet age, information was primarily found in books and other print materials whereas now the internet is more frequently used, thus this shift in thinking and habit across generations was expected to emerge in the data. The study yielded a total of 51 participants, 32 from the young age group (ages 18-24) and 19 from the old (ages 61-81). A modified Stroop task and question blocks (for priming purposes) were employed to examine whether people are prone to think of book- or computer-related sources when in search of information. Also, a "Look up or Learn" tendencies survey was used to better understand how people decide whether certain information should be learned or left to be "looked up" later (Yacci & Rosanski, 2012). The mixed ANOVA did not reveal main effects for question difficulty or TMS type, nor was an interaction with age found. The results were not consistent with those of Sparrow et al. (2011) and did not show significance for TMS preference. Future studies should continue to examine the Google effect and TMS preference, as it bears important applications for a number of fields.
Show less
Date Issued
2013
Identifier
CFH0004473, ucf:45118
Format
Document (PDF)
PURL
http://purl.flvc.org/ucf/fd/CFH0004473
THE EFFECT OF GENDER AND LEADERSHIP STYLES ON EMPLOYEE SATISFACTION
Title
THE EFFECT OF GENDER AND LEADERSHIP STYLES ON EMPLOYEE SATISFACTION.
Creator
Williams, Brittany, Ciuchta, Michael, University of Central Florida
Abstract / Description
To ensure the success of a company, it is essential for supervisors to interact effectively with the employees they oversee. Effective interactions between supervisor and employee go hand-in-hand with employee satisfaction, which can impact firm performance. The purpose of this thesis is to examine key drivers of employee satisfaction. Specifically, this thesis tests whether or not employees with supervisors of the same sex as themselves are more satisfied than employees with supervisors of...
Show moreTo ensure the success of a company, it is essential for supervisors to interact effectively with the employees they oversee. Effective interactions between supervisor and employee go hand-in-hand with employee satisfaction, which can impact firm performance. The purpose of this thesis is to examine key drivers of employee satisfaction. Specifically, this thesis tests whether or not employees with supervisors of the same sex as themselves are more satisfied than employees with supervisors of the opposite sex. It also compares and contrasts the level of satisfaction an employee has in correspondence with transformational and transactional leadership styles and whether this relationship is contingent on the employee's level of work experience.
Show less
Date Issued
2012
Identifier
CFH0004285, ucf:44968
Format
Document (PDF)
PURL
http://purl.flvc.org/ucf/fd/CFH0004285
RESEARCH IN HIGH PERFORMANCE AND LOW POWER COMPUTER SYSTEMS FOR DATA-INTENSIVE ENVIRONMENT
Title
RESEARCH IN HIGH PERFORMANCE AND LOW POWER COMPUTER SYSTEMS FOR DATA-INTENSIVE ENVIRONMENT.
Creator
Shang, pengju, Wang, Jun, University of Central Florida
Abstract / Description
The evolution of computer science and engineering is always motivated by the requirements for better performance, power efficiency, security, user interface (UI), etc. The first two factors are potential tradeoffs: better performance usually requires better hardware, e.g., the CPUs with larger number of transistors, the disks with higher rotation speed; however, the increasing number of transistors on the single die or chip reveals super-linear growth in CPU power consumption, and the change...
Show moreThe evolution of computer science and engineering is always motivated by the requirements for better performance, power efficiency, security, user interface (UI), etc. The first two factors are potential tradeoffs: better performance usually requires better hardware, e.g., the CPUs with larger number of transistors, the disks with higher rotation speed; however, the increasing number of transistors on the single die or chip reveals super-linear growth in CPU power consumption, and the change in disk rotation speed has a quadratic effect on disk power consumption. We propose three new systematic approaches, Transactional RAID, data-affinity-aware data placement DAFA and Modeless power management, to tackle the performance problem in Database systems, large scale clusters or cloud platforms, and the power management problem in Chip Multi Processors, respectively. The first design, Transactional RAID (TRAID), is motivated by the fact that in recent years, more storage system applications have employed transaction processing techniques to ensure data integrity and consistency. In transaction processing systems(TPS), log is a kind of redundancy to ensure transaction ACID (atomicity, consistency, isolation, durability) properties and data recoverability. Furthermore, high reliable storage systems, such as redundant array of inexpensive disks (RAID), are widely used as the underlying storage system for Databases to guarantee system reliability and availability with high I/O performance. However, the Databases and storage systems tend to implement their independent fault tolerant mechanisms from their own perspectives and thereby leading to potential high overhead. We observe the overlapped redundancies between the TPS and RAID systems, and propose a novel reliable storage architecture called Transactional RAID (TRAID). TRAID deduplicates this overlap by only logging one compact version (XOR results) of recovery references for the updating data. It minimizes the amount of log content as well as the log flushing overhead, thereby boosts the overall transaction processing performance. At the same time, TRAID guarantees comparable RAID reliability, the same recovery correctness and ACID semantics of traditional transactional processing systems. On the other hand, the emerging myriad data intensive applications place a demand for high-performance computing resources with massive storage. Academia and industry pioneers have been developing big data parallel computing frameworks and large-scale distributed file systems (DFS) widely used to facilitate the high-performance runs of data-intensive applications, such as bio-informatics, astronomy, and high-energy physics. Our recent work reported that data distribution in DFS can significantly affect the efficiency of data processing and hence the overall application performance. This is especially true for those with sophisticated access patterns. For example, Yahoo's Hadoop clusters employs a random data placement strategy for load balance and simplicity. This allows the MapReduce programs to access all the data (without or not distinguishing interest locality) at full parallelism. Our work focuses on Hadoop systems. We observed that the data distribution is one of the most important factors that affect the parallel programming performance. However, the default Hadoop adopts random data distribution strategy, which does not consider the data semantics, specifically, data affinity. We propose a Data-Affinity-Aware (DAFA) data placement scheme to address the above problem. DAFA builds a history data access graph to exploit the data affinity. According to the data affinity, DAFA re-organizes data to maximize the parallelism of the affinitive data, and also subjective to the overall load balance. This enables DAFA to realize the maximum number of map tasks with data-locality. Besides the system performance, power consumption is another important concern of current computer systems. In the U.S. alone, the energy used by servers which could be saved comes to 3.17 million tons of carbon dioxide, or 580,678 cars. However, the goals of high performance and low energy consumption are at odds with each other. An ideal power management strategy should be able to dynamically respond to the change (either linear or nonlinear, or non-model) of workloads and system configuration without violating the performance requirement. We propose a novel power management scheme called MAR (modeless, adaptive, rule-based) in multiprocessor systems to minimize the CPU power consumption under performance constraints. By using richer feedback factors, e.g. the I/O wait, MAR is able to accurately describe the relationships among core frequencies, performance and power consumption. We adopt a modeless control model to reduce the complexity of system modeling. MAR is designed for CMP (Chip Multi Processor) systems by employing multi-input/multi-output (MIMO) theory and per-core level DVFS (Dynamic Voltage and Frequency Scaling).
Show less
Date Issued
2011
Identifier
CFE0003910, ucf:48749
Format
Document (PDF)
PURL
http://purl.flvc.org/ucf/fd/CFE0003910
High-Performance Composable Transactional Data Structures
Title
High-Performance Composable Transactional Data Structures.
Creator
Zhang, Deli, Dechev, Damian, Leavens, Gary, Zou, Changchun, Lin, Mingjie, University of Central Florida
Abstract / Description
Exploiting the parallelism in multiprocessor systems is a major challenge in the post ``power wall'' era. Programming for multicore demands a change in the way we design and use fundamental data structures. Concurrent data structures allow scalable and thread-safe accesses to shared data. They provide operations that appear to take effect atomically when invoked individually.A main obstacle to the practical use of concurrent data structures is their inability to support composable operations,...
Show moreExploiting the parallelism in multiprocessor systems is a major challenge in the post ``power wall'' era. Programming for multicore demands a change in the way we design and use fundamental data structures. Concurrent data structures allow scalable and thread-safe accesses to shared data. They provide operations that appear to take effect atomically when invoked individually.A main obstacle to the practical use of concurrent data structures is their inability to support composable operations, i.e., to execute multiple operations atomically in a transactional manner. The problem stems from the inability of concurrent data structure to ensure atomicity of transactions composed from operations on a single or multiple data structures instances. This greatly hinders software reuse because users can only invoke data structure operations in a limited number of ways.Existing solutions, such as software transactional memory (STM) and transactional boosting, manage transaction synchronization in an external layer separated from the data structure's own thread-level concurrency control. Although this reduces programming effort, it leads to significant overhead associated with additional synchronization and the need to rollback aborted transactions. In this dissertation, I address the practicality and efficiency concerns by designing, implementing, and evaluating high-performance transactional data structures that facilitate the development of future highly concurrent software systems.Firstly, I present two methodologies for implementing high-performance transactional data structures based on existing concurrent data structures using either lock-based or lock-free synchronizations. For lock-based data structures, the idea is to treat data accessed by multiple operations as resources. The challenge is for each thread to acquire exclusive access to desired resources while preventing deadlock or starvation. Existing locking strategies, like two-phase locking and resource hierarchy, suffer from performance degradation under heavy contention, while lacking a desirable fairness guarantee. To overcome these issues, I introduce a scalable lock algorithm for shared-memory multiprocessors addressing the resource allocation problem. It is the first multi-resource lock algorithm that guarantees the strongest first-in, first-out (FIFO) fairness. For lock-free data structures, I present a methodology for transforming them into high-performance lock-free transactional data structures without revamping the data structures' original synchronization design. My approach leverages the semantic knowledge of the data structure to eliminate the overhead of false conflicts and rollbacks.Secondly, I apply the proposed methodologies and present a suite of novel transactional search data structures in the form of an open source library. This is interesting not only because the fundamental importance of search data structures in computer science and their wide use in real world programs, but also because it demonstrate the implementation issues that arise when using the methodologies I have developed. This library is not only a compilation of a large number of fundamental data structures for multiprocessor applications, but also a framework for enabling composable transactions, and moreover, an infrastructure for continuous integration of new data structures. By taking such a top-down approach, I am able to identify and consider the interplay of data structure interface operations as a whole, which allows for scrutinizing their commutativity rules and hence opens up possibilities for design optimizations.Lastly, I evaluate the throughput of the proposed data structures using transactions with randomly generated operations on two difference hardware systems. To ensure the strongest possible competition, I chose the best performing alternatives from state-of-the-art locking protocols and transactional memory systems in the literature. The results show that it is straightforward to build efficient transactional data structures when using my multi-resource lock as a drop-in replacement for transactional boosted data structures. Furthermore, this work shows that it is possible to build efficient lock-free transactional data structures with all perceived benefits of lock-freedom and with performance far better than generic transactional memory systems.
Show less
Date Issued
2016
Identifier
CFE0006428, ucf:51453
Format
Document (PDF)
PURL
http://purl.flvc.org/ucf/fd/CFE0006428
Optimization problem in single period markets
Title
Optimization problem in single period markets.
Creator
Jiang, Tian, Yong, Jiongmin, Qi, Yuanwei, Shuai, Zhisheng, University of Central Florida
Abstract / Description
There had been a number of researches that investigated on the security market without transactioncosts. The focus of this research is in the area that when the security market with transaction costsis fair and in such fair market how one chooses a suitable portfolio to optimize the financial goal.The research approach adopted in this thesis includes linear algebra and elementary probability.The thesis provides evidence that we can maximize expected utility function to achieve our goal...
Show moreThere had been a number of researches that investigated on the security market without transactioncosts. The focus of this research is in the area that when the security market with transaction costsis fair and in such fair market how one chooses a suitable portfolio to optimize the financial goal.The research approach adopted in this thesis includes linear algebra and elementary probability.The thesis provides evidence that we can maximize expected utility function to achieve our goal(maximize expected return under certain risk tolerance). The main conclusions drawn from thisstudy are under certain conditions the security market is arbitrage-free, and we can always find anoptimal portfolio maximizing certain expected utility function.
Show less
Date Issued
2013
Identifier
CFE0004696, ucf:49875
Format
Document (PDF)
PURL
http://purl.flvc.org/ucf/fd/CFE0004696
Practical Dynamic Transactional Data Structures
Title
Practical Dynamic Transactional Data Structures.
Creator
Laborde, Pierre, Dechev, Damian, Leavens, Gary, Turgut, Damla, Mucciolo, Eduardo, University of Central Florida
Abstract / Description
Multicore programming presents the challenge of synchronizing multiple threads.Traditionally, mutual exclusion locks are used to limit access to a shared resource to a single thread at a time.Whether this lock is applied to an entire data structure, or only a single element, the pitfalls of lock-based programming persist.Deadlock, livelock, starvation, and priority inversion are some of the hazards of lock-based programming that can be avoided by using non-blocking techniques.Non-blocking...
Show moreMulticore programming presents the challenge of synchronizing multiple threads.Traditionally, mutual exclusion locks are used to limit access to a shared resource to a single thread at a time.Whether this lock is applied to an entire data structure, or only a single element, the pitfalls of lock-based programming persist.Deadlock, livelock, starvation, and priority inversion are some of the hazards of lock-based programming that can be avoided by using non-blocking techniques.Non-blocking data structures allow scalable and thread-safe access to shared data by guaranteeing, at least, system-wide progress.In this work, we present the first wait-free hash map which allows a large number of threads to concurrently insert, get, and remove information.Wait-freedom means that all threads make progress in a finite amount of time --- an attribute that can be critical in real-time environments.We only use atomic operations that are provided by the hardware; therefore, our hash map can be utilized by a variety of data-intensive applications including those within the domains of embedded systems and supercomputers.The challenges of providing this guarantee make the design and implementation of wait-free objects difficult.As such, there are few wait-free data structures described in the literature; in particular, there are no wait-free hash maps.It often becomes necessary to sacrifice performance in order to achieve wait-freedom.However, our experimental evaluation shows that our hash map design is, on average, 7 times faster than a traditional blocking design.Our solution outperforms the best available alternative non-blocking designs in a large majority of cases, typically by a factor of 15 or higher.The main drawback of non-blocking data structures is that only one linearizable operation can be executed by each thread, at any one time.To overcome this limitation we present a framework for developing dynamic transactional data containers.Transactional containers are those that execute a sequence of operations atomically and in such a way that concurrent transactions appear to take effect in some sequential order.We take an existing algorithm that transforms non-blocking sets into static transactional versions (LFTT), and we modify it to support maps.We implement a non-blocking transactional hash map using this new approach.We continue to build on LFTT by implementing a lock-free vector using a methodology to allow LFTT to be compatible with non-linked data structures.A static transaction requires all operands and operations to be specified at compile-time, and no code may be executed between transactions.These limitations render static transactions impractical for most use cases.We modify LFTT to support dynamic transactions, and we enhance it with additional features.Dynamic transactions allow operands to be specified at runtime rather than compile-time, and threads can execute code between the data structure operations of a transaction.We build a framework for transforming non-blocking containers into dynamic transactional data structures, called Dynamic Transactional Transformation (DTT), and provide a library of novel transactional containers.Our library provides the wait-free progress guarantee and supports transactions among multiple data structures, whereas previous work on data structure transactions has been limited to operating on a single container.Our approach is 3 times faster than software transactional memory, and its performance matches its lock-free transactional counterpart.
Show less
Date Issued
2018
Identifier
CFE0007215, ucf:52212
Format
Document (PDF)
PURL
http://purl.flvc.org/ucf/fd/CFE0007215
How does brief cognitive behavioral therapy work? Potential mechanisms of action for veterans with physical and psychological comorbidities
Title
How does brief cognitive behavioral therapy work? Potential mechanisms of action for veterans with physical and psychological comorbidities.
Creator
Deavers, Frances, Cassisi, Jeffrey, Bowers, Clint, Eldridge, Gloria, University of Central Florida
Abstract / Description
Depression and anxiety are commonly comorbid among patients with chronic medical conditions. These comorbidities are associated with negative outcomes including poorer quality of life and worse physical functioning. Evidence that traditional cognitive behavioral therapy (CBT) is less effective for these populations has led to the development of brief CBT protocols that incorporate physical health self-management skills and are delivered in primary care. To continue refining treatment packages...
Show moreDepression and anxiety are commonly comorbid among patients with chronic medical conditions. These comorbidities are associated with negative outcomes including poorer quality of life and worse physical functioning. Evidence that traditional cognitive behavioral therapy (CBT) is less effective for these populations has led to the development of brief CBT protocols that incorporate physical health self-management skills and are delivered in primary care. To continue refining treatment packages, it is important to understand how brief CBT works. The present study used the transactional model of stress and coping as a framework for investigating potential mechanisms of action of brief CBT. Veterans with chronic obstructive pulmonary disease and/or heart failure and elevated symptoms of depression and/or anxiety were randomized to receive brief CBT (n =180) or enhanced usual care (EUC; n = 122). At 4-month follow-up, depression and anxiety symptoms were significantly lower in veterans who received brief CBT, compared to EUC. Multiple mediation analyses revealed that brief CBT was associated with higher self-efficacy and less avoidant coping at 4-month follow-up, which were in turn associated with less depression and anxiety symptoms. Illness intrusiveness was also a significant mediator of the relationship between brief CBT and anxiety symptoms, but not depression symptoms. In contrast, increases in active coping attributable to brief CBT were not associated with improvements in depression or anxiety symptoms. These results demonstrate the utility of the transactional model of stress and coping as a framework for understanding mechanisms of action of brief CBT in patients with comorbid physical and psychological conditions.
Show less
Date Issued
2017
Identifier
CFE0006733, ucf:51884
Format
Document (PDF)
PURL
http://purl.flvc.org/ucf/fd/CFE0006733