Search

Dendritic fibromyxolipoma, a rare subtype of lipoma, mainly occurs in the neck, back, and chest wall. Here, we describe the first reported case located in the parotid gland. It happened in a 24-year-old woman with a well-demarcated painless mass. Pathologically, the tumor was characterized by small spindle and stellate cells, an unequal number of mature fat cells, plentiful myxoid stroma, and collagenous fiber bundles. Immunochemistry demonstrated that the tumor cells were positive for vimentin, CD34, Bcl-2, and desmin, but not for keratin, EMA, SMA, or S-100. The tumor was successfully removed without complications. This report will bring to the attention of clinicians the clinical features and differential diagnosis of this unusual tumor.

In fault diagnosis of circuit, fault diagnosis system using multi-sensor data fusion may not give reliable fault diagnosis result in cases when processing on inconsistent data carry inconsistent. In order to deal with such problems, This paper has developed an analog-circuit fault diagnostic system based on transferable belief model (TBM) and K-nearest neighbor rule from TBM. The proposed system has the capability to detect and identify fault components in an analog electronic circuit by analyzing its working temperature and testable voltage. Using K-nearest neighbor(KNN) rule to process the working temperature of component drastically enhances the testable information for fault detect, satisfying the need of fusing data from distinct evidence sources. The experimental results show that this system performs significantly better in fault diagnosis of analog circuits due to the proposed techniques. Keywords-analog circuit; fault diagnosis; transferable belief model; k-nearest neighbor rule from TBM; fault location; data fusion

Off-The-Shelf (COTS) software components have been extensively used by applications over the world. However, COTS components always carry issues that might and sometimes only take place at runtime, in particular, when combined with other components. This might bring serious trouble for the application's dependability. Based on the industry experiences that lots of faulty components usually occupy excessive resources, this paper proposes an approach to localize the faulty components in an application automatically through analyzing the resource usage of components. Once a faulty component interferes with the application's performance, our approach generates an anomaly report, localizes the faulty component, and enables component level recovery to remove the negative impact. We have implemented a prototype and demonstrated its effectiveness on the well-known JPetStore benchmark with performance overhead of less than 3%.

Service Level Agreements (SLAs) play an important role in service-based systems. However, traditional approaches to establish SLAs are mostly manual and predefined which is not suitable for the highly dynamic and unpredictable service-oriented environment. In this paper, we propose a policy-based framework for supporting dynamic and automated SLA negotiations for Web services. In our framework, we extend the WS-Policy framework to provide a domain-independent policy language for specifying QoS constraints over the QoS attributes that are to be negotiated. Negotiation agents are dynamically created to perform SLA negotiations on behalf of each negotiating party in a P2P way using standard web services invocations. Decision making models of negotiation agents are also defined in a declarative way and can be reconfigured easily. We have implemented a prototype of our framework and demonstrated our approach through a case study.

The dynamic unpredictable nature of service-oriented environments demands service-based systems to be inherently flexible and adaptive. In this paper, we propose a constraint-based framework for supporting dynamic business process adaptation. In our framework, process adaptations are performed in a modular way based on process fragments. Process fragments are standalone fragments of processes that can be reused across multiple processes. Processes are composed of a series of fragments. The relationships among fragments are specified in a constraint-based way. The adaptation logic to select concrete fragments is separated from business logic in a process and can be defined in a policy-based approach. Processes are dynamically generated based on the constraints and adaptation policies according to the operating environments, so it is flexible to adapt to the ever-changing operating environments and business requirements. We have implemented a prototype to demonstrate and evaluate our approach.

Service Level Agreements (SLAs) play an important role in guaranteeing successful collaborations among autonomous entities in Internet-based Virtual Computing Environment (iVCE). However, traditional static and predefined SLAs are not suitable for the open and dynamic iVCE. This paper proposes a policy-based framework for supporting dynamic and automated SLA negotiations between autonomous entities in iVCE. Requirements or constraints on SLA attributes as well as negotiation strategies of negotiating parties are both specified in policy specifications using a simple but expressive policy language that extends the WS-Policy framework. According to these policies, a negotiation agent will be dynamically created for each negotiation party, which is responsible for SLA negotiations on behalf of its owner party. We have implemented a prototype of our framework and demonstrated our approach through a case study.

As service behavior plays a key role in service interaction, behavior-based service discovery has been increasingly recognized as a critical activity for service-based systems. However, little attention has been paid to the retrieval of behavioral models, which is critical for behavior-based discovery. This paper proposes an approach for extracting service behavioral models from WS-BPEL, which has been emerging as the prominent language for service orchestration. Our approach identifies all participants involved in a WS-BPEL process and abstracts the interaction of the process with its participants through behavioral models. Furthermore, we distinguish three types of ordering constraints between activities in behavioral models. Based on this, we present a mechanism to automatically adapt WS-BPEL processes to find and use other similar services when no service satisfies exactly the specified requirements. We have implemented a prototype to demonstrate and evaluate our approach.

Dynamic component updating, which allows a running system to be updated without interrupting its execution, has been recognized as an important requirement for distributed systems. However, most of existing approaches complicate the component development by making the component’s updating logic mixed with its business logic. This paper proposes a flexible and lightweight approach for supporting dynamic component updating. Our approach allows multiple versions of a component to co-exist with the support of runtime version management mechanism. Multiple polices are provided to coordinate behaviors of different component versions. In this way, seamless system updating can be achieved and the reliability during updating is also guaranteed. Moreover, our approach separates the component’s updating logic from its business logic and little burden are placed on developers. The experimental results show that the performance overhead is trivial.

In recent years, Java Enterprise Edition (Java EE) technologies keep expanding with more and more features. The customization of application server is becoming multifarious owing to different environments and domains. And delivering a continuous evolving application server is more frequent and costly. However, current application servers cannot meet such requirements, due to their inexplicit module boundary, insufficient lifecycle management and relatively absent dependency management. In this paper, we propose an approach to make an application server well structured and dynamic. Guided by this approach, we implemented a prototype, namely PKUAS II. The evaluations show that a flexible, customizable and dynamic application server can be developed without an adverse effect on the performance.