scholarly journals Max-Sum Diversification, Monotone Submodular Functions, and Dynamic Updates

2017 ◽  
Vol 13 (3) ◽  
pp. 1-25 ◽  
Author(s):  
Allan Borodin ◽  
Aadhar Jain ◽  
Hyun Chul Lee ◽  
Yuli Ye
Keyword(s):  
Submodular Functions ◽  
Dynamic Updates

scholarly journals Evolutionary algorithms and submodular functions: benefits of heavy-tailed mutations

2021 ◽  
Author(s):  
Francesco Quinzan ◽  
Andreas Göbel ◽  
Markus Wagner ◽  
Tobias Friedrich
Keyword(s):  
Evolutionary Algorithms ◽  
Submodular Functions ◽  
Heavy Tailed

An examination on data integrity auditing patterns in cloud computing

2018 ◽  
Vol 7 (1.9) ◽  
pp. 200
Author(s):  
T A.Mohanaprakash ◽  
J Andrews
Keyword(s):  
Cloud Computing ◽  
Information Security ◽  
Data Integrity ◽  
Cloud Service ◽  
New Approach ◽  
Computing Services ◽  
Security Challenges ◽  
Cloud Server ◽  
State Of Affairs ◽  
Dynamic Updates

Cloud computing is associate inclusive new approach on however computing services square measure made and utilized. Cloud computing is associate accomplishment of assorted styles of services that has attracted several users in today’s state of affairs. The foremost enticing service of cloud computing is information outsourcing, because of this the information homeowners will host any size of information on the cloud server and users will access the information from cloud server once needed. A dynamic outsourced auditing theme that cannot solely defend against any dishonest entity and collision, however conjointly support verifiable dynamic updates to outsourced information. The new epitome of information outsourcing conjointly faces the new security challenges. However, users might not totally trust the cloud service suppliers (CSPs) as a result of typically they may be dishonest. It's tough to work out whether or not the CSPs meet the customer’s expectations for information security. Therefore, to with success maintain the integrity of cloud information, several auditing schemes are projected. Some existing integrity ways will solely serve for statically archived information and a few auditing techniques is used for the dynamically updated information. The analyzed numerous existing information integrity auditing schemes together with their consequences.

GITAR: Generic extension for Internet-of-Things ARchitectures enabling dynamic updates of network and application modules

2016 ◽  
Vol 36 ◽  
pp. 127-151 ◽  
Author(s):  
Peter Ruckebusch ◽  
Eli De Poorter ◽  
Carolina Fortuna ◽  
Ingrid Moerman
Keyword(s):  
Internet Of Things ◽  
Generic Extension ◽  
Dynamic Updates

scholarly journals Non-submodular model for group profit maximization problem in social networks

2021 ◽  
Vol 8 (1) ◽  
Author(s):  
Jianming Zhu ◽  
Smita Ghosh ◽  
Weili Wu ◽  
Chuangen Gao
Keyword(s):  
Social Networks ◽  
Profit Maximization ◽  
Randomized Algorithm ◽  
Political Orientation ◽  
Submodular Functions ◽  
Maximization Problem ◽  
Modular Algorithm ◽  
The Difference ◽  
Group Enterprise ◽  
Theoretical Results

AbstractIn social networks, there exist many kinds of groups in which people may have the same interests, hobbies, or political orientation. Sometimes, group decisions are made by simply majority, which means that most of the users in this group reach an agreement, such as US Presidential Elections. A group is called activated if $$\beta$$ β percent of users are influenced in the group. Enterprise will gain income from all influenced groups. Simultaneously, to propagate influence, enterprise needs pay advertisement diffusion cost. Group profit maximization (GPM) problem aims to pick k seeds to maximize the expected profit that considers the benefit of influenced groups with the diffusion cost. GPM is proved to be NP-hard and the objective function is proved to be neither submodular nor supermodular. An upper bound and a lower bound which are difference of two submodular functions are designed. We propose a submodular–modular algorithm (SMA) to solve the difference of two submodular functions and SMA is shown to converge to a local optimal. We present an randomized algorithm based on weighted group coverage maximization for GPM and apply sandwich framework to get theoretical results. Our experiments verify the efficiency of our methods.

scholarly journals Maximizing k -Submodular Functions and Beyond

2016 ◽  
Vol 12 (4) ◽  
pp. 1-26 ◽  
Author(s):  
Justin Ward ◽  
Stanislav Živný
Keyword(s):  
Submodular Functions
Sign in / Sign up

Export Citation Format

Share Document