Computer Sciences Commons^™

Challenges For Mapreduce In Big Data, Katarina Grolinger, Michael Hayes, Wilson A. Higashino, Alexandra L'Heureux, David S. Allison, Miriam A.M. Capretz

Electrical and Computer Engineering Publications

In the Big Data community, MapReduce has been seen as one of the key enabling approaches for meeting continuously increasing demands on computing resources imposed by massive data sets. The reason for this is the high scalability of the MapReduce paradigm which allows for massively parallel and distributed execution over a large number of computing nodes. This paper identifies MapReduce issues and challenges in handling Big Data with the objective of providing an overview of the field, facilitating better planning and management of Big Data projects, and identifying opportunities for future research in this field. The identified challenges are grouped …

A Distributed Consensus Algorithm For Decision Making In Service-Oriented Internet Of Things, Shancang Li, George Oikonomou, Theo Tryfonas, Thomas M. Chen, Li Da Xu

Information Technology & Decision Sciences Faculty Publications

In a service-oriented Internet of things (IoT) deployment, it is difficult to make consensus decisions for services at different IoT edge nodes where available information might be insufficient or overloaded. Existing statistical methods attempt to resolve the inconsistency, which requires adequate information to make decisions. Distributed consensus decision making (CDM) methods can provide an efficient and reliable means of synthesizing information by using a wider range of information than existing statistical methods. In this paper, we first discuss service composition for the IoT by minimizing the multi-parameter dependent matching value. Subsequently, a cluster-based distributed algorithm is proposed, whereby consensuses are …

Networks Of Users And Powers: Blackboard Software Roadmap As Cultural Practice, Diana Gellci

Wayne State University Dissertations

With the rapid growth of eLearning applications - the software providing for learning through the Internet - it has become commonplace to describe those technologies as both simple tools and user-friendly. These two vague yet suggestive terms make the operating of the technology appear as social value and any related issues as a user's problem. Interested neo-liberal groups take a step further when considering eLearning technologies as the solution for the problems faced in the field. STS studies recognize that technology fetishism is strategically employed to justify the latest developments of capitalism as technological and logical.

This doctoral study examines …

Efficient Allocation And Enforcement Of Interfaces In Compositional Real-Time Systems, Farhana Dewan

Wayne State University Dissertations

Compositional real-time research has become one of the emerging trends in embedded and real-time systems due to the increasing scale and complexity of such systems. In this design paradigm, a large system is decomposed into smaller and simpler components, each of which abstracts their temporal requirements via interfaces. Such systems are mostly implemented by resource partitions to ensure that the components receive resources according to their interfaces. Potential implementations of a resource partition are via server-based interfaces or demand-based interfaces. In this context, our thesis in this dissertation is as follows:

Currently, server-based interfaces ensure strong temporal isolation among components …

A Distributed Greedy Algorithm For Constructing Connected Dominating Sets In Wireless Sensor Networks, Akshaye Dhawan, Nicholas A. Scoville, Michelle Tanco

Mathematics, Computer Science & Statistics Faculty Publications

A Connected Dominating Set (CDS) of the graph representing a Wireless Sensor Network can be used as a virtual backbone for routing in the network. Since sensor nodes are constrained by limited on-board batteries, it is desirable to have a small CDS for the network. However, constructing a minimum size CDS has been shown to be a NP-hard problem. In this paper we present a distributed greedy algorithm for constructing a CDS that we call Greedy Connect. Our algorithm operates in two phases, first constructing a dominating set and then connecting the nodes in this set. We evaluate our algorithm …

Sensor Authentication In Collaborating Sensor Networks, Jake Bielefeldt, Sriram Chellappan

Computer Science Faculty Research & Creative Works

In this paper, we address a new security problem in the realm of collaborating sensor networks. By collaborating sensor networks, we refer to the networks of sensor networks collaborating on a mission, with each sensor network is independently owned and operated by separate entities. Such networks are practical where a number of independent entities can deploy their own sensor networks in multi-national, commercial, and environmental scenarios, and some of these networks will integrate complementary functionalities for a mission. In the scenario, we address an authentication problem wherein the goal is for the Operator Oi of Sensor Network Si to correctly …

Qos Aware Geographic Opportunistic Routing In Wireless Sensor Networks, Long Cheng, Jianwei Niu, Jiannong Cao, Sajal K. Das, Yu Gu

Computer Science Faculty Research & Creative Works

