Maximum Common Substructure Extraction in RNA Secondary Structures Using Clique Detection Approach

The similarity comparison of RNA secondary structures is important in studying the functions of RNAs. In recent years, most existing tools represent the secondary structures by tree-based presentation and calculate the similarity by tree alignment distance. Different to previous approaches, we propose a new method based on maximum clique detection algorithm to extract the maximum common structural elements in compared RNA secondary structures. A new graph-based similarity measurement and maximum common subgraph detection procedures for comparing purely RNA secondary structures is introduced. Given two RNA secondary structures, the proposed algorithm consists of a process to determine the score of the structural similarity, followed by comparing vertices labelling, the labelled edges and the exact degree of each vertex. The proposed algorithm also consists of a process to extract the common structural elements between compared secondary structures based on a proposed maximum clique detection of the problem. This graph-based model also can work with NC-IUB code to perform the pattern-based searching. Therefore, it can be used to identify functional RNA motifs from database or to extract common substructures between complex RNA secondary structures. We have proved the performance of this proposed algorithm by experimental results. It provides a new idea of comparing RNA secondary structures. This tool is helpful to those who are interested in structural bioinformatics.

Topographical Image Transference Compatibility Generated Through Moiré Technique Applying Parametrical Softwares of Computer Assisted Design

Computer aided design accounts with the support of parametric software in the design of machine components as well as of any other pieces of interest. The complexities of the element under study sometimes offer certain difficulties to computer design, or ever might generate mistakes in the final body conception. Reverse engineering techniques are based on the transformation of already conceived body images into a matrix of points which can be visualized by the design software. The literature exhibits several techniques to obtain machine components dimensional fields, as contact instrument (MMC), calipers and optical methods as laser scanner, holograms as well as moiré methods. The objective of this research work was to analyze the moiré technique as instrument of reverse engineering, applied to bodies of nom complex geometry as simple solid figures, creating matrices of points. These matrices were forwarded to a parametric software named SolidWorks to generate the virtual object. Volume data obtained by mechanical means, i.e., by caliper, the volume obtained through the moiré method and the volume generated by the SolidWorks software were compared and found to be in close agreement. This research work suggests the application of phase shifting moiré methods as instrument of reverse engineering, serving also to support farm machinery element designs.

Transferring Route Plan over Time

Travelling salesman problem (TSP) is a combinational optimization problem and solution approaches have been applied many real world problems. Pure TSP assumes the cities to visit are fixed in time and thus solutions are created to find shortest path according to these point. But some of the points are canceled to visit in time. If the problem is not time crucial it is not important to determine new routing plan but if the points are changing rapidly and time is necessary do decide a new route plan a new approach should be applied in such cases. We developed a route plan transfer method based on transfer learning and we achieved high performance against determining a new model from scratch in every change.

Seismic Rehabilitation of R/C Buildings Designed with Earlier Technical Standards

The seismic rehabilitation designs of two reinforced concrete school buildings, representative of a wide stock of similar edifices designed under earlier editions of the Italian Technical Standards, are presented in this paper. The mutual retrofit solution elaborated for the two buildings consists in the incorporation of a dissipative bracing system including pressurized fluid viscous springdampers as passive protective devices. The mechanical parameters, layouts and locations selected for the constituting elements of the system; the architectural renovation projects developed to properly incorporate the structural interventions and improve the appearance of the buildings; highlights of the installation works already completed in one of the two structures; and a synthesis of the performance assessment analyses carried out in original and rehabilitated conditions, are illustrated. The results of the analyses show a remarkable enhancement of the seismic response capacities of both structures. This allows reaching the high performance objectives postulated in the retrofit designs with much lower costs and architectural intrusion as compared to traditional rehabilitation interventions designed for the same objectives.

NEAR: Visualizing Information Relations in Multimedia Repository A•VI•RE

