Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences Commons™

Open Access. Powered by Scholars. Published by Universities.®

Computer Science Faculty Research & Creative Works

Discipline
Keyword
Publication Year

Articles 571 - 600 of 919

Full-Text Articles in Computer Sciences

An Efficient Trust Propagation Scheme For Predicting Trustworthiness Of Service Providers In Service-Oriented Social Networks, Yu Xu, Jianxun Liu, Mingdong Tang, Xiaoqing Frank Liu Jan 2013

An Efficient Trust Propagation Scheme For Predicting Trustworthiness Of Service Providers In Service-Oriented Social Networks, Yu Xu, Jianxun Liu, Mingdong Tang, Xiaoqing Frank Liu

Computer Science Faculty Research & Creative Works

Perception of trustworthiness of service providers is a fundamental need in service selection. Trust propagation has been used to predict trustworthiness of service providers in service-oriented social networks. However, existing trust propagation methods may suffer from a scalability problem, i.e., their computation time is likely too high to be acceptable in practice, especially when they are applied to very large-scale service-oriented social networks. Moreover, they rarely consider the structural properties of social networks to optimize their performance. This paper proposes an efficient trust propagation scheme for predicting trust in service-oriented social networks. It exploits the specific structural properties of social …

Go to article

Casat-Hoomt: Computer Aided Software Analysis Tool Based On High Order Object-Oriented Modeling Technique, Fan Zhang, Jinwu Wang, Xiaoqing Frank Liu, Buqing Cao, Mingdong Tang Jan 2013

Casat-Hoomt: Computer Aided Software Analysis Tool Based On High Order Object-Oriented Modeling Technique, Fan Zhang, Jinwu Wang, Xiaoqing Frank Liu, Buqing Cao, Mingdong Tang

Computer Science Faculty Research & Creative Works

This paper presents the first computer aided software analysis tool based on HOOMT (High Order Object-oriented Modeling Technique), which provides facilities for structured object-oriented analysis by integrating structured analysis and object-oriented analysis. It contains a graphical user interface for HOOMT-based modeling, supports modeling information management, and provides functionalities for developing three component sub-models in HOOMT: High Order Object Model (HOOM), Hierarchical Object Information Flow Model (HOIFM), and Hierarchical State Transition Model (HSTM). It supports structured decomposition of high-order objects, processes, and states. We describe its system architecture and implementation in this paper. © 2013 IEEE.

Go to article

Pcv: Predicting Contact Volume For Reliable And Efficient Data Transfers In Opportunistic Networks, Shiraz Qayyum, Mehrab Shahriar, Mohan Kumar, Sajal K. Das Jan 2013

Pcv: Predicting Contact Volume For Reliable And Efficient Data Transfers In Opportunistic Networks, Shiraz Qayyum, Mehrab Shahriar, Mohan Kumar, Sajal K. Das

Computer Science Faculty Research & Creative Works

Exploiting opportunistic contacts between mobile devices to enable deployment of real applications through reliable and efficient data transfers poses a significant research challenge. Indeed, accurate prediction of contact volume, defined as the maximum amount of data transferable during a contact, can improve performance of deployments. However, existing schemes for estimating contact volume that make use of preconceived patterns or contact time distributions may not be applicable in uncertain environments. In this paper, we propose a novel scheme called PCV that predicts contact volume in soft real-time to enable efficient and reliable data transfers in opportunistic networks. An Android Application that …

Go to article

Improving Adaptation Rules Quality Using Genetic Programming, Makram Soui, Asma Abdelbaki, Marouane Kessentini, Khaled Ghedira Jan 2013

Improving Adaptation Rules Quality Using Genetic Programming, Makram Soui, Asma Abdelbaki, Marouane Kessentini, Khaled Ghedira

Computer Science Faculty Research & Creative Works

Personalized Information System (PIS) aims to provide tailored services to users in various contexts. The aim of such system is to help users find relevant content easier and faster. To achieve such behavior, the system needs a user model providing information about users, e.g., about their interests, skills, background and custom information while ensuring their adaptation to the needs and preferences of each user. This system is able to learn about the preferences of individual users and to tailor the content, interface, and behavior to the user preferences. In fact, the diversity of contexts and the proliferation of profiles make …

Go to article

Cross-Layer Schemes For Reducing Delay In Multihop Wireless Networks, Maggie Xiaoyan Cheng, Quanmin Ye, Lin Cai Dec 2012

