Matching Items (412)
152172-Thumbnail Image.png
Description
The primary function of the medium access control (MAC) protocol is managing access to a shared communication channel. From the viewpoint of transmitters, the MAC protocol determines each transmitter's persistence, the fraction of time it is permitted to spend transmitting. Schedule-based schemes implement stable persistences, achieving low variation in delay

The primary function of the medium access control (MAC) protocol is managing access to a shared communication channel. From the viewpoint of transmitters, the MAC protocol determines each transmitter's persistence, the fraction of time it is permitted to spend transmitting. Schedule-based schemes implement stable persistences, achieving low variation in delay and throughput, and sometimes bounding maximum delay. However, they adapt slowly, if at all, to changes in the network. Contention-based schemes are agile, adapting quickly to changes in perceived contention, but suffer from short-term unfairness, large variations in packet delay, and poor performance at high load. The perfect MAC protocol, it seems, embodies the strengths of both contention- and schedule-based approaches while avoiding their weaknesses. This thesis culminates in the design of a Variable-Weight and Adaptive Topology Transparent (VWATT) MAC protocol. The design of VWATT first required answers for two questions: (1) If a node is equipped with schedules of different weights, which weight should it employ? (2) How is the node to compute the desired weight in a network lacking centralized control? The first question is answered by the Topology- and Load-Aware (TLA) allocation which defines target persistences that conform to both network topology and traffic load. Simulations show the TLA allocation to outperform IEEE 802.11, improving on the expectation and variation of delay, throughput, and drop rate. The second question is answered in the design of an Adaptive Topology- and Load-Aware Scheduled (ATLAS) MAC that computes the TLA allocation in a decentralized and adaptive manner. Simulation results show that ATLAS converges quickly on the TLA allocation, supporting highly dynamic networks. With these questions answered, a construction based on transversal designs is given for a variable-weight topology transparent schedule that allows nodes to dynamically and independently select weights to accommodate local topology and traffic load. The schedule maintains a guarantee on maximum delay when the maximum neighbourhood size is not too large. The schedule is integrated with the distributed computation of ATLAS to create VWATT. Simulations indicate that VWATT offers the stable performance characteristics of a scheduled MAC while adapting quickly to changes in topology and traffic load.
ContributorsLutz, Jonathan (Author) / Colbourn, Charles J (Thesis advisor) / Syrotiuk, Violet R. (Thesis advisor) / Konjevod, Goran (Committee member) / Lloyd, Errol L. (Committee member) / Arizona State University (Publisher)
Created2013
150660-Thumbnail Image.png
Description
Semiconductor scaling technology has led to a sharp growth in transistor counts. This has resulted in an exponential increase on both power dissipation and heat flux (or power density) in modern microprocessors. These microprocessors are integrated as the major components in many modern embedded devices, which offer richer features and

Semiconductor scaling technology has led to a sharp growth in transistor counts. This has resulted in an exponential increase on both power dissipation and heat flux (or power density) in modern microprocessors. These microprocessors are integrated as the major components in many modern embedded devices, which offer richer features and attain higher performance than ever before. Therefore, power and thermal management have become the significant design considerations for modern embedded devices. Dynamic voltage/frequency scaling (DVFS) and dynamic power management (DPM) are two well-known hardware capabilities offered by modern embedded processors. However, the power or thermal aware performance optimization is not fully explored for the mainstream embedded processors with discrete DVFS and DPM capabilities. Many key problems have not been answered yet. What is the maximum performance that an embedded processor can achieve under power or thermal constraint for a periodic application? Does there exist an efficient algorithm for the power or thermal management problems with guaranteed quality bound? These questions are hard to be answered because the discrete settings of DVFS and DPM enhance the complexity of many power and thermal management problems, which are generally NP-hard. The dissertation presents a comprehensive study on these NP-hard power and thermal management problems for embedded processors with discrete DVFS and DPM capabilities. In the domain of power management, the dissertation addresses the power minimization problem for real-time schedules, the energy-constrained make-span minimization problem on homogeneous and heterogeneous chip multiprocessors (CMP) architectures, and the battery aware energy management problem with nonlinear battery discharging model. In the domain of thermal management, the work addresses several thermal-constrained performance maximization problems for periodic embedded applications. All the addressed problems are proved to be NP-hard or strongly NP-hard in the study. Then the work focuses on the design of the off-line optimal or polynomial time approximation algorithms as solutions in the problem design space. Several addressed NP-hard problems are tackled by dynamic programming with optimal solutions and pseudo-polynomial run time complexity. Because the optimal algorithms are not efficient in worst case, the fully polynomial time approximation algorithms are provided as more efficient solutions. Some efficient heuristic algorithms are also presented as solutions to several addressed problems. The comprehensive study answers the key questions in order to fully explore the power and thermal management potentials on embedded processors with discrete DVFS and DPM capabilities. The provided solutions enable the theoretical analysis of the maximum performance for periodic embedded applications under power or thermal constraints.
ContributorsZhang, Sushu (Author) / Chatha, Karam S (Thesis advisor) / Cao, Yu (Committee member) / Konjevod, Goran (Committee member) / Vrudhula, Sarma (Committee member) / Xue, Guoliang (Committee member) / Arizona State University (Publisher)
Created2012
149703-Thumbnail Image.png
Description
This dissertation studies routing in small-world networks such as grids plus long-range edges and real networks. Kleinberg showed that geography-based greedy routing in a grid-based network takes an expected number of steps polylogarithmic in the network size, thus justifying empirical efficiency observed beginning with Milgram. A counterpart for the grid-based

