Search results for "optimization"
showing 10 items of 2824 documents
e-Fair: Aggregation in e-Commerce for Exploiting Economies of Scale
2017
In recent years, many new and interesting models of successful online business have been developed, including competitive models such as auctions, where the product price tends to rise, and group-buying, where users cooperate obtaining a dynamic price that tends to go down. We propose the e-fair as a business model for social commerce, where both sellers and buyers are grouped to maximize benefits. e-Fairs extend the group-buying model aggregating demand and supply for price optimization as well as consolidating shipments and optimize withdrawals for guaranteeing additional savings. e-Fairs work upon multiple dimensions: time to aggregate buyers, their geographical distribution, price/quant…
Prnu Pattern Alignment for Images and Videos Based on Scene Content
2019
This paper proposes a novel approach for registering the PRNU pattern between different camera acquisition modes by relying on the imaged scene content. First, images are aligned by establishing correspondences between local descriptors: The result can then optionally be refined by maximizing the PRNU correlation. Comparative evaluations show that this approach outperforms those based on brute-force and particle swarm optimization in terms of reliability, accuracy and speed. The proposed scene-based approach for PRNU pattern alignment is suitable for video source identification in multimedia forensics applications.
Identification of Key miRNAs in Regulation of PPI Networks
2020
In this paper, we explore the interaction between miRNA and deregulated proteins in some pathologies. Assuming that miRNA can influence mRNA and consequently the proteins regulation, we explore this connection by using an interaction matrix derived from miRNA-target data and PPI network interactions. From this interaction matrix and the set of deregulated proteins, we search for the miRNA subset that influences the deregulated proteins with a minimum impact on the not deregulated ones. This regulation problem can be formulated as a complex optimization problem. In this paper, we have tried to solve it by using the Genetic Algorithm Heuristic. As the main result, we have found a set of miRNA…
Social-Behavioral Aware Optimization of Energy Consumption in Smart Homes
2018
Residential energy consumption is skyrocketing, as residential customers in the U.S. alone used 1.4 trillion kilowatt-hours in 2014 and the consumption is expected to increase in the next years. Previous efforts to limit such consumption have included demand response and smart residential environments. However, recent research has shown that such approaches can actually increase the overall energy consumption due to the numerous complex human psychological processes that take place when interacting with electrical appliances. In this paper we propose a social-behavioral aware framework for energy management in smart residential environments. We envision a smart home where appliances are int…
A hybrid system for malware detection on big data
2018
In recent years, the increasing diffusion of malicious software has encouraged the adoption of advanced machine learning algorithms to timely detect new threats. A cloud-based approach allows to exploit the big data produced by client agents to train such algorithms, but on the other hand, poses severe challenges on their scalability and performance. We propose a hybrid cloud-based malware detection system in which static and dynamic analyses are combined in order to find a good trade-off between response time and detection accuracy. Our system performs a continuous learning process of its models, based on deep networks, by exploiting the growing amount of data provided by clients. The prel…
A genetic approach to the maximum common subgraph problem
2019
Finding the maximum common subgraph of a pair of given graphs is a well-known task in theoretical computer science and with considerable practical applications, for example, in the fields of bioinformatics, medicine, chemistry, electronic design and computer vision. This problem is particularly complex and therefore fast heuristics are required to calculate approximate solutions. This article deals with a simple yet effective genetic algorithm that finds quickly a solution, subject to possible geometric constraints.
Lévy Flights for Ant Colony Optimization in Continuous Domains
2009
In this paper, the authors propose the use of the Levy probability distribution as leading mechanism for solutions differentiation in an efficient and bio-inspired optimization algorithm, ant colony optimization in continuous domains, ACOR. In the classical ACOR, new solutions are constructed starting from one solution, selected from an archive, where Gaussian distribution is used for parameter diversification. In the proposed approach, the Levy probability distributions are properly introduced in the solution construction step, in order to couple the ACOR algorithm with the exploration properties of the Levy distribution.
Composite laminates buckling optimization through Levy based Ant Colony Optimization
2010
In this paper, the authors propose the use of the Levy probability distribution as leading mechanism for solutions differentiation in an efficient and bio-inspired optimization algorithm, ant colony optimization in continuous domains, ACOR. In the classical ACOR, new solutions are constructed starting from one solution, selected from an archive, where Gaussian distribution is used for parameter diversification. In the proposed approach, the Levy probability distributions are properly introduced in the solution construction step, in order to couple the ACOR algorithm with the exploration properties of the Levy distribution. The proposed approach has been tested on mathematical test functions…
A Reinforcement Learning Approach for User Preference-aware Energy Sharing Systems
2021
Energy Sharing Systems (ESS) are envisioned to be the future of power systems. In these systems, consumers equipped with renewable energy generation capabilities are able to participate in an energy market to sell their energy. This paper proposes an ESS that, differently from previous works, takes into account the consumers’ preference, engagement, and bounded rationality. The problem of maximizing the energy exchange while considering such user modeling is formulated and shown to be NP-Hard. To learn the user behavior, two heuristics are proposed: 1) a Reinforcement Learning-based algorithm, which provides a bounded regret and 2) a more computationally efficient heuristic, named BPT- ${K}…
Efficient tree construction for the multicast problem
2002
A new heuristic for the Steiner minimal tree problem is presented. The method described is based on the detection of particular sets of nodes in networks, the "hot spot" sets, which are used to obtain better approximations of the optimal solutions. An algorithm is also proposed which is capable of improving the solutions obtained by classical heuristics, by means of a stirring process of the nodes in solution trees. Classical heuristics and an enumerative method are used as comparison terms in the experimental analysis which demonstrates the capability of the heuristic discussed.