Open Access. Powered by Scholars. Published by Universities.®

Systems Architecture Commons

Open Access. Powered by Scholars. Published by Universities.®

678 Full-Text Articles 658 Authors 190122 Downloads 60 Institutions

All Articles in Systems Architecture

Faceted Search

678 full-text articles. Page 1 of 18.

Reengineering A 2-Tier Database Application With Software Architecture, Hong G. Jung 2017 Southern Illinois University Carbondale

Reengineering A 2-Tier Database Application With Software Architecture, Hong G. Jung

ASA Multidisciplinary Research Symposium

The purpose of this research is to demonstrate how to reengineer a legacy Database Application using to a target system with MVC and 3-layered architecture. A Coffee Inventory Management database application is used for legacy application. The benefits of the reengineering are discussed.


Software Reengineering: Reverse Engineering With Using 4+1 Architectural Views And Forward Engineering With Mvc Architecture, Shane Mueller 2017 Southern Illinois University Carbondale

Software Reengineering: Reverse Engineering With Using 4+1 Architectural Views And Forward Engineering With Mvc Architecture, Shane Mueller

ASA Multidisciplinary Research Symposium

As software complexity is increasing exponentially in our modern era, software architecture becomes increasingly important. The separation of concerns through architecture allows each programmer the opportunity to limit their need of understanding to only the portion of code for which they are responsible for, thus saving large amounts of time.


Researching Serendipity In Digital Information Environments, Lori McCay-Peet, Elaine G. Toms 2017 Western University

Researching Serendipity In Digital Information Environments, Lori Mccay-Peet, Elaine G. Toms

Quan-Hoang Vuong

Chance, luck, and good fortune are the usual go-to descriptors of serendipity, a phenomenon aptly often coupled with famous anecdotes of accidental discoveries in engineering and science in modern history such as penicillin, Teflon, and Post-it notes. Serendipity, however, is evident in many fields of research, in organizations, in everyday life—and there is more to it than luck implies. While the phenomenon is strongly associated with in-person interactions with people, places, and things, most attention of late has focused on its preservation and facilitation within digital information environments. Serendipity’s association with unexpected, positive user experiences and outcomes has ...


Network Technologies Used To Aggregate Environmental Data, Paul Stasiuk, Konstantin Läufer, George K. Thiruvathukal 2017 Loyola University Chicago

Network Technologies Used To Aggregate Environmental Data, Paul Stasiuk, Konstantin Läufer, George K. Thiruvathukal

Konstantin Läufer

The goal of the Loyola Weather Service (lws) project is to design and build a system of functioning environmental monitoring widgets that can intelligently and autonomously control the environment around them based on set thresholds and triggers. The widgets will also have the ability to aggregate their data and easily display this data in various ways: through a user interface in the room that the widget is placed, via a web application, and programmatically via a RESTful web service.


Building Capable, Energy-Efficient, Flexible Visualization And Sensing Clusters From Commodity Tablets, Thomas Delgado Dias, Xian Yan, Konstantin Läufer, George K. Thiruvathukal 2017 Loyola University Chicago

Building Capable, Energy-Efficient, Flexible Visualization And Sensing Clusters From Commodity Tablets, Thomas Delgado Dias, Xian Yan, Konstantin Läufer, George K. Thiruvathukal

Konstantin Läufer

We explore the application of clusters of commodity tablet devices to problems spanning a “trilogy” of concerns: visualization, sensing, and computation. We conjecture that such clusters provide a low-cost, energy-efficient, flexible, and ultimately effective platform to tackle a wide range of problems within this trilogy. This is a work in progress, and we now elaborate our position and give a preliminary status report.

A wide range of Android tablet devices are available in terms of price and capabilities. “You get what you pay for” w.r.t. display resolution, sensors, and chipset---corresponding to the trilogy. $200 gets one a 1280x800-pixel ...


Open Source Artificial Intelligence In A Biological/Ecological Context, Trevor Grant 2017 Illinois State University

Open Source Artificial Intelligence In A Biological/Ecological Context, Trevor Grant

Annual Symposium on Biomathematics and Ecology: Education and Research

No abstract provided.


Green Cloud - Load Balancing, Load Consolidation Using Vm Migration, Manh Duc Do 2017 Western Kentucky University

Green Cloud - Load Balancing, Load Consolidation Using Vm Migration, Manh Duc Do

Masters Theses & Specialist Projects

Recently, cloud computing is a new trend emerging in computer technology with a massive demand from the clients. To meet all requirements, a lot of cloud data centers have been constructed since 2008 when Amazon published their cloud service. The rapidly growing data center leads to the consumption of a tremendous amount of energy even cloud computing has better improved in the performance and energy consumption, but cloud data centers still absorb an immense amount of energy. To raise company’s income annually, the cloud providers start considering green cloud concepts which gives an idea about how to optimize CPU ...


Performance Modeling Of Distributed Collaboration Services, Toqeer A. Israr, Gregor V. Bochmann 2017 Eastern Illinois University