QoS routing is an important research issue in wireless sensor networks (WSNs), especially for mission-critical monitoring and surveillance systems which requires timely and reliable data delivery. Existing work exploits multipath routing to guarantee both reliability and delay QoS constraints in WSNs. However, the multipath routing approach suffers from a significant energy cost. In this work, we exploit the geographic opportunistic routing (GOR) for QoS provisioning with both end-to-end reliability and delay constraints in WSNs. Existing GOR protocols are not efficient for QoS provisioning in WSNs, in terms of the energy efficiency and computation delay at each hop. To improve the …

Description Logics, Adila Krisnadhi, Pascal Hitzler

Computer Science and Engineering Faculty Publications

Description logics (DLs) is a family of knowledge representation (KR) languages which represent knowledge in a domain of interest using formal, logic-based semantics through knowledge bases (KBs) containing general assertions of describing relevant concepts - hence, the term description - and specific assertions about individuals and relationships among them.

Ontology Design Patterns For Ocean Science Data Discovery, Pascal Hitzler

Computer Science and Engineering Faculty Publications

No abstract provided.

Concurrent Transmission Scheduling For Wpans With Adaptive Data Rate, Maggie X. Cheng, Quanmin Ye, Lin Cai

Computer Science Faculty Research & Creative Works

We consider the maximum throughput scheduling problem in a millimeter-wave wireless personal area network in which users can use adaptive modulation and coding schemes to change their data rates. The scheduling problem is to map transmissions to time slots so that the total throughput is maximized. Due to the ultra-wide bandwidth of the mm Wave band, bad scheduling tends to waste significant channel resource. It is worth the effort to consider a more sophisticated scheduling scheme than the simple serial TDMA scheme. The challenge is that the achieved data rate of one flow is limited by the interference from other …

Sensor Cloud: A Cloud Of Virtual Sensors, Sanjay Madria, Vimal Kumar, Rashmi Dalvi

Computer Science Faculty Research & Creative Works

Newer models for interacting with wireless sensors such as Internet of Things and Sensor Cloud aim to overcome restricted resources and efficiency. The Missouri S&T (science and technology) sensor cloud enables different networks, spread in a huge geographical area, to connect together and be employed simultaneously by multiple users on demand. Virtual sensors, which are at the core of this sensor cloud architecture, assist in creating a multiuser environment on top of resource-constrained physical wireless sensors and can help in supporting multiple applications. © 1984-2012 IEEE.

The Impact Of Virtual Dissection On Engineering Student Learning And Self-Efficacy, Christine A. Toh, Connor Disco, Scarlett Miller

Interdisciplinary Informatics Faculty Publications

Product dissection activities are widely practiced in engineering education and recent efforts have sought to develop and utilize virtual dissection tools, little data exists on how these tools impact the learning process. Therefore, this study investigates the impact of virtual dissection on student learning and self-efficacy to understand the effects of virtual dissection tools for enhancing engineering instruction.

Personal Reflections From Eportfolio: Ahrc New York City, Ashleigh Taylor

Community Action Forum: Seidenberg School

No abstract provided.

Personal Reflections From Eportfolio: Ahrc New York City, Daria Afanaseva

Community Action Forum: Seidenberg School

No abstract provided.

Personal Reflections From Eportfolio: Ahrc New York City, Carlos Fermin Jahn

Community Action Forum: Seidenberg School

No abstract provided.

Personal Reflections From Eportfolio: Ahrc New York City, Talin Dursunian

Community Action Forum: Seidenberg School

No abstract provided.

Personal Reflections From Eportfolio: Ahrc New York City, Alexis Minneo

Community Action Forum: Seidenberg School

No abstract provided.

Personal Reflections From Eportfolio: Ahrc New York City, Sarah Kuptsin

Community Action Forum: Seidenberg School

No abstract provided.

Personal Reflections From Eportfolio: Ahrc New York City, Yekaterina Tsvetkova

Community Action Forum: Seidenberg School

No abstract provided.

Personal Reflections From Eportfolio: Ahrc New York City, Kristina Grimmer

Community Action Forum: Seidenberg School

No abstract provided.

Modeling Tolerance In Dynamic Social Networks, Amanda Luby

Honors Theses, 1963-2015

