Future wireless networks must be able to coordinate services within a diverse-network environment. One of the challenging problems for coordination is vertical handoff, which is the decision for a mobile node to hando...
详细信息
Future wireless networks must be able to coordinate services within a diverse-network environment. One of the challenging problems for coordination is vertical handoff, which is the decision for a mobile node to handoff between different types of networks. While traditional handoff is based on received signal strength comparisons, vertical handoff must evaluate additional factors, such as monetary cost, offered services, network conditions, and user preferences. In this paper, several optimizations are proposed for the execution of vertical handoff decision algorithms, with the goal of maximizing the quality of service experienced by each user. First, the concept of policy-based handoffs is discussed. Then, a multiservice vertical handoff decision algorithm (MUSE-VDA) and cost function are introduced to judge target networks based on a variety of user- and network-valued metrics. Finally, a performance analysis demonstrates that significant gains in the ability to satisfy user requests for multiple simultaneous services and a more efficient use of resources can be achieved from the MUSE-VDA optimizations.
This paper(1) focuses on the issue, of the formal logical description of evolutions of multi-agent systems (MAS). By evolution of a MAS we mean the change of inner states of the combined MAS caused by interaction of p...
详细信息
ISBN:
(纸本)9783642045943
This paper(1) focuses on the issue, of the formal logical description of evolutions of multi-agent systems (MAS). By evolution of a MAS we mean the change of inner states of the combined MAS caused by interaction of participating agents. We, introduce a general scheme of combining propositional modal languages and respective logics into a single language suitable for such descriptions. The method is based on the representation of multi-agent systems by Kripke-Hintikka models. The obtained description allows to study the question of verifiable specifications.
In most popular hybrid logics from the field of Artificial Intelligence, knowledge is usually combined with other logical operations (e.g. awareness). We consider(1) a hybrid logic LPD combining agent's knowledge ...
详细信息
ISBN:
(纸本)9783540855668
In most popular hybrid logics from the field of Artificial Intelligence, knowledge is usually combined with other logical operations (e.g. awareness). We consider(1) a hybrid logic LPD combining agent's knowledge operations, linear time, operations for discovering information and plausibility operation. The plausibility operation is seemed to be quite new in this framework. The paper introduces LPD via semantical models based on special Kripke/Hintikka frames. We provide formation rules and rules for computing truth values of formulas in the chosen language inside such models, discuss properties of the described logic comparing to some other already known logics. The main problem we are focused on is finding an algorithm for recognition of satisfiable in LPD formulas, we propose such an algorithm (so we show that LPD is decidable w.r.t. satisfiability). The paper is completed with a short discussion on the essence and features of this algorithm.
This paper suggests a temporal multi-agent logic LDMA, (with interacting agents), to imitate decision-making of independent agents, supported by access to knowledge through interaction with other agents. The interacti...
详细信息
ISBN:
(纸本)9789898111371
This paper suggests a temporal multi-agent logic LDMA, (with interacting agents), to imitate decision-making of independent agents, supported by access to knowledge through interaction with other agents. The interaction is modeled by considering all possible communication paths between agents in temporal Kripke/Hintikka like models. The logic LDMA distinguishes local and global decision-making and is based on temporal Kripke/Hintikka models with agents accessibility relations defined between the states of time clusters. The main result provides a decision algorithm for LDMA (so, we prove that the set of theorems of LDMA is decidable), which also solves the satisfiability problem for LDMA.
The paper deals with a temporal multi-agent logic TMAZ, which imitates taking of decisions based on agents' access to knowledge by their interaction. The interaction is modelled by possible communication channels ...
详细信息
The paper deals with a temporal multi-agent logic TMAZ, which imitates taking of decisions based on agents' access to knowledge by their interaction. The interaction is modelled by possible communication channels between agents in special temporal Kripke/Hintikka-like models. The logic TMAZdistinguishes local and global decisions-making. TMAZis based on temporal Kripke/Hintikka models with agents' accessibility relations defined on states of all possible time clusters C(i) (where indexes i range over all integer numbers Z). The main result provides a decision algorithm for TMAZ(so, we prove that TMAZis decidable). This algorithm also solves the satisfiability problem. In the final part of the paper, we consider the admissibility problem for inference rules in TMAZ, and show that this problem is decidable for TMAZas well.
Inducing rules is one of the key methods of discovering information hidden in data. In this paper, a method is proposed for inducing decision rules and decision algorithms by a granular computing approach, based on a ...
详细信息
ISBN:
(纸本)142440133X
Inducing rules is one of the key methods of discovering information hidden in data. In this paper, a method is proposed for inducing decision rules and decision algorithms by a granular computing approach, based on a decision logic language in information tables. And we prove that in consistent information tables, the induced decision algorithms are consistent and complete, and the decision algorithms induced by different partitions are equivalent. Secondly, this paper studies two specific kinds of partitions: partitions inducing atomic decision algorithms and partitions inducing the most general decision algorithms. An algorithm is given for finding the partitions inducing atomic decision algorithms which are also very close to the partitions inducing the most general decision algorithms. The partitions obtained using this algorithm can induce the decision rules which are all atomic, and whose number will be close to the lowest possible. This is then a solution to the problem of finding the simplest decision rules and algorithms.
This paper deals with the development of a linear discriminant model for a large scale polypropylene production via the practical application of a multivariate statistical procedure. The objective is to differentiate ...
详细信息
This paper deals with the development of a linear discriminant model for a large scale polypropylene production via the practical application of a multivariate statistical procedure. The objective is to differentiate between customer-acceptable and customer-rejection polypropylene product based on resin properties, metal residues, additive types and concentrations, moisture contents, and previous customer's responses. The discriminant model developed using this approach by including all significant product variables predicted correctly all of hopper cars shipped previously to customers for model validation. This statistical procedure was used as an interim quality control method for products sent to critical customers until a more definitive quality control procedure is developed.
It is shown that unifiability of terms in the simply typed lambda calculus with beta and eta rules becomes decidable if there is a bound on the number of bound variables and lambdas in a unifier in eta-expanded beta-n...
详细信息
It is shown that unifiability of terms in the simply typed lambda calculus with beta and eta rules becomes decidable if there is a bound on the number of bound variables and lambdas in a unifier in eta-expanded beta-normal form. (c) 2005 Elsevier Ltd. All rights reserved.
This paper concerns the relationship between rough sets and flow graphs. It is shown that flow graph can be used both as formal language for computing approximations of sets in the sense of rough set theory, and as de...
详细信息
ISBN:
(纸本)3540286535
This paper concerns the relationship between rough sets and flow graphs. It is shown that flow graph can be used both as formal language for computing approximations of sets in the sense of rough set theory, and as description tool for data structure. This description is employed next for finding patterns in data. To this end decision algorithm induced by the flow graph is defined and studied.
A decision network is a finite, directed acyclic graph, nodes of which represent logical formulas, whereas branches-are interpreted as decision rules. Every path in the graph represents a chain of decision rules, whic...
详细信息
ISBN:
(纸本)3540221174
A decision network is a finite, directed acyclic graph, nodes of which represent logical formulas, whereas branches-are interpreted as decision rules. Every path in the graph represents a chain of decision rules, which describe compound decision. Some properties of decision networks will be given and a simple example will illustrate the presented ideas and show possible applications.
暂无评论