+publisher:"University of Illinois – Urbana-Champaign" +contributor:("Sreenivas, Ramavarapu S.")

University of Illinois – Urbana-Champaign

1. Deverakonda, Vijayalakshmi. Disjunctive normal formula based supervisory control policy for general Petri nets.

Degree: MS, 0127, 2014, University of Illinois – Urbana-Champaign

► A Petri net (PN) is said to be live if it is possible to re any transition, although not immediately, from every reachable marking. A… (more)

Subjects/Keywords: Petri Nets

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Deverakonda, V. (2014). Disjunctive normal formula based supervisory control policy for general Petri nets. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/50715

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Deverakonda, Vijayalakshmi. “Disjunctive normal formula based supervisory control policy for general Petri nets.” 2014. Thesis, University of Illinois – Urbana-Champaign. Accessed March 02, 2021. http://hdl.handle.net/2142/50715.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Deverakonda, Vijayalakshmi. “Disjunctive normal formula based supervisory control policy for general Petri nets.” 2014. Web. 02 Mar 2021.

Vancouver:

Deverakonda V. Disjunctive normal formula based supervisory control policy for general Petri nets. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2014. [cited 2021 Mar 02]. Available from: http://hdl.handle.net/2142/50715.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Deverakonda V. Disjunctive normal formula based supervisory control policy for general Petri nets. [Thesis]. University of Illinois – Urbana-Champaign; 2014. Available from: http://hdl.handle.net/2142/50715

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Illinois – Urbana-Champaign

2. Ramasamy Loganathan, Venkatesh. A study verifying the simulation of market trading with Dynamic Pari-Mutuel mechanism using Python.

Degree: MS, 0127, 2014, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/49668

► Wagering is common in various arenas that include but not limited to horse racing, casinos, financial markets and stock trading. Several market mechanisms are used… (more)

Subjects/Keywords: Wagering; Dynamic Pari-Mutuel Mechanism; Random Walk Path

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Ramasamy Loganathan, V. (2014). A study verifying the simulation of market trading with Dynamic Pari-Mutuel mechanism using Python. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/49668

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Ramasamy Loganathan, Venkatesh. “A study verifying the simulation of market trading with Dynamic Pari-Mutuel mechanism using Python.” 2014. Thesis, University of Illinois – Urbana-Champaign. Accessed March 02, 2021. http://hdl.handle.net/2142/49668.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Ramasamy Loganathan, Venkatesh. “A study verifying the simulation of market trading with Dynamic Pari-Mutuel mechanism using Python.” 2014. Web. 02 Mar 2021.

Vancouver:

Ramasamy Loganathan V. A study verifying the simulation of market trading with Dynamic Pari-Mutuel mechanism using Python. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2014. [cited 2021 Mar 02]. Available from: http://hdl.handle.net/2142/49668.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ramasamy Loganathan V. A study verifying the simulation of market trading with Dynamic Pari-Mutuel mechanism using Python. [Thesis]. University of Illinois – Urbana-Champaign; 2014. Available from: http://hdl.handle.net/2142/49668

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Illinois – Urbana-Champaign

3. Ahn, Young Min. Autonomous navigation and localization of a quadrotor mini-uav by landmarks in indoor environments.

Degree: MS, 0133, 2011, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/24391

► In this thesis, the problems of control, autonomous navigation, and localization in an indoor environment are considered for mini-UAV quadrotor. A commonly used localization methods… (more)

Subjects/Keywords: Autonomous navigation; Localization; Landmarks; Indoor; Quadrotor

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Ahn, Y. M. (2011). Autonomous navigation and localization of a quadrotor mini-uav by landmarks in indoor environments. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/24391

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Ahn, Young Min. “Autonomous navigation and localization of a quadrotor mini-uav by landmarks in indoor environments.” 2011. Thesis, University of Illinois – Urbana-Champaign. Accessed March 02, 2021. http://hdl.handle.net/2142/24391.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Ahn, Young Min. “Autonomous navigation and localization of a quadrotor mini-uav by landmarks in indoor environments.” 2011. Web. 02 Mar 2021.

Vancouver:

Ahn YM. Autonomous navigation and localization of a quadrotor mini-uav by landmarks in indoor environments. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2011. [cited 2021 Mar 02]. Available from: http://hdl.handle.net/2142/24391.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ahn YM. Autonomous navigation and localization of a quadrotor mini-uav by landmarks in indoor environments. [Thesis]. University of Illinois – Urbana-Champaign; 2011. Available from: http://hdl.handle.net/2142/24391

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

4. Chandrasekaran, Sangeetha. Object-Oriented Implementation of the minimally restrictive liveness enforcing supervisory policy in a class of Petri nets.

Degree: MS, 0127, 2013, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/42202

► Livelock avoidance is an essential requirement in Discrete-Event/Discrete-State (DEDS) systems. Every event of a live DEDS system can be executed at some instant in the… (more)

Subjects/Keywords: Controlled Petri nets; Supervisory policy for discrete systems; Liveness; livelock avoidance; Control invariance; Minimally restrictive

9 more images…

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Chandrasekaran, S. (2013). Object-Oriented Implementation of the minimally restrictive liveness enforcing supervisory policy in a class of Petri nets. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/42202

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Chandrasekaran, Sangeetha. “Object-Oriented Implementation of the minimally restrictive liveness enforcing supervisory policy in a class of Petri nets.” 2013. Thesis, University of Illinois – Urbana-Champaign. Accessed March 02, 2021. http://hdl.handle.net/2142/42202.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Chandrasekaran, Sangeetha. “Object-Oriented Implementation of the minimally restrictive liveness enforcing supervisory policy in a class of Petri nets.” 2013. Web. 02 Mar 2021.

Vancouver:

Chandrasekaran S. Object-Oriented Implementation of the minimally restrictive liveness enforcing supervisory policy in a class of Petri nets. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2013. [cited 2021 Mar 02]. Available from: http://hdl.handle.net/2142/42202.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Chandrasekaran S. Object-Oriented Implementation of the minimally restrictive liveness enforcing supervisory policy in a class of Petri nets. [Thesis]. University of Illinois – Urbana-Champaign; 2013. Available from: http://hdl.handle.net/2142/42202

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

5. Somnath, Nisha. Hierarchical supervisory control of complex Petri nets.

Degree: MS, 4048, 2012, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/29638

► Large, complex systems are prone to the phenomenon of livelocks. Once a system enters a livelocked-state, there is at least one activity of the modeled… (more)

Subjects/Keywords: Petri nets; Supervisory control; Concurrent systems

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Somnath, N. (2012). Hierarchical supervisory control of complex Petri nets. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/29638

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Somnath, Nisha. “Hierarchical supervisory control of complex Petri nets.” 2012. Thesis, University of Illinois – Urbana-Champaign. Accessed March 02, 2021. http://hdl.handle.net/2142/29638.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Somnath, Nisha. “Hierarchical supervisory control of complex Petri nets.” 2012. Web. 02 Mar 2021.

Vancouver:

Somnath N. Hierarchical supervisory control of complex Petri nets. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2012. [cited 2021 Mar 02]. Available from: http://hdl.handle.net/2142/29638.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Somnath N. Hierarchical supervisory control of complex Petri nets. [Thesis]. University of Illinois – Urbana-Champaign; 2012. Available from: http://hdl.handle.net/2142/29638

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

6. Michelotti, Mark B. Application of the novint falcon haptic device as an actuator in real-time control.

Degree: MS, 3846, 2011, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/24126

► The two goals of this thesis are A) to develop an embedded system whose purpose is to control the Novint Falcon as a robot, and… (more)

Subjects/Keywords: Novint Falcon; haptic; robotics; control; ball and plate

10 more images…

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Michelotti, M. B. (2011). Application of the novint falcon haptic device as an actuator in real-time control. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/24126

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Michelotti, Mark B. “Application of the novint falcon haptic device as an actuator in real-time control.” 2011. Thesis, University of Illinois – Urbana-Champaign. Accessed March 02, 2021. http://hdl.handle.net/2142/24126.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Michelotti, Mark B. “Application of the novint falcon haptic device as an actuator in real-time control.” 2011. Web. 02 Mar 2021.

Vancouver:

Michelotti MB. Application of the novint falcon haptic device as an actuator in real-time control. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2011. [cited 2021 Mar 02]. Available from: http://hdl.handle.net/2142/24126.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Michelotti MB. Application of the novint falcon haptic device as an actuator in real-time control. [Thesis]. University of Illinois – Urbana-Champaign; 2011. Available from: http://hdl.handle.net/2142/24126

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Illinois – Urbana-Champaign

7. Reck, Rebecca Marie. Experiential learning in control systems laboratories and engineering project management.

Degree: PhD, Systems & Entrepreneurial Engr, 2016, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/90574

► Experiential learning is a process by which a student creates knowledge through the insights gained from an experience. Kolb's model of experiential learning is a… (more)

▼ Experiential learning is a process by which a student creates knowledge through the insights gained from an experience. Kolb's model of experiential learning is a cycle of four modes: (1) concrete experience, (2) reflective observation, (3) abstract conceptualization, and (4) active experimentation. His model is used in each of the three studies presented in this dissertation. Laboratories are a popular way to apply the experiential learning modes in STEM courses. Laboratory kits allow students to take home laboratory equipment to complete experiments on their own time. Although students like laboratory kits, no previous studies compared student learning outcomes on assignments using laboratory kits with existing laboratory equipment. In this study, we examined the similarities and differences between the experiences of students who used a portable laboratory kit and students who used the traditional equipment. During the 2014-2015 academic year, we conducted a quasi-experiment to compare students' achievement of learning outcomes and their experiences in the instructional laboratory for an introductory control systems course. Half of the laboratory sections in each semester used the existing equipment, while the other sections used a new kit. We collected both quantitative data and qualitative data. We did not identify any major differences in the student experience based on the equipment they used. Course objectives, like research objectives and product requirements, help provide clarity and direction for faculty and students. Unfortunately, course and laboratory objectives are not always clearly stated. Without a clear set of objectives, it can be hard to design a learning experience and determine whether students are achieving the intended outcomes of the course or laboratory. In this study, I identified a common set of laboratory objectives, concepts, and components of a laboratory apparatus for undergraduate control systems laboratories. During the summer of 2015, a panel of 40 control systems faculty members, from a variety of institutions, completed a multi-round Delphi survey in order to bring them toward consensus on the common aspects of their laboratories. The following winter, 45 additional faculty members and practitioners from the control systems community completed a follow-up survey to gather feedback on the results of the Delphi survey. During the Delphi study, the panelists identified 15 laboratory objectives, 26 concepts, and 15 components that were common in their laboratories. Then in both the Delphi survey and follow-up survey each participant rated the importance of each of these items. While the average ratings differed slightly between the two groups, the order of each set of items was compared with two different tests and the order was found to be similar. Some of the common and important learning objectives include connecting theory to what is implemented and observed in the laboratory, designing controllers, and modeling and simulating systems. The most common… Advisors/Committee Members: Champaign%22%20%2Bcontributor%3A%28%22Sreenivas%2C%20Ramavarapu%20S%22%29&pagesize-30">Sreenivas, Ramavarapu S (advisor), Champaign%22%20%2Bcontributor%3A%28%22Loui%2C%20Michael%20C%22%29&pagesize-30">Loui, Michael C (advisor), Champaign%22%20%2Bcontributor%3A%28%22Sreenivas%2C%20Ramavarapu%20S%22%29&pagesize-30">Sreenivas, Ramavarapu S (Committee Chair), Champaign%22%20%2Bcontributor%3A%28%22Stipanovic%2C%20Dusan%22%29&pagesize-30">Stipanovic, Dusan (committee member), Champaign%22%20%2Bcontributor%3A%28%22Herman%2C%20Geoffrey%20L%22%29&pagesize-30">Herman, Geoffrey L (committee member).