Performance Modeling Of Distributed Collaboration Services, Toqeer A. Israr, Gregor V. Bochmann

Toqeer A Israr

This paper deals with performance modeling of distributed applications, service compositions and workflow systems. From the functional perspective, the distributed application is modeled as a collaboration involving several roles, and its behavior is defined in terms of a composition from several sub-collaborations using the standard sequencing operators found in UML Activity Diagrams and similar formalisms. For the performance perspective, each collaboration is characterized by a certain number of independent input events and dependent output events, and the performance of the collaboration is defined by the minimum delays that apply for a given output event in respect to each input event ...


Design Of Batrun Distributed Processing System, Fredy Tandiary, Suraj C. Kothari, Ashish Dixit 2017 Iowa State University

Design Of Batrun Distributed Processing System, Fredy Tandiary, Suraj C. Kothari, Ashish Dixit

Suraj Kothari

This paper discusses the design of BATRUN Distributed Processing System (DPS). We have developed this system to automate the execution of jobs in a cluster of workstations where machines belong to different owners. The objective is to use a general purpose cluster as one massive computer for processing large applications. In contrast to a dedicated cluster, the scheduling in BATRUN DPS must ensure that only the idle cycles are used for distributed computing and local users, when they are operating, have the full control of their machines. BATRUN DPS has several unique features: (1) group-based scheduling policy to ensure execution ...


Quo Vadis-A Framework For Intelligent Routing In Large Communication Networks., Armin Mikler, Johnny S. Wong, Vasant Honavar 2017 Iowa State University

Quo Vadis-A Framework For Intelligent Routing In Large Communication Networks., Armin Mikler, Johnny S. Wong, Vasant Honavar

Johnny Wong

This paper presents Quo Vadis, an evolving framework for intelligent traffic management in very large communication networks. Quo Vadis is designed to exploit topological properties of large networks as well as their spatio-temporal dynamics to optimize multiple performance criteria through cooperation among nodes in the network. It employs a distributed representation of network state information using local load measurements supplemented by a less precise global summary. Routing decisions in Quo Vadis are based on parameterized heuristics designed to optimize various performance metrics in an anticipatory or pro-active as well as compensatory or reactive mode and to minimize the overhead associated ...


An Object Oriented Approach To Modeling And Simulation Of Routing In Large Communication Networks, Armin Mikler, Johnny S. Wong, Vasant Honavar 2017 Iowa State University

An Object Oriented Approach To Modeling And Simulation Of Routing In Large Communication Networks, Armin Mikler, Johnny S. Wong, Vasant Honavar

Johnny Wong

The complexity (number of entities, interactions between entities, and resulting emergent dynamic behavior) of large communication environments which contain hundreds of nodes and links make simulation an important tool for the study of such systems. Given the difficulties associated with complete analytical treatment of complex dynamical systems, it is often the only practical tool that is available. This paper presents an example of a flexible, modular, object-oriented toolbox designed to support modeling and experimental analysis of a large family of heuristic knowledge representation and decision functions for adaptive self-managing communication networks with particular emphasis on routing strategies. It discusses in ...


Quo Vadis - Adaptive Heuristics For Routing In Large Communication Networks, Armin Mikler, Johnny S. Wong, Vasant Honavar 2017 Iowa State University

Quo Vadis - Adaptive Heuristics For Routing In Large Communication Networks, Armin Mikler, Johnny S. Wong, Vasant Honavar

Johnny Wong

This paper presents Quo Vadis, an evolving framework for intelligent traffic management in very large communication networks. Quo Vadis is designed to exploit topological properties of large networks as well as their spatio-temporal dynamics to optimize multiple performance criteria through cooperation among nodes in the network. It employs a distributed representation of network state information using local load measurements supplemented by a less precise global summary. Routing decisions in Quo Vadis are based on parameterized heuristics designed to optimize various performance metrics in an anticipatory or pro-active as well as compensatory or reactive mode and to minimize the overhead associated ...


Utility-Theoretic Heuristics For Intelligent Adaptive Routing In Large Communcation Networks, Armin Mikler, Vasant Honavar, Johnny S. Wong 2017 Iowa State University

Utility-Theoretic Heuristics For Intelligent Adaptive Routing In Large Communcation Networks, Armin Mikler, Vasant Honavar, Johnny S. Wong

Johnny Wong

Utility theory offers an elegant and powerful theoretical framework for design and analysis of autonomous adaptive communication networks. Routing of messages in such networks presents a real-time instance of a multi-criterion quasi-optimization problem in a dynamic and uncertain environment. In this paper, we examine several heuristic decision functions that can be used to guide messages along a near-optimal (e.g., minimum delay) path in a large network. We present an analysis of properties of such heuristics under a set of simplifying assumptions about the network topology and load dynamics. In particular, we identify the conditions under which one such utility-theoretic ...


Scalable Kernel Methods Via Doubly Stochastic Gradients, Bo Dai, Bo Xie, Niao He, Yingyu Liang, Anant Raj, Maria-Florina Balcan, Le Song 2017 Georgia Institute of Technology