This paper describes the NEAR (Navigating Exhibitions, Annotations and Resources) panel, a novel interactive visualization technique designed to help people navigate and interpret groups of resources, exhibitions and annotations by revealing hidden relations such as similarities and references. NEAR is implemented on A•VI•RE, an extended online information repository. A•VI•RE supports a semi-structured collection of exhibitions containing various resources and annotations. Users are encouraged to contribute, share, annotate and interpret resources in the system by building their own exhibitions and annotations. However, it is hard to navigate smoothly and efficiently in A•VI•RE because of its high capacity and complexity. We present a visual panel that implements new navigation and communication approaches that support discovery of implied relations. By quickly scanning and interacting with NEAR, users can see not only implied relations but also potential connections among different data elements. NEAR was tested by several users in the A•VI•RE system and shown to be a supportive navigation tool. In the paper, we further analyze the design, report the evaluation and consider its usage in other applications.

Ranking and Unranking Algorithms for k-ary Trees in Gray Code Order

In this paper, we present two new ranking and unranking algorithms for k-ary trees represented by x-sequences in Gray code order. These algorithms are based on a gray code generation algorithm developed by Ahrabian et al.. In mentioned paper, a recursive backtracking generation algorithm for x-sequences corresponding to k-ary trees in Gray code was presented. This generation algorithm is based on Vajnovszki-s algorithm for generating binary trees in Gray code ordering. Up to our knowledge no ranking and unranking algorithms were given for x-sequences in this ordering. we present ranking and unranking algorithms with O(kn2) time complexity for x-sequences in this Gray code ordering

New Analysis Methods on Strict Avalanche Criterion of S-Boxes

S-boxes (Substitution boxes) are keystones of modern symmetric cryptosystems (block ciphers, as well as stream ciphers). S-boxes bring nonlinearity to cryptosystems and strengthen their cryptographic security. They are used for confusion in data security An S-box satisfies the strict avalanche criterion (SAC), if and only if for any single input bit of the S-box, the inversion of it changes each output bit with probability one half. If a function (cryptographic transformation) is complete, then each output bit depends on all of the input bits. Thus, if it were possible to find the simplest Boolean expression for each output bit in terms of the input bits, each of these expressions would have to contain all of the input bits if the function is complete. From some important properties of S-box, the most interesting property SAC (Strict Avalanche Criterion) is presented and to analyze this property three analysis methods are proposed.

Intelligent Network-Based Stepping Stone Detection Approach

This research intends to introduce a new usage of Artificial Intelligent (AI) approaches in Stepping Stone Detection (SSD) fields of research. By using Self-Organizing Map (SOM) approaches as the engine, through the experiment, it is shown that SOM has the capability to detect the number of connection chains that involved in a stepping stones. Realizing that by counting the number of connection chain is one of the important steps of stepping stone detection and it become the research focus currently, this research has chosen SOM as the AI techniques because of its capabilities. Through the experiment, it is shown that SOM can detect the number of involved connection chains in Network-based Stepping Stone Detection (NSSD).

Identification of an Appropriate Alternative Waste Technology for Energy Recovery from Waste through Multi-Criteria Analysis

Waste management is now a global concern due to its high environmental impact on climate change. Because of generating huge amount of waste through our daily activities, managing waste in an efficient way has become more important than ever. Alternative Waste Technology (AWT), a new category of waste treatment technology has been developed for energy recovery in recent years to address this issue. AWT describes a technology that redirects waste away from landfill, recovers more useable resources from the waste flow and reduces the impact on the surroundings. Australia is one of the largest producers of waste per-capita. A number of AWTs are using in Australia to produce energy from waste. Presently, it is vital to identify an appropriate AWT to establish a sustainable waste management system in Australia. Identification of an appropriate AWT through Multi-criteria analysis (MCA) of four AWTs by using five key decision making criteria is presented and discussed in this paper.

An Artificial Emotion Model For Visualizing Emotion of Characters

It is hard to express emotion through only speech when we watch a character in a movie or a play because we cannot estimate the size, kind, and quantity of emotion. So this paper proposes an artificial emotion model for visualizing current emotion with color and location in emotion model. The artificial emotion model is designed considering causality of generated emotion, difference of personality, difference of continual emotional stimulus, and co-relation of various emotions. This paper supposed the Emotion Field for visualizing current emotion with location, and current emotion is expressed by location and color in the Emotion Field. For visualizing changes within current emotion, the artificial emotion model is adjusted to characters in Hamlet.

