Academia.eduAcademia.edu

Computer Science Information Technology

description4,295 papers
group1,986 followers
lightbulbAbout this topic
Computer Science Information Technology is the study and application of computing systems, software development, data management, and network infrastructure. It encompasses the design, implementation, and maintenance of technology solutions to process, store, and communicate information effectively, focusing on both theoretical foundations and practical applications in various domains.
lightbulbAbout this topic
Computer Science Information Technology is the study and application of computing systems, software development, data management, and network infrastructure. It encompasses the design, implementation, and maintenance of technology solutions to process, store, and communicate information effectively, focusing on both theoretical foundations and practical applications in various domains.
Visualizing knowledge domains
by Chaomei Chen

2003, Annual review of information …

several things; for instance, the journal may not require index terms from the authors, the journal may not supply terms to the database vendor, or the database vendor may choose not to index an article.) This makes the use of terms a less-than-optimum basis for mapping of these data. By contrast, abstracts are available for 84% of the post-1991 ARIST data set, making it a richer source of information. The percentages listed here apply only to this data set; we do not know the Book, journal and/or conference coverage can also be an issue. For instance, JASIS(T), Scientometrics, Journal of Information Science, Information Processing and Management, and the Journal of Documentation are key sources for visualization of science or knowledge domains (see Yet the SCI only started coverage of these journals in the mid-1990s. (JASIS, Scientometrics, and JDoc were covered through the mid-1980s.) Queries to the SCI alone would not have provided sufficient coverage of the intended fields over this time period due to this lack of key journal coverage. Thus, we queried the SSCI as well, which covered those journals over the entire time period under investigation. Users of ISI’s Web of Science can conduct a search across all databases such as the SCI, SSCI, and the Arts and Humanities Citation Index (AHCI).
Figure 3. Numbers of articles by field per year in the ARIST data set with average citation counts. Articles contribute to counts in more than one field if retrieved by queries from multiple fields.
The resultant author co-citation map contains 380 authors who have nine or more citations over the entire period between 1977 and 2001. Pathfinder network scaling limited the number of “salient” connections among these authors to 384. As usual, each author's node is colored by the factor loadings in the largest three specialties. An author co-citation map of a focused, coherent subject domain should demonstrate a considerable degree of conformance between the Pathfinder network structure and the factor analysis color patterns. However, this is not the case here, suggesting that science mapping constitutes a number of largely independent disciplines - as (Leydesdorff & Wouters, 2000) describes the status of scientometrics - this is pre- naradiomatic. Figure 4. An overview of the author co-citation map (1977-2001), consisting of 380 authors with 9 or more citations. The map is dominated by the largest specialty of citation indexing. No strong concentration of other specialties are found, which implies the diversity of the domain.
It is interesting to note that none of the four largest factors are centered in either visualization or semantics, which were two of the four groups comprising the ARIST data set. These two fields are relatively new and are not highly cited (see Figure 3). Thus, they are unlikely to be strong factors in an ACA-type analysis.
Figure 6. An overview of the document co-citation map of 394 articles with 10 or more citations. In this network, a number of tight clusters of documents are connected to an artery-like chain. Documents on the artery chain tend to be seminal works of connected clusters. For example, Diana Crane’s Invisible College (Crane, 1972) connects the scholar communication cluster to the artery chain.
Bin Zhu and Hsinchun Chen of the University of Arizona visualized the ARIST data set using ET-Maps (see section 4.3.2). They trained 10*10 nodes using the ID/keyword data of the ARIST data set. At the end of the map creation process, each node is associated with a list of documents that are semantically similar to each other. In addition, a phrase was assigned to each node as its label and adjacent nodes that have the same label are grouped into one region or category. Thus, spatial proximity on the map indicates semantic proximity, meaning if two categories are close to each other on SOM map, they are also semantically similar to each other.
listed on the left hand side together with a number in brackets telling how many individual documents it contains. In a typical browsing session a user would get an overview first, zoom into areas of interest, and access a particular document. Alternatively, a user can select a category of interest and the interface will display documents within that category. Figure 9. ET-Map of the ARIST data set using keywords. Left is a list of labels of all categories. A user can select a category of interest and the interface will display documents within that category.
Figure 10. Cartographic SOM map of ARIST data set. For each cluster, three label terms are computed, to better convey cluster content. Since the clusters were computed from the SOM itself, these labels indicate the potential topic or theme that one would expect to find with articles assigned to a particular cluster. In order to show the relative prominence of topics in the data set, the clusters were ranked according to the number of articles of this data set that were actually assigned to them. Clusters containing more articles appear larger and more prominent.
The fourth segment (1995-2000) shows semantic analysis as a new field (labeled C), which, like the visualization clusters, is not well linked to the main body of work. The citation analysis and bibliometrics fields each seem to be well defined, with some mixing of the two in certain clusters. While bibliometrics seemed to be growing faster than citation analysis in the middle two segments (late 80s and early 90s), comparison of the numbers of papers in the late 90s shows citation analysis to be gaining strength. There is also an interesting cluster (labeled D) in which citation analysis, bibliometrics, and visualization are mixed. Additional analysis on this and surrounding clusters will be given in section 6.2 (see Figure 14).
Figure 12. VxInsight co-term (left) and LSA (right) maps of ARIST data The map based on LSA over article titles shows some different features. The titles contained 4,802 unique words, while abstracts contained 14,494 unique words. Here, the semantics papers are spread throughout the landscape. The visualization papers are also more mixed, and in several cases, they seem to bridge groups of citation analysis and bibliometrics articles. Bibliometrics and citation analysis articles, while appearing in the same clusters, are segregated within the clusters.
Figure 13. VxInsight co-classification map of ARIST data
Figure 14. Comparison of layouts of four different document maps based on terms or words. A: Cartographic-SOM (compare [Figure 10), B: ET-Map (compare Figure 9), C: Co-term (compare Figure 12, left), D: LSA (compare Figure 12, right). Dot color legend — YELLOW: citation analysis, GREEN: bibliometrics, BLUE: semantics, MAGENTA: visualization. level, the different layout techniques seem to give similar groupings from the term or word expressions. We have not done a neighborhood analysis to verify this statistically, but leave that to another time and study.
Figure 15. Strong co-term linkages based on cosine similarity for the three term-based document maps of Figure 14] perhaps fewer clusters and less efficient space-filling can be justified. The LSA map is not compared here since title words and terms give different levels of information (Qin, 2000).
Browsing of individual articles confirmed that each cluster was comprised of articles where researchers used the technique central to the cluster. Identical queries were made to the Cartographic-SOM, co-term, and LSA maps, with the results shown in Figure 16 In these three maps, the query results are spread throughout the maps and are not associated with any discrete clusters. Thus, articles are clustered much better by technique when using references than when using term or title-based similarity measures. This is likely due to lack of consistent use of terms corresponding to techniques in either keyword lists or titles. We expect that maps based on similarities between words in abstracts would do a much better job of clustering by technique than do any of the measures shown here. Figure 16. Comparison of distinct fields on the citation map with their counterparts on the term or title-based maps. Legend — BLUE: author co-citation (ACA), GREEN -— co-word analysis and Leximappe, MAGENTA: co-citation analysis.
Sandia is a multiprogram laboratory operated by Sandia Corporation, a Lockheed Martin Company, for the Unitec States Department of Energy under Contract DE-AC04-94AL85000. This is the table of contents of Katy Borner, Chaomei Chen, & Kevin Boyack: Visualizing Knowledge Domains. Annual Review of Information Science & Technology, Volume 37, 2003. (in press) Visualizing Knowledge Domains >
Figure 1. Process flow for mapping knowledge domains. or the assignment of coordinates to each unit, and (6) use of the resulting visualization for analysis and interpretation. Steps four and five of this process are often distilled into one operation, which can be described as data layout.
Table 1: Comparison of Techniques One exception to Table lis noted here. Although VxOrd is classified as a FDP algorithm, it does not act like FDPs as characterized in the table. Rather, it can scale to very large data sets (millions of similarity pairs, only limited by memory constraints), has very fast run times, and provides a static layout. Some ordination techniques have a very high computational complexity for large data sets. This complexity can be reduced at the cost of global optimality by breaking the data set into smaller chunks, ordinating each cluster, and compiling all clusters into a single map.
Table 2. Search terms used to generate the ARIST bibliographic data set.
lable 3. Number of articles by journal in the ARIST set (10 or more articles per journal). For completeness, we include a distribution of the number of articles per field per year, along with average citation counts, for the ARIST data set (see Figure 3). This shows the dramatic increase in publishing in citation analysis and bibliometrics starting in the late 1980s, and the birth of the visualization field around the same time. It also shows that citation analysis articles were more highly cited that bibliometrics articles in the 1970s and 1980s, and that citation counts for all four fields have generally dropped throughout the 1990s. The most recent articles have, of course, been cited infrequently due to their young age.
Table 4. Comparison of document maps. \ second issue concerns the number of terms associated with each article. For the ARIST data, 34% of the articles with terms have 1-3 terms, 42% of the articles have 4-7 terms, 17% of the irticles have 8-10 terms, and the remaining 7% have 11 or more terms. Chung and Lee (Chung & Lee, 2001) showed that cosine measures tend to emphasize high-frequency terms. Andre skupin’s experience (see section 6.1.3) with SOM is that articles with only | or 2 terms tend to ither eqnsregate in less dense areas of the SOM or in the middle of clusters, rather than at their dges 22 Boyack’s experience using a cosine co-term similarity with FDP is that articles with mly 1 or 2 terms tend to be evenly distributed if the associated terms are specific, multi-word erms, but lie in Ve middle of large clusters if the associated terms are single word, general terms e.g, SCIENCE). Different results may arise from different layout routines; nevertheless, a lefinitive study on the effects of term types, the generality of terms, and term distributions is 1eeded.
descriptionView Paperarrow_downwardDownload
Legal aspects of the web
by Alexandre López-Borrull

