International Journal of Research in Computer Science
eISSN 2249-8265 Volume 3 Issue 3 (2013) pp.
1-7
www.
ijorcs.
org, A Unit of White Globe Publications
doi: 10.
7815/ijorcs.
33.
2013.
062
www.
ijorcs.
org
THE DESIGN OF COGNITIVE SOCIAL SIMULATION
FRAMEWORK USING STATISTICAL METHODOLOGY
IN THE DOMAIN OF ACADEMIC SCIENCE
V....
Mais
International Journal of Research in Computer Science eISSN 2249-8265 Volume 3 Issue 3 (2013) pp. 1-7 www. ijorcs. org, A Unit of White Globe Publications doi: 10. 7815/ijorcs. 33. 2013. 062 www. ijorcs. org THE DESIGN OF COGNITIVE SOCIAL SIMULATION FRAMEWORK USING STATISTICAL METHODOLOGY IN THE DOMAIN OF ACADEMIC SCIENCE V. Maniraj1 , R. Sivakumar2 * Associate Professor, Computer Science, A. V. V. M Sri Pushpam College (Autonomous), Poondi, Thanjavur, INDIA E-mail: 1 maniraj_vee@yahoo. co. in, 2 rskumar. avvmspc@gmail. com Abstract: Modeling the behavior of the cognitive architecture in the context of social simulation using statistical methodologies is currently a growing research area. Normally, a cognitive architecture for an intelligent agent involves artificial computational process which exemplifies theories of cognition in computer algorithms under the consideration of state space. More specifically, for such cognitive system with large state space the problem like large
Menos
De
Documento Adobe PDF
Pub. em Maio 16th 2013
Páginas: 7
Visualizações: 0
Downloads: 0
The Internet presents a stunning variety of on-line information resources: telephone directories, retail product catalogs, weather forecasts, airline schedules, event schedules and many more. This makes it difficult to extract relevant content from various sources. We discussed the problem of the extraction of information from Web...
Mais
The Internet presents a stunning variety of on-line information resources: telephone directories, retail product catalogs, weather forecasts, airline schedules, event schedules and many more. This makes it difficult to extract relevant content from various sources. We discussed the problem of the extraction of information from Web sources, in particular concerning fields of application, approaches and techniques developed during latest years.¬ In this paper we have done a brief survey of some tools and also discussed features that are important for web data extraction are supported by each tool. We introduced more detail about the methodology that is used to extract the Online Social Network & techniques related to the functioning of a Web information extraction platform, discussing the concepts of Web wrappers.
Menos
De
Documento Adobe PDF
Pub. em Maio 16th 2013
Páginas: 11
Visualizações: 0
Downloads: 0
In the field of speech signal processing, Spectral subtraction method (SSM) has been successfully implemented to suppress the noise that is added acoustically. SSM does reduce the noise at satisfactory level but musical noise is a major drawback of this method. To implement spectral subtraction method, transformation of speech signal...
Mais
In the field of speech signal processing, Spectral subtraction method (SSM) has been successfully implemented to suppress the noise that is added acoustically. SSM does reduce the noise at satisfactory level but musical noise is a major drawback of this method. To implement spectral subtraction method, transformation of speech signal from time domain to frequency domain is required. On the other hand, Wavelet transform displays another aspect of speech signal. In this paper we have applied a new approach in which SSM is cascaded with wavelet thresholding technique (WTT) for improving the quality of speech signal by removing the problem of musical noise to a great extent. Results of this proposed system have been simulated on MATLAB.
Menos
De
Documento Adobe PDF
Pub. em Maio 16th 2013
Páginas: 5
Visualizações: 0
Downloads: 0
A Mobile Ad hoc Network (MANET) is a self-configuring infrastructure less network of mobile devices connected by wireless. These are a kind of wireless Ad hoc Networks that usually has a routable networking environment on top of a Link Layer Ad hoc Network. The routing approach in MANET includes mainly three categories viz., Reactive...
Mais
A Mobile Ad hoc Network (MANET) is a self-configuring infrastructure less network of mobile devices connected by wireless. These are a kind of wireless Ad hoc Networks that usually has a routable networking environment on top of a Link Layer Ad hoc Network. The routing approach in MANET includes mainly three categories viz., Reactive Protocols, Proactive Protocols and Hybrid Protocols. These traditional routing schemes are not pertinent to the so called Intermittently Connected Mobile Ad hoc Network (ICMANET). ICMANET is a form of Delay Tolerant Network, where there never exists a complete end – to – end path between two nodes wishing to communicate. The intermittent connectivity araise when network is sparse or highly mobile. Routing in such a spasmodic environment is arduous. In this paper, we put forward the indication of prevailing routing approaches for ICMANET with their benefits and detriments.
Menos
De
Documento Adobe PDF
Pub. em Maio 16th 2013
Páginas: 9
Visualizações: 0
Downloads: 0
Due to the restriction of designing faster and faster computers, one has to find the ways to maximize the performance of the available hardware. A distributed system consists of several autonomous nodes, where some nodes are busy with processing, while some nodes are idle without any processing. To make better utilization of the...
Mais
Due to the restriction of designing faster and faster computers, one has to find the ways to maximize the performance of the available hardware. A distributed system consists of several autonomous nodes, where some nodes are busy with processing, while some nodes are idle without any processing. To make better utilization of the hardware, the tasks or load of the overloaded node will be sent to the under loaded node that has less processing weight to minimize the response time of the tasks. Load balancing is a tool used effectively for balancing the load among the systems. Dynamic load balancing takes into account of the current system state for migration of the tasks from heavily loaded nodes to the lightly loaded nodes. In this paper, we devised an adaptive load-sharing algorithm to balance the load by taking into consideration of connectivity among the nodes, processing capacity of each node and link capacity.
Menos
De
Documento Adobe PDF
Pub. em Maio 16th 2013
Páginas: 7
Visualizações: 0
Downloads: 0
There is a tremendous proliferation in the amount of information available on the largest shared information source, the World Wide Web. Fast and high-quality clustering algorithms play an important role in helping users to effectively navigate, summarize, and organize the information. Recent studies have shown that partitional...
Mais
There is a tremendous proliferation in the amount of information available on the largest shared information source, the World Wide Web. Fast and high-quality clustering algorithms play an important role in helping users to effectively navigate, summarize, and organize the information. Recent studies have shown that partitional clustering algorithms such as the k-means algorithm are the most popular algorithms for clustering large datasets. The major problem with partitional clustering algorithms is that they are sensitive to the selection of the initial partitions and are prone to premature converge to local optima. Subtractive clustering is a fast, one-pass algorithm for estimating the number of clusters and cluster centers for any given set of data. The cluster estimates can be used to initialize iterative optimization-based clustering methods and model identification methods. In this paper, we present a hybrid Particle Swarm Optimization, Subtractive + (PSO) clustering algorithm th
Menos
De
Documento Adobe PDF
Pub. em Março 7th 2013
Páginas: 9
Visualizações: 0
Downloads: 0
To efficiently process continuous spatio-temporal queries, we need to efficiently and effectively handle large number of moving objects and continuous updates on these queries. In this paper, we propose a framework that employs a new indexing algorithm that is built on top of SQL Server 2008 and avoid the overhead related to R-Tree...
Mais
To efficiently process continuous spatio-temporal queries, we need to efficiently and effectively handle large number of moving objects and continuous updates on these queries. In this paper, we propose a framework that employs a new indexing algorithm that is built on top of SQL Server 2008 and avoid the overhead related to R-Tree indexing. To answer range queries, we utilize dynamic materialized view concept to efficiently handle update queries. We propose an adaptive safe region to reduce communication costs between the client and the server and to minimize position update load. Caching of results was utilized to enhance the overall performance of the framework. To handle concurrent spatio-temporal queries, we utilize publish/subscribe paradigm to group similar queries and efficiently process these requests. Experiments show that the overall proposed framework performance was able to outperform R-Tree index and produce promising and satisfactory results.
Menos
De
Documento Adobe PDF
Pub. em Março 7th 2013
Páginas: 11
Visualizações: 0
Downloads: 0
White Globe Publications®
International Journal of Research in Computer Science
CALL FOR PAPERS – Volume 3, Issue 3
International Journal of Research in Computer Science
eISSN: 2249 – 8265 | ISSN: 2249 – 8257
IMPORTANT DATES
Deadline: 1st
April 2013
Notification: 15th
April 2013
Revision: 25th
April 2013
Publication: 5th
May...
Mais
White Globe Publications® International Journal of Research in Computer Science CALL FOR PAPERS – Volume 3, Issue 3 International Journal of Research in Computer Science eISSN: 2249 – 8265 | ISSN: 2249 – 8257 IMPORTANT DATES Deadline: 1st April 2013 Notification: 15th April 2013 Revision: 25th April 2013 Publication: 5th May 2013 It is our immense pleasure to invite you to submit your manuscripts for publication in International Journal of Research in Computer Sciences, a double blind peer-reviewed journal dedicated to the propagation and elucidation of scholarly research results. IJORCS aims to disseminate quality research work and to enhance the ethics and morale of the research community. Besides providing a platform for the reinforcement of science, fast operative publication, IJORCS disseminates the published research work in major indexing databases all over the world which includes, Citeseer, Microsoft Academic Research, BASE, Q-Sensei, Google Scholar, DOAJ, Cabell’s Directory
Menos
De
Documento Adobe PDF
Pub. em Fev. 7th 2013
Páginas: 1
Visualizações: 0
Downloads: 0
International Journal of Research in Computer Science
eISSN 2249-8265 Volume 3 Issue 1 (2013) pp.
27- 34
www.
ijorcs.
org, A Unit of White Globe Publications
doi: 10.
7815/ijorcs.
31.
2013.
058
www.
ijorcs.
org
DESIGN A NEW IMAGE ENCRYPTION USING FUZZY
INTEGRAL PERMUTATION WITH COUPLED CHAOTIC MAPS
Yasaman Hashemi...
Mais
International Journal of Research in Computer Science eISSN 2249-8265 Volume 3 Issue 1 (2013) pp. 27- 34 www. ijorcs. org, A Unit of White Globe Publications doi: 10. 7815/ijorcs. 31. 2013. 058 www. ijorcs. org DESIGN A NEW IMAGE ENCRYPTION USING FUZZY INTEGRAL PERMUTATION WITH COUPLED CHAOTIC MAPS Yasaman Hashemi Department of Computer Engineering, Islamic Azad University Varamin-Pishva Branch, IRAN Email: yasaman. hashemi@iauvaramin. ac. ir Abstract: This article introduces a novel image encryption algorithm based on DNA addition combining and coupled two-dimensional piecewise nonlinear chaotic map. This algorithm consists of two parts. In the first part of the algorithm, a DNA sequence matrix is obtained by encoding each color component, and is divided into some equal blocks and then the generated sequence of Sugeno integral fuzzy and the DNA sequence addition operation is used to add these blocks. Next, the DNA sequence matrix from the previo
Menos
De
Documento Adobe PDF
Pub. em Jan. 11th 2013
Páginas: 8
Visualizações: 0
Downloads: 0
International Journal of Research in Computer Science
eISSN 2249-8265 Volume 3 Issue 1 (2013) pp.
35- 45
www.
ijorcs.
org, A Unit of White Globe Publications
doi: 10.
7815/ijorcs.
31.
2013.
059
www.
ijorcs.
org
DYNAMIC MAP AND DIFFSERV BASED AR
SELECTION FOR HANDOFF IN HMIPV6 NETWORKS
1
Shiva Prasad Kaleru, 2...
Mais
International Journal of Research in Computer Science eISSN 2249-8265 Volume 3 Issue 1 (2013) pp. 35- 45 www. ijorcs. org, A Unit of White Globe Publications doi: 10. 7815/ijorcs. 31. 2013. 059 www. ijorcs. org DYNAMIC MAP AND DIFFSERV BASED AR SELECTION FOR HANDOFF IN HMIPV6 NETWORKS 1 Shiva Prasad Kaleru, 2 Damodaram Avula 1 Juniper Networks, Bangalore, INDIA shivaprasadkaleruphd@gmail. com, shivakaleru@gmail. com 2 Professor of CSE & Director, Academic Audit Cell, JNTU, Hyderabad, INDIA damodarama@rediffmail. com Abstract: In HMIPv6 Networks, most of the existing handoff decision mechanisms deal mainly with the selection of Mobility Anchor Point (MAP), ignoring the selection of access router (AR) under each MAP. In this paper, we propose a new mechanism called “Dynamic MAP and Diffserv based ARs selection for Handoff in HMIPv6 networks” and it deals with selecting the MAP as well as ARs. MAP will be selected dynamically by checking load, ses
Menos
De
Documento Adobe PDF
Pub. em Jan. 11th 2013
Páginas: 11
Visualizações: 0
Downloads: 0
Índia
Facebook
Digg
del.icio.us
Furl
rededit
StumbleUpon