<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#">
<channel rdf:about="https://reunir.unir.net/handle/123456789/10933">
<title>vol. 3, nº 7, june 2016</title>
<link>https://reunir.unir.net/handle/123456789/10933</link>
<description/>
<items>
<rdf:Seq>
<rdf:li rdf:resource="https://reunir.unir.net/handle/123456789/11447"/>
<rdf:li rdf:resource="https://reunir.unir.net/handle/123456789/11236"/>
<rdf:li rdf:resource="https://reunir.unir.net/handle/123456789/11235"/>
<rdf:li rdf:resource="https://reunir.unir.net/handle/123456789/11234"/>
<rdf:li rdf:resource="https://reunir.unir.net/handle/123456789/11233"/>
<rdf:li rdf:resource="https://reunir.unir.net/handle/123456789/11232"/>
<rdf:li rdf:resource="https://reunir.unir.net/handle/123456789/11231"/>
<rdf:li rdf:resource="https://reunir.unir.net/handle/123456789/11229"/>
<rdf:li rdf:resource="https://reunir.unir.net/handle/123456789/11228"/>
<rdf:li rdf:resource="https://reunir.unir.net/handle/123456789/11227"/>
<rdf:li rdf:resource="https://reunir.unir.net/handle/123456789/11225"/>
<rdf:li rdf:resource="https://reunir.unir.net/handle/123456789/11222"/>
<rdf:li rdf:resource="https://reunir.unir.net/handle/123456789/11221"/>
<rdf:li rdf:resource="https://reunir.unir.net/handle/123456789/11220"/>
<rdf:li rdf:resource="https://reunir.unir.net/handle/123456789/11219"/>
</rdf:Seq>
</items>
<dc:date>2025-10-19T19:45:31Z</dc:date>
</channel>
<item rdf:about="https://reunir.unir.net/handle/123456789/11447">
<title>IJIMAI Editor's Note - Vol. 3 Issue 7</title>
<link>https://reunir.unir.net/handle/123456789/11447</link>
<description>IJIMAI Editor's Note - Vol. 3 Issue 7
Sanjuán Martínez, Óscar
The research works presented in this issue are based on various topics of interest, among which are included: SVM and ANN Based Classification, Security in Android, Semantic Data, Planning and Software Agents, Mission Planning, Clustering in Text Mining, Mobile Networks, Weather Radars, Human Activity Recognition, LIF Neurons and DDF, Theft Prevention, Constraint Programming, Measuring Meditations Effects, Neural Networks and Deep Learning.
Submitted by Susana Figueroa Navarro (susana.figueroa.n@unir.net) on 2021-06-03T12:25:15Z
No. of bitstreams: 0; Made available in DSpace on 2021-06-03T12:25:15Z (GMT). No. of bitstreams: 0
</description>
</item>
<item rdf:about="https://reunir.unir.net/handle/123456789/11236">
<title>Improved Shape Parameter Estimation in K Clutter with Neural Networks and Deep Learning</title>
<link>https://reunir.unir.net/handle/123456789/11236</link>
<description>Improved Shape Parameter Estimation in K Clutter with Neural Networks and Deep Learning
Machado Fernández, José Raúl; Bacallao Vidal, Jesús de la Concepción
The discrimination of the clutter interfering signal is&#13;
a current problem in modern radars’ design, especially in coastal&#13;
or offshore environments where the histogram of the background&#13;
signal often displays heavy tails. The statistical characterization&#13;
of this signal is very important for the cancellation of sea clutter,&#13;
whose behavior obeys a K distribution according to the commonly&#13;
accepted criterion. By using neural networks, the authors&#13;
propose a new method for estimating the K shape parameter,&#13;
demonstrating its superiority over the classic alternative based on&#13;
the Method of Moments. Whereas both solutions have a similar&#13;
performance when the entire range of possible values of the shape&#13;
parameter is evaluated, the neuronal alternative achieves a much&#13;
more accurate estimation for the lower Fig.s of the parameter. This&#13;
is exactly the desired behavior because the best estimate occurs&#13;
for the most aggressive states of sea clutter. The final design,&#13;
reached by processing three different sets of computer generated&#13;
K samples, used a total of nine neural networks whose contribution&#13;
is synthesized in the final estimate, thus the solution can be&#13;
interpreted as a deep learning approximation. The results are to&#13;
be applied in the improvement of radar detectors, particularly for&#13;
maintaining the operational false alarm probability close to the&#13;
one conceived in the design.
Submitted by Ana María Ampudia Alonso (ana.ampudia@unir.net) on 2021-04-21T14:41:13Z&#13;
No. of bitstreams: 1&#13;
ijimai20163_7_14_pdf_14393.pdf: 7630656 bytes, checksum: 884a2afc180871cd0d8014c23667008e (MD5); Made available in DSpace on 2021-04-21T14:41:13Z (GMT). No. of bitstreams: 1&#13;
ijimai20163_7_14_pdf_14393.pdf: 7630656 bytes, checksum: 884a2afc180871cd0d8014c23667008e (MD5)
</description>
</item>
<item rdf:about="https://reunir.unir.net/handle/123456789/11235">
<title>Chinese-chi and Kundalini yoga Meditations Effects on the Autonomic Nervous System: Comparative Study</title>
<link>https://reunir.unir.net/handle/123456789/11235</link>
<description>Chinese-chi and Kundalini yoga Meditations Effects on the Autonomic Nervous System: Comparative Study
Dey, Anilesh; Bhattacharya, D. K.; Tibarewala, D.N.; Dey, Nilanjan; Ashour, Amira S.; Le, Dac-Nhuong; Gospodinova, Evgeniya; Gospodinov, Mitko
Cardiac disease is one of the major causes for death&#13;
all over the world. Heart rate variability (HRV) is a significant&#13;
parameter that used in assessing Autonomous Nervous System&#13;
(ANS) activity. Generally, the 2D Poincare′ plot and 3D Poincaré&#13;
plot of the HRV signals reflect the effect of different external stimuli&#13;
on the ANS. Meditation is one of such external stimulus, which&#13;
has different techniques with different types of effects on the ANS.&#13;
Chinese Chi-meditation and Kundalini yoga are two different&#13;
effective meditation techniques. The current work is interested with&#13;
the analysis of the HRV signals under the effect of these two based on&#13;
meditation techniques. The 2D and 3D Poincare′ plots are generally&#13;
plotted by fitting respectively an ellipse/ellipsoid to the dense region&#13;
of the constructed Poincare′ plot of HRV signals. However, the&#13;
2D and 3D Poincaré plots sometimes fail to describe the proper&#13;
behaviour of the system. Thus in this study, a three-dimensional&#13;
frequency-delay plot is proposed to properly distinguish these two&#13;
famous meditation techniques by analyzing their effects on ANS.&#13;
This proposed 3D frequency-delay plot is applied on HRV signals&#13;
of eight persons practicing same Chi-meditation and four other&#13;
persons practising same Kundalini yoga. To substantiate the result&#13;
for larger sample of data, statistical Student t-test is applied, which&#13;
shows a satisfactory result in this context. The experimental results&#13;
established that the Chi-meditation has large impact on the HRV&#13;
compared to the Kundalini yoga.
Submitted by Ana María Ampudia Alonso (ana.ampudia@unir.net) on 2021-04-21T14:36:50Z&#13;
No. of bitstreams: 1&#13;
ijimai20163_7_13_pdf_34001.pdf: 512858 bytes, checksum: 21e0b3b1b8cf23d3f522581ff37366a4 (MD5); Made available in DSpace on 2021-04-21T14:36:50Z (GMT). No. of bitstreams: 1&#13;
ijimai20163_7_13_pdf_34001.pdf: 512858 bytes, checksum: 21e0b3b1b8cf23d3f522581ff37366a4 (MD5)
</description>
</item>
<item rdf:about="https://reunir.unir.net/handle/123456789/11234">
<title>An Extensive Evaluation of Portfolio Approaches for Constraint Satisfaction Problems</title>
<link>https://reunir.unir.net/handle/123456789/11234</link>
<description>An Extensive Evaluation of Portfolio Approaches for Constraint Satisfaction Problems
Amadini, Roberto; Gabbrielli, Maurizio; Mauro, Jacopo
In the context of Constraint Programming, a portfolio&#13;
approach exploits the complementary strengths of a portfolio of&#13;
different constraint solvers. The goal is to predict and run the best&#13;
solver(s) of the portfolio for solving a new, unseen problem. In&#13;
this work we reproduce, simulate, and evaluate the performance&#13;
of different portfolio approaches on extensive benchmarks of&#13;
Constraint Satisfaction Problems. Empirical results clearly show&#13;
the benefits of portfolio solvers in terms of both solved instances&#13;
and solving time.
Submitted by Ana María Ampudia Alonso (ana.ampudia@unir.net) on 2021-04-21T14:27:00Z&#13;
No. of bitstreams: 1&#13;
ijimai20163_7_12_pdf_13932.pdf: 959307 bytes, checksum: ecf386323b85b967802feb9f5e188d0b (MD5); Made available in DSpace on 2021-04-21T14:27:00Z (GMT). No. of bitstreams: 1&#13;
ijimai20163_7_12_pdf_13932.pdf: 959307 bytes, checksum: ecf386323b85b967802feb9f5e188d0b (MD5)
</description>
</item>
<item rdf:about="https://reunir.unir.net/handle/123456789/11233">
<title>A Real Time Approach to Theft Prevention in the field of Transportation System</title>
<link>https://reunir.unir.net/handle/123456789/11233</link>
<description>A Real Time Approach to Theft Prevention in the field of Transportation System
Mehta, Vartika; Punetha, Deepak; Bijalwan, Vishwanath
This paper report discusses a theft prevention system,&#13;
which can prevent the theft and also can be track the object. This&#13;
system is capable to tracking the vehicle as well as theft prevention.&#13;
An R.F. module is use to exchange the information regarding&#13;
vehicle and owner of the vehicle with police control room or SOS&#13;
services. The vehicle can be track with the help of R.F. receiver.&#13;
A DTMF based fuel lock has been attached in this system. A cell&#13;
phone with SIM card has been attached with DTMF IC. The fuel&#13;
flow in the vehicle can be controlled by give a call to this cell phone.&#13;
This system has been controlled by a microcontroller which can&#13;
make the system cost effective, low power consumption, effective&#13;
and reliable.
Submitted by Ana María Ampudia Alonso (ana.ampudia@unir.net) on 2021-04-21T14:22:39Z&#13;
No. of bitstreams: 1&#13;
ijimai20163_7_11_pdf_18075.pdf: 802544 bytes, checksum: 8b627fa29f0458fd51cf708e90650d7a (MD5); Made available in DSpace on 2021-04-21T14:22:39Z (GMT). No. of bitstreams: 1&#13;
ijimai20163_7_11_pdf_18075.pdf: 802544 bytes, checksum: 8b627fa29f0458fd51cf708e90650d7a (MD5)
</description>
</item>
<item rdf:about="https://reunir.unir.net/handle/123456789/11232">
<title>Spiking Activity of a LIF Neuron in Distributed Delay Framework</title>
<link>https://reunir.unir.net/handle/123456789/11232</link>
<description>Spiking Activity of a LIF Neuron in Distributed Delay Framework
Kumar Choudhary, Saket; Singh, Karan; Kumar Solanki, Vijender
Evolution of membrane potential and spiking&#13;
activity for a single leaky integrate-and-fire (LIF) neuron in&#13;
distributed delay framework (DDF) is investigated. DDF provides&#13;
a mechanism to incorporate memory element in terms of delay&#13;
(kernel) function into a single neuron models. This investigation&#13;
includes LIF neuron model with two different kinds of delay kernel&#13;
functions, namely, gamma distributed delay kernel function and&#13;
hypo-exponential distributed delay kernel function. Evolution&#13;
of membrane potential for considered models is studied in terms&#13;
of stationary state probability distribution (SPD). Stationary&#13;
state probability distribution of membrane potential (SPDV)&#13;
for considered neuron models are found asymptotically similar&#13;
which is Gaussian distributed. In order to investigate the effect&#13;
of membrane potential delay, rate code scheme for neuronal&#13;
information processing is applied. Firing rate and Fano-factor&#13;
for considered neuron models are calculated and standard LIF&#13;
model is used for comparative study. It is noticed that distributed&#13;
delay increases the spiking activity of a neuron. Increase in&#13;
spiking activity of neuron in DDF is larger for hypo-exponential&#13;
distributed delay function than gamma distributed delay function.&#13;
Moreover, in case of hypo-exponential delay function, a LIF neuron&#13;
generates spikes with Fano-factor less than 1.
Submitted by Ana María Ampudia Alonso (ana.ampudia@unir.net) on 2021-04-21T14:16:57Z&#13;
No. of bitstreams: 1&#13;
ijimai20163_7_10_pdf_21051.pdf: 1315867 bytes, checksum: fb6aaf06642d190b25dfd2c65ed94ea3 (MD5); Made available in DSpace on 2021-04-21T14:16:57Z (GMT). No. of bitstreams: 1&#13;
ijimai20163_7_10_pdf_21051.pdf: 1315867 bytes, checksum: fb6aaf06642d190b25dfd2c65ed94ea3 (MD5)
</description>
</item>
<item rdf:about="https://reunir.unir.net/handle/123456789/11231">
<title>Human Activity Recognition in Real-Times Environments using Skeleton Joints</title>
<link>https://reunir.unir.net/handle/123456789/11231</link>
<description>Human Activity Recognition in Real-Times Environments using Skeleton Joints
Kumar, Ajay; Kumar, Anil; Kumar Singh, Satish; Kala, Rahul
In this research work, we proposed a most effective&#13;
noble approach for Human activity recognition in real-time&#13;
environments. We recognize several distinct dynamic human&#13;
activity actions using kinect. A 3D skeleton data is processed&#13;
from real-time video gesture to sequence of frames and getter&#13;
skeleton joints (Energy Joints, orientation, rotations of joint&#13;
angles) from selected setof frames. We are using joint angle&#13;
and orientations, rotations information from Kinect therefore&#13;
less computation required. However, after extracting the set of&#13;
frames we implemented several classification techniques Principal&#13;
Component Analysis (PCA) with several distance based classifiers&#13;
and Artificial Neural Network (ANN) respectively with some&#13;
variants for classify our all different gesture models. However,&#13;
we conclude that use very less number of frame (10-15%) for&#13;
train our system efficiently from the entire set of gesture frames.&#13;
Moreover, after successfully completion of our classification&#13;
methods we clinch an excellent overall accuracy 94%, 96% and&#13;
98% respectively. We finally observe that our proposed system is&#13;
more useful than comparing to other existing system, therefore our&#13;
model is best suitable for real-time application such as in video&#13;
games for player action/gesture recognition.
Submitted by Ana María Ampudia Alonso (ana.ampudia@unir.net) on 2021-04-21T14:09:54Z&#13;
No. of bitstreams: 1&#13;
ijimai20163_7_9_pdf_20470.pdf: 1379754 bytes, checksum: ab6eac94c29a79337157250a26aaac90 (MD5); Made available in DSpace on 2021-04-21T14:09:54Z (GMT). No. of bitstreams: 1&#13;
ijimai20163_7_9_pdf_20470.pdf: 1379754 bytes, checksum: ab6eac94c29a79337157250a26aaac90 (MD5)
</description>
</item>
<item rdf:about="https://reunir.unir.net/handle/123456789/11229">
<title>Uncertainty Model For Quantitative Precipitation Estimation Using Weather Radars</title>
<link>https://reunir.unir.net/handle/123456789/11229</link>
<description>Uncertainty Model For Quantitative Precipitation Estimation Using Weather Radars
Gómez Vargas, A. Ernesto; Obregón N., Nelson; Álvarez Pomar, C. Lindsay
This paper introduces an uncertainty model for&#13;
the quantitatively estimate precipitation using weather radars.&#13;
The model considers various key aspects associated to radar&#13;
calibration, attenuation, and the tradeoff between accuracy&#13;
and radar coverage. An S-band-radar case study is presented to&#13;
illustrate particular fractional-uncertainty calculations obtained&#13;
to adjust various typical radar-calibration elements such as&#13;
antenna, transmitter, receiver, and some other general elements&#13;
included in the radar equation. This paper is based in “Guide to&#13;
the expression of Uncertainty in measurement” [1] and the results&#13;
show that the fractional uncertainty calculated by the model was&#13;
40 % for the reflectivity and 30% for the precipitation using the&#13;
Marshall Palmer Z-R relationship.
Submitted by Ana María Ampudia Alonso (ana.ampudia@unir.net) on 2021-04-21T14:03:15Z&#13;
No. of bitstreams: 1&#13;
ijimai20163_7_8_pdf_38293.pdf: 9330025 bytes, checksum: a37e62275a5154b9111a93edf0936a4f (MD5); Made available in DSpace on 2021-04-21T14:03:15Z (GMT). No. of bitstreams: 1&#13;
ijimai20163_7_8_pdf_38293.pdf: 9330025 bytes, checksum: a37e62275a5154b9111a93edf0936a4f (MD5)
</description>
</item>
<item rdf:about="https://reunir.unir.net/handle/123456789/11228">
<title>Design Methodology for Self-organized Mobile Networks Based</title>
<link>https://reunir.unir.net/handle/123456789/11228</link>
<description>Design Methodology for Self-organized Mobile Networks Based
Anzola, John; Bolaños Castro, Sandro Javier; Tarazona Bermúdez, Giovanny Mauricio
The methodology proposed in this article enables&#13;
a systematic design of routing algorithms based on schemes of&#13;
biclustering, which allows you to respond with timely techniques,&#13;
clustering heuristics proposed by a researcher, and a focused&#13;
approach to routing in the choice of clusterhead nodes. This&#13;
process uses heuristics aimed at improving the different costs in&#13;
communication surface groups called biclusters. This methodology&#13;
globally enables a variety of techniques and heuristics of clustering&#13;
that have been addressed in routing algorithms, but we have not&#13;
explored all possible alternatives and their different assessments.&#13;
Therefore, the methodology oriented design research of routing&#13;
algorithms based on biclustering schemes will allow new concepts&#13;
of evolutionary routing along with the ability to adapt the&#13;
topological changes that occur in self-organized data networks.
Submitted by Ana María Ampudia Alonso (ana.ampudia@unir.net) on 2021-04-21T13:55:35Z&#13;
No. of bitstreams: 1&#13;
ijimai20163_7_7_pdf_10406.pdf: 1445296 bytes, checksum: d04da4743687f67d9c83712bd03bcf69 (MD5); Made available in DSpace on 2021-04-21T13:55:35Z (GMT). No. of bitstreams: 1&#13;
ijimai20163_7_7_pdf_10406.pdf: 1445296 bytes, checksum: d04da4743687f67d9c83712bd03bcf69 (MD5)
</description>
</item>
<item rdf:about="https://reunir.unir.net/handle/123456789/11227">
<title>Comparative Study of Clustering Algorithms in Text Mining Context</title>
<link>https://reunir.unir.net/handle/123456789/11227</link>
<description>Comparative Study of Clustering Algorithms in Text Mining Context
JALIL, Abdennour Mohamed; HAFIDI, Imad; ALAMI, Lamiae; ENSA, Khouribga
The spectacular increasing of Data is due to&#13;
the appearance of networks and smartphones. Amount 42% of&#13;
world population using internet [1]; have created a problem&#13;
related of the processing of the data exchanged, which is rising&#13;
exponentially and that should be automatically treated. This&#13;
paper presents a classical process of knowledge discovery&#13;
databases, in order to treat textual data. This process is&#13;
divided into three parts: preprocessing, processing and postprocessing. In the processing step, we present a comparative&#13;
study between several clustering algorithms such as KMeans,&#13;
Global KMeans, Fast Global KMeans, Two Level KMeans and&#13;
FWKmeans. The comparison between these algorithms is made&#13;
on real textual data from the web using RSS feeds. Experimental&#13;
results identified two problems: the first one quality results&#13;
which remain for algorithms, which rapidly converge. The&#13;
second problem is due to the execution time that needs to&#13;
decrease for some algorithms.
Submitted by Ana María Ampudia Alonso (ana.ampudia@unir.net) on 2021-04-21T13:50:44Z&#13;
No. of bitstreams: 1&#13;
ijimai20163_7_6_pdf_27159.pdf: 2390043 bytes, checksum: 8617cf316deab2187e36bf96ca08d1b7 (MD5); Made available in DSpace on 2021-04-21T13:50:44Z (GMT). No. of bitstreams: 1&#13;
ijimai20163_7_6_pdf_27159.pdf: 2390043 bytes, checksum: 8617cf316deab2187e36bf96ca08d1b7 (MD5)
</description>
</item>
<item rdf:about="https://reunir.unir.net/handle/123456789/11225">
<title>Linear Temporal Logic-based Mission Planning</title>
<link>https://reunir.unir.net/handle/123456789/11225</link>
<description>Linear Temporal Logic-based Mission Planning
Kumar, Anil; Kala, Rahul
In this paper, we describe the Linear Temporal&#13;
Logic-based reactive motion planning. We address the problem of&#13;
motion planning for mobile robots, wherein the goal specification&#13;
of planning is given in complex environments. The desired task&#13;
specification may consist of complex behaviors of the robot,&#13;
including specifications for environment constraints, need of task&#13;
optimality, obstacle avoidance, rescue specifications, surveillance&#13;
specifications, safety specifications, etc. We use Linear Temporal&#13;
Logic to give a representation for such complex task specification&#13;
and constraints. The specifications are used by a verification engine&#13;
to judge the feasibility and suitability of plans. The planner gives a&#13;
motion strategy as output. Finally a controller is used to generate&#13;
the desired trajectory to achieve such a goal. The approach is&#13;
tested using simulations on the LTLMoP mission planning tool,&#13;
operating over the Robot Operating System. Simulation results&#13;
generated using high level planners and low level controllers work&#13;
simultaneously for mission planning and controlling the physical&#13;
behavior of the robot.
Submitted by Ana María Ampudia Alonso (ana.ampudia@unir.net) on 2021-04-21T13:42:09Z&#13;
No. of bitstreams: 1&#13;
ijimai20163_7_5_pdf_16569.pdf: 9919883 bytes, checksum: 52531a5b73c0e5d02a08a6101e72c8b5 (MD5); Made available in DSpace on 2021-04-21T13:42:09Z (GMT). No. of bitstreams: 1&#13;
ijimai20163_7_5_pdf_16569.pdf: 9919883 bytes, checksum: 52531a5b73c0e5d02a08a6101e72c8b5 (MD5)
</description>
</item>
<item rdf:about="https://reunir.unir.net/handle/123456789/11222">
<title>The Silver Lining Methodology</title>
<link>https://reunir.unir.net/handle/123456789/11222</link>
<description>The Silver Lining Methodology
Castillo Chamorro, José Miguel
The way in which Strategic planning is designed&#13;
is different depending on the organization. For that reason, no&#13;
standard procedures can be given to develop Strategic planning.&#13;
However, the scenarios analysis method is used in any field or&#13;
organization. We could define a scenario as a set of variables&#13;
or events that describes a future situation. Additionally, the&#13;
continuous irruption of new technologies invites us to carry out a&#13;
revision of the old methodologies and procedures with the intention&#13;
of starting an innovation process to make them more efficient. The&#13;
challenge presented in this article consists of the use of the agents&#13;
technology within a new methodological approach to envision&#13;
future possible scenarios more quickly and more accurately than&#13;
the classical methods we currently use.
Submitted by Ana María Ampudia Alonso (ana.ampudia@unir.net) on 2021-04-21T12:01:47Z&#13;
No. of bitstreams: 1&#13;
ijimai20163_7_4_pdf_36802.pdf: 822662 bytes, checksum: 72681da991ac08f9ec1edeb702004029 (MD5); Made available in DSpace on 2021-04-21T12:01:47Z (GMT). No. of bitstreams: 1&#13;
ijimai20163_7_4_pdf_36802.pdf: 822662 bytes, checksum: 72681da991ac08f9ec1edeb702004029 (MD5)
</description>
</item>
<item rdf:about="https://reunir.unir.net/handle/123456789/11221">
<title>Query Migration from Object Oriented World to Semantic World</title>
<link>https://reunir.unir.net/handle/123456789/11221</link>
<description>Query Migration from Object Oriented World to Semantic World
SOUSSI, Nassima; BAHAJ, Mohamed
— In the last decades, object-oriented approach was&#13;
able to take a large share of databases market aiming to design&#13;
and implement structured and reusable software through the&#13;
composition of independent elements in order to have programs&#13;
with a high performance. On the other hand, the mass of&#13;
information stored in the web is increasing day after day with&#13;
a vertiginous speed, exposing the currently web faced with the&#13;
problem of creating a bridge so as to facilitate access to data&#13;
between different applications and systems as well as to look&#13;
for relevant and exact information wished by users. In addition,&#13;
all existing approach of rewriting object oriented languages to&#13;
SPARQL language rely on models transformation process to&#13;
guarantee this mapping. All the previous raisons has prompted us&#13;
to write this paper in order to bridge an important gap between&#13;
these two heterogeneous worlds (object oriented and semantic web&#13;
world) by proposing the first provably semantics preserving OQLto-SPARQL translation algorithm for each element of OQL Query&#13;
(SELECT clause, FROM clause, FILTER constraint, implicit/&#13;
explicit join and union/intersection SELECT queries).
Submitted by Ana María Ampudia Alonso (ana.ampudia@unir.net) on 2021-04-21T11:55:24Z&#13;
No. of bitstreams: 1&#13;
ijimai20163_7_3_pdf_20232.pdf: 479196 bytes, checksum: 690ea97178136a909e868a0bb9aec212 (MD5); Made available in DSpace on 2021-04-21T11:55:24Z (GMT). No. of bitstreams: 1&#13;
ijimai20163_7_3_pdf_20232.pdf: 479196 bytes, checksum: 690ea97178136a909e868a0bb9aec212 (MD5)
</description>
</item>
<item rdf:about="https://reunir.unir.net/handle/123456789/11220">
<title>A New Protection for Android Applications</title>
<link>https://reunir.unir.net/handle/123456789/11220</link>
<description>A New Protection for Android Applications
ER-RAJY, Latifa; El kiram, My Ahmed
Today, Smartphones are very powerful, and many&#13;
of its applications use wireless multimedia communications.&#13;
Prevention from the external dangers (threats) has become a big&#13;
concern for the experts these days. Android security has become&#13;
a very important issue because of the free application it provides&#13;
and the feature which make it very easy for anyone to develop&#13;
and published it on Play store. Some work has already been done&#13;
on the android security model, including several analyses of the&#13;
model and frameworks aimed at enforcing security standards. In&#13;
this article, we introduce a tool called PermisSecure that is able to&#13;
perform both static and dynamic analysis on Android programs&#13;
to automatically detect suspicious applications that request&#13;
unnecessary or dangerous permissions.
Submitted by Ana María Ampudia Alonso (ana.ampudia@unir.net) on 2021-04-21T11:51:03Z&#13;
No. of bitstreams: 1&#13;
ijimai20163_7_2_pdf_15309.pdf: 484497 bytes, checksum: 885e61b8d1cd487fa3f8e64f937f726b (MD5); Made available in DSpace on 2021-04-21T11:51:03Z (GMT). No. of bitstreams: 1&#13;
ijimai20163_7_2_pdf_15309.pdf: 484497 bytes, checksum: 885e61b8d1cd487fa3f8e64f937f726b (MD5)
</description>
</item>
<item rdf:about="https://reunir.unir.net/handle/123456789/11219">
<title>SVM and ANN Based Classification of Plant Diseases Using Feature Reduction Technique</title>
<link>https://reunir.unir.net/handle/123456789/11219</link>
<description>SVM and ANN Based Classification of Plant Diseases Using Feature Reduction Technique
D. Pujari, Jagadeesh; Yakkundimath, Rajesh; Syedhusain Byadgi, Abdulmunaf
Computers have been used for mechanization and&#13;
automation in different applications of agriculture/horticulture.&#13;
The critical decision on the agricultural yield and plant protection&#13;
is done with the development of expert system (decision support&#13;
system) using computer vision techniques. One of the areas&#13;
considered in the present work is the processing of images of&#13;
plant diseases affecting agriculture/horticulture crops. The first&#13;
symptoms of plant disease have to be correctly detected, identified,&#13;
and quantified in the initial stages. The color and texture features&#13;
have been used in order to work with the sample images of plant&#13;
diseases. Algorithms for extraction of color and texture features&#13;
have been developed, which are in turn used to train support&#13;
vector machine (SVM) and artificial neural network (ANN)&#13;
classifiers. The study has presented a reduced feature set based&#13;
approach for recognition and classification of images of plant&#13;
diseases. The results reveal that SVM classifier is more suitable&#13;
for identification and classification of plant diseases affecting&#13;
agriculture/horticulture crops.
Submitted by Ana María Ampudia Alonso (ana.ampudia@unir.net) on 2021-04-21T11:43:40Z&#13;
No. of bitstreams: 1&#13;
ijimai20163_7_1_pdf_75740.pdf: 1496497 bytes, checksum: ae2e63598f787536f9bb2bdebb0aea7f (MD5); Made available in DSpace on 2021-04-21T11:43:40Z (GMT). No. of bitstreams: 1&#13;
ijimai20163_7_1_pdf_75740.pdf: 1496497 bytes, checksum: ae2e63598f787536f9bb2bdebb0aea7f (MD5)
</description>
</item>
</rdf:RDF>