Cross-Layer Schemes For Reducing Delay In Multihop Wireless Networks, Maggie Xiaoyan Cheng, Quanmin Ye, Lin Cai

Computer Science Faculty Research & Creative Works

End-to-end delay is an important QoS metric in multihop wireless networks such as sensor networks and mesh networks. End-to-end delay is defined as the total time it takes for a single packet to reach the destination. It is a result of many factors including the length of the route and the interference level along the path. in this paper we address how to minimize end-to-end delay jointly through optimizing routing and link layer scheduling. We present two cross-layer schemes, a loosely coupled cross-layer scheme and a tightly coupled cross-layer scheme. in the loosely coupled cross-layer scheme, routing is computed first …

Go to article

Secure Hierarchical Data Aggregation In Wireless Sensor Networks: Performance Evaluation And Analysis, Vimal Kumar, Sanjay Kumar Madria Dec 2012

Secure Hierarchical Data Aggregation In Wireless Sensor Networks: Performance Evaluation And Analysis, Vimal Kumar, Sanjay Kumar Madria

Computer Science Faculty Research & Creative Works

Secure data aggregation in wireless sensor networks has two contrasting objectives, i) Efficiently collecting and aggregating data and ii) Aggregating the data securely. Many schemes do not take into account the possibility of corrupt aggregators and allow the aggregator to decrypt data in hop-by-hop algorithms. on the other hand, using public key cryptography for providing end to end security is not energy efficient. in this paper we present and analyze the performance of the secure hierarchical data aggregation algorithm which uses an efficient public key cryptosystem (elliptic curve cryptography) to achieve end to end security. Unlike many other secure data …

Go to article

Trust Management Of Encrypted Data Aggregation In A Sensor Network Environment, Nayot Poolsappasit, Michael Busby, Sanjay Kumar Madria Dec 2012

Trust Management Of Encrypted Data Aggregation In A Sensor Network Environment, Nayot Poolsappasit, Michael Busby, Sanjay Kumar Madria

Computer Science Faculty Research & Creative Works

Efficient power management is vital for increasing the life of sensor nodes in wireless sensor networks (WSN). Thus, techniques such as data aggregation have been widely used in WSN to preserve nodes' energy. Despite its appealing and powerful features, data aggregation processes require a high level of security. Ensuring accuracy with aggregating data can become an issue even due to single bit errors. Hence, many encryption techniques have been proposed to secure the data aggregation process. However, once a wireless sensor is physically compromised, the keys stored on the sensor are exposed, thus rendering the cryptography useless. Moreover, most cryptographic …

Go to article

Crowdsourcing: Dynamic Data Management In Mobile P2p Networks, Sanjay Kumar Madria, Anirban Mondal Dec 2012

Crowdsourcing: Dynamic Data Management In Mobile P2p Networks, Sanjay Kumar Madria, Anirban Mondal

Computer Science Faculty Research & Creative Works

No abstract provided.

Go to article

Ctod: Collaborative Tree-Based Outlier Detection In Wireless Sensor Networks, Dylan Mcdonald, Sanjay Kumar Madria, Fikret Ercal, Ryan Birmingham, Thomas Lake Dec 2012

Ctod: Collaborative Tree-Based Outlier Detection In Wireless Sensor Networks, Dylan Mcdonald, Sanjay Kumar Madria, Fikret Ercal, Ryan Birmingham, Thomas Lake

Computer Science Faculty Research & Creative Works

Outlier detection is a well-studied problem in various fields. the unique challenges of wireless sensor networks such as limited bandwidth, memory, energy, and unreliable communication make this problem especially difficult. Sensors can detect outliers for a plethora of reasons and these reasons need to be inferred in real time. Here, we present a new robust communication framework for the unsupervised in network detection of outliers in a wireless sensor network. First, communication is minimized through an ad-hoc collaborative communication scheme which controls sensor behavior to increase overall visibility of individual streaming data sets. Second, an outlier detection algorithm is tailored …

Go to article

Search-Based Detection Of High-Level Model Changes, Ameni Ben Fadhel, Marouane Kessentini, Philip Langer, Manuel Wimmer Dec 2012

Search-Based Detection Of High-Level Model Changes, Ameni Ben Fadhel, Marouane Kessentini, Philip Langer, Manuel Wimmer

Computer Science Faculty Research & Creative Works

