Computer Sciences Commons^™

Taxisim: A Multiagent Simulation Platform For Evaluating Taxi Fleet Operations, Shih-Fen Cheng, Thi Duong Nguyen

Research Collection School Of Computing and Information Systems

Taxi service is an important mode of public transportation in most metropolitan areas since it provides door-to-door convenience in the public domain. Unfortunately, despite all the convenience taxis bring, taxi fleets are also extremely inefficient to the point that over 50% of its operation time could be spent in idling state. Improving taxi fleet operation is an extremely challenging problem, not just because of its scale, but also due to fact that taxi drivers are self-interested agents that cannot be controlled centrally. To facilitate the study of such complex and decentralized system, we propose to construct a multiagent simulation platform …

Improved Algorithms For Ear-Clipping Triangulation, Bartosz Kajak

UNLV Theses, Dissertations, Professional Papers, and Capstones

We consider the problem of improving ear-slicing algorithm for triangulating a simple polygon. We propose two variations of ear-slicing technique for generating “good-quality” triangulation. The first approach is based on searching for the best triangle along the boundary. The second approach considers polygon partitioning on a pre-process before applying the ear-slicing. Experimental investigation reveals that both approaches yield better quality triangulation than the standard ear-slicing method.

Molecular Dynamics Simulation Based On Hadoop Mapreduce, Chen He

School of Computing: Dissertations, Theses, and Student Research

Molecular Dynamics (MD) simulation is a computationally intensive application used in multiple fields. It can exploit a distributed environment due to inherent computational parallelism. However, most of the existing implementations focus on performance enhancement. They may not provide fault-tolerance for every time-step.

MapReduce is a framework first proposed by Google for processing huge amounts of data in a distributed environment. The simplicity of the programming model and fault- tolerance for node failure during run-time make it very popular not only for commercial applications but also in scientific computing.

In this thesis, we develop a novel communication-free and each time-step fault- …

Networks - Ii: Em-Wave Consideration Through Polarization And Magnetization Effects In Fiber Optics, Hassan Ali, Zain -Ul- Abiden, M. Rizwan Anjum

International Conference on Information and Communication Technologies

Optical fiber communication is the field of the applied science and a promising technique that permits the communication of data in the form of audio and video signal over transparent medium with high data rate over longer distances. Due to the property of fiber optics that it carries high frequency and allows high bandwidth, as the information travels through fiber optic cable in the form of light which belongs to the spectrum of EM wave. The intensity of the electromagnetic radiation decreases in the non conducting medium due to the scattering and absorption of photons. The research on the behavior …

Network Security: A Review Of Salient Security Aspects Of The Universal Mobile Telecommunication System (Umts), F. Imran, M. Hussain

International Conference on Information and Communication Technologies

Wireless communication is known as key to global development. Wireless and mobile communication is gaining more importance in our life. Protecting information is one the aspects which we need to focus on the wireless networks. Universal mobile telecommunication system (UMTS) is evolution of the third generation mobile communication system. It was built on the success of global system for mobile communication (GSM). Universal mobile telecommunication system's security is also built on global system for mobile communication (GSM). The paper reviews the literature of the security aspects of the Universal mobile telecommunication system. A critical evaluation of the proposed solutions is …

Networks - Ii: Modified On Demand Transmission Power Control For Wireless Sensor Networks, Mirza M Yasir Masood, Ghufran Ahmed, Noor M. Khan

International Conference on Information and Communication Technologies

On Demand Transmission Power Control (ODTPC) is a well known transmission power control strategy that is used to reduce high power consumption in wireless sensor networks (WSNs). In this paper, we propose an extension to ODTPC and thus, a modified version of ODTPC is proposed named MODTPC. Simulation results show that performance of MODTPC is better than ODTPC in terms of efficiency and energy saving.

Network Security: A Secure Architecture For Open Source Voip Solutions, Fahad Sattar, M. Hussain, Kashif Nisar

