BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CECS - ECPv6.18.4//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://www.cecs.uci.edu
X-WR-CALDESC:Events for CECS
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20120311T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20121104T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20130310T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20131103T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20140309T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20141102T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20150308T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20151101T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20160313T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20161106T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20170312T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20171105T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20180311T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20181104T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20170131T150000
DTEND;TZID=America/Los_Angeles:20170131T160000
DTSTAMP:20231011T190623Z
CREATED:20231011T190623Z
LAST-MODIFIED:20231011T190623Z
UID:14479-1485874800-1485878400@www.cecs.uci.edu
SUMMARY:Runtime Memory Management in Many-core Systems
DESCRIPTION:Name: Hossein Tajik\nDate: November 15\, 2016 \nTime: 3:00PM – 4:00PM \nLocation: DBH 3011 Conference Room \nCommittee: Nikil Dutt (Chair)\, Tony Givargis\, Alex Nicolau \nAbstract: \nWith the increasing number of cores on a chip\, we are moving towards an era where many-core platforms will soon be ubiquitous. Efficient use of tens to hundreds of cores on a chip and their memory resources comes with unique challenges. \nIn this dissertation\, we propose SPMPool: a scalable platform for sharing Software Programmable Memories (SPMs). The SPMPool approach exploits underutilized memory resources by dynamically sharing SPM resources between applications running on different cores and adapts to the overall memory requirements of multiple applications that are concurrently executing on the many-core platform. We propose both central and distributed management schemes for SPMPool and study the efficiency of auction-based mechanisms in solving the memory mapping problem. We also propose offline and online memory phase detection methods in order to increase the adaptivity of memory management to temporal changes in memory requirements of a single application. The runtime memory management schemes proposed in this dissertation enable better performance and power for many-core systems.
URL:https://www.cecs.uci.edu/event/runtime-memory-management-in-many-core-systems/
CATEGORIES:PhD Defenses
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20170130T150000
DTEND;TZID=America/Los_Angeles:20170130T160000
DTSTAMP:20231011T190642Z
CREATED:20231011T190642Z
LAST-MODIFIED:20231011T190642Z
UID:14492-1485788400-1485792000@www.cecs.uci.edu
SUMMARY:On Optimizing the Performance of Interference-Limited Wireless Systems
DESCRIPTION:Name: Rana A. Abdelaal\nDate: January 30\, 2017 \nTime: 1:00 PM \nLocation: Engineering Hall 3106 \nCommittee: Professor Ahmed Eltawil \nAbstract: \nMulti Input Multi Output (MIMO) technology has seen prolific use to achieve higher data rates and an improved communication experience for cellular systems. However\, one of the challenging problems in MIMO systems is interference. Interference limits the system performance in terms of rate and reliability. In this thesis\, we analyze methods that provide high performance over interference-limited wireless networks such as Long Term Evolution (LTE) and WiFi. In this thesis\, we tackle different sources of interference. One of the interference sources is the neighboring interference\, we propose methods that include an optimized solution that models the interference as correlated noise\, and uses its statistical information to jointly optimize the base station precoding and user receiver design of LTE systems. We study the benefits of exploiting interference in terms of both probability of error and signal-to-noise ratio (SNR). In addition\, we compare the proposed method with the conventional beamforming and maximum ratio combining (MRC). One of the key challenges to enable high data rates in the downlink of LTE is the precoding and receiver design. We focus primarily on the UE and the base station (BS) processing\, particularly on estimating and using the interference resulting from neighboring stations. In this thesis\, we propose a receiver design that performs well in the presence of interference. Furthermore\, we present a precoding scheme that the BS can use to maximize the signal-to-interference plus noise-ratio (SINR). An interference free scenario is used as a benchmark to evaluate the proposed system performance. In this thesis\, we optimize the performance of LTE by tackling practical considerations that affects the system performance. We present a suboptimal practical way of estimating the interference and utilizing this information on the processing techniques used at both the UE and the eNodeB sides. We focus on managing both MU-MIMO interference and other cell interference. The proposed study improves system performance even under non-perfect channel knowledge\, enabling the throughput gains promised by MU-MIMO. \nOther types of interference exist in In-band full-duplex (IBFD) communication systems. IBFD is very promising in enhancing wireless LANs\, where full-duplex access points (APs) can support simultaneous uplink (UL) and downlink (DL) flows over the same frequency channel. One of the key challenges limiting IBFD benefits is interference. In this thesis\, we also propose a scheduling technique to manage interference in wireless LANs with full-duplex capability. We focus primarily on scheduling UL and DL stations (STAs) that can be efficiently served simultaneously. \nIt is very important to apply system knowledge to reduce power and/or improve performance. Thus\, we also aim at exploring energy and power management techniques for practical wireless communication systems. An important topic for practical communication systems is handling the interference due to the power amplifier nonlinearities. Managing this type of interference is of very high importance\, especially in Orthogonal Frequency-Division Multiple Access (OFDMA) based communication systems. Although\, OFDMA is the modulation of choice due to its robustness to time-dispersive radio channels\, low-complexity receivers\, and simple combining of \nsignals from multiple transmitters in broadcast networks. The transmitter design for OFDMA is more costly\, as the Peak-to-Average Power Ratio (PAPR) of an OFDMA signal is relatively high\, resulting in the need for highly linear RF power amplifiers (PA). This problem becomes more compounded when a large number of PAs is required\, as in Massive MIMO for example. In this thesis\, we discuss the impact of PAs on cellular systems. We show the constraints that PAs introduce\, and we take these constraints into consideration while searching for the optimum set of transmitter and receiver filters. Moreover\, we highlight how Massive MIMO cellular networks can relax PAs constraints resulting in low cost PAs\, while maintaining high performance. The performance is evaluated by showing the probability of error curves and signal-to-noise-ratio curves for different transmit powers and different number of transmit antennas. Another promising topic for efficient practical communication systems is Associative processors (APs). AP is a good candidate for in-memory computation\, however it has been deemed too costly and energy hungry in the past. The advent of ultra-dense resistive memories is changing this paradigm\, allowing for efficient in-memory associative processors. However\, with high levels of integration\, issues related to power density become the bottleneck. In this thesis\, we show the potential use of the approximate computing in wireless communication systems\, specifically\, we present Fast Fourier Transform (FFT) implemented by associative processor. Results confirm that approximate computing for in-memory associative processors is a viable approach to reduce power consumption while maintaining good performance. A promising approach to save energy is through reducing the bit width\, however reducing the bit width introduces errors that may affect the performance. In this thesis\, our goal is to adjust the bit width based on the channel SNR\, aiming at achieving good performance at reduced energy consumption. The mathematical approach that analytically describes the system performance under the reduced bit width noise is presented. Based on this model\, an adaptive bit width adjustment algorithm is presented that utilizes the received SNR estimates to find the optimal bit width that achieves performance goals at reduced energy consumption. Simulation results show that the proposed algorithms can achieve up to 45% energy savings as compared to wireless communication systems with conventional FFT. \n 
URL:https://www.cecs.uci.edu/event/on-optimizing-the-performance-of-interference-limited-wireless-systems/
CATEGORIES:PhD Defenses
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20161206T150000
DTEND;TZID=America/Los_Angeles:20161206T160000
DTSTAMP:20231011T190622Z
CREATED:20231011T190622Z
LAST-MODIFIED:20231011T190622Z
UID:14476-1481036400-1481040000@www.cecs.uci.edu
SUMMARY:Scalable Runtime support for Edge-To-Cloud integration of Distributed Sensing Systems
DESCRIPTION:Name: Brett Chien\nDate: November 29\, 2016 \nTime: 10:00AM \nLocation: EH 2210 \nCommittee: Pai H. Chou (Chair) \nAbstract:  \nWhile Internet-Of-Things (IoT) has drawn more attention to researchers and the public\, to build a complete system from the edge sensing units to the cloud services requires massive amount of efforts. Researchers with strong interests in collected information are often lost in various technologies\, including distributed sensing embedded systems\, bridge devices between Internet and local network\, and data backend services. \nThis work takes a cross-system\, script-based\, and semantic-enhanced approach to address the problem of lacking suitable runtime supports. We proposed a threaded code runtime support for edge sensing systems\, a script based wrapper on Physical-to-Cyber bridges\, and scalable middleware into the backend services. \nWith proposed runtime supports\, we are able to apply distributed sensing systems into real world applications quickly and explorer insights from collected information. As a result\, a building structure monitoring system is installed and allow civil researchers to develop algorithms to prevent disaster events. Body area sensing systems such as ECG monitoring\, CO2 detection\, and body movement are developed. This enables baby screening and detect potential heart problems. The results have shown that with proposed runtime supports applications can be realized quickly and scalable.
URL:https://www.cecs.uci.edu/event/scalable-runtime-support-for-edge-to-cloud-integration-of-distributed-sensing-systems/
CATEGORIES:PhD Defenses
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20161114T150000
DTEND;TZID=America/Los_Angeles:20161114T160000
DTSTAMP:20231011T190617Z
CREATED:20231011T190617Z
LAST-MODIFIED:20231011T190617Z
UID:14475-1479135600-1479139200@www.cecs.uci.edu
SUMMARY:Resource Aggregation for Collaborative Projected Video from Multiple Mobile Devices
DESCRIPTION:Name: Hung Nguyen\nDate: November 17\, 2016 \nTime: 1:30 P.M. \nLocation: EH 3206 \nCommittee: Fadi Kurdahi (Chair)\, Aditi Majumder (Co-Chair) \nAbstract:  \nWe explore and develop an embedded real time system and associated algorithms that enable an aggregation of limited resource\, low-quality\, projection-enabled mobile devices to collaboratively produce a higher quality video stream for a superior viewing experience. Such a resource aggregation across multiple projector enabled devices can lead to a per unit resource savings while moving the cost to the aggregate. \nThe pico-projectors that are embedded in mobile devices such as cell phones have a much lower resolution and brightness than standard projectors. Tiling (putting the projection area of multiple projectors in a rectangular array overlapping them slightly around the boundary) and superimposing (putting the projection area of multiple projectors right on top of each other) multiples of such projectors\, registered via automated registration through the cameras residing within those mobile devices\, result in different ways of aggregating resources across these multiple devices. Evaluation of our proof-of-concept system shows significant improvement for each mobile device in two primary factors of bandwidth usage and power consumption when using a collaborative federation of projection-embedded mobile devices. \nThe portable\, low-power\, light weight\, small size pico-projectors are key components of projection-enabled mobile devices for the future. Due to the reduction of weight and dimension and the portability nature of the projector-enabled mobile devices\, the calibrated integrated systems are prone to physical un-stabilizing of the projected image during the presentation. Thus the auto re-calibration and projected video stabilization features during the presentation time becomes essential requirements to enhance user experience. The design\, algorithm\, and implementation methods for these features will be presented in the second part of the dissertation.
URL:https://www.cecs.uci.edu/event/resource-aggregation-for-collaborative-projected-video-from-multiple-mobile-devices/
CATEGORIES:PhD Defenses
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20161004T150000
DTEND;TZID=America/Los_Angeles:20161004T160000
DTSTAMP:20231011T190615Z
CREATED:20231011T190615Z
LAST-MODIFIED:20231011T190615Z
UID:14469-1475593200-1475596800@www.cecs.uci.edu
SUMMARY:Specification and Runtime Verification of Distributed Multiprocessor Systems: Languages\, Tools and Architectures
DESCRIPTION:Name: Ahmed Nassar\nDate: September 2\, 2016 \nTime: 12:00 P.M. \nLocation: EH 3403 \nCommittee: Fadi Kurdahi (Chair)\, Rainer Doemer\, Ahmed Eltawil \nAbstract: Post-Deployment runtime verification (RV) has recently emerged as a complementary technology to extend coverage of conventional software verification and testing methods. This thesis is an attempt to tackle three major barriers that need to be surmounted before RV technologies become in widespread use:\nBarrier-1: Lack of an expressive\, yet efficiently monitorable\, specification language. Distributed software behavior is projected onto an observation interface consisting of data-carrying (or parameterized) events\, such as Linux system calls including argument values\, and self-replicating deterministic finite automata (SR-DFAs) are introduced for RV purposes as well as anomaly-based intrusion detection in embedded and general-purpose software systems based on these parametric traces.\nBarrier-2: The substantial performance and power overhead of pure software RV frameworks. NUVA\, which stands for nonuniform verification architecture\, a distributed automata-based RV architecture for software specifications in the form of SR-DFAs. NUVA has been implemented over a cache-coherent nonuniform-memory-access (ccNUMA) multiprocessor and can be deployed on the FPGA fabric that will reside on all next-generation processor chips. The core of NUVA is a coherent distributed automata transactional memory (ATM) that efficiently maintains states of a dynamic population of automata checkers organized into a rooted dynamic directed acyclic graph (DAG) concurrently shared among all processor nodes.\nBarrier-3: Formal specifications are hard to formulate and maintain for evolving complex embedded and general-purpose software systems. Therefore\, specification mining has long ago been envisioned to play a key role in software verification\, modification and documentation. However\, in order to scale beyond simple\, library/API-level properties having short temporal spans\, specification mining tools need to support more expressive specification languages that can capture complex\, application-level properties. This thesis introduces a bio-inspired complete specification mining methodology for SR-DFAs using an iterative and interactive mining tool\, called ParaMiner. ParaMiner relies on novel mining algorithms invoking multiple-sequence alignment (MSA) techniques to enable learning specifications from temporal slices of software behavior while overcoming the initial-state uncertainty problem.\nSR-DFAs and ParaMiner have been leveraged in a new specification-based intrusion detection (ID) framework that protects distributed\, reactive computing systems against cyberattacks having very sparse signatures\, arbitrarily long time spans and wide attack fronts. Such attacks lie outside the scope of conventional anomaly-based ID methods which typically work with short event windows and ignore manipulated data objects\, such as files and sockets. We demonstrate the effectiveness of the constructed SR-DFAs at classifying as well as resolving subtle behaviors typical of cyberattacks with varying evasion parameter values.
URL:https://www.cecs.uci.edu/event/specification-and-runtime-verification-of-distributed-multiprocessor-systems-languages-tools-and-architectures/
CATEGORIES:PhD Defenses
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20160818T150000
DTEND;TZID=America/Los_Angeles:20160818T160000
DTSTAMP:20231011T190555Z
CREATED:20231011T190553Z
LAST-MODIFIED:20231011T190555Z
UID:14449-1471532400-1471536000@www.cecs.uci.edu
SUMMARY:PhD Defense:
DESCRIPTION:Name:  Aras Pirbadian\nDate: August 29\, 2016 \nTime: 3:30pm \nLocation:  EH 3403 \nCommittee: Ahmed Eltawil (Chair)\, Fadi Kurdahi\, Rainer Doemer \nWith the continued scaling of chip manufacturing technologies\, the significance of process variation in performance of the systems is increasing. Specifically\, process variation results in growing voltage and frequency overhead margins required to ensure error free operation of circuits. However\, the traditional practice of overdesigning the systems to cover process variation is no longer an efficient design methodology in an age with high demands for processing power and limited energy supplies. In this dissertation\, a novel analytical model is proposed to predict the required margin accurately in the early stages of design space exploration. The model can be used to optimize the system overhead in error free calculations or to release the bound by full correctness in error tolerant parts of systems and optimize the energy vs. performance trade-off. Additionally\, this model also considers the statistics of the inputs of the circuit as compared to other existing efforts enabling it to achieve close predictions of full circuit simulation results in a short time. This model is finally used in an adaptive carry select/ripple carry adder configuration to demonstrate the potential achievable power savings. \nGrowing variation in newer technology nodes is not always a negative side effect. The increased inherent randomness in the process manufacturing technology can be utilized to develop unique physically unclonable functions (PUFs). These functions are irreproducible hardware-based authenticating systems\, which do not require memory-based storage. A low overhead delay-based PUF using the variation of the silicon manufacturing is also proposed in the second part of this work. The proposed PUF uses a simple and efficient structure to convert the randomness of the manufacturing process into random responses to fixed challenges in identically designed circuits.
URL:https://www.cecs.uci.edu/event/phd-defense/
CATEGORIES:PhD Defenses
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20160804T150000
DTEND;TZID=America/Los_Angeles:20160804T160000
DTSTAMP:20231011T190537Z
CREATED:20231011T190537Z
LAST-MODIFIED:20231011T190537Z
UID:14448-1470322800-1470326400@www.cecs.uci.edu
SUMMARY:Progression and Edge Intelligence Framework for IoT Systems
DESCRIPTION:Name:  Zhenqiu Huang\nDate: July 29\, 2016 \nTime: 10:00am \nLocation:  EH 4106 \nCommittee: Kwei-Jay Lin (Chair)\, Fadi Kurdahi\, Mohammad Al Faruque \nAbstract: This thesis studies the issues on building and managing future Internet of Things (IoT)\nsystems. IoT systems consist of distributed components with services for sensing\, processing\,\nand controlling through devices deployed in our living environment as part of the global\ncyber-physical ecosystem. \nSystems with perpetually running IoT devices may use a lot of energy. One challenge is to\nimplement good management policies for energy saving. In addition\, a large scale of devices\nmay be deployed in wide geographical areas through low bandwidth wireless communication\nnetworks. This brings the challenge of con
URL:https://www.cecs.uci.edu/event/progression-and-edge-intelligence-framework-for-iot-systems/
CATEGORIES:PhD Defenses
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20160404T150000
DTEND;TZID=America/Los_Angeles:20160404T160000
DTSTAMP:20231011T190536Z
CREATED:20231011T190536Z
LAST-MODIFIED:20231011T190536Z
UID:14445-1459782000-1459785600@www.cecs.uci.edu
SUMMARY:Power Optimization for Medical Sensing Systems
DESCRIPTION:Name:  Jun Luan\nLocation:  EH 4106 \nDate: February 24\, 2016 \nTime: 1:00pm \nCommittee: Pai Chou (Chair)\, Mohammad Al Faruque\, Fadi Kurdahi \nAbstract:  \nMedical sensing systems collect and analyze the patients’ physiological data for monitoring\, aid or diagnostic purposes. System designers are faced with stringent requirements on not only correctness and safety but also power. Reference designs and multi-purpose platforms help to significantly shorten the development cycle. \nThis work takes a cross-layer\, system-level\, platform-based approach to addressing the problem of saving power in a class of portable medical system. We propose a low-power medical sensing system that can be used to monitor Electrocardiography (ECG)\, Photo- plethysmogram (PPG)\, and muscle tension. It also includes a hand gesture recognition system to aid mobility-impaired patients. \nWe explore the theory and application of a compressive sensing framework to medical signal processing. A novel compressive sensing-based ECG compression algorithm and a dominant frequency extraction-based PPG heart-rate calculation algorithm are proposed to reduce the system power. The unique combination of hardware structure and software signal-processing algorithms makes low-power design possible. The system test results show that the proposed system is superior to existing works in terms of power consumption and system size.
URL:https://www.cecs.uci.edu/event/power-optimization-for-medical-sensing-systems/
CATEGORIES:PhD Defenses
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20160404T150000
DTEND;TZID=America/Los_Angeles:20160404T160000
DTSTAMP:20231011T190536Z
CREATED:20231011T190536Z
LAST-MODIFIED:20231011T190536Z
UID:14446-1459782000-1459785600@www.cecs.uci.edu
SUMMARY:Frameworks and Algorithms for Wearable Medical Applications
DESCRIPTION:Name:  SeungJae Lee\nDate:  April\, 5\, 2016 \nTime:  3:00p.m. \nLocation:  EH 4106 \nCommittee:  Pai H. Chou (Chair)\, Fadi Kurdahi\, Tony Givargis \nAbstract: \nWearable embedded systems with sensing\, communication\, and computing capabilities have given rise to innovations in e-health and telemedicine in general. The scope of such systems ranges from devices and mobile apps to cloud backend and analysis algorithms\, all of which must be well integrated. To manage the development\, operation\, and evolution of such complex systems\, a framework systematic framework is needed. This dissertation makes contributions in two parts. First is a framework for defining the structure of a wide range of wearable medical applications with modern cloud support. The second part includes several algorithms that can be plugged into this framework for making these systems more efficient in terms of processing performance and data size. We propose a novel QT analysis algorithm that can take advantage of GPU as well as in a server-client environment\, and we show competitive results in terms of both performance and energy consumption with or without parallelization. We also propose ECG compression techniques using trained overcomplete dictionary. After constructing the dictionary through learning process with a given dataset\, the signal can be compressed by sparse estimation using the trained dictionary. We propose reconstructing ECG signal from undersampled data based on compressive sensing framework that can reconstruct the ECG signals precisely from fewer samples so long as the signal is sparse or compressible. Together\, these algorithms operating in the context of our proposed framework validate the effectiveness of our structured approach to the framework for wearable medical application. \n 
URL:https://www.cecs.uci.edu/event/frameworks-and-algorithms-for-wearable-medical-applications/
CATEGORIES:PhD Defenses
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20150729T150000
DTEND;TZID=America/Los_Angeles:20150729T160000
DTSTAMP:20231011T190536Z
CREATED:20231011T190536Z
LAST-MODIFIED:20231011T190536Z
UID:14444-1438182000-1438185600@www.cecs.uci.edu
SUMMARY:A Centralized IoT Middleware System for Devices Working Across Application Domains Using Self-descriptive Capability Profile
DESCRIPTION:Name: Chengjia Huo\nLocation: EH 4404 \nDate: September 30\, 2015 \nTime: 1pm \nCommittee: Pai H. Chou (chair)\, Phillip Sheu\, Rainer Doemer \nAbstract: \nThe Internet of Things (IoT) has been receiving growing attention in recent years as the next wave of computing revolution made possible by all types of networks of things (NoTs)\, where devices powered with low-cost\, miniature low-power systems-on-chip (SoC) with computing and communication capabilities\, and are bridged to the Internet with the assistance of gateways. More and more NoT device are designed to provide more than one functionalities to fulfill different requirements from the application domains. We believe that the true power of IoT is that functionalities of devices can work across application domains. In order to reveal the potential of IoT\, the description of a device’s capability needs to represent the functionalities that the device can provide. We discover the previous solutions on describing a device’s capability focus mainly on hiding the vendor-specific interfaces made by different manufacturers\, but they do not reflect different functionalities that a device provides. In this thesis\, the concept of device capability profile is proposed. Different from the previous solutions\, the device capability profile specified in the firmware of a device allows the device to work across different application domains. Together with device capability profile\, a centralized IoT middleware framework\, called rimware\, is proposed. Rimware tracks every device’s capability and state in a centralized manner and provides different ways for application domains to query against the device’s functionalities. In addition\, rimware utilizes the device capability profile to carry out the enforcement of the security and privacy throughout the communication with the devices. Moreover\, tasks can be scheduled through the rimware which enables functionalities from multiple devices to work together to fulfill the requirements from application domains. Optimization is applied on cases that one device working for multiple task simultaneously. An implementation of rimware that is specifically designed for BLE devices\, called BlueRim\, which takes advantages of BLE’s very long battery life on the device side and the cloud functionality on the centralized side is provided. The fundamental features of rimware have been validated in several real-world applications from different different domains while incurring minimal code size and communication overhead on BLE devices. We believe that our approach represents an important technology in taking IoT closer to realizing the full potentials.
URL:https://www.cecs.uci.edu/event/a-centralized-iot-middleware-system-for-devices-working-across-application-domains-using-self-descriptive-capability-profile/
CATEGORIES:PhD Defenses
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20150521T150000
DTEND;TZID=America/Los_Angeles:20150521T160000
DTSTAMP:20231011T190519Z
CREATED:20231011T190518Z
LAST-MODIFIED:20231011T190519Z
UID:14434-1432220400-1432224000@www.cecs.uci.edu
SUMMARY:CARL-SJR: A Socially Assistive Neurorobot for Autism Therapy and Research
DESCRIPTION:Name: Ting-Shuo Chou\nDate: May 21\, 2015 \nTime: 3:00pm – 5:00pm \nLocation: Social & Behavioral Sciences Gateway 2200 Conference Room \nCommittee Chair: Jeffrey Krichmar (Chair)\, Nikil Dutt\, Alexandru Nicolau \nAbstract: \nNeurodevelopmental disorders\, such as Attention-Deficit–Hyperactivity\nDisorder (ADHD) and Autism Spectrum Disorder (ASD)\, have core clinical\nsymptoms of inattention\, hyperactivity\, and impulsivity (often hyper-\nand hypo- responsiveness. These symptoms are often accompanied by\nreduced motor coordination and impaired sensory processing. We introduce\na Socially Assistive Robot (SAR) with the goal of automating therapy for\nchildren with neurodevelopmental disorders. The novel robot\, which is\ncalled Cognitive Anteater Robotics Laboratory – Spiking Judgment Robot\n(CARL-SJR)\, is designed for therapy and diagnosis. CARL-SJR is\nautonomous and capable of tactile sensing and interaction. A spiking\nneural network model and neurally inspired algorithms controls\nCARL-SJR’s behavior. By providing a large tactile sensing surface that\nencourages touching with hand movements\, CARL-SJR especially addresses\nimpairments in tactile sensitivity and social interaction observed in\nchildren with neurodevelopmental disorders. Using CARL-SJR\, we conducted\na pilot study where children with different neurodevelopment disorders\nshow different behavioral metrics and tactile movements. The results\nsuggest CARL-SJR might serve as a diagnose tool for developmental\ndisorders. Second\, we showed that the information carried by temporal\ncoding is higher than the traditional rate coding when decoding spike\ntrains in response to tactile movements. Third\, we implemented online\nlearning capabilities on CARL-SJR\, where the robot could associate a\nuser’s preferred color pattern displayed on the robot with the user’s\nhand sweep across the robot’s body. The emerged behaviors and neural\nactivities in the SNN are consistent with biological recordings. The\nunderlying neural mechanism in the SNN also serves as an alternative\nexplanation of how brains encode timing and associate (or learning) two\ntemporal separated events.
URL:https://www.cecs.uci.edu/event/carl-sjr-a-socially-assistive-neurorobot-for-autism-therapy-and-research/
CATEGORIES:PhD Defenses
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20150521T150000
DTEND;TZID=America/Los_Angeles:20150521T160000
DTSTAMP:20231011T190511Z
CREATED:20231011T190511Z
LAST-MODIFIED:20231011T190511Z
UID:14433-1432220400-1432224000@www.cecs.uci.edu
SUMMARY:Ensuring Reliability and Fault-Tolerance for the Cyber-Physical System Design
DESCRIPTION:Name: Volkan Gunes\nDate: May 27\, 2015 \nTime: 11:00AM – 12:00PM \nLocation: Donald Bren Hall 3013 Conference Room \nCommittee: Tony Givargis (Chair)\, Alexandru Nicolau\, Ian Harris\, Steffen Peter \nAbstract: \nThe cyber-physical system (CPS) is a term describing a broad range of\ncomplex\, multi-disciplinary\, physically-aware next generation engineered\nsystems that integrate embedded computing technologies (cyber part) into\nthe physical world. Sensors play an important role in this integration\nbecause they provide the data extracted from the physical world for the\ncyber systems to fulfill the decision making process. However\, this\nprocess is likely to be misled by incorrect data due to sensor fault\noccurrences. \nIn this dissertation\, the main focus is on sensor fault mitigation and\nachieving high reliability in CPS operations. One of the challenges we\nponder is timely event (e.g.\, motion as a phenomenon) detection in CPS\nunder possible faulty sensor conditions. In this regard\, our\ndemonstrative example of CPS is the falling ball example (FBE) using\nbinary event detectors (i.e.\, motion sensors)\, a controller\, and a\ncamera for timely motion detection of a falling ball. Another challenge\nwe ponder is satisfying thermal comfort and energy efficiency under\ncertain faulty sensor conditions in a multi-room building incorporating\ntemperature sensors\, controllers\, and heating\, ventilation\, and air\nconditioning (HVAC) systems as a CPS application. For both cases\, we\nadopt a model-based design (MBD) methodology to analyze the effect of\nsensor faults on the desired system outcome. We specify well-defined\nfault semantics for the event detectors and temperature sensors to make\nthe problem definition more clear. We provide a MATLAB/Simulink\nsimulation framework for our CPS examples. Besides having the\ntraditional CPS model that comprises the cyber\, interface (e.g. sensors\nand actuators) and physical models\, we develop fault models and a system\nevaluation model in Simulink and incorporate them into the CPS model. \nWe explore various techniques for fault mitigation in a holistic design\nperspective. Therefore\, the approaches presented in this study\ncontributes to the design of fault-tolerant CPSs. Furthermore\,\nconsidering compute demands of large scale CPSs\, we introduce the XGRID\nembedded many-core system-on-chip architecture. XGRID makes use of a\nnovel\, FPGA-like\, programmable interconnect infrastructure\, offering\nscalability and deterministic communication using hardware supported\nmessage passing among cores. We provide a conceptual mapping of control\nalgorithms for the automation of a multi-room building onto target XGRID\narchitecture. \nOur findings regarding reliable CPS design show that the physical system\nattributes (e.g.\, sensor placement and environmental effects) can be a\nmore dominant factor than the cyber system attributes on the system\noutcome. In addition\, sensor faults may lead to unsatisfactory system\noutcome in CPSs since CPSs heavily rely on sensor readings for decision\nmaking. Therefore\, the analysis of temporal and spatial correlations\nbetween sensor readings helps mitigate certain types of sensor faults\nand enable CPSs to utilize sensors’ data more efficiently for decision\nmaking.
URL:https://www.cecs.uci.edu/event/ensuring-reliability-and-fault-tolerance-for-the-cyber-physical-system-design/
CATEGORIES:PhD Defenses
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20150515T150000
DTEND;TZID=America/Los_Angeles:20150515T160000
DTSTAMP:20231011T190511Z
CREATED:20231011T190511Z
LAST-MODIFIED:20231011T190511Z
UID:14432-1431702000-1431705600@www.cecs.uci.edu
SUMMARY:Temperature-Aware Design for SoCs using Thermal Gradient Analysis
DESCRIPTION:Name: Jun Yong Shin\nDate: May 18th\, 2015 \nTime: 2:00PM \nLocation: EH2430\, Harut colloquia room \nCommittee Chair: Nikil Dutt \nAbstract: \nOver the last few decades\, chip performance has increased steadily due to continuous and aggressive technology scaling. However\, it leaves chips quite vulnerable to several issues at the same time; high power densities in some particular areas spread across a chip might result in hotspots and thermal gradients\, and these can lead to permanent damage to the chip and also can reduce the reliability of the entire system using the chip. As a result\, a large number of dynamic thermal management solutions have been proposed in recent years for use in multi-core architectures\, and the accurate temperature information over the entire chip area has become indispensable especially for fine-grain dynamic thermal management solutions. Naturally\, on-chip thermal sensors came to play an important role in providing the accurate information on the temperature distribution of a chip\, but there still remain some issues regarding the allocation of on-chip thermal sensors; due to power\, area and routing issues\, it is preferable to limit the number of on-chip thermal sensors on a die\, and their placement needs to be considered carefully in order to increase the accuracy of full-chip thermal profile reconstruction especially when just a small number of sensors can be implemented; due to the limited reading accuracy of low-power\, small-sized on-chip thermal sensors\, it would be better to have some way to improve their reading accuracy. \nIn this work\, an issue will be firstly addressed regarding how to improve the reading accuracy of a low-power\, small-sized on-chip thermal sensor such as Ring-Oscillator (RO) based sensors at runtime on a software level. Secondly\, a question of how to allocate a proper number of sensors on a die in order to get the accurate full-chip scale thermal information on the run is addressed. Additionally\, a temperature-aware routing for global interconnects to minimize the delay and also to reduce the probability of chip failure due to electromigration is presented at the end.
URL:https://www.cecs.uci.edu/event/temperature-aware-design-for-socs-using-thermal-gradient-analysis/
CATEGORIES:PhD Defenses
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20150507T150000
DTEND;TZID=America/Los_Angeles:20150507T160000
DTSTAMP:20231011T190510Z
CREATED:20231011T190510Z
LAST-MODIFIED:20231011T190510Z
UID:14430-1431010800-1431014400@www.cecs.uci.edu
SUMMARY:Resilient On-Chip Memory Design in the Nano Era
DESCRIPTION:Final Defense – Abbas Banaiyanmofrad\n\nMay 20\, 2015\n3pm – 5pm\nDonald Bren Hall 3011 Conference Room \nCommittee:\nNikil Dutt (Chair)\, Alex Nicolau\, Alex Veidenbaum \nTitle:\nResilient On-Chip Memory Design in the Nano Era \nAbstract:\nAggressive technology scaling in the nano-scale regime makes chips more susceptible to failures. This causes multiple reliability challenges in the design of modern chips\, including manufacturing defects\, wear-out\, and parametric variations. By increasing the number\, amount\, and hierarchy of on-chip memory blocks in emerging computing systems\, the reliability of the memory sub-system becomes an increasingly challenging design issue. Existing resilient memory design schemes are unable to effectively address the key features of scalability\, interconnect-awareness\, and cost-effectiveness for these platforms. In this thesis\, we propose different approaches to address resilient on-chip memory design in computing systems ranging from traditional single-core processors to emerging many-core platforms. We classify our proposed approaches in five main categories: 1) Flexible and low-cost approaches to protect cache memories in single-core processors against permanent faults and transient errors\, 2) Scalable fault-tolerant approaches to protect last-level caches with non-uniform cache access in chip multiprocessors\, 3) Interconnect-aware cache protection schemes in network-on-chip architectures\, 4) Application-aware memory resiliency for approximate computing era\, and 5) System-level design space exploration\, analysis\, and optimization for redundancy-aware on-chip memory resiliency in many-core platforms. ​  \n In summary\, the premise of this thesis is to provide multiple solutions in different layers of system hierarchy targeting a verity of architectures from embedded single-core microprocessors to emerging large many-core platforms to address cost-efficient error-resiliency of on-chip memory components. \n 
URL:https://www.cecs.uci.edu/event/resilient-on-chip-memory-design-in-the-nano-era/
CATEGORIES:PhD Defenses
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20150416T150000
DTEND;TZID=America/Los_Angeles:20150416T160000
DTSTAMP:20231011T190322Z
CREATED:20231011T190322Z
LAST-MODIFIED:20231011T190322Z
UID:14397-1429196400-1429200000@www.cecs.uci.edu
SUMMARY:Self-stabilizing Java: Tool Support for Building Robust Software
DESCRIPTION:Name: Yong hun EomDate: April 15\, 2015\nTime: 10:00am\nLocation: EH 2430\nCommittee Chair: Professor Demsky\nCommittee members: Prof. Pai Chou and Prof. Rainer Doemer \nTitle: Self-stabilizing Java: Tool Support for Building Robust Software \nAbstract:\nDeveloping robust software systems remains an open research problem. The\ncurrent approaches for improving software reliability mainly focus on\nminimizing the number of software bugs through formal verification or\nextensive testing. Despite such efforts\, it is common that unexpected\nsoftware bugs corrupt a program’s state and cause systems to fail. \nThe motivation for this research is to embrace the fact that it is\ndifficult to guarantee that software is error-free. We present\nSelf-stabilizing Java (SJava) that instead checks that a program\nself-stabilizes. Self-stabilizing programs automatically recover to the\ncorrect state from the corrupted state caused by software bugs and other\nsources. A number of applications are inherently self-stabilizing—such\nprograms typically overwrite all non-constant data with new input data. \nWe have developed a type system and static analyses that together check\nwhether program executions eventually transition from incorrect states\nto the correct state. We combine this with a code-generation strategy\nthat ensures that a program continues executing long enough to\nself-stabilize. Furthermore\, in order to lower the burden of type\nannotations\, we present an annotation inference algorithm that\nautomatically derives an initial set of annotations. \nOur experience using SJava indicates that our system successfully\nchecked that several benchmarks were self-stabilizing and effectively\ninferred annotations for our benchmarks.
URL:https://www.cecs.uci.edu/event/self-stabilizing-java-tool-support-for-building-robust-software/
CATEGORIES:PhD Defenses
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20150202T150000
DTEND;TZID=America/Los_Angeles:20150202T160000
DTSTAMP:20231011T190459Z
CREATED:20231011T190456Z
LAST-MODIFIED:20231011T190459Z
UID:14421-1422889200-1422892800@www.cecs.uci.edu
SUMMARY:Formal Analysis of Electronic System Level Models using Satisfiability Modulo Theories and Automata Checking
DESCRIPTION:Name:  Che-Wei Chang\nDate/Time:  Wednesday\, January 28\,2015\, 9:00am \nLocation:  EH 3404 \nCommittee Chair: Rainer Doemer \nCommittee Member: Daniel Gajski \nCommittee Member: Pai Chou \nAbstract:  \nFor a system-level design which may be composed of multiple processing elements running\n        in parallel\, various kinds of unwanted consequences may happen if the system\n        is constructed carelessly. For example\, deadlock may happen if improper execution\n        order and communication between processing elements is used in the system. Another\n        problem which may be caused by the concurrent execution is race condition\, as\n        shared variables in the system-level model could be accessed by multiple concurrent\n        threads in parallel. Those unwanted behaviors definitely have negative influence on\n        the functionality of the system. Furthermore\, the functionality is not the only concern\n        in system design as timing constraints are critical as well. If the system cannot\n        finish the job within timing constraints\, it is still considered an unwanted design. To\n        address this issue\, we propose two formal analysis approaches in this dissertation to\n        analyze three types of properties we discussed above\, which are\n        1). liveness\,\n        2). satisfiability of timing constraint\, and\n        3). May-Happen-in-Parallel access.\n        These two approaches are based on Satisfiability Modulo Theories (SMT) and UPPAAL\n        automaton model respectively. We run these two approaches on our in-house\n        system models\, including a JPEG encoder\, MP3 decoder\, AMBA AHB and CAN\n        bus protocol models. The experimental results show our approaches are capable of\n        analyzing those properties meeting our expectation within reasonable analysis time.
URL:https://www.cecs.uci.edu/event/formal-analysis-of-electronic-system-level-models-using-satisfiability-modulo-theories-and-automata-checking/
CATEGORIES:PhD Defenses
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20140923T150000
DTEND;TZID=America/Los_Angeles:20140923T160000
DTSTAMP:20231011T190438Z
CREATED:20231011T190438Z
LAST-MODIFIED:20231011T190438Z
UID:14418-1411484400-1411488000@www.cecs.uci.edu
SUMMARY:Design\, Analysis and Implementation of An Area-Efficient Beam-Steerable Sub-Terahertz Imaging Receiver Array Architecture
DESCRIPTION:Title:� Design\, Analysis and Implementation of An Area-Efficient Beam-Steerable Sub-Terahertz Imaging Receiver Array Architecture\nSpeaker:� Francis Caster II \nLocation/Time:� September 23\, 2014\, 3PM\nCommittee Members:\nPayam Heydari\nFilippo Capolino\nH. Kumar Wickramasinghe\nAbstract: Multi-pixel passive imaging arrays are presently fabricated in expensive processes with low integration levels. Imaging arrays designed in inexpensive processes with higher levels of integration would result in cheaper larger arrays. The objective of this work is twofold: 1) to develop a highly integrated silicon-based passive imaging receiver integrating the entire receiver frontend from antenna to detector; and 2) to develop a highly scalable architecture for use in focal plane arrays of arbitrary dimensions\, incorporating new features to address large-array issues while retaining the pixel density of conventional focal plane arrays. A new area-efficient beam-steerable imaging array receiver architecture suitable to integrated circuit realization up to sub-THz frequencies is presented. A direct-detection-based receiver array utilizing the proposed architecture is designed and implemented in an advanced 0.18�m BiCMOS process. The receiver chip achieves a peak measured coherent responsivity of 1\,150MV/W\, a measured incoherent responsivity of 1\,000MV/W\, a minimum NEP of 0.28fW/sqrtHz and a front-end 3-dB bandwidth from 87-108GHz\, while consuming 225mW per receiver element. The measured NETD of the SiGe receiver chip is 0.45K with a 20ms integration time. The proposed architecture uses a new concept of spatial-overlapping super-pixels which results in (1) improved SNR at the pixel level through a reduction of spillover losses\, (2) partially correlated adjacent super-pixels\, (3) a 2�2 window averaging function in the RF domain\, (4) the ability to compensate for the systematic time delay and amplitude variations due to the off-focal-point effect for antennas away from the focal point\, and (5) the ability to compensate for mutual coupling effects among the array elements.
URL:https://www.cecs.uci.edu/event/design-analysis-and-implementation-of-an-area-efficient-beam-steerable-sub-terahertz-imaging-receiver-array-architecture/
CATEGORIES:PhD Defenses
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20140910T150000
DTEND;TZID=America/Los_Angeles:20140910T160000
DTSTAMP:20231011T190438Z
CREATED:20231011T190438Z
LAST-MODIFIED:20231011T190438Z
UID:14416-1410361200-1410364800@www.cecs.uci.edu
SUMMARY:Computation Model Based Automatic Design Space Exploration for Heterogeneous Multiprocessor Platforms
DESCRIPTION:Title:  Computation Model Based Automatic Design Space Exploration for Heterogeneous Multiprocessor  Platforms \nSpeaker:  Kyoungwon Kim \nDate/Time:  August 28\, 2014\, 2:oopm \nLocation:  Engineering Hall 3206 \nCommittee Members:Daniel Gajski (Chair)Tony Givargis Rainer Doemer \nAbstract:  Embedded system designers continuously face a twofold challenge handling the ever-increasing complexity of design and meeting the ever-shrinking time-to-market timeline. To meet such a challenge\, the system design paradigm has shifted to platform-based design characterized by intensive use of software and aggressive reuse of verified components. More and more designs are turning to heterogeneous platforms to meet design constraints in multiple criteria. However the use of such and heterogeneity generates more challenges for platform-based design. To address the challenges\, system designers must utilize system-level methodologies for specification and design. Here the designers begin the design process by coming up with a computation model that captures the behavior of the system. The computation model is successively refined down to the structural model in the system level. In each refinement\, the designers explore the design space. The design space comprises a set of alternatives concerning hardware/software partitioning\, platform selection\, and mapping. The design space is huge\, however\, necessitating the automation of its exploration. The platform is very often fixed regarding either availability or legacy reasons\, making mapping crucial. This dissertation focuses on the automatic mapping of the computation model for the given heterogeneous platform. This dissertation presents a new automatic mapping technique based on the input computation model. The proposed technique consists of two separate phases: initial mapping and improvement driven by cycle-approximate estimation. Existing mapping techniques depend on early estimation so a dilemma arises from the fact that cycle-approximate estimation cannot precede mapping. The dilemma can be gotten around by our performing initial mapping based on rough estimation and then making iterative improvements based on cycle-approximate estimation. While earlier work has been domain specific\, the mapping techniques in the proposed work are driven by a general computation model that includes hierarchy\, state transitions\, dynamic data-oriented behaviour\, and imperative languages\, while previous work is domain specific.The proposed work also addresses mapping with an awareness of general hierarchy in pipelined applications. The size of the design space explored is limited by the speed of cycle-approximate estimation. Orders of magnitude faster than Simulation-based cycle-approximate estimation\, the new trace-driven estimation presented in this disseration is cycle-approximate and applicable to both software and hardware. The new trace-driven estimation assumes that the execution path of each task depends on data only. As the trace-driven estimation handles a portion of applications\, it complements the existing simulation-based cycle-approximate estimation. We have applied the proposed mapping techniques to multiple multimedia applications and the techniques outperformed in terms of execution time the competitors by proportions ranging from 23.3% through 36.3%.
URL:https://www.cecs.uci.edu/event/computation-model-based-automatic-design-space-exploration-for-heterogeneous-multiprocessor-platforms/
CATEGORIES:PhD Defenses
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20140910T150000
DTEND;TZID=America/Los_Angeles:20140910T160000
DTSTAMP:20231011T190438Z
CREATED:20231011T190438Z
LAST-MODIFIED:20231011T190438Z
UID:14417-1410361200-1410364800@www.cecs.uci.edu
SUMMARY:Self-interference Cancellation in Full-duplex Wireless Systems
DESCRIPTION:Title:  Self-Interference Cancellation in Full-duplex Wireless Systems \nSpeaker:  Elsayed Ahmed \nDate/Time:  August 28\, 2014\, 10:00AM \nLocation:  Engineering Hall 4106 \nCommittee Members:Ahmed Eltawil (Chair)Ender AyanogluA. Lee Wsindlehurst \nAbstract: Due to the tremendous increase in wireless data traffic\, one of the major challenges for future wireless systems is the utilization of the available spectrum to achieve better data rates over limited spectrum. Currently\, systems operate in what is termed “Half Duplex Mode\,” where they are either transmitting or receiving\, but never both using the same temporal and spectral resources. Full-duplex transmission promises to double the spectral efficiency where bidirectional communications is carried out over the same temporal and spectral resources. The main limitation impacting full-duplex transmission is managing the strong self-interference signal imposed by the transmit antenna on the receive antenna within the same transceiver. Several recent publications have demonstrated that the key challenge in practical full-duplex systems is un-cancelled self-interference power caused by a combination of hardware imperfections\, especially Radio Frequency (RF) circuits’ impairments. In this thesis\, we consider the problem of self-interference cancellation in full-duplex systems. The ultimate goal of this work is to design and build a complete\, real-time\, full-duplex system that is capable of achieving wireless full-duplex transmission using practical hardware platforms. Since RF circuits’ impairments are shown to have significant impact on the self-interference cancellation performance\, first\, we present a thorough analysis of the effect of RF impairments on the cancellation performance\, with the aim of identifying the main performance limiting factors and bottlenecks. Second\, the thesis proposes several impairments mitigation techniques to improve the overall self-interference cancellation capability by mitigating most of the transceiver RF impairments. In addition to impairments mitigation\, two novel full-duplex transceiver architectures that achieve significant self-interference cancellation performance are proposed. The performance of the proposed techniques is analytically and experimentally investigated in practical wireless environments. Finally\, the proposed self-interference cancellation techniques are used to build a complete full-duplex system with a 90% experimentally proven full-duplex rate improvement compared to half-duplex systems.
URL:https://www.cecs.uci.edu/event/self-interference-cancellation-in-full-duplex-wireless-systems/
CATEGORIES:PhD Defenses
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20140723T150000
DTEND;TZID=America/Los_Angeles:20140723T160000
DTSTAMP:20231011T190437Z
CREATED:20231011T190437Z
LAST-MODIFIED:20231011T190437Z
UID:14414-1406127600-1406131200@www.cecs.uci.edu
SUMMARY:New Circuit Techniques Enabling Millimeter-Wave and Terahertz Transceivers in Nonoscale Silicon
DESCRIPTION:Title:  New Circuit Techniques Enabling Millimeter-Wave and Terahertz Transceivers in Nonoscale Silicon \nSpeaker:  Zheng Wang \nDate/Time:  Monday\, June 2\, 2014\, 2:00PM \nLocation:  Engineering Hall 2111 \nCommittee Members:Payam Heydari (Chair)Michael GreenEnder Ayaloglu \nAbstract: The vastly under-utilized spectrum in the sub-THz frequency range enables disruptive applications including 10Gb/s chip-to-chip wireless communications and imaging/spectroscopy. Owing to aggressive scaling in feature size and device _fT_/_fmax_\, nanoscale CMOS technology potentially enables integration of sophisticated systems at this frequency range. This dissertation mainly focuses on the design of a 210GHz fundamental transceiver and also covers the design of a W-band fully integrated imaging system utilizing a novel concept of spatial-overlapping super pixels.Firstly\, a 210GHz transceiver with OOK modulation in a 32nm SOI CMOS process is presented. The transmitter (TX) employs a 2´2 spatial combining array consisting of a double-stacked cross-coupled voltage controlled oscillator (VCO) at 210GHz with an on-off-keying (OOK) modulator\, a power amplifier (PA) driver\, a novel balun-based differential power distribution network\, four PAs and an on-chip 2´2 dipole antenna array. The non-coherent receiver (RX) utilizes a direct detection architecture consisting of an on-chip antenna\, a low noise amplifier (LNA)\, and a power detector. The VCO generates measured -13.5dBm output power; and the PA shows a measured 15dB gain and 4.6dBm Psat. The LNA exhibits a measured in-band gain of 18dB and minimum in-band noise figure (NF) of 11dB. The TX achieves an EIRP of 5.13dBm at 10dB back-off from saturated power. It achieves an estimated EIRP of 15.2dBm when the PAs are fully driven. This is the first demonstration of a fundamental frequency CMOS transceiver at the 200GHz frequency range. \nSecondly\, a W-band direct-detection-based receiver array in an advanced 0.18µm BiCMOS process is presented\, which incorporates a new concept of spatial-overlapping super-pixels for millimeter-wave imaging\napplications. The use of spatial-overlapping super-pixels results in (1) improved SNR at the pixel level through a reduction of spillover losses\, (2) partially correlated adjacent super-pixels\, (3) a 2×2 window\naveraging function in the RF domain\, (4) the ability to compensate for the systematic phase delay and amplitude variations due to the off-focal-point effect for antennas away from the focal point\, and (5)\nthe ability to compensate for mutual coupling effects among the array elements. The receiver chip achieves a measured peak coherent responsivity of 1\,150MV/W\, an incoherent responsivity of 1\,000MV/W\, a\nminimum noise-equivalent power (NEP) of 0.28fW/√Hz and a front-end 3-dB bandwidth from 87-108GHz\, while consuming 225mW per receiver element. The measured noise-equivalent temperature difference (NETD) of the SiGe\nreceiver chip is 0.45K with a 20ms integration time.\n\n 
URL:https://www.cecs.uci.edu/event/new-circuit-techniques-enabling-millimeter-wave-and-terahertz-transceivers-in-nonoscale-silicon/
CATEGORIES:PhD Defenses
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20140723T150000
DTEND;TZID=America/Los_Angeles:20140723T160000
DTSTAMP:20231011T190420Z
CREATED:20231011T190420Z
LAST-MODIFIED:20231011T190420Z
UID:14413-1406127600-1406131200@www.cecs.uci.edu
SUMMARY:Performance-Optimized Terahertz Signal Sources in Silicon
DESCRIPTION:Title:  Performance-Optimized Terahertz Signal Sources in Silicon \nSpeaker:  Pei-Yuan Chiang \nDate/Time:  Monday\, June 2\, 2014\, 10:00AM \nLocation: Engineering Hall 2111 \nCommittee Members:Payam Heydari (Chair)Michael GreenOzdal Boyraz \nAbstract: Terahertz (THz) and sub-millimeter wave band are known to provide unique applications in spectroscopy\, imaging and high-data-rate wireless communication. An imaging system operating in this frequency region exhibits non-invasive and high-resolution characteristics due to the non-ionized and short-wavelength radiation waves\, which makes it attracting for security surveillance. On the other hand\, the THz wireless transceiver operating in the license-free spectrum is capable of achieving tens of gigabits-per-second by utilizing a simple modulation scheme. All the benefits mentioned above make THz a promising research topic. Towards realization of a high-performance THz system\, one of the most challenging steps is to design a frequency synthesizer. \nA voltage-controlled oscillator (VCO) is one of the important building blocks within a synthesizer. Due to the server performance degradation of varactors and transistors at high frequencies\, new ways of designing VCOs need to be investigated. Here\, two different ideas are proposed. First\, an inductive-tuning mechanism with high quality-factor and wide tuning-range is introduced. This tuning technique is based on a variable inductor seen at the emitter terminal of a base-degenerated transistor. By adding a series RL at the base terminal\, the variable inductor\, exhibiting low loss and high tunability\, improves the VCO output power and phase noise while achieving a wide tuning range. The second idea\, double-stacked cross-coupled VCO\, is to design a strong negative resistance cell to compensate for the server loss of the varactor at THz frequencies. By implementing a source-degenerated negative resistor of a conventional cross-coupled pair\, the overall negative resistance is enhanced. It also reduces the parasitic capacitance\, making it an attracting approach for THz applications. \nFinally\, a novel THz frequency synthesizer is proposed. A 300GHz phase-locked-based synthesizer incorporating a triple-push VCO with Colpitts-based active varactor (CAV) and a three-phase injection locked divider is introduced. The CAV is used to tune the oscillation frequency\, enhance output power\, and buffer the VCO’s fundamental signal. The divider’s locking-range is vastly increased attribute to the three-phase injection. This work demonstrates the highest-frequency synthesizer in silicon.
URL:https://www.cecs.uci.edu/event/performance-optimized-terahertz-signal-sources-in-silicon/
CATEGORIES:PhD Defenses
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20140712T150000
DTEND;TZID=America/Los_Angeles:20140712T160000
DTSTAMP:20231011T190438Z
CREATED:20231011T190438Z
LAST-MODIFIED:20231011T190438Z
UID:14415-1405177200-1405180800@www.cecs.uci.edu
SUMMARY:New Perspectives on Designing An Effective Management Policy for Multi-level Cache Hierarchy
DESCRIPTION:Date/Time:  February 25\, 2014\, 3:00PM \nLocation:  DBH 3011 \nCommittee Members:Alexander V. Veidenbaum (Chair)Alexandru NicolauTony GivargisRainer Doemer \nAbstract: Designing an effective cache management policy for a multi-level cache hierarchy has been a hot research topic to bridge the gap between the fast microprocessor and the long memory latency. It is becoming critically important in modern microprocessors due to the emerge of new hardware architectures\, new technologies and new applications. However\, it has been shown that this is not an easy task due to the complexity of the inputs that computer architects must take into account. \nThe bottom-up approach has been used in designing such a policy. Rather than tackling the problem with all the possible inputs\, a management policy is broken down into smaller problems\, each targeting a smaller number of inputs. Sub-policies\, such as replacement\, bypass\, migration and partitioning\, are studied for a specific event or configuration. Solutions have been proposed for these individual policies or their combinations. In either case\, the new policies must be shown to work well with existing baseline policies. \nIn this dissertation\, using the bottom-up approach\, we propose new management policies for a multi-level cache hierarchy. Using new ideas about an effective policy or improving existing methods for new hardware architectures\, we further optimize the current state-of-the-art policies. Specifically\, we propose three new sets of management policies. First\, new migration policies are proposed for an L0/L1 cache hierarchy for embedded processors. We propose two new cache designs to enhance operations of the L1 caches. Second\, we propose a new combined replacement\, bypass and partitioning policy for a last-level cache by achieving the balance between cache reuse and pollution. The new policy is shown to reduce pollution due to keeping cache lines too long in the cache\, a problem which was not addressed by prior work. And third\, we propose a new coordinated bypass policy for a multi-level cache hierarchy using the new classifications of cache lines and their reuse probabilities. This policy works well with any existing policies and architectures which allow bypass. \nThe new cache management policies are shown to improve existing policies or optimize the design with an acceptable performance loss. They are shown to work well with the baseline policies. We also present hardware architectures and application classes that each new policy will be applied to. Hardware design is also described and is shown to be feasible and have low overhead.
URL:https://www.cecs.uci.edu/event/new-perspectives-on-designing-an-effective-management-policy-for-multi-level-cache-hierarchy/
CATEGORIES:PhD Defenses
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20130827T150000
DTEND;TZID=America/Los_Angeles:20130827T160000
DTSTAMP:20231011T190420Z
CREATED:20231011T190420Z
LAST-MODIFIED:20231011T190420Z
UID:14412-1377615600-1377619200@www.cecs.uci.edu
SUMMARY:Cognitive Power Management and Error Resilient Algorithms for Memory Dominated Wireless Communication Systems
DESCRIPTION:Date/Time:  Friday\, August 23\, 2013 \nLocation:  Engineering Hall 4106 \nCommittee Members:Ahmed Eltawil (Chair)Fadi KurdahiA. Lee Swindlehurst \nAbstract: \nAdvanced CMOS technology exhibits increasing variations in performance\, power consumption and reliability parameters. These variations led to extensive overdesigning and increased power consumption to guarantee 100% reliable operation. However\, with the continuous shrinking of device parameters\, future semiconductor industry needs to shift from the assumption of 100% reliable computation to a fault-tolerant approach. Fortunately\, many important application domains such as communication and multimedia are inherently error-aware\, allowing a range of designs with a specified Quality of Service (QoS) to be generated for varying amounts of error in the system. Specifically\, embedded memories in communication systems are perfect candidates for exploring error-aware designs\, since the share of the System-on-Chips (SoCs) that is dedicated to memories has experienced an increasingly upwards trend exceeding more than 50% of the area of an SoCs for wireless standards such as Long-Term Evolution (LTE)\, Digital Video Broadcasting (DVB)\,  and Worldwide Interoperability for Microwave Access (WiMAX). Furthermore\, a large portion of the memory is typically used for buffering data that already has a high level of redundancy (e.g. buffering memories in wireless chips). In the context of wireless communication systems\, given that the incoming buffered data is already corrupted by time varying noise and interference\, there is no need to store the data samples in memories that are error free\, 100% of the time. Rather\, Voltage over-scaling (VoS) techniques can be adopted as an efficient means to achieve energy efficient systems via trading off reliability versus power.  However\, reducing the supply voltage of buffering memory through VoS results in spatially uniform random errors which in turn corrupt the stored data in the buffering memories and increase the noise floor. \nIn this thesis\, the predominance of embedded memories in current and emerging wireless transceivers is utilized as a means to save power via channel state aware voltage scaling. While the wireless channel is a stochastic channel where the designer has little control on its variables\, embedded memories are considered as an extension of the channel where the designer can control its quality via VoS. The thesis presents a unified statistical model that captures both errors in embedded memories due to voltage over-scaling and wireless channel impairments into a single Gaussian distribution model that represents a combination of communication channel noise and hardware noise. The proposed model is used to investigate different cognitive power management policies that capture the performance of the system as a function of both channel and hardware dynamics\, thus creating a much richer design space of power\, performance and reliability. Furthermore\, based on that model\, error-resilient algorithm for Viterbi decoder\, multiple input multiple output (MIMO) detector and memory-based computation are presented.
URL:https://www.cecs.uci.edu/event/cognitive-power-management-and-error-resilient-algorithms-for-memory-dominated-wireless-communication-systems/
CATEGORIES:PhD Defenses
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20130726T150000
DTEND;TZID=America/Los_Angeles:20130726T160000
DTSTAMP:20231011T190420Z
CREATED:20231011T190420Z
LAST-MODIFIED:20231011T190420Z
UID:14411-1374850800-1374854400@www.cecs.uci.edu
SUMMARY:System Level Approaches for Low Power Wireless Architectures
DESCRIPTION:Date/Time:  Thursday\, August 1\, 2013 \nLocation:  Engineering Hall 4106 \nCommittee Members:Professor Ahmed Eltawil (Chair)Professor Fadi KurdahiProfessor Nikil Dutt \nAbstractThere are emerging needs to build energy efficient platforms to support co-operation between heterogeneous wireless networks. This necessitates building efficient frameworks for reconfigurable platforms that can support seamless reconfiguration among different wireless scenarios. Towards achieving that goal\, this thesis addresses the problem of building energy efficient wireless architectures from two perspectives. First\, we develop a high level framework that generates a reconfigurable MPSoC architecture from a library of heterogeneous processing resources that can be reconfigured to support various modes of operation. The framework proposes joint task and core mapping with system level floorplanning. With the objective of minimizing energy\, we develop an analytical probabilistic model that considers static\, dynamic\, reconfiguration and communication energy components for multiple applications characterized by certain probabilities of execution. Fast and efficient heuristics have been developed that can achieve solutions very close to those obtained via optimal solvers\, with several orders of magnitude speedup. \nWhile\, the first perspective focused on system level solutions\, the second perspective focuses on the block level optimizations. It utilizes the fact that the use of embedded memory in its various forms and implementations for cellular base-stations and mobile handhelds has experienced unprecedented growth recently\, significantly affecting area and power consumption metrics. Recent power reduction techniques aggressively modulate the supply voltage of embedded buffering memories\, which allows acceptable hardware errors to flow through the processing chain as a cost of considerable power savings. This thesis presents a model that captures the statistics of both channel noise and buffering memory failures. Furthermore\, it introduces modified forward error correction (FEC) decoders that are aware of both the channel errors as well as the buffering memory errors. The decoding maximizes the likelihood of the received data based on the statics of the combined channel and buffering memory noise. The idea is applicable to three widely used FEC decoders; namely Viterbi\, Turbo\, and LDPC decoders. The modified decoders are able to preserve the system performance very close to the hardware error-free case with negligible area overhead in implementation.
URL:https://www.cecs.uci.edu/event/system-level-approaches-for-low-power-wireless-architectures/
CATEGORIES:PhD Defenses
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20130619T150000
DTEND;TZID=America/Los_Angeles:20130619T160000
DTSTAMP:20231011T190419Z
CREATED:20231011T190419Z
LAST-MODIFIED:20231011T190419Z
UID:14409-1371654000-1371657600@www.cecs.uci.edu
SUMMARY:Exploiting Master-Slave Bus Architecture and Storage Devices to Enable High-Performance\, Low-Power Logging for Sensor Systems
DESCRIPTION:By Eunbae YoonJune 24\, 2013 \nread more
URL:https://www.cecs.uci.edu/event/exploiting-master-slave-bus-architecture-and-storage-devices-to-enable-high-performance-low-power-logging-for-sensor-systems/
CATEGORIES:PhD Defenses
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20130619T150000
DTEND;TZID=America/Los_Angeles:20130619T160000
DTSTAMP:20231011T190402Z
CREATED:20231011T190402Z
LAST-MODIFIED:20231011T190402Z
UID:14408-1371654000-1371657600@www.cecs.uci.edu
SUMMARY:Optimizing Program Performance via Similarity\, Using Feature-aware and Feature-agnostic Characterization Approaches
DESCRIPTION:By Rosario CammarotaMay 31\, 2013 \nread more
URL:https://www.cecs.uci.edu/event/optimizing-program-performance-via-similarity-using-feature-aware-and-feature-agnostic-characterization-approaches/
CATEGORIES:PhD Defenses
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20130619T150000
DTEND;TZID=America/Los_Angeles:20130619T160000
DTSTAMP:20231011T190344Z
CREATED:20231011T190344Z
LAST-MODIFIED:20231011T190344Z
UID:14402-1371654000-1371657600@www.cecs.uci.edu
SUMMARY:Out-of-order Parallel Discrete Event Simulation for Electronic System-Level Design
DESCRIPTION:Date/Time: Thursday\, June 6th\, 10:00 a.m. – 11:00 a.m.Location: CECS Conference Room\, Engineering Hall 3206 \nCommittee Members:Rainer Dömer (Chair)Daniel GajskiBrian Demsky \nAbstractThe large size and complexity of the modern embedded systems poses great challenges to design and validation. At the so called electronic system level (ESL)\, designers start with a specification model of the system and follow a systematic top-down design approach to refine the model to different abstraction levels by adding step-by-step implementation details. ESL models are usually written in C-based System-level Description Languages (SLDLs)\, and contain the essential features such as clear structure and hierarchy\, separate computation and communication\, and explicit parallelism. The validation of ESL models typically relies on simulation. Fast yet accurate simulation is highly desirable for efficient and effective system design. \nThe out-of-order parallel discrete event simulation (OoO PDES) is a novel approach for efficient validation of system-level designs by exploiting the parallel capabilities of todays multi-core PCs for system level description languages. OoO PDES breaks the global simulation-cycle barrier of traditional DE simulation by localizing the simulation time into each thread\, carefully delivering notified events\, and handling a dynamic management of simulation sets. Potential conflicts caused by parallel accesses to shared variables and out-of-order thread scheduling are prevented by an advanced predictive static model analyzer in the compiler. As such\, OoO PDES allows the simulator to effectively exploit the parallel processing capability of the multicore system to achieve fast speed simulation without loss of simulation and timing accuracy. \nWe perform simulation experiments on both highly parallel benchmark examples and real- world embedded applications including a JPEG image encoder\, an edge detector\, a MP3 audio decoder\, a H.264 video decoder\, and a H.264 video encoder. Experimental results show that our approach can achieve significant simulation speedup on multicore simulation hosts with negligible compilation cost. \nBased on our parallel simulation infrastructure\, we then propose a tool flow for dynamic race condition detection to increase the observability for parallel ESL model development. It helps the designer to quickly narrow down the debugging targets in faulty ESL models with par- allelism. This approach helps to reveals a number of risky race conditions in our in- house embedded multi-media application models and enabled us to safely eliminate these hazards. Our experimental results also show very little overhead for race condition diagnosis during compilation and simulation. \nOverall\, our work provides an advanced parallel simulation infrastructure for efficient and effective system-level model validation and development. It helps the embedded system designers to build better products in shorter time-to-market.
URL:https://www.cecs.uci.edu/event/out-of-order-parallel-discrete-event-simulation-for-electronic-system-level-design/
CATEGORIES:PhD Defenses
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20130524T150000
DTEND;TZID=America/Los_Angeles:20130524T160000
DTSTAMP:20231011T190343Z
CREATED:20231011T190343Z
LAST-MODIFIED:20231011T190343Z
UID:14401-1369407600-1369411200@www.cecs.uci.edu
SUMMARY:Designer-in-the-Loop Recoding for Creating Safe and Parallel ESL Models
DESCRIPTION:Date/Time: Thursday\, May 30\, 2013\, 10:00 a.m. – 11:00 a.m.Location: CECS Conference Room\, Engineering Hall 3206 \nCommittee Members:Rainer Dömer (Chair)Daniel GajskiFadi Kurdahi \nAbstractThe design complexity of embedded systems increases as more processors and subsystems integrated on one chip. In order to overcome the design bottlenecks and shorten time to market\, system engineers are motivated to design from a higher abstraction level\, namely Electronic System Level (ESL). ESL design methodology has emerged to address the design complexity by supporting HW/SW co-specification and co-simulation\, system design space exploration and high-level synthesis. \nESL design relies on an input ESL model\, namely the specification model. Creating structured and parallel specification models efficiently is a prerequisite for building cost-effective embedded systems in ESL design. Practically\, application reference code is reused to create the ESL models. However\, the referee models lack the necessary characteristics\, such as explicit parallelism\, structural hierarchy and synthesizability\, for ESL design. It is a time-consuming and error-prone process to manuallyrecode the reference models into desired ESL models. \nThis dissertation addresses on the automation gap of recoding. We follow the design-in-the-loop recoding methodology which efficiently combines the automation tools with designer’s knowledge. Our approach aim to expose parallelism in the ESL model and guarantee that the parallel model is safe from race conditions. \nFirst\, we identifies the essential steps in recoding and defines a recoding design flow to create safe and parallel ESL models.Second\, we contribute three automated recoding operations: variable dependency analysis to provide prompt analysis during model development\, race condition analysis to assist verifying and debugging the parallelism and a high-level transformation function to instantly create loop-level parallelism. Third\, we develop a recoding development platform based on Eclipse tointegrate recoding tools and facilitate the designer-in-the-loop approach. \nThe effectiveness of the recoding functions is shown with experiments on a set of embedded applications. Also\, an classroom experiment with 68 graduate students shows our recoding approach using the Eclipse-based recoding platform increases the productivity and reduces errors in parallel ESL model development.
URL:https://www.cecs.uci.edu/event/designer-in-the-loop-recoding-for-creating-safe-and-parallel-esl-models/
CATEGORIES:PhD Defenses
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20130520T150000
DTEND;TZID=America/Los_Angeles:20130520T160000
DTSTAMP:20231011T190420Z
CREATED:20231011T190420Z
LAST-MODIFIED:20231011T190420Z
UID:14410-1369062000-1369065600@www.cecs.uci.edu
SUMMARY:Context-based Service Performance Profile Management System in SOA
DESCRIPTION:Date/Time:  Tuesday\, May 28th\, 2:00 p.m. – 3:00 p.m. \nLocation:  Engineering Hall 4106 \nCommittee Chair:Kwei-Jay Lin \nAbstractService-Oriented Architecture (SOA) is a software paradigm for providing a uniform means to discover\, interact with and use capabilities to produce desired effects consistent withmeasurable preconditions and expectation. SOA also provides a framework for service com-position by putting together of a number of services to make a more complex one to fulfill a business process and service reconfiguration by replacing faulty services with better perform-ing services to have seamless business process execution. In general\, service integration tries to maximize the performance of a business process such as to have a minimum latency\, the shortest response time\, the optimal reliability\, an acceptable level of security and so on. Al-though technology exists to optimize the performance in terms of the above QoS attributes\, it still may not meet the need of all users\, since user may have unique service requirement at some specific context. \nIn order to address this issue\, in this dissertation\, we present an approach to improve over-all performance for the execution of business process by considering context-based serviceperformance profile management through Context Manager. Context Manager is designed to collect service performance feedback from users along with their context data\, maintainservice performance profile data\, distinguish influential context for service performance\, pre-dict how the service would perform under user context and provide most-adaptive service for user context.Our experiment results indicate that context manager system effectively maintains service performance profile data\, clearly understands the influence of some specific context attributes on service performance and provides context-adaptive services as users expect. Moreover\, integrating context-awareness into SOA brings significant performance improvement in terms of lower rate of service failure and reconfiguration\, and more optimal response time between service requester and service provider.
URL:https://www.cecs.uci.edu/event/context-based-service-performance-profile-management-system-in-soa/
CATEGORIES:PhD Defenses
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20130513T150000
DTEND;TZID=America/Los_Angeles:20130513T160000
DTSTAMP:20231011T190343Z
CREATED:20231011T190343Z
LAST-MODIFIED:20231011T190343Z
UID:14400-1368457200-1368460800@www.cecs.uci.edu
SUMMARY:Embedded Computer Vision Systems for Image Based Motion and Speckle Image Analysis
DESCRIPTION:Date/Time:  Friday\, May 10\, 2013\, 2:00 p.m. – 3: 00p.m.Location:  4011 Donald Bren Hall \nCommittee Members:\nPai H. Chou (Chair)\nBernard Choi\nGlenn Healey\n \nAbstract:  Motion is common in taking images using conventional cameras. If there is motion either on camera or the object or on the both sides during the exposure time\, the image is blurred\, which is called motion blurred image. Motion blurred image is an interesting research subject in several areas including computer vision\, biomedical engineering. In general\, motion is undesirable to acquire clear image. Modern cameras are equipped with the mechanical structure to compensate motion artifact. However\, mechanical structure has limit in compensating huge motion. To compensate huge motion\, computer vision algorithm called motion deblurring is developed. Basically\, it estimates the best latent image from the blurry image using several assumptions (or priors) on the latent image and camera motion. The information included in the motion blur can be useful for biomedical applications. Laser speckle imaging is one good example. When laser light of certain frequency (visible laser is widely used) is illuminated on the skin\, the scattered laser light from the surface has random distribution if there is no motion. With motion\, the speckle pattern is interfered by the motion and no longer random for the region with motion. Since the laser light can penetrate into skin\, it is possible to measure blood perfusion near skin without invasion. Both motion deblurring and laser speckle imaging require huge computation time. That is the reason why they are developed on personal computers or workstations. However\, the physical size\, power consumption\, and cost make them harder to penetrate into wider-range of applications (e.g. A super-fast motion deblurring algorithm that can run on embedded platforms like portable digital cameras or smart phones or portable laser speckle imaging system for an emergency vehicle). Nowadays\, embedded processors become more and more powerful. The CPU clock frequency of those processors have already passed 1Ghz. Some of them use multiple number of cores for processing like x86 processors. However\, even with such high performance processors\, special design considerations are required. In this dissertation\, we suggest embedded hardware and software systems for motion deblurring and laser speckle imaging applications. In the first part of the dissertation\, we will discuss about our motion deblurring systems. We developed an extremely light-weight motion deblurring algorithm to make it fast enough to be suitable for embedded computing platforms. The developed algorithm is up to 100 times faster than the most recent deblurring algorithms. We also developed a hardware/software system for extremely accurate motion deblurring. The hardware system is composed of IMU\, a control board\, and the Microsoft Kinect. Using the hardware system and software algorithm\, our system can reconstruct the relative motion of each pixel during the exposure time with 6-DoF. The second part is about the embedded laser speckle imaging systems that we developed. The mobile LSI (mLSI) system is a battery-powered laser speckle imaging system to meet the portability requirements of special applications (e.g. emergency vehicle\, battle field). We designed the automated power control (APC) circuit based laser diode driver to reduce the power consumption while maintaining the accuracy of the data. We evaluated the pulsed operation of the laser diode with always-on operation using the driver. The mLSI system showed equivalent performance from the evaluation with the clinical LSI system. The small field of view of conventional LSI systems is not adequate to be used for the applications that require fast treatment on large area (e.g. burn wounds). The multi-camera LSI (mcLSI) system was developed to address the requirement. mcLSI shows significant improvement in spatio-temporal resolution over conventional LSI systems. The unit based design enables users to expand the FoV without the sacrifice of the system performance (e.g. average speckle contrast\, spatial/temporal resolution).
URL:https://www.cecs.uci.edu/event/embedded-computer-vision-systems-for-image-based-motion-and-speckle-image-analysis/
CATEGORIES:PhD Defenses
END:VEVENT
END:VCALENDAR