Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Engineering (44)
- Electrical and Computer Engineering (19)
- Databases and Information Systems (16)
- Other Computer Sciences (16)
- Systems Architecture (16)
-
- Mechanical Engineering (8)
- Mining Engineering (8)
- Aerospace Engineering (7)
- Operations Research, Systems Engineering and Industrial Engineering (6)
- Biology (4)
- Life Sciences (4)
- Mathematics (4)
- Statistics and Probability (4)
- Chemical Engineering (3)
- Psychology (3)
- Social and Behavioral Sciences (3)
- Chemistry (2)
- Computational Engineering (2)
- Computer Engineering (2)
- Architectural Engineering (1)
- Architecture (1)
- Artificial Intelligence and Robotics (1)
- Biochemical and Biomolecular Engineering (1)
- Civil and Environmental Engineering (1)
- Cognition and Perception (1)
- Cognitive Psychology (1)
- Keyword
-
- Security (21)
- Federated learning (15)
- Deep learning (12)
- Cloud computing (11)
- Edge computing (11)
-
- Internet (10)
- IoT (9)
- Sensor networks (9)
- Anomaly detection (8)
- Drone (8)
- Internet of Things (8)
- Routing (8)
- Wireless sensor networks (8)
- Crowdsourcing (7)
- Data Warehouses (7)
- Optimization (7)
- Privacy (7)
- Algorithms (6)
- Anomaly Detection (6)
- Big data (6)
- Deep Learning (6)
- Formal Specification (6)
- Information Resources (6)
- Large language models (6)
- Mobility (6)
- Parallel Algorithms (6)
- WHOWEDA (6)
- Approximation algorithms (5)
- Compression (5)
- Distributed (5)
- Publication Year
Articles 601 - 630 of 919
Full-Text Articles in Computer Sciences
Management Of Feature Interactions With Transactional Regions, Thomas Cottenier, Aswin Van Den Berg, Thomas Weigert
Management Of Feature Interactions With Transactional Regions, Thomas Cottenier, Aswin Van Den Berg, Thomas Weigert
Computer Science Faculty Research & Creative Works
This paper presents a modeling language to modularize the features of a system using orthogonal regions and to manage the interactions between these features. Orthogonal regions are a language construct to structure a state machine into a set of semi-independent behaviors. We introduce two concepts to manage the interactions between regions. First, we present a notion of interface between regions which captures the essence of their interactions. Second, we introduce a transactional composition operator to synchronize the regions and check the interaction for non-determinism and termination. the approach is evaluated by comparing a monolithic legacy implementation of a telecommunication component …
Experimental Evaluation Of The Effect Of Queue Management Schemes On The Performance Of High Speed Tcps In 10gbps Network Environment, Lin Xue, Cheng Cui, Suman Kumar, Seung Jong Park
Experimental Evaluation Of The Effect Of Queue Management Schemes On The Performance Of High Speed Tcps In 10gbps Network Environment, Lin Xue, Cheng Cui, Suman Kumar, Seung Jong Park
Computer Science Faculty Research & Creative Works
Queue management schemes at the routers and congestion avoidance schemes at the end points cooperate to provide good congestion solutions in computer networks. While queue management schemes are still being developed, research on congestion avoidance has come a long way to serve the bandwidth requirement of the networks (e.g. high-speed networks, data centers, etc.) at the order of 10Gbps. Because of considerable lack on the evaluation research work, there is no consensus on the choice of the queue management algorithms over these networks. To the best of our knowledge, this is the first work that presents experimental evaluation of the …
Conflict Detection And Resolution For Product Line Design In A Collaborative Decision Making Environment, Xiaoqing Frank Liu, Eric Christopher Barnes, Juha Erik Savolainen
Conflict Detection And Resolution For Product Line Design In A Collaborative Decision Making Environment, Xiaoqing Frank Liu, Eric Christopher Barnes, Juha Erik Savolainen
Computer Science Faculty Research & Creative Works
Ensuring that the non-functional requirements (NFRs), of a system are satisfied is an essential task in software development. However, this task is complicated by the fact that many NFRs conflict with each other from multiple perspectives. It is essential to resolve conflicts collectively in a collaborative decision-making process since stakeholders often disagree on how conflicts should be resolved. in this paper, we describe a method for dividing high-level NFR conflicts within a product line into more manageable sub-problems. Stakeholders make use of an argumentation based collaborative decision support system to determine which design alternatives provide the best trade-offs between NFRs. …
Ensuring Distributed Accountability For Data Sharing In The Cloud, Smitha Sundareswaran, Anna Squicciarini, Dan Lin
Ensuring Distributed Accountability For Data Sharing In The Cloud, Smitha Sundareswaran, Anna Squicciarini, Dan Lin
Computer Science Faculty Research & Creative Works
Cloud computing enables highly scalable services to be easily consumed over the Internet on an as-needed basis. a major feature of the cloud services is that users' data are usually processed remotely in unknown machines that users do not own or operate. While enjoying the convenience brought by this new emerging technology, users' fears of losing control of their own data (particularly, financial and health data) can become a significant barrier to the wide adoption of cloud services. to address this problem, in this paper, we propose a novel highly decentralized information accountability framework to keep track of the actual …
Transmission Scheduling Based On A New Conflict Graph Model For Multicast In Multihop Wireless Networks, Maggie Cheng, Quanmin Ye
Transmission Scheduling Based On A New Conflict Graph Model For Multicast In Multihop Wireless Networks, Maggie Cheng, Quanmin Ye
Computer Science Faculty Research & Creative Works
In multicast applications, the end-to-end delay from the source to a group member is determined by the multicast tree topology and the waiting time at each relay node. This paper addresses when the multicast tree is given how to schedule wireless nodes for transmission so that network delay is minimized. We first model the conflict relation among wireless transmissions in a conflict graph, and then we compute a transmission schedule based on an Integer Linear Programming (ILP) model. Since solving ILP problem is NP-hard, a heuristic is designed to solve the ILP problem. the resulting schedule is conflict-free, which is …
Roman: Routing And Opportunistic Management Of Airborne Networks, Hemanth Meka, Lekshmi Manian Chidambaram, Sanjay K. Madria, Mark Linderman, Mohan Kumar, Sharma Chakravarthy
Roman: Routing And Opportunistic Management Of Airborne Networks, Hemanth Meka, Lekshmi Manian Chidambaram, Sanjay K. Madria, Mark Linderman, Mohan Kumar, Sharma Chakravarthy
Computer Science Faculty Research & Creative Works
Most of the routing and replication algorithms for Mobile Peer to Peer (M-P2P) networks assume the network to be large and therefore, the architecture and algorithms are designed to be scalable. These algorithms however may not perform well with limited number of nodes in a network such as of UAVs. Thus, it is better to design algorithms to increase the efficiency of a small network if scalability is no longer an issue. for such small networks, we design and simulate an effective two layered graph-based routing algorithm using store/forward concept. We also take into account UAVs orientation and configuration of …
Empirical Study Of An Intelligent Argumentation System In Mcdm, Xiaoqing Liu, Rubal Wanchoo, Ravi Santosh Arvapally
Empirical Study Of An Intelligent Argumentation System In Mcdm, Xiaoqing Liu, Rubal Wanchoo, Ravi Santosh Arvapally
Computer Science Faculty Research & Creative Works
Intelligent argumentation based collaborative decision-making system assists stakeholders in a decision-making group to assess various alternatives under different criterion based on the argumentation. a performance score of each alternative under every criterion in Multi-Criteria Decision Making (MCDM) is represented in a decision matrix and it denotes satisfaction of the criteria by that alternative. the process of determining the performance scores of alternatives in a decision matrix for criterion could be controversial sometimes because of the subjective nature of criterion. We developed a framework for acquiring performance scores in a decision matrix for multi-criteria decision making using an intelligent argumentation and …
A Cooperative Game Theoretic Approach For Data Replication In Mobile Ad-Hoc Networks, Dan Hirsch, Sanjay Madria
A Cooperative Game Theoretic Approach For Data Replication In Mobile Ad-Hoc Networks, Dan Hirsch, Sanjay Madria
Computer Science Faculty Research & Creative Works
The mobile computing environment provides many benefits such as ubiquitous access to computing but include constraints on resources such as: Available bandwidth and battery life. Replication is a widely recognized method for balancing the demands of storage space with bandwidth and battery life. We propose a novel scheme that seeks to strategically balance these constrained resources through a cooperative game-theoretic approach for replication in a mobile environment. Our replication strategy relies on the cooperation of the nodes within the network to make replica caching decisions which are spatiotemporally local-optimal for the network from an energy and bandwidth conservation standpoint. in …
A Secure And Distributed Framework To Identify And Share Needed Information, Wei Jiang, Bharath K. Samanthula
A Secure And Distributed Framework To Identify And Share Needed Information, Wei Jiang, Bharath K. Samanthula
Computer Science Faculty Research & Creative Works
Information analysis and communication play significant roles in decision making, especially in battle grounds and situations where national security is under threat. in many situations when information in consideration is sensitive/confidential, it is in our best interests to analyze and share only needed information to minimize the potential of security breach regarding other irrelevant but sensitive information. Thus, the goal of this paper is to investigate the required methodologies and propose an advanced communication framework that enables different entities in distributed environments to identify, share and analyze only needed information, without disclosing other unwanted but sensitive information. Such a framework …
Scaling Laws Of Key Predistribution Protocols In Wireless Sensor Networks, Wenjun Gu, Sriram Chellappan, Xiaole Bai, Honggang Wang
Scaling Laws Of Key Predistribution Protocols In Wireless Sensor Networks, Wenjun Gu, Sriram Chellappan, Xiaole Bai, Honggang Wang
Computer Science Faculty Research & Creative Works
Many key predistribution (KP) protocols have been proposed and are well accepted in randomly deployed wireless sensor networks (WSNs). Being distributed and localized, they are perceived to be scalable as node density and network dimension increase. While it is true in terms of communication/computation overhead, their scalability in terms of security performance is unclear. in this paper, we conduct a detailed study on this issue. in particular, we define a new metric called Resilient Connectivity (RC) to quantify security performance in WSNs. We then conduct a detailed analytical investigation on how KP protocols scale with respect to node density and …
Exploring Caching For Efficient Collection Operations, Swetha Surapaneni, Venkata Krishna Suhas Nerella, Sanjay K. Madria, Thomas Weigert
Exploring Caching For Efficient Collection Operations, Swetha Surapaneni, Venkata Krishna Suhas Nerella, Sanjay K. Madria, Thomas Weigert
Computer Science Faculty Research & Creative Works
Many useful programs operate on collection types. Extensive libraries are available in many programming languages, such as the C++ Standard Template Library, which make programming with collections convenient. Extending programming languages to provide collection queries as first class constructs in the language would not only allow programmers to write queries explicitly in their programs but it would also allow compilers to leverage the wealth of experience available from the database domain to optimize such queries. This paper describes an approach to reducing the run time of programs involving explicit collection queries by leveraging a cache to store previously computed results. …
Personalized Searching For Web Service Using User Interests, Rong Hu, Wanchun Dou, Xiaoqing Frank Liu, Jianxun Liu
Personalized Searching For Web Service Using User Interests, Rong Hu, Wanchun Dou, Xiaoqing Frank Liu, Jianxun Liu
Computer Science Faculty Research & Creative Works
Users usually have different prospective even they input a same keyword to search Web services. It is a challenge to personalize web service search engine as more and more keyword-like Web services becoming available on Internet. User interest plays an important role in personalizing search result. Therefore, through interest extraction, Web service search engine is personalized. at last, an experiment is presented to demonstrate the feasibility of the method. © 2011 IEEE.
Wsrank: A Method For Web Service Ranking In Cloud Environment, Rong Hu, Wanchun Dou, Xiaoqing Frank Liu, Jianxun Liu
Wsrank: A Method For Web Service Ranking In Cloud Environment, Rong Hu, Wanchun Dou, Xiaoqing Frank Liu, Jianxun Liu
Computer Science Faculty Research & Creative Works
For services that have similar functionalities, if they are published by different cloud platforms, it is a challenge to evaluate them, for satisfying different end users' personal preferences. in view of this challenge, a method for web service ranking, named WSRank, is investigated in cloud environment in this paper. It aims at ranking different Web services published by different cloud platforms, taking advantage of Page Rank principle. at last, a case study and experiment are presented to demonstrate the feasibility of the method. © 2011 IEEE.
Middleware For Supporting Content Sharing In Dynamic Networks, Mohan Kumar, Sharma Chakravarthy, Sanjay Kumar Madria, Mark Linderman, Waseem Naqvi
Middleware For Supporting Content Sharing In Dynamic Networks, Mohan Kumar, Sharma Chakravarthy, Sanjay Kumar Madria, Mark Linderman, Waseem Naqvi
Computer Science Faculty Research & Creative Works
This paper proposes a middleware architecture to enable seamless content sharing in highly dynamic networks, such as those involving a number of aerial unmanned autonomous vehicles (UAVs), which are characterized by constantly changing connectivity and network topology. the proposed middleware maintains up-to-date network status as well as metadata information about data objects in the network nodes, masking the content sharing applications from the network dynamics and faults. Mechanisms for node discovery, message passing, and network management are developed. a strategy is also proposed for efficient replication to ensure availability of data in highly mobile environments. the middleware includes a message …
Link Activity Scheduling For Minimum End-To-End Latency In Multihop Wireless Sensor Networks, Maggie X. Cheng, Xuan Gong, Yibo Xu, Lin Cai
Link Activity Scheduling For Minimum End-To-End Latency In Multihop Wireless Sensor Networks, Maggie X. Cheng, Xuan Gong, Yibo Xu, Lin Cai
Computer Science Faculty Research & Creative Works
End-to-end delay is an important QoS metric in sensor networks as well as any application that involves transferring of small-sized files. in this paper, we address how to minimize the end-to-end delay in a multihop wireless network. End-to-end delay is defined as the total time it takes for a single packet to reach the destination. It is a result of many factors including the length of the routing path and the interference level along the path. in this paper we present a transmission scheduling scheme that minimizes the end-to-end delay along a given route. the link scheduling scheme is based …
Information Flow Security In Cyber-Physical Systems, Thoshitha Gamage, Ravi Akella, Thomas Roth, Bruce Mcmillin
Information Flow Security In Cyber-Physical Systems, Thoshitha Gamage, Ravi Akella, Thomas Roth, Bruce Mcmillin
Computer Science Faculty Research & Creative Works
Preserving the confidentiality of sensitive internal actions is a unique challenge in Cyber-Physical Systems (CPSs) due to the inherent external observability of such systems and the tight coupling between their cyber and physical domains. the far-reaching objective of this work is to develop a science of self-obfuscating systems based on the composition of simple building blocks. a model of Nondeducibility composes the building blocks under information flow security properties. to this end, this paper proposes fundamental theories on external observability for basic regular networks and the concept of "event compensation". Copyright © 2011 ACM.
Energy-Efficient Real-Time Data Compression In Wireless Sensor Networks, Tommy Szalapski, Sanjay Madria
Energy-Efficient Real-Time Data Compression In Wireless Sensor Networks, Tommy Szalapski, Sanjay Madria
Computer Science Faculty Research & Creative Works
Wireless sensor networks possess significant limitations in storage, bandwidth, and power. Additionally, real-time sensor networks cannot tolerate high latency. While some good compression algorithms exist specific to sensor networks, in this paper we present an energy-efficient method with high compression ratio that reduces latency, storage and bandwidth usage further in comparison with some other recently proposed algorithms. Our Huffman style compression scheme exploits temporal locality and delta compression to provide better bandwidth utilization in the network, thus reducing latency for real time applications. Our performance evaluations show comparable compression ratios and energy savings with a significant decrease in latency compared …
A Multi-Tiered Architecture For Content Retrieval In Mobile Peer-To-Peer Networks, Neelanjana Dutta, Raghavendra Kotikalapudi, Abhinav Saxena, Sriram Chellappan
A Multi-Tiered Architecture For Content Retrieval In Mobile Peer-To-Peer Networks, Neelanjana Dutta, Raghavendra Kotikalapudi, Abhinav Saxena, Sriram Chellappan
Computer Science Faculty Research & Creative Works
In this paper, we address content retrieval in Mobile Peer-to-Peer (P2P) Networks. We design a multi-tiered architecture for content retrieval, where at Tier 1, we design a protocol for content similarity governed by a parametera that trades accuracy with search overhead. at Tier 2, we introduce a novel concept called Chained Bloom Filters and design a protocol where popular search items are linked with popular content at each node in an efficient manner for subsequent retrieval. Extensive analysis and numerical simulations demonstrate the effectiveness of our techniques. © 2011 IEEE.
Energy Efficient, Adaptive And Collaborative Data Sampling In Wireless Sensor Networks, Tommy Szalapski, Sanjay Kumar Madria
Energy Efficient, Adaptive And Collaborative Data Sampling In Wireless Sensor Networks, Tommy Szalapski, Sanjay Kumar Madria
Computer Science Faculty Research & Creative Works
This paper outlines some interesting research issues and solution approaches related to collaborative data sampling in wireless sensor networks for efficient energy and bandwidth utilization. © 2011 IEEE.
A Secure Data Aggregation Based Trust Management Approach For Dealing With Untrustworthy Motes In Sensor Network, Nayot Poolsappasit, Sanjay Madria
A Secure Data Aggregation Based Trust Management Approach For Dealing With Untrustworthy Motes In Sensor Network, Nayot Poolsappasit, Sanjay Madria
Computer Science Faculty Research & Creative Works
Efficient power management is vital for increasing the life of wireless sensor networks (WSN). the main reason is that the radio transmission consumes energy approximately three times comparing to other operations. Thus, techniques such as data aggregation have been widely used in WSN to preserve energy. Despite its appealing and powerful features, data aggregation requires a high level of security as tampering with aggregating data can be suspected due to small bit errors. We propose a comprehensive trust management approach to deal with the potential dishonest and faulty motes in sensor networks. Unlike other trust management approaches, we take into …
Performance Improvement For Collection Operations Using Join Query Optimization, Venkata Krishna Suhas Nerella, Sanjay Kumar Madria, Thomas Weigert
Performance Improvement For Collection Operations Using Join Query Optimization, Venkata Krishna Suhas Nerella, Sanjay Kumar Madria, Thomas Weigert
Computer Science Faculty Research & Creative Works
Programming languages with explicit support for queries over collections allow programmers to express operations on collections more abstractly than relying on their realization in loops or through provided libraries. Join optimization techniques from the field of database technology support efficient realizations of such language constructs. We describe an algorithm that performs run-time query optimization and is effective for single runs of a program. the proposed approach relies on histograms built from the data at run time to estimate the selectivity of joins and predicates in order to construct query plans. Information from earlier executions of the same query during run …
Investigating Combinatorial Approaches In Virtual Screening On Human Inducible 6-Phosphofructo-2-Kinase/Fructose-2,6-Bisphosphatase (Pfkfb3): A Case Study For Small Molecule Kinases, Robert B. Crochet, Michael C. Cavalier, Minsuh Seo, Jeong Do Kim, Young Sun Yim, Seung Jong Park, Yong Hwan Lee
Investigating Combinatorial Approaches In Virtual Screening On Human Inducible 6-Phosphofructo-2-Kinase/Fructose-2,6-Bisphosphatase (Pfkfb3): A Case Study For Small Molecule Kinases, Robert B. Crochet, Michael C. Cavalier, Minsuh Seo, Jeong Do Kim, Young Sun Yim, Seung Jong Park, Yong Hwan Lee
Computer Science Faculty Research & Creative Works
Efforts toward improving the predictiveness in tier-based approaches to virtual screening (VS) have mainly focused on protein kinases. Despite their significance as drug targets, small molecule kinases have been rarely tested with these approaches. In this paper, we investigate the efficacy of a pharmacophore screening-combined structure-based docking approach on the human inducible 6-phosphofructo-2-kinase/fructose-2,6-bisphosphatase, an emerging target for cancer chemotherapy. Six out of a total 1364 compounds from NCI's Diversity Set II were selected as true actives via throughput screening. Using a database constructed from these compounds, five programs were tested for structure-based docking (SBD) performance, the MOE of which showed …
Confidentiality Preserving Security Properties For Cyber-Physical Systems, Thoshitha T. Gamage, Thomas P. Roth, Bruce M. Mcmillin
Confidentiality Preserving Security Properties For Cyber-Physical Systems, Thoshitha T. Gamage, Thomas P. Roth, Bruce M. Mcmillin
Computer Science Faculty Research & Creative Works
The work in this paper presents recent advances in developing a theory of information flow security specifically geared towards preserving the event confidentiality in Cyber-Physical Systems (CPSs). Preserving the confidentiality of sensitive internal actions is a unique challenge in CPSs due to the inherent external observability of such systems and the tight coupling between their cyber and physical domains. the far-reaching objective of this work is to develop a science of self-obfuscating systems based on the composition of simple building blocks. a model of Nondeducibility composes the building blocks under information flow security properties. to this end, this work presents …
Maximum Lifetime Coverage Preserving Scheduling Algorithms In Sensor Networks, Maggie X. Cheng, Xuan Gong
Maximum Lifetime Coverage Preserving Scheduling Algorithms In Sensor Networks, Maggie X. Cheng, Xuan Gong
Computer Science Faculty Research & Creative Works
In wireless sensor networks, when each target is covered by multiple sensors, sensors can take turns to monitor the targets in order to extend the lifetime of the network. in this paper, we address how to improve network lifetime through optimal scheduling of sensor nodes. We present two algorithms to achieve the maximum lifetime while maintaining the required coverage: A linear programming-Based exponential-time exact solution, and an approximation algorithm. Numerical simulation results from the approximation algorithm are compared to the exact solution and show a high degree of accuracy and efficiency. © 2010 Springer Science Business Media, LLC.
An Engineered Approach To Stem Cell Culture: Automating The Decision Process For Real-Time Adaptive Subculture Of Stem Cells, Dai Fei Elmer Ker, Lee E. Weiss, Silvina N. Junkers, Mei Chen, Zhaozheng Yin, Mike F. Sandbothe, Seungil Huh, Sungeun Eom, Ryoma Bise, Elvira Osuna-Highley, Takeo Kanade, Phil Gordon Campbell
An Engineered Approach To Stem Cell Culture: Automating The Decision Process For Real-Time Adaptive Subculture Of Stem Cells, Dai Fei Elmer Ker, Lee E. Weiss, Silvina N. Junkers, Mei Chen, Zhaozheng Yin, Mike F. Sandbothe, Seungil Huh, Sungeun Eom, Ryoma Bise, Elvira Osuna-Highley, Takeo Kanade, Phil Gordon Campbell
Computer Science Faculty Research & Creative Works
Current cell culture practices are dependent upon human operators and remain laborious and highly subjective, resulting in large variations and inconsistent outcomes, especially when using visual assessments of cell confluency to determine the appropriate time to subculture cells. Although efforts to automate cell culture with robotic systems are underway, the majority of such systems still require human intervention to determine when to subculture. Thus, it is necessary to accurately and objectively determine the appropriate time for cell passaging. Optimal stem cell culturing that maintains cell pluripotency while maximizing cell yields will be especially important for efficient, cost-effective stem cell-based therapies. …
Paim: Peer-Based Automobile Identity Management In Vehicular Ad-Hoc Network, Anna Squicciarini, Dan Lin, Alessandro Mancarella
Paim: Peer-Based Automobile Identity Management In Vehicular Ad-Hoc Network, Anna Squicciarini, Dan Lin, Alessandro Mancarella
Computer Science Faculty Research & Creative Works
The emerging Vehicular Ad-hoc Network (VANET) technology will enable many exciting applications such as vehicular safety assistance and mobile entertainment. One of the key challenges toward successful roll-out of VANET applications is to provide security and privacy preserving mechanisms for users. Existing efforts on this topic rely heavily on infrastructure like road-side units which however are not available everywhere. to minimize the dependence on infrastructure, we propose a novel Peer-Based Automobile Identity Management (PAIM) Framework which is mainly based on vehicle-to-vehicle communication. PAIM supports dynamic event-Based moving zones formed by vehicles sharing common interest. PAIM achieves the level of privacy …
Promoting Distributed Accountability In The Cloud, Smitha Sundareswaran, Anna Squicciarini, Dan Lin, Shuo Huang
Promoting Distributed Accountability In The Cloud, Smitha Sundareswaran, Anna Squicciarini, Dan Lin, Shuo Huang
Computer Science Faculty Research & Creative Works
Cloud computing enables highly scalable services to be easily consumed over the Internet on an as-needed basis. a major feature of the cloud services is that users' data is usually processed remotely in unknown machines that users do not own or operate. While enjoying the convenience brought by this new emerging technology, users' fears of losing control of their own data (particularly financial and health data) can become a significant barrier to the wide adoption of cloud services. to address this problem, in this paper, we propose a novel highly decentralized information accountability framework to keep track of the actual …
Roar: A Reference Ontology For Anatomical Relations, Alton B. Coalter, Jennifer L. Leopold
Roar: A Reference Ontology For Anatomical Relations, Alton B. Coalter, Jennifer L. Leopold
Computer Science Faculty Research & Creative Works
The ontology has become a useful model for organizing knowledge. This is particularly true in the field of biomedicine, where individual ontologies have been created for specific data domains ranging from genomics through species morphologies to human anatomical reference ontologies. Although specific sets of relationships have been proposed to improve the accuracy and consistency of such ontologies, there has been little to nothing proposed concerning the organization of those relationships. to help address this deficiency, herein we present a Reference Ontology of Anatomical Relations (ROAR). ROAR extends the concepts used in existing biomedical ontologies by defining and hierarchically organizing temporal, …
Security Requirements Analysis, Specification, Prioritization And Policy Development In Cyber-Physical Systems, Kenneth Kofi Fletcher, Xiaoqing Liu
Security Requirements Analysis, Specification, Prioritization And Policy Development In Cyber-Physical Systems, Kenneth Kofi Fletcher, Xiaoqing Liu
Computer Science Faculty Research & Creative Works
In recent past, the security of cyber-physical systems (CPSs) has been the subject of major concern. One of the reasons is that CPSs are often applied to mission-critical processes. Also, the automation CPSs bring in managing physical processes, and the detail of information available to them for carrying out their tasks, make securing them a prime importance. Securing CPSs is a difficult task as systems are interconnected. in order to achieve a continuous secured CPS environment, there is the need for an integrated methodology to analyze, specify and prioritize security requirements and also to develop policies to meet them. First, …
Cross-Layer Throughput Optimization With Power Control In Sensor Networks, Maggie Xiaoyan Cheng, Xuan Gong, Lin Cai, Xiaohua Jia
Cross-Layer Throughput Optimization With Power Control In Sensor Networks, Maggie Xiaoyan Cheng, Xuan Gong, Lin Cai, Xiaohua Jia
Computer Science Faculty Research & Creative Works
In wireless sensor networks, transmission power has a significant impact on network throughput as wireless interference increases with transmission power, and interference negatively impacts the network throughput. in this paper, we try to improve the network throughput through cross-layer optimization. We first present two algorithms to compute the transmission power of each node with the objectives of minimizing the total transmission power and minimizing the total interference, respectively, from which we can obtain a network topology that ensures a connected path from each source to the sink; then, we compute the maximum achievable throughput from the obtained topology by using …