Computer Engineering

Different negotiation engineering domains require from the system designer to tailor the negotiation framework according to the domain under which it will be used. This process of system design is timely consuming when supporting different geographically distributed and dynamic environments. Here we show a methodology to design negotiation systems by integrating domain-dependent message structure ontology with domain-independent marketplace architecture. The methodology gives the system designers a powerful modeling tool that can be used to tailor the framework in order to support different negotiation behaviors under different domains. System Entity Structure (SES) formalism is used to build the domain-dependent ontology while Finite Deterministic Discrete EVent System (FD-DEVS) formalism is used to build the marketplace model. The discrete event system with service oriented architecture (DEVS/SOA) simulation environment was employed to demonstrate a proof of concept of applicability to web service domains.

Using the 2D multi-group, flux-limited diffusion version of the code VUL-CAN/2D, that also incorporates rotation, we have calculated the collapse, bounce, shock formation, and early post-bounce evolutionary phases of a corecollapse supernova for a variety of initial rotation rates. This is the first series of such multi-group calculations undertaken in supernova theory with fully multi-D tools. We find that though rotation generates pole-to-equator angular anisotropies in the neutrino radiation fields, the magnitude of the asymmetries is not as large as previously estimated. The finite width of the neutrino decoupling surfaces and the significant emissivity above the τ = 2/3 surface moderate the angular contrast. Moreover, we find that the radiation field is always more spherically symmetric than the matter distribution, with its plumes and convective eddies. The radiation field at a point is an integral over many sources from the different contributing directions. As such, its distribution is much smoother than that of the matter and has very little power at high spatial frequencies. We present the dependence of the angular anisotropy of the neutrino fields on neutrino species, neutrino energy, and initial rotation rate. Only for our most rapidly rotating model do we start to see qualitatively different hydrodynamics, but for the lower rates consistent with the pre-collapse rotational profiles derived in the literature the anisotropies, though interesting, are modest. This does not mean -2that rotation does not play a key role in supernova dynamics. The decrease in the effective gravity due to the centripetal effect can be quite important. Rather, it means that when a realistic mapping between initial and final rotational profiles and 2D multi-group radiation-hydrodynamics are incorporated into collapse simulations the anisotropy of the radiation fields may be only a secondary, not a pivotal factor, in the supernova mechanism.

The ability to study complex systems has become feasible with the new intensive computing resources such as GPU, multi-core, clusters, and Cloud infrastructures. Many companies and scientific applications use multi-agent modeling and simulation platforms to study complex processes where analytical approach is not feasible. In this paper, we use two negotiation protocols to generalize the interaction behaviors between agents in multi-agent environments. The negotiation protocols are enforced by a domain-independent marketplace agent. In order to provide the agents with flexible language structure, a domain-dependent ontology is used. The integration of the domain-independent marketplace with the domain-dependent language ontology is accomplished through an automatic code generation tool. The tool simplifies deploying the framework for a specific domain of interest. Our methodology is implemented in FD-DEVS simulation environment and SES ontological framework.

The ability to manage and exploit geographically distributed systems of service providers is rather limited in today engineering solutions. Existing techniques suffer from three main problems: first, current techniques cannot provide brokering in managing loosely coupled service providers. Second, the engineering design of existing management tools does not provide enough expressive capabilities for varying user behaviors or when different domains are encountered. Third, lack of interaction between different requestors and providers yields inefficient and very costly agreements. In this dissertation, we will present an automated Domain-Independent Marketplace architecture that allows user agents to interact with provider agents using two simple and yet powerful negotiation protocols which define the rules of interactions in multi-agent environments.

In this paper, we will present a generic Domain-Independent Marketplace architecture that allows user agents to interact with service providers using two simple and yet powerful negotiation protocols. Service providers have different capabilities depending on the domain of interest. Hence, a dynamic message structuring capability is needed. A key role to support such an expressive power is to design an ontology that contains specializations between different domains. Integrating of the Domain-Dependent Ontology with the Domain-Independent marketplace gives the designer a powerful tool in which systems can be tailored based on the operational purposes. Encounter, Oceanography designing a Domain-Independent Marketplace architecture that allows user agents to interact with service providers using two simple and yet powerful negotiation protocols which define the rules of interactions in multi-agent environments. Having a trusted third party marketplace supports privacy and transparency among collaborative agents and service providers. Service providers have different capabilities depending on the domain of interest. Such providers can be Radar sensors as in oceanography surveillance systems, print servers in distributed printing jobs community, or they can be online stores providing products on the Web in the e-commerce domain. In order to provide negotiation in different domains, a dynamic message structuring capability is needed. A key role to support such an expressive power is to design an Ontology that contains specialization relations between the different domains of interest.

The rapid increase in wired Internet speed and the constant growth in the number of attacks make network protection a challenge. Intrusion detection systems (IDSs) play a crucial role in discovering suspicious activities and also in preventing their harmful impact. Existing signature-based IDSs have significant overheads in terms of execution time and memory usage mainly due to the pattern matching operation. Therefore, there is a need to design an efficient system to reduce overhead. This research intends to accelerate the pattern matching operation through parallelizing a matching algorithm on a multi-core CPU. In this paper, we parallelize a bit-vector algorithm, Myers algorithm, on a multi-core CPU under the MapReduce framework. On average, we achieve four times speedup using our multi-core implementations when compared to the serial version. Additionally, we use two implementations of MapReduce to parallelize the Myers algorithm using Phoenix++ and MAPCG. Our MapReduce parallel implementations of the Myers algorithm are compared with an earlier message passing interface (MPI)-based parallel implementation of the algorithm. The results show 1.3 and 1.7 times improvement for Phoenix++ and MAPCG MapReduce implementations over MPI respectively.

The rapid increase in wired Internet speed and the constant growth in the number of attacks make network protection a challenge. Intrusion detection systems (IDSs) play a crucial role in discovering suspicious activities and also in preventing their harmful impact. Existing signature-based IDSs have significant overheads in terms of execution time and memory usage mainly due to the pattern matching operation. Therefore, there is a need to design an efficient system to reduce overhead. This research intends to accelerate the pattern matching operation through parallelizing a matching algorithm on a multi-core CPU. In this paper, we parallelize a bit-vector algorithm, Myers algorithm, on a multi-core CPU under the MapReduce framework. On average, we achieve four times speedup using our multi-core implementations when compared to the serial version. Additionally, we use two implementations of MapReduce to parallelize the Myers algorithm using Phoenix++ and MAPCG. Our MapReduce parallel...