2005, Annual review of information science …

descriptionView Paperarrow_downwardDownload
Performance Evaluation of Routing Protocols in Wireless Sensor Networks
by Laiali Almazaydeh

2010, International Journal of Computer Science & Information Technology

The efficiency of sensor networks strongly depends on the routing protocol used. In this paper, we analyze three different types of routing protocols: LEACH, PEGASIS, and VGA. Sensor networks are simulated using Sensoria simulator.... more
Each of these scattered sensor nodes has the capability to collect and route data either to other sensors or back to an external base station(s). A base-station may be a fixed node or a mobile node capable of connecting the sensor network to an existing communications infrastructure or to the Internet where a user can have access to the reported data [2].
2.2 PEGASIS protocol each node that is not a cluster head selects the closest cluster head and joins that cluster to transmit data. The cluster heads aggregate and compress the data and forward it to the base station, thus it extends the lifetime of major nodes. In this algorithm, the energy consumption will distribute almost uniformly among all nodes and the non-head nodes are turning off as much as possible. LEACH assumes that all nodes are in wireless transmission range of the base station which is not the case in many sensor deployments. In each round, LEACH has cluster heads comprising 5% of total nodes. It uses Time Division Multiple Access (TDMA) as a scheduling mechanism which makes it prone to long delays when applied to large sensor networks. Figure 2 shows the communications in LEACH protocol. An enhancement over LEACH protocol was proposed in [4]. The protocol, called Power- Efficient Gathering in Sensor Information Systems (PEGASIS). The protocol is a near optimal chain-based protocol for extending the lifetime of network. In PEGASIS, each node communicates only with the closest neighbour by adjusting its power signal to be only heard by this closest neighbour. Each Nodes uses signal strength to measure the distance to neighbourhood nodes in order to locate the closest nodes. After chain Formation PEGASIS elects a leader from the chain in terms of residual energy every round to be the one who collects data from the neighbours to be transmitted to the base station. As a result, the average energy spent by each node per round is reduced. Unlike LEACH, PEGASIS avoids cluster formation and uses only one node in a chain to transmit to the Base station instead of multiple nodes. This approach reduces the overhead and lowers the bandwidth requirements from the BS. Figure 3 shows that only one cluster head leader node forward the data to the BS.
Figure 4. Regular shape tessellation applied to the network area [7] Virtual Grid Architecture (VGA) is an energy-efficient routing paradigm proposed in [5]. Th protocol utilizes data aggregation and in-network processing to maximize the network lifetim Due to the node stationary and extremely low mobility in many applications in WSNs, reasonable approach is to arrange nodes in a fixed topology. A GPS-free approach is used 1 build clusters that are fixed, equal, adjacent, and non-overlapping with symmetric shapes. In [5 square clusters were used to obtain a fixed rectilinear virtual topology. Inside each zone, a noc is optimally selected to act as CH. Data aggregation is performed at two levels: local and the global. The set of CHs, also called Local Aggregators (LAs), perform local aggregation, while subset of these LAs are used to perform global aggregation. However, the determination of a optimal selection of global aggregation points, called Master Aggregators (MAs), is NP-har« Figure 4 illustrates an example of fixed zoning and the resulting virtual grid architecture (VGA used to perform two level data aggregation. Note that the location of the base station is n necessarily at the extreme corner of the grid; rather it can be located at any arbitrary place.
To evaluate the performance of the hierarchal routing protocols, the simulation consists of 80 homogeneous nodes with initial energy of 0.5 Joule, scattered randomly within a 40x40 m sensor field (see Figure 5). The Base Station is (BS) located at (25,150) m, so it is at least 110 m far from the closest packets and 248 bit control packets. The energy consumption due to communication will be calculated using the first order energy model. We assume that each sensor node generates one data packet per time unit to be transmitted to the BS. For simplicity, we refer to each time unit as a round. During the simulation process, only a set of sources will be selected randomly at each round to send their data to the BS. Transmission and sensing range are 15 m and 8 m respectively. Figure 5. Simulated WSN with node distribution, n=80
Figure 10. PEGASIS failed nodes
Figure 8. LEACH total network energy Figure 9. VGA total network energy
We conclude that PEGASIS achieves approximately 2x the number of rounds compared to LEACH. It approximately achieves 77x the number of rounds compared to VGA. LEACH approximately performs 36x the number of rounds compared to VGA.
We run the simulations to determine the number of rounds of communication when the network loss its connectivity, where this time the transmission range is 70 m. Figure 13, 14 respectively shows the clustering in VGA when the transmission range is 15 m and when the transmission range is 70 m. Figure 13. Clustering in VGA when transmission range is 15 m
Our simulations show that VGA approximately achieves 3x the number of rounds compared to PEGASIS. It approximately achieves 11x the number of rounds compared to LEACH. While PEGASIS approximately performs 3x the number of rounds compared to LEACH. The lifetimes of the network are 8124, 2285, and 741 rounds for VGA, PEGASIS, and LEACH respectively. Figure 15 shows the network lifetime.
Table1. Classification and Comparison of routing protocols in WSNSs [8]
descriptionView Paperarrow_downwardDownload
Students Perceptions of Using Educational Games to Learn Introductory Programming
by Roslina Ibrahim

2011

Educational computer games studies experienced rapid growth due to the belief that games can offer various learning benefits being highly popular among younger generations. Programming is considered a challenging subject by students and... more
descriptionView Paperarrow_downwardDownload
Ubiquitous Mobile Health Monitoring System for Elderly (UMHMSE)
by Mohammed Feham

2011, International Journal of Computer Science and Information Technology

and Heart Rate. Remote users (family and medical personnel) might have a real time access to the collected information through a web application.
descriptionView Paperarrow_downwardDownload
Adaptive Fuzzy Filtering for Artifact Reduction in Compressed Images and Videos
by Sehoon Yea

2009, IEEE Transactions on Image Processing

A fuzzy filter adaptive to both sample's activity and the relative position between samples is proposed to reduce the artifacts in compressed multidimensional signals. For JPEG images, the fuzzy spatial filter is based on the directional... more
descriptionView Paperarrow_downwardDownload
Issues in the Reconstruction of Gene Order Evolution
by Vicky Adriana

2009, Journal of Computer Science and Technology

As genomes evolve over hundreds of millions years, the chromosomes become rearranged, with segments of some chromosomes inverted, while other chromosomes reciprocally exchange chunks from their ends. These rearrangements lead to the... more
descriptionView Paperarrow_downwardDownload
E-Learning personalization based on Dynamic learners' preference
by El Hassan Abdelwahed

2011, International Journal of Computer Science and Information Technology

Personalized e-learning implementation is recognized one of the most interesting research areas in the distance web-based education. Since the learning style of each learner is different we must to fit elearning to the different needs of... more
descriptionView Paperarrow_downwardDownload
A Comparative Experiment of Several Shape Methods in Recognizing Plants
by Edy Susanto

2011

Shape is an important aspects in recognizing plants. Several approaches have been introduced to identify objects, including plants. Combination of geometric features such as aspect ratio, compactness, and dispersion, or moments such as... more
descriptionView Paperarrow_downwardDownload
Initial Classification Through Back Propagation In a Neural Network Following Optimization Through GA to Evaluate the Fitness of an Algorithm
by Panchal Gaurang

International Journal of Computer …

an Artificial Neural Network classifier is a nonparametric classifier. It does not need any priori knowledge regarding the statistical distribution of the class in a giver selected data Source. While, neural network can be trained to... more
Fig. 2 ANN Architecture: Multilayer Perceptron
Fig. 4 Methodology Applied in BPNN_GA
Fig. 5 Performance Comparison of Classification Techniques
Fig. 6 Performance Comparison of Classification Techniques
COMPARISON OF CLASSIFICATION TECHNIQUES
Performance analysis based on Iterations PERFORMANCE ANALYSIS BASED ON ITERATIONS Performance analysis based on number of Hidden nodes
PERFORMANCE ANALYSIS BASED ON HIDDEN NODES
International Journal of Computer Science & Information Technology (IJCSIT), Vol 3, No 1, Feb 2011
International Journal of Computer Science & Information Technology (IJCSIT), Vol 3, No 1, Feb 2011 PERFORMANCE ANALYSIS BASED ON HIDDEN LAYERS
descriptionView Paperarrow_downwardDownload
A framework for the computer based assessment of diagram based coursework
by Thanassis Tsintsifas

2002, Computer Science and Information Technology

This research investigates the feasibility and usefulness of designing an authoring environment for diagram-based Computer Based Assessment (CBA). CBA systems present students with an environment that permits them to solve exercises. Upon... more
descriptionView Paperarrow_downwardDownload
Detection of Masses in Digital Mammogram Using Second Order Statistics and Artificial Neural Network
by Nazar Zaki

2011, International Journal of Computer …

. The results show that the GLCM at 0 o , 45 o , 90 o and 135 o with a window size of 8X8 produces informative features to classify between masses and non-masses. Our method was able to achieve an accuracy of 91.67% sensitivity and 84.17%... more
descriptionView Paperarrow_downwardDownload
Standardized Usability Questionnaires: Features and Quality Focus
by ahlem Assila

2016, Computer Science and Information Technology

For the last few decades more than twenty standardized usability questionnaires for evaluating software systems have been proposed. These instruments have been widely used in the assessment of usability of user interfaces. They have their... more
Figure 3. Number of Universal Questionnaires by Usability Criteria
Figure 4. Number of Specific Questionnaires by Usability Criteria
Table 1. Key Proprieties of Existing Standardized Usability Questionnaires
Figure 1. Universal standardized Usability Questionnaire: Quality issues and Usability Criteria
Figure 2. Specific standardized Usability Questionnaire: Quality issues and Usability Criteria
Table 3. Examples of Software Applications that have Applied Universal Questionnaires In the study conducted by Tullis and Stetson [76] for assessing the usability of websites, SUS was compared with four questionnaires (QUIS, CSUQ,
Table 2. Classifications of Questionnaires
Table 4. Quality Issues of Universal Standardized Usability Questionnaires A. Assila, K. de Oliveira and H. Ezzedine, Standardized Usability Questionnaires: Features and Quality Focus
Table 5. Quality Issues of Specific Standardized Usability Questionnaires
Table 8. Item Examples of Universal Usability Questionnaires as a Function of Standard Usability Criteri
Table 8 (cont.). Item Examples of Universal Usability Questionnaires as a Function of Standard Usability Criteria Table 9. Analysis Results for the Specific Standardized Usability Questionnaires
Table 10. Item Examples of Specific Usability Questionnaires as a Function of Standard Usability Criteria
descriptionView Paperarrow_downwardDownload
Printed Arabic Character Recognition Using HMM
by Abbas Hassin

2004, Journal of Computer Science and Technology

The Arabic Language has a very rich vocabulary. More than 200 million people speak this language as their native speaking, and over 1 billion people use it in several religion-related activities. In this paper a new technique is presented... more
descriptionView Paperarrow_downwardDownload
Approximating Geographical Queries
by Patrizia Grifoni

2009, Journal of Computer Science and Technology

This article proposes a graph-theoretic methodology for query approximation in Geographic Information Systems, enabling the relaxation of three kinds of query constraints: topological, semantic and structural. An approximate query is... more
descriptionView Paperarrow_downwardDownload
Iris Recognition Based on LBP and Combined LVQ Classifier
by Mahmoud Y . Shams

airccse.org

Iris recognition is considered as one of the best biometric methods used for human identification and verification, this is because of its unique features that differ from one person to another, and its importance in the security field.... more
descriptionView Paperarrow_downwardDownload
Verification of Authentication Protocols for Epistemic Goals via SAT Compilation
by Abdul Sattar and 
1 more
Qing-liang Chen

2006, Journal of Computer Science and Technology

descriptionView Paperarrow_downwardDownload
Recognizing Bangla Grammar Using Predictive Parser
by Amit Saha

2011, International Journal of Computer Science and Information Technology

We describe a Context Free Grammar (CFG) for Bangla language and hence we propose a Bangla parser based on the grammar. Our approach is very much general to apply in Bangla Sentences and the method is well accepted for parsing a language... more
descriptionView Paperarrow_downwardDownload
A Review on Elliptic Curve Cryptography for Embedded Systems
by Rahat Siddiqui

2011, arXiv preprint arXiv:1107.3631

Since then, Elliptic curve cryptography or ECC has evolved as a vast field for public key cryptography (PKC) systems. In PKC system, we use separate keys to encode and decode the data. Since one of the keys is distributed publicly in PKC... more
Elliptic curves can more generally be defined over any finite field. In particular, the characteristic two finite fields F(2m) and Fp are of special interest since they lead to the most efficient implementation of the elliptic curve arithmetic. Elliptic curves are not like an ellipse or curve in shape. They look similar to doughnuts. Geometrically speaking they somehow resemble the shape of torus, which is the product of two circles when projected in three-dimensional coordinates[6].
Figure 3. Doubling: R=P+P For P=Q ,, point doubling, Geometrically if we draw a tangent line at point P, this line intersects elliptic curve at point a point (-R). Then, R is the reflection of this point about x-axis.
Figure 2. Addition: R=P+Q International Journal of Computer Science & Information Technology (IJCSIT), Vol 3, No 3, June 2011 It is calculated using following equations:
This point multiplication is performed by repeated point addition and point doubling for example 7P=(2((2P)+ P)+P. k is used as a private key and curve’s base point G is used as a public key. For ECC we only consider those points which lie in some finite field. Q=kP is called scalar point multiplication. This is most time consuming operation in ECC implementation. The hierarchy of EC arithmetic is given in Fig. 4 The top level k.P algorithm is performed by repeated EC-Add and EC-Double operations. The EC operations in turn are composed of basic operations in the underlying finite field (FF) like FF-Addition/subtraction, FF-Multiplication. FF-square can be implemented using multiplication and as we are considering resource constrained devices this is generally preferred. The FF inversion is a very expensive operation, it is used to implement FF-Division Euclid’s method is a common choice to implement inversion in finite field. But, Using
Figure 5. Various methods of scalar point multiplication k.P Montgomery’s method and a special case of Euclid’s inversion. FF- Division can be implemented directly [8]. The elliptic curve point multiplication Q=kP can be performed according to a variety of approaches. They are summarized in [9], as shown in Fig.5.The scalar k can have different representations. There is verity of algorithms to perform multiplication. Also there are various combinations of finite filed representation and coordinate system for curve points. A multitude of algorithms is available to be applied for each task. A proper combination of various algorithms can significantly affect the performance of EC point multiplication. In general, affine and projective coordinate systems are considered to perform calculations.
ECC is emerging as a most trusted solution for providing security on embedded systems Table 1. Strength of Diffie Hellman V/s Elliptic Curve Keys.
Table 2. NIST recommended key length Institute of Electrical and Electronics Engineers (IEEE) The IEEE P1363 working group is developing a suite of standard s for public-key cryptography. The scope of P1363 is very broad and includes schemes based on the intractability of integer factorization, discrete logarithm in finite fields, standard includes elliptic curv signature sch (ECMQV and requirements a reference standards and elliptic curve d eme due to Ny iscrete logarithms, and lattice-based schemes. The 1363-2000 e signature schemes (ECDSA and an elliptic curve analogue of a berg and Rueppel), and elliptic curve key agreement schemes variants of elliptic curve Diffie-Hellman (ECDH)). It differs fundamentally from the ANSI standards and FI PS 186-2 in that there are no mandated minimum security and there is ana bundance of options. Its primary purpose, therefore, is to serve as for specifications of a variety of cryptographic protocols from which other applications can select. The 1363-2000 standard restricts the underlying finite field to be a prime field Fp or a binary field F2m. The P1363a draft standard is an addendum to 1363-2000. I contains specifications of ECIES and the Pintsov-Vanstone signature scheme providing message recovery, and allows for extension fields Fpm of odd characteristic including optimal extension fields.
descriptionView Paperarrow_downwardDownload
Developing Project Duration Models in Software Engineering
by Oligny Serge

2007, Journal of Computer Science and Technology

Based on the empirical analysis of data contained in the International Software Benchmarking Standards Group (ISBSG) repository, this paper presents software engineering project duration models based on project effort. Duration models are... more
descriptionView Paperarrow_downwardDownload
Efficient Web Log Mining Using Enhanced Apriori Algorithm with Hash Tree and Fuzzy
by Kannan Arputharaj

2010, International Journal of Computer Science and Information Technology

Web usage mining is the type of Web mining activity that involves the automatic discovery of user access patterns from one or more Web servers. In this paper we analyze the pattern using different algorithms like
Web Usage Mining consists of three phases which are named data processing, pattern discovery
Log File Functional Diagram [Fig.2] 3.2. Preprocessing
International journal of computer science & information Technology (IJCSIT) Vol.2, No.4, August 2010
International journal of computer science & information Technology (IJCSIT) Vol.2, No.4, August 2010
Now the minimum support value will have the crisp boundry problem that is the output value wil looping over the entire et, Ly, not be optimized one and the efficiency will be low to make it optimized and to improve the
Now we have obtained the optimized value compare to the previous Apriori algorithm Thus we International journal of computer science & information Technology (IJCSIT) Vol.2, No.4, August 2010
Efficiency of two algorithms Fig.6] understand that the modified Apriori hash tree with fuzzy is more effective.
6. Performance Evaluation Chart
Performance Analysis with URL [Fig .7]
descriptionView Paperarrow_downwardDownload
Behavior Analysis in a learning Environment to Identify the Suitable Learning Style
by Abdelaziz Hamada

2011, International Journal of …

Personalized adaptive systems rely heavily on the learning style and the learner's behavior. Due to traditional teaching methods and high learner/teacher ratios, a teacher faces great obstacles in the classroom. In these methods, teachers... more
descriptionView Paperarrow_downwardDownload
A Hybrid Region Growing Algorithm for Medical Image Segmentation
by Zulaikha Beevi

2012, International Journal of Computer Science and Information Technology

In this paper, we have made improvements in region growing image segmentation. The First one is seeds select method, we use Harris corner detect theory to auto find growing seeds. Through this method, we can improve the segmentation... more
descriptionView Paperarrow_downwardDownload
VERTAF/Multi-Core: A SysML-Based Application Framework for Multi-Core Embedded Software Development
by Chun-Hsien Lu

2011, Journal of Computer Science and Technology

Multi-core processors are becoming prevalent rapidly in personal computing and embedded systems. Nevertheless, the programming environment for multi-core processor-based systems is still quite immature and lacks efficient tools. In this... more
descriptionView Paperarrow_downwardDownload
A Fast Hue-Preserving Histogram Equalization Method for Color Image Enhancement using a Bayesian Framework
by David Menotti and 
2 more
Jacques Facon
Laurent Najman

2007

In this paper, we introduce a new hue-preserving histogram equalization method based on the ROB color space for image enhancement. We use fi-red, G-green, and B-blue 1D histograms to estimate the histogram to be equalized using a Naive... more
descriptionView Paperarrow_downwardDownload
The triple model: Combining cutting-edge web technologies with a cognitive model in an ECA
by Maurice Grinberg

2008, Computer Science and Information …

This paper introduces a new model which is intended to combine the power of a connectionist engine based on fast matrix calculation, RDF based memory and inference mechanisms, and affective computing in a hybrid cognitive model. The model... more
descriptionView Paperarrow_downwardDownload
Information Security Plan for Flight Simulator Applications
by Jason Slaughter and 
1 more
Shawon Rahman

2011, International Journal of Computer Science and Information Technology

The Department of Defense has a need for an identity management system that uses two factor authentications to ensure that only the correct individuals get access to their top secret flight simulator program. Currently the Department of... more
descriptionView Paperarrow_downwardDownload
Enhanced-DSR: A New Approach to Improve Performance of DSR Algorithm
by Sharmin Sultana

2010, International Journal of Computer Science & Information Technology

High overhead involved in flooding while route creation is a limiting factor of Dynamic Source Routing (DSR) protocol applied for mobile ad hoc networks (MANETs). During data delivery, it seems that we fully benefit from DSR if the route... more
descriptionView Paperarrow_downwardDownload
The Prediction of Internet Technology Utilization within Learning Environments
by Esther Khakata

International Journal of Scientific Research in Computer Science, Engineering and Information Technology

Internet technology has been revolutionary over the years especially in the educational sector. However, the utility of internet technology in the learning process of a student in a higher learning institution has not been determined over... more
descriptionView Paperarrow_downwardDownload
A Multi -Perspective Evaluation of MA and GA for Collaborative Filtering Recommender System
by Shikha Mehta

2010, International Journal of Computer Science and Information Technology

The rising popularity of evolutionary algorithms to solve complex problems has inspired researchers to explore their utility in recommender systems. Recommender systems are intelligent web applications which generate recommendations... more
descriptionView Paperarrow_downwardDownload
Leapfrog: Optimal Opportunistic Routing in Probabilistically Contacted Delay Tolerant Networks
by Qunfeng Dong

2009, Journal of Computer Science and Technology

Delay tolerant networks (DTNs) experience frequent and long lasting network disconnection due to various reasons such as mobility, power management, and scheduling. One primary concern in DTNs is to route messages to keep the end-to-end... more
descriptionView Paperarrow_downwardDownload
GENBIT COMPRESS TOOL(GBC): A JAVA-BASED TOOL TO COMPRESS DNA SEQUENCES AND COMPUTE COMPRESSION RATIO(BITS/BASE) OF GENOMES
by vinod kumar

2010, International Journal of Computer Science and Information Technology

We present a Compression Tool , GenBit Compress", for genetic sequences based on our new proposed "GenBit Compress Algorithm". Our Tool achieves the best compression ratios for Entire Genome (DNA sequences) . Significantly better... more
descriptionView Paperarrow_downwardDownload
Planning and Profit Sharing in Overlay WiFi and LTE Systems toward 5G Networks
by Danielle Saliba

2019, JOURNAL OF COMPUTER SCIENCE AND INFORMATION TECHNOLOGY

With the increasing demand for data traffic and with the massive foreseen deployment of the Internet of Things (IoT), higher data rates and capacity are required in mobile networks. While Heterogeneous Networks (HetNets) are under study... more
descriptionView Paperarrow_downwardDownload
Performance of IEEE 802.15.4 Clusters with Power Management and Key Exchange
by Mayank Mehre

2008, Journal of Computer Science and …

The IEEE 802.15.4 specification is a recent low data rate wireless personal area network standard. While basic security services are provided for, there is a lack of more advanced techniques which are indispensable in modern personal area... more
descriptionView Paperarrow_downwardDownload
DNA Lossless Differential Compression Algorithm based on Similarity of Genomic Sequence Database
by Manal Abdel Wahed

2011, Arxiv preprint arXiv:1109.0094

Modern biological science produces vast amounts of genomic sequence data. This is fuelling the need for efficient algorithms for sequence compression and analysis. Data compression and the associated techniques coming from information... more
descriptionView Paperarrow_downwardDownload
Dependable Online Appointment Booking System for Nhis Outpatient in Nigerian Teaching Hospitals
by Kehinde Williams

2014, International Journal of Computer Science and Information Technology

The number of missed appointments in healthcare institutions in Nigeria caused problems, hence the need for integrated healthcare system to intervene and provide seamless care for patients. Appointment scheduling system lies at the... more
International Journal of Computer Science & Information Technology (IJCSIT) Vol 6, No 4, August 2014 Figure 1: Medical Appointment Booking System architecture
International Journal of Computer Science & Information Technology (IJ CSIT) Vol 6, No 4, August 2014
new user to use the system. This is the Menu that will be display as a confirmation Menu for the registration and this Menu can be print out by the patient and this is depicted in figure 4. Figure 4: Output of Patient Registration
Figure 3: Patient Registration Menu
International Journal of Computer Science & Information Technology (IJCSIT) Vol 6, No 4, August 2014 Figure 5: Patient Activity Menu
Figure 6: Weekly Calendar This enables the patients to book for medical appointment by clicking on the link and the above Menu will be display. This Menu enables the patient to view the calendar as scheduled by the system administrator based on the weekly activities of the doctors at the Obafemi Awolowo University Teaching Hospital complex. When a patient view this calendar then he/she will know the doctor that is available at a particular time and make his/her appointment based on the schedule. After viewing the calendar, the patient can then clink on next button to continue with the appointment and this is shown in figure 6.
doctor. The appointment will then be treated by the administrator for final confirmation, the appointment can then be approved or disapproved based on the doctor availability. The patient can also print as a confirmation for their appointment. The patient can then view the appointment status weither the appointment has been approved or not. The patient can clink on the link name to view appointment report and the following Menu will be display. 5.5 Patient Report Menu The patient report Menu depicted in figure 9 allows the patient to view their medical report by selecting their patient ID and then clink on the search button in other to view their appointment status from their account as alternative means of viewing their appointment status instead of going to their emails. This status can as well be view from their email but in other to save time, the patient status can be view directly from the user account. When the search button is clink, then the output Menu will be display.
Figure 7: Patient Appointment Menu
The menu shows the patient appointment report where the patient can view the status of their appointment. If their appointments have been confirmed by the system administrator from the admin Menu, the status column will indicate it and a shot message will be displayed at message column. The Menu depicted in figure 10 can be printed out by the patient.
Figure 10: Patient Appointment Report Menu 5.6 Administrator login Menu The administrator interface allows the administrator to be able to implement editing, inserting, deleting and to check the overall result of all registered outpatients. An administrator could be a doctor or nurse who is able to schedule appointment, generate appointment report and view the appointment report of patients that has registered all the necessary information needed. The patient has a patient identification number in order to search for the information stored in the database of the system. The information available will be displayed to the user by the system if he had entered valid registration number. Figure 11 shows the administration login Menu. When an administrator login the following menu displays.
International Journal of Computer Science & Information Technology (IJCSIT) Vol 6, No 4, August 2014
Figure 11: Administrator Menu
Figure 12: Administrator Activity Menu
descriptionView Paperarrow_downwardDownload
Blind 3D Model Watermarking based on Multi-Resolution Representation and Fuzzy Logic
by Sharvari C Tamane

2012, International Journal of Computer Science and Information Technology

Insertion of a text message, audio data or/and an image into another image or 3D model is called as a watermarking process. Watermarking has variety of applications like: Copyright Protection, Owner Identification, Copy Protection and... more
descriptionView Paperarrow_downwardDownload
Governing Information Security in Conjunction with COBIT and ISO 27001
by Tolga Mataracioglu and 
1 more
Sevgi Ozkan Yıldırım

2011, International Journal of Computer Science and Information Technology

27001 together when governing information security in enterprises will be issued.
descriptionView Paperarrow_downwardDownload
Spontaneous speech parsing in travel information inquiring and booking systems
by Pengju Yan

2002, Journal of Computer Science and Technology

Grammar-based parsing is a prevalent method for natural language understanding (NLU) and has been introduced into dialogue systems for spoken language processing (SLP). A robust parsing scheme is proposed in this paper to overcome the... more
descriptionView Paperarrow_downwardDownload
Park-A-Lot: An Automated Parking Management System
by Kuo-pao Yang

2013, Computer Science and Information Technology

This paper describes the architecture and design of Part-A-lot, an automated parking management system. It explains the working dynamics of this prototype system and its communication with the website to find a parking spot before... more
The whole process of sending the data from the sensors and its analysis is done in four steps shown in Figure 1. First the ultrasonic sensors feed the data into the Arduino board which then calculates if the spot is empty or available. If the space is taken it sends the data to the web server. The gate opens or closes based on the sensor designated to the gate. At the same time a client can look at the web interface of the system which interprets the data in the web server to show the availability of the parking space. Figure 1. Park-A-Lot System Workflow
Figure 2. Arduino Program Logic and Code Figure 3. Arduino Mega Board The data communication agent consists of two parts. The first component is the Ethernet shield that is attached to the Arduino board. It provides the system ability to connect to the data-server and use the network connection provided to it. When the device loads up the Ethernet shield checks if a DHCP is available to configure its IP address, if available it gets an IP address from the DHCP but if the DHCP is
the parking spot as taken. The processing unit goes through data provided by each sensor one at a time. The process though increases the processing time, it makes sure that all the sensors are not working at the same time and sending data to the processor increasing the load to the processor. While going through each sensor it updates the data about the sensors to the data-server using the Ethernet shield.
Figure 4. PHP Code to Parse Xml Received from Xively The Xively data server has its own API which can be used to retrieve the data that was sent by the processing unit. The website makes a restful request to the Xively service which in turn returns a XML with the corresponding data for the parking lot. The website then parses the XML shown in Figure 4 which is retrieved from the web service and then makes the logical decision to show the parking space as either occupied or empty.
Figure 5. Web Interface Displays Spot 2 is Taken The processing unit makes a logical decision to open the gate if it finds an object is in front of the sensor for an interval of 5 seconds and close it if it moves away from sensor, after 5 second interval to ensure that the car is not damaged when the gate closes. Whenever an object stays in front of the sensors, the bipolar stepper motor controlled by motor shield rotates 90° to the clockwise direction, and the gate opens. Whenever the object leaves the sensor, the motor shield ensures that the bipolar stepper motor rotates 90° in anti-clockwise direction, so that the gate closes.
descriptionView Paperarrow_downwardDownload
Diphone Speech Synthesis System for Arabic Using MARY TTS
by Hazem El-bakry

2010, International Journal of Computer Science and Information Technology

Concatenative speech synthesis systems generate speech by concatenating small prerecorded speech units which are stored in the speech unit inventory. The most commonly used type of these units is the diphone which is a unit that starts at... more
descriptionView Paperarrow_downwardDownload
Improved Automatic Discovery of Subgoals for Options in Hierarchical Reinforcement Learning
by rohit bansal

2003, Journal of Computer Science and Technology

Options have been shown to be a key step in extending reinforcement learning beyond low-level reactionary systems to higher-level, planning systems. Most of the options research involves hand-crafted options; there has been only very... more
descriptionView Paperarrow_downwardDownload
Stock Trend Prediction Using News Sentiment Analysis
by kalyani joshi

2016, International Journal of Computer Science and Information Technology

Efficient Market Hypothesis is the popular theory about stock prediction. With its failure much research has been carried in the area of prediction of stocks. This project is about taking non quantifiable data such as financial news... more
descriptionView Paperarrow_downwardDownload
Evolutionary Neural Networks algorithm for the Dynamic Frequency Assignment Problem
by zouhair guennoun

2011, International Journal of Computer Science and Information Technology

Wireless communication is used in many different situations such as mobile telephony, radio and TV broadcasting, satellite communication, wireless LANs, and military operations. In each of these situations a frequency assignment problem... more
descriptionView Paperarrow_downwardDownload
SignsWorld; Deeping Into the Silence World and Hearing Its Signs (State of the Art)
by Samaa Shohieb
Automatic speech processing systems are employed more and more often in real environments. Although the underlying speech technology is mostly language independent, differences between languages with respect to their structure and grammar... more
descriptionView Paperarrow_downwardDownload
CLASSIFICATION METHODS OF SKIN BURN IMAGES
by International Journal of Computer Science & Information Technology (IJCSIT)
In this paper, methods to automatically detect and categorize the severity of skin burn images using various classification techniques are compared and presented. A database comprising of skin burn images belonging to patients of diverse... more
Fig 3.1 Superficial dermal burn Superficial burn means injury to the epidermal layer of the skin which normally heals within 5 to 7 days. A common type of superficial burn is sunburn. Figure 3.1 is a example of superficial burn.
Fig 3.2 Partial thickness burn In the partial thickness burn the damage extends up to the dermis layer. As a result, the seriousness of a partial thickness burn depends on how much the dermis has been injured, these burns usually leave scars. Figure 3.2 is an example of partial thickness burns.
In this method of classification comparison of data values is done. Templates belonging to different class of burn images are compared with the new samples. The sample image is classified into the class, whose template matches with the new sample with least error. Figure 4.1 illustrates the template matching method in which the features under selected region are compared with the previously stored values. The process is inherently such that it takes more time to process compute and throughout results when the sample size is more [5]. Figure 4.1: Template Matching Method
Figure 4.2: Choosing k value Given a training set D and a test object z, which is a vector of attribute values and has an unknown class label, the algorithm computes the Euclidean distance between z and all the training objects to determine its nearest neighbor list. It then assigns a class to z by taking the class of the majority of neighboring objects. Ties are broken in an unspecified manner, for example, randomly or by taking the most frequent class in the training set.
International Journal of Computer Science & Information Technology (IJCSIT) Vol 5, No 1, February 2013 The data for training is a set of points (vectors) x;,, along with their categories y;. For some dimension d, the n x;eR“ , and the y; = ¥1. The equation of a hyperplane is < w,x > +b = 0 where, weR“, < w,x > is the inner dot product of w and b is real.
Table 5.2: Template Matching Method
Figure 6.1 shows the chrominance plot of features, mean and DCT values of 120 skin bum images belonging to 3 different categories. Features of 40 images belonging to each category are plotted. (2,1)"" coefficient of DCT values are plotted on x-axis and chrominance mean on y-axis. The distribution of these features allows the classifiers to learn and discriminate the test sample values into different category. In this method of classification, a new test vector containing mean and DCT values of sample images is matched with the previously stored templates belonging to different grades. Depending on the closeness of the match, test sample is categorized. Testing of 120 images, with 40 images from each category is carried out. 20 images from each category are used for training and remaining 20 for testing with cross validation. Overall a classifier efficiency of 66% is incurred with this method, the results are tabulated as shown in the Table 5.2.
Figure 5.1: Classification of gradel and grade2 vectors International Journal of Computer Science & Information Technology (IJCSIT) Vol 5, No 1, February 2013
Figure 5.2: Classification of gradel and grade3 vectors Figure 5.3: Classification of grade2 and grade3 vectors
Table 3.4 Skin burn characteristics Fig 3.3 Full thickness burn
B. IMAGE CLASSIFICATION
descriptionView Paperarrow_downwardDownload
Generating XML based specifications of information systems
by Pavle Mogin and 
1 more
Ivan Luković

2004

This paper outlines a methodology for designing information systems based on XML. The methodology uses XML DTDs to define the design standards, and the structure and constraints of the design specifications. The result of the design... more
descriptionView Paperarrow_downwardDownload
Error Probability Analysis of Free-Space Optical Links with Different Channel Model Under Turbulent Condition
by Tanzia Afrin

2020

Free space optics (FSO) is a promising solution for the need to very high data
descriptionView Paperarrow_downwardDownload
MDA-Based ATL Transformation To Generate MVC 2 Web Models
by Samir Mbarki

2011, International Journal of Computer Science and Information Technology

Development and maintenance of Web application is still a complex and error-prone process. We need integrated techniques and tool support for automated generation of Web systems and a ready prescription for easy maintenance. The MDA... more
descriptionView Paperarrow_downwardDownload
Clustering Posts in Online Discussion Forum Threads
by Dina Said

International Journal of Computer Science

descriptionView Paperarrow_downwardDownload

Related Topics

  • Visual Computing
  • Computer science & Information Technology
  • Computer Graphics
  • Vehicle routing
  • Software Quality
  • Moving Bed Biological Reactors (MBBR)
  • Thesis Proposal
  • Radius Server
  • Telecommunications Law
  • Cyber Laws and Cyber Crime
    • Download research papers for free!
    580 California St., Suite 400
    San Francisco, CA, 94104