+publisher:"Oregon State University" +contributor:("Nguyen, Thinh P.")

Oregon State University

1. Denkaew, Weerakit. A heuristic algorithm for operating yard cranes over storage blocks to minimize the handling time in a container yard.

Degree: MS, Industrial Engineering, 2009, Oregon State University

URL: http://hdl.handle.net/1957/11992

► In container terminals, the efficiency of loading operations in a container yard highly depends on the productivity of yard cranes. In loading operation, yard cranes… (more)

Subjects/Keywords: yard crane; Cranes, derricks, etc.

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Denkaew, W. (2009). A heuristic algorithm for operating yard cranes over storage blocks to minimize the handling time in a container yard. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/11992

Chicago Manual of Style (16^th Edition):

Denkaew, Weerakit. “A heuristic algorithm for operating yard cranes over storage blocks to minimize the handling time in a container yard.” 2009. Masters Thesis, Oregon State University. Accessed April 21, 2021. http://hdl.handle.net/1957/11992.

MLA Handbook (7^th Edition):

Denkaew, Weerakit. “A heuristic algorithm for operating yard cranes over storage blocks to minimize the handling time in a container yard.” 2009. Web. 21 Apr 2021.

Vancouver:

Denkaew W. A heuristic algorithm for operating yard cranes over storage blocks to minimize the handling time in a container yard. [Internet] [Masters thesis]. Oregon State University; 2009. [cited 2021 Apr 21]. Available from: http://hdl.handle.net/1957/11992.

Council of Science Editors:

Denkaew W. A heuristic algorithm for operating yard cranes over storage blocks to minimize the handling time in a container yard. [Masters Thesis]. Oregon State University; 2009. Available from: http://hdl.handle.net/1957/11992

Oregon State University

2. Kramer, Richard A. Optimization of Interactive Live Free Viewpoint Multiview Video Streaming Bandwidth.

Degree: MS, 2017, Oregon State University

URL: http://hdl.handle.net/1957/61700

► There are generally two types of multiview video: (1) 3D Multiview Video (“3D MVV” also called “2D plus delta” or “stereo” multi-view video): 3D MVV… (more)

Subjects/Keywords: video streaming

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Kramer, R. A. (2017). Optimization of Interactive Live Free Viewpoint Multiview Video Streaming Bandwidth. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/61700

Chicago Manual of Style (16^th Edition):

Kramer, Richard A. “Optimization of Interactive Live Free Viewpoint Multiview Video Streaming Bandwidth.” 2017. Masters Thesis, Oregon State University. Accessed April 21, 2021. http://hdl.handle.net/1957/61700.

MLA Handbook (7^th Edition):

Kramer, Richard A. “Optimization of Interactive Live Free Viewpoint Multiview Video Streaming Bandwidth.” 2017. Web. 21 Apr 2021.

Vancouver:

Kramer RA. Optimization of Interactive Live Free Viewpoint Multiview Video Streaming Bandwidth. [Internet] [Masters thesis]. Oregon State University; 2017. [cited 2021 Apr 21]. Available from: http://hdl.handle.net/1957/61700.

Council of Science Editors:

Kramer RA. Optimization of Interactive Live Free Viewpoint Multiview Video Streaming Bandwidth. [Masters Thesis]. Oregon State University; 2017. Available from: http://hdl.handle.net/1957/61700

Oregon State University

3. Nandakumar Thampi, Archana. Efficient, secure and covert channel capacity bounded protocols for multilevel security cross-domain environments - an experimental system.

Degree: MS, Computer Science, 2014, Oregon State University

URL: http://hdl.handle.net/1957/51895

► The communication in MLS cross-domain environments faces many challenges. The three most important challenges are efficient key management, privacy preserving and covert channel. We propose… (more)

Subjects/Keywords: Computer security

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Nandakumar Thampi, A. (2014). Efficient, secure and covert channel capacity bounded protocols for multilevel security cross-domain environments - an experimental system. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/51895

Chicago Manual of Style (16^th Edition):

Nandakumar Thampi, Archana. “Efficient, secure and covert channel capacity bounded protocols for multilevel security cross-domain environments - an experimental system.” 2014. Masters Thesis, Oregon State University. Accessed April 21, 2021. http://hdl.handle.net/1957/51895.

MLA Handbook (7^th Edition):

Nandakumar Thampi, Archana. “Efficient, secure and covert channel capacity bounded protocols for multilevel security cross-domain environments - an experimental system.” 2014. Web. 21 Apr 2021.

Vancouver:

Nandakumar Thampi A. Efficient, secure and covert channel capacity bounded protocols for multilevel security cross-domain environments - an experimental system. [Internet] [Masters thesis]. Oregon State University; 2014. [cited 2021 Apr 21]. Available from: http://hdl.handle.net/1957/51895.

