Political Optimizer Based Feedforward Neural Network for Classification and Function Approximation

Neural Processing Letters - Political optimizer (PO) is a recently proposed human-behavior inspired meta-heuristic, which has shown tremendous performance on complex multimodal functions as well as...     

Using Automated Negotiation for Grid Services

The popularity of grid services has widened their application to numerous domains and increased the utilization of computational resources. In order to create more incentives for the resources owners to lease their resources and prevent users from wasting the resources, the introduction of a market-oriented grid is inevitable. However, the issues for the negotiation between service provider and consumer over the supply and demand of resources can be complex, with highly interdependent issues. In this research, a simulated automated negotiation mechanism including a co-evolutionary mechanism and a modified game theory approach is proposed, to assist them in reaching an agreement over the conflicting issues. In the proposed architecture, the co-evolution process is able to reduce the multiple dimensional search space into a two-dimension search space and identify the appropriate negotiation strategies for the negotiating agents to form a payoff matrix which can be used for the game theory related stage of their interaction. The multiple stage negotiation process is introduced to improve the negotiation result. In this paper, an application which requires a large amount of computational resources to process the data generated from mobile devises is used to demonstrate that the proposed system is able to resolve the conflicts and obtain a valid solution.     

Soil–conduit interaction: an artificial intelligence application for reinforced concrete and corrugated steel conduits

Neural Computing and Applications - Marston’s load theory is commonly used for understanding the soil–conduit interaction. However, there are no practical methods available which can...     

Autonomous mapping of HL7 RIM and relational database schema

Healthcare systems need to share information within and across the boundaries in order to provide better care to the patients. For this purpose, they take advantage of the full potential of current state of the art in healthcare standards providing interoperable solutions. HL7 V3 specification is an international message exchange and interoperability standard. HL7 V3 messages exchanged between healthcare applications are ultimately recorded into local healthcare databases, mostly in relational databases. In order to bring these relational databases in compliance with HL7, mappings between HL7 RIM (Reference Information Model) and relational database schema are required. Currently, RIM and database mapping is largely performed manually, therefore it is tedious, time consuming, error prone and expensive process. It is a challenging task to determine all correspondences between RIM and schema automatically because of extreme heterogeneity issues in healthcare databases. To reduce the amount of manual efforts as much as possible, autonomous mapping approaches are required. This paper proposes a technique that addresses the aforementioned mapping issue and aligns healthcare databases to HL7 V3 RIM specifications. Furthermore, the proposed technique has been implemented as a working application and tested on real world healthcare systems. The application loads the target healthcare schema and then identifies the most appropriate match for tables and the associated fields in the schema by using domain knowledge and the matching rules defined in the Mapping Knowledge Repository. These rules are designed to handle the complexity of semantics found in healthcare databases. The GUI allows users to view and edit/re-map the correspondences. Once all the mappings are defined, the application generates Mapping Specification, which contains all the mapping information i.e. database tables and fields with associated RIM classes and attributes. In order to enable the transactions, the application is facilitated with the autonomous code generation from the Mapping Specification. The Code Generator component focuses primarily on generating custom classes and hibernate mapping files against the runtime system to retrieve and parse the data from the data source—thus allows bi-directional HL7 to database communication, with minimum programming required. Our experimental results show 35–65% accuracy on real laboratory systems, thus demonstrating the promise of the approach. The proposed scheme is an effective step in bringing the clinical databases in compliance with RIM, providing ease and flexibility.     

A fatigue-life prediction methodology for notched aluminum-magnesium alloy in gulf seawater environment

Local-strain and linear-elastic fracture-mechanics (LEFM) methodologies have been investigated for prediction of the corrosion-fatigue life of notched components of specially developed Al-2.5Mg alloys exposed to Arabian Gulf seawater environment. Corrosion-fatigue crack initiation life estimates were obtained using strain-life relationships; corrosion-fatigue crack propagation life estimates were obtained using LEFM relationships. The total corrosion-fatigue life was considered to be the sum of the crack initiation and crack propagation lives. Estimated corrosion-fatigue lives were compared with experimentally obtained corrosion-fatigue life data using center-notched specimens of three types of Al-2.5Mg alloys (containing different amounts of chromium) exposed to Arabian Gulf seawater environment. Two notch geometries, a circular notch (K _t= 2.42) and an elliptical notch (K _t= 4.2), were investigated. Good corrosion-fatigue life predictions can be obtained using local-strain and LEFM methodologies by determining the relevant material constants via a few simple fatigue tests on smooth specimens and a few crack-growth-rate tests in the environment at the frequency of interest.     

A new technique for the construction of confusion component based on inverse LA-semigroups and its application in steganography

The present article introduced a novel idea for information hiding namely steganography. We have used new notions for the construction of the nonlinear component for block cipher based on inverse LA-semigroups. This nonlinear component fundamentally provides confidentiality in the proposed steganographic algorithm. The construction of the algorithm is fundamentally twofold. Firstly, we have constructed a novel scheme to design confusion component namely substitution box (S-box). Secondly, we have utilized the anticipated nonlinear component in digital steganography. The suggested algorithm is tested for different standard digital images. The authentication of the proposed algorithm is confirmed through statistical analysis.

     

MIRRE approach: nonlinear and multimodal exploration of MIR aggregated search results

Multimedia Tools and Applications - Nowadays, web users frequently explore multimedia contents to satisfy their information needs. The exploration approaches usually provide linear interaction...     

A class-based scheme for E-commerce web servers: Formal specification and performance evaluation

This paper is an investigation into the performance of E-commerce applications. E-commerce has become one of the most popular applications of the web as a large population of web users is now benefiting from various on-line services including product searches, product purchases and product comparison. E-commerce provides users with 24-7 shopping facilities. However, the consequence of these benefits and facilities is the excessive load on E-commerce web servers and the performance degradation of E-commerce (eCom) requests they process. This paper addresses this issue and proposes a class-based priority scheme which classifies eCom requests into high and low priority requests. In E-commerce, some requests (e.g. payment) are generally considered more important than others (e.g. search or browse). We believe that by assigning class-based priorities at multiple service levels, E-commerce web servers can perform better and can improve the performance of high priority eCom requests. In this paper, we formally specify and implement the proposed scheme and evaluate its performance using multiple servers. Experimental results demonstrate that the proposed scheme significantly improves the performance of high priority eCom requests.