Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Physical Sciences and Mathematics (4216)
- Computer Sciences (4213)
- Databases and Information Systems (1558)
- Software Engineering (1254)
- Artificial Intelligence and Robotics (747)
-
- Information Security (730)
- Graphics and Human Computer Interfaces (490)
- Numerical Analysis and Scientific Computing (454)
- Engineering (345)
- Programming Languages and Compilers (269)
- Computer Engineering (232)
- Social and Behavioral Sciences (214)
- Theory and Algorithms (212)
- Business (202)
- OS and Networks (148)
- Communication (103)
- Operations Research, Systems Engineering and Industrial Engineering (101)
- Social Media (83)
- Data Storage Systems (81)
- Medicine and Health Sciences (79)
- Education (66)
- Public Affairs, Public Policy and Public Administration (55)
- Computer and Systems Architecture (52)
- Health Information Technology (51)
- Transportation (51)
- Management Information Systems (49)
- Digital Communications and Networking (47)
- E-Commerce (44)
- Finance and Financial Management (40)
- Higher Education (30)
- Keyword
-
- Deep learning (71)
- Machine learning (59)
- Privacy (41)
- Empirical study (40)
- Deep Learning (35)
-
- Training (34)
- Security (33)
- Task analysis (32)
- Cloud computing (31)
- Data mining (31)
- Artificial intelligence (29)
- Reinforcement learning (29)
- Social media (29)
- Software engineering (29)
- Neural networks (28)
- Android (27)
- Blockchain (27)
- Feature extraction (27)
- Large Language Models (26)
- Model Check (26)
- Access control (25)
- Natural language processing (25)
- Authentication (24)
- Large language models (24)
- Privacy-preserving (24)
- Servers (24)
- Anomaly detection (23)
- Information retrieval (23)
- Visualization (23)
- Classification (22)
- Publication Year
Articles 3601 - 3630 of 4266
Full-Text Articles in Entire DC Network
A Formal Framework For Modeling And Validating Simulink Diagrams, Chunqing Chen, Jin Song Dong, Jun Sun
A Formal Framework For Modeling And Validating Simulink Diagrams, Chunqing Chen, Jin Song Dong, Jun Sun
Research Collection School Of Computing and Information Systems
Simulink has been widely used in industry to model and simulate embedded systems. With the increasing usage of embedded systems in real-time safety-critical situations, Simulink becomes deficient to analyze (timing) requirements with high-level assurance. In this article, we apply Timed Interval Calculus (TIC), a realtime specification language, to complement Simulink with TIC formal verification capability. We elaborately construct TIC library functions to model Simulink library blocks which are used to compose Simulink diagrams. Next, Simulink diagrams are automatically transformed into TIC models which preserve functional and timing aspects. Important requirements such as timing bounded liveness can be precisely specified in …
Classification Of Software Behaviors For Failure Detection: A Discriminative Pattern Mining Approach, David Lo, Hong Cheng, Jiawei Han, Siau-Cheng Khoo, Chengnian Sun
Classification Of Software Behaviors For Failure Detection: A Discriminative Pattern Mining Approach, David Lo, Hong Cheng, Jiawei Han, Siau-Cheng Khoo, Chengnian Sun
Research Collection School Of Computing and Information Systems
Software is a ubiquitous component of our daily life. We often depend on the correct working of software systems. Due to the difficulty and complexity of software systems, bugs and anomalies are prevalent. Bugs have caused billions of dollars loss, in addition to privacy and security threats. In this work, we address software reliability issues by proposing a novel method to classify software behaviors based on past history or runs. With the technique, it is possible to generalize past known errors and mistakes to capture failures and anomalies. Our technique first mines a set of discriminative features capturing repetitive series …
On Mining Rating Dependencies In Online Collaborative Rating Networks, Hady W. Lauw, Ee Peng Lim, Ke Wang
On Mining Rating Dependencies In Online Collaborative Rating Networks, Hady W. Lauw, Ee Peng Lim, Ke Wang
Research Collection School Of Computing and Information Systems
The trend of social information processing sees e-commerce and social web applications increasingly relying on user-generated content, such as rating, to determine the quality of objects and to generate recommendations for users. In a rating system, a set of reviewers assign to a set of objects different types of scores based on specific evaluation criteria. In this paper, we seek to determine, for each reviewer and for each object, the dependency between scores on any two given criteria. A reviewer is said to have high dependency between a pair of criteria when his or her rating scores on objects based …
Dynamic Programming Approximations For Partially Observable Stochastic Games, Akshat Kumar, Shlomo Zilberstein
Dynamic Programming Approximations For Partially Observable Stochastic Games, Akshat Kumar, Shlomo Zilberstein
Research Collection School Of Computing and Information Systems
Partially observable stochastic games (POSGs) provide a rich mathematical framework for planning under uncertainty by a group of agents. However, this modeling advantage comes with a price, namely a high computational cost. Solving POSGs optimally quickly becomes intractable after a few decision cycles. Our main contribution is to provide bounded approximation techniques, which enable us to scale POSG algorithms by several orders of magnitude. We study both the POSG model and its cooperative counterpart, DEC-POMDP. Experiments on a number of problems confirm the scalability of our approach while still providing useful policies.
Automatic Mining Of Functionally Equivalent Code Fragments Via Random Testing, Lingxiao Jiang, Zhendong Su
Automatic Mining Of Functionally Equivalent Code Fragments Via Random Testing, Lingxiao Jiang, Zhendong Su
Research Collection School Of Computing and Information Systems
Similar code may exist in large software projects due to some common software engineering practices, such as copying and pasting code and n-version programming. Although previous work has studied syntactic equivalence and small-scale, coarse-grained program-level and function-level semantic equivalence, it is not known whether significant fine-grained, code-level semantic duplications exist. Detecting such semantic equivalence is also desirable because it can enable many applications such as code understanding, maintenance, and optimization. In this paper, we introduce the first algorithm to automatically mine functionally equivalent code fragments of arbitrary size - down to an executable statement. Our notion of functional equivalence is …
The Impact Of Process Choice In High Maturity Environments: An Empirical Analysis, Narayanasamy Ramasubbu, Rajesh Krishna Balan
The Impact Of Process Choice In High Maturity Environments: An Empirical Analysis, Narayanasamy Ramasubbu, Rajesh Krishna Balan
Research Collection School Of Computing and Information Systems
We present the results of a three year field study of the software development process choices made by project teams at two leading offshore vendors. In particular, we focus on the performance implications of project teams that chose to augment structured, plan-driven processes to implement the CMM level-5 Key Process Areas (KPAs) with agile methods. Our analysis of 112 software projects reveals that the decision to augment the firm-recommended, plan-driven approach with improvised, agile methods was significantly affected by the extent of client knowledge and involvement, newness of technology, and the project size. Furthermore this decision had a significant and …
A Novel Framework For Efficient Automated Singer Identification In Large Music Databases, Jialie Shen, John Shepherd, Bin Cui, Kian-Lee Tan
A Novel Framework For Efficient Automated Singer Identification In Large Music Databases, Jialie Shen, John Shepherd, Bin Cui, Kian-Lee Tan
Research Collection School Of Computing and Information Systems
Over the past decade, there has been explosive growth in the availability of multimedia data, particularly image, video, and music. Because of this, content-based music retrieval has attracted attention from the multimedia database and information retrieval communities. Content-based music retrieval requires us to be able to automatically identify particular characteristics of music data. One such characteristic, useful in a range of applications, is the identification of the singer in a musical piece. Unfortunately, existing approaches to this problem suffer from either low accuracy or poor scalability. In this article, we propose a novel scheme, called Hybrid Singer Identifier (HSI), for …
Are Online Auction Markets Efficient? An Empirical Study Of Market Liquidity And Abnormal Returns., Robert J. Kauffman, Trent J Spaulding, Charles A. Wood
Are Online Auction Markets Efficient? An Empirical Study Of Market Liquidity And Abnormal Returns., Robert J. Kauffman, Trent J Spaulding, Charles A. Wood
Research Collection School Of Computing and Information Systems
Technological advances have facilitated investment in collectibles through online auction markets, where information regarding product characteristics, current and historical prices, and product availability is available to millions of market participants. However, market inefficiencies may still exist, where prices do not reflect market information and where savvy speculators can profit. Using unit root and variance ratio tests, we examine 8538 rare stamp and 56,997 rare coin auctions to evaluate the efficiency of online markets. In particular, we study market liquidity, abnormal returns and weak-form efficiency. We find an inverse relationship between market efficiency and liquidity. Bidder competition intrinsic to liquidity increases …
Joint Ranking For Multilingual Web Search, Wei Gao, Cheng Niu, Ming Zhou, Kam-Fai Wong
Joint Ranking For Multilingual Web Search, Wei Gao, Cheng Niu, Ming Zhou, Kam-Fai Wong
Research Collection School Of Computing and Information Systems
Ranking for multilingual information retrieval (MLIR) is a task to rank documents of different languages solely based on their relevancy to the query regardless of query’s language. Existing approaches are focused on combining relevance scores of different retrieval settings, but do not learn the ranking function directly. We approach Web MLIR ranking within the learning-to-rank (L2R) framework. Besides adopting popular L2R algorithms to MLIR, a joint ranking model is created to exploit the correlations among documents, and induce the joint relevance probability for all the documents. Using this method, the relevant documents of one language can be leveraged to improve …
Efficient Mining Of Closed Repetitive Gapped Subsequences From A Sequence Database, Bolin Ding, David Lo, Jiawei Han, Siau-Cheng Khoo
Efficient Mining Of Closed Repetitive Gapped Subsequences From A Sequence Database, Bolin Ding, David Lo, Jiawei Han, Siau-Cheng Khoo
Research Collection School Of Computing and Information Systems
There is a huge wealth of sequence data available, for example, customer purchase histories, program execution traces, DNA, and protein sequences. Analyzing this wealth of data to mine important knowledge is certainly a worthwhile goal. In this paper, as a step forward to analyzing patterns in sequences, we introduce the problem of mining closed repetitive gapped subsequences and propose efficient solutions. Given a database of sequences where each sequence is an ordered list of events, the pattern we would like to mine is called repetitive gapped subsequence, which is a subsequence (possibly with gaps between two successive events within it) …
Beyond Output Voting: Detecting Compromised Replicas Using Hmm-Based Behavioral Distance, Debin Gao, Michael K. Reiter, Dawn Song
Beyond Output Voting: Detecting Compromised Replicas Using Hmm-Based Behavioral Distance, Debin Gao, Michael K. Reiter, Dawn Song
Research Collection School Of Computing and Information Systems
Many host-based anomaly detection techniques have been proposed to detect code-injection attacks on servers. The vast majority, however, are susceptible to "mimicry" attacks in which the injected code masquerades as the original server software, including returning the correct service responses, while conducting its attack. "Behavioral distance," by which two diverse replicas processing the same inputs are continually monitored to detect divergence in their low-level (system-call) behaviors and hence potentially the compromise of one of them, has been proposed for detecting mimicry attacks. In this paper, we present a novel approach to behavioral distance measurement using a new type of hidden …
Rsa-Based Certificateless Public Key Encryption, Junzuo Lai, Robert H. Deng, Shengli Liu, Weidong Kou
Rsa-Based Certificateless Public Key Encryption, Junzuo Lai, Robert H. Deng, Shengli Liu, Weidong Kou
Research Collection School Of Computing and Information Systems
Certificateless Public Key Cryptography was first introduced by Al-Riyami and Paterson in order to eliminate the inherent key-escrow problem of Identity-Based Cryptography. In this paper, we present a new practical construction of certificateless public key encryption scheme without paring. Our scheme is, in the random oracle model, provably secure under the assumption that the RSA problem is intractable.
Continuous Visible Nearest Neighbour Queries, Yunjun Gao, Baihua Zheng, Wang-Chien Lee, Gencai Chen
Continuous Visible Nearest Neighbour Queries, Yunjun Gao, Baihua Zheng, Wang-Chien Lee, Gencai Chen
Research Collection School Of Computing and Information Systems
In this paper, we identify and solve a new type of spatial queries, called continuous visible nearest neighbor (CVNN) search. Given a data set P, an obstacle set O, and a query line segment q, a CVNN query returns a set of (p, R) tuples such that p ? P is the nearest neighbor (NN) to every point r along the interval R ? q as well as p is visible to r. Note that p may be NULL, meaning that all points in P are invisible to all points in R, due to the obstruction of some obstacles in …
Web Query Recommendation Via Sequential Query Prediction, Qi He, Daxin Jiang, Zhen Liao, Steven C. H. Hoi, Kuiyu Chang, Ee Peng Lim, Hang Li
Web Query Recommendation Via Sequential Query Prediction, Qi He, Daxin Jiang, Zhen Liao, Steven C. H. Hoi, Kuiyu Chang, Ee Peng Lim, Hang Li
Research Collection School Of Computing and Information Systems
Web query recommendation has long been considered a key feature of search engines. Building a good Web query recommendation system, however, is very difficult due to the fundamental challenge of predicting users' search intent, especially given the limited user context information. In this paper, we propose a novel "sequential query prediction" approach that tries to grasp a user's search intent based on his/her past query sequence and its resemblance to historical query sequence models mined from massive search engine logs. Different query sequence models were examined, including the naive variable length N-gram model, Variable Memory Markov (VMM) model, and our …
House Of Cards, M. Thulasidas
House Of Cards, M. Thulasidas
Research Collection School Of Computing and Information Systems
We are in dire straits - no doubt about it. Our banks and financial edifices are collapsing. Those left standing also look shaky. The financial industry as a whole is battling to survive. And, as its frontline warriors, we will bear the brunt of the blood- bath sure to ensue any minute now. A good opportunity to play solitaire?
Pat: Towards Flexible Verification Under Fairness, Jun Sun, Yang Liu, Jin Song Dong, Jun Pang
Pat: Towards Flexible Verification Under Fairness, Jun Sun, Yang Liu, Jin Song Dong, Jun Pang
Research Collection School Of Computing and Information Systems
Recent development on distributed systems has shown that a variety of fairness constraints (some of which are only recently defined) play vital roles in designing self-stabilizing population protocols. Current practice of system analysis is, however, deficient under fairness. In this work, we present PAT, a toolkit for flexible and efficient system analysis under fairness. A unified algorithm is proposed to model check systems with a variety of fairness effectively in two different settings. Empirical evaluation shows that PAT complements existing model checkers in terms of fairness. We report that previously unknown bugs have been revealed using PAT against systems functioning …
Scale-Rotation Invariant Pattern Entropy For Keypoint-Based Near-Duplicate Detection, Wan-Lei Zhao, Chong-Wah Ngo
Scale-Rotation Invariant Pattern Entropy For Keypoint-Based Near-Duplicate Detection, Wan-Lei Zhao, Chong-Wah Ngo
Research Collection School Of Computing and Information Systems
Near-duplicate (ND) detection appears as a timely issue recently, being regarded as a powerful tool for various emerging applications. In the Web 2.0 environment particularly, the identification of near-duplicates enables the tasks such as copyright enforcement, news topic tracking, image and video search. In this paper, we describe an algorithm, namely Scale-Rotation invariant Pattern Entropy (SR-PE), for the detection of near-duplicates in large-scale video corpus. SR-PE is a novel pattern evaluation technique capable of measuring the spatial regularity of matching patterns formed by local keypoints. More importantly, the coherency of patterns and the perception of visual similarity, under the scenario …
Real-Time Near-Duplicate Elimination For Web Video Search With Content And Context, Xiao Wu, Chong-Wah Ngo, Alexander G. Hauptmann
Real-Time Near-Duplicate Elimination For Web Video Search With Content And Context, Xiao Wu, Chong-Wah Ngo, Alexander G. Hauptmann
Research Collection School Of Computing and Information Systems
With the exponential growth of social media, there exist huge numbers of near-duplicate web videos, ranging from simple formatting to complex mixture of different editing effects. In addition to the abundant video content, the social web provides rich sets of context information associated with web videos, such as thumbnail image, time duration and so on. At the same time, the popularity of Web 2.0 demands for timely response to user queries. To balance the speed and accuracy aspects, in this paper, we combine the contextual information from time duration, number of views, and thumbnail images with the content analysis derived …
Learning Image‐Text Associations, Tao Jiang, Ah-Hwee Tan
Learning Image‐Text Associations, Tao Jiang, Ah-Hwee Tan
Research Collection School Of Computing and Information Systems
Web information fusion can be defined as the problem of collating and tracking information related to specific topics on the World Wide Web. Whereas most existing work on Web information fusion has focused on text-based multidocument summarization, this paper concerns the topic of image and text association, a cornerstone of cross-media Web information fusion. Specifically, we present two learning methods for discovering the underlying associations between images and texts based on small training data sets. The first method based on vague transformation measures the information similarity between the visual features and the textual features through a set of predefined domain-specific …
An Examination Of Perceptions Of Male And Female Avatars, D. Dewester, Fiona Fui-Hoon Nah, S. Gervais, Keng Siau
An Examination Of Perceptions Of Male And Female Avatars, D. Dewester, Fiona Fui-Hoon Nah, S. Gervais, Keng Siau
Research Collection School Of Computing and Information Systems
Virtual worlds are three-dimensional, computer-generated worlds in which users take the form of avatars. Through their avatars, users can interact with objects and other avatars in the virtual world. Virtual worlds are growing in importance in both educational institutions and businesses. Educational institutions have adopted virtual worlds as a medium for instructional delivery whereas businesses are using virtual worlds for recruitment, training, collaboration, and marketing. Given these emerging phenomena, a better understanding of behavioral and perceptual issues in virtual worlds is warranted. In this paper, we propose a research model to study gender stereotypicality of male and female avatars and …
Stochastic Modeling Western Paintings For Effective Classification, Jialie Shen
Stochastic Modeling Western Paintings For Effective Classification, Jialie Shen
Research Collection School Of Computing and Information Systems
As one of the most important cultural heritages, classical western paintings have always played a special role in human live and been applied for many different purposes. While image classification is the subject of a plethora of related publications, relatively little attention has been paid to automatic categorization of western classical paintings which could be a key technique of modern digital library, museums and art galleries. This paper studies automatic classification on large western painting image collection. We propose a novel framework to support automatic classification on large western painting image collections. With this framework, multiple visual features can be …
Bmq-Processor: A High-Performance Border Crossing Event Detection Framework For Large-Scale Monitoring Applications, Jinwon Lee, Seungwoo Kang, Youngki Lee, Sangjeong Lee, Junehwa Song
Bmq-Processor: A High-Performance Border Crossing Event Detection Framework For Large-Scale Monitoring Applications, Jinwon Lee, Seungwoo Kang, Youngki Lee, Sangjeong Lee, Junehwa Song
Research Collection School Of Computing and Information Systems
In this paper, we present BMQ-Processor, a high-performance Border-Crossing Event (BCE) detection framework for large-scale monitoring applications. We first characterize a new query semantics, namely, Border Monitoring Query (BMQ), which is useful for BCE detection in many monitoring applications. It monitors the values of data streams and reports them only when data streams cross the borders of its range. We then propose BMQ-Processor to efficiently handle a large number of BMQs over a high volume of data streams. BMQ-Processor efficiently processes BMQs in a shared and incremental manner. It develops and operates over a novel stateful query index, achieving a …
Offering Rss Feeds: Does It Help To Gain Competitive Advantage?, Dan Ma
Offering Rss Feeds: Does It Help To Gain Competitive Advantage?, Dan Ma
Research Collection School Of Computing and Information Systems
Nowadays, many Websites have adopted the really simple syndication (RSS) technology to deliver online content to visitors. In this paper, I build an analytical model to examine how the offering of RSS feeds impact the number of visitors, total traffic load, and profit of Websites in a competitive setting. I show that although RSS can always attract more visitors, it may reduce the Website's profit. Interestingly, in a competitive market there are cases that the RSS feeds hurt the offering Website but benefit the competing Website instead. The conditions under which these will happen are derived. I also study the …
Multiuser Private Queries Over Encrypted Databases, Yanjiang Yang, Feng Bao, Xuhua Ding, Robert H. Deng
Multiuser Private Queries Over Encrypted Databases, Yanjiang Yang, Feng Bao, Xuhua Ding, Robert H. Deng
Research Collection School Of Computing and Information Systems
Searchable encryption schemes allow users to perform keyword-based searches on an encrypted database. Almost all existing such schemes only consider the scenario where a single user acts as both the data owner and the querier. However, most databases in practice do not just serve one user; instead, they support search and write operations by multiple users. In this paper, we systematically study searchable encryption in a practical multiuser setting. Our results include a set of security notions for multiuser searchable encryption as well as a construction which is provably secure under the newly introduced security notions. We also discuss how …
A Semiotic Analysis Of Unified Modeling Language Graphical Notations, Keng Siau, Yuhong Tian
A Semiotic Analysis Of Unified Modeling Language Graphical Notations, Keng Siau, Yuhong Tian
Research Collection School Of Computing and Information Systems
Unified modeling language (UML) is the standard modeling language for object-oriented system development. Despite its status as a standard, UML has a fuzzy formal specification and a weak theoretical foundation. Semiotics, the study of signs, provides a good theoretical foundation for UML research because graphical notations (or visual signs) of UML are subjected to the principles of signs. In our research, we use semiotics to study the effectiveness of graphical notations in UML. We hypothesized that the use of iconic signs as UML graphical notations leads to representation that is more accurately interpreted and that arouses fewer connotations than the …
Ontology-Based Business Process Customization For Composite Web Services, Qianhui (Althea) Liang, Xindong Wu, E. K. Park, T. Khoshgoftaar, C. Chi
Ontology-Based Business Process Customization For Composite Web Services, Qianhui (Althea) Liang, Xindong Wu, E. K. Park, T. Khoshgoftaar, C. Chi
Research Collection School Of Computing and Information Systems
A key goal of the Semantic Web is to shift social interaction patterns from a producer-centric paradigm to a consumer-centric one. Treating customers as the most valuable assets and making the business models work better for them are at the core of building successful consumer-centric business models. It follows that customizing business processes constitutes a major concern in the realm of a knowledge-pull-based human semantic Web. This paper conceptualizes the customization of service-based business processes leveraging the existing knowledge of Web services and business processes. We represent this conceptualization as a new Extensible Markup Language (XML) markup language Web Ontology …
Quality-Aware Collaborative Question Answering: Methods And Evaluation, Maggy Anastasia Suryanto, Ee Peng Lim, Aixin Sun, Roger Hsiang-Li Chiang
Quality-Aware Collaborative Question Answering: Methods And Evaluation, Maggy Anastasia Suryanto, Ee Peng Lim, Aixin Sun, Roger Hsiang-Li Chiang
Research Collection School Of Computing and Information Systems
Community Question Answering (QA) portals contain questions and answers contributed by hundreds of millions of users. These databases of questions and answers are of great value if they can be used directly to answer questions from any user. In this research, we address this collaborative QA task by drawing knowledge from the crowds in community QA portals such as Yahoo! Answers. Despite their popularity, it is well known that answers in community QA portals have unequal quality. We therefore propose a quality-aware framework to design methods that select answers from a community QA portal considering answer quality in addition to …
Continuous Monitoring Of Spatial Queries, Kyriakos Mouratidis
Continuous Monitoring Of Spatial Queries, Kyriakos Mouratidis
Research Collection School Of Computing and Information Systems
No abstract provided.
Efficient Valid Scope Computation For Location-Dependent Spatial Queries In Mobile And Wireless Environments, Ken C. K. Lee, Wang-Chien Lee, Hong Va Leong, Brandon Unger, Baihua Zheng
Efficient Valid Scope Computation For Location-Dependent Spatial Queries In Mobile And Wireless Environments, Ken C. K. Lee, Wang-Chien Lee, Hong Va Leong, Brandon Unger, Baihua Zheng
Research Collection School Of Computing and Information Systems
In mobile and wireless environments, mobile clients can access information with respect to their locations by submitting Location-Dependent Spatial Queries (LDSQs) to Location-Based Service (LBS) servers. Owing to scarce wireless channel bandwidth and limited client battery life, frequent LDSQ submission from clients must be avoided. Observing that LDSQs issued from similar client positions would normally return the same results, we explore the idea of valid scope, that represents a spatial area in which a set of LDSQs will retrieve exactly the same query results. With a valid scope derived and an LDSQ result cached at the client side, a client …
Distributed Utility-Based Rate Adaptation Protocols For Prioritized, Quasi-Elastic Flows, Sharanya Eswaran, Matthew P. Johnson, Archan Misra, Thomas La Porta
Distributed Utility-Based Rate Adaptation Protocols For Prioritized, Quasi-Elastic Flows, Sharanya Eswaran, Matthew P. Johnson, Archan Misra, Thomas La Porta
Research Collection School Of Computing and Information Systems
This paper considers rate adaptation for streaming multimedia data in a wireless sensor network (WSN) consisting of multiple missions, where each mission subscribes to data streams from multiple sensors, and each sensor's data is utilized by multiple heterogenous missions. We specifically consider the application of the distributed network utility maximization (NUM) framework to a previously unconsidered scenario where the different missions have different priorities, as well as minimum utility demands. When all the utility demands are feasible, we first show that the addition of a penalty for failing to reach the minimum utility demand to the base NUM protocol leads …