Software models are iteratively refined, restructured and evolved. the detection and analysis of changes applied between two versions of a model are one of the most important tasks during evolution and maintenance activities. in this paper, we propose an approach to detect high-level model changes in terms of refactoring. Our approach takes as input an exhaustive list of possible refactoring, the initial model and revised model, and generates as output a list of detected changes representing a sequence of refactoring. a solution is defined as a combination of refactoring that should maximize as much as possible the similarity between the …

Go to article

An Evaluation Of Fairness Among Heterogeneous Tcp Variants Over 10gbps High-Speed Networks, Lin Xue, Suman Kumary, Cheng Cui, Seung Jong Park Dec 2012

An Evaluation Of Fairness Among Heterogeneous Tcp Variants Over 10gbps High-Speed Networks, Lin Xue, Suman Kumary, Cheng Cui, Seung Jong Park

Computer Science Faculty Research & Creative Works

Several high-speed TCP variants are adopted by end users and therefore, heterogeneous congestion control has become the characteristic of newly emerging high-speed networks. In contrast to homogeneous TCP flows, fairness among heterogeneous TCP flows now depends on router parameters such as queue management scheme, buffer size, etc. To the best of our knowledge, this is the first evaluation of fairness among heterogeneous TCP variants over 10Gbps high-speed networks. Our evaluation scenarios for heterogeneous TCP flows consist of TCP variants with substantial presence in current Internet; therefore, TCP-SACK, CUBIC and HSTCP compete for bottleneck bandwidth. Experimental results for fairness are presented …

Go to article

Structural And Message Based Private Friend Recommendation, Bharath K. Samanthula, Wei Jiang Dec 2012

Structural And Message Based Private Friend Recommendation, Bharath K. Samanthula, Wei Jiang

Computer Science Faculty Research & Creative Works

The emerging growth of online social networks have opened new doors for various business applications such as promoting a new product across its customers. Besides this, friend recommendation is an important tool for recommending potential candidates as friends to users in order to enhance the development of the entire network structure. Existing friend recommendation methods utilize social network structure and/or user profile information. However, these techniques can no longer be applicable if the privacy of users is taken into consideration. in this paper, we propose a two-phase private friend recommendation protocol for recommending friends to a given target user based …

Go to article

Query Plan Execution In A Heterogeneous Stream Management System For Situational Awareness, Indrakshi Ray, Sanjay K. Madria, Mark Linderman Dec 2012

Query Plan Execution In A Heterogeneous Stream Management System For Situational Awareness, Indrakshi Ray, Sanjay K. Madria, Mark Linderman

Computer Science Faculty Research & Creative Works

Battlefield monitoring involves collecting streaming data from different sources, transmitting the data over a heterogeneous network, and processing queries in real-time in order to respond to events in a timely manner. Nodes in these networks differ with respect to their processing, storage and communication capabilities. Links in the network differ with respect to their communication bandwidth. the topology of the network itself is subject to change, as the nodes and links may become unavailable. Continuous queries executed in such environments must also meet some quality of service (QoS) requirements, such as, response time, throughput, and memory usage. We propose that …

Go to article

Exploring Compile Time Caching Of Explicit Queries In Programming Codes, Venkata Krishna Suhas Nerella, Sanjay Madria, Thomas Weigert Dec 2012

Exploring Compile Time Caching Of Explicit Queries In Programming Codes, Venkata Krishna Suhas Nerella, Sanjay Madria, Thomas Weigert

Computer Science Faculty Research & Creative Works

Object oriented programming languages raised the level of abstraction by incorporating first class query constructs explicitly in the program codes. These query constructs allow programmers to express operations over collections as object queries and also provide optimal query execution utilizing query optimization strategies from domain of databases. However, when a query is repeated in the program, it is executed afresh. This paper presents an approach to reduce the run time execution of programs involving explicit queries by caching the results of repeated queries and incrementally maintaining the cached results. We propose determination of cache entries at compile time by performing …

Go to article

Automatic Social Group Organization And Privacy Management, Anna Squicciarini, Dan Lin, Sushama Karumanchi, Nicole Desisto Dec 2012

Automatic Social Group Organization And Privacy Management, Anna Squicciarini, Dan Lin, Sushama Karumanchi, Nicole Desisto

Computer Science Faculty Research & Creative Works

With the dramatic increase of users on social network websites, the needs to assist users to manage their large number of contacts as well as providing privacy protection become more and more evident. Unfortunately, limited tools are available to address such needs and reduce users' workload on managing their social relationships. to tackle this issue, we propose an approach to facilitate online social network users to group their contacts into social circles with common interests. Further, we leverage the social group practice to automate the privacy setting process for users who add new contacts or upload new data items. We …

