17535942
KWM: Knowledge-based Workflow Model for Agile Organization
The workflow management system (WFMS) in an agile organization should be highly adaptable to the frequent organizational changes. To increase the adaptability of contemporary WFMSs, a mechanism for managing changes within the organizational structure and changes in business rules needs to be reinforced. In this paper, a knowledge-based approach for workflow modeling is proposed, in which a workflow is defined as a set of business rules. Knowledge on the organizational structure and special workflow, such as role/actor mappings and complex routing rules, can be explicitly modeled in KWM (Knowledge-based Workflow Model). Using knowledge representation scheme and dependency management facility, a change propagation mechanism is provided to adapt to the frequent changes in the organizational structure, business rules, and procedures.
30313812
A flexible agent system for change adaptation in supply chains
The importance of supply chain management is increasing with globalization and the advancement of electronic business. Supply chains are dynamic due to frequent changes in suppliers, customers, and products. However, information systems for supply chains are not flexible enough to adapt to the changes, requiring high cost and time for re-implementation and re-customization. This paper suggests a flexible agent system for supply chains that can adapt to the changes in transactions introduced by new products or new trading partners. The flexible agent system consists of an interpretable conversation policy model, a procedure for exchanging new conversation policies, and a mechanism for actual transactions with newly acquired conversation policies. By using the flexible agent system, formation of supply chains becomes more robust to the dynamic changes. To show how the approach can be realized, a PC supply chain application is illustrated with a prototype agent platform.
10735662
MAS platforms as an enabler of enterprise mobilisation: the state of the art
One of the main application areas for multi-agent systems technology is enterprise mobilization, wherein the main business process actors are nomadic workers. An agent's autonomy, sociality and intelligence are highly prized features when it comes to supporting those mobile workers who are geographically isolated from the main knowledge source (i.e. the corporate Intranet) and are frequently moving from one location to another. Based on experience gained from two field trials of applications (built using for multi-agent systems technology and running on lightweight handheld devices) that support mobile business processes for telecommunications service provisioning and maintenance, this paper proposes desirable metrics for any multi-agent systems platform intended for enterprise mobilisation use. These metrics are then used to compare a number of existing multi-agent systems platforms, and based on the results, this paper identifies some areas for improvement.
26133819
Multi-agent Technology as an enabler of Computer Supported Cooperative Work for the Mobile Workforce
This paper proposes an agent-based computer supported cooperative work system known as TeamWorker that enables cooperation between mobile workers for the execution of their jobs by providing services via conversational components (C-COMs). C-COMs, encapsulate agent interaction protocols, which can be dynamically plugged into participating agents. Furthermore, the intelligence and autonomy of agent technology is applied to overcome the barriers faced in mobile computing environments, such as difficulty in monitoring work progress, device diversity, need for multi-modal human agent interface, etc. Finally, we discuss how TeamWorker has been applied to a real mobile business process in a telecommunications company in the UK.
15989010
Interactive Object-Based Retrieval Using Relevance Feedback
In this paper we present an interactive, object-based video retrieval system which features a novel query formulation method that is used to iteratively refine an underlying model of the search object. As the user continues query composition and browsing of retrieval results, the system’s object modeling process, based on Gaussian probability distributions, becomes incrementally more accurate, leading to better search results. To make the interactive process understandable and easy to use, a custom user-interface has been designed and implemented that allows the user to interact with segmented objects in formulating a query, in browsing a search result, and in re-formulating a query by selecting an object in the search result.
19026342
Eager writeback - a technique for improving bandwidth utilization
Modern high-performance processors utilize multi-level cache structures to help tolerate the increasing latency of main memory. Most of these caches employ either a writeback or a write-through strategy to deal with store operations. Write-through caches propagate data to more distant memory levels at the time each store occurs, which requires a very large bandwidth between the memory hierarchy levels. Writeback caches can significantly reduce the bandwidth requirements between caches and memory by marking cache lines as dirty when stores are processed and writing those lines to the memory system only when that dirty line is evicted. Unfortunately, for applications that experience significant numbers of cache misses due to streaming data, writeback cache designs can degrade overall system performance by clustering bus activity when dirty lines contend with data being fetched into the cache. In this paper we present a new technique called Eager Writeback, which re-distributes and balances memory traffic by writing and "cleaning" dirty cache lines prior to their eviction. Eager Writeback can be viewed as a compromise between write-through and writeback policies, in which dirty lines are written later than write-through, but prior to writeback. We will show that this approach can reduce the large number of writes seen in a write-through design, while avoiding the performance degradation caused by clustering bus traffic in a writeback approach.
15007668
Wakeup scheduling in wireless sensor networks
A large number of ractical sensing and actuating applications require immediate notification of rare but urgent events and also fast delivery of time sensitive actuation commands. In this a er,we consider the design of efficient wakeup scheduling schemes for energy constrained sensor nodes that adhere to the bidirectional end-to-end delay constraints posed by such applications. We evaluate several existing scheduling schemes and propose novel scheduling methods that outperform existing ones.We also resent a new family of wakeu methods,called multi-parent schemes, which take a cross-layer a roach where multiple routes for transfer of messages and wakeup schedules for various nodes are crafted in synergy to increase longevity while reducing message delivery latencies. We analyze the power-delay and lifetime-latency tradeoffs for several wakeup methods and show that our proposed techniques significantly improve the performance and allow for much longer network lifetime while satisfying the latency constraints.
11497645
Spam Deobfuscation using a Hidden Markov Model
To circumvent spam filters, many spammers attempt to obfuscate their emails by deliberately misspelling words or introducing other errors into the text. For example viagra may be written vigra, or mortgage written m0rt gage. Even though humans have little difficulty reading obfuscated emails, most content-based filters are unable to recognize these obfuscated spam words. In this paper, we present a hidden Markov model for deobfuscating spam emails. We empirically demonstrate that our model is robust to many types of obfuscation including misspellings, incorrect segmentations (adding/removing spaces), and substitutions/insertions of non-alphabetic characters.
7431488
An HMM-Based Threshold Model Approach for Gesture Recognition
A new method is developed using the hidden Markov model (HMM) based technique. To handle nongesture patterns, we introduce the concept of a threshold model that calculates the likelihood threshold of an input pattern and provides a confirmation mechanism for the provisionally matched gesture patterns. The threshold model is a weak model for all trained gestures in the sense that its likelihood is smaller than that of the dedicated gesture model for a given gesture. Consequently, the likelihood can be used as an adaptive threshold for selecting proper gesture model. It has, however, a large number of states and needs to be reduced because the threshold model is constructed by collecting the states of all gesture models in the system. To overcome this problem, the states with similar probability distributions are merged, utilizing the relative entropy measure. Experimental results show that the proposed method can successfully extract trained gestures from continuous hand motion with 93.14% reliability.