Council of Science Editors:

Nandakumar Thampi A. Efficient, secure and covert channel capacity bounded protocols for multilevel security cross-domain environments - an experimental system. [Masters Thesis]. Oregon State University; 2014. Available from: http://hdl.handle.net/1957/51895

4. Duong-Ba, Thuan Hong. Resource allocation optimization in large scale distributed systems.

Degree: PhD, Electrical and Computer Engineering, 2014, Oregon State University

URL: http://hdl.handle.net/1957/48387

► We studied the problem of resource allocation in large scale distributed applications such as Online Social Networks (OSN) and Cloud Computing. In such settings, resource… (more)

▼ We studied the problem of resource allocation in large scale distributed applications such as Online Social Networks (OSN) and Cloud Computing. In such settings, resource allocation schemes need to efficient as well as adaptive to the time-varying environments. The abstract resource allocation problem concerns with how to optimally use resources for different tasks. In the context of this dissertation, the resources are servers and the tasks are (a) the virtual machines in the cloud computing setting, and or users for on-line social network applications. It is well-known that the general resource allocation problem is NP-hard. Therefore, in this dissertation, we study a number of heuristic algorithms designed for two primary objectives: 1) achieve reliability via load balancing among resource providers and 2) minimizing the energy consumption by reducing unnecessary intercommunication loads among the servers. Specifically, the dissertation has three main components. The first component deals with optimal assignment of user data to servers to maximize load balance and minimize power consumption. In this component, we propose a novel Distributed Perturbed Greedy Search (DPGS) algorithm which combine both deterministic search and random search to speed the convergence while avoiding local optimum. The empirical shows that the DPGS has a fast convergence rate to the near optimal solution even when the environment changes. The second component deals with the analysis on the convergence rates of a general simulated annealing algorithm via the notion of adiabatic time. We then apply the results to characterize the convergence rates for simulated annealing algorithm when applied to the optimal assignment in the component one. Finally, the third component of the dissertation is concerned with optimal assignment of virtual machines to servers in the context of cloud computing, in order to minimize the energy subject to a given performance requirement. We show that the problem can be approximated well as a convex problem, and propose convex relaxation technique to find the optimal solution. Advisors/Committee Members: Nguyen, Thinh P. (advisor), Thinh, Nguyen P. (committee member).

Subjects/Keywords: Combinatorial optimization; Resource allocation

10 more images…

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Duong-Ba, T. H. (2014). Resource allocation optimization in large scale distributed systems. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/48387

Chicago Manual of Style (16^th Edition):

Duong-Ba, Thuan Hong. “Resource allocation optimization in large scale distributed systems.” 2014. Doctoral Dissertation, Oregon State University. Accessed April 21, 2021. http://hdl.handle.net/1957/48387.

MLA Handbook (7^th Edition):

Duong-Ba, Thuan Hong. “Resource allocation optimization in large scale distributed systems.” 2014. Web. 21 Apr 2021.

Vancouver:

Duong-Ba TH. Resource allocation optimization in large scale distributed systems. [Internet] [Doctoral dissertation]. Oregon State University; 2014. [cited 2021 Apr 21]. Available from: http://hdl.handle.net/1957/48387.

Council of Science Editors:

Duong-Ba TH. Resource allocation optimization in large scale distributed systems. [Doctoral Dissertation]. Oregon State University; 2014. Available from: http://hdl.handle.net/1957/48387

5. Duong, Thai (Thai Phu). Data Collection in Sensor Networks via the Novel Fast Markov Decision Process Framework.

Degree: MS, Computer Science, 2015, Oregon State University

URL: http://hdl.handle.net/1957/56020

► We investigate the data collection problem in sensor networks. The network consists of a number of stationary sensors deployed at different sites for sensing and… (more)

Subjects/Keywords: Sensor Network; Sensor networks

