SEARCH · Searcharxiv

Results for “cs.OH”

Search indexed arXiv papers on artificial intelligence, large language models, computer vision and robotics. Read source abstracts and follow links to arXiv.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 613 records · Page 34Linked to original sources

arXiv2012

On Some Entertaining Applications of the Concept of Set in Computer Science Course

Some aspects of programming education are examined in this work. It is emphasised, based on the entertainment value, the most appropriate examples are chosen to demonstrate the different language constructions and data structures. Such an example is the demonstrated algorithm for solving the widespread nowadays "Sudoku" puzzle. This is made, because of the connection with the term set and putting it into practice in the programming. Using the so built program there are solved some combinatorial problems, connected to the Sudoku matrices. Key words: Education in programming, programming languages, data structures, set, Sudoku matrix, Sudoku puzzle.

cs.OH↗

arXiv2012

An Entertaining Example for the Usage of Bitwise Operations in Programming

The present study is meant to fill in some information gaps occurring in the most widespread and well-known educational and reference literature about programming. The stress is laid on a very useful instrument - the bitwise operations, topic which is, unfortunately, seldom dealt with in most of the well-known books on programming. In addition, the research is very useful as regards the topic of overloading operators in any Object-oriented programming course. Given some appropriate examples, with the emphasis being laid on some particular and data structures language constructions, the results are quite interesting. The algorithm of solving the popular Sudoku puzzle is one such entertaining example.

cs.OH↗

arXiv2012

Construction of Learning Path Using Ant Colony Optimization from a Frequent Pattern Graph

In an e-Learning system a learner may come across multiple unknown terms, which are generally hyperlinked, while reading a text definition or theory on any topic. It becomes even harder when one tries to understand those unknown terms through further such links and they again find some new terms that have new links. As a consequence they get confused where to initiate from and what are the prerequisites. So it is very obvious for the learner to make a choice of what should be learnt before what. In this paper we have taken the data mining based frequent pattern graph model to define the association and sequencing between the words and then adopted the Ant Colony Optimization, an artificial intelligence approach, to derive a searching technique to obtain an efficient and optimized learning path to reach to a unknown term.

cs.OH↗

arXiv2012

Learners' Quanta based Design of a Learning Management System

In this paper IEEE Learning Technology System Architecture (LTSA) for LMS software has been analyzed. It has been observed that LTSA is too abstract to be adapted in a uniform way by LMS developers. A Learners' Quanta based high level design that satisfies the IEEE LTSA standard has been proposed for future development of efficient LMS software. A hybrid model of learning fitting into LTSA model has also been proposed while designing.

cs.OH↗

arXiv2012

A comparison algorithm to check LTSA Layer 1 and SCORM compliance in e-Learning sites

The success of e-Learning is largely dependent on the impact of its multimedia aided learning content on the learner over the hyper media. The e-Learning portals with different proportion of multimedia elements have different impact on the learner, as there is lack of standardization. The Learning Technology System Architecture (LTSA) Layer 1 deals with the effect of environment on the learner. From an information technology perspective it specifies learner interaction from the environment to the learner via multimedia content. Sharable Content Object Reference Model (SCROM) is a collection of standards and specifications for content of web-based e-learning and specifies how JavaScript API can be used to integrate content development. In this paper an examination is made on the design features of interactive multimedia components of the learning packages by creating an algorithm which will give a comparative study of multimedia component used by different learning packages. The resultant graph as output helps us to analysis to what extent any LMS compliance LTSA layer 1 and SCORM specification.

cs.OH↗

arXiv2012

The milling process monitoring using 3D envelope method

This paper proposes a method to vibration analysis in order to on-line monitoring of milling process quality. Adapting envelope analysis to characterize the milling tool materials is an important contribution to the qualitative and quantitative characterization of milling capacity and a step by modeling the three-dimensional cutting process. An experimental protocol was designed and developed for the acquisition, processing and analyzing three-dimensional signal. The vibration envelope analysis is proposed to detect the cutting capacity of the tool with the optimization application of cutting parameters. The research is focused on Hilbert transform optimization to evaluate the dynamic behavior of the machine/ tool/workpiece.

cs.OH↗

arXiv2012

New Approach of Envelope Dynamic Analysis for Milling Process

This paper proposes a method to vibration analysis in order to on-line monitoring of milling process quality. Adapting envelope analysis to characterize the milling tool materials is an important contribution to the qualitative and quantitative characterization of milling capacity and a step by modeling the three-dimensional cutting process. An experimental protocol was designed and developed for the acquisition, processing and analyzing three-dimensional signal. The vibration envelope analysis is proposed to detect the cutting capacity of the tool with the optimization application of cutting parameters. The research is focused on FFT Fourier transform optimization of vibration analysis and vibration envelope to evaluate the dynamic behavior of the machine/ tool/workpiece

