You searched for +publisher:"University of Arkansas" +contributor:("Wing Ning Li").
Showing records 1 – 13 of
13 total matches.
No search limiters apply to these results.
University of Arkansas
1.
Rogers, Trent Allen.
Powers and Behaviors of Directed Self-assembly.
Degree: PhD, 2019, University of Arkansas
URL: https://scholarworks.uark.edu/etd/3238 
► In nature there are a variety of self-assembling systems occurring at varying scales which give rise to incredibly complex behaviors. Theoretical models of self-assembly…
(more)
▼ In nature there are a variety of self-assembling systems occurring at varying scales which give rise to incredibly complex behaviors. Theoretical models of self-assembly allow us to gain insight into the fundamental nature of self-assembly independent of the specific physical implementation. In Winfree's abstract tile assembly model (aTAM), the atomic components are unit square "tiles" which have "glues" on their four sides. Beginning from a seed assembly, these tiles attach one at a time during the assembly process in an asynchronous and nondeterministic manner.
We can gain valuable insights into the nature of self-assembly by comparing different models of self-assembly which use fundamentally different mechanisms for local interactions. A powerful notion which allows us to compare models of self-assembly is simulation. The first result of this thesis examines the role of non-determinism in simulation. It shows that the universal simulation of directed aTAM systems requires undirectedness. A tile assembly model is said to be directed if it always assembles the same final assembly.
We distinguish between two types of aTAM systems: cooperative systems and non-cooperative systems. In cooperative aTAM systems, we are able to enforce that in order for a tile to attach to an assembly, the glues of a tile must match two or more glues of neighboring tiles. On the other hand, in non-cooperative aTAM systems, tiles are able to attach to an assembly provided that one of the tile's glues match an exposed glue on the assembly. It is well known that the cooperative aTAM is computationally universal, and it is conjectured that the non-cooperative aTAM is not computationally universal. For our second result, we show that if we allow tiles to be polygons with six or more sides, then the class of non-cooperative systems is capable of universal computation. On the other hand, we show that the class of systems consisting of polygons with six or less sides is not capable of computing using any of the currently known methods.
Advisors/Committee Members: Matthew Patitz, Jin-Woo Kim, Ning%20Li%22%29&pagesize-30">
Wing-
Ning Li.
Subjects/Keywords: bit-reading; Computational complexity; Models of computation; Self-assembly; Universal Simulator; Numerical Analysis and Scientific Computing; Theory and Algorithms
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Rogers, T. A. (2019). Powers and Behaviors of Directed Self-assembly. (Doctoral Dissertation). University of Arkansas. Retrieved from https://scholarworks.uark.edu/etd/3238
Chicago Manual of Style (16th Edition):
Rogers, Trent Allen. “Powers and Behaviors of Directed Self-assembly.” 2019. Doctoral Dissertation, University of Arkansas. Accessed January 16, 2021.
https://scholarworks.uark.edu/etd/3238.
MLA Handbook (7th Edition):
Rogers, Trent Allen. “Powers and Behaviors of Directed Self-assembly.” 2019. Web. 16 Jan 2021.
Vancouver:
Rogers TA. Powers and Behaviors of Directed Self-assembly. [Internet] [Doctoral dissertation]. University of Arkansas; 2019. [cited 2021 Jan 16].
Available from: https://scholarworks.uark.edu/etd/3238.
Council of Science Editors:
Rogers TA. Powers and Behaviors of Directed Self-assembly. [Doctoral Dissertation]. University of Arkansas; 2019. Available from: https://scholarworks.uark.edu/etd/3238
University of Arkansas
2.
Katla, Srinidhi.
DPWeka: Achieving Differential Privacy in WEKA.
Degree: MS, 2017, University of Arkansas
URL: https://scholarworks.uark.edu/etd/1934
► Organizations belonging to the government, commercial, and non-profit industries collect and store large amounts of sensitive data, which include medical, financial, and personal information.…
(more)
▼ Organizations belonging to the government, commercial, and non-profit industries collect and store large amounts of sensitive data, which include medical, financial, and personal information. They use data mining methods to formulate business strategies that yield high long-term and short-term financial benefits. While analyzing such data, the private information of the individuals present in the data must be protected for moral and legal reasons. Current practices such as redacting sensitive attributes, releasing only the aggregate values, and query auditing do not provide sufficient protection against an adversary armed with auxiliary information. In the presence of additional background information, the privacy protection framework, differential privacy, provides mathematical guarantees against adversarial attacks.
Existing platforms for differential privacy employ specific mechanisms for limited applications of data mining. Additionally, widely used data mining tools do not contain differentially private data mining algorithms. As a result, for analyzing sensitive data, the cognizance of differentially private methods is currently limited outside the research community.
This thesis examines various mechanisms to realize differential privacy in practice and investigates methods to integrate them with a popular machine learning toolkit, WEKA. We present DPWeka, a package that provides differential privacy capabilities to WEKA, for practical data mining. DPWeka includes a suite of differential privacy preserving algorithms which support a variety of data mining tasks including attribute selection and regression analysis. It has provisions for users to control privacy and model parameters, such as privacy mechanism, privacy budget, and other algorithm specific variables. We evaluate private algorithms on real-world datasets, such as genetic data and census data, to demonstrate the practical applicability of DPWeka.
Advisors/Committee Members: Xintao Wu, Wing Ning Li, Qinghua Li.
Subjects/Keywords: Pure sciences; Communication and the arts; Applied sciences; Data mining; Data privacy; Differential privacy; Databases and Information Systems; Information Security
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Katla, S. (2017). DPWeka: Achieving Differential Privacy in WEKA. (Masters Thesis). University of Arkansas. Retrieved from https://scholarworks.uark.edu/etd/1934
Chicago Manual of Style (16th Edition):
Katla, Srinidhi. “DPWeka: Achieving Differential Privacy in WEKA.” 2017. Masters Thesis, University of Arkansas. Accessed January 16, 2021.
https://scholarworks.uark.edu/etd/1934.
MLA Handbook (7th Edition):
Katla, Srinidhi. “DPWeka: Achieving Differential Privacy in WEKA.” 2017. Web. 16 Jan 2021.
Vancouver:
Katla S. DPWeka: Achieving Differential Privacy in WEKA. [Internet] [Masters thesis]. University of Arkansas; 2017. [cited 2021 Jan 16].
Available from: https://scholarworks.uark.edu/etd/1934.
Council of Science Editors:
Katla S. DPWeka: Achieving Differential Privacy in WEKA. [Masters Thesis]. University of Arkansas; 2017. Available from: https://scholarworks.uark.edu/etd/1934
University of Arkansas
3.
Ding, Hongyuan.
Exploiting Hardware Abstraction for Parallel Programming Framework: Platform and Multitasking.
Degree: PhD, 2017, University of Arkansas
URL: https://scholarworks.uark.edu/etd/1985
► With the help of the parallelism provided by the fine-grained architecture, hardware accelerators on Field Programmable Gate Arrays (FPGAs) can significantly improve the performance…
(more)
▼ With the help of the parallelism provided by the fine-grained architecture, hardware accelerators on Field Programmable Gate Arrays (FPGAs) can significantly improve the performance of many applications. However, designers are required to have excellent hardware programming skills and unique optimization techniques to explore the potential of FPGA resources fully. Intermediate frameworks above hardware circuits are proposed to improve either performance or productivity by leveraging parallel programming models beyond the multi-core era.
In this work, we propose the PolyPC (Polymorphic Parallel Computing) framework, which targets enhancing productivity without losing performance. It helps designers develop parallelized applications and implement them on FPGAs. The PolyPC framework implements a custom hardware platform, on which programs written in an OpenCL-like programming model can launch. Additionally, the PolyPC framework extends vendor-provided tools to provide a complete development environment including intermediate software framework, and automatic system builders. Designers' programs can be either synthesized as hardware processing elements (PEs) or compiled to executable files running on software PEs. Benefiting from nontrivial features of re-loadable PEs, and independent group-level schedulers, the multitasking is enabled for both software and hardware PEs to improve the efficiency of utilizing hardware resources.
The PolyPC framework is evaluated regarding performance, area efficiency, and multitasking. The results show a maximum 66 times speedup over a dual-core ARM processor and 1043 times speedup over a high-performance MicroBlaze with 125 times of area efficiency. It delivers a significant improvement in response time to high-priority tasks with the priority-aware scheduling. Overheads of multitasking are evaluated to analyze trade-offs. With the help of the design flow, the OpenCL application programs are converted into executables through the front-end source-to-source transformation and back-end synthesis/compilation to run on PEs, and the framework is generated from users' specifications.
Advisors/Committee Members: Miaoqing Huang, David Andrews, Wing Ning Li.
Subjects/Keywords: FPGA; Hardware Abstraction; Hardware Acceleration; Hardware Multitasking; MPSoC; OpenCL; Hardware Systems
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Ding, H. (2017). Exploiting Hardware Abstraction for Parallel Programming Framework: Platform and Multitasking. (Doctoral Dissertation). University of Arkansas. Retrieved from https://scholarworks.uark.edu/etd/1985
Chicago Manual of Style (16th Edition):
Ding, Hongyuan. “Exploiting Hardware Abstraction for Parallel Programming Framework: Platform and Multitasking.” 2017. Doctoral Dissertation, University of Arkansas. Accessed January 16, 2021.
https://scholarworks.uark.edu/etd/1985.
MLA Handbook (7th Edition):
Ding, Hongyuan. “Exploiting Hardware Abstraction for Parallel Programming Framework: Platform and Multitasking.” 2017. Web. 16 Jan 2021.
Vancouver:
Ding H. Exploiting Hardware Abstraction for Parallel Programming Framework: Platform and Multitasking. [Internet] [Doctoral dissertation]. University of Arkansas; 2017. [cited 2021 Jan 16].
Available from: https://scholarworks.uark.edu/etd/1985.
Council of Science Editors:
Ding H. Exploiting Hardware Abstraction for Parallel Programming Framework: Platform and Multitasking. [Doctoral Dissertation]. University of Arkansas; 2017. Available from: https://scholarworks.uark.edu/etd/1985
University of Arkansas
4.
Lai, Chenggang.
Study of Parallel Programming Models on Computer Clusters with Accelerators.
Degree: MSCmpE, 2014, University of Arkansas
URL: https://scholarworks.uark.edu/etd/2046
► In order to reach exascale computing capability, accelerators have become a crucial part in developing supercomputers. This work examines the potential of two latest…
(more)
▼ In order to reach exascale computing capability, accelerators have become a crucial part in developing supercomputers. This work examines the potential of two latest acceleration technologies, Intel Many Integrated Core (MIC) Architecture and Graphics Processing Units (GPUs). This thesis applies three benchmarks under 3 different configurations, MPI+CPU, MPI+GPU, and MPI+MIC. The benchmarks include intensely communicating application, loosely communicating application, and embarrassingly parallel application. This thesis also carries out a detailed study on the scalability and performance of MIC processors under two programming models, i.e., offload model and native model, on the Beacon computer cluster.
According to different benchmarks, the results demonstrate different performance and scalability between GPU and MIC. (1) For embarrassingly parallel case, GPU-based parallel implementation on Keeneland computer cluster has a better performance than other accelerators. However, MIC-based parallel implementation shows a better scalability than the implementation on GPU. The performances of native model and offload model on MIC are very close. (2) For loosely communicating case, the performances on GPU and MIC are very close. The MIC-based parallel implementation still demonstrates a strong scalability when using 120 MIC processors in computation. (3) For the intensely communicating case, the MPI implementations on CPUs and GPUs both have a strong scalability. GPUs can consistently outperform other accelerators. However, the MIC-based implementation cannot scale quite well. The performance of different models on MIC is different from the performance of embarrassingly parallel case. Native model can consistently outperform the offload model by ~10 times. And there is not much performance gain when allocating more MIC processors. The increase of communication cost will offset the performance gain from the reduced workload on each MIC core. This work also tests the performance capabilities and scalability by changing the number of threads on each MIC card form 10 to 60. When using different number of threads for the intensely communicating case, it shows different capabilities of the MIC based offload model. The scalability can hold when the number of threads increases from 10 to 30, and the computation time reduces with a smaller rate from 30 threads to 50 threads. When using 60 threads, the computation time will increase. The reason is that the communication overhead will offset the performance gain when 60 threads are deployed on a single MIC card.
Advisors/Committee Members: Miaoqing Huang, John Gauch, Wing Ning Li.
Subjects/Keywords: Accelerators; Hybrid Architecture; Parallel Programming; Computer and Systems Architecture; Programming Languages and Compilers
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Lai, C. (2014). Study of Parallel Programming Models on Computer Clusters with Accelerators. (Masters Thesis). University of Arkansas. Retrieved from https://scholarworks.uark.edu/etd/2046
Chicago Manual of Style (16th Edition):
Lai, Chenggang. “Study of Parallel Programming Models on Computer Clusters with Accelerators.” 2014. Masters Thesis, University of Arkansas. Accessed January 16, 2021.
https://scholarworks.uark.edu/etd/2046.
MLA Handbook (7th Edition):
Lai, Chenggang. “Study of Parallel Programming Models on Computer Clusters with Accelerators.” 2014. Web. 16 Jan 2021.
Vancouver:
Lai C. Study of Parallel Programming Models on Computer Clusters with Accelerators. [Internet] [Masters thesis]. University of Arkansas; 2014. [cited 2021 Jan 16].
Available from: https://scholarworks.uark.edu/etd/2046.
Council of Science Editors:
Lai C. Study of Parallel Programming Models on Computer Clusters with Accelerators. [Masters Thesis]. University of Arkansas; 2014. Available from: https://scholarworks.uark.edu/etd/2046
University of Arkansas
5.
Morovat, Katanosh.
Designing Secure Access Control Model in Cyber Social Networks.
Degree: PhD, 2017, University of Arkansas
URL: https://scholarworks.uark.edu/etd/2390
► Nowadays, information security in online communication has become an indisputable topic. People prefer pursuing their connection and public relations due to the greater flexibility…
(more)
▼ Nowadays, information security in online communication has become an indisputable topic. People prefer pursuing their connection and public relations due to the greater flexibility and affordability of online communication. Recently, organizations have established online networking sites concerned with sharing assets among their employees. As more people engage in social network, requirements for protecting information and resources becomes vital. Over the years, many access control methods have been proposed. Although these methods cover various information security aspects, they have not provided an appropriate approach for securing information within distributed online networking sites. Moreover, none of the previous research provides an access control method in case an existing resource encompassing various parts and each part has its own accessing control policy.
In this research, we investigate the access control requirements in order to conserve data and encompassed resources, which are shared in the social network, from users with unapproved access. Under the proposed method, users are able to define policies easily to protect their individual information and resources from unauthorized users. In addition, requestors are able to generate inquiries in easy and efficient way. We define an appropriate format to present rules and queries, which are converted from policies and inquiries respectively. The proposed approach defines a method in case a user would like to access a resource belonging to another user where both users are members of different online networking sites. In order to add more flexibility, this method controls access to data and resources by evaluating requestor’s attributes, object’s attributes, action or operation taken by requestor, environmental condition, and policies which are created by users or a super user of social network to protect the users’ resources. This approach is called Policy-Based Attribute Access Control (PBAAC). The policies defined to secure a resource may conflict with other policies. The proposed method offers an appropriate solution to resolve this issue. Due to achievement of better performance with regards to efficiency, this research analyzes the method to compromise simple rules, complex rules, or rules including several attributes. The results prove that simple rules provide better performance.
Advisors/Committee Members: Brajendra Panda, Ning%20Li%22%29&pagesize-30">
Wing-
Ning Li,
Dale Thompson.
Subjects/Keywords: Access Control Methods; Cybersecurity; Social Network; Information Security
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Morovat, K. (2017). Designing Secure Access Control Model in Cyber Social Networks. (Doctoral Dissertation). University of Arkansas. Retrieved from https://scholarworks.uark.edu/etd/2390
Chicago Manual of Style (16th Edition):
Morovat, Katanosh. “Designing Secure Access Control Model in Cyber Social Networks.” 2017. Doctoral Dissertation, University of Arkansas. Accessed January 16, 2021.
https://scholarworks.uark.edu/etd/2390.
MLA Handbook (7th Edition):
Morovat, Katanosh. “Designing Secure Access Control Model in Cyber Social Networks.” 2017. Web. 16 Jan 2021.
Vancouver:
Morovat K. Designing Secure Access Control Model in Cyber Social Networks. [Internet] [Doctoral dissertation]. University of Arkansas; 2017. [cited 2021 Jan 16].
Available from: https://scholarworks.uark.edu/etd/2390.
Council of Science Editors:
Morovat K. Designing Secure Access Control Model in Cyber Social Networks. [Doctoral Dissertation]. University of Arkansas; 2017. Available from: https://scholarworks.uark.edu/etd/2390
University of Arkansas
6.
Apon, Daniel Christopher.
On the Complexity of Grid Coloring.
Degree: MS, 2011, University of Arkansas
URL: https://scholarworks.uark.edu/etd/108
► This thesis studies problems at the intersection of Ramsey-theoretic mathematics, computational complexity, and communication complexity. The prototypical example of such a problem is Monochromatic-Rectangle-Free…
(more)
▼ This thesis studies problems at the intersection of Ramsey-theoretic mathematics, computational complexity, and communication complexity. The prototypical example of such a problem is Monochromatic-Rectangle-Free Grid Coloring. In an instance of Monochromatic-Rectangle-Free Grid Coloring, we are given a chessboard-like grid graph of dimensions n and m, where the vertices of the graph correspond to squares in the chessboard, and a number of allowed colors, c. The goal is to assign one of the allowed colors to each vertex of the grid graph so that no four vertices arranged in an axis-parallel rectangle are colored monochromatically. Our results include: 1. A conditional, graph-theoretic proof that deciding Monochromatic-Rectangle-Free Grid Coloring requires time superpolynomial in the input size. 2. A natural interpretation of Monochromatic-Rectangle-Free Grid Coloring as a lower bound on the communication complexity of a cluster of related predicates. 3. Original, best-yet, monochromatic-square-free grid colorings: a 2-coloring of the 13 x 13 grid, and a 3-coloring of the 39 x 39 grid. 4. An empirically-validated computational plan to decide a particular instance of Monochromatic-Rectangle-Free Grid Coloring that has been heavily studied by the broader theory community, but remains unsolved: whether the 17 x 17 grid can be 4-colored without monochromatic rectangles. Our plan is based in high-performance computing and is expected to take one year to complete.
Advisors/Committee Members: Ning%20Li%22%29&pagesize-30">
Wing-
Ning Li,
Gordon Beavers,
Russell Deaton.
Subjects/Keywords: Communication complexity; Computational complexity; High-performance computing; Ramsey theory; Computer Engineering
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Apon, D. C. (2011). On the Complexity of Grid Coloring. (Masters Thesis). University of Arkansas. Retrieved from https://scholarworks.uark.edu/etd/108
Chicago Manual of Style (16th Edition):
Apon, Daniel Christopher. “On the Complexity of Grid Coloring.” 2011. Masters Thesis, University of Arkansas. Accessed January 16, 2021.
https://scholarworks.uark.edu/etd/108.
MLA Handbook (7th Edition):
Apon, Daniel Christopher. “On the Complexity of Grid Coloring.” 2011. Web. 16 Jan 2021.
Vancouver:
Apon DC. On the Complexity of Grid Coloring. [Internet] [Masters thesis]. University of Arkansas; 2011. [cited 2021 Jan 16].
Available from: https://scholarworks.uark.edu/etd/108.
Council of Science Editors:
Apon DC. On the Complexity of Grid Coloring. [Masters Thesis]. University of Arkansas; 2011. Available from: https://scholarworks.uark.edu/etd/108
University of Arkansas
7.
Jadhav, Supriya Arun.
On Export Intermodal Transportation Problem.
Degree: MS, 2012, University of Arkansas
URL: https://scholarworks.uark.edu/etd/620
► This thesis investigates a logistics problem facing companies that export their products to other countries. The problem is called export intermodal transportation problem. In…
(more)
▼ This thesis investigates a logistics problem facing companies that export their products to other countries. The problem is called export intermodal transportation problem. In the export intermodal transportation problem, goods ordered by overseas customers need to be transported from production plants or warehouses of an export company to the customers destinations overseas. The transportation involves using multiple transportation modes such as trucks and rails for the inland portion and ocean liners for the overseas portion, and its objective is to have the goods moved and the cost minimized subject to various constraints. Cost can be minimized by combining orders from different customers to reduce the number of trucks, rails, or ocean containers used, and by selecting the appropriate transportation modes, routes and carriers.
This study provides a formulation of the export intermodal transport problem and proposes two approaches to solve a relaxed version of the problem, where the time constraints are ignored. The first approach divides the problem into three sub-problems: order consolidation on ocean container, ocean port and carrier selection, and inland transportation mode and carrier selection. Order consolidation on ocean container is formulated as the bin packing problem and is solved by the first-fit decreasing algorithm. Ocean port and carrier selection is formulated as minimum cost maximum flow and prototyped with the cycle cancelling algorithm. And finally inland transportation mode and carrier selection is formulated as variable sized bin packing with costs and is solved by a proposed heuristics algorithm. The second approach is a backtracking approach aimed at getting the optimal solution for smaller problem instances and establishing a baseline to compare solutions obtained by the first approach.
Both approaches are implemented as prototypes and evaluated with historical real world data provided by a large food export company. For all data sets, both prototypes produce
solutions with transportation cost less than that obtained by the company manually. On average the prototypes reduce the cost by 3% and save $30,000 for each data set. The three stage solution approach prototype runs much faster than the backtracking approach prototype. For almost all larger data sets, it takes too long for the backtracking prototype to complete. If we let the backtracking prototype run for 30 minutes and keep the best solution, the solutions obtained by both prototypes are comparable in terms of their cost. As for time, the three stage solution approach prototype takes about 2 seconds to obtain each solution.
Advisors/Committee Members: Ning%20Li%22%29&pagesize-30">
Wing-
Ning Li,
Gordon Beavers,
Craig W. Thompson.
Subjects/Keywords: Social sciences; Applied sciences; Algorithms; Transportation; Operations and Supply Chain Management; Technology and Innovation
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Jadhav, S. A. (2012). On Export Intermodal Transportation Problem. (Masters Thesis). University of Arkansas. Retrieved from https://scholarworks.uark.edu/etd/620
Chicago Manual of Style (16th Edition):
Jadhav, Supriya Arun. “On Export Intermodal Transportation Problem.” 2012. Masters Thesis, University of Arkansas. Accessed January 16, 2021.
https://scholarworks.uark.edu/etd/620.
MLA Handbook (7th Edition):
Jadhav, Supriya Arun. “On Export Intermodal Transportation Problem.” 2012. Web. 16 Jan 2021.
Vancouver:
Jadhav SA. On Export Intermodal Transportation Problem. [Internet] [Masters thesis]. University of Arkansas; 2012. [cited 2021 Jan 16].
Available from: https://scholarworks.uark.edu/etd/620.
Council of Science Editors:
Jadhav SA. On Export Intermodal Transportation Problem. [Masters Thesis]. University of Arkansas; 2012. Available from: https://scholarworks.uark.edu/etd/620
University of Arkansas
8.
Moore, Tyler Garrett.
Directed Percolation and the Abstract Tile Assembly Model.
Degree: MS, 2013, University of Arkansas
URL: https://scholarworks.uark.edu/etd/765
► Self-assembly is a process by which simple components build complex structures through local interactions. Directed percolation is a statistical physical model for describing competitive…
(more)
▼ Self-assembly is a process by which simple components build complex structures through local interactions. Directed percolation is a statistical physical model for describing competitive spreading processes on lattices. The author describes an algorithm which can transform a tile assembly system in the abstract Tile Assembly Model into a directed percolation problem, and then shows simulations of the aTAM which support this algorithm. The author also investigates two new constructs designed for Erik Winfree's abstract Tile Assembly Model called the NULL tile and temperature 1.5. These constructs aid the translation between self-assembly and directed percolation and may assist self-assembly researchers in designing tilesets in the aTAM with non-deterministic local properties, but guaranteed global properties. Temperature 1.5 results indicate the brittleness of the standard temperature 2 tile assembly system, and the NULL tile is shown to assist simulations of large assembly processes while also reinforcing the need for variable temperature models to more closely simulate laboratory self-assembly.
Advisors/Committee Members: Russell Deaton, Gordon Beavers, Wing Ning Li.
Subjects/Keywords: Applied sciences; Abstract tile assembly model; Percolation theory; Self assembly; Nanoscience and Nanotechnology; Numerical Analysis and Scientific Computing; Statistical, Nonlinear, and Soft Matter Physics
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Moore, T. G. (2013). Directed Percolation and the Abstract Tile Assembly Model. (Masters Thesis). University of Arkansas. Retrieved from https://scholarworks.uark.edu/etd/765
Chicago Manual of Style (16th Edition):
Moore, Tyler Garrett. “Directed Percolation and the Abstract Tile Assembly Model.” 2013. Masters Thesis, University of Arkansas. Accessed January 16, 2021.
https://scholarworks.uark.edu/etd/765.
MLA Handbook (7th Edition):
Moore, Tyler Garrett. “Directed Percolation and the Abstract Tile Assembly Model.” 2013. Web. 16 Jan 2021.
Vancouver:
Moore TG. Directed Percolation and the Abstract Tile Assembly Model. [Internet] [Masters thesis]. University of Arkansas; 2013. [cited 2021 Jan 16].
Available from: https://scholarworks.uark.edu/etd/765.
Council of Science Editors:
Moore TG. Directed Percolation and the Abstract Tile Assembly Model. [Masters Thesis]. University of Arkansas; 2013. Available from: https://scholarworks.uark.edu/etd/765
University of Arkansas
9.
Morovat, Katanosh.
Data Integrity Verification in Cloud Computing.
Degree: MS, 2015, University of Arkansas
URL: https://scholarworks.uark.edu/etd/1125
► Cloud computing is an architecture model which provides computing and storage capacity as a service over the internet. Cloud computing should provide secure services…
(more)
▼ Cloud computing is an architecture model which provides computing and storage capacity as a service over the internet. Cloud computing should provide secure services for users and owners of data as well. Cloud computing services are a completely internet-based technology where data are stored and maintained in the data center of a cloud provider. Lack of appropriate control over the data might incur several security issues. As a result, some data stored in the cloud must be protected at all times. These types of data are called sensitive data. Sensitive data is defined as data that must be protected against unwarranted disclosure. Generally, almost all personal information might be considered sensitive data. This research paper outlines how data owners determine which data should be considered sensitive data, how data owners are able to keep their data to be secured and trustable, and how data owners are able to verify integrity of their data in cloud computing. Finally this research provides several analyses to show the effectiveness of the data integrity verification method.
Advisors/Committee Members: Brajendra Panda, Ning%20Li%22%29&pagesize-30">
Wing-
Ning Li,
Gordon Beavers.
Subjects/Keywords: Applied sciences; Cloud computing; Database management systems; Security; Computer and Systems Architecture; Data Storage Systems
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Morovat, K. (2015). Data Integrity Verification in Cloud Computing. (Masters Thesis). University of Arkansas. Retrieved from https://scholarworks.uark.edu/etd/1125
Chicago Manual of Style (16th Edition):
Morovat, Katanosh. “Data Integrity Verification in Cloud Computing.” 2015. Masters Thesis, University of Arkansas. Accessed January 16, 2021.
https://scholarworks.uark.edu/etd/1125.
MLA Handbook (7th Edition):
Morovat, Katanosh. “Data Integrity Verification in Cloud Computing.” 2015. Web. 16 Jan 2021.
Vancouver:
Morovat K. Data Integrity Verification in Cloud Computing. [Internet] [Masters thesis]. University of Arkansas; 2015. [cited 2021 Jan 16].
Available from: https://scholarworks.uark.edu/etd/1125.
Council of Science Editors:
Morovat K. Data Integrity Verification in Cloud Computing. [Masters Thesis]. University of Arkansas; 2015. Available from: https://scholarworks.uark.edu/etd/1125
University of Arkansas
10.
Godfrey, Luke.
Neural Decomposition of Time-Series Data for Effective Generalization.
Degree: MS, 2015, University of Arkansas
URL: https://scholarworks.uark.edu/etd/1360
► We present a neural network technique for the analysis and extrapolation of time-series data called Neural Decomposition (ND). Units with a sinusoidal activation function…
(more)
▼ We present a neural network technique for the analysis and extrapolation of time-series data called Neural Decomposition (ND). Units with a sinusoidal activation function are used to perform a Fourier-like decomposition of training samples into a sum of sinusoids, augmented by units with nonperiodic activation functions to capture linear trends and other nonperiodic components. We show how careful weight initialization can be combined with regularization to form a simple model that generalizes well. Our method generalizes effectively on the Mackey-Glass series, a dataset of unemployment rates as reported by the U.S. Department of Labor Statistics, a time-series of monthly international airline passengers, the monthly ozone concentration in downtown Los Angeles, and an unevenly sampled time-series of oxygen isotope measurements from a cave in north India. We find that ND outperforms popular time-series forecasting techniques including ARIMA, SARIMA, SVR with a radial basis function, Gashler and Ashmore’s model, and echo state networks.
Advisors/Committee Members: Michael Gashler, Wing Ning Li, Xintao Wu.
Subjects/Keywords: Applied sciences; Other Computer Sciences
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Godfrey, L. (2015). Neural Decomposition of Time-Series Data for Effective Generalization. (Masters Thesis). University of Arkansas. Retrieved from https://scholarworks.uark.edu/etd/1360
Chicago Manual of Style (16th Edition):
Godfrey, Luke. “Neural Decomposition of Time-Series Data for Effective Generalization.” 2015. Masters Thesis, University of Arkansas. Accessed January 16, 2021.
https://scholarworks.uark.edu/etd/1360.
MLA Handbook (7th Edition):
Godfrey, Luke. “Neural Decomposition of Time-Series Data for Effective Generalization.” 2015. Web. 16 Jan 2021.
Vancouver:
Godfrey L. Neural Decomposition of Time-Series Data for Effective Generalization. [Internet] [Masters thesis]. University of Arkansas; 2015. [cited 2021 Jan 16].
Available from: https://scholarworks.uark.edu/etd/1360.
Council of Science Editors:
Godfrey L. Neural Decomposition of Time-Series Data for Effective Generalization. [Masters Thesis]. University of Arkansas; 2015. Available from: https://scholarworks.uark.edu/etd/1360
University of Arkansas
11.
Ashmore, Stephen Charles.
Evaluating the Intrinsic Similarity between Neural Networks.
Degree: MS, 2015, University of Arkansas
URL: https://scholarworks.uark.edu/etd/1395
► We present Forward Bipartite Alignment (FBA), a method that aligns the topological structures of two neural networks. Neural networks are considered to be a…
(more)
▼ We present Forward Bipartite Alignment (FBA), a method that aligns the topological structures of two neural networks. Neural networks are considered to be a black box, because neural networks contain complex model surface determined by their weights that combine attributes non-linearly. Two networks that make similar predictions on training data may still generalize differently. FBA enables a diversity of applications, including visualization and canonicalization of neural networks, ensembles, and cross-over between unrelated neural networks in evolutionary optimization. We describe the FBA algorithm, and describe implementations for three applications: genetic algorithms, visualization, and ensembles. We demonstrate FBA's usefulness by comparing a bag of neural networks to a bag of FBA-aligned neural networks. We also show that aligning, and then combining two neural networks has no appreciable loss in accuracy which means that Forward Bipartite Alignment aligns neural networks in a meaningful way.
Advisors/Committee Members: Michael Gashler, John Gauch, Wing Ning Li.
Subjects/Keywords: Applied sciences; Forward bipartite alignment; Machine learning; Neutral network; Artificial Intelligence and Robotics; OS and Networks
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Ashmore, S. C. (2015). Evaluating the Intrinsic Similarity between Neural Networks. (Masters Thesis). University of Arkansas. Retrieved from https://scholarworks.uark.edu/etd/1395
Chicago Manual of Style (16th Edition):
Ashmore, Stephen Charles. “Evaluating the Intrinsic Similarity between Neural Networks.” 2015. Masters Thesis, University of Arkansas. Accessed January 16, 2021.
https://scholarworks.uark.edu/etd/1395.
MLA Handbook (7th Edition):
Ashmore, Stephen Charles. “Evaluating the Intrinsic Similarity between Neural Networks.” 2015. Web. 16 Jan 2021.
Vancouver:
Ashmore SC. Evaluating the Intrinsic Similarity between Neural Networks. [Internet] [Masters thesis]. University of Arkansas; 2015. [cited 2021 Jan 16].
Available from: https://scholarworks.uark.edu/etd/1395.
Council of Science Editors:
Ashmore SC. Evaluating the Intrinsic Similarity between Neural Networks. [Masters Thesis]. University of Arkansas; 2015. Available from: https://scholarworks.uark.edu/etd/1395
University of Arkansas
12.
Smith, Josh Reeves.
Investigation of How Neural Networks Learn From the Experiences of Peers Through Periodic Weight Averaging.
Degree: MSCmpE, 2017, University of Arkansas
URL: https://scholarworks.uark.edu/etd/1877
► We investigate a method, weighted average model fusion, that enables neural networks to learn from the experiences of other networks, as well as from…
(more)
▼ We investigate a method, weighted average model fusion, that enables neural networks to learn from the experiences of other networks, as well as from their own experiences. This method is inspired by the the Social natural of humans, which has been shown to be one of the biggest factors in the development of our cognitive abilities. Modern machine learning has focuses predominantly on learning from direct training, and has largely ignored learning through Social engagement with peers, neural networks will the same topology. In order to explore learning through engagement with peers, we have created a way for neural networks to teach each other. Our method allows neural networks to exchange knowledge by combining their weights. It calculates a pairwise weighted average of the weights of two neural networks, and then replaces the existing weight with the new value. We find that weighted average model fusion successfully enables neural networks to learn from the experiences of their peers and combine it with the knowledge that is gained from its own
individual experiences. Additionally, we explore the effects that several meta-parameters have on model fusion to provide deeper insights into how the behaves in a variety of scenarios.
Advisors/Committee Members: Michael S. Gashler, Susan Gauch, Wing Ning Li.
Subjects/Keywords: Applied sciences; Machine learning; Neural networks; Weight averaging; Civic and Community Engagement
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Smith, J. R. (2017). Investigation of How Neural Networks Learn From the Experiences of Peers Through Periodic Weight Averaging. (Masters Thesis). University of Arkansas. Retrieved from https://scholarworks.uark.edu/etd/1877
Chicago Manual of Style (16th Edition):
Smith, Josh Reeves. “Investigation of How Neural Networks Learn From the Experiences of Peers Through Periodic Weight Averaging.” 2017. Masters Thesis, University of Arkansas. Accessed January 16, 2021.
https://scholarworks.uark.edu/etd/1877.
MLA Handbook (7th Edition):
Smith, Josh Reeves. “Investigation of How Neural Networks Learn From the Experiences of Peers Through Periodic Weight Averaging.” 2017. Web. 16 Jan 2021.
Vancouver:
Smith JR. Investigation of How Neural Networks Learn From the Experiences of Peers Through Periodic Weight Averaging. [Internet] [Masters thesis]. University of Arkansas; 2017. [cited 2021 Jan 16].
Available from: https://scholarworks.uark.edu/etd/1877.
Council of Science Editors:
Smith JR. Investigation of How Neural Networks Learn From the Experiences of Peers Through Periodic Weight Averaging. [Masters Thesis]. University of Arkansas; 2017. Available from: https://scholarworks.uark.edu/etd/1877
University of Arkansas
13.
Godfrey, Luke Benjamin.
Parameterizing and Aggregating Activation Functions in Deep Neural Networks.
Degree: PhD, 2018, University of Arkansas
URL: https://scholarworks.uark.edu/etd/2655
► The nonlinear activation functions applied by each neuron in a neural network are essential for making neural networks powerful representational models. If these are…
(more)
▼ The nonlinear activation functions applied by each neuron in a neural network are essential for making neural networks powerful representational models. If these are omitted, even deep neural networks reduce to simple linear regression due to the fact that a linear combination of linear combinations is still a linear combination. In much of the existing literature on neural networks, just one or two activation functions are selected for the entire network, even though the use of heterogenous activation functions has been shown to produce superior results in some cases. Even less often employed are activation functions that can adapt their nonlinearities as network parameters along with standard weights and biases. This dissertation presents a collection of papers that advance the state of heterogenous and parameterized activation functions. Contributions of this dissertation include
three novel parametric activation functions and applications of each,
a study evaluating the utility of the parameters in parametric activation functions,
an aggregated activation approach to modeling time-series data as an alternative to recurrent neural networks, and
an improvement upon existing work that aggregates neuron inputs using product instead of sum.
Advisors/Committee Members: Michael S. Gashler, Wing Ning Li, Xintao Wu.
Subjects/Keywords: Activation function; Deep learning; Forecasting; Machine learning; Neural network; Parametric function; Artificial Intelligence and Robotics
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Godfrey, L. B. (2018). Parameterizing and Aggregating Activation Functions in Deep Neural Networks. (Doctoral Dissertation). University of Arkansas. Retrieved from https://scholarworks.uark.edu/etd/2655
Chicago Manual of Style (16th Edition):
Godfrey, Luke Benjamin. “Parameterizing and Aggregating Activation Functions in Deep Neural Networks.” 2018. Doctoral Dissertation, University of Arkansas. Accessed January 16, 2021.
https://scholarworks.uark.edu/etd/2655.
MLA Handbook (7th Edition):
Godfrey, Luke Benjamin. “Parameterizing and Aggregating Activation Functions in Deep Neural Networks.” 2018. Web. 16 Jan 2021.
Vancouver:
Godfrey LB. Parameterizing and Aggregating Activation Functions in Deep Neural Networks. [Internet] [Doctoral dissertation]. University of Arkansas; 2018. [cited 2021 Jan 16].
Available from: https://scholarworks.uark.edu/etd/2655.
Council of Science Editors:
Godfrey LB. Parameterizing and Aggregating Activation Functions in Deep Neural Networks. [Doctoral Dissertation]. University of Arkansas; 2018. Available from: https://scholarworks.uark.edu/etd/2655
. 
Open Access Theses and Dissertations