This dissertation studies routing in small-world networks such as grids plus long-range edges and real networks. Kleinberg showed that geography-based greedy routing in a grid-based network takes an expected number of steps polylogarithmic in the network size, thus justifying empirical efficiency observed beginning with Milgram. A counterpart for the grid-based model is provided; it creates all edges deterministically and shows an asymptotically matching upper bound on the route length. The main goal is to improve greedy routing through a decentralized machine learning process. Two considered methods are based on weighted majority and an algorithm of de Farias and Megiddo, both learning from feedback using ensembles of experts. Tests are run on both artificial and real networks, with decentralized spectral graph embedding supplying geometric information for real networks where it is not intrinsically available. An important measure analyzed in this work is overpayment, the difference between the cost of the method and that of the shortest path. Adaptive routing overtakes greedy after about a hundred or fewer searches per node, consistently across different network sizes and types. Learning stabilizes, typically at overpayment of a third to a half of that by greedy. The problem is made more difficult by eliminating the knowledge of neighbors' locations or by introducing uncooperative nodes. Even under these conditions, the learned routes are usually better than the greedy routes. The second part of the dissertation is related to the community structure of unannotated networks. A modularity-based algorithm of Newman is extended to work with overlapping communities (including considerably overlapping communities), where each node locally makes decisions to which potential communities it belongs. To measure quality of a cover of overlapping communities, a notion of a node contribution to modularity is introduced, and subsequently the notion of modularity is extended from partitions to covers. The final part considers a problem of network anonymization, mostly by the means of edge deletion. The point of interest is utility preservation. It is shown that a concentration on the preservation of routing abilities might damage the preservation of community structure, and vice versa.
ContributorsBakun, Oleg (Author) / Konjevod, Goran (Thesis advisor) / Richa, Andrea (Thesis advisor) / Syrotiuk, Violet R. (Committee member) / Czygrinow, Andrzej (Committee member) / Arizona State University (Publisher)
Created2011
150111-Thumbnail Image.png
Description
Finding the optimal solution to a problem with an enormous search space can be challenging. Unless a combinatorial construction technique is found that also guarantees the optimality of the resulting solution, this could be an infeasible task. If such a technique is unavailable, different heuristic methods are generally used to