Go to article

Search-Based Refactoring: Towards Semantics Preservation, Ali Ouni, Marouane Kessentini, Houari Sahraoui, Mohamed Salah Hamdi Dec 2012

Search-Based Refactoring: Towards Semantics Preservation, Ali Ouni, Marouane Kessentini, Houari Sahraoui, Mohamed Salah Hamdi

Computer Science Faculty Research & Creative Works

Refactoring restructures a program to improve its structure without altering its behavior. However, it is challenging to preserve the domain semantics of a program when refactoring is decided/implemented automatically. Indeed, a program could be syntactically correct, have the right behavior, but model incorrectly the domain semantics. in this paper, we propose a multi-objective optimization approach to find the best sequence of refactorings that maximizes quality improvements (program structure) and minimizes semantic errors. to this end, we use the non-dominated sorting genetic algorithm (NSGA-II) to find the best compromise between these two conflicting objectives. We report the results of our experiments …

Go to article

A Combinatorial Solution For Scheduling Spatial Multiplexing In Mimo-Based Ad Hoc Networks, Maggie Cheng, Quanmin Ye Dec 2012

A Combinatorial Solution For Scheduling Spatial Multiplexing In Mimo-Based Ad Hoc Networks, Maggie Cheng, Quanmin Ye

Computer Science Faculty Research & Creative Works

In a MIMO-Based ad hoc network, the conflict relation between transmissions is fundamentally changed due to the multiple packet reception capability of MIMO nodes. a MIMO node can receive from multiple data streams at the same time, which significantly increases data throughput. to fully utilize the additional spectrum capacity enabled by the MIMO technology, it is important that transmissions from different nodes are coordinated. the coordination scheme needs to consider both data stream multiplexing and transmission time scheduling for a maximum performance gain. in this paper, we use an optimization framework to jointly consider MIMO link spatial multiplexing and scheduling …

Go to article

Three Point Encryption (3pe): Secure Communications In Delay Tolerant Networks, Roy Cabaniss, Vimal Kumar, Sanjay Madria Dec 2012

Three Point Encryption (3pe): Secure Communications In Delay Tolerant Networks, Roy Cabaniss, Vimal Kumar, Sanjay Madria

Computer Science Faculty Research & Creative Works

Mobile ad hoc networks (MANET) are a subset of Delay Tolerant Networks (DTNs) composed of several mobile devices. These dynamic environments make conventional security algorithms unreliable, nodes that are far apart may not have access to the other's public key, making secure message exchange difficult. Other security methods rely on requesting the key from a trusted third party, which can be unavailable in DTN. the purpose of this paper is to introduce two message security algorithms capable of delivering messages securely against either eavesdropping or manipulation. the first algorithm, Chaining, uses multiple midpoints to re-encrypt the message for the destination …

Go to article

Incentive Based Approach To Find Selfish Nodes In Mobile P2p Networks, Hemanth Meka, Sanjay K. Madria, Mark Linderman Dec 2012

Incentive Based Approach To Find Selfish Nodes In Mobile P2p Networks, Hemanth Meka, Sanjay K. Madria, Mark Linderman

Computer Science Faculty Research & Creative Works

In a Mobile P2P (M-P2P) network, selfish nodes can drop packets to affect the efficiency of the whole network. Therefore, we propose a simple and efficient mechanism using virtual currency to identify selfish nodes in the network. Each node issues a receipt to its broker to prove that it has provided a forwarding service. based on receipts received each broker provides well-behaved nodes some virtual currency whereas selfish nodes are punished on dropping packets to make the network more efficient. When compared to other known approaches, our scheme provides real-time detection of selfish nodes and does not require/assume the presence …

Go to article

Securing A Wireless Networked Control System Using Information Fusion, Brijesh Kashyap Chejerla, Sanjay Madria Dec 2012

Securing A Wireless Networked Control System Using Information Fusion, Brijesh Kashyap Chejerla, Sanjay Madria

Computer Science Faculty Research & Creative Works

Security of a wireless sensor network practically governs its usability in several applications. Especially, in applications like Industrial control systems which use NCS and SCADA systems, the security affects the stability of the system. We propose to use an information fusion scheme which allows us to profile the different attacks in wireless sensor networks and study their effects on the control systems stability and feedback. We make use of the Bayesian Networks to obtain hypotheses as outputs which form the decisions. These decisions are made based on the feature extraction and estimation process of the entire information fusion scheme. This …