International Conference on Information and Communication Technologies

Voice over IP “VoIP” is a form of voice speech that uses data networks, for transmission of voice traffic over IP-based networks to transmit voice signals. The signal is correctly encoded at one end of the communication channel, sent as packets through the data network, then decoded at the receiving end and transformed back into a voice signal. It has a potential and offering a choice to the traditional telephony systems due to its high resource utilization and cost efficiency. Meanwhile, Wireless Local Area Networks (WLANs) have become an ever present networking technology that has been deployed around the world. …

Real-Time Divisible Load Scheduling For Cluster Computing, Anwar Mamat

School of Computing: Dissertations, Theses, and Student Research

Cluster computing has become an important paradigm for solving large-scale problems. However, as the size of a cluster increases, so does the complexity of resource management and maintenance. Therefore, automated performance control and re- source management are expected to play critical roles in sustaining the evolution of cluster computing. The current cluster scheduling practice is similar in sophistication to early supercomputer batch scheduling algorithms, and no consideration is given to desired quality-of-service (QoS) attributes. To fully avail the power of computational clusters, new scheduling algorithms that provides high performance, QoS assurance, fault-tolerance, energy savings and streamlined management of the cluster …

Networks - I: Interference Mitigation In 4g System Using Smart Antenna, Asad Ali Siddiqui, Muhammad Mazhar Manzoor, Aamir Ijaz, Adnan Umar Khan, Imran Ahmed Awan, Sangita Lal Chand

International Conference on Information and Communication Technologies

Emerging trends of mobile communication and ever growing demand of mobile users with high speed data requirements and migrating towards 4G, Co-Channel interference and multipath in urban/dense urban environment will limit the capacity of the network. Smart antenna is now recognized by its higher user capacity in 4G wireless networks by efficiently reducing multipath and co-channel interference. Smart Antenna use adaptive beam forming algorithms in a dynamic environment continuously adjusting the weight of antenna arrays for creating a beam to track desired users automatically, and minimize interference from other users by placing nulls in their directions. This research work provides …

Artificial Intelligence – I: A Preliminary Framework For Human-Agent Communication In Electronic Negotiations, Moez Ur Rehman, Nosheen Riaz

International Conference on Information and Communication Technologies

Electronic negotiations are business negotiations conducted via electronic means using information and communications technologies (ICT). Two dominant types of electronic negotiation systems are automated negotiation systems for software agents and negotiation support systems (NSSs) for humans. However, the integration of two types for human-agent negotiations is an important task. In this paper, an extended communication model for human-agent business negotiations is presented. For this purpose, the underlying communication models of automated negotiations and NSSs are analyzed. The extended communication model is based on a common negotiation ontology which captures the negotiation agenda and paves the way for such hybrid communication, …

Syntax Proposal For Nominal Schemas, David Carral Martinez, Adila A. Krisnadhi, Pascal Hitzler

Computer Science and Engineering Faculty Publications

This paper proposes a syntax representation for nominal schemas, a new description-logic style ex- tension of OWL 2 [2, 3]. Necessary and minimal modifications to Functional and Manchester grammars are included as well as mappings from these two syntaxes to Turtle. An appendix with two examples is added in order to clarify the proposal.

A Study On Facility Planning Using Discrete Event Simulation: Case Study Of A Grain Delivery Terminal, Sarah M. Asio

Department of Industrial and Management Systems Engineering: Dissertations, Theses, and Student Research

The application of traditional approaches to the design of efficient facilities can be tedious and time consuming when uncertainty and a number of constraints exist. Queuing models and mathematical programming techniques are not able to capture the complex interaction between resources, the environment and space constraints for dynamic stochastic processes. In the following study discrete event simulation is applied to the facility planning process for a grain delivery terminal. The discrete event simulation approach has been applied to studies such as capacity planning and facility layout for a gasoline station and evaluating the resource requirements for a manufacturing facility. To …