Subjects/Keywords: control systems; engineering education; experiential learning; Science, technology, engineering, and mathematics (STEM); laboratories; project management; lab kit; engineering; education; Delphi survey; engineering management; leadership; projects; lab; experiment; Raspberry Pi; controls

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Reck, R. M. (2016). Experiential learning in control systems laboratories and engineering project management. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/90574

Chicago Manual of Style (16^th Edition):

Reck, Rebecca Marie. “Experiential learning in control systems laboratories and engineering project management.” 2016. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed March 02, 2021. http://hdl.handle.net/2142/90574.

MLA Handbook (7^th Edition):

Reck, Rebecca Marie. “Experiential learning in control systems laboratories and engineering project management.” 2016. Web. 02 Mar 2021.

Vancouver:

Reck RM. Experiential learning in control systems laboratories and engineering project management. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2016. [cited 2021 Mar 02]. Available from: http://hdl.handle.net/2142/90574.

Council of Science Editors:

Reck RM. Experiential learning in control systems laboratories and engineering project management. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2016. Available from: http://hdl.handle.net/2142/90574

University of Illinois – Urbana-Champaign

8. Salimi, Ehsan. On the convexity of right-closed sets and its application to liveness enforcement in Petri Nets.

Degree: PhD, Industrial Engineering, 2015, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/88056

► A set of n-dimensional integral vectors, Nn, is said to be right-closed if for any x 2 , any vector y x also belongs to… (more)

▼ A set of n-dimensional integral vectors, Nn, is said to be right-closed if for any x 2 , any vector y x also belongs to it. An integral-set Nn is convex if and only if there is a convex set C Rn such that = Int(C), where Int( ) denotes the integral points in the set argument. In this dissertation, we show that the problem of verifying convexity of a right-closed set is decidable. Following this, we present a polynomial time, LP-based algorithm, for verifying the convexity of a right-closed set of integral vectors, when the dimension n is xed. This result is to be viewed against the backdrop of the fact that checking the convexity of a real-valued, geometric set can only be accomplished in an approximate sense; and, the fact that most algorithms involving sets of real-valued vectors do not apply directly to their integral counterparts. Also, we discuss a grid-search based algorithm for verifying the convexity of such a set, although not a polynomial time procedure, it is a method that veri es the convexity of right-closed sets in a reasonable time complexity. On the application side, right-closed sets feature in the synthesis of Liveness Enforcing Supervisory Policies (LESPs) for a large family of Petri Nets (PNs). For any PN structure N from this family, the set of initial markings, (N), for which there is a LESP, is right-closed. A LESP determines the transitions of a PN that are to be permitted to re at any marking in such a manner that, irrespective of the past, every transition can be red at some marking in the future. A system that is modeled by a live PN does not experience livelocks, which serves as the motivation for investigating implementation paradigms for LESPs in practice. If a transition is prevented from ring at a marking by a LESP, and all LESPs, irrespective of the implementation-paradigm that is chosen, prescribe the same control for the marking, then it is a minimally restrictive LESP. It is possible to synthesize the minimally restrictive LESP for any instance N of the aforementioned family that uses the right-closed set of markings (N). The literature also contains an implementation paradigm called invariant-based monitors for liveness enforcement in PNs. This paradigm is popular due to the fact that the resulting supervisor can be directly incorporated into the semantics of the PN model of the controlled system. In this work, we show that there is an invariant-based monitor that is equivalent to the minimally restrictive LESP that uses the right-closed set (N) if and only if (N) is convex. This result serves as the motivation behind exploring the convexity of right-closed sets. Advisors/Committee Members: Champaign%22%20%2Bcontributor%3A%28%22Sreenivas%2C%20Ramavarapu%20S.%22%29&pagesize-30">Sreenivas, Ramavarapu S. (advisor), Champaign%22%20%2Bcontributor%3A%28%22Sreenivas%2C%20Ramavarapu%20S.%22%29&pagesize-30">Sreenivas, Ramavarapu S. (Committee Chair), Champaign%22%20%2Bcontributor%3A%28%22Basar%2C%20Tamer%22%29&pagesize-30">Basar, Tamer (committee member), Champaign%22%20%2Bcontributor%3A%28%22Nagi%2C%20Rakesh%22%29&pagesize-30">Nagi, Rakesh (committee member), Champaign%22%20%2Bcontributor%3A%28%22Beck%2C%20Carolyn%20L.%22%29&pagesize-30">Beck, Carolyn L. (committee member), Champaign%22%20%2Bcontributor%3A%28%22Kiyavash%2C%20Negar%22%29&pagesize-30">Kiyavash, Negar (committee member).

Subjects/Keywords: Right-closed set; convexity; integer convexity; polyhedral theory; Petri Nets; Liveness

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Salimi, E. (2015). On the convexity of right-closed sets and its application to liveness enforcement in Petri Nets. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/88056

Chicago Manual of Style (16^th Edition):

Salimi, Ehsan. “On the convexity of right-closed sets and its application to liveness enforcement in Petri Nets.” 2015. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed March 02, 2021. http://hdl.handle.net/2142/88056.

MLA Handbook (7^th Edition):

Salimi, Ehsan. “On the convexity of right-closed sets and its application to liveness enforcement in Petri Nets.” 2015. Web. 02 Mar 2021.

Vancouver:

Salimi E. On the convexity of right-closed sets and its application to liveness enforcement in Petri Nets. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2015. [cited 2021 Mar 02]. Available from: http://hdl.handle.net/2142/88056.

Council of Science Editors:

Salimi E. On the convexity of right-closed sets and its application to liveness enforcement in Petri Nets. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2015. Available from: http://hdl.handle.net/2142/88056

University of Illinois – Urbana-Champaign

9. Sankaran, Naveen Kumar. Design and development of systems and methods for interventional surgical robot.

Degree: PhD, Systems & Entrepreneurial Engr, 2020, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/107843

► Interventional procedures are used for diagnosis and/or treatment that involves entry into the body through incision or puncture. Endovascular procedure using guidewire/catheter and needle biopsy… (more)

▼ Interventional procedures are used for diagnosis and/or treatment that involves entry into the body through incision or puncture. Endovascular procedure using guidewire/catheter and needle biopsy procedures are two common surgeries that are performed interventionally using image guidance. Inadequate visual and force feedback, while navigating surgical tools during endovascular (guidewire/catheter) procedures, elevates the risk of surgical error. Further, long-term exposure to x-ray and radiation is a potential occupational hazard for health care providers. Current endovascular robotic systems have helped in reducing the exposure of radiation while improving the precision with which the devices can be placed inside the body. However, the current systems do not provide accurate force feedback or utilize a surgeon’s intuitive surgical skills during manipulation from the master console. Needle biopsy procedures are most frequently performed in hospitals for fluid extractions, biopsies, diagnosis, therapies, and surgeries. Researchers have attempted to model needle insertion into soft tissue using mathematical modeling, yet, wide variability in human anatomy and complexity of access have not been implemented. The goal of this dissertation is to improve two interventional surgical procedures. (i) Endovascular robotic procedures: a novel endovascular robotic system with teleoperation control is designed and developed to addresses two issue; overcome the barrier of transferring surgical skills on a robotic console and; overcome lack of realistic force estimation and feedback mechanism in the robot surgical systems with passive surgical tools, (ii) Needle biopsy procedures: research work focuses on an intelligent robotic system to assist with breast biopsy procedures using; a new ultrasound-guided in-situ needle biopsy robotic medical assistance system, and; a robotic system that uses deep learning techniques to provide needle-tissue interaction force parameter for situation awareness during the procedure. Advisors/Committee Members: Champaign%22%20%2Bcontributor%3A%28%22Kesavadas%2C%20Thenkurussi%22%29&pagesize-30">Kesavadas, Thenkurussi (advisor), Champaign%22%20%2Bcontributor%3A%28%22Kesavadas%2C%20Thenkurussi%22%29&pagesize-30">Kesavadas, Thenkurussi (Committee Chair), Champaign%22%20%2Bcontributor%3A%28%22Sreenivas%2C%20Ramavarapu%20S%22%29&pagesize-30">Sreenivas, Ramavarapu S (committee member), Champaign%22%20%2Bcontributor%3A%28%22Ferreira%2C%20Placid%20Mathew%22%29&pagesize-30">Ferreira, Placid Mathew (committee member), Champaign%22%20%2Bcontributor%3A%28%22Krishnan%2C%20Girish%22%29&pagesize-30">Krishnan, Girish (committee member).

Subjects/Keywords: Medical robotics; Intelligent robotic system

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Sankaran, N. K. (2020). Design and development of systems and methods for interventional surgical robot. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/107843

Chicago Manual of Style (16^th Edition):

Sankaran, Naveen Kumar. “Design and development of systems and methods for interventional surgical robot.” 2020. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed March 02, 2021. http://hdl.handle.net/2142/107843.

MLA Handbook (7^th Edition):

Sankaran, Naveen Kumar. “Design and development of systems and methods for interventional surgical robot.” 2020. Web. 02 Mar 2021.

Vancouver:

Sankaran NK. Design and development of systems and methods for interventional surgical robot. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2020. [cited 2021 Mar 02]. Available from: http://hdl.handle.net/2142/107843.

Council of Science Editors:

Sankaran NK. Design and development of systems and methods for interventional surgical robot. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2020. Available from: http://hdl.handle.net/2142/107843

University of Illinois – Urbana-Champaign

10. Chen, Zisheng. Topics on option valuation and model calibration.

Degree: PhD, 0127, 2013, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/44400

► This dissertation is devoted to high performance numerical methods for option valuation and model calibration in L´evy process and stochastic volatility models. In the first… (more)

Subjects/Keywords: option pricing; model calibration; analytic class; characteristic function; simulation; inverse transform

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Chen, Z. (2013). Topics on option valuation and model calibration. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/44400

Chicago Manual of Style (16^th Edition):

Chen, Zisheng. “Topics on option valuation and model calibration.” 2013. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed March 02, 2021. http://hdl.handle.net/2142/44400.

MLA Handbook (7^th Edition):

Chen, Zisheng. “Topics on option valuation and model calibration.” 2013. Web. 02 Mar 2021.

Vancouver:

Chen Z. Topics on option valuation and model calibration. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2013. [cited 2021 Mar 02]. Available from: http://hdl.handle.net/2142/44400.

Council of Science Editors:

Chen Z. Topics on option valuation and model calibration. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2013. Available from: http://hdl.handle.net/2142/44400

University of Illinois – Urbana-Champaign

11. Lin, Xiong. The Hilbert Transform and its Applications in Computational finance.

Degree: PhD, 0439, 2011, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/18601

► This thesis is devoted to the study of the Hilbert transform and its applications in computational finance. We will show in this thesis that under… (more)

Subjects/Keywords: Hilbert transform; Fourier transform; Sinc series; Barrier option; Bermudan option; Lookback option

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Lin, X. (2011). The Hilbert Transform and its Applications in Computational finance. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/18601

Chicago Manual of Style (16^th Edition):

Lin, Xiong. “The Hilbert Transform and its Applications in Computational finance.” 2011. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed March 02, 2021. http://hdl.handle.net/2142/18601.

MLA Handbook (7^th Edition):

Lin, Xiong. “The Hilbert Transform and its Applications in Computational finance.” 2011. Web. 02 Mar 2021.

Vancouver:

Lin X. The Hilbert Transform and its Applications in Computational finance. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2011. [cited 2021 Mar 02]. Available from: http://hdl.handle.net/2142/18601.

Council of Science Editors:

Lin X. The Hilbert Transform and its Applications in Computational finance. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2011. Available from: http://hdl.handle.net/2142/18601

University of Illinois – Urbana-Champaign

12. Alvarado Ortiz, Alberth. Centralized and distributed resource allocation with applications to signal processing in communications.

Degree: PhD, 0127, 2015, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/72870