Go to article

Network-Aware Scheduling Of Mapreduce Framework On Distributed Clusters Over High Speed Networks, Praveenkumar Kondikoppa, Chui Hui Chiu, Cheng Cui, Lin Xue, Seung Jong Park Oct 2012

Network-Aware Scheduling Of Mapreduce Framework On Distributed Clusters Over High Speed Networks, Praveenkumar Kondikoppa, Chui Hui Chiu, Cheng Cui, Lin Xue, Seung Jong Park

Computer Science Faculty Research & Creative Works

Google's MapReduce has gained significant popularity as a platform for large scale distributed data processing. Hadoop [1] is an open-source implementation of MapReduce [11] framework, originally it was developed to operate over single cluster environment and could not be leveraged for distributed data processing across federated clusters. At multiple federated clusters connected with high-speed networks, computing resources are provisioned from any of the clusters from the federation. Placement of map tasks close to its data split is critical for performance of Hadoop. In this work, we add network awareness in Hadoop while scheduling the map tasks over federated clusters. We …

Go to article

Identification Of Faction Groups And Leaders In Web-Based Intelligent Argumentation System For Collaborative Decision Support, Ravi Santosh Arvapally, Xiaoqing Liu, Wei Jiang Oct 2012

Identification Of Faction Groups And Leaders In Web-Based Intelligent Argumentation System For Collaborative Decision Support, Ravi Santosh Arvapally, Xiaoqing Liu, Wei Jiang

Computer Science Faculty Research & Creative Works

Argumentation is an important and critical process in a collaborative decision-making environment. Several argumentation frameworks and systems have been proposed for collaborative decision making earlier. However, limited decision support is provided to stakeholders. in an argumentation process, stakeholders tend to form groups, called faction groups based on their opinions and exchange of arguments. Each faction group is usually led by a faction leader in the group. Identification of faction groups and leaders in argumentation becomes an important challenge which has not been addressed adequately in the past. the faction assessment in argumentation provides the decision maker with more information about …

Go to article

A Brokerage-Based Approach For Cloud Service Selection, Smitha Sundareswaran, Anna Squicciarini, Dan Lin Oct 2012

A Brokerage-Based Approach For Cloud Service Selection, Smitha Sundareswaran, Anna Squicciarini, Dan Lin

Computer Science Faculty Research & Creative Works

great opportunities for consumers to find the best service and best pricing, which however raises new challenges on how to select the best service out of the huge pool. It is time-consuming for consumers to collect the necessary information and analyze all service providers to make the decision. This is also a highly demanding task from a computational perspective, because the same computations may be conducted repeatedly by multiple consumers who have similar requirements. Therefore, in this paper, we propose a novel brokerage-Based architecture in the Cloud, where the Cloud brokers is responsible for the service selection. in particular, we …

Go to article

Awsr: Active Web Service Recommendation Based On Usage History, Guosheng Kang, Jianxun Liu, Mingdong Tang, Xiaoqing Liu, Buqing Cao, Yu Xu Sep 2012

Awsr: Active Web Service Recommendation Based On Usage History, Guosheng Kang, Jianxun Liu, Mingdong Tang, Xiaoqing Liu, Buqing Cao, Yu Xu

Computer Science Faculty Research & Creative Works

Web services are very prevalent nowadays. Recommending Web services that users are interested in becomes an interesting and challenging research problem. in this paper, we present AWSR (Active Web Service Recommendation), an effective Web service recommendation system based on users' usage history to actively recommend Web services to users. AWSR extracts user's functional interests and QoS preferences from his/her usage history. Similarity between user's functional interests and a candidate Web service is calculated first. a hybrid new metric of similarity is developed to combine functional similarity measurement and nonfunctional similarity measurement based on comprehensive QoS of Web services. the AWSR …

Go to article

Location-Aware Collaborative Filtering For Qos-Based Service Recommendation, Mingdong Tang, Yechun Jiang, Jianxun Liu, Xiaoqing Liu Sep 2012

Location-Aware Collaborative Filtering For Qos-Based Service Recommendation, Mingdong Tang, Yechun Jiang, Jianxun Liu, Xiaoqing Liu

Computer Science Faculty Research & Creative Works