A Comparative Study of Various Tone Mapping Methods

In the recent years, high dynamic range imaging has gain popularity with the advancement in digital photography. In this contribution we present a subjective evaluation of various tone production and tone mapping techniques by a number of participants. Firstly, standard HDR images were used and the participants were asked to rate them based on a given rating scheme. After that, the participant was asked to rate HDR image generated using linear and nonlinear combination approach of multiple exposure images. The experimental results showed that linearly generated HDR images have better visualization than the nonlinear combined ones. In addition, Reinhard et al. and the exponential tone mapping operators have shown better results compared to logarithmic and the Garrett et al. tone mapping operators.

A Comparative Study of SVM Classifiers and Artificial Neural Networks Application for Rolling Element Bearing Fault Diagnosis using Wavelet Transform Preprocessing

Effectiveness of Artificial Neural Networks (ANN) and Support Vector Machines (SVM) classifiers for fault diagnosis of rolling element bearings are presented in this paper. The characteristic features of vibration signals of rotating driveline that was run in its normal condition and with faults introduced were used as input to ANN and SVM classifiers. Simple statistical features such as standard deviation, skewness, kurtosis etc. of the time-domain vibration signal segments along with peaks of the signal and peak of power spectral density (PSD) are used as features to input the ANN and SVM classifier. The effect of preprocessing of the vibration signal by Discreet Wavelet Transform (DWT) prior to feature extraction is also studied. It is shown from the experimental results that the performance of SVM classifier in identification of bearing condition is better then ANN and pre-processing of vibration signal by DWT enhances the effectiveness of both ANN and SVM classifier

In Cognitive Radio the Analysis of Bit-Error- Rate (BER) by using PSO Algorithm

The electromagnetic spectrum is a natural resource and hence well-organized usage of the limited natural resources is the necessities for better communication. The present static frequency allocation schemes cannot accommodate demands of the rapidly increasing number of higher data rate services. Therefore, dynamic usage of the spectrum must be distinguished from the static usage to increase the availability of frequency spectrum. Cognitive radio is not a single piece of apparatus but it is a technology that can incorporate components spread across a network. It offers great promise for improving system efficiency, spectrum utilization, more effective applications, reduction in interference and reduced complexity of usage for users. Cognitive radio is aware of its environmental, internal state, and location, and autonomously adjusts its operations to achieve designed objectives. It first senses its spectral environment over a wide frequency band, and then adapts the parameters to maximize spectrum efficiency with high performance. This paper only focuses on the analysis of Bit-Error-Rate in cognitive radio by using Particle Swarm Optimization Algorithm. It is theoretically as well as practically analyzed and interpreted in the sense of advantages and drawbacks and how BER affects the efficiency and performance of the communication system.

The Path to Wellbeing: The Role of Work-Family Conflict, Family-Work Conflict and Psychological Strain

Although considerable amount of research has attested to the link between work-to-family conflict (WFC) and family-to-work conflict (FWC) and psychological strain and wellbeing, there is a paucity of research investigating the phenomenon in the context of social workers. Moreover, very little is known about the impact of WFC and FWC in developing countries. The present study investigated the mediating effect of psychological strain on the relationship between WFC and FWC with wellbeing of social workers in India. Our findings show that WFC and FWC are influential antecedents of wellbeing; their influence is both direct on psychological strain, and indirect on wellbeing transmitted through psychological strain. Implications of the findings are discussed.

Building Trust of Mobile Users and their Adoption of M-Commerce

One challenging direction of mobile commerce (mcommerce) that is getting a great deal of attention globally is mobile financing. The smart-phone and PDA users all around the world are facing difficulties to become accustomed and trust in m-commerce. The main rationale can be the slow variation and lack of trust in mobile payment systems. Mobile payment systems that are in use need to be more effective and efficient. This paper proposes: the interface design is not the only factor affecting the m-commerce adoption and lack of trust; in fact it is the combined effect of interface usability and trustworthy mobile payment systems, because it-s the money that the user has to spend at the end of the day, which the user requires to get transferred securely. The purpose of this research is to identify the problems regarding the trust and adaption of m-commerce applications by mobile users and to provide the best possible solution with respect to human computer interaction (HCI) principles.