12 more images…

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Duong, T. (. P. (2015). Data Collection in Sensor Networks via the Novel Fast Markov Decision Process Framework. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/56020

Chicago Manual of Style (16^th Edition):

Duong, Thai (Thai Phu). “Data Collection in Sensor Networks via the Novel Fast Markov Decision Process Framework.” 2015. Masters Thesis, Oregon State University. Accessed April 21, 2021. http://hdl.handle.net/1957/56020.

MLA Handbook (7^th Edition):

Duong, Thai (Thai Phu). “Data Collection in Sensor Networks via the Novel Fast Markov Decision Process Framework.” 2015. Web. 21 Apr 2021.

Vancouver:

Duong T(P. Data Collection in Sensor Networks via the Novel Fast Markov Decision Process Framework. [Internet] [Masters thesis]. Oregon State University; 2015. [cited 2021 Apr 21]. Available from: http://hdl.handle.net/1957/56020.

Council of Science Editors:

Duong T(P. Data Collection in Sensor Networks via the Novel Fast Markov Decision Process Framework. [Masters Thesis]. Oregon State University; 2015. Available from: http://hdl.handle.net/1957/56020

6. Lopez-Echevarria, Daniel. Variable sampling compensation of networked control systems with delays using neural networks.

Degree: PhD, Electrical and Computer Engineering, 2011, Oregon State University

URL: http://hdl.handle.net/1957/21820

► In networked control systems (NCS) information or packets usually flow from a sensor or a set of sensors to a remotely located controller. Then the… (more)

▼ In networked control systems (NCS) information or packets usually flow from a sensor or a set of sensors to a remotely located controller. Then the controller processes the received information and sends a series of control commands to the actuators through a communication network which could be either wireless or wired. For any type of communication network, time delays are an inherent problem and depending on the conditions of the network they can be constant, variable or even of random nature. Time-delays occurring from sensor to controller and from controller to actuators may cause important system performance degradation or even instability. This work proposes a novel strategy of using the predictive capabilities of artificial neural networks (NN), particularly the application of an adaptive NN, to minimize the effects of time delays in the feedback control loop of NCS. We adopt an adaptive time delay neural network (TDNN) to predict future time-delays based on a given history of delays that are particularly present on the network where the corresponding system belongs to. The adaptive nature of a TDNN allows the prediction of unexpected variations of time-delays which might not be present in the training set of a known history of delays. This is an important characteristic for real time applications. Using predicted time delays, different methodologies can be used to alleviate effects of such delays on NCS. Our focus here is on the development of an observer-based variable sampling period model, and this dissertation describes how this method can be used as an effective solution for this problem. Generally speaking, the predicted time-delay values are used for the discretization of a continuous-time linear time invariant system model transforming it into a discrete-time linear time variant system model. In this dissertation, the practical phenomenon of packet dropout is also addressed. Advisors/Committee Members: Magana, Mario E. (advisor), Nguyen, Thinh P. (committee member).

Subjects/Keywords: Networked Control Systems

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Lopez-Echevarria, D. (2011). Variable sampling compensation of networked control systems with delays using neural networks. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/21820

Chicago Manual of Style (16^th Edition):

Lopez-Echevarria, Daniel. “Variable sampling compensation of networked control systems with delays using neural networks.” 2011. Doctoral Dissertation, Oregon State University. Accessed April 21, 2021. http://hdl.handle.net/1957/21820.

MLA Handbook (7^th Edition):

Lopez-Echevarria, Daniel. “Variable sampling compensation of networked control systems with delays using neural networks.” 2011. Web. 21 Apr 2021.

Vancouver:

Lopez-Echevarria D. Variable sampling compensation of networked control systems with delays using neural networks. [Internet] [Doctoral dissertation]. Oregon State University; 2011. [cited 2021 Apr 21]. Available from: http://hdl.handle.net/1957/21820.

Council of Science Editors:

Lopez-Echevarria D. Variable sampling compensation of networked control systems with delays using neural networks. [Doctoral Dissertation]. Oregon State University; 2011. Available from: http://hdl.handle.net/1957/21820

7. Duong, Thai. Adiabatic Markov Decision Process : convergence of value iteration algorithm.

Degree: MS, Electrical and Computer Engineering, 2013, Oregon State University

URL: http://hdl.handle.net/1957/40061

► Markov Decision Process (MDP) is a well-known framework for devising the optimal decision making strategies under uncertainty. Typically, the decision maker assumes a stationary environment… (more)

Subjects/Keywords: Value Iteration; Markov processes

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Duong, T. (2013). Adiabatic Markov Decision Process : convergence of value iteration algorithm. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/40061

Chicago Manual of Style (16^th Edition):

Duong, Thai. “Adiabatic Markov Decision Process : convergence of value iteration algorithm.” 2013. Masters Thesis, Oregon State University. Accessed April 21, 2021. http://hdl.handle.net/1957/40061.

MLA Handbook (7^th Edition):

Duong, Thai. “Adiabatic Markov Decision Process : convergence of value iteration algorithm.” 2013. Web. 21 Apr 2021.

Vancouver:

Duong T. Adiabatic Markov Decision Process : convergence of value iteration algorithm. [Internet] [Masters thesis]. Oregon State University; 2013. [cited 2021 Apr 21]. Available from: http://hdl.handle.net/1957/40061.

Council of Science Editors:

Duong T. Adiabatic Markov Decision Process : convergence of value iteration algorithm. [Masters Thesis]. Oregon State University; 2013. Available from: http://hdl.handle.net/1957/40061

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

Open Access Theses and Dissertations