Recommendation systems are special personalization tools that help users to find interesting information and services in complex online shops. Even though today's e-commerce environments have drastically evolved a...
详细信息
Recommendation systems are special personalization tools that help users to find interesting information and services in complex online shops. Even though today's e-commerce environments have drastically evolved and now incorporate techniques from other domains and application areas such as Web mining, semantics, artificial intelligence, user modeling and profiling, etc. setting up a successful recommendation system is not a trivial or straightforward task. This paper argues that by monitoring, analyzing and understanding the behavior of customers, their demographics, opinions, preferences and history, as well as taking into consideration the specific e-shop ontology and by applying Web mining techniques, the effectiveness of produced recommendations can be significantly improved. In this way, the e-shop may upgrade users' interaction, increase its usability, convert users to buyers, retain current customers and establish long-term and loyal one-to-one relationships
We study energy efficient routing strategies for wireless ad-hoc networks. In this kind of network, energy is a scarce resource and its conservation and efficient use is a major issue. Our strategy follows the multi-c...
详细信息
We study energy efficient routing strategies for wireless ad-hoc networks. In this kind of network, energy is a scarce resource and its conservation and efficient use is a major issue. Our strategy follows the multi-cost routing approach, according to which a cost vector of various parameters is assigned to each link. The parameters of interest are the number of hops on a path, and the residual energy and transmission power of the nodes on the path. These parameters are combined in various optimization functions, corresponding to different routing algorithms, for selecting the optimal path. We evaluate the routing algorithms proposed in a number of scenarios, with respect to energy consumption, throughput and other performance parameters of interest. From the experiments conducted, we conclude that routing algorithms that take into account energy related parameters, increase the lifetime of the network, while achieving better performance than other approaches, such as minimum hop routing.
This paper is concerned with the mixed H∞/D-stability control problem. Since multiobjective control problems are non-convex problems except some cases, it is difficult to obtain the globally optimal solutions. The pu...
详细信息
In agent-mediated marketplaces, autonomous agents deploy automated bidding mechanisms in order to increase revenue for humans. The ability of agents to estimate the next prices to be revealed in an auction, by applyin...
详细信息
Generic Web search is designed to serve all users, independent of the individual needs and without any adaptation to personal requirements. We propose a novel technique that performs post-categorization to the results...
详细信息
Generic Web search is designed to serve all users, independent of the individual needs and without any adaptation to personal requirements. We propose a novel technique that performs post-categorization to the results of popular search engines at the client's side. A user profile is built based on user's choices from a category hierarchy (explicitly given requirements) and user's search history (implicitly logged choices). Caching is utilized in order to provide improved responses. An experimental prototype has been implemented based on results coming from a popular search engine. The experimental results indicate strongly that the proposed mechanism is both effective and efficient.
Flow control is the dominant technique currently used in communication networks for preventing excess traffic from flooding the network, and for handling congestion. In rate-based flow control, transmission rates of s...
详细信息
Flow control is the dominant technique currently used in communication networks for preventing excess traffic from flooding the network, and for handling congestion. In rate-based flow control, transmission rates of sessions are adjusted in an end-to-end manner through a sequence of operations . In this work, we present a theory of max-min fair , rate-based flow control sensitive to priorities of different sessions, as a significant extension of the classical theory of max-min fair, rate-based flow control to networks supporting applications with diverse requirements on network resources. Each individual session bears a priority function , which maps the session's priority to a transmission rate; the priority is a working abstraction of the session's priority to bandwidth access. Priority functions enable the specification of requirements on bandwidth access by distributed applications, and the formal handling of such requirements. We present priority max-min fairness , as a novel and well motivated fairness condition which requires that assigned rates correspond, through the priority functions, to priorities comprising a max-min vector. We also introduce priority bottleneck algorithms gradually update a session's rate until when its priority is restricted on a priority bottleneck edge of the network. We establish a collection of interesting combinatorial properties of priority bottleneck algorithms. Most significantly, we show that they can only converge to priority max-min fairness. As an application of our general theory, we embed priority bottleneck algorithms in the more realistic optimistic framework for rate-based flow control. The optimistic framework allows for both decreases and increases of session rates. We exploit these additionally provided semantics to prove further combinatorial properties for the termination of priority bottleneck algorithms in the optimistic framework. We use these properties to conclude the first optimistic algorithms for efficien
Web services are becoming an important enabler of the semantic Web. Besides the need for a rich description mechanism, Web service information should be made available in an accessible way for machine processing. In t...
详细信息
Web services are becoming an important enabler of the semantic Web. Besides the need for a rich description mechanism, Web service information should be made available in an accessible way for machine processing. In this paper, we propose a new P2P based approach for Web services discovery. Peers that store Web services information, such as data item descriptions, are efficiently located using a scalable and robust data indexing structure for peer-to-peer data networks, NIPPERS. We present a theoretical analysis which shows that the communication cost of the query and update operations scale double-logarithmically with the number of NIPPERS nodes. Furthermore, we show that the network is robust with respect to failures fulfilling quality of Web services requirements.
Enterprise integration is significant for the enforcement of novel business models in an enterprise/industry. The great heterogeneity of systems/applications in the enterprise environment requires the introduction of ...
详细信息
Enterprise integration is significant for the enforcement of novel business models in an enterprise/industry. The great heterogeneity of systems/applications in the enterprise environment requires the introduction of interoperability aspects in order to resolve integration problems in a flexible and dynamic way. Our approach introduces an advanced enterprise semantic model representing both enterprise structure and available services, through the use of ontologies. The model is associated by a specific architecture that uses the above model in combination with state-of-the-art technologies such as Web services and workflows
This paper describes a proposed system for the recognition and labeling of graphical objects within architectural and engineering documents that integrates statistical language models (SLMs) with traditional classifie...
详细信息
This paper describes a proposed system for the recognition and labeling of graphical objects within architectural and engineering documents that integrates statistical language models (SLMs) with traditional classifiers. SLMs are techniques used with success in natural language processing (NLP) for use in such tasks as speech recognition and information retrieval. This research proposes the adaptation of SLMs for use with graphical notation i.e. statistical graphical language model (SGLMs). Reasoning of the similarities between natural language and technical graphics is presented and the proposed use of SGLM for graphical object recognition is described.
In this paper, we present an integrated system architecture for metacomputing on top of distributed scientific resources via semantic-driven information management. Our approach is to consider both data and programs a...
详细信息
ISBN:
(纸本)9780780390744
In this paper, we present an integrated system architecture for metacomputing on top of distributed scientific resources via semantic-driven information management. Our approach is to consider both data and programs as objects of an application-specific ontology, describing them via corresponding metadata schemata that can be exploited to search for and to generate information in an efficient and automated way. Metacomputations are expressed in the form of workflows thereby enabling a flexible combination of data and program objects that can reside on different servers or grid resources. Workflow descriptions are associated with ontology concepts and can be activated as a side-effect of searching for information to produce new data on demand. We also report on the current status of an implementation that provides support for several aspects of this architecture.
暂无评论