cs.OH↗

arXiv2012

The Knowledge-Based Economy and the Triple Helix Model

1. Introduction - the metaphor of a "knowledge-based economy"; 2. The Triple Helix as a model of the knowledge-based economy; 3. Knowledge as a social coordination mechanism; 4. Neo-evolutionary dynamics in a Triple Helix of coordination mechanism; 5. The operation of the knowledge base; 6. The restructuring of knowledge production in a KBE; 7. The KBE and the systems-of-innovation approach; 8. The KBE and neo-evolutionary theories of innovation; 8.1 The construction of the evolving unit; 8.2 User-producer relations in systems of innovation; 8.3 'Mode-2' and the production of scientific knowledge; 8.4 A Triple Helix model of innovations; 9. Empirical studies and simulations using the TH model; 10. The KBE and the measurement; 10.1 The communication of meaning and information; 10.2 The expectation of social structure; 10.3 Configurations in a knowledge-based economy

cs.OH↗

arXiv2012

Design and Fabrication of Micromachined Resonators

Microelectromechanical system (MEMS) based on-chip resonators offer great potential for sensing and high frequency signal processing applications due to their exceptional features like small size, large frequency-quality factor product, integrability with CMOS ICs, low power consumption etc. This work is mainly aimed at the design, modeling, simulation, and fabrication of micromachined polysilicon disk resonators exhibiting radial-contour mode vibrations. A few other bulk mode modified resonator geometries are also being explored. The resonator structures have been designed and simulated in CoventorWare finite-element platform and fabricated by the PolyMUMPs surface micromachining process.

cs.OH↗

arXiv2012

Towards Maximum Spanning Tree Model in Web 3.0 Design and Development for Students using Discriminant Analysis

Web 3.0 is an evolving extension of the web 2.0 scenario. The perceptions regarding web 3.0 is different from person to person . Web 3.0 Architecture supports ubiquitous connectivity, network computing, open identity, intelligent web, distributed databases and intelligent applications. Some of the technologies which lead to the design and development of web 3.0 applications are Artificial intelligence, Automated reasoning, Cognitive architecture, Semantic web . An attempt is made to capture the requirements of Students inline with web 3.0 so as to bridge the gap between the design and development of web 3.0 applications and requirements among Students. Maximum Spanning Tree modeling of the requirements facilitate the identification of key areas and key attributes in the design and development of software products for Students in Web 3.0 using Discriminant analysis. Keywords : Web 3.0, Discriminant analysis, Design and Development, Model, Maximum Spanning Tree 1.

cs.OH↗

arXiv2012

Innovative SQA Service Maturity Model using CMMI and ITIL

This Journal details a maturity model for SQA services which has been developed during QMS implementation in the IT division of a large multinational organization. The scope of the engagement was to establish a standard set of processes based on CMMI\textregistered and ITIL\textregistered Framework across four business verticals scattered in Europe, United States and Asia. The services of Software Quality Analyst (SQA) from different vendors were leveraged to facilitate implementation of processes which was referred to as the Quality Management System (QMS). To co-ordinate and support QMS implementation, a Software Quality Assurance Group (SQAG) was established at the organizational level. Considering the large number of applications, the business verticals proposed that process implementation should be owned and managed by practitioners themselves so that the mass deployment of QMS can be achieved at a faster rate with the same SQA capacity. This called for a need to devise an innovative implementation solution before moving to a process implementation model which proposed Project Managers implementing processes themself. While there are process models and frameworks available in the market for establishing processes in an organization, there is no model that elaborates activities to be performed by the SQA for effective implementation of processes. SQA service maturity model was proposed as a solution based on CMMI\textregistered and developed to eventually proceed towards a 'Process Implementation Model proposing Project Managers implementing processes themself'. SQA Service Maturity Model is a Software Quality Assurance implementation framework that enables organisations to increase Efficiencies in Software Quality Assurance, reduce the Cost of Defects and ultimately Increasing Return on Investment in IT.

cs.OH↗

arXiv2012

Computer applications in clinical psychology

The computer-assisted analysis is not currently a novelty, but a necessity in all areas of psychology. A number of studies that examine the limits of the computer assisted and analyzed interpretations, also its advantages. A series of studies aim to assess how the computer assisting programs are able to establish a diagnosis referring to the presence of certain mental disorders. We will present the results of one computer application in clinical psychology regarding the assessment of Theory of Mind capacity by animation.

