Personalized home pages - a working environment on the World Wide Web

The World Wide Web is one of the most common interfaces to the Internet and thus to the global office as it provides an easy-to-use and self-explaining user interface for teleworkers. However WWW based interfaces are relatively rigid and are lacking ways of user customization or setting preferences. The new service oriented approach presented here builds upon the strength of the WWW interface to Internet services but enhances it by the power of individual customization. The Personalized Home Page (PHP) system is built on a framework capable to describe all Internet services in a uniform way using the terminology of weak agency. This paper gives an overview of the PHP system with a short description of the agent based framework behind. Examples introduce the actual use of the system

Agent based Internet (WWW) services

The evolution of the World Wide Web heads towards the use of more and more intelligent services. A possible solution to implement this service oriented view of World Wide Web is to use agents. A framework is proposed to provide agent-based Internet services via WWW. A case study introduces the actual use of this framework and its relation to the agent technology. As an implementation effort the Personalized Home Page (PHP) system is presented here. investigates the application of this voting tool for rating purposes

Artificial Intelligence and Ambient Intelligence

This book includes a series of scientific papers published in the Special Issue on Artificial Intelligence and Ambient Intelligence at the journal Electronics MDPI. The book starts with an opinion paper on “Relations between Electronics, Artificial Intelligence and Information Society through Information Society Rules”, presenting relations between information society, electronics and artificial intelligence mainly through twenty-four IS laws. After that, the book continues with a series of technical papers that present applications of Artificial Intelligence and Ambient Intelligence in a variety of fields including affective computing, privacy and security in smart environments, and robotics. More specifically, the first part presents usage of Artificial Intelligence (AI) methods in combination with wearable devices (e.g., smartphones and wristbands) for recognizing human psychological states (e.g., emotions and cognitive load). The second part presents usage of AI methods in combination with laser sensors or Wi-Fi signals for improving security in smart buildings by identifying and counting the number of visitors. The last part presents usage of AI methods in robotics for improving robots’ ability for object gripping manipulation and perception. The language of the book is rather technical, thus the intended audience are scientists and researchers who have at least some basic knowledge in computer science

Decentralized load balancing in heterogeneous computational grids

With the rapid development of high-speed wide-area networks and powerful yet low-cost computational resources, grid computing has emerged as an attractive computing paradigm. The space limitations of conventional distributed systems can thus be overcome, to fully exploit the resources of under-utilised computing resources in every region around the world for distributed jobs. Workload and resource management are key grid services at the service level of grid software infrastructure, where issues of load balancing represent a common concern for most grid infrastructure developers. Although these are established research areas in parallel and distributed computing, grid computing environments present a number of new challenges, including large-scale computing resources, heterogeneous computing power, the autonomy of organisations hosting the resources, uneven job-arrival pattern among grid sites, considerable job transfer costs, and considerable communication overhead involved in capturing the load information of sites. This dissertation focuses on designing solutions for load balancing in computational grids that can cater for the unique characteristics of grid computing environments. To explore the solution space, we conducted a survey for load balancing solutions, which enabled discussion and comparison of existing approaches, and the delimiting and exploration of the apportion of solution space. A system model was developed to study the load-balancing problems in computational grid environments. In particular, we developed three decentralised algorithms for job dispatching and load balancing—using only partial information: the desirability-aware load balancing algorithm (DA), the performance-driven desirability-aware load-balancing algorithm (P-DA), and the performance-driven region-based load-balancing algorithm (P-RB). All three are scalable, dynamic, decentralised and sender-initiated. We conducted extensive simulation studies to analyse the performance of our load-balancing algorithms. Simulation results showed that the algorithms significantly outperform preexisting decentralised algorithms that are relevant to this research

Process-Oriented Information Logistics: Aligning Process Information with Business Processes

During the last decade, research in the field of business process management (BPM) has focused on the design, modeling, execution, monitoring, and optimization of business processes. What has been neglected, however, is the provision of knowledge workers and decision makers with needed information when performing knowledge-intensive business processes such as product engineering, customer support, or strategic management. Today, knowledge workers and decision makers are confronted with a massive load of data, making it difficult for them to discover the information relevant for performing their tasks. Particularly challenging in this context is the alignment of process-related information (process information for short), such as e-mails, office files, forms, checklists, guidelines, and best practices, with business processes and their tasks. In practice, process information is not only stored in large, distributed and heterogeneous sources, but usually managed separately from business processes. For example, shared drives, databases, enterprise portals, and enterprise information systems are used to store process information. In turn, business processes are managed using advanced process management technology. As a consequence, process information and business processes often need to be manually linked; i.e., process information is hard-wired to business processes, e.g., in enterprise portals associating specific process information with process tasks. This approach often fails due to high maintenance efforts and missing support for the individual demands of knowledge workers and decision makers. In response to this problem, this thesis introduces process-oriented information logistics(POIL) as new paradigm for delivering the right process information, in the right format and quality, at the right place and the right point in time, to the right people. In particular, POIL allows for the process-oriented, context-aware (i.e., personalized) delivery of process information to process participants. The goal is to no longer manually hard-wire process information to business processes, but to automatically identify and deliver relevant process information to knowledge workers and decision makers. The core component of POIL is a semantic information network (SIN), which comprises homogeneous information objects (e.g., e-mails, offce files, guidelines), process objects (e.g., tasks, events, roles), and relationships between them. In particular, a SIN allows discovering objects linked with each other in different ways, e.g., objects addressing the same topic or needed when performing a particular process task. The SIN not only enables an integrated formal representation of process information and business processes, but also allows determining the relevance of process information for a given work context based on novel techniques and algorithms. Note that this becomes crucial in order to achieve the aforementioned overall goal of this thesis

Models of higher-order, type-safe, distributed computation over autonomous persistent object stores

A remote procedure call (RPC) mechanism permits the calling of procedures in another address space. RPC is a simple but highly effective mechanism for interprocess communication and enjoys nowadays a great popularity as a tool for building distributed applications. This popularity is partly a result of their overall simplicity but also partly a consequence of more than 20 years of research in transpaxent distribution that have failed to deliver systems that meet the expectations of real-world application programmers. During the same 20 years, persistent systems have proved their suitability for building complex database applications by seamlessly integrating features traditionally found in database management systems into the programming language itself. Some research. effort has been invested on distributed persistent systems, but the outcomes commonly suffer from the same problems found with transparent distribution. In this thesis I claim that a higher-order persistent RPC is useful for building distributed persistent applications. The proposed mechanism is: realistic in the sense that it uses current technology and tolerates partial failures; understandable by application programmers; and general to support the development of many classes of distributed persistent applications. In order to demonstrate the validity of these claims, I propose and have implemented three models for distributed higher-order computation over autonomous persistent stores. Each model has successively exposed new problems which have then been overcome by the next model. Together, the three models provide a general yet simple higher-order persistent RPC that is able to operate in realistic environments with partial failures. The real strength of this thesis is the demonstration of realism and simplicity. A higherorder persistent RPC was not only implemented but also used by programmers without experience of programming distributed applications. Furthermore, a distributed persistent application has been built using these models which would not have been feasible with a traditional (non-persistent) programming language