Finding the optimal solution to a problem with an enormous search space can be challenging. Unless a combinatorial construction technique is found that also guarantees the optimality of the resulting solution, this could be an infeasible task. If such a technique is unavailable, different heuristic methods are generally used to improve the upper bound on the size of the optimal solution. This dissertation presents an alternative method which can be used to improve a solution to a problem rather than construct a solution from scratch. Necessity analysis, which is the key to this approach, is the process of analyzing the necessity of each element in a solution. The post-optimization algorithm presented here utilizes the result of the necessity analysis to improve the quality of the solution by eliminating unnecessary objects from the solution. While this technique could potentially be applied to different domains, this dissertation focuses on k-restriction problems, where a solution to the problem can be presented as an array. A scalable post-optimization algorithm for covering arrays is described, which starts from a valid solution and performs necessity analysis to iteratively improve the quality of the solution. It is shown that not only can this technique improve upon the previously best known results, it can also be added as a refinement step to any construction technique and in most cases further improvements are expected. The post-optimization algorithm is then modified to accommodate every k-restriction problem; and this generic algorithm can be used as a starting point to create a reasonable sized solution for any such problem. This generic algorithm is then further refined for hash family problems, by adding a conflict graph analysis to the necessity analysis phase. By recoloring the conflict graphs a new degree of flexibility is explored, which can further improve the quality of the solution.
ContributorsNayeri, Peyman (Author) / Colbourn, Charles (Thesis advisor) / Konjevod, Goran (Thesis advisor) / Sen, Arunabha (Committee member) / Stanzione Jr, Daniel (Committee member) / Arizona State University (Publisher)
Created2011
150114-Thumbnail Image.png
Description
Reverse engineering gene regulatory networks (GRNs) is an important problem in the domain of Systems Biology. Learning GRNs is challenging due to the inherent complexity of the real regulatory networks and the heterogeneity of samples in available biomedical data. Real world biological data are commonly collected from broad surveys (profiling

Reverse engineering gene regulatory networks (GRNs) is an important problem in the domain of Systems Biology. Learning GRNs is challenging due to the inherent complexity of the real regulatory networks and the heterogeneity of samples in available biomedical data. Real world biological data are commonly collected from broad surveys (profiling studies) and aggregate highly heterogeneous biological samples. Popular methods to learn GRNs simplistically assume a single universal regulatory network corresponding to available data. They neglect regulatory network adaptation due to change in underlying conditions and cellular phenotype or both. This dissertation presents a novel computational framework to learn common regulatory interactions and networks underlying the different sets of relatively homogeneous samples from real world biological data. The characteristic set of samples/conditions and corresponding regulatory interactions defines the cellular context (context). Context, in this dissertation, represents the deterministic transcriptional activity within the specific cellular regulatory mechanism. The major contributions of this framework include - modeling and learning context specific GRNs; associating enriched samples with contexts to interpret contextual interactions using biological knowledge; pruning extraneous edges from the context-specific GRN to improve the precision of the final GRNs; integrating multisource data to learn inter and intra domain interactions and increase confidence in obtained GRNs; and finally, learning combinatorial conditioning factors from the data to identify regulatory cofactors. The framework, Expattern, was applied to both real world and synthetic data. Interesting insights were obtained into mechanism of action of drugs on analysis of NCI60 drug activity and gene expression data. Application to refractory cancer data and Glioblastoma multiforme yield GRNs that were readily annotated with context-specific phenotypic information. Refractory cancer GRNs also displayed associations between distinct cancers, not observed through only clustering. Performance comparisons on multi-context synthetic data show the framework Expattern performs better than other comparable methods.
ContributorsSen, Ina (Author) / Kim, Seungchan (Thesis advisor) / Baral, Chitta (Committee member) / Bittner, Michael (Committee member) / Konjevod, Goran (Committee member) / Arizona State University (Publisher)
Created2011
149501-Thumbnail Image.png
Description
Peer-to-peer systems are known to be vulnerable to the Sybil attack. The lack of a central authority allows a malicious user to create many fake identities (called Sybil nodes) pretending to be independent honest nodes. The goal of the malicious user is to influence the system on his/her behalf. In

Peer-to-peer systems are known to be vulnerable to the Sybil attack. The lack of a central authority allows a malicious user to create many fake identities (called Sybil nodes) pretending to be independent honest nodes. The goal of the malicious user is to influence the system on his/her behalf. In order to detect the Sybil nodes and prevent the attack, a reputation system is used for the nodes, built through observing its interactions with its peers. The construction makes every node a part of a distributed authority that keeps records on the reputation and behavior of the nodes. Records of interactions between nodes are broadcast by the interacting nodes and honest reporting proves to be a Nash Equilibrium for correct (non-Sybil) nodes. In this research is argued that in realistic communication schedule scenarios, simple graph-theoretic queries such as the computation of Strongly Connected Components and Densest Subgraphs, help in exposing those nodes most likely to be Sybil, which are then proved to be Sybil or not through a direct test executed by some peers.
ContributorsCárdenas-Haro, José Antonio (Author) / Konjevod, Goran (Thesis advisor) / Richa, Andréa W. (Thesis advisor) / Sen, Arunabha (Committee member) / Xue, Guoliang (Committee member) / Arizona State University (Publisher)
Created2010
Description

Pay-for-performance (PFP) is a relatively new approach to agricultural conservation that attaches an incentive payment to quantified reductions in nutrient runoff from a participating farm. Similar to a payment for ecosystem services approach, PFP lends itself to providing incentives for the most beneficial practices at the field level. To date,

Pay-for-performance (PFP) is a relatively new approach to agricultural conservation that attaches an incentive payment to quantified reductions in nutrient runoff from a participating farm. Similar to a payment for ecosystem services approach, PFP lends itself to providing incentives for the most beneficial practices at the field level. To date, PFP conservation in the U.S. has only been applied in small pilot programs. Because monitoring conservation performance for each field enrolled in a program would be cost-prohibitive, field-level modeling can provide cost-effective estimates of anticipated improvements in nutrient runoff. We developed a PFP system that uses a unique application of one of the leading agricultural models, the USDA’s Soil and Water Assessment Tool, to evaluate the nutrient load reductions of potential farm practice changes based on field-level agronomic and management data. The initial phase of the project focused on simulating individual fields in the River Raisin watershed in southeastern Michigan. Here we present development of the modeling approach and results from the pilot year, 2015-2016. These results stress that (1) there is variability in practice effectiveness both within and between farms, and thus there is not one “best practice” for all farms, (2) conservation decisions are made most effectively at the scale of the farm field rather than the sub-watershed or watershed level, and (3) detailed, field-level management information is needed to accurately model and manage on-farm nutrient loadings.

Supplemental information mentioned in the article is attached as a separate document.

ContributorsMuenich, Rebecca (Author) / Kalcic, M. M. (Author) / Winsten, J. (Author) / Fisher, K. (Author) / Day, M. (Author) / O'Neil, G. (Author) / Wang, Y.-C. (Author) / Scavia, D. (Author) / Ira A. Fulton Schools of Engineering (Contributor)
Created2017
128329-Thumbnail Image.png
Description

The emerging field of neuroprosthetics is focused on the development of new therapeutic interventions that will be able to restore some lost neural function by selective electrical stimulation or by harnessing activity recorded from populations of neurons. As more and more patients benefit from these approaches, the interest in neural

The emerging field of neuroprosthetics is focused on the development of new therapeutic interventions that will be able to restore some lost neural function by selective electrical stimulation or by harnessing activity recorded from populations of neurons. As more and more patients benefit from these approaches, the interest in neural interfaces has grown significantly and a new generation of penetrating microelectrode arrays are providing unprecedented access to the neurons of the central nervous system (CNS). These microelectrodes have active tip dimensions that are similar in size to neurons and because they penetrate the nervous system, they provide selective access to these cells (within a few microns). However, the very long-term viability of chronically implanted microelectrodes and the capability of recording the same spiking activity over long time periods still remain to be established and confirmed in human studies. Here we review the main responses to acute implantation of microelectrode arrays, and emphasize that it will become essential to control the neural tissue damage induced by these intracortical microelectrodes in order to achieve the high clinical potentials accompanying this technology.

ContributorsFernandez, Eduardo (Author) / Greger, Bradley (Author) / House, Paul A. (Author) / Aranda, Ignacio (Author) / Botella, Carlos (Author) / Albisua, Julio (Author) / Soto-Sanchez, Cristina (Author) / Alfaro, Arantxa (Author) / Normann, Richard A. (Author) / Ira A. Fulton Schools of Engineering (Contributor)
Created2014-07-21
127956-Thumbnail Image.png
Description

In this study, a low-cycle fatigue experiment was conducted on printed wiring boards (PWB). The Weibull regression model and computational Bayesian analysis method were applied to analyze failure time data and to identify important factors that influence the PWB lifetime. The analysis shows that both shape parameter and scale parameter

In this study, a low-cycle fatigue experiment was conducted on printed wiring boards (PWB). The Weibull regression model and computational Bayesian analysis method were applied to analyze failure time data and to identify important factors that influence the PWB lifetime. The analysis shows that both shape parameter and scale parameter of Weibull distribution are affected by the supplier factor and preconditioning methods Based on the energy equivalence approach, a 6-cycle reflow precondition can be replaced by a 5-cycle IST precondition, thus the total testing time can be greatly reduced. This conclusion was validated by the likelihood ratio test of two datasets collected under two different preconditioning methods Therefore, the Weibull regression modeling approach is an effective approach for accounting for the variation of experimental setting in the PWB lifetime prediction.

ContributorsPan, Rong (Author) / Xu, Xinyue (Author) / Juarez, Joseph (Author) / Ira A. Fulton Schools of Engineering (Contributor)
Created2016-11-12
127957-Thumbnail Image.png
Description

Studies about the data quality of National Bridge Inventory (NBI) reveal missing, erroneous, and logically conflicting data. Existing data quality programs lack a focus on detecting the logical inconsistencies within NBI and between NBI and external data sources. For example, within NBI, the structural condition ratings of some bridges improve

Studies about the data quality of National Bridge Inventory (NBI) reveal missing, erroneous, and logically conflicting data. Existing data quality programs lack a focus on detecting the logical inconsistencies within NBI and between NBI and external data sources. For example, within NBI, the structural condition ratings of some bridges improve over a period while having no improvement activity or maintenance funds recorded in relevant attributes documented in NBI. An example of logical inconsistencies between NBI and external data sources is that some bridges are not located within 100 meters of any roads extracted from Google Map. Manual detection of such logical errors is tedious and error-prone. This paper proposes a systematical “hypothesis testing” approach for automatically detecting logical inconsistencies within NBI and between NBI and external data sources. Using this framework, the authors detected logical inconsistencies in the NBI data of two sample states for revealing suspicious data items in NBI. The results showed that about 1% of bridges were not located within 100 meters of any actual roads, and few bridges showed improvements in the structural evaluation without any reported maintenance records.

ContributorsDin, Zia Ud (Author) / Tang, Pingbo (Author) / Ira A. Fulton Schools of Engineering (Contributor)
Created2016-05-20