Collaborative filtering is one of widely used Web service recommendation techniques. in QoS-Based Web service recommendation, predicting missing QoS values of services is often required. There have been several methods of Web service recommendation based on collaborative filtering, but seldom have they considered locations of both users and services in predicting QoS values of Web services. Actually, locations of users or services do have remarkable impacts on values of QoS factors, such as response time, throughput, and reliability. in this paper, we propose a method of location-aware collaborative filtering to recommend Web services to users by incorporating locations of both …

Go to article

Tinypack Xml: Real Time Xml Compression For Wireless Sensor Networks, Tommy Szalapski, Sanjay Madria, Mark Linderman Aug 2012

Tinypack Xml: Real Time Xml Compression For Wireless Sensor Networks, Tommy Szalapski, Sanjay Madria, Mark Linderman

Computer Science Faculty Research & Creative Works

Wireless networks possess significant limitations in bandwidth. Additionally, real-time networks cannot tolerate high latency. While some good XML compression algorithms exist, there remains a need for methods that reduce latency and bandwidth usage further in real time wireless applications. This paper presents a new compression scheme which reduces bandwidth while minimizing latency of XML data while in transit. XML structural data is reduced to format strings and arguments are sent as they are generated using modifications of real-time compression techniques specific to each data type. Methods are introduced to gracefully handle lost data in environments where delivery of all packets …

Go to article

A Highly Optimized Algorithm For Continuous Intersection Join Queries Over Moving Objects, Rui Zhang, Jianzhong Qi, Dan Lin, Wei Wang, Raymond Chi Wing Wong Aug 2012

A Highly Optimized Algorithm For Continuous Intersection Join Queries Over Moving Objects, Rui Zhang, Jianzhong Qi, Dan Lin, Wei Wang, Raymond Chi Wing Wong

Computer Science Faculty Research & Creative Works

Given two sets of moving objects with nonzero extents, the continuous intersection joins query reports every pair of intersecting objects, one from each of the two moving object sets, for every timestamp. This type of queries is important for a number of applications, e. g., in the multi-billion-dollar computer game industry, massively multiplayer online games like World of Warcraft need to monitor the intersection among players' attack ranges and render players' interaction in real time. the computational cost of a straightforward algorithm or an algorithm adapted from another query type is prohibitive, and answering the query in real time poses …

Go to article

The Min-Dist Location Selection Query, Jianzhong Qi, Rui Zhang, Lars Kulik, Dan Lin, Yuan Xue Jul 2012

The Min-Dist Location Selection Query, Jianzhong Qi, Rui Zhang, Lars Kulik, Dan Lin, Yuan Xue

Computer Science Faculty Research & Creative Works

We propose and study a new type of location optimization problem given a set of clients and a set of existing facilities, we select a location from a given set of potential locations for establishing a new facility so that the average distance between a client and her nearest facility is minimized. We call this problem the min-dist location selection problem, which has a wide range of applications in urban development simulation, massively multiplayer online games, and decision support systems. We explore two common approaches to location optimization problems and propose methods based on those approaches for solving this new …

Go to article

Modular Reasoning About Region Composition, Thomas Cottenier, Aswin Van Den Berg, Thomas Weigert May 2012

Modular Reasoning About Region Composition, Thomas Cottenier, Aswin Van Den Berg, Thomas Weigert

Computer Science Faculty Research & Creative Works

Region composition is an operation where transitions of different automaton are woven together according to synchronization constraints. Reasoning about properties across regions is difficult, which is problematic in systems that are assembled by composing a large number of regions. We introduce two transactions constructs to enforce causality properties between transitions of a state machine. We show that transactions can be checked statically and that they support modular reasoning about region composition by preserving liveness properties within the scope of a transaction. © 2012 ACM.

Go to article

Architecture Composition For Concurrent Systems, Thomas Cottenier, Aswin Van Den Berg, Thomas Weigert May 2012

Architecture Composition For Concurrent Systems, Thomas Cottenier, Aswin Van Den Berg, Thomas Weigert

Computer Science Faculty Research & Creative Works

We present a framework to assemble concurrent applications from modules that capture reusable architectural patterns. the framework focuses on concurrent systems where computational processes communicate through asynchronous messages. the language provides support to modularize architectural patterns at different levels of granularity, using agents, regions, aspects and morphing. We present sample implementations of the architectural patterns and show how they are composed using a real-world example. Finally discuss how the deployment and composition of patterns can be further automated. © 2012 ACM.

Go to article

First Prev Next Last