Coherence Analysis for Epilepsy Patients: An MEG Study

It is crucial to quantitatively evaluate the treatment of epilepsy patients. This study was undertaken to test the hypothesis that compared to the healthy control subjects, the epilepsy patients have abnormal resting-state connectivity. In this study, we used the imaginary part of coherency to measure the resting-state connectivity. The analysis results shown that compared to the healthy control subjects, epilepsy patients tend to have abnormal rhythm brain connectivity over their epileptic focus.

Effect of Exchange Interaction J on Magnetic Moment of MnO

This calculation focus on the effect of exchange interaction J and Coulomb interaction U on spin magnetic moments (ms) of MnO by using the local spin density approximation plus the Coulomb interaction (LSDA+U) method within full potential linear muffin-tin orbital (FP-LMTO). Our calculated results indicated that the spin magnetic moments correlated to J and U. The relevant results exhibited the increasing spin magnetic moments with increasing exchange interaction and Coulomb interaction. Furthermore, equations of spin magnetic moment, which h good correspondence to the experimental data 4.58μB, are defined ms = 0.11J +4.52μB and ms = 0.03U+4.52μB. So, the relation of J and U parameter is obtained, it is obviously, J = -0.249U+1.346 eV.

The Possibility to Resolve the Security Problems through the LTE in Vehicular Ad-hoc Networks

Vehicular Ad-Hoc Networks (VANET) can provide communications between vehicles or infrastructures. It provides the convenience of driving and the secure driving to reduce accidents. In VANET, the security is more important because it is closely related to accidents. Additionally, VANET raises a privacy issue because it can track the location of vehicles and users- identity when a security mechanism is provided. In this paper, we analyze the problem of an existing solution for security requirements required in VANET, and resolve the problem of the existing method when a key management mechanism is provided for the security operation in VANET. Therefore, we show suitability of the Long Term Evolution (LTE) in VANET for the solution of this problem.

Well-Being in Adolescence: Fitting Measurement Model

Well-being has been given special emphasis in quality of life. It involves living a meaningful, life satisfaction, stability and happiness in life. Well-being also concerns the satisfaction of physical, psychological, social needs and demands of an individual. The purpose of this study was to validate three-factor measurement model of well-being using structural equation modeling (SEM). The conceptions of well-being measured such dimensions as physical, psychological and social well-being. This study was done based on a total sample of 650 adolescents from east-coast of peninsular Malaysia. The Well-Being Scales which was adapted from [1] was used in this study. The items were hypothesized a priori to have nonzero loadings on all dimensions in the model. The findings of the SEM demonstrated that it is a good fitting model which the proposed model fits the driving theory; (x2df = 1.268; GFI = .994; CFI = .998; TLI= .996; p = .255; RMSEA = .021). Composite reliability (CR) was .93 and average variance extracted (AVE) was 58%. The model in this study fits with the sample of data and well-being is important to bring sustainable development to the mainstream.

Distributed 2-Vertex Connectivity Test of Graphs Using Local Knowledge

The vertex connectivity of a graph is the smallest number of vertices whose deletion separates the graph or makes it trivial. This work is devoted to the problem of vertex connectivity test of graphs in a distributed environment based on a general and a constructive approach. The contribution of this paper is threefold. First, using a preconstructed spanning tree of the considered graph, we present a protocol to test whether a given graph is 2-connected using only local knowledge. Second, we present an encoding of this protocol using graph relabeling systems. The last contribution is the implementation of this protocol in the message passing model. For a given graph G, where M is the number of its edges, N the number of its nodes and Δ is its degree, our algorithms need the following requirements: The first one uses O(Δ×N2) steps and O(Δ×logΔ) bits per node. The second one uses O(Δ×N2) messages, O(N2) time and O(Δ × logΔ) bits per node. Furthermore, the studied network is semi-anonymous: Only the root of the pre-constructed spanning tree needs to be identified.