Catalogue Search | MBRL
Are you sure you want to remove the book from the shelf?
{{itemTitle}}
2,238
result(s) for
"Data types (Computer science)"
Sort by:
SQL server advanced data types : JSON, XML, and beyond
Deliver advanced functionality faster and cheaper by exploiting SQL Server's ever-growing amount of built-in support for modern data formats. Learn about the growing support within SQL Server for operations and data transformations that have previously required third-party software and all the associated licensing and development costs. Benefit through a better understanding of what can be done inside the database engine with no additional costs or development time invested in outside software. Widely used types such as JSON and XML are well-supported by the database engine. The same is true of hierarchical data and even temporal data. Knowledge of these advanced types is crucial to unleashing the full power that's available from your organization's SQL Server database investment. SQL Server Advanced Data Types explores each of the complex data types supplied within SQL Server. Common usage scenarios for each complex data type are discussed, followed by a detailed discussion on how to work with each data type. Each chapter demystifies the complex data and you learn how to use the data types most efficiently. The book offers a practical guide to working with complex data, using real-world examples to demonstrate how each data type can be leveraged. Performance considerations are also discussed, including the implementation of special indexes such as XML indexes and spatial indexes. What You'll Learn: Understand the implementation of basic data types and why using the correct type is so important Work with XML data through the XML data type Construct XML data from relational result sets Store and manipulate JSON data using the JSON data type Model and analyze spatial data for geographic information systems Define hierarchies and query them efficiently through the HierarchyID type.
Book
Blockchain basics : a non-technical introduction in 25 steps
In 25 concise steps, you will learn the basics of blockchain technology. No mathematical formulas, program code, or computer science jargon are used. No previous knowledge in computer science, mathematics, programming, or cryptography is required. Terminology is explained through pictures, analogies, and metaphors.This book bridges the gap that exists between purely technical books about the blockchain and purely business-focused books. It does so by explaining both the technical concepts that make up the blockchain and their role in business-relevant applications.What You'll LearnWhat the blockchain isWhy it is needed and what problem it solvesWhy there is so much excitement about the blockchain and its potentialMajor components and their purposeHow various components of the blockchain work and interactLimitations, why they exist, and what has been done to overcome themMajor application scenariosWho This Book Is ForEveryone who wants to get a general idea of what blockchain technology is, how it works, and how it will potentially change the financial system as we know it
eBook
Selecting critical features for data classification based on machine learning methods
Feature selection becomes prominent, especially in the data sets with many variables and features. It will eliminate unimportant variables and improve the accuracy as well as the performance of classification. Random Forest has emerged as a quite useful algorithm that can handle the feature selection issue even with a higher number of variables. In this paper, we use three popular datasets with a higher number of variables (Bank Marketing, Car Evaluation Database, Human Activity Recognition Using Smartphones) to conduct the experiment. There are four main reasons why feature selection is essential. First, to simplify the model by reducing the number of parameters, next to decrease the training time, to reduce overfilling by enhancing generalization, and to avoid the curse of dimensionality. Besides, we evaluate and compare each accuracy and performance of the classification model, such as Random Forest (RF), Support Vector Machines (SVM), K-Nearest Neighbors (KNN), and Linear Discriminant Analysis (LDA). The highest accuracy of the model is the best classifier. Practically, this paper adopts Random Forest to select the important feature in classification. Our experiments clearly show the comparative study of the RF algorithm from different perspectives. Furthermore, we compare the result of the dataset with and without essential features selection by RF methods
varImp(),
Boruta, and Recursive Feature Elimination (RFE) to get the best percentage accuracy and kappa. Experimental results demonstrate that Random Forest achieves a better performance in all experiment groups.
Journal Article
The skin cancer classification using deep convolutional neural network
This paper addresses the demand for an intelligent and rapid classification system of skin cancer using contemporary highly-efficient deep convolutional neural network. In this paper, we mainly focus on the task of classifying the skin cancer using ECOC SVM, and deep convolutional neural network. RGB images of the skin cancers are collected from the Internet. Some collected images have noises such as other organs, and tools. These images are cropped to reduce the noise for better results. In this paper, an existing, and pre-trained AlexNet convolutional neural network model is used in extracting features. A ECOC SVM clasifier is utilized in classification the skin cancer. The results are obtained by executing a proposed algorithm with a total of 3753 images, which include four kinds of skin cancers images. The implementation result shows that maximum values of the average accuracy, sensitivity, and specificity are 95.1 (squamous cell carcinoma), 98.9 (actinic keratosis), 94.17 (squamous cell carcinoma), respectively. Minimum values of the average in these measures are 91.8 (basal cell carcinoma), 96.9 (Squamous cell carcinoma), and 90.74 (melanoma), respectively.
Journal Article
Advanced Data Structures and Algorithms
Solve complex problems by performing analysis of algorithms or selecting suitable techniques for optimal performance
Key Features
? Get familiar with various concepts and techniques of advanced data structures to solve real-world problems.
? Learn how to evaluate the efficiency and performance of an algorithm in terms of time and space complexity.
? A practical guide for students and faculty members who are interested in this important subject area of Computer Science.
Description
\"Advanced Data Structures and Algorithms\" is an important subject area in Computer Science that covers more complex and advanced topics related to data structures and algorithms. This book will teach you how to analyze algorithms to handle the difficulties of sophisticated programming. It will then help you understand how advanced data structures are used to store and manage data efficiently. Moving on, it will help you explore and work with Divide and Conquer techniques, Dynamic programming, and Greedy algorithms. Lastly, the book will focus on various String Matching Algorithms such as naïve string matching algorithms, Knuth–Morris–Pratt(KMP) Algorithm, and Rabin-Karp Algorithm. By the end of the book, you will be able to analyze various algorithms with time and space complexity to choose the best suitable algorithms for a given problem.
What you will learn
? Understand how to examine an algorithm's time and space complexity.
? Explore complex data structures like AVL tree, Huffman coding, and many more.
? Learn how to solve larger problems using Divide and Conquer techniques.
? Identify the most optimal solution using Greedy and Dynamic Programming.
? Learn how to deal with real-world problems using various approaches of the String Matching algorithms.
Who this book is for
This book is aligned with the curriculum of the Computer Engineering program offered by Mumbai University. The book is designed not only for Computer Engineering and Information Technology students but also for anyone who wants to learn about advanced data structures and analysis of algorithms.
Table of Contents
1. Analysis of Algorithm
2. Advanced Data Structures
3. Divide and Conquer
4. Greedy Algorithms
5. Dynamic Algorithms and NP-Hard and NP-Complete
6. String Matching
eBook
Fine-grained vehicle type classification using lightweight convolutional neural network with feature optimization and joint learning strategy
Vehicle type classification (VTC) plays an important role in today’s intelligent transportation. Previous VTC systems usually run on a monitoring center’s host machine due to the models’ complexity, which consume lots of computing resources and have poor real-time performance. If these systems are deployed to embedded terminals by making the model lightweight while ensuring accuracy, then the problem can be addressed. To this end, we propose a fine-grained VTC method using lightweight convolutional neural network with feature optimization and joint learning strategy. Firstly, a lightweight convolutional network with feature optimization (LWCNN-FO) is designed. We use depthwise separable convolution to reduce network parameters. Besides, the SENet module is added to obtain the important degree of each feature channel automatically through the sample-based self-learning, which can improve recognition accuracy with less network parameters growth. In addition, considering both between-class similarity and intra-class variance, this paper adopts the joint learning strategy combining softmax loss and contrastive-center loss to class vehicle types, thereby improving model’s fine-grained classification ability. We also build a dataset, called Car-159, consisting of 7998 pictures for 159 vehicle types, to evaluate our method. Compared with the state-of-the-art methods, experimental results show that our method can effectively decrease model’s complexity while maintaining accuracy.
Journal Article
Adaptive fuzzy fault-tolerant control using Nussbaum-type function with state-dependent actuator failures
This paper presents an adaptive fuzzy fault-tolerant tracking control for a class of unknown multi-variable nonlinear systems, with external disturbances, unknown control sign, and actuator faults. By employing fuzzy logic systems, the unknown nonlinear dynamics and the state-dependent actuator faults are approximated, and by utilizing a Nussbaum-type function, the issue of unknown control sign is solved. The proposed control scheme is based on two forms, an adaptive fuzzy controller along with a robust controller that is equipped with a Nussbaum-type gain function, which guarantees stability with the boundedness of all signals involved in the closed-loop system. To prove the accuracy, and the effectiveness of the proposed control scheme, a simulation example on two-inverted pendulums system is carried out.
Journal Article
A common-sense guide to data structures and algorithms : level up your core programming skills
If you thought that data structures and algorithms were all just theory, you're missing out on what they can do for your code. Learn to use Big O Notation to make your code run faster by orders of magnitude. Choose from data structures such as hash tables, trees, and graphs to increase your code's efficiency exponentially. With simple language and clear diagrams, this book makes this complex topic accessible, no matter your background. This new edition features practice exercises in every chapter, and new chapters on topics such as dynamic programming and heaps and tries. Get the hands-on info you need to master data structures and algorithms for your day-to-day work.Algorithms and data structures are much more than abstract concepts. Mastering them enables you to write code that runs faster and more efficiently, which is particularly important for today's web and mobile apps. Take a practical approach to data structures and algorithms, with techniques and real-world scenarios that you can use in your daily production code, with examples in JavaScript, Python, and Ruby. This new and revised second edition features new chapters on recursion, dynamic programming, and using Big O in your daily work.Use Big O notation to measure and articulate the efficiency of your code, and modify your algorithm to make it faster. Find out how your choice of arrays, linked lists, and hash tables can dramatically affect the code you write. Use recursion to solve tricky problems and create algorithms that run exponentially faster than the alternatives. Dig into advanced data structures such as binary trees and graphs to help scale specialized applications such as social networks and mapping software. You'll even encounter a single keyword that can give your code a turbo boost. Practice your new skills with exercises in every chapter, along with detailed solutions.Use these techniques today to make your code faster and more scalable.
eBook
Analysis of Blockchain technology: pros, cons and SWOT
Any online transaction that involves digital money is a bit of a challenge these days with the rising threats of hackers trying to steal bank details posted online. This leads to the invention of various kinds of crypto-currency, Bitcoin being one of them. The technology behind using the Bitcoin is popularly called as Blockchain. Blockchain is a digitized, de-centralized, public ledger of all crypto-currency transaction/s. Blockchain tries to create and share all the online transactions, stored in a distributed ledger, as a data structure on a network of computers. It validates the transactions using peer-to-peer network of computers. It allows users to make and verify transactions immediately without a central authority. Blockchain is a transaction database which contains information about all the transactions ever executed in the past and works on Bitcoin protocol. In this analysis paper we discussed what is Blockchain?, SWOT analysis of BC, Types of BC and how Blockchain works along with its advantages and disadvantages.
Journal Article