"Annals. Computer Science Series" Journal
Romania, 300559 Timişoara, 6 Lascăr Catargiu str.
Phone: 004 0256 220 687 | Fax: 004 0256 220 690
E-mail: conference.fcia [@] tibiscus [.] ro | conference.fcia [@] gmail [.] com



Web design:
Ovidiu Crista
Updating:
Tiberiu Marius Karnyanszky
Editor-in-Chief
Annals. Computer Science Series
Tome 12, Fasc. 1


ISSN: 1583-7165 (printed journal)
ISSN: 2065-7471 (e-journal)
Owner: "Tibiscus" University of Timişoara, România
Editor: Mirton Publishing House of Timişoara, România
Distributor: "Tibiscus" University of Timişoara, România
Appearance: July 2014

» Fusion non lineaire d’espace couleurs a l’authentification de visage a l’aide d’une nouvelle methode MS

» M. Fedias, M. S. Mimoune, M. Boumehraz and D. Saigaa

ABSTRACT:

Cet article s'inscrit dans le contexte de la biométrie dont, l’objectif est l’authentification d’une personne à partir de l’image de son visage. Les systèmes d'authentification de visage utilisent généralement la représentation en niveaux de gris du l'image de visage comme une caractéristique d'entrée de ces systèmes. Mais nous proposons l’utilisation de la représentation en couleurs qui améliore les performances de ces systèmes. Nous avons testé plusieurs espaces de couleur pour la transformation des composantes colorimétriques RGB des images originales. Les résultats obtenus dans les différentes espaces/ou composantes colorimétriques sont combinés par l’utilisation d’une fusion non linéaire pour la classification avec un réseau de neurone simple de type RBF. Nous avons proposé une nouvelle méthode basée sur les statistiques d’ordres un de l’image de visage qu’on l’appelle (MS) l’abréviation en anglais de ‘Mean and Standard déviation’. Les résultats présentés montrent l’intérêt du développement de la nouvelle approche (MS) qui permettent de diminuer le temps de calcule grâce à sa simplicité et la robustesse lorsqu’on travail avec une grande base de données et que l’information couleur augmente la performance de ce système d’authentification de visage. Pour valider ce travail nous avons testé ces approches sur des images frontales de la base de données XM2VTS selon son protocole associé (protocole de Lausanne).

KEYWORDS:

Statistic d’ordre un, Biometrie, Couleur, Face authentication.

9 - 16

imag/pdf.ico.gif PDF

» Estimating Handoff Minimum Latency based on Signal Strength and Hysteresis in Mobile Computing

» Akhigbe–Mudu Thursday Ehis

ABSTRACT:

Handoff is the process of maintaining a user’s active sessions when a mobile terminal changes its connection point to the access network, while Handoff latency refers to the duration between the initiation and completion of the handoff process. Handoff commonly produces packet loss, delay and jilters, thereby significantly degrading the network performance and places additional burdens onto the internet infrastructures. The design of handoff minimum latency for mobile networks based on signal strength and hysteresis margin is considered. To demonstrate the working effectiveness of our scheme, we illustrated by way of a real world scenario where a coverage service of 3G network is available and a Java Modeling Tools for performance evaluation. It is clear that the time of handoff is critical in mobile networks and we would not tolerate the delay that comes with the hysteresis windows. The performance analysis on windows environment showed an improvement in minimizing the latency times.

KEYWORDS:

Latency, signal, strength, hysteresis, mobile Networks.

17 - 23

imag/pdf.ico.gif PDF

» High Throughput and High Speed Blowfish Algorithm for Secure Integrated Circuits

» Kumara Swamy Varkuti and Dr. Prabhu Benakop

ABSTRACT:

Information Security is prime focus for current computer data communications. Insecurity in data transmission has increased cybercrimes through hacking. This paper presents four different implementations of Blowfish algorithm and analyzed the performance of it with and without Wave Dynamic Differential Logic (WDDL) style to provide security against Differential Power Analysis (DPA) attack. It compares propagation delay (Tt) and frequency (F) of Blowfish, Modified Blowfish with and without WDDL logic [7, 8]. Throughput [3, 6] of Blowfish (BF) with modified modulo adder and WDDL Logic implementation has 840 Mbps compared to 570 Mbps of that of BF with modulo adder [4, 9] and WDDL logic implementation. This paper is implemented using ModelSim6.1d, Leonardo Spectrum8.1 and Xilinx webpack9.2i with Verilog Hardware Description language.

KEYWORDS:

WDDL, SIC, BF and DPA.

24 - 29

imag/pdf.ico.gif PDF

» A Note on Polynomial type Minimal Surfaces

» Chirag Deepak Agrawal and Prasanna Kumar

ABSTRACT:

In this paper, we develop two new minimal surfaces of degree six in parametric polynomial form with isothermal parameter. Graphical representations in different angles have been presented. All computations are done using Mathematica 9.0.

KEYWORDS:

Minimal Surface, Polynomials, Euclidean Space.

30 - 35

imag/pdf.ico.gif PDF

» A Average and Long Term Survival in Primitive Carcinoma of the Parotid Gland

» Octavian Chiş, Silviu Albu, Amalia Andreea Chiş, Marilena Cheptea and Corina Vernic

ABSTRACT:

The long term analysis of the general survival rate and of the disease-free interval on 54 patients with primary parotid carcinoma and the description of the involved prognosis factors.
Material and Methods. The paper analyses data recorded for 54 patients with primary parotid carcinoma, selected according to the criteria of admission into the study. The applied treatment was surgery or surgery with post surgical radiotherapy between 1995 and 2008 at the “Prof. Dr. I. Chiricuţă” Institute of Oncology in Cluj-Napoca. Univariate and multivariate methods of statistical analysis have been employed.
Results. We reached a 27.8% disease-free interval at 10 years, with a general survival rate of 48.8%.
Conclusion. The results indicate that post-therapeutic interval at 10 years in the disease-free survival was significantly influenced by the patients’ age (p=0.037) and in general survival by patients’ age (p=0.015), pT (p=0.026), perineural invasion (p=0.043) and the histopathologic subtype (p=0.024).

KEYWORDS:

Primary parotid cancer, post-therapy survival, significance factors.

36 - 41

imag/pdf.ico.gif PDF

» Unhealthy Food Behavior in Children as a Potential Risk Factor for Iron Deficiency Anemia

» Ionela Nicoleta Simion, Constantin Ilie, Sorin Ursoniu and Corina Vernic

ABSTRACT:

The aim of this study is to evaluate risk factors of nutritional anemia in children aged 9 to 18 years. This research was performed in 918 children (mean age 15.03±2.48 years) living in the city of Timişoara and in surrounding areas. We observed that red meat is consumed more frequently by a higher percentage of boys compared to girls (17.0% versus 9.4%; χ²=1.54, p=0.21). We noticed that boys drink more milk than girls: 18.2% consume more than 2 drinks per day, compared to 8.2% (χ²=55.15, p<0.001). We found a statistically significant difference between boys and girls regarding fruits consumption (28.53% versus 43.01%; χ²=9.58, p=0.048) and juice drinking (34.15% versus 25.9%; χ²=12.77, p=0.012). Finally, we observed that there is no statistically significant difference between boys and girls regarding fast-food consumption (28.8% versus 19%; χ²=5.18, p=0.26).

KEYWORDS:

Children; Risk factors; Iron deficiency anemia.

42 - 44

imag/pdf.ico.gif PDF

» Power Aware Routing for Mobile Ad-hoc Network

» Humayun Bakht

ABSTRACT:

In this paper we present a detail account of Mobile Ad-hoc On-Demand Data Delivery Protocol (MAODDP) power efficiency mechanism. MAODDP belongs to on-demand data delivery routing protocol family of Mobile ad-hoc network. It establishes route and deliver data simultaneously one after the other. The key feature of MAODDP is the integrated approach that enables the protocol to address various issues besides routing.
Power conservation in mobile ad-hoc network is an important aspect to be considered. Unlike some of the traditional routing protocol MAODDP has its own power saving mechanism. MAODDP was implemented in Java and evaluated under Scalable Wireless Network Simulator (SWANS). A series of tests were run to monitor the efficiency of power aware operation of MAODDP.
Evaluation results indicate that MAODDP is applicable in all types of simulation environments. Statistics showed that MAODDP saved 22 % more memory with an increased data delivery of 5 % under power saving mode.

KEYWORDS:

.

45 - 48

imag/pdf.ico.gif PDF

» MSG Package: A Novel Statistical Software for Generating Random Samples of Different Forms

» Waheed Babatunde Yahya and Mahmud Muhammed

ABSTRACT:

In this paper, we present a novel statistical software-Multipurpose Sample Generator (MSG 1.0.0) for generating random samples of different forms for statistical research and other related purposes. The new MSG 1.0.0 software easily generates numeric and alpha-numeric random numbers of different forms as may be required by the users. Also, random samples of different forms from the sampling schemes of the simple and stratified random sampling are easily generated by the MSG package. The MSG 1.0.0 is currently packed as a single setup which can be installed directly into any windows operating system. It was developed using the Visual Studio 2010 .NET framework. The MSG is computationally efficient and does not assume basic knowledge of statistics and statistical computing by its users. To be more user friendly, the graphic users’ interface (GUI) was employed in its development. The MSG software is freely available and can be downloaded and installed without restrictions at http://unilorin.edu.ng/msg/yahya_muhammed/msgpage.php.

KEYWORDS:

Random numbers, Simple Random Sample, Stratified Random Sample, Random Sample Generator, MSG software.

49 - 57

imag/pdf.ico.gif PDF

» Scheduling of Workflow Applications based on Width of the Graph in Grids (SWAWGG)

» Srikala Keshetti and Ramachandram Sirandas

ABSTRACT:

Grid applications require allocation of distributed resources to a number of heterogeneous tasks. Effective Scheduling is a major concern of performance driven grid applications. A good allocation technique is nothing but efficient execution. Basically there are two different types of resource allocation algorithms.
1) Task based algorithms allocate resources to tasks using a Greedy approach.
2) Workflow based algorithms search for an efficient allocation for the entire workflow.
The workflow based approaches are better for data – intensive applications. In this paper, we are going to present a workflow - based technique that determines efficient mapping of tasks by calculating the task to be scheduled on to the available list of resources using the workflow task graph. Using simulation, we have implemented a workflow – based approach that uses a directed acyclic graph of workflow – based tasks. This Algorithm uses Breadth first traversal of the graph to schedule the tasks. Our results demonstrate that the width based scheduling of workflows can generate better allocation in grid where resource availability changes frequently.

KEYWORDS:

Grid workflow, workflow scheduling, inter dependent tasks, Directed acyclic graph, distributed resources, ascending order allocation, descending order allocation , unordered allocation, level of the graph, parent node.

58 - 65

imag/pdf.ico.gif PDF

» cTrust: Complementary Trust based Routing in MultihopWireless Mesh Networks

» Subhash Parimalla and Ramachandram Sirandas

ABSTRACT:

Routing in wireless mesh network has focused on the airtime link metrics to maximize throughput. On the other hand the assumption, “all the nodes are honest and cooperate correctly”, to compute metrics and forward data causes unpredictable disruption of the network if a node gets compromised. A number of protocols have been proposed to address this issue by employing trust and reputation in routing decisions. These protocols either directly employ trust or integrate trust with the existing routing metric in making routing decisions. The former technique clearly does not suit a network whose throughput requirements are high and the latter does not always achieve optimal performance. In this paper, we show that integrating trust with the employed routing metric does not always yield optimal performance. Further, we propose a complementary trust based routing mechanism that complements the existing routing metric instead of integrating trust. The performance of our model is analyzed and compared with the existing models that integrate trust with the underlying routing metric. The results show the improvement in performance by employing our approach and are better than the earlier protocols.

KEYWORDS:

Wireless Mesh Network, Routing Metric,Trust.

66 - 73

imag/pdf.ico.gif PDF

» Constructing Directed Acyclic Graph of Independent Tasks using Deadlines for Scheduling

» Srikala Keshetti and Ramachandram Sirandas

ABSTRACT:

The need for the scheduling algorithms arises from the requirement to perform multitasking, essentially for present computing systems. Scheduling is completely the resource management. Many of the applications executed on grids are interdependent tasks that is workflows where as some applications are independent tasks. In practice different scheduling algorithms are used for allocation of resources to interdependent and independent tasks. If we can create some sort of dependency between independent jobs then we can use the workflow scheduling algorithm for scheduling independent tasks as well.
In this paper, we are going to present an algorithm that creates a DAG for the given set of interdependent tasks based on the resources available and deadlines of the tasks. Workflow based algorithms search for an efficient allocation for the entire workflow, So, If we can use the same workflow scheduling algorithm for independent tasks scheduling will be more effective. This is the main aim of creating DAG for independent tasks.

KEYWORDS:

Grid workflow, workflow scheduling, inter dependent tasks, independent tasks, directed acyclic graph.

74 - 78

imag/pdf.ico.gif PDF

» www.fcia.tibiscus.ro |  » www.ccsitia.tibiscus.ro |  » www.geogebra.tibiscus.ro |  » www.tibiscus.ro |  © 2003-2017, Last update: 18.08.2017 / 12:30