cs.OH↗

arXiv2012

Verification and Diagnosis Infrastructure of SoC HDL-model

This article describes technology for diagnosing SoC HDL-models, based on transactional graph. Diagnosis method is focused to considerable decrease the time of fault detection and memory for storage of diagnosis matrix by means of forming ternary relations in the form of test, monitor, and functional component. The following problems are solved: creation of digital system model in the form of transaction graph and multi-tree of fault detection tables, as well as ternary matrices for activating functional components in tests, relative to the selected set of monitors; development of a method for analyzing the activation matrix to detect the faults with given depth and synthesizing logic functions for subsequent embedded hardware fault diagnosing.

cs.OH↗

arXiv2012

Performance Evaluation of Biometric Template Update

Template update allows to modify the biometric reference of a user while he uses the biometric system. With such kind of mechanism we expect the biometric system uses always an up to date representation of the user, by capturing his intra-class (temporary or permanent) variability. Although several studies exist in the literature, there is no commonly adopted evaluation scheme. This does not ease the comparison of the different systems of the literature. In this paper, we show that using different evaluation procedures can lead in different, and contradictory, interpretations of the results. We use a keystroke dynamics (which is a modality suffering of template ageing quickly) template update system on a dataset consisting of height different sessions to illustrate this point. Even if we do not answer to this problematic, it shows that it is necessary to normalize the template update evaluation procedures.

cs.OH↗

arXiv2012

Analysis of neighbour and isolated node of intersection area based geocasting protocol (IBGP) in VANET

Geocasting is a special variant of multicasting, where data packet or message is transmitted to a predefined geographical location i.e., known as geocast region. The applications of geocasting in VANET are to disseminate information like, collision warning, advertising, alerts message, etc. In this paper, we have proposed a model for highway scenario where the highway is divided into number of cells. The intersection area between two successive cells is computed to find the number of common nodes. Therefore, probabilistic analysis of the nodes present and void occurrence in the intersection area is carried out. Further, we have defined different forwarding zones to restrict the number of participated nodes for data delivery. Number of nodes present and void occurrence in the different forwarding zones have also been analysed based on various node density in the network to determine the successful delivery of data. Our analytical results show that in a densely populated network, data can be transmitted with low radio transmission range. In a densely populated network smaller forwarding zones will be selected for data delivery.

cs.OH↗

arXiv2012

An Optimum Time Quantum Using Linguistic Synthesis for Round Robin Scheduling Algorithm

In Round Robin CPU scheduling algorithm the main concern is with the size of time quantum and the increased waiting and turnaround time. Decision for these is usually based on parameters which are assumed to be precise. However, in many cases the values of these parameters are vague and imprecise. The performance of fuzzy logic depends upon the ability to deal with Linguistic variables. With this intent, this paper attempts to generate an Optimal Time Quantum dynamically based on the parameters which are treated as Linguistic variables. This paper also includes Mamdani Fuzzy Inference System using Trapezoidal membership function, results in LRRTQ Fuzzy Inference System. In this paper, we present an algorithm to improve the performance of round robin scheduling algorithm. Numerical analysis based on LRRTQ results on proposed algorithm show the improvement in the performance of the system by reducing unnecessary context switches and also by providing reasonable turnaround time.

cs.OH↗

arXiv2012

System on Programable Chip for Performance Estimation of Loom Machine

System on programmable chip for the performance estimation of loom machine, which calculates the efficiency and meter count for weaved cloth automatically. Also it calculates the efficiency of loom machine. Previously the same was done using manual process which was not efficient. This article is intended for loom machines which are not modern.

cs.OH↗

arXiv2012

Modified Quine-McCluskey Method

The digital gates are basic electronic component of any digital circuit. Digital circuit should be simplified in order to reduce its cost by reducing number of digital gates required to implement it. To achieve this, we use Boolean expression that helps in obtaining minimum number of terms and does not contain any redundant pair. Karnaugh map(K-map) and Quine-McCluskey(QM) methods are well known methods to simplify Boolean expression. K-map method becomes complex beyond five variable Boolean expression. Quine-McCluskey method is computer based technique for minimization of Boolean function and it is faster than K-map method. This paper proposes E-sum based optimization to Quine-McCluskey Method to increase its performance by reducing number of comparisons between mintermlist in determination of prime implicants. Modified Quine-McCluskey method(MQM) can be implemented to any number of variable.

cs.OH↗