Cache-Enabled In Cooperative Cognitive Radio Networks For Transmission Performance, 2020 Tianjin University

#### Cache-Enabled In Cooperative Cognitive Radio Networks For Transmission Performance, Jiachen Yang, Houbing Song, Chaofan Ma, Jiabao Man, Huifang Xu, Gan Zheng

*Publications*

The proliferation of mobile devices that support the acceleration of data services (especially smartphones) has resulted in a dramatic increase in mobile traffic. Mobile data also increased exponentially, already exceeding the throughput of the backhaul. To improve spectrum utilization and increase mobile network traffic, in combination with content caching, we study the cooperation between primary and secondary networks via content caching. We consider that the secondary base station assists the primary user by pre-caching some popular primary contents. Thus, the secondary base station can obtain more licensed bandwidth to serve its own user. We mainly focus on the time delay ...

Designing Fractal Line Pied-De-Poules: A Case Study In Algorithmic Design Mediating Between Culture And Fractal Mathematics, 2020 Eindhoven University of Technology

#### Designing Fractal Line Pied-De-Poules: A Case Study In Algorithmic Design Mediating Between Culture And Fractal Mathematics, Loe M.G. Feijs

*Journal of Humanistic Mathematics*

Millions of people own and wear pied-de-poule (houndstooth) garments. The pattern has an intriguing basic figure and a typical set of symmetries. The origin of the pattern lies in a specific type of weaving. In this article I apply computational techniques to modernize this ancient decorative pattern. In particular I describe a way to enrich pied-de-poule with a fractal structure.

Although a first fractal line pied-de-poule was shown at Bridges 2015, a number of fundamental questions still remained. The following questions are addressed in this article: Does the original pied-de-poule appear as a limit case when the fractal structure is ...

Multi-Input Strictly Local Functions For Templatic Morphology, 2020 Stony Brook University

#### Multi-Input Strictly Local Functions For Templatic Morphology, Hossep Dolatian, Jonathan Rawski

*Proceedings of the Society for Computation in Linguistics*

This paper presents an automata-theoretic characterization of templatic morphology. We generalize the Input Strictly Local class of functions, which characterize a majority of concatenative morphology, to consider multiple lexical inputs. We show that strictly local asynchronous multi-tape transducers successfully capture this typology of nonconcatenative template filling. This characterization and restriction uniquely opens up representational issues in morphological computation

Multi-Input Strict Local Functions For Tonal Phonology, 2020 Stony Brook University

#### Multi-Input Strict Local Functions For Tonal Phonology, Jonathan Rawski, Hossep Dolatian

*Proceedings of the Society for Computation in Linguistics*

This paper presents an automata-theoretic characterization of the typology of attested tonal patterns using enriched data structures. We generalize the Input Strictly Local class of functions to consider multiple inputs of tonal and segmental strings, and find that the associated strictly local multi-tape transducers successfully capture tonal typology. Links between automata-theoretic and logical characterizations of phonological expressivity showcase the tradeoffs in data structure and locality in the expressivity of phonological computation.

Straggler-Resistant Distributed Matrix Computation Via Coding Theory, 2020 Iowa State University

#### Straggler-Resistant Distributed Matrix Computation Via Coding Theory, Aditya Ramamoorthy, Anindya Bijoy Das, Li Tang

*Electrical and Computer Engineering Publications*