Scalable Kernel Methods Via Doubly Stochastic Gradients, Bo Dai, Bo Xie, Niao He, Yingyu Liang, Anant Raj, Maria-Florina Balcan, Le Song

Bo Xie

The general perception is that kernel methods are not scalable, so neural nets become the choice for large-scale nonlinear learning problems. Have we tried hard enough for kernel methods? In this paper, we propose an approach that scales up kernel methods using a novel concept called doubly stochastic functional gradients''. Based on the fact that many kernel methods can be expressed as convex optimization problems, our approach solves the optimization problems by making two unbiased stochastic approximations to the functional gradient---one using random training points and another using random features associated with the kernel---and performing descent steps with this noisy ...


Exploiting Android System Services Through Bypassing Service Helpers, Yachong GU, Yao CHENG, Lingyun YING, Yemian LU, Qi LI, Purui SU 2017 Chinese Academy of Sciences

Exploiting Android System Services Through Bypassing Service Helpers, Yachong Gu, Yao Cheng, Lingyun Ying, Yemian Lu, Qi Li, Purui Su

Research Collection School Of Information Systems

Android allows applications to communicate with system service via system service helper so that applications can use various functions wrapped in the system services. Meanwhile, system services leverage the service helpers to enforce security mechanisms, e.g. input parameter validation, to protect themselves against attacks. However, service helpers can be easily bypassed, which poses severe security and privacy threats to system services, e.g., privilege escalation, function execution without users’ interactions, system service crash, and DoS attacks. In this paper, we perform the first systematic study on such vulnerabilities and investigate their impacts. We develop a tool to analyze all ...


Custom T-Shirt Designs, Ranjan Khadka 2017 California State University, San Bernardino

Custom T-Shirt Designs, Ranjan Khadka

Electronic Theses, Projects, and Dissertations

Custom T-shirt Designs is a web-based application. The purpose of this project is to provide a website that would allow customers to be able to customize T-shirt and place an order of custom T-shirt. Customers can sign up, sign in, select T-shirt color, add text, choose Font, choose Font color, upload an image, apply filters to images, transform text or images, choose T-shirt size and save designs for future references. Customers would be able to add the design to a cart, manage cart and checkout with their credit card to purchase for the order and view their previous orders. The ...


Switching Between Page Replacement Algorithms Based On Work Load During Runtime In Linux Kernel, Praveen Subramaniyam 2017 San Jose State University

Switching Between Page Replacement Algorithms Based On Work Load During Runtime In Linux Kernel, Praveen Subramaniyam

Master's Projects

Today’s computers are equipped with multiple processor cores to execute multiple programs effectively at a single point of time. This increase in the number of cores needs to be equipped with a huge amount of physical memory to keep multiple applications in memory at a time and to effectively switch between them, without getting affected by the low speed disk memory. The physical memory of today’s world has become so cheap such that all the computer systems are always equipped with sufficient amount of physical memory required effectively to run most of the applications. Along with the memory ...


Programming Models' Support For Heterogeneous Architecture, Wei Wu 2017 University of Tennessee, Knoxville

Programming Models' Support For Heterogeneous Architecture, Wei Wu

Doctoral Dissertations

Accelerator-enhanced computing platforms have drawn a lot of attention due to their massive peak computational capacity. Heterogeneous systems equipped with accelerators such as GPUs have become the most prominent components of High Performance Computing (HPC) systems. Even at the node level the significant heterogeneity of CPU and GPU, i.e. hardware and memory space differences, leads to challenges for fully exploiting such complex architectures. Extending outside the node scope, only escalate such challenges.

Conventional programming models such as data- ow and message passing have been widely adopted in HPC communities. When moving towards heterogeneous systems, the lack of GPU integration ...


Comparative Analysis Of Graph Partitioning Algorithms In Context Of Computation Offloading, San Ha Seo, Jeremy Straub 2017 North Dakota State University--Fargo

Comparative Analysis Of Graph Partitioning Algorithms In Context Of Computation Offloading, San Ha Seo, Jeremy Straub

Jeremy Straub

This paper considers the efficacy of using active network technology to offload computation from small mobile devices into network node computing centers. The performance of six algorithms for use in this process is compared and conclusions are drawn.


Improving Discovery And Patron Experience Through Data Mining, Boyuan Guan, Jamie Rogers 2017 Florida International University

Improving Discovery And Patron Experience Through Data Mining, Boyuan Guan, Jamie Rogers

Works of the FIU Libraries

As information professionals, we know simple database searches are imperfect. With rich and expansive digital collections, patrons may not find content that is buried in a long list of results. So, how do we improve discovery of pertinent materials and offer serendipitous experience? Following the example of recommendation functionality in online applications like Netflix, we have developed a recommendation function for our digital library system that provides relevant content beyond the narrow scope of patrons' original search parameters. This session will outline the reasoning, methodology, and design of the recommendation system as well as preliminary results from implementation.


Digital Commons powered by bepress