|
Achluophobia, Exposure Therapy with Virtual Reality
|
|
Hassan K. Khalafi
|
|
Volume 3, Issue 2, 2011
pp.
1 - 8
|
|
Received
17 February 2011,
Accepted
13 July 2011
|
|
Abstract.
The fear of the dark is a common fear among children and in adults a varying degree is observed. Fear of the dark is usually not fear of the darkness itself, but fear of possible or imagined dangers concealed by the darkness. Some degree of fear of the dark is natural, especially as a phase of child development. In this research we try to help people who suffering from Achluophobia to overcome their phobia through exposure therapy by measuring vital signs on people who are placed in a relaxed environment and then compare them with vital signs measured under condition of an artificial environment. At the end of this research, we are trying to determine that virtual environment has very beneficial during exposure therapy instance of using traditional way.
|
|
Keywords.
Achluophobia; Virtual realty; Exposure therapy; Measuring vital sign.
|
|
Full Text:
PDF
|
|
|
A Comparison of Syllabifying Algorithms for Turkish
|
|
Rifat Asliyan, Korhan Gunel
|
|
Volume 3, Issue 1, 2011
pp.
58 - 78
|
|
Received
01 April 2011,
Accepted
21 June 2011
|
|
Abstract.
In this study, a deterministic rule-based algorithm, RASAT (Rule-based Automatic Syllabifying Algorithm for Turkish), has been developed for syllabification of Turkish words. The proposed algorithm does not require morphological analysis to detect syllable boundaries. The algorithm has been tested over some Turkish documents. The syllabification algorithms in the scientific literature have been compared according to word error rates (WERs) and the syllable error rates (SERs). The algorithm has been also compared with the other syllabification methods according to time complexity function, $T(n)$. The run-time complexity for the worst-case scenario of the given algorithm is evaluated as $O(n)$.
|
|
Keywords.
Natural language processing; Syllabification algorithm; Time complexity function.
|
|
Full Text:
PDF
|
|
|
An Improved Mid-Point Circle Drawing Algorithm on a Hexagonal Grid
|
|
M. Prabukumar
|
|
Volume 3, Issue 1, 2011
pp.
41 - 57
|
|
Received
18 January 2011,
Accepted
20 April 2011
|
|
Abstract.
IIn this paper, the idea of improved Mid-point circle drawing algorithm on a hexagonal grid is proposed. It makes use of the advantages of hexagonal sampling that scan-convert the pixel on the raster with significantly less scan-conversion error. The performance of the proposed algorithm is compared to that of the conventional circle drawing algorithms on a hexagonal grid. The qualitative and quantitative analysis show that the proposed algorithm out performs the conventional circle drawing algorithms on a hexagonal grid. Usage of the proposed algorithm promises a greater advantage even in real time applications.
|
|
Keywords.
Hexagonal grids;rasterization; Scan conversion; Aliasing; Computer graphics; Frame buffer; Fiber optic display; Graphics processing unit (GPU).
|
|
Full Text:
PDF
|
|
|
A Quantum-PSO Optimization Approach for Continuous Functions
|
|
Khaira Tazir, Yamina Mohamed Ben Ali
|
|
Volume 3, Issue 1, 2011
pp.
33 - 40
|
|
Received
15 January 2011,
Accepted
23 March 2011
|
|
Abstract.
From recent research on problems optimization , quantum-inspired evolutionary algorithm QEA was proved to be better than conventional genetic algorithms. To improve the performance of the QEA, this paper proposes two variants of evolutionary algorithms in order to compare their performances. The first algorithm inspired by quantum computing uses only the quantum updating rules to modify at each step time each individual in the population. The second algorithm uses the principle of the particle swarm algorithm in order to update the Q-bit of each individual at each time. To test the performance of these two algorithms, we use a test problems benchmark composed of some continuous hard functions.
|
|
Keywords.
Evolutionary algorithm; Quantum computing; Particle swarm optimization.
|
|
Full Text:
PDF
|
|
|
A New Architecture Optimization Model for the Kohonen Networks and Clustering
|
|
Mohamed Ettaouil, Youssef Ghanou, Karim Elmoutaouakil, Mohamed Lazaar
|
|
Volume 3, Issue 1, 2011
pp.
14 - 32
|
|
Received
07 December 2010,
Accepted
08 March 2011
|
|
Abstract.
Self-Organizing Maps (SOM), known also as Kohonen networks, is one of the most attractive topics in the neural networks field. This unsupervised learning method, of one layer, has proved his effectiveness in several research areas such as analysis and image compression, recognition of writing, speech recognition, signal analysis, process control, robotics, and research on the Web. Since the training stage is very important in the SOM performance, the selection of the architecture of Kohonen networks, associated with a given problem, is one of the most important aspects of neural network research. More precisely, the choice of neurons number and the initial weights has a great impact on the convergence of learning methods trained. In this respect, we model this choice problem of neural architecture in terms of a mixed-integer problem with non linear constraints. Because of its effectiveness in solving the optimization problems, the genetic algorithm is used to simulate this non linear problem. The numerical results assess the effectiveness of the theoretical results shown in this paper, and the advantages of the new modeling.
|
|
Keywords.
Kohonen networks; Genetic algorithms; Automatic classification; Unsupervised training; Polynomial mixed-integer problem.
|
|
Full Text:
PDF
|
|
|
QoS Parametric Driven Virtual Topology Reconfiguration for IP-over-WDM Networks with Gaussian Traffic Distribution
|
|
Ramasamy Mariappan, T. Ravi, R.S.D. Wahida Banu
|
|
Volume 3, Issue 1, 2011
pp.
1 - 13
|
|
Received
02 July 2010,
Accepted
20 January 2011
|
|
Abstract.
The Internet Protocol (IP)-over- Wavelength Division Multiplexing (WDM) networks will be the best choice for next generation Internet. IP-over-WDM network built over multi mode fiber technology can be used for future internet networks. The Virtual Topology Reconfiguration of IP-over-WDM networks is one of the research topic under WDM optical networks. In this paper, we have presented a new approach of Quality of Service (QoS) parametric driven VTR for IP-over-WDM networks with Gaussian Traffic Distribution (GTD). The simulation results show that this new approach achieves better QoS performance in terms of blocking probability, throughput, utilization and latency.
|
|
Keywords.
Lightpaths; Logical topology; Traffic engineering; QoS; Resource management.
|
|
Full Text:
PDF
|
|
|
Flow-Based Stabilised Virtual Buffer -to Achieve Fairness in Internet Routers Monopolized by Aggressive Flows
|
|
K. Chitra, G. Padmavathi
|
|
Volume 2, Issue 1, 2010
pp.
55 - 63
|
|
Received
11 August 2010,
Accepted
26 November 2010
|
|
Abstract.
Internet routers face the problem of congestion due to the increased use of Internet. In Internet routers, Active Queue Management (AQM) attempts to provide high network utilization with low loss and low delay by regulating queues at bottleneck links. Many AQM algorithms have been proposed that tries to avoid congestion but suffers from problems of bursty packet drop, require careful configuration of control parameters and unfairness. Though data traffic is bursty in routers, AQM must handle these problems without comprising the high link utilization and low queuing delay. Then additionally routers must also be able to handle flows that are unresponsive which will otherwise lead to congestion collapse. This paper discusses and proposes an AQM scheme that does not comprise with high link utilization and low packet drop but achieves fairness among the varying flows.
|
|
Keywords.
Internet; Unresponsive flows; Congestion.
|
|
Full Text:
PDF
|
|
|
Job Shop Scheduling Problem Solved by the Continuous Hopfield Networks
|
|
Mohamed Ettaouil, Chakir Loqman, Khalid Haddouch
|
|
Volume 2, Issue 1, 2010
pp.
31 - 47
|
|
Received
23 July 2010,
Accepted
08 October 2010
|
|
Abstract.
The job shop scheduling problem JSSP is a classical problem in manufacturing, arising daily in factories and workshops. This problem requires scheduling a number of jobs on available machines. Each job is a sequence of tasks which needs to be executed on different machines. In this paper, we propose a new approach to solve the job shop scheduling problem using the constraint satisfaction problem CSP and the continuous Hopfield network CHN. This approach is divided into three steps: The first concerns formulating a job shop scheduling problem as a CSP problem. The second step involves filtering the resulting CSP problem and modeling the filtered CSP as 0-1 quadratic programming subject to linear constraints QP. The later step concerns applying the continuous Hopfield network to solve the obtained QP optimization problem. Finally, some computational experiments solving the job shop problem are represented.
|
|
Keywords.
Job shop scheduling problem; Constraint satisfaction problem; Filtering algorithms; Quadratic 0-1 programming; Continuous Hopfield network.
|
|
Full Text:
PDF
|
|
|
Nonlinear Least Squares Problems, Evolutionary Algorithms: Comparisons and Application in Optimal Control Problems
|
|
Akbar H. Borzabadi, Safie G. Sahebi
|
|
Volume 2, Issue 1, 2010
pp.
18 - 30
|
|
Received
27 August 2010,
Accepted
07 October 2010
|
|
Abstract.
This paper presents investigations on applying some evolutionary algorithms for nonlinear least squares problems (NLSP)'s. For this purpose, some tests are introduced for comparing the results of utilization these approaches. To show the efficiency of evolutionary algorithms, a discretized form of optimal control problems are converted to NLSP's and then the results of applying the best evolutionary algorithm in the given comparisons with a classical method of solving NLSP's , i.e., Levenberg-Marquardt method, are compared in numerical examples.
|
|
Keywords.
Nonlinear least squares problem; Evolutionary algorithm; Optimal control problem.
|
|
Full Text:
PDF
|
|
|
NAD - A Discretization Approach for Improving Interdependency
|
|
E. Chandra Blessie, E. Karthikeyan, B. Selvaraj
|
|
Volume 2, Issue 1, 2010
pp.
9 - 17
|
|
Received
11 December 2009,
Accepted
09 March 2010
|
|
Abstract.
Many classification algorithms need continuous features to be discretized. We propose a new algorithm NAD (Normalized And Discretization method) for improving the interdependency between continuous and class features. Empirical comparison of five existing algorithms with the proposed algorithm showed that the proposed algorithm generate better result based on time complexity and storage space.
|
|
Keywords.
Classification algorithms; Discretization method; Continuous features.
|
|
Full Text:
PDF
|
|