► Nowadays, wired and wireless networks are used everywhere and everyday. With the increasing popularity of multiuser communication systems, their optimal performance has become a crucial… (more)

▼ Nowadays, wired and wireless networks are used everywhere and everyday. With the increasing popularity of multiuser communication systems, their optimal performance has become a crucial field of study during the last decades. A factor that greatly determines such performance is the optimal allocation of the resources available to the agents in the network. This dissertation provides a set of optimization techniques applicable to rigorously address and deeply analyze multiuser resource allocation problems in different areas, ranging from signal processing, to communications and networking. More specifically, this work focuses on the three main topics that we briefly describe next. First, we study the maximum sum-utility achieved when a noncooperative approach is used to allocate the spectrum in a communication system adopting a dynamic spectrum management framework. In particular, we turn our attention to the case in which the users in the system are endowed with infinite power budgets. This asymptotic analysis, based on the linear complementarity problem theory, leads us characterize the behavior of the system's utility as the power budget is increased toward infinity, and thus draw interesting conclusions on the efficiency of the Nash equilibrium and the Braess-type paradox, among others. Second, we propose a novel class of distributed algorithms for the optimization of nonconvex and nonseparable sum-utility functions subject to convex coupling constraints. Even though, we focus on utility functions of the Difference of Convex (DC) type, further generalizations are possible. Moreover, the obtained iterative schemes are provable convergent to stationary points of such optimization problems. Among the different applications of our Successive Convex Approximationsbased algorithms, we direct our attention to a novel resource allocation problem in the emerging field of physical layer based security, and to the well-known MIMO (Multiple-Input-Multiple-Output) Cognitive Radio sum-rate maximization problem. For the former application, we develop a mathematically rigorous analysis of the nondifferentiable and nonconvex game (of the generalized type) proposed to optimally allocate the network resources in this context; and finally, we apply our algorithms to find relaxed equilibrium points of the mentioned game. For the second application, our theory provides, for the first time, a provable convergent algorithm. The third major topic of this dissertation analyzes a multiuser maximization problem where the utility function has a particular structure, namely, it is the sum of continuous maximum functions, subject to private and coupling constraints. We follow two different approaches in order to design provable convergent algorithms to address this problem. These approaches are based on simpler reformulations of the nondifferentiable and nonconcave optimization problem of interest. A careful analysis relating such problems is also developed. The cited results pave the way to devise (possibly distributed) algorithms for… Advisors/Committee Members: Champaign%22%20%2Bcontributor%3A%28%22Pang%2C%20Jong-Shi%22%29&pagesize-30">Pang, Jong-Shi (advisor), Champaign%22%20%2Bcontributor%3A%28%22Nedich%2C%20Angelia%22%29&pagesize-30">Nedich, Angelia (Committee Chair), Champaign%22%20%2Bcontributor%3A%28%22Pang%2C%20Jong-Shi%22%29&pagesize-30">Pang, Jong-Shi (committee member), Champaign%22%20%2Bcontributor%3A%28%22Sreenivas%2C%20Ramavarapu%20S.%22%29&pagesize-30">Sreenivas, Ramavarapu S. (committee member), Champaign%22%20%2Bcontributor%3A%28%22Scutari%2C%20Gesualdo%22%29&pagesize-30">Scutari, Gesualdo (committee member).

Subjects/Keywords: Distributed optimization; Resource allocation; Nash equilibrium; Game theory; Difference of convex programming; Nonconvex and nondifferentiable optimization; Successive convex approximation; Multiuser systems; Dynamic spectrum management; Cooperative physical layer security; Cognitive radio

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Alvarado Ortiz, A. (2015). Centralized and distributed resource allocation with applications to signal processing in communications. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/72870

Chicago Manual of Style (16^th Edition):

Alvarado Ortiz, Alberth. “Centralized and distributed resource allocation with applications to signal processing in communications.” 2015. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed March 02, 2021. http://hdl.handle.net/2142/72870.

MLA Handbook (7^th Edition):

Alvarado Ortiz, Alberth. “Centralized and distributed resource allocation with applications to signal processing in communications.” 2015. Web. 02 Mar 2021.

Vancouver:

Alvarado Ortiz A. Centralized and distributed resource allocation with applications to signal processing in communications. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2015. [cited 2021 Mar 02]. Available from: http://hdl.handle.net/2142/72870.

Council of Science Editors:

Alvarado Ortiz A. Centralized and distributed resource allocation with applications to signal processing in communications. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2015. Available from: http://hdl.handle.net/2142/72870

University of Illinois – Urbana-Champaign

13. Sutcu, Muhammed. Approximating multivariate distributions with cumulative residual entropy: a study on dynamic integrated climate-economy model.

Degree: PhD, Industrial Engineering, 2014, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/78578

► The complexity of real world decision problems is exacerbated by the need to make decisions with only partial information. How to model and make decisions… (more)

▼ The complexity of real world decision problems is exacerbated by the need to make decisions with only partial information. How to model and make decisions in situations where only partial preference information is available is a significant challenge in decision analysis practice. In most of the studies, the probability distributions are approximated by using the mass function or density function of the decision maker. In this dissertation, our aim is to approximate representative probability and utility functions by using cumulative distribution functions instead of density/mass functions. This dissertation consists of four main sections. The first two sections introduce the proposed methods based on cumulative residual entropy, the third section compares the proposed approximation methods with the methods in information theory literature, and the final section of the dissertation discusses the cumulative impact of integrating uncertainty into the DICE model. In the first section of the dissertation, we approximate discrete joint probability distributions using first-order dependence trees as well as the recent concept of cumulative residual entropy. We formulate the cumulative residual Kullback-Leibler (KL)-divergence and the cumulative residual mutual information measures in terms of the survival function. We then show that the optimal first-order dependence tree approximation of the joint distribution using the cumulative Kullback-Leibler divergence is the one with the largest sum of cumulative residual mutual information pairs. In the second part of the dissertation, we approximate multivariate probability distributions with cumulative probability distributions rather than density functions in maximum entropy formulation. We use the discrete form of maximum cumulative residual entropy to approximate joint probability distributions to elicit multivariate probability distributions using their lower order assessments. In the third part of the dissertation, we compare several approximation methods to test the accuracy of different approximations of joint distributions with respect to the true distribution from the set of all possible distributions that match the available information. A number of methods have beeb presented in the literature for joint probability distribution approximations and we specifically compare those approximation methods that use information theory to approximate multivariate probability distributions. Finally, we study whether uncertainty significantly affects decision making especially in global warming policy decisions and integrate climatic and economic uncertainties into the DICE model to ascertain the cumulative impact of integrating uncertainty on climate change by applying cumulative residual entropy into the DICE model. Advisors/Committee Members: Champaign%22%20%2Bcontributor%3A%28%22Abbas%2C%20Ali%20E.%22%29&pagesize-30">Abbas, Ali E. (advisor), Champaign%22%20%2Bcontributor%3A%28%22Sreenivas%2C%20Ramavarapu%20S.%22%29&pagesize-30">Sreenivas, Ramavarapu S. (Committee Chair), Champaign%22%20%2Bcontributor%3A%28%22Uddin%2C%20Rizwan%22%29&pagesize-30">Uddin, Rizwan (committee member), Champaign%22%20%2Bcontributor%3A%28%22Beck%2C%20Carolyn%20L.%22%29&pagesize-30">Beck, Carolyn L. (committee member).

Subjects/Keywords: entropy; maximum entropy; first order dependence tree; Dynamic Integrated Climate Economy Model; Cumulative Residual Entropy; Partial Information; Decision Analysis

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Sutcu, M. (2014). Approximating multivariate distributions with cumulative residual entropy: a study on dynamic integrated climate-economy model. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/78578

Chicago Manual of Style (16^th Edition):

Sutcu, Muhammed. “Approximating multivariate distributions with cumulative residual entropy: a study on dynamic integrated climate-economy model.” 2014. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed March 02, 2021. http://hdl.handle.net/2142/78578.

MLA Handbook (7^th Edition):

Sutcu, Muhammed. “Approximating multivariate distributions with cumulative residual entropy: a study on dynamic integrated climate-economy model.” 2014. Web. 02 Mar 2021.

Vancouver:

Sutcu M. Approximating multivariate distributions with cumulative residual entropy: a study on dynamic integrated climate-economy model. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2014. [cited 2021 Mar 02]. Available from: http://hdl.handle.net/2142/78578.

Council of Science Editors:

Sutcu M. Approximating multivariate distributions with cumulative residual entropy: a study on dynamic integrated climate-economy model. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2014. Available from: http://hdl.handle.net/2142/78578

University of Illinois – Urbana-Champaign

14. Abdildin, Yerkin. Multiattribute utility functions for the deep borehole filter restoration problem.

Degree: PhD, 0127, 2014, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/50440

► The energy problem is one of the biggest challenges facing the World in the 21st century. It is related to the issues of natural resource… (more)

▼ The energy problem is one of the biggest challenges facing the World in the 21st century. It is related to the issues of natural resource extraction, resource depletion, power generation, environmental degradation, and atmospheric change such as global warming. Since more than 80% of the world’s primary energy is generated from fossil fuels (coal, oil, gas), emissions of carbon dioxide (CO2) from all fossil-fuel burnings are the largest cause of climate change. Global climate disruption, in turn, impacts on human health, flora, and fauna. The global energy demand is expected to double by 2050 and that is inevitably due to global population growth, global economic growth, and continued urbanization. To meet the increasing demand for energy and to avoid catastrophic climate change, increases in energy efficiency and increases in the fraction of low carbon energy sources are required. Uranium is a good energy source, because it has high energy density and nuclear power does not contribute to carbon dioxide emissions. However, difficulties in uranium mining cause large worldwide shortages of uranium for power generation. Decision makers in uranium mining are often challenged by various uncertainties in their decision problems (financial, technological, geological) and multiple objectives (increase profits, decrease radiation hazards, improve safety of operations, preserve environments). This dissertation studies multiattribute utility functions for modeling such challenging decision problems using the example of the deep borehole filter restoration problem from the uranium extraction industry. In this problem, the filter of the production borehole (or well) is periodically contaminated or clogged, causing significant uranium output reduction. The efficient modeling of this decision-making problem is of paramount importance for uranium mining worldwide and requires normative decision analysis. Motivated by the complexity of multiattribute decision problems under uncertainty and multiple objectives, this dissertation considers a set of open research problems related to the number of attributes and their degree of ‘interdependence under uncertainty,’ formally, utility dependence and independence. This dissertation characterizes the special functional forms of multiattribute utility functions (MUFs) under the partial utility independence (PUI) condition, verifies their applicability to the deep borehole filter restoration problem, evaluates the alternatives of the decision problem by three different approaches, and introduces novel methods for excluding redundant utility assessments. In Part I of this work we present our study: (1) what are the objectives and the corresponding attributes (i.e. factors or criteria of the decision-making process) of the deep borehole filter restoration problem from the well-field manager’s point of view, (2) does the ultimate decision maker find these attributes good or not, (3) does utility independence (UI) among the attributes exist in this decision problem, (4) whether or not… Advisors/Committee Members: Champaign%22%20%2Bcontributor%3A%28%22Abbas%2C%20Ali%20E.%22%29&pagesize-30">Abbas, Ali E. (advisor), Champaign%22%20%2Bcontributor%3A%28%22Abbas%2C%20Ali%20E.%22%29&pagesize-30">Abbas, Ali E. (Committee Chair), Champaign%22%20%2Bcontributor%3A%28%22Uddin%2C%20Rizwan%22%29&pagesize-30">Uddin, Rizwan (committee member), Champaign%22%20%2Bcontributor%3A%28%22Sreenivas%2C%20Ramavarapu%20S.%22%29&pagesize-30">Sreenivas, Ramavarapu S. (committee member), Champaign%22%20%2Bcontributor%3A%28%22Allison%2C%20James%20T.%22%29&pagesize-30">Allison, James T. (committee member).