A Reservation-Based Smart Parking System, Hongwei Wang

School of Computing: Dissertations, Theses, and Student Research

In metropolitan areas, parking management influences drivers search time and cost for parking spaces, parking revenue, and traffic congestion. The wide deployment of wireless parking meters with sensing and communications capabilities allows the parking authority to monitor the state of each parking space in real time and optimize the parking management.

In this thesis, we study state-of-the-art parking policies in smart parking systems, and show that the smart parking system needs to be "smarter". Our design goals of the smart parking systems include: (1) simplify the operations of parking systems, (2) improve drivers' satisfaction, (3) increase parking revenue, and (4) …

Ceg 260-01: Digital Computer Hardware, Travis E. Doom

Computer Science & Engineering Syllabi

Digital Computer Hardware. Topics include switching algebra and switching functions, logic design of combinational and sequential circuits using T1L, combinational logic design with MSI and LSI, busing, storage elements, and instrumentation. 3 hours lecture, 2 hours lab. Prerequisite: CS 241.

Cs 141: Computer Programming I, Vanessa Starkey

Computer Science & Engineering Syllabi

Introduction to use of computers as a problem-solving tool. Examples from and applications to a broad range of problems. Methodology for algorithm design and for structured modular implementation is stressed. Three hours lecture, two hours lab.

Cs 240: Computer Programming I, Vanessa Starkey

Computer Science & Engineering Syllabi

Basic concepts of programming and programming languages are introduced.
Emphasis is on problem solving and object oriented programming. This course provides a general introduction to the fundamentals of computer science and programming. Examples from and applications to a broad range of problems are given. No prior knowledge of programming is assumed. The concepts covered will be applied to the Java programming language.

Cs 480/680: Comparative Languages, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

This course will introduce fundamental concepts and paradigms underlying the design of modern multi-paradigm programming languages. For concreteness, we study the details of an object-oriented language (e.g. Java), and a functional language (e.g., scheme). The former is an exemplar of a language for programming-in-the-large, while the latter is an exemplar of programming-in-the-small. The overall goal is to enable comparison and evaluation of existing languages. 1he programming assignments will be coded in Java and in Scheme.

Cs 205: Introduction To Computers And Office Productivity Software, Amanda Hood

Computer Science & Engineering Syllabi

Focus on learning MS Office 2010 software applications including word processing (intermediate), spreadsheets, databases, and presentation graphics using a case study approach where critical thinking and problem solving skills are required. Computer concepts are integrated throughout the course to provide an understanding of the basics of computing, the latest technological advances and how they are used in industry. Ethics and issues encountered in business are discussed to challenge students on societal impact of technology.

Cs 242: Computer Programming Iii, Yong Pei

Computer Science & Engineering Syllabi

No abstract provided.

Cs 415: Social Implications Of Computing, Leo Finkelstein

Computer Science & Engineering Syllabi

CS 415 is a communication skills course using as its subject matter current salient issues associated with the social implications of computing. In addition to the course text, you will need to use certain reading materials in the library and elsewhere, and you will be responsible for using concepts and theories provided in class lectures and discussions.

Cs 766: Evolutionary Computation, John C. Gallagher

Computer Science & Engineering Syllabi

This course explores evolutionary computation from a historical, theoretical, and application viewpoint. An overview of the most common evolutionary search techniques is presented. Specific topics include in the overview are: genetic algorithms, evolutionary programming, evolutionary strategies, and genetic programming. The fundamental issues driving the choice of problem representation and specific genetic operators are discussed. Various applications of evolutionary computation to problems in control, optimization, and pattern recognition are examined.

Ceg 220-01: Introduction To C Programming For Engineers, Dennis Kellermeier

Computer Science & Engineering Syllabi