The study of social networks has become increasingly important in recent years. Multi-agent systems research has proven to be an effective way of representing both static and dynamic social networks in order to model and analyze many different situations. Previous implementations of multi-agent systems have observed a phenomenon called tolerance between agents through simulation studies, which is defined as an agent maintaining an unrewarding connection. This concept has also arisen in the social sciences through the study of networks. We aim to bridge this gap between simulation studies in multi-agent systems and real-world observations. This project explores how local interactions …

Bifurcation And Non-Convergence In The Hansen-Patrick Root-Finding Method, Preston Hardy

Honors Theses, 1963-2015

The Hansen-Patrick Root-Finding Method is a one-parameter family of cubically convergent root-finding methods. The parameter is called alpha and can be any complex number. With a few different values of alpha, Hansen-Patrick becomes equivalent to other, more well-known root-finding methods. For example, when alpha equals -1, Hansen-Patrick becomes equivalent to Halley’s Method. There has been previous research into the dynamical systems that arise when varying the initial starting point or varying a family of functions. This paper deals with what happens when the initial point and function are fixed but the root-finding method varies. We are interested in spurious cycles …

Cybersecurity Strategy In Developing Nations: A Jamaica Case Study, Kevin Patrick Newmeyer

2010-2016 Archived Posters

Developing nations have been slow to develop and implement cybersecurity strategies despite a growing threat to governance and public security. This qualitative case study examined how the government and private sector in Jamaica viewed the state of cybersecurity in the country, and how the country was developing policy to respond to cyber threats.

A Simple Geometric Model Provides A Possible Quantitative Explanation Of The Advantages Of Immediate Feedback In Student Learning, Octavio Lerma, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

Calculus is a known bottleneck for many students studying science and engineering. Various techniques have been developed to enhance the students' success. A recent study published in the Notices of American Mathematical Society showed that only one factor determines the success of a technique: the presence of immediate feedback. On average, students who receive immediate feedback learn twice faster than students who are taught in a more traditional way, with a serious feedback only once or twice a semester (after a test).

The very fact that immediate feedback is helpful is not surprising: it helps the student clear misconceptions and …

Diversity Is Beneficial For A Research Group: One More Quantitative Argument, Komsan Suriya, Tatcha Sudtasan, Tonghui Wang, Octavio Lerma, Vladik Kreinovich

Departmental Technical Reports (CS)

In this paper, we propose a natural model describing competition between two research groups of the same average research strength. The analysis of this model enables us to conclude that a more diverse group has an advantage: namely, the more diverse the group, the higher the average quality of its publications.

Zipf's Law And 7 Plus Minus 2 Principle Lead To A Possible Explanation Of Daniel's Law, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

In 1961, D. R. Daniel observed that the success of a company is usually determined by three to six major factors. This observation has led to many successful management ideas, but they leave one puzzled: why three to six? why not two or seven? In this paper, we provide a possible explanation to this puzzle; namely, we show that these numbers of factors can be derived from Zipf's Law and from the 7 plus minus 2 principle.

4d Fir Digital Filter Realizations, M. T. Kousoulis, G. E. Antoniou

Department of Computer Science Faculty Scholarship and Creative Works

This paper proposes generalized circuit and state space realizations for four-dimensional (4D) Finite Impulse Response (FIR) filters. Specifically, lattice and direct-form filter structures are considered. The 4D circuit realizations utilize, for their implementation, a minimum number of delay elements. Further, the dimensions of the state-space vector, of the formulated 4D state space models, are minimal. Examples are given to demonstrate the minimality of their circuit and state-space realizations. © 2014 IEEE.

Monocular Pose Estimation And Shape Reconstruction Of Quasi-Articulated Objects With Consumer Depth Camera, Mao Ye

Theses and Dissertations--Computer Science

Quasi-articulated objects, such as human beings, are among the most commonly seen objects in our daily lives. Extensive research have been dedicated to 3D shape reconstruction and motion analysis for this type of objects for decades. A major motivation is their wide applications, such as in entertainment, surveillance and health care. Most of existing studies relied on one or more regular video cameras. In recent years, commodity depth sensors have become more and more widely available. The geometric measurements delivered by the depth sensors provide significantly valuable information for these tasks. In this dissertation, we propose three algorithms for monocular …

Virtual Cut-Through: A New Computer Communication Switching Technique, Parviz Kermani, Leonard Kleinrock

Publications and Research

No abstract provided.

An Infrastructure-Less Vehicle Counting Without Disruption, Jie Wu, Paul Sabatino, Jennifer Tsan, Zhen Jiang

Computer Science Faculty Publications

No abstract provided.