|Commenced in January 1999 || Frequency: Monthly || Edition: International|| Paper Count: 8 |
Mathematical, Computational, Physical, Electrical and Computer Engineering
Non-Polynomial Spline Solution of Fourth-Order Obstacle Boundary-Value Problems
In this paper we use quintic non-polynomial
spline functions to develop numerical methods for approximation
to the solution of a system of fourth-order boundaryvalue
problems associated with obstacle, unilateral and contact
problems. The convergence analysis of the methods has been
discussed and shown that the given approximations are better
than collocation and finite difference methods. Numerical
examples are presented to illustrate the applications of these
methods, and to compare the computed results with other
On the Existence and Global Attractivity of Solutions of a Functional Integral Equation
Using the concept of measure of noncompactness, we present some results concerning the existence, uniform local attractivity and global attractivity of solutions for a functional integral equation. Our results improve and extend some previous known results and based on weaker conditions. Some examples which show that our results are applicable when the previous results are inapplicable are also included.
CAD Based Predictive Models of the Undeformed Chip Geometry in Drilling
Twist drills are geometrical complex tools and thus various researchers have adopted different mathematical and experimental approaches for their simulation. The present paper acknowledges the increasing use of modern CAD systems and using the API (Application Programming Interface) of a CAD system, drilling simulations are carried out. The developed DRILL3D software routine, creates parametrically controlled tool geometries and using different cutting conditions, achieves the generation of solid models for all the relevant data involved (drilling tool, cut workpiece, undeformed chip). The final data derived, consist a platform for further direct simulations regarding the determination of cutting forces, tool wear, drilling optimizations etc.
Connectivity Characteristic of Transcription Factor
Transcription factors are a group of proteins that
helps for interpreting the genetic information in DNA.
Protein-protein interactions play a major role in the execution
of key biological functions of a cell. These interactions are
represented in the form of a graph with nodes and edges.
Studies have showed that some nodes have high degree of
connectivity and such nodes, known as hub nodes, are the
inevitable parts of the network. In the present paper a method
is proposed to identify hub transcription factor proteins using
sequence information. On a complete data set of transcription
factor proteins available from the APID database, the
proposed method showed an accuracy of 77%, sensitivity of
79% and specificity of 76%.
Knowledge Acquisition for the Construction of an Evolving Ontology: Application to Augmented Surgery
This work concerns the evolution and the maintenance
of an ontological resource in relation with the evolution of the corpus
of texts from which it had been built.
The knowledge forming a text corpus, especially in dynamic domains,
is in continuous evolution. When a change in the corpus occurs, the
domain ontology must evolve accordingly. Most methods manage
ontology evolution independently from the corpus from which it is
built; in addition, they treat evolution just as a process of knowledge
addition, not considering other knowledge changes. We propose a
methodology for managing an evolving ontology from a text corpus
that evolves over time, while preserving the consistency and the
persistence of this ontology.
Our methodology is based on the changes made on the corpus to
reflect the evolution of the considered domain - augmented surgery
in our case. In this context, the results of text mining techniques,
as well as the ARCHONTE method slightly modified, are used to
support the evolution process.
Exploring Dimensionality, Systematic Mutations and Number of Contacts in Simple HP ab-initio Protein Folding Using a Blackboard-based Agent Platform
A computational platform is presented in this
contribution. It has been designed as a virtual laboratory to be used
for exploring optimization algorithms in biological problems. This
platform is built on a blackboard-based agent architecture. As a test
case, the version of the platform presented here is devoted to the
study of protein folding, initially with a bead-like description of the
chain and with the widely used model of hydrophobic and polar
residues (HP model). Some details of the platform design are
presented along with its capabilities and also are revised some
explorations of the protein folding problems with different types of
discrete space. It is also shown the capability of the platform to
incorporate specific tools for the structural analysis of the runs in
order to understand and improve the optimization process.
Accordingly, the results obtained demonstrate that the ensemble of
computational tools into a single platform is worthwhile by itself,
since experiments developed on it can be designed to fulfill different
levels of information in a self-consistent fashion. By now, it is being
explored how an experiment design can be useful to create a
computational agent to be included within the platform. These
inclusions of designed agents –or software pieces– are useful for the
better accomplishment of the tasks to be developed by the platform.
Clearly, while the number of agents increases the new version of the
virtual laboratory thus enhances in robustness and functionality.
LMI Approach to Regularization and Stabilization of Linear Singular Systems: The Discrete-time Case
Sufficient linear matrix inequalities (LMI) conditions for regularization of discrete-time singular systems are given. Then a new class of regularizing stabilizing controllers is discussed. The proposed controllers are the sum of predictive and memoryless state feedbacks. The predictive controller aims to regularizing the singular system while the memoryless state feedback is designed to stabilize the resulting regularized system. A systematic procedure is given to calculate the controller gains through linear matrix inequalities.
Gravitational and Centrifugal Forces in the Nut-Kerr-Newman Space-Time
Nayak et al have discussed in detail the inertial forces
such as Gravitational, Coriolis-Lense-Thirring and Centrifugal forces
in the Kerr-Newman Space-time in the Kerr-Newman Space-time.
The main theme of this paper is to study the Gravitational and
Centrifugal forces in the NUT-Kerr-Newman Space-time.