Subjects/Keywords: Decision analysis; multiattribute utility functions; the World’s biggest challenge; energy problem; uranium mining; in situ leach mining; deep borehole filter restoration problem; borehole recovery problem; nuclear power; twos-complement exclusion algorithm; ternary-decimal exclusion algorithm; partial utility independence; utility assessments; preference elicitation; decision maker; evaluation of alternatives; multiple attributes; uncertainty; eliminating redundancy; excluding duplicate terms; experimental study; confidence intervals

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Abdildin, Y. (2014). Multiattribute utility functions for the deep borehole filter restoration problem. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/50440

Chicago Manual of Style (16^th Edition):

Abdildin, Yerkin. “Multiattribute utility functions for the deep borehole filter restoration problem.” 2014. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed March 02, 2021. http://hdl.handle.net/2142/50440.

MLA Handbook (7^th Edition):

Abdildin, Yerkin. “Multiattribute utility functions for the deep borehole filter restoration problem.” 2014. Web. 02 Mar 2021.

Vancouver:

Abdildin Y. Multiattribute utility functions for the deep borehole filter restoration problem. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2014. [cited 2021 Mar 02]. Available from: http://hdl.handle.net/2142/50440.

Council of Science Editors:

Abdildin Y. Multiattribute utility functions for the deep borehole filter restoration problem. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2014. Available from: http://hdl.handle.net/2142/50440

University of Illinois – Urbana-Champaign

15. Saboori, Anooshiravan. Verification and Enforcement of State-Based Notions of Opacity in Discrete Event Systems.

Degree: PhD, 1200, 2011, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/18226

► Motivated by security and privacy considerations in applications of discrete event systems, we describe and analyze the complexity of verifying various state-based notions of opacity… (more)

▼ Motivated by security and privacy considerations in applications of discrete event systems, we describe and analyze the complexity of verifying various state-based notions of opacity in systems that are modeled as (possibly non-deterministic) finite automata with partial observation on their transitions. Assuming that the intruder observes system activity through some projection map and has complete knowledge of the system model, we define three notions of opacity with respect to a set of secret states: (i) initial-state opacity is a notion that requires the membership of the system true initial state to the set of secret states remain opaque (i.e., uncertain) to the intruder; (ii) K-step opacity is a notion that requires that at any specific point in time within the last K observations, the entrance of the system state to the given set of secret states remain opaque to the intruder; (iii) infinite-step opacity is a notion that requires the entrance of the system state at any particular instant to the set of secret states remain opaque, for the length of the system operation, to the intruder. As illustrated via examples in the thesis, the above state-based notions of opacity can be used to characterize the security requirements in many applications, including encryption using pseudo-random generators, coverage properties in sensor networks, and anonymity requirements in protocols for web transactions. In order to model the intruder capabilities regarding initial-state opacity, we address the initial-state estimation problem in a non-deterministic finite automaton under partial observations on its transitions via the construction of an initial-state estimator. We analyze the properties and complexity of the initial-state estimator, and show how the complexity of the verification method can be greatly reduced in the special case when the set of secret states is invariant (i.e., it does not change over time). We also establish that the verification of initial-state opacity is a PSPACE-complete problem. In order to verify K-step opacity, we introduce the K-delay state estimator which constructs the estimate of the state of the system K observations ago (K-delayed state estimates) for a given non-deterministic finite automaton under partial observation on its transitions. We provide two methods for constructing K-delay state estimators, and hence two methods for verifying K-step opacity, and analyze the computational complexity of both. In the process, we also establish that the verification of K-step opacity is an NP-hard problem. We also investigate the role of the delay K in K-step opacity and show that there exists a delay K* such that K-step opacity implies K'-step opacity for any K and K' such that K'>K>= K*. This is not true for arbitrary K'>K though the converse holds trivially. Infinite-step opacity can be verified via the construction of a current-state estimator and a bank of appropriate initial-state estimators. The verification of infinite-step opacity is also… Advisors/Committee Members: Champaign%22%20%2Bcontributor%3A%28%22Hadjicostis%2C%20Christoforos%20N.%22%29&pagesize-30">Hadjicostis, Christoforos N. (advisor), Champaign%22%20%2Bcontributor%3A%28%22Basar%2C%20Tamer%22%29&pagesize-30">Basar, Tamer (Committee Chair), Champaign%22%20%2Bcontributor%3A%28%22Hadjicostis%2C%20Christoforos%20N.%22%29&pagesize-30">Hadjicostis, Christoforos N. (committee member), Champaign%22%20%2Bcontributor%3A%28%22Coleman%2C%20Todd%20P.%22%29&pagesize-30">Coleman, Todd P. (committee member), Champaign%22%20%2Bcontributor%3A%28%22Sreenivas%2C%20Ramavarapu%20S.%22%29&pagesize-30">Sreenivas, Ramavarapu S. (committee member), Champaign%22%20%2Bcontributor%3A%28%22Kumar%2C%20P.%20R.%22%29&pagesize-30">Kumar, P. R. (committee member).

Subjects/Keywords: Discrete Event Systems; Security; Finite Automata; Partial Event Observation; Information Flow; Tracking Problems in Sensor Networks

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Saboori, A. (2011). Verification and Enforcement of State-Based Notions of Opacity in Discrete Event Systems. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/18226

Chicago Manual of Style (16^th Edition):

Saboori, Anooshiravan. “Verification and Enforcement of State-Based Notions of Opacity in Discrete Event Systems.” 2011. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed March 02, 2021. http://hdl.handle.net/2142/18226.

MLA Handbook (7^th Edition):

Saboori, Anooshiravan. “Verification and Enforcement of State-Based Notions of Opacity in Discrete Event Systems.” 2011. Web. 02 Mar 2021.

Vancouver:

Saboori A. Verification and Enforcement of State-Based Notions of Opacity in Discrete Event Systems. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2011. [cited 2021 Mar 02]. Available from: http://hdl.handle.net/2142/18226.

Council of Science Editors:

Saboori A. Verification and Enforcement of State-Based Notions of Opacity in Discrete Event Systems. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2011. Available from: http://hdl.handle.net/2142/18226

University of Illinois – Urbana-Champaign

16. Liu, Nanjun. Learning identification and control for repetitive linear time-varying systems.

Degree: PhD, 0133, 2014, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/50586

► There are many manufacturing systems that can be described as Linear Time-Varying (LTV) systems that have large parameter variations. When using a feedback controller for… (more)

▼ There are many manufacturing systems that can be described as Linear Time-Varying (LTV) systems that have large parameter variations. When using a feedback controller for these systems, the lag in transient tracking response is always inevitable. The high-level precision tracking requirements of these systems provide new challenges in algorithm development. In this research, we consider identification and precise motion control for repetitive LTV systems. In particular, we focus on the iterative learning concept, which capitalizes on the repetition of task to update and improve identification and control with each trial. This concept is originally developed from Iterative Learning Control (ILC), which reduces the tracking error of the current iteration by incorporating information learnt from previous executions. In this research, we explore the extension of the ILC concept to both identification and control. This dissertation develops two contributions to the identification and control of repetitive LTV systems. First, an Iterative Learning Identification (ILI) algorithm is developed for identifying the parameters of repetitive LTV systems. The proposed ILI scheme takes advantage of the repetitive nature of the system, and non-causal data is used to minimize the estimation transient. The design, analysis, simulation and experimental results for ILI on LTV systems are presented in the thesis. Second, we integrate the identification with norm-optimal ILC design approach. These techniques are used to improve the convergence speed of norm-optimal ILC when the LTV model of the system is not initially available. The integrated ILI and ILC is applied to a pick and place robot with a time-varying mass and yields an improved convergence speed over an ILC controller developed from a recursive model. Advisors/Committee Members: Champaign%22%20%2Bcontributor%3A%28%22Alleyne%2C%20Andrew%20G.%22%29&pagesize-30">Alleyne, Andrew G. (advisor), Champaign%22%20%2Bcontributor%3A%28%22Alleyne%2C%20Andrew%20G.%22%29&pagesize-30">Alleyne, Andrew G. (Committee Chair), Champaign%22%20%2Bcontributor%3A%28%22Beck%2C%20Carolyn%20L.%22%29&pagesize-30">Beck, Carolyn L. (committee member), Champaign%22%20%2Bcontributor%3A%28%22Sreenivas%2C%20Ramavarapu%20S.%22%29&pagesize-30">Sreenivas, Ramavarapu S. (committee member), Champaign%22%20%2Bcontributor%3A%28%22Salapaka%2C%20Srinivasa%20M.%22%29&pagesize-30">Salapaka, Srinivasa M. (committee member).

Subjects/Keywords: System Identification; Linear Systems; Iterative Learning Control

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Liu, N. (2014). Learning identification and control for repetitive linear time-varying systems. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/50586

Chicago Manual of Style (16^th Edition):

Liu, Nanjun. “Learning identification and control for repetitive linear time-varying systems.” 2014. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed March 02, 2021. http://hdl.handle.net/2142/50586.

MLA Handbook (7^th Edition):

Liu, Nanjun. “Learning identification and control for repetitive linear time-varying systems.” 2014. Web. 02 Mar 2021.

Vancouver:

Liu N. Learning identification and control for repetitive linear time-varying systems. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2014. [cited 2021 Mar 02]. Available from: http://hdl.handle.net/2142/50586.

Council of Science Editors:

Liu N. Learning identification and control for repetitive linear time-varying systems. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2014. Available from: http://hdl.handle.net/2142/50586

University of Illinois – Urbana-Champaign

17. Islam, Mazharul. Studies on gait control using a portable pneumatically powered ankle-foot orthosis (PPAFO) during human walking.

Degree: PhD, Mechanical Engineering, 2016, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/90719

► A powered ankle-foot orthosis (AFO) can be very useful for people with neuromuscular injury. Control of powered AFOs will be more efficient to provide assistance… (more)

▼ A powered ankle-foot orthosis (AFO) can be very useful for people with neuromuscular injury. Control of powered AFOs will be more efficient to provide assistance to individuals with lower limb muscle impairments if we can identify different gait events during walking. A walking or gait cycle can be divided into multiple phases and sub-phases by proper gait event detection, and these phases/sub-phases are associated with one of the three main functional tasks during the gait cycle: loading response, forward propulsion, and limb advancement. The gait cycle of one limb can also be characterized by examining the limb’s behavior over one stride, which can be quantified as 0% to 100% of a gait cycle (GC). One easy approach to identify gait events is by checking whether sensor signals go above/below a predetermined threshold. By estimation of a walker’s instantaneous state, as represented by a specific percentage of the gait cycle (from states 0 to 100, which correlate with 0% to 100% GC), we can efficiently detect the various gait events more accurately. Our Human Dynamics and Controls Laboratory previously developed the portable pneumatically powered ankle-foot orthosis (PPAFO), which was capable of providing torque in both plantarflexion and dorsiflexion directions at the ankle. There were three types of sensor attached with the PPAFO (two force sensitive resistors and an angle sensor). In this dissertation, three aspects of effective control strategies for the PPAFO have been proposed. In the first study, two improved and reliable state estimators (Modified Fractional Time (MFT) and Artificial Neural Network (ANN)) were proposed for identifying when the limb with the PPAFO was at a certain percentage of the gait cycle. A correct estimation of percentage of gait cycle will assist with detecting specific gait events more accurately. The performance of new estimators was compared to a previously developed Fractional Time state estimation technique. To control a powered AFO using these estimators, however, detection of proper actuation timing is necessary. In the second study, a supervised learning algorithm to classify the appropriate start timing for plantarflexor actuation was proposed. Proper actuation timing has only been addressed in the literature in terms of functional efficiency or metabolic cost during walking. In this study, we will explore identifying the plantarflexor actuation timing in terms of biomechanics outcomes of human walking using a machine learning based algorithm. The third study investigated the recognition of different gait modes encountered during walking. The actuation scheme plays a significant role in walking on level ground, stair descent or stair ascent modes. The wrong actuation scheme for a given mode can cause falls or trips. A gait mode recognition technique was developed for detecting these different modes by attaching an inertial measurement unit and using a classifier based on artificial neural networks. This new algorithm improves upon the current one step delay limitation found as… Advisors/Committee Members: Champaign%22%20%2Bcontributor%3A%28%22Hsiao-Wecksler%2C%20Elizabeth%20T%22%29&pagesize-30">Hsiao-Wecksler, Elizabeth T (advisor), Champaign%22%20%2Bcontributor%3A%28%22Hsiao-Wecksler%2C%20Elizabeth%20T%22%29&pagesize-30">Hsiao-Wecksler, Elizabeth T (Committee Chair), Champaign%22%20%2Bcontributor%3A%28%22Mehta%2C%20Prashant%22%29&pagesize-30">Mehta, Prashant (committee member), Champaign%22%20%2Bcontributor%3A%28%22Salapaka%2C%20Srinivasa%22%29&pagesize-30">Salapaka, Srinivasa (committee member), Champaign%22%20%2Bcontributor%3A%28%22Sreenivas%2C%20Ramavarapu%20S%22%29&pagesize-30">Sreenivas, Ramavarapu S (committee member).

