The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
These India is suffering from the problem of meeting peak demand of about 12 %. Demand side management is one of the efficient methods to solve this problem. It can reduce the peak load and thereby facilitate peak load management, smoother grid operation and economic benefits. Demand side management can be started from consumer side by using intelligent loads, both for industries and household. This...
Understanding the evolution of dynamic network structures is an emerging and very interesting topic, which is motivated by several real applications in many scientific fields. In this article, we discuss the link prediction problem, which is one of the key issues in the analysis of social evolving networks. We propose a new hybrid approach to predict the connections in social networks. The approach...
In this paper we present a temporal planning approach for handling problems with deadlines. The model relies on the extraction of temporal landmarks from the problem and the construction of a landmarks graph as a skeleton of the solution plan. Partial plans in the search tree that are not compliant with the information comprised in this graph are pruned. We introduce a novel search scheme that builds...
In this paper, we consider the effect of different order relations on the solutions of Multi-Objective Constraint Optimization Problems (MOCOP) with tradeoffs, where the tradeoffs are given in the form of elicited or observed preferences over alternatives. In MOCOP, alternatives are evaluated on a number of objectives (utility scales) and thus correspond to utility vectors, the set of optimal solutions...
It is well known that the problem of finding a feasible schedule for a partially ordered set of tasks can be formulated as a Disjunctive Temporal Problem (DTP). In case we want to find a schedule by taking preferences into account, there exist extensions to DTPs that augment them by associating numeric costs to the violation of individual temporal constraints, however, such extensions make the restrictive...
Considerable research effort has been focused on the translation of non-binary CSP into an equivalent binary CSP. Most of this work has been devoted to studying the binary encoding of non-binary CSP. Three encodings have been proposed, namely dual encoding, hidden variable encoding and double encoding. Unfortunately, such encodings do not allow to use some properties and interesting results defined...
We introduce and study the problem of obtaining a spatial or temporal configuration that maximizes the number of constraints satisfied in a qualitative constraint network (QCN). We call this problem the MAX-QCN problem and prove that it is NP-hard for most of the qualitative calculi. We also propose a complete generic branch and bound algorithm for solving the MAX-QCN problem. This algorithm builds...
This paper proposes a new hybrid encoding of finite linear CSP to SAT integrating order and log encodings. The former maintains bound consistency by unit propagation and works well for instances with small/middle domain sized variables and/or arity of constraints. The latter generates smaller CNF and is suitable for instances with larger domain sized variables, but its performance is not good in general...
Preferences can be expressed as wishes, constraints or both. Generally, wishes and constraints do not complement each other. A different reasoning principle is applied to rank-order the set of options depending on whether preferences refer to wishes or constraints. Consequently, these two types of preferences have been characterized by two separate sets of postulates offering a normative view of the...
Urinalysis is the test of urine, which, identifying presence of particles and substances in the sample can provide valuable information about patient's urinary and renal condition as well as about major metabolic functions. Even though being a quick, accurate and cost-effective test, it has not received proper attention, preventing it to achieve its whole power. Capability to identify the main urinary...
Differential Evolution (DE) has been shown as an effective, efficient and robust evolutionary computing algorithm. The main force to generate promising offspring is the mutation operator. Usually, two randomly selected vectors are used to generate the differential vector, which maintains the large diversity of mutant directions and ensures the possibility to find global optima. However, strong randomness...
In this study, a complex-valued adaptive filter algorithm based on Lyapunov stability theory is presented to solve a system identification problem in the complex domain. The performance of the proposed complex-valued Lyapunov adaptive filter (CLAF) algorithm is improved for the complex-valued system identification problem by integrating the LST into the filter optimization cost. The performance of...
Presents the introductory welcome message from the conference proceedings. May include the conference officers' congratulations to all involved with the conference event and publication of the proceedings record.
Session and mobility management functions in 3GPP networks obtain data from functions such as HSS and PCRF via Diameter request-response and a managed, high performance network in between. New technology in database, storage and distributed synchronization make it feasible to massively replicate and store data. In this paper it is considered how a user's subscriber and context information is managed...
The reliable and safe operation of electric power systems is challenged to keep them operating obeying operational safety margins, all this within the context of the inherent power generation and consumption uncertainties.
In this paper, we present a process, developed over years of practical commercial use, where applications accomplishing a wide variety of complex tasks are created from a common framework, through the use, recombination and iterative refinement of autonomous agents in a Multi-Agent Intelligent System. Driven by a need to solve real-world problems, our focus is to make businesses run more efficiently...
This paper highlights an experiment to see how standard Monte Carlo Tree Search handles simple co-operative problems with no prior or provided knowledge. These problems are formed from a simple grid world that has a set of goals, doors and buttons as well as walls that cannot be walked through. Two agents have to reach every goal present on the map. For a door to be open, an agent must be present...
Prof. Bejczy is recognized globally for his achievements as a scientist and engineer, he made fundamental contributions to robot modeling and developed new applications. One domain of robotics stands out of his carrier, space robotics. He joined the NASA Jet Propulsion Laboratory (JPL) in 1969, where he developed the first dynamic model of robotic manipulators based on the Lagrangian formulation....
The reproducibility of an in-silico experiment is a great challenge because of the parallel and distributed environment and the complexity of the scientific workflows. In order to solve such problems on one hand provenance data has to be captured about the dataflow, the ancestry of the results and the environment of the execution, on the other hand description data has to be collected from the scientist...
This paper presents the formalized apparatus of mining inter-dimensional association rules in multidimensional data, their representation by means of templates, and also the method of all frequent item sets generation in multidimensional data with help of which association rules can be generated by preset templates.
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.