This course provides a general introduction to computers as a problem-solving tool using the C programming language. Emphasis is on algorithms and techniques useful to engineers. Topics include data representation, debugging, and program verification. 4 credit hours. Prerequisite: MTH 229 (Calculus I) or EGR 101 (Engineering Mathematics). The course includes a scheduled laboratory section for which you must register.

Ceg 241-01: Computer Programming Ii, Bin Wang

Computer Science & Engineering Syllabi

No abstract provided.

Ceg 720-01: Computer Architecture, Jack Jean

Computer Science & Engineering Syllabi

No abstract provided.

Ceg 730-01: Distributed Computing Principles, Soon M. Chung

Computer Science & Engineering Syllabi

Communicating sequential processes, clients and servers, remote procedure calls, stub generation, weak and strong semaphores, split-binary semaphores, and distributed termination. 3 hours lecture and 2 hours lab.

Automatic High-Fidelity 3d Road Network Modeling, Jie Wang

Computational Modeling & Simulation Engineering Theses & Dissertations

Many computer applications such as racing games and driving simulations frequently make use of 3D high-fidelity road network models for a variety of purposes. However, there are very few existing methods for automatic generation of 3D realistic road networks, especially for those in the real world. On the other hand, vast road network GIS data have been collected in the past and used by a wide range of applications, such as navigation and evaluation. A method that can automatically produce 3D high-fidelity road network models from 2D real road GIS data will significantly reduce both the labor and time needed …

Using The Web Infrastructure For Real Time Recovery Of Missing Web Pages, Martin Klein

Computer Science Theses & Dissertations

Given the dynamic nature of the World Wide Web, missing web pages, or "404 Page not Found" responses, are part of our web browsing experience. It is our intuition that information on the web is rarely completely lost, it is just missing. In whole or in part, content often moves from one URI to another and hence it just needs to be (re-)discovered. We evaluate several methods for a \justin- time" approach to web page preservation. We investigate the suitability of lexical signatures and web page titles to rediscover missing content. It is understood that web pages change over time …

Finding Robust-Under-Risk Solutions For Flowshop Scheduling, Steven O. Kimbrough, Ann Kuo, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

We propose and explore, in the context of benchmark problems for flowshop scheduling, a risk-based concept of robustness for optimization problems. This risk-based concept is in distinction to, and complements, the uncertainty-based concept employed in the field known as robust optimization. Implementation of our concept requires problem solution methods that sample the solution space intelligently and that produce large numbers of distinct sample points. With these solutions to hand, their robustness scores are easily obtained and heuristically robust solutions found. We find evolutionary computation to be effective for this purpose on these problems.

Real-World Parameter Tuning Using Factorial Design With Parameter Decomposition, Aldy Gunawan, Hoong Chuin Lau, Elaine Wong

Research Collection School Of Computing and Information Systems

In this paper, we explore the idea of improving the efficiency of factorial design for parameter tuning of metaheuristics. In a standard full factorial design, the number of runs increases exponentially as the number of parameters. To reduce the parameter search space, one option is to first partition parameters into disjoint categories. While this may be done manually based on user guidance, an automated approach proposed in this paper is to apply a fractional factorial design to partition parameters based on their main effects where each partition is then tuned independently. With a careful choice of fractional design, our approach …

Scalable Multiagent Planning Using Probabilistic Inference, Akshat Kumar, Shlomo Zilberstein, Marc Toussaint

Research Collection School Of Computing and Information Systems

Multiagent planning has seen much progress with the development of formal models such as Dec-POMDPs. However, the complexity of these models -- NEXP-Complete even for two agents -- has limited scalability. We identify certain mild conditions that are sufficient to make multiagent planning amenable to a scalable approximation w.r.t. the number of agents. This is achieved by constructing a graphical model in which likelihood maximization is equivalent to plan optimization. Using the Expectation-Maximization framework for likelihood maximization, we show that the necessary inference can be decomposed into processes that often involve a small subset of agents, thereby facilitating scalability. We …