Subjects/Keywords: Ankle-Foot Orthosis; Exoskeleton; Walking; Human Assistive Robots, Assistive Devices; Medical Device

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Islam, M. (2016). Studies on gait control using a portable pneumatically powered ankle-foot orthosis (PPAFO) during human walking. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/90719

Chicago Manual of Style (16^th Edition):

Islam, Mazharul. “Studies on gait control using a portable pneumatically powered ankle-foot orthosis (PPAFO) during human walking.” 2016. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed March 02, 2021. http://hdl.handle.net/2142/90719.

MLA Handbook (7^th Edition):

Islam, Mazharul. “Studies on gait control using a portable pneumatically powered ankle-foot orthosis (PPAFO) during human walking.” 2016. Web. 02 Mar 2021.

Vancouver:

Islam M. Studies on gait control using a portable pneumatically powered ankle-foot orthosis (PPAFO) during human walking. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2016. [cited 2021 Mar 02]. Available from: http://hdl.handle.net/2142/90719.

Council of Science Editors:

Islam M. Studies on gait control using a portable pneumatically powered ankle-foot orthosis (PPAFO) during human walking. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2016. Available from: http://hdl.handle.net/2142/90719

18. McGovern, Megan E. Non-destructive quantitative assessment of oxidation in aged and rejuvenated asphalt concrete pavements using a non-collinear wave mixing approach.

Degree: PhD, Systems & Entrepreneurial Engr, 2016, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/92755

► Oxidative aging in asphalt concrete pavements is one of the chief contributors to pavement degradation. Oxidation contributes to the formation of a diffuse micro-flaw population… (more)

▼ Oxidative aging in asphalt concrete pavements is one of the chief contributors to pavement degradation. Oxidation contributes to the formation of a diffuse micro-flaw population in the mastic. This damage is primarily concentrated at the top (surface) of the pavement, where exposure to oxygen is the greatest. These flaws serve as the nuclei to crack formation and propagation, and adversely affect the pavement's structural integrity. It is more cost effective to perform maintenance when the pavement contains relatively little damage, than it is to defer maintenance until more drastic measures must be taken. Currently, engineers lack the proper tools for non-destructive, quick, and reliable inspection. The work in this report addresses this need by employing non-collinear wave mixing, a nonlinear acoustic technique, to evaluate the level of oxidation of the pavement. To implement the nonlinear technique, the linear acoustic parameters, i.e., dilatational and shear velocities and attenuations, of asphalt concrete specimens with various levels of oxidative aging were characterized. In non-collinear wave mixing, two waves are propagated so that they cross paths. Under the right conditions, these two waves will interact to produce a third wave. Taking advantage of critically refracted longitudinal waves enabled the non-collinear wave mixing measurements to be taken from the pavement surface. Two nonlinear parameters were measured as a function of oxidative aging: the efficiency of interaction, β/β0 , and the frequency at which the interaction takes place, ƒ2/ƒ1. A nonlinear damage characterization curve was introduced, which is generated for a particular mixture under laboratory conditions, by plotting β/β0 versus ƒ2/ƒ1 for various levels of oxidative aging. Field pavement measurements of (β/β0, ƒ2/ƒ1) can then be referenced against the nonlinear damage characterization curve to evaluate the state of the pavement. The testing set-up was configured to be one-sided, hence truly non-destructive, via the use of these subsurface waves. Two data-collection approaches are presented, which can be used even if the linear acoustic properties are unknown a priori, for practical field implementation. The efficacy of an asphalt rejuvenation product was also studied using this technique. Pavement engineers can thus continuously monitor the pavement and make decisions (such as the application of rejuvenators) to prolong its service life. Advisors/Committee Members: Champaign%22%20%2Bcontributor%3A%28%22Reis%2C%20Henrique%22%29&pagesize-30">Reis, Henrique (advisor), Champaign%22%20%2Bcontributor%3A%28%22Reis%2C%20Henrique%22%29&pagesize-30">Reis, Henrique (Committee Chair), Champaign%22%20%2Bcontributor%3A%28%22Buttlar%2C%20William%20G.%22%29&pagesize-30">Buttlar, William G. (committee member), Champaign%22%20%2Bcontributor%3A%28%22O%27Brien%2C%20William%20%20D.%22%29&pagesize-30">O'Brien, William D. (committee member), Champaign%22%20%2Bcontributor%3A%28%22Sreenivas%2C%20Ramavarapu%20S.%22%29&pagesize-30">Sreenivas, Ramavarapu S. (committee member), Champaign%22%20%2Bcontributor%3A%28%22Thompson%2C%20Marshall%20R.%22%29&pagesize-30">Thompson, Marshall R. (committee member).

Subjects/Keywords: Non-collinear wave mixing; Nonlinear acoustics; Asphalt pavements; Rejuvenators; Oxidation; Oxidative aging; Non-destructive testing; Damage characterization; Quantitative assessment; One-sided

11 more images…

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

McGovern, M. E. (2016). Non-destructive quantitative assessment of oxidation in aged and rejuvenated asphalt concrete pavements using a non-collinear wave mixing approach. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/92755

Chicago Manual of Style (16^th Edition):

McGovern, Megan E. “Non-destructive quantitative assessment of oxidation in aged and rejuvenated asphalt concrete pavements using a non-collinear wave mixing approach.” 2016. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed March 02, 2021. http://hdl.handle.net/2142/92755.

MLA Handbook (7^th Edition):

McGovern, Megan E. “Non-destructive quantitative assessment of oxidation in aged and rejuvenated asphalt concrete pavements using a non-collinear wave mixing approach.” 2016. Web. 02 Mar 2021.

Vancouver:

McGovern ME. Non-destructive quantitative assessment of oxidation in aged and rejuvenated asphalt concrete pavements using a non-collinear wave mixing approach. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2016. [cited 2021 Mar 02]. Available from: http://hdl.handle.net/2142/92755.

Council of Science Editors:

McGovern ME. Non-destructive quantitative assessment of oxidation in aged and rejuvenated asphalt concrete pavements using a non-collinear wave mixing approach. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2016. Available from: http://hdl.handle.net/2142/92755

University of Illinois – Urbana-Champaign

19. Moon, Jae-Sung. Stability analysis and control for bipedal locomotion using energy methods.

Degree: PhD, 3846, 2011, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/24253

► In this thesis, we investigate the stability of limit cycles of passive dynamic walking. The formation process of the limit cycles is approached from the… (more)

▼ In this thesis, we investigate the stability of limit cycles of passive dynamic walking. The formation process of the limit cycles is approached from the view of energy interaction. We introduce for the first time the notion of the energy portrait analysis originated from the phase portrait. The energy plane is spanned by the total energy of the system and its derivative, and different energy trajectories represent the energy portrait in the plane. One of the advantages of this method is that the stability of the limit cycles can be easily shown in a 2D plane regardless of the dimension of the system. The energy portrait of passive dynamic walking reveals that the limit cycles are formed by the interaction between energy loss and energy gain during each cycle, and they are equal at equilibria in the energy plane. In addition, the energy portrait is exploited to examine the existence of semi-passive limit cycles generated using the energy supply only at the take-off phase. It is shown that the energy interaction at the ground contact compensates for the energy supply, which makes the total energy invariant yielding limit cycles. This result means that new limit cycles can be generated according to the energy supply without changing the ground slope, and level ground walking, whose energy gain at the contact phase is always zero, can be achieved without actuation during the swing phase. We design multiple switching controllers by virtue of this property to increase the basin of attraction. Multiple limit cycles are linearized using the Poincare map method, and the feedback gains are computed taking into account the robustness and actuator saturation. Once a trajectory diverges from a basin of attraction, we switch the current controller to one that includes the trajectory in its basin of attraction. Numerical simulations confirm that a set of limit cycles can be used to increase the basin of attraction further by switching the controllers one after another. To enhance our knowledge of the limit cycles, we performed sophisticated simulations and found all stable and unstable limit cycles from the various ground slopes not only for the symmetric legs but also for the unequal legs that cause gait asymmetries. As a result, we present a novel classification of the passive limit cycles showing six distinct groups that are consecutive and cyclical. Advisors/Committee Members: Champaign%22%20%2Bcontributor%3A%28%22Spong%2C%20Mark%20W.%22%29&pagesize-30">Spong, Mark W. (advisor), Champaign%22%20%2Bcontributor%3A%28%22Stipanovi%3F%3F%2C%20Du%3F%3Fan%20M.%22%29&pagesize-30">Stipanovi??, Du??an M. (Committee Chair), Champaign%22%20%2Bcontributor%3A%28%22Spong%2C%20Mark%20W.%22%29&pagesize-30">Spong, Mark W. (committee member), Champaign%22%20%2Bcontributor%3A%28%22Hsiao-Wecksler%2C%20Elizabeth%20T.%22%29&pagesize-30">Hsiao-Wecksler, Elizabeth T. (committee member), Champaign%22%20%2Bcontributor%3A%28%22Hutchinson%2C%20Seth%20A.%22%29&pagesize-30">Hutchinson, Seth A. (committee member), Champaign%22%20%2Bcontributor%3A%28%22Sreenivas%2C%20Ramavarapu%20S.%22%29&pagesize-30">Sreenivas, Ramavarapu S. (committee member).

Subjects/Keywords: Passive dynamic walking; Bipedal locomotion; Walking robots; Energy portrait analysis; Multiple switching control; Bifurcations and chaos; Gait asymmetries; Six stages of bifurcations

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Moon, J. (2011). Stability analysis and control for bipedal locomotion using energy methods. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/24253

Chicago Manual of Style (16^th Edition):

Moon, Jae-Sung. “Stability analysis and control for bipedal locomotion using energy methods.” 2011. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed March 02, 2021. http://hdl.handle.net/2142/24253.

MLA Handbook (7^th Edition):

Moon, Jae-Sung. “Stability analysis and control for bipedal locomotion using energy methods.” 2011. Web. 02 Mar 2021.

Vancouver:

Moon J. Stability analysis and control for bipedal locomotion using energy methods. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2011. [cited 2021 Mar 02]. Available from: http://hdl.handle.net/2142/24253.

Council of Science Editors:

Moon J. Stability analysis and control for bipedal locomotion using energy methods. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2011. Available from: http://hdl.handle.net/2142/24253

20. Gummadi, Subha R. Coding and scheduling in networks for erasures and broadcast.

Degree: PhD, 1200, 2012, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/29831