The current BigData era routinely requires the processing of large scale data on massive distributed computing clusters. Such large scale clusters often suffer from the problem of "stragglers", which are defined as slow or failed nodes. The overall speed of a computational job on these clusters is typically dominated by stragglers in the absence of a sophisticated assignment of tasks to the worker nodes. In recent years, approaches based on coding theory (referred to as "coded computation") have been effectively used for straggler mitigation. Coded computation offers significant benefits for specific classes of problems such as distributed matrix computations (which ...

Stochastic Orthogonalization And Its Application To Machine Learning, 2019 Southern Methodist University

#### Stochastic Orthogonalization And Its Application To Machine Learning, Yu Hong

*Electrical Engineering Theses and Dissertations*

Orthogonal transformations have driven many great achievements in signal processing. They simplify computation and stabilize convergence during parameter training. Researchers have introduced orthogonality to machine learning recently and have obtained some encouraging results. In this thesis, three new orthogonal constraint algorithms based on a stochastic version of an SVD-based cost are proposed, which are suited to training large-scale matrices in convolutional neural networks. We have observed better performance in comparison with other orthogonal algorithms for convolutional neural networks.

Hybrid Recommender Systems Via Spectral Learning And A Random Forest, 2019 East Tennessee State University

#### Hybrid Recommender Systems Via Spectral Learning And A Random Forest, Alyssa Williams

*Electronic Theses and Dissertations*

We demonstrate spectral learning can be combined with a random forest classifier to produce a hybrid recommender system capable of incorporating meta information. Spectral learning is supervised learning in which data is in the form of one or more networks. Responses are predicted from features obtained from the eigenvector decomposition of matrix representations of the networks. Spectral learning is based on the highest weight eigenvectors of natural Markov chain representations. A random forest is an ensemble technique for supervised learning whose internal predictive model can be interpreted as a nearest neighbor network. A hybrid recommender can be constructed by first ...

Contrasting Geometric Variations Of Mathematical Models Of Self-Assembling Systems, 2019 University of Arkansas, Fayetteville

#### Contrasting Geometric Variations Of Mathematical Models Of Self-Assembling Systems, Michael Sharp

*Theses and Dissertations*

Self-assembly is the process by which complex systems are formed and behave due to the interactions of relatively simple units. In this thesis, we explore multiple augmentations of well known models of self-assembly to gain a better understanding of the roles that geometry and space play in their dynamics. We begin in the abstract Tile Assembly Model (aTAM) with some examples and a brief survey of previous results to provide a foundation. We then introduce the Geometric Thermodynamic Binding Network model, a model that focuses on the thermodynamic stability of its systems while utilizing geometrically rigid components (dissimilar to other ...

Iomt Malware Detection Approaches: Analysis And Research Challenges, 2019 Old Dominion University

#### Iomt Malware Detection Approaches: Analysis And Research Challenges, Mohammad Wazid, Ashok Kumar Das, Joel J.P.C. Rodrigues, Sachin Shetty, Youngho Park

*VMASC Publications*

The advancement in Information and Communications Technology (ICT) has changed the entire paradigm of computing. Because of such advancement, we have new types of computing and communication environments, for example, Internet of Things (IoT) that is a collection of smart IoT devices. The Internet of Medical Things (IoMT) is a specific type of IoT communication environment which deals with communication through the smart healthcare (medical) devices. Though IoT communication environment facilitates and supports our day-to-day activities, but at the same time it has also certain drawbacks as it suffers from several security and privacy issues, such as replay, man-in-the-middle, impersonation ...

The Generation Of Operational Policy For Cyber-Physical Systems In Smart Homes, 2019 Missouri State University

#### The Generation Of Operational Policy For Cyber-Physical Systems In Smart Homes, Jared Wayne Hall

*MSU Graduate Theses*

The term “Cyber-Physical Systems” (CPS) refers to those systems which seamlessly integrate sensing, computation, control, and networking into physical objects and infrastructure [1]. In these systems, computers and networks of physical entities interact with each other to bring new capabilities to traditional physical systems. Since its introduction, the field of Cyber-Physical Systems (CPS) has evolved with new and interesting advancements concerning its capability, adaptability, scalability, and usability [1]. One such advancement is the unification of the Internet of Things (IoT), a concept that enables real-world everyday objects to connect to the internet and interact with each other, with CPS [1 ...

Testing Isomorphism Of Graded Algebras, 2019 Colorado State University - Fort Collins

#### Testing Isomorphism Of Graded Algebras, Peter A. Brooksbank, James B. Wilson, Eamonn A. O'Brien

*Faculty Journal Articles*

We present a new algorithm to decide isomorphism between finite graded algebras. For a broad class of nilpotent Lie algebras, we demonstrate that it runs in time polynomial in the order of the input algebras. We introduce heuristics that often dramatically improve the performance of the algorithm and report on an implementation in Magma.

Tools For Tutoring Theoretical Computer Science Topics, 2019 Wabash College

#### Tools For Tutoring Theoretical Computer Science Topics, Mark Mccartin-Lim

*Doctoral Dissertations*

This thesis introduces COMPLEXITY TUTOR, a tutoring system to assist in learning abstract proof-based topics, which has been specifically targeted towards the population of computer science students studying theoretical computer science. Existing literature has shown tremendous educational benefits produced by active learning techniques, student-centered pedagogy, gamification and intelligent tutoring systems. However, previously, there had been almost no research on adapting these ideas to the domain of theoretical computer science. As a population, computer science students receive immediate feedback from compilers and debuggers, but receive no similar level of guidance for theoretical coursework. One hypothesis of this thesis is that immediate ...

High Multiplicity Strip Packing Problem With Three Rectangle Types, 2019 The University of Western Ontario

#### High Multiplicity Strip Packing Problem With Three Rectangle Types, Andy Yu

*Electronic Thesis and Dissertation Repository*

The two-dimensional strip packing problem (2D-SPP) involves packing a set *R* = {*r _{1}*, ...,

*r*} of

_{n}*n*rectangular items into a strip of width 1 and unbounded height, where each rectangular item

*r*has width 0 <

_{i}*w*≤ 1 and height 0 <

_{i}*h*≤ 1. The objective is to find a packing for all these items, without overlaps or rotations, that minimizes the total height of the strip used. 2D-SPP is strongly

_{i}**NP**-hard and has practical applications including stock cutting, scheduling, and reducing peak power demand in smart-grids.

This thesis considers a special case of 2D-SPP in which ...

Software-Defined Infrastructure For Iot-Based Energy Systems, 2019 University of Massachusetts Amherst

#### Software-Defined Infrastructure For Iot-Based Energy Systems, Stephen Lee

*Doctoral Dissertations*

Internet of Things (IoT) devices are becoming an essential part of our everyday lives. These physical devices are connected to the internet and can measure or control the environment around us. Further, IoT devices are increasingly being used to monitor buildings, farms, health, and transportation. As these connected devices become more pervasive, these devices will generate vast amounts of data that can be used to gain insights and build intelligence into the system. At the same time, large-scale deployment of these devices will raise new challenges in efficiently managing and controlling them.

In this thesis, I argue that the IoT ...

Function And Dissipation In Finite State Automata - From Computing To Intelligence And Back, 2019 University of Massachusetts Amherst

#### Function And Dissipation In Finite State Automata - From Computing To Intelligence And Back, Natesh Ganesh

*Doctoral Dissertations*

Society has benefited from the technological revolution and the tremendous growth in computing powered by Moore's law. However, we are fast approaching the ultimate physical limits in terms of both device sizes and the associated energy dissipation. It is important to characterize these limits in a physically grounded and implementation-agnostic manner, in order to capture the fundamental energy dissipation costs associated with performing computing operations with classical information in nano-scale quantum systems. It is also necessary to identify and understand the effect of quantum in-distinguishability, noise, and device variability on these dissipation limits. Identifying these parameters is crucial to ...

Adaptive Randomized Rounding In The Big Parsimony Problem, 2019 Northwestern University

#### Adaptive Randomized Rounding In The Big Parsimony Problem, Sangho Shim, Sunil Chopra, Eunseok Kim

*Annual Symposium on Biomathematics and Ecology: Education and Research*

No abstract provided.

Developing A Computational Framework For A Construction Scheduling Decision Support Web Based Expert System, 2019 The University of Southern Mississippi

#### Developing A Computational Framework For A Construction Scheduling Decision Support Web Based Expert System, Feroz Ahmed

*Dissertations*

Decision-making is one of the basic cognitive processes of human behaviors by which a preferred option or a course of action is chosen from among a set of alternatives based on certain criteria. Decision-making is the thought process of selecting a logical choice from the available options. When trying to make a good decision, all the positives and negatives of each option should be evaluated. This decision-making process is particularly challenging during the preparation of a construction schedule, where it is difficult for a human to analyze all possible outcomes of each and every situation because, construction of a project ...

Identifying Relationships Of Interest In Complex Environments By Using Channel Theory, 2019 Fraunhofer IPA

#### Identifying Relationships Of Interest In Complex Environments By Using Channel Theory, Andreas Bildstein, Junkang Feng

*Communications of the IIMA*

*Complex environments show a high degree of dynamics caused by vital interactions between objects within those environments and alterations through which the set of objects and their characteristics within those environments go over time. Within this work, we show that we can tame the level of complexity in dynamic environments by identifying *‘*relationships of interest*’* between objects in such environments. To this end, we apply the theory of Information Flow, also known as Channel Theory, to the application area of smart manufacturing. We enhance the way how the Channel Theory has been applied so far by using an iterative approach ...*

Adaboost‑Based Security Level Classifcation Of Mobile Intelligent Terminals, 2019 University of Electronic Science and Technology of China

#### Adaboost‑Based Security Level Classifcation Of Mobile Intelligent Terminals, Feng Wang, Houbing Song, Dingde Jiang, Hong Wen

*Houbing Song*

With the rapid development of Internet of Things, massive mobile intelligent terminals are ready to access edge servers for real-time data calculation and interaction. However, the risk of private data leakage follows simultaneously. As the administrator of all intelligent terminals in a region, the edge server needs to clarify the ability of the managed intelligent terminals to defend against malicious attacks. Therefore, the security level classification for mobile intelligent terminals before accessing the network is indispensable. In this paper, we firstly propose a safety assessment method to detect the weakness of mobile intelligent terminals. Secondly, we match the evaluation results ...

High Multiplicity Strip Packing, 2019 The University of Western Ontario

#### High Multiplicity Strip Packing, Andrew Bloch-Hansen

*Electronic Thesis and Dissertation Repository*

In the *two-dimensional high multiplicity strip packing problem* (HMSPP), we are given *k* distinct rectangle types, where each rectangle type *T _{i}* has

*n*rectangles each with width

_{i}*0 < w*

_{i}and*height**0 < h*The goal is to pack these rectangles into a strip of width 1, without rotating or overlapping the rectangles, such that the total height of the packing is minimized._{i}Let *OPT(I)* be the optimal height of HMSPP on input *I*. In this thesis, we consider HMSPP for the case when *k = 3* and present an *OPT(I) + 5/3* polynomial time approximation algorithm for ...