Jen-Yao Chung

Bio: Jen-Yao Chung is an academic researcher from IBM. The author has contributed to research in topics: Web service & WS-Policy. The author has an hindex of 27, co-authored 99 publications receiving 3723 citations. Previous affiliations of Jen-Yao Chung include Singapore Management University & University of Illinois at Urbana–Champaign.

Algorithms for scheduling imprecise computations

Abstract: The imprecise computation technique, which prevents timing faults and achieves graceful degradation by giving the user an approximate result of acceptable quality whenever the system cannot produce the exact result in time, is considered. Different approaches for scheduling imprecise computations in hard real-time environments are discussed. Workload models that quantify the tradeoff between result quality and computation time are reviewed. Scheduling algorithms that exploit this tradeoff are described. These include algorithms for scheduling to minimize total error, scheduling periodic jobs, and scheduling parallelizable tasks. A queuing-theoretical formulation of the imprecise scheduling problem is presented. >

Scheduling periodic jobs that allow imprecise results

Abstract: The problem of scheduling periodic jobs in hard real-time systems that support imprecise computations is discussed. Timing faults are avoided in such systems by making available intermediate, imprecise results of acceptable quality when results of the desired quality cannot be produced on time. Two workload models of imprecise computations are presented. These models differ from traditional models in that a task may be terminated any time after it has produced an acceptable result. Each task is logically decomposed into a mandatory part followed by an optional part. In a feasible schedule, the mandatory part of every task is completed before the deadline of the task. The optional part refines the result produced by the mandatory part to reduce the error in the result. >

Imprecise computations

Abstract: The imprecise computation technique has been proposed as a way to handle transient overload and to enhance fault tolerance of real-time systems. In a system based on this technique, each time-critical task is designed in such a way that it can produce a usable, approximate result in time whenever a failure or overload prevents it from producing the desired, precise result. This paper describes ways to implement imprecise computations, models to characterize them and algorithms for scheduling them. An imprecise mechanism for the generation and use of approximate results can be integrated in a natural way with a traditional fault-tolerance mechanism. An architectural framework for this integration is described. >

System and method of dynamic service composition for business process outsourcing

Abstract: A system and method for capturing a plurality of business requirements using a Business Process Outsourcing Language (BPOL), an XML representation for expressing business process flow rules, preferences, business rules and event-action mappings as well as service links, to automate the process of generating business processes for use with Web services. BPOL is used to dynamically construct a search script for an advanced Web services discovery engine to find Web services from both UDDI registries and Web services Inspection Language (WSIL) documents and then create a qualified service list. Then a service selection problem is mapped into a solution space {0,1} for use by an optimization algorithm that performs second level service selection of the best set of services based on the requirements.

Dynamic business process automation system using XML documents

Abstract: A system for exchanging and merging messages over a network includes a server accessible by a plurality of remote browsers for transmitting a template including fields for information entry and a business system accessible by the server for generating a return document pursuant to information entered in the template on the browsers. The business system includes a first parser for receiving a document from a browser, the document including information about data characteristics of information entered into the template, and a second parser for receiving information about data characteristics to provide a return template. A merging algorithm is implemented to merge the document with the return template for providing a return document to the browser having portions of the return template with data entered therein.

The Physiology of the Grid An Open Grid Services Architecture for Distributed Systems Integration

Abstract: In both e-business and e-science, we often need to integrate services across distributed, heterogeneous, dynamic “virtual organizations” formed from the disparate resources within a single enterprise and/or from external resource sharing and service provider relationships. This integration can be technically challenging because of the need to achieve various qualities of service when running on top of different native platforms. We present an Open Grid Services Architecture that addresses these challenges. Building on concepts and technologies from the Grid and Web services communities, this architecture defines a uniform exposed service semantics (the Grid service); defines standard mechanisms for creating, naming, and discovering transient Grid service instances; provides location transparency and multiple protocol bindings for service instances; and supports integration with underlying native platform facilities. The Open Grid Services Architecture also defines, in terms of Web Services Description Language (WSDL) interfaces and associated conventions, mechanisms required for creating and composing sophisticated distributed systems, including lifetime management, change management, and notification. Service bindings can support reliable invocation, authentication, authorization, and delegation, if required. Our presentation complements an earlier foundational article, “The Anatomy of the Grid,” by describing how Grid mechanisms can implement a service-oriented architecture, explaining how Grid functionality can be incorporated into a Web services framework, and illustrating how our architecture can be applied within commercial computing as a basis for distributed system integration—within and across organizational domains. This is a DRAFT document and continues to be revised. The latest version can be found at http://www.globus.org/research/papers/ogsa.pdf. Please send comments to foster@mcs.anl.gov, carl@isi.edu, jnick@us.ibm.com, tuecke@mcs.anl.gov Physiology of the Grid 2

Consistent set of interfaces derived from a business object model

Abstract: Methods and systems consistent with the present invention provide a data processing system having a business object model reflecting the data used during a business transaction. Consistent interfaces are generated from the business object model. These interfaces are suitable for use across industries, across businesses, and across different departments within a business during a business transaction.

Systems and methods for processing data flows

Abstract: A flow processing facility, which uses a set of artificial neurons for pattern recognition, such as a self-organizing map, in order to provide security and protection to a computer or computer system supports unified threat management based at least in part on patterns relevant to a variety of types of threats that relate to computer systems, including computer networks. Flow processing for switching, security, and other network applications, including a facility that processes a data flow to address patterns relevant to a variety of conditions are directed at internal network security, virtualization, and web connection security. A flow processing facility for inspecting payloads of network traffic packets detects security threats and intrusions across accessible layers of the IP-stack by applying content matching and behavioral anomaly detection techniques based on regular expression matching and self-organizing maps. Exposing threats and intrusions within packet payload at or near real-time rates enhances network security from both external and internal sources while ensuring security policy is rigorously applied to data and system resources. Intrusion Detection and Protection (IDP) is provided by a flow processing facility that processes a data flow to address patterns relevant to a variety of types of network and data integrity threats that relate to computer systems, including computer networks.

An analysis of time-dependent planning

Abstract: This paper presents a framework for exploring issues in time-dependent planning: planning in which the time available to respond to predicted events varies, and the decision making required to formulate effective responses is complex. Our analysis of time-dependent planning suggests an approach based on a class of algorithms that we call anytime algorithms. Anytime algorithms can be interrupted at any point during computation to return a result whose utility is a function of computation time. We explore methods for solving time-dependent planning problems based on the properties of anytime algorithms.