► This dissertation is concerned with the design and analysis of algorithms that address two related issues in communication networks, namely erasures and broadcast. Erasures are… (more)

▼ This dissertation is concerned with the design and analysis of algorithms that address two related issues in communication networks, namely erasures and broadcast. Erasures are an appropriate model for communication channels from a network layer perspective. A class of efficient and flexible codes known as fountain codes, is available to deal with erasures for the basic erasure channel. However, in the network applications that we consider, it remains a challenging problem to design efficient and scalable codes. For an erasure code, the efficiency of encoding and decoding algorithms is distinct from the efficiency of reconstructing erased code symbols from other code symbols, which is of importance in storage applications. In our work, we propose new codes together with algorithms to efficiently repair lost code symbols, simultaneously with low encoding and decoding complexities. Our work on codes for storage also leads us to systematic fountain codes with improved complexity. We also study the design and analysis of degree distributions for fountain codes when the receivers have side information, and we provide upper and lower bounds on the overhead. In a network with multiple hops from the source, we construct a code to import the one-hop traits of LT codes end-to-end using an idea based on online encoding, which is also one of the components of the repair algorithm for storage codes that we propose. We then consider wireless erasure networks, where local broadcast is another property which influences the role of coding beyond that of merely dealing with erasures. We show that feedback signaling is a critical factor that defines the role of coding in this situation, in the sense that it is one way to avoid the extensive feedback signaling that is necessary for routing policies. To characterize this more precisely, we consider a formal notion of restricted feedback signaling and derive the throughput of routing policies with restricted feedback on a two-hop network. This allows us to obtain a lower bound on the throughput when the losses are independent, and also to show that it is possible to have arbitrary degradation of throughput with dependent losses. Finally, we consider optimization problems involving the control of a queue whose server is defined by the broadcast property, where each service satisfies all the customers simultaneously. Customers in the queue incur holding costs. We consider two constraints on the server and derive the associated optimal controls. For the first constraint, a constant non-negative cost is charged per service whereas in the second type, we consider an online running constraint on the ability to operate the broadcast server. To address this, we solve a more general problem called the online knapsack problem where one needs to choose a sequence of actions over time, with each action incurring a stochastic cost and also consuming a resource, which is replenished stochastically over time with a given rate. The objective is to minimize the total cost subject to the constraint… Advisors/Committee Members: Champaign%22%20%2Bcontributor%3A%28%22Sreenivas%2C%20Ramavarapu%20S.%22%29&pagesize-30">Sreenivas, Ramavarapu S. (advisor), Champaign%22%20%2Bcontributor%3A%28%22Sreenivas%2C%20Ramavarapu%20S.%22%29&pagesize-30">Sreenivas, Ramavarapu S. (Committee Chair), Champaign%22%20%2Bcontributor%3A%28%22Chekuri%2C%20Chandra%20S.%22%29&pagesize-30">Chekuri, Chandra S. (committee member), Champaign%22%20%2Bcontributor%3A%28%22Hajek%2C%20Bruce%22%29&pagesize-30">Hajek, Bruce (committee member), Champaign%22%20%2Bcontributor%3A%28%22Kumar%2C%20P.%20R.%22%29&pagesize-30">Kumar, P. R. (committee member), Champaign%22%20%2Bcontributor%3A%28%22Milenkovic%2C%20Olgica%22%29&pagesize-30">Milenkovic, Olgica (committee member), Champaign%22%20%2Bcontributor%3A%28%22Srikant%2C%20Rayadurgam%22%29&pagesize-30">Srikant, Rayadurgam (committee member).

Subjects/Keywords: Erasure Codes; Wireless Broadcast; Distributed Storage; Stochastic Control; Broadcast Server; Online Knapsack Problems

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Gummadi, S. R. (2012). Coding and scheduling in networks for erasures and broadcast. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/29831

Chicago Manual of Style (16^th Edition):

Gummadi, Subha R. “Coding and scheduling in networks for erasures and broadcast.” 2012. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed March 02, 2021. http://hdl.handle.net/2142/29831.

MLA Handbook (7^th Edition):

Gummadi, Subha R. “Coding and scheduling in networks for erasures and broadcast.” 2012. Web. 02 Mar 2021.

Vancouver:

Gummadi SR. Coding and scheduling in networks for erasures and broadcast. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2012. [cited 2021 Mar 02]. Available from: http://hdl.handle.net/2142/29831.

Council of Science Editors:

Gummadi SR. Coding and scheduling in networks for erasures and broadcast. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2012. Available from: http://hdl.handle.net/2142/29831

21. Yang, Rui. New results on some quadratic programming problems.

Degree: PhD, 0127, 2013, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/45346

► In this thesis we present new effective algorithms for several special classes of quadratic programming problems. The problems we study can be classifiedinto two categories.… (more)

▼ In this thesis we present new effective algorithms for several special classes of quadratic programming problems. The problems we study can be classifiedinto two categories. The first group contains two optimization problems with binary constraints. To solve these problems, we first explore some intrinsic relation between binary quadratic problem and data clustering. Then we utilize the explored relation to develop effective approximation algorithms. For example, the first problem we consider is a special class of binary quadratic problem where the number of nonzero elements is fixed. We use convex quadratic relaxation as a geometric embedding tool to reformulate the underlying BQP as a clustering problem where the target is to find a single cluster of fixed size. A simple 2-approximation algorithm for the clustering problem is proposed. In the second project we study the Binary Matrix Factorization problem(BMF) with additional restriction that the matrix product should be binary and call it constrained binary matrix factorization(CBMF). We propose alternating update procedures for CBMF where we actually solve a binary LP subproblem to update the involved matrix argument. We have both a deterministic 2-approximation and also a randomized approximation algorithm. The deterministic algorithm has a complexity exponential in k, while the randomized algorithm runs in O(kmn) time. The second part of this thesis is about portfolio selection under some (hard) realistic setting. We first considered a new approach for portfolio selection problem with cardinality and thresholds constraints that employs the new technique (based on lp penalty with 0 < p < 1) for finding sparse solutions. The key idea is to interpret the cardinality constraint as a constraint on the sparsity of the solution. This allows us to use the recently developed techniques for sparse solutions in linear and quadratic optimization problems to find a solution that satisfies the cardinality constraint. Numerical experiments indicate that our proposed Hybrid algorithm is fast, and able to provide good approximation solution that has attractive features in financial applications. In the last project we developed an online learning algorithm for quadratic programming problems. Our learning-based algorithm works by constructing a pricing vector from a training problem of previous period and the price vector is used to make decisions sequentially. Under the distribution-free random permutation model and some mild assumptions, we propose a 1 − O(ϵ) learning algorithm for this online problem. The results can be applied to make better decisions when facing online problems with quadratic objective function. Advisors/Committee Members: Champaign%22%20%2Bcontributor%3A%28%22Peng%2C%20Jiming%22%29&pagesize-30">Peng, Jiming (advisor), Champaign%22%20%2Bcontributor%3A%28%22Peng%2C%20Jiming%22%29&pagesize-30">Peng, Jiming (Committee Chair), Champaign%22%20%2Bcontributor%3A%28%22Sreenivas%2C%20Ramavarapu%20S.%22%29&pagesize-30">Sreenivas, Ramavarapu S. (committee member), Champaign%22%20%2Bcontributor%3A%28%22Ouyang%2C%20Yanfeng%22%29&pagesize-30">Ouyang, Yanfeng (committee member), Champaign%22%20%2Bcontributor%3A%28%22Nedich%2C%20Angelia%22%29&pagesize-30">Nedich, Angelia (committee member).

Subjects/Keywords: optimization; quadratic programming; matrix factorization; online algorithm; portfolio selection

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Yang, R. (2013). New results on some quadratic programming problems. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/45346

Chicago Manual of Style (16^th Edition):

Yang, Rui. “New results on some quadratic programming problems.” 2013. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed March 02, 2021. http://hdl.handle.net/2142/45346.

MLA Handbook (7^th Edition):

Yang, Rui. “New results on some quadratic programming problems.” 2013. Web. 02 Mar 2021.

Vancouver:

Yang R. New results on some quadratic programming problems. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2013. [cited 2021 Mar 02]. Available from: http://hdl.handle.net/2142/45346.

Council of Science Editors:

Yang R. New results on some quadratic programming problems. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2013. Available from: http://hdl.handle.net/2142/45346

22. Ru, Yu. State estimation and sensor selection in discrete event systems modeled by Petri nets.

Degree: PhD, 1200, 2010, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/16934

► A discrete event system (DES) is a dynamic system that evolves in accordance with the abrupt occurrence, at possibly unknown and irregular intervals, of physical… (more)

▼ A discrete event system (DES) is a dynamic system that evolves in accordance with the abrupt occurrence, at possibly unknown and irregular intervals, of physical events. Such systems arise in a variety of contexts, such as energy distribution networks, computer and communication networks, automated manufacturing systems, air traffic control systems, highly integrated command, control, communication, and information (C3I) systems, advanced monitoring and control systems in automobiles or large buildings, intelligent transportation systems, and distributed software systems. Petri net models are widely used for modeling such systems, and consist of two key components: places (which typically model buffers that store system resources) and transitions (which typically model activities that move and process resources across places in the system). Sensors in Petri nets come in two major types: place sensors (i.e., sensors that indicate the number of resources in a particular place, e.g., vision sensors) and transition sensors (i.e., sensors that can detect whether a transition in a given subset of transitions has occurred, e.g., motion sensors). In this dissertation, we focus on two sensor related problems in discrete event systems modeled by Petri nets: (i) State estimation. When only transition sensors are available, sensor information can be very limited because there can be uncertainty due to unobservable events or events that generate the same sensor information. As a result, multiple states could be possible given sensing information, and we show in this dissertation that the number of possible states can grow at most polynomially (but not exponentially) as a function of the length of the observation sequence. These polynomial bounds can guide the design of systems, especially when trying to configure the sensors in order to reduce the uncertainty introduced in the state estimation stage. The polynomial bounds can also be used in analyzing algorithms in the context of state estimation, fault diagnosis, supervisory control, and even reachability checking. (ii) Sensor selection. If there are only transition sensors with uncertainty, the system state is usually not unique. If we have the freedom to configure sensors (e.g., when we design the system), we might want to add a minimal number of sensors to ensure that the current system state can be uniquely reconstructed based on the system model and the initial state. The design consideration is motivated by supervisory control applications, interface design for safety critical systems, and certain fault detection and correction settings. In its most general form, this type of sensor selection problem can involve both place sensors and transition sensors. We study how to choose a minimum number of place sensors and transition sensors (or a set of place sensors and transition sensors of minimal cost) while ensuring that the system state can be determined uniquely given sensing information and knowledge of the system model; this property is called structural… Advisors/Committee Members: Champaign%22%20%2Bcontributor%3A%28%22Basar%2C%20Tamer%22%29&pagesize-30">Basar, Tamer (advisor), Champaign%22%20%2Bcontributor%3A%28%22Basar%2C%20Tamer%22%29&pagesize-30">Basar, Tamer (Committee Chair), Champaign%22%20%2Bcontributor%3A%28%22Hadjicostis%2C%20Christoforos%20N.%22%29&pagesize-30">Hadjicostis, Christoforos N. (committee member), Champaign%22%20%2Bcontributor%3A%28%22Liberzon%2C%20Daniel%20M.%22%29&pagesize-30">Liberzon, Daniel M. (committee member), Champaign%22%20%2Bcontributor%3A%28%22Sreenivas%2C%20Ramavarapu%20S.%22%29&pagesize-30">Sreenivas, Ramavarapu S. (committee member).

Subjects/Keywords: Discrete event systems; Petri nets; State estimation; Sensor selection; Approximation algorithms

10 more images…

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Ru, Y. (2010). State estimation and sensor selection in discrete event systems modeled by Petri nets. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/16934

Chicago Manual of Style (16^th Edition):

Ru, Yu. “State estimation and sensor selection in discrete event systems modeled by Petri nets.” 2010. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed March 02, 2021. http://hdl.handle.net/2142/16934.

MLA Handbook (7^th Edition):

Ru, Yu. “State estimation and sensor selection in discrete event systems modeled by Petri nets.” 2010. Web. 02 Mar 2021.

Vancouver:

Ru Y. State estimation and sensor selection in discrete event systems modeled by Petri nets. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2010. [cited 2021 Mar 02]. Available from: http://hdl.handle.net/2142/16934.

Council of Science Editors:

Ru Y. State estimation and sensor selection in discrete event systems modeled by Petri nets. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2010. Available from: http://hdl.handle.net/2142/16934

23. Lee, Yu-Ching. Global solution to parametric complementarity constrained programs and applications in optimal parameter selection.

Degree: PhD, 0127, 2013, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/42414

► This thesis contains five chapters. The notations, terminologies, definitions and numbering of equations, theorems and algorithms are independent in each chapter. Chapter 1 provides a… (more)

▼ This thesis contains five chapters. The notations, terminologies, definitions and numbering of equations, theorems and algorithms are independent in each chapter. Chapter 1 provides a fundamental introduction and contextual discussions to provide a unified theme for the subsequent chapters into a complete work. Chapters 2, 3 and 4 are arranged for ease of reading and understanding separately. Future research directions are proposed in Chapter 5 based on our findings. Chapter 1, Parametric Complementarity Constrained Programs – a Review of Methodologies, summarizes the basic techniques that are used in the algorithms for solving the mathematical program with complementarity constraints (MPCC), which is also referred to as the mathematical program with equilibrium constraints (MPEC) interchangeably in the chapter. We review the philosophy and main techniques behind the existing algorithms developed for solving MPEC. This background knowledge is followed by a section focusing on the methodologies for solving the specific class of problems that are uni-parametric, bi-parametric, and multi-parametric complementarity constrained. One of the main sources of the parametric complementarity constrained program, inverse optimization, is defined in this chapter. A linear program with linear complementarity constraints (LPCC) is among the simplest mathematical programs with complementarity constraints. Yet the global solution of the LPCC remains difficult to find and/or verify. In Chapter 2, Global Solution of Bi-Parametric Linear Complementarity Constrained Linear Programs, we study a specific type of the LPCC which we term a bi-parametric LPCC. Reformulating the bi-parametric LPCC as a non-convex quadratically constrained program, we develop a domain-partitioning algorithm that solves a series of linear subprograms and/or convex quadratically constrained subprograms obtained by the relaxations of the complementarity constraint. We control the domain on which the partitioning is done via a pair of scalars that define the slope and intercept of a line in the bi-parametric space. Numerical results of the algorithm are presented. An important application of bi-parametric LPCC is the Cross-validated Support Vector Machine Regression Parameters Selection Problem. The Support vector machine regression is a robust regression method to minimize the sum of deducted residuals, and thus is less sensitive to changes of data points near the regression hyperplane than the standard regression method. Two design parameters, the insensitive tube size and the weight assigned to the regression error, are selected by users via a cross validation technique to gain better forecasts. The cross-validated parameter selection procedure can be formulated as a bi-level optimization problem, which then is equivalently reformulated as an LPCC. In Chapter 3, we propose a two-stage global optimization algorithm to solve this LPCC. The algorithm exhausts invariancy regions without explicitly identifying the edges of the regions on the parameter plane. This… Advisors/Committee Members: Champaign%22%20%2Bcontributor%3A%28%22Pang%2C%20Jong-Shi%22%29&pagesize-30">Pang, Jong-Shi (advisor), Champaign%22%20%2Bcontributor%3A%28%22Pang%2C%20Jong-Shi%22%29&pagesize-30">Pang, Jong-Shi (Committee Chair), Champaign%22%20%2Bcontributor%3A%28%22Nedich%2C%20Angelia%22%29&pagesize-30">Nedich, Angelia (committee member), Champaign%22%20%2Bcontributor%3A%28%22Sreenivas%2C%20Ramavarapu%20S.%22%29&pagesize-30">Sreenivas, Ramavarapu S. (committee member), Champaign%22%20%2Bcontributor%3A%28%22Su%2C%20Che-Lin%22%29&pagesize-30">Su, Che-Lin (committee member).

Subjects/Keywords: Optimization; Parameter selection; Mathematical program with complementarity constraints; Global optimization algorithm; Support vector machine regression; Pure characteristics demand model

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Lee, Y. (2013). Global solution to parametric complementarity constrained programs and applications in optimal parameter selection. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/42414

Chicago Manual of Style (16^th Edition):

Lee, Yu-Ching. “Global solution to parametric complementarity constrained programs and applications in optimal parameter selection.” 2013. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed March 02, 2021. http://hdl.handle.net/2142/42414.

MLA Handbook (7^th Edition):

Lee, Yu-Ching. “Global solution to parametric complementarity constrained programs and applications in optimal parameter selection.” 2013. Web. 02 Mar 2021.

Vancouver:

Lee Y. Global solution to parametric complementarity constrained programs and applications in optimal parameter selection. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2013. [cited 2021 Mar 02]. Available from: http://hdl.handle.net/2142/42414.

Council of Science Editors:

Lee Y. Global solution to parametric complementarity constrained programs and applications in optimal parameter selection. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2013. Available from: http://hdl.handle.net/2142/42414

24. Senalik, Christopher. Detection and assessment of wood decay – glulam beams and wooden utility poles.

Degree: PhD, 3846, 2013, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/44281

► This report documents the development of acoustic and ultrasonic inspection methods on wooden glulam beams and utility poles. All beams and poles examined where composed… (more)

▼ This report documents the development of acoustic and ultrasonic inspection methods on wooden glulam beams and utility poles. All beams and poles examined where composed of Douglas-fir. The report begins with a description of the structure of trees, the mechanical behavior of wood subjected to rot, and current utility pole inspection methods. Background regarding inspection methodology on wood structures is provided. Cross-sectional images of the glulam beams and the utility poles used in this study were obtained through the use of computerized axial tomography (CAT or CT) scans. Areas of decay were identified using the CT scan images. Two methods of detecting defects within glulam beams are described: ultrasonic through-transmission and impact-echo. The analysis of the wooden utility poles starts with the development of a two-dimensional, finite difference time domain (FDTD) simulation to model wave propagation through the pole. The simulation is validated against empirical results. The through-transmission technique used on the glulam beam locates rot through the use of the highest magnitude frequency and area under the power spectrum density curve. A 100 kHz signal was sent through the glulam beam. In areas devoid of decay, the received frequency was approximately 100 kHz. In areas where decay was identified, the frequency of highest magnitude shifted lower towards 85 kHz. Also, the area under the power spectrum density curve of the received signal was greatly diminished in areas of decay. The impact-echo method used on the glulam beams locates rot through the use of the attenuation rate. An accelerometer was affixed to the surface of the beam. A ball bearing was dropped from 200 mm above the surface next to the accelerometer. The signal was recorded. A spectrogram of the received signal was developed, and the mean rate of attenuation of the frequency range 500 Hz to 20 kHz was calculated. An attenuation rate of 1.17 Nepers per millisecond was found to be the threshold indicative of the presence of rot. Attenuation rates greater than the threshold indicated the presence of rot; lower indicated sound wood. The threshold had an overall error rate of 7.2%. The report then shifts to developing a two-dimensional, finite difference time domain simulation that can model wave behavior through a wood pole cross-section. The model incorporates several features that have not been included in previous analyses. These features include: a frequency dispersive model of wave velocity and attenuation, cross-sectional density and geometry information collected directly from CT scans of the utility poles, a perfectly matched layer used to model the behavior or rot, and a center point formulation that allows waves to pass through the center of a cylindrically orthotropic medium. The simulation is validated against the waveform behavior predicted by an analytical model and against experimental data collected from impact through-transmission testing of three actual utility pole specimens. Defects of… Advisors/Committee Members: Champaign%22%20%2Bcontributor%3A%28%22Reis%2C%20Henrique%20M.%22%29&pagesize-30">Reis, Henrique M. (advisor), Champaign%22%20%2Bcontributor%3A%28%22Reis%2C%20Henrique%20M.%22%29&pagesize-30">Reis, Henrique M. (Committee Chair), Champaign%22%20%2Bcontributor%3A%28%22Hall%2C%20Wilfred%20B.%22%29&pagesize-30">Hall, Wilfred B. (committee member), Champaign%22%20%2Bcontributor%3A%28%22Kuchma%2C%20Daniel%20A.%22%29&pagesize-30">Kuchma, Daniel A. (committee member), Champaign%22%20%2Bcontributor%3A%28%22Sreenivas%2C%20Ramavarapu%20S.%22%29&pagesize-30">Sreenivas, Ramavarapu S. (committee member).

Subjects/Keywords: Non-Destructive Evaluation; Wood; Douglas-fir; Brown Rot Decay; Finite Difference; Utility Poles; Glulam Beams; Wave Propagation; Acousto-ultrasonic; Dispersion

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Senalik, C. (2013). Detection and assessment of wood decay – glulam beams and wooden utility poles. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/44281

Chicago Manual of Style (16^th Edition):

Senalik, Christopher. “Detection and assessment of wood decay – glulam beams and wooden utility poles.” 2013. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed March 02, 2021. http://hdl.handle.net/2142/44281.

MLA Handbook (7^th Edition):

Senalik, Christopher. “Detection and assessment of wood decay – glulam beams and wooden utility poles.” 2013. Web. 02 Mar 2021.

Vancouver:

Senalik C. Detection and assessment of wood decay – glulam beams and wooden utility poles. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2013. [cited 2021 Mar 02]. Available from: http://hdl.handle.net/2142/44281.

Council of Science Editors:

Senalik C. Detection and assessment of wood decay – glulam beams and wooden utility poles. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2013. Available from: http://hdl.handle.net/2142/44281

25. Valicka, Christopher. Multi-objective control and coordination of multi-agent systems.

Degree: PhD, 3846, 2014, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/46676

► In this dissertation, control methodologies for systems of multiple mobile agents facing multiple objectives are considered. Carefully constructed objective functions for agents interested in any… (more)

Subjects/Keywords: Multiattribute utility copula; multi-objective control; multi-agent system; multi-robot testbed; dynamic coverage control

10 more images…

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Valicka, C. (2014). Multi-objective control and coordination of multi-agent systems. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/46676

Chicago Manual of Style (16^th Edition):

Valicka, Christopher. “Multi-objective control and coordination of multi-agent systems.” 2014. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed March 02, 2021. http://hdl.handle.net/2142/46676.

MLA Handbook (7^th Edition):

Valicka, Christopher. “Multi-objective control and coordination of multi-agent systems.” 2014. Web. 02 Mar 2021.

Vancouver:

Valicka C. Multi-objective control and coordination of multi-agent systems. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2014. [cited 2021 Mar 02]. Available from: http://hdl.handle.net/2142/46676.

Council of Science Editors:

Valicka C. Multi-objective control and coordination of multi-agent systems. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2014. Available from: http://hdl.handle.net/2142/46676

26. Truong, Anh. Learning from expert advice framework: Algorithms and applications.

Degree: PhD, Industrial Engineering, 2018, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/100961

► Online recommendation systems have been widely used by retailers, digital marketing, and especially in e-commerce applications. Popular sites such as Netflix and Amazon suggest movies… (more)

▼ Online recommendation systems have been widely used by retailers, digital marketing, and especially in e-commerce applications. Popular sites such as Netflix and Amazon suggest movies or general merchandise to their clients based on recommendations from peers. At core of recommendation systems resides a prediction algorithm, which based on recommendations received from a set of experts (users), recommends objects to other users. After a user ``consumes" an object, his feedback provided to the system is used to assess the performance of experts at that round and adjust the predictions of the recommendation system for the future rounds. This so-called ``learning from expert advice'' framework has been extensively studied in the literature. In this dissertation, we investigate various settings and applications ranging from partial information, adversarial scenarios, to limited resources. We propose provable algorithms for such systems, along with theoretical and experimental results. In the first part of the thesis, we focus our attention to a generalized model of learning from expert advice in which experts could abstain from participating at some rounds. Our proposed online algorithm falls into the class of weighted average predictors and uses a time varying multiplicative weight update rule. This update rule changes the weight of an expert based on his relative performance compared to the average performance of available experts at the current round. We prove the convergence of our algorithm to the best expert, defined in terms of both availability and accuracy, in the stochastic setting. Next, we study the optimal adversarial strategies against the weighted average prediction algorithm. All but one expert are honest and the malicious expert's goal is to sabotage the performance of the algorithm by strategically providing dishonest recommendations. We formulate the problem as a Markov decision process (MDP) and apply policy iteration to solve it. For the logarithmic loss, we prove that the optimal strategy for the adversary is the greedy policy, whereas for the absolute loss, in the 2-experts, discounted cost setting, we prove that the optimal strategy is a threshold policy. We extend the results to the infinite horizon problem and find the exact thresholds for the stationary optimal policy. As an effort to investigate the extended problem, we use a mean field approach in the N-experts setting to find the optimal strategy when the predictions of the honest experts are i.i.d. In addition to designing an effective weight update rule and investigating optimal strategies of malicious experts, we also consider active learning applications for learning with expert advice framework. In this application, the target is to reduce the number of labeling while still keeping the regret bound as small as possible. We proposed two algorithms, EPSL and EPAL, which are able to efficiently request label for each object. In essence, the idea of two algorithms is to examine the opinion ranges of experts, and decide to… Advisors/Committee Members: Champaign%22%20%2Bcontributor%3A%28%22Kiyavash%2C%20Negar%22%29&pagesize-30">Kiyavash, Negar (advisor), Champaign%22%20%2Bcontributor%3A%28%22Kiyavash%2C%20Negar%22%29&pagesize-30">Kiyavash, Negar (Committee Chair), Champaign%22%20%2Bcontributor%3A%28%22Sreenivas%2C%20Ramavarapu%20S.%22%29&pagesize-30">Sreenivas, Ramavarapu S. (committee member), Champaign%22%20%2Bcontributor%3A%28%22Do%2C%20Minh%22%29&pagesize-30">Do, Minh (committee member), Champaign%22%20%2Bcontributor%3A%28%22Marla%2C%20Lavanya%22%29&pagesize-30">Marla, Lavanya (committee member), Champaign%22%20%2Bcontributor%3A%28%22Etesami%2C%20S.%20Rasoul%22%29&pagesize-30">Etesami, S. Rasoul (committee member).

Subjects/Keywords: Learning with expert advice; sleeping expert; adversarial strategies; malicious experts; MDP; efficient labeling; simple regret

8 more images…

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Truong, A. (2018). Learning from expert advice framework: Algorithms and applications. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/100961

Chicago Manual of Style (16^th Edition):

Truong, Anh. “Learning from expert advice framework: Algorithms and applications.” 2018. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed March 02, 2021. http://hdl.handle.net/2142/100961.

MLA Handbook (7^th Edition):

Truong, Anh. “Learning from expert advice framework: Algorithms and applications.” 2018. Web. 02 Mar 2021.

Vancouver:

Truong A. Learning from expert advice framework: Algorithms and applications. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2018. [cited 2021 Mar 02]. Available from: http://hdl.handle.net/2142/100961.

Council of Science Editors:

Truong A. Learning from expert advice framework: Algorithms and applications. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2018. Available from: http://hdl.handle.net/2142/100961

27. Srivastava, Kunal. Distributed optimization with applications to sensor networks and machine learning.

Degree: PhD, 3846, 2012, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/29504

► This dissertation deals with developing optimization algorithms which can be distributed over a network of computational nodes. Specifically we develop distributed algorithms for the special… (more)

▼ This dissertation deals with developing optimization algorithms which can be distributed over a network of computational nodes. Specifically we develop distributed algorithms for the special class when the optimization problem of interest has a separable structure. In this case the objective function can be written as a sum of local convex objective functions. Each computational node has knowledge of its own local objective function and its local constraint set and needs to cooperatively solve the optimization problem under this information constraint. Furthermore we consider the case when the communication topology of the nodes is dynamic in nature. Recently, there has been a lot of interest in the so called ``consensus'' algorithms which has been shown to be remarkable robust to dynamic communication topology. Our algorithms leverage the robustness properties of consensus algorithm to compute the optimal solution in a distributed manner. We propose algorithms which have guaranteed convergence behavior in the presence of various forms of perturbations like communication noise, stochastic subgradient errors and stochastic communication topologies. This enables our algorithms to be useful in a wide class of application areas in sensor networks and machine learning. Specifically the consideration of stochastic subgradient errors enable our algorithms to be useful in an online setting, when the algorithm operates on streaming data. We adapt our algorithms for the binary classification problem in the support vector machine setting and show the behavior over a sample data set. We further develop distributed algorithms for the min-max problem in a network. This formulation doesn't readily fit the separable structure of the objective function discussed earlier. We develop an exact penalty based approach and an approach based on primal-dual iterative schemes. We show the applicability of the algorithms on a power allocation problem in cellular networks. Advisors/Committee Members: Champaign%22%20%2Bcontributor%3A%28%22Nedich%2C%20Angelia%22%29&pagesize-30">Nedich, Angelia (advisor), Champaign%22%20%2Bcontributor%3A%28%22Stipanovi%3F%3F%2C%20Du%3F%3Fan%20M.%22%29&pagesize-30">Stipanovi??, Du??an M. (advisor), Champaign%22%20%2Bcontributor%3A%28%22Nedich%2C%20Angelia%22%29&pagesize-30">Nedich, Angelia (Committee Chair), Champaign%22%20%2Bcontributor%3A%28%22Stipanovi%3F%3F%2C%20Du%3F%3Fan%20M.%22%29&pagesize-30">Stipanovi??, Du??an M. (committee member), Champaign%22%20%2Bcontributor%3A%28%22Kumar%2C%20P.%20R.%22%29&pagesize-30">Kumar, P. R. (committee member), Champaign%22%20%2Bcontributor%3A%28%22Sreenivas%2C%20Ramavarapu%20S.%22%29&pagesize-30">Sreenivas, Ramavarapu S. (committee member).

Subjects/Keywords: Distributed Optimization; Consensus Algorithms; Machine Learning

14 more images…

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Srivastava, K. (2012). Distributed optimization with applications to sensor networks and machine learning. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/29504

Chicago Manual of Style (16^th Edition):

Srivastava, Kunal. “Distributed optimization with applications to sensor networks and machine learning.” 2012. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed March 02, 2021. http://hdl.handle.net/2142/29504.

MLA Handbook (7^th Edition):

Srivastava, Kunal. “Distributed optimization with applications to sensor networks and machine learning.” 2012. Web. 02 Mar 2021.

Vancouver:

Srivastava K. Distributed optimization with applications to sensor networks and machine learning. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2012. [cited 2021 Mar 02]. Available from: http://hdl.handle.net/2142/29504.

Council of Science Editors:

Srivastava K. Distributed optimization with applications to sensor networks and machine learning. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2012. Available from: http://hdl.handle.net/2142/29504

28. Ji, Tianxiong. The delay performance of adaptive routing and scheduling in communication networks.

Degree: PhD, 1200, 2012, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/30890

► Throughput and latency are two important QoS metrics in communication networks. Ideally, we would like to deliver a large amount of data from a source… (more)

▼ Throughput and latency are two important QoS metrics in communication networks. Ideally, we would like to deliver a large amount of data from a source to its destination within a short time period. During the past decades, researchers have designed a number of network-layer routing algorithms and MAC-layer scheduling algorithms to deliver good QoS performance under various network conditions. In this dissertation, we study the delay performance of routing and scheduling algorithms in communication networks. A collection of algorithms called MaxWeight Scheduling (MWS) algorithms is known to be throughput optimal. A particular algorithm in this class was conjectured to be delay-optimal as well. We disprove this conjectured by constructing a delay-optimal algorithm for a specific network and show that it outperforms the particular MWS algorithm. Next, we propose a packet-by-packet adaptive routing and scheduling algorithm for multi-hop traffic which dramatically reduces delays in the network, while maintaining near throughput optimality. This algorithm uses a particular routing table, called a probabilistic routing table, to adaptively find a route for every packet. The probabilistic routing table is generated by running an emulated network, called the shadow network, which is essentially a model of the real network with a slightly higher traffic load. The scheduling decisions are also determined by the shadow system. Our joint routing and scheduling algorithm reduces the capacity region slightly, but provides low delay performance everywhere in this reduced region. In addition, the queueing and routing architecture is more consistent with the architecture of current routers and switches. We also extend our results to the case where network coding is used to improved the throughput in the network. Our algorithm provides a low-complexity solution to optimally exploit the routing-coding tradeoff. Lastly, we consider wireless ad hoc networks in which each connection (file) traverses only one hop. We assume files arrive for service at each link and a file departs when all its packets have been transmitted. We consider two cases: one in which the file size distribution is arbitrary but has bounded support; another in which the file size distribution is a mixture of geometric distributions. The only assumption we make about the window flow control protocol is that the window size is always greater than zero. We show the following result: for an appropriately chosen MAC-layer scheduling algorithm, the network is stable for all file arrival rates within the capacity region. In other words, the MAC-layer scheduling algorithm, by only knowing the MAC-layer information, can achieve throughput optimality independently of the window flow control protocol used. Advisors/Committee Members: Champaign%22%20%2Bcontributor%3A%28%22Srikant%2C%20Rayadurgam%22%29&pagesize-30">Srikant, Rayadurgam (advisor), Champaign%22%20%2Bcontributor%3A%28%22Srikant%2C%20Rayadurgam%22%29&pagesize-30">Srikant, Rayadurgam (Committee Chair), Champaign%22%20%2Bcontributor%3A%28%22Basar%2C%20Tamer%22%29&pagesize-30">Basar, Tamer (committee member), Champaign%22%20%2Bcontributor%3A%28%22Coleman%2C%20Todd%20P.%22%29&pagesize-30">Coleman, Todd P. (committee member), Champaign%22%20%2Bcontributor%3A%28%22Sreenivas%2C%20Ramavarapu%20S.%22%29&pagesize-30">Sreenivas, Ramavarapu S. (committee member), Champaign%22%20%2Bcontributor%3A%28%22Vaidya%2C%20Nitin%20H.%22%29&pagesize-30">Vaidya, Nitin H. (committee member).

Subjects/Keywords: Routing; Scheduling; Communication Networks; Delay performance; Connection-level; Adaptive; Throughput optimal

10 more images…

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Ji, T. (2012). The delay performance of adaptive routing and scheduling in communication networks. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/30890

Chicago Manual of Style (16^th Edition):

Ji, Tianxiong. “The delay performance of adaptive routing and scheduling in communication networks.” 2012. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed March 02, 2021. http://hdl.handle.net/2142/30890.

MLA Handbook (7^th Edition):

Ji, Tianxiong. “The delay performance of adaptive routing and scheduling in communication networks.” 2012. Web. 02 Mar 2021.

Vancouver:

Ji T. The delay performance of adaptive routing and scheduling in communication networks. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2012. [cited 2021 Mar 02]. Available from: http://hdl.handle.net/2142/30890.

Council of Science Editors:

Ji T. The delay performance of adaptive routing and scheduling in communication networks. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2012. Available from: http://hdl.handle.net/2142/30890

		in
And / Or
		in
And / Or
		in
And / Or
		in

Open Access Theses and Dissertations