AI Community AI Community
Name: Towards AI Legal Name: Towards AI, Inc. Description: Towards AI is the world's leading artificial intelligence (AI) and technology publication. Read by thought-leaders and decision-makers around the world. Phone Number: +1-650-246-9381 Email: pub@towardsai.net
228 Park Avenue South New York, NY 10003 United States
Website: Publisher: https://towardsai.net/#publisher Diversity Policy: https://towardsai.net/about Ethics Policy: https://towardsai.net/about Masthead: https://towardsai.net/about
Name: Towards AI Legal Name: Towards AI, Inc. Description: Towards AI is the world's leading artificial intelligence (AI) and technology publication. Founders: Roberto Iriondo, , Job Title: Co-founder and Advisor Works for: Towards AI, Inc. Follow Roberto: X, LinkedIn, GitHub, Google Scholar, Towards AI Profile, Medium, ML@CMU, FreeCodeCamp, Crunchbase, Bloomberg, Roberto Iriondo, Generative AI Lab, Generative AI Lab Denis Piffaretti, Job Title: Co-founder Works for: Towards AI, Inc. Louie Peters, Job Title: Co-founder Works for: Towards AI, Inc. Louis-François Bouchard, Job Title: Co-founder Works for: Towards AI, Inc. Cover:
Towards AI Cover
Logo:
Towards AI Logo
Areas Served: Worldwide Alternate Name: Towards AI, Inc. Alternate Name: Towards AI Co. Alternate Name: towards ai Alternate Name: towardsai Alternate Name: towards.ai Alternate Name: tai Alternate Name: toward ai Alternate Name: toward.ai Alternate Name: Towards AI, Inc. Alternate Name: towardsai.net Alternate Name: pub.towardsai.net
5 stars – based on 497 reviews

Frequently Used, Contextual References

TODO: Remember to copy unique IDs whenever it needs used. i.e., URL: 304b2e42315e

Resources

Take our 85+ lesson From Beginner to Advanced LLM Developer Certification: From choosing a project to deploying a working product this is the most comprehensive and practical LLM course out there!

Publication

Knowledge of RAID-based System Storage Architectures
Latest   Machine Learning

Knowledge of RAID-based System Storage Architectures

ifttt-user
0 like
July 17, 2023
Share this post

Last Updated on July 17, 2023 by Editorial Team

Author(s): Deepankar Varma

Originally published on Towards AI.

The amount of data produced and saved in the modern digital age is growing exponentially. To handle this data explosion, organizations need storage systems that are not only reliable and cost-effective but also provide high-performance levels. This is where RAID-based storage systems come into play. RAID (Redundant Array of Independent Disks) is a technology that allows multiple physical disks to be combined into a single logical unit for improved performance, reliability, and capacity. This article will explore the different RAID-based storage system architectures and their characteristics.

Table Of Contents:

  1. Introduction
  2. RAID Levels
  3. RAID Controllers
  4. RAID Arrays
  5. Benefits of RAID
  6. Drawbacks of RAID
  7. Conclusion

Introduction:

The data storage technology known as RAID (Redundant Array of Independent Disks) combines numerous physical hard drives into a single logical unit. This logical unit provides improved performance, reliability, and capacity compared to traditional single-disk storage systems. RAID technology achieves this by distributing data across multiple disks, providing redundancy for data protection, and increasing overall storage capacity.
There are several different RAID levels, each with its benefits and drawbacks. The most commonly used RAID levels are RAID 0, 1, 5, and RAID 6.

RAID Levels:

Several RAID levels are available, each with its advantages and disadvantages. The most common RAID levels are:

RAID 0: RAID 0 provides improved performance and capacity by distributing data across multiple disks without providing any redundancy. In RAID 0, data is split into blocks and written to two or more disks simultaneously, which increases the read/write speed. However, since there is no redundancy, all data in the RAID array is lost if one disk fails. RAID 0 is commonly used when performance is more critical than data redundancy, such as gaming or video editing.

RAID 1: RAID 1 provides data redundancy by mirroring data across two or more disks. In RAID 1, data is written to two or more disks simultaneously, providing redundancy in case one disk fails. This redundancy offers increased data protection but comes at the cost of reduced capacity, as only half of the total disk space is available for storage. RAID 1 is commonly used when data protection is more important than performance in financial or medical systems.

RAID 5: RAID 5 provides both data redundancy and increased capacity by distributing data across three or more disks and using parity data to provide redundancy. In RAID 5, data is split into blocks and written to three or more disks simultaneously, with the parity data being distributed across all disks. This parity data provides redundancy in case one disk fails, allowing the RAID array to continue operating without data loss. RAID 5 provides increased capacity compared to RAID 1, as only one disk’s worth of space is used for parity data. However, RAID 5 is more susceptible to data loss if multiple disks fail simultaneously. RAID 5 is commonly used when performance and data redundancy is essential, such as in file servers.

RAID Configuration

RAID 6: RAID 6 is similar to RAID 5 but has an additional parity information set, providing double redundancy. This means that two disks can fail simultaneously without any data loss. RAID 6 requires at least four disks to implement and provides excellent data protection, but at the cost of reduced performance due to the extra parity calculations.

RAID 10: RAID 10, also known as RAID 1+0, combines RAID 1 and RAID 0. Compared to RAID 0 or RAID 1 alone, it improves performance and fault tolerance. In RAID 10, data is divided into blocks, and each block is mirrored onto a different disk. Then, the mirrored blocks are striped across additional disks. This allows for high performance and fault tolerance but requires at least four disks.

RAID 50: RAID 50 combines RAID 5 and RAID 0. It strips data across multiple RAID 5 arrays, each with distributed parity, and then strips the resulting blocks across additional disks. This allows for high performance and fault tolerance but requires at least six disks.

RAID 60: RAID 60 combines RAID 6 and RAID 0. It strips data across multiple RAID 6 arrays, each with two sets of distributed parity, and then strips the resulting blocks across additional disks. This provides high performance and excellent fault tolerance but requires at least eight disks.

RAID Controllers:

RAID controllers are hardware or software components responsible for managing the RAID array. They provide a layer of abstraction between the operating system and the disks, presenting the array as a single logical disk to the operating system. RAID controllers can be either software-based or hardware-based.
Software-based RAID controllers are implemented using the operating system’s built-in RAID capabilities. These controllers have the advantage of being inexpensive and easy to set up, as they do not require any additional hardware. However, software-based RAID controllers may impact system performance, as they rely on the host CPU to perform the parity calculations.

RAID Controllers

On the other hand, hardware-based RAID controllers are specialized components designed specifically for managing RAID arrays. These controllers typically have their processor and memory, which offloads the RAID calculations from the host CPU. Hardware-based RAID controllers provide better performance and reliability than software-based controllers but are more expensive.

RAID Arrays:

RAID arrays can be implemented using either internal or external disks. Internal disks are installed inside the server or storage system, while external disks are housed in an external enclosure that connects to the server or storage system via a cable.

Internal RAID arrays are typically used in servers or storage systems with multiple drive bays. The drives are installed directly into the server or storage system, and the RAID controller manages the array.

External RAID arrays are often used when additional storage is required, but there is limited space for other internal disks. External displays typically connect to the server or storage system via a high-speed interface such as Fibre Channel, SAS, or iSCSI.

When used in a storage system, RAID (Redundant Array of Independent Disks) provides several benefits and drawbacks. Here are some of the main advantages and disadvantages of RAID technology:

Benefits of RAID:

1. Improved performance: RAID technology distributes data across multiple disks, allowing faster reading and writing speeds.

2. Data redundancy: Many RAID levels provide data redundancy, meaning that the data can be recovered from the other disks in the array if one disk fails. This provides increased data protection and prevents data loss.

3. Increased capacity: RAID technology provides increased storage capacity compared to traditional single-disk storage systems by combining multiple disks into a single logical unit.

4. Hot-swapping: Many RAID systems support hot-swapping, which means that a failed disk can be replaced while the system is still running without needing to shut it down.

5. Cost-effective: Depending on the RAID level used, RAID technology can be a cost-effective solution for data storage, especially compared to high-capacity, high-performance single disks.

Drawbacks of RAID:

1. Complexity: RAID technology can be complex to set up and manage, especially for larger arrays. This requires specialized knowledge and experience.

2. Cost: Some RAID levels, such as RAID 5 or RAID 6, require additional hardware (such as a dedicated RAID controller), which can add to the overall cost of the system.

3. Reduced performance: Some RAID levels, such as RAID 1 or RAID 5, can result in reduced performance due to the overhead of data parity calculations.

4. Data loss: While RAID provides data redundancy, there is still a risk of data loss if multiple disks fail simultaneously or the RAID controller fails.

5. Limited scalability: Some RAID levels have limited scalability, meaning they cannot be easily expanded beyond a certain number of disks. This can determine the growth potential of a RAID-based storage system.

Conclusion:

RAID-based storage systems have become the norm in many industries, including business, scientific research, and media production. By using multiple disks in a single logical unit, RAID provides improved performance, reliability, and capacity compared to traditional single-disk storage systems. Different RAID levels offer varying performance levels, fault tolerance, and ability, allowing organizations to choose the class that best suits their needs. The operating system sees the array as a single logical disc thanks to the layer of abstraction that RAID controllers put between it and the discs. Depending on the organization’s requirements, RAID arrays can be implemented using either internal or external disks.

RAID Levels Explained

When designing a RAID-based storage system, it is crucial to consider the performance, reliability, and cost-effectiveness of different RAID levels and the capabilities of other RAID controllers.

It is also essential to consider the organization’s requirements, such as the amount of data being generated and the speed at which it needs to be accessed. By carefully selecting the appropriate RAID level and components, organizations can build a storage system that meets their needs while providing high performance, reliability, and capacity.

Join thousands of data leaders on the AI newsletter. Join over 80,000 subscribers and keep up to date with the latest developments in AI. From research to projects and ideas. If you are building an AI startup, an AI-related product, or a service, we invite you to consider becoming a sponsor.

Published via Towards AI

JOIN NOW!

Gain exclusive access to top AI tutorials, courses, and books to elevate your skills.

    We won't send you spam. Unsubscribe at any time.
    , , , , ,
    Share this post

    Related posts

    LAI #66: Information Theory for People in a Hurry
    Artificial Intelligence, Latest, Machine Learning

    LAI #66: Information Theory for People in a Hurry

    Towards AI Editorial Team
    1 like
    WHAT IS MCP BY ANTHROPIC?(MODEL CONTEXT PROTOCOL)
    Data Science, Latest, Machine Learning

    WHAT IS MCP BY ANTHROPIC?(MODEL CONTEXT PROTOCOL)

    Adarsh Menon
    0 like
    FactoryBERT: An AI That Understands Manufacturing
    Data Science, Latest, Machine Learning

    FactoryBERT: An AI That Understands Manufacturing

    Saif Ali Kheraj
    1 like
    🔎 Decoding LLM Pipeline — Step 1: Input Processing & Tokenization
    Artificial Intelligence, Latest, Machine Learning

    🔎 Decoding LLM Pipeline — Step 1: Input Processing & Tokenization

    Ecem Karaman
    1 like

    Feedback ↓

    Sign Up for the Course
    `; } else { console.error('Element with id="subscribe" not found within the page with class "home".'); } } }); // Remove duplicate text from articles /* Backup: 09/11/24 function removeDuplicateText() { const elements = document.querySelectorAll('h1, h2, h3, h4, h5, strong'); // Select the desired elements const seenTexts = new Set(); // A set to keep track of seen texts const tagCounters = {}; // Object to track instances of each tag elements.forEach(el => { const tagName = el.tagName.toLowerCase(); // Get the tag name (e.g., 'h1', 'h2', etc.) // Initialize a counter for each tag if not already done if (!tagCounters[tagName]) { tagCounters[tagName] = 0; } // Only process the first 10 elements of each tag type if (tagCounters[tagName] >= 2) { return; // Skip if the number of elements exceeds 10 } const text = el.textContent.trim(); // Get the text content const words = text.split(/\s+/); // Split the text into words if (words.length >= 4) { // Ensure at least 4 words const significantPart = words.slice(0, 5).join(' '); // Get first 5 words for matching // Check if the text (not the tag) has been seen before if (seenTexts.has(significantPart)) { // console.log('Duplicate found, removing:', el); // Log duplicate el.remove(); // Remove duplicate element } else { seenTexts.add(significantPart); // Add the text to the set } } tagCounters[tagName]++; // Increment the counter for this tag }); } removeDuplicateText(); */ // Remove duplicate text from articles function removeDuplicateText() { const elements = document.querySelectorAll('h1, h2, h3, h4, h5, strong'); // Select the desired elements const seenTexts = new Set(); // A set to keep track of seen texts const tagCounters = {}; // Object to track instances of each tag // List of classes to be excluded const excludedClasses = ['medium-author', 'post-widget-title']; elements.forEach(el => { // Skip elements with any of the excluded classes if (excludedClasses.some(cls => el.classList.contains(cls))) { return; // Skip this element if it has any of the excluded classes } const tagName = el.tagName.toLowerCase(); // Get the tag name (e.g., 'h1', 'h2', etc.) // Initialize a counter for each tag if not already done if (!tagCounters[tagName]) { tagCounters[tagName] = 0; } // Only process the first 10 elements of each tag type if (tagCounters[tagName] >= 10) { return; // Skip if the number of elements exceeds 10 } const text = el.textContent.trim(); // Get the text content const words = text.split(/\s+/); // Split the text into words if (words.length >= 4) { // Ensure at least 4 words const significantPart = words.slice(0, 5).join(' '); // Get first 5 words for matching // Check if the text (not the tag) has been seen before if (seenTexts.has(significantPart)) { // console.log('Duplicate found, removing:', el); // Log duplicate el.remove(); // Remove duplicate element } else { seenTexts.add(significantPart); // Add the text to the set } } tagCounters[tagName]++; // Increment the counter for this tag }); } removeDuplicateText(); //Remove unnecessary text in blog excerpts document.querySelectorAll('.blog p').forEach(function(paragraph) { // Replace the unwanted text pattern for each paragraph paragraph.innerHTML = paragraph.innerHTML .replace(/Author\(s\): [\w\s]+ Originally published on Towards AI\.?/g, '') // Removes 'Author(s): XYZ Originally published on Towards AI' .replace(/This member-only story is on us\. Upgrade to access all of Medium\./g, ''); // Removes 'This member-only story...' }); //Load ionic icons and cache them if ('localStorage' in window && window['localStorage'] !== null) { const cssLink = 'https://code.ionicframework.com/ionicons/2.0.1/css/ionicons.min.css'; const storedCss = localStorage.getItem('ionicons'); if (storedCss) { loadCSS(storedCss); } else { fetch(cssLink).then(response => response.text()).then(css => { localStorage.setItem('ionicons', css); loadCSS(css); }); } } function loadCSS(css) { const style = document.createElement('style'); style.innerHTML = css; document.head.appendChild(style); } //Remove elements from imported content automatically function removeStrongFromHeadings() { const elements = document.querySelectorAll('h1, h2, h3, h4, h5, h6, span'); elements.forEach(el => { const strongTags = el.querySelectorAll('strong'); strongTags.forEach(strongTag => { while (strongTag.firstChild) { strongTag.parentNode.insertBefore(strongTag.firstChild, strongTag); } strongTag.remove(); }); }); } removeStrongFromHeadings(); "use strict"; window.onload = () => { /* //This is an object for each category of subjects and in that there are kewords and link to the keywods let keywordsAndLinks = { //you can add more categories and define their keywords and add a link ds: { keywords: [ //you can add more keywords here they are detected and replaced with achor tag automatically 'data science', 'Data science', 'Data Science', 'data Science', 'DATA SCIENCE', ], //we will replace the linktext with the keyword later on in the code //you can easily change links for each category here //(include class="ml-link" and linktext) link: 'linktext', }, ml: { keywords: [ //Add more keywords 'machine learning', 'Machine learning', 'Machine Learning', 'machine Learning', 'MACHINE LEARNING', ], //Change your article link (include class="ml-link" and linktext) link: 'linktext', }, ai: { keywords: [ 'artificial intelligence', 'Artificial intelligence', 'Artificial Intelligence', 'artificial Intelligence', 'ARTIFICIAL INTELLIGENCE', ], //Change your article link (include class="ml-link" and linktext) link: 'linktext', }, nl: { keywords: [ 'NLP', 'nlp', 'natural language processing', 'Natural Language Processing', 'NATURAL LANGUAGE PROCESSING', ], //Change your article link (include class="ml-link" and linktext) link: 'linktext', }, des: { keywords: [ 'data engineering services', 'Data Engineering Services', 'DATA ENGINEERING SERVICES', ], //Change your article link (include class="ml-link" and linktext) link: 'linktext', }, td: { keywords: [ 'training data', 'Training Data', 'training Data', 'TRAINING DATA', ], //Change your article link (include class="ml-link" and linktext) link: 'linktext', }, ias: { keywords: [ 'image annotation services', 'Image annotation services', 'image Annotation services', 'image annotation Services', 'Image Annotation Services', 'IMAGE ANNOTATION SERVICES', ], //Change your article link (include class="ml-link" and linktext) link: 'linktext', }, l: { keywords: [ 'labeling', 'labelling', ], //Change your article link (include class="ml-link" and linktext) link: 'linktext', }, pbp: { keywords: [ 'previous blog posts', 'previous blog post', 'latest', ], //Change your article link (include class="ml-link" and linktext) link: 'linktext', }, mlc: { keywords: [ 'machine learning course', 'machine learning class', ], //Change your article link (include class="ml-link" and linktext) link: 'linktext', }, }; //Articles to skip let articleIdsToSkip = ['post-2651', 'post-3414', 'post-3540']; //keyword with its related achortag is recieved here along with article id function searchAndReplace(keyword, anchorTag, articleId) { //selects the h3 h4 and p tags that are inside of the article let content = document.querySelector(`#${articleId} .entry-content`); //replaces the "linktext" in achor tag with the keyword that will be searched and replaced let newLink = anchorTag.replace('linktext', keyword); //regular expression to search keyword var re = new RegExp('(' + keyword + ')', 'g'); //this replaces the keywords in h3 h4 and p tags content with achor tag content.innerHTML = content.innerHTML.replace(re, newLink); } function articleFilter(keyword, anchorTag) { //gets all the articles var articles = document.querySelectorAll('article'); //if its zero or less then there are no articles if (articles.length > 0) { for (let x = 0; x < articles.length; x++) { //articles to skip is an array in which there are ids of articles which should not get effected //if the current article's id is also in that array then do not call search and replace with its data if (!articleIdsToSkip.includes(articles[x].id)) { //search and replace is called on articles which should get effected searchAndReplace(keyword, anchorTag, articles[x].id, key); } else { console.log( `Cannot replace the keywords in article with id ${articles[x].id}` ); } } } else { console.log('No articles found.'); } } let key; //not part of script, added for (key in keywordsAndLinks) { //key is the object in keywords and links object i.e ds, ml, ai for (let i = 0; i < keywordsAndLinks[key].keywords.length; i++) { //keywordsAndLinks[key].keywords is the array of keywords for key (ds, ml, ai) //keywordsAndLinks[key].keywords[i] is the keyword and keywordsAndLinks[key].link is the link //keyword and link is sent to searchreplace where it is then replaced using regular expression and replace function articleFilter( keywordsAndLinks[key].keywords[i], keywordsAndLinks[key].link ); } } function cleanLinks() { // (making smal functions is for DRY) this function gets the links and only keeps the first 2 and from the rest removes the anchor tag and replaces it with its text function removeLinks(links) { if (links.length > 1) { for (let i = 2; i < links.length; i++) { links[i].outerHTML = links[i].textContent; } } } //arrays which will contain all the achor tags found with the class (ds-link, ml-link, ailink) in each article inserted using search and replace let dslinks; let mllinks; let ailinks; let nllinks; let deslinks; let tdlinks; let iaslinks; let llinks; let pbplinks; let mlclinks; const content = document.querySelectorAll('article'); //all articles content.forEach((c) => { //to skip the articles with specific ids if (!articleIdsToSkip.includes(c.id)) { //getting all the anchor tags in each article one by one dslinks = document.querySelectorAll(`#${c.id} .entry-content a.ds-link`); mllinks = document.querySelectorAll(`#${c.id} .entry-content a.ml-link`); ailinks = document.querySelectorAll(`#${c.id} .entry-content a.ai-link`); nllinks = document.querySelectorAll(`#${c.id} .entry-content a.ntrl-link`); deslinks = document.querySelectorAll(`#${c.id} .entry-content a.des-link`); tdlinks = document.querySelectorAll(`#${c.id} .entry-content a.td-link`); iaslinks = document.querySelectorAll(`#${c.id} .entry-content a.ias-link`); mlclinks = document.querySelectorAll(`#${c.id} .entry-content a.mlc-link`); llinks = document.querySelectorAll(`#${c.id} .entry-content a.l-link`); pbplinks = document.querySelectorAll(`#${c.id} .entry-content a.pbp-link`); //sending the anchor tags list of each article one by one to remove extra anchor tags removeLinks(dslinks); removeLinks(mllinks); removeLinks(ailinks); removeLinks(nllinks); removeLinks(deslinks); removeLinks(tdlinks); removeLinks(iaslinks); removeLinks(mlclinks); removeLinks(llinks); removeLinks(pbplinks); } }); } //To remove extra achor tags of each category (ds, ml, ai) and only have 2 of each category per article cleanLinks(); */ //Recommended Articles var ctaLinks = [ /* ' ' + '

    Subscribe to our AI newsletter!

    ' + */ '

    Take our 85+ lesson From Beginner to Advanced LLM Developer Certification: From choosing a project to deploying a working product this is the most comprehensive and practical LLM course out there!

    '+ '

    Towards AI has published Building LLMs for Production—our 470+ page guide to mastering LLMs with practical projects and expert insights!

    ' + '
    ' + '' + '' + '

    Note: Content contains the views of the contributing authors and not Towards AI.
    Disclosure: This website may contain sponsored content and affiliate links.

    ' + 'Discover Your Dream AI Career at Towards AI Jobs' + '

    Towards AI has built a jobs board tailored specifically to Machine Learning and Data Science Jobs and Skills. Our software searches for live AI jobs each hour, labels and categorises them and makes them easily searchable. Explore over 10,000 live jobs today with Towards AI Jobs!

    ' + '
    ' + '

    🔥 Recommended Articles 🔥

    ' + 'Why Become an LLM Developer? Launching Towards AI’s New One-Stop Conversion Course'+ 'Testing Launchpad.sh: A Container-based GPU Cloud for Inference and Fine-tuning'+ 'The Top 13 AI-Powered CRM Platforms
    ' + 'Top 11 AI Call Center Software for 2024
    ' + 'Learn Prompting 101—Prompt Engineering Course
    ' + 'Explore Leading Cloud Providers for GPU-Powered LLM Training
    ' + 'Best AI Communities for Artificial Intelligence Enthusiasts
    ' + 'Best Workstations for Deep Learning
    ' + 'Best Laptops for Deep Learning
    ' + 'Best Machine Learning Books
    ' + 'Machine Learning Algorithms
    ' + 'Neural Networks Tutorial
    ' + 'Best Public Datasets for Machine Learning
    ' + 'Neural Network Types
    ' + 'NLP Tutorial
    ' + 'Best Data Science Books
    ' + 'Monte Carlo Simulation Tutorial
    ' + 'Recommender System Tutorial
    ' + 'Linear Algebra for Deep Learning Tutorial
    ' + 'Google Colab Introduction
    ' + 'Decision Trees in Machine Learning
    ' + 'Principal Component Analysis (PCA) Tutorial
    ' + 'Linear Regression from Zero to Hero
    '+ '
    ', /* + '

    Join thousands of data leaders on the AI newsletter. It’s free, we don’t spam, and we never share your email address. Keep up to date with the latest work in AI. From research to projects and ideas. If you are building an AI startup, an AI-related product, or a service, we invite you to consider becoming a sponsor.

    ',*/ ]; var replaceText = { '': '', '': '', '
    ': '
    ' + ctaLinks + '
    ', }; Object.keys(replaceText).forEach((txtorig) => { //txtorig is the key in replacetext object const txtnew = replaceText[txtorig]; //txtnew is the value of the key in replacetext object let entryFooter = document.querySelector('article .entry-footer'); if (document.querySelectorAll('.single-post').length > 0) { //console.log('Article found.'); const text = entryFooter.innerHTML; entryFooter.innerHTML = text.replace(txtorig, txtnew); } else { // console.log('Article not found.'); //removing comment 09/04/24 } }); var css = document.createElement('style'); css.type = 'text/css'; css.innerHTML = '.post-tags { display:none !important } .article-cta a { font-size: 18px; }'; document.body.appendChild(css); //Extra //This function adds some accessibility needs to the site. function addAlly() { // In this function JQuery is replaced with vanilla javascript functions const imgCont = document.querySelector('.uw-imgcont'); imgCont.setAttribute('aria-label', 'AI news, latest developments'); imgCont.title = 'AI news, latest developments'; imgCont.rel = 'noopener'; document.querySelector('.page-mobile-menu-logo a').title = 'Towards AI Home'; document.querySelector('a.social-link').rel = 'noopener'; document.querySelector('a.uw-text').rel = 'noopener'; document.querySelector('a.uw-w-branding').rel = 'noopener'; document.querySelector('.blog h2.heading').innerHTML = 'Publication'; const popupSearch = document.querySelector$('a.btn-open-popup-search'); popupSearch.setAttribute('role', 'button'); popupSearch.title = 'Search'; const searchClose = document.querySelector('a.popup-search-close'); searchClose.setAttribute('role', 'button'); searchClose.title = 'Close search page'; // document // .querySelector('a.btn-open-popup-search') // .setAttribute( // 'href', // 'https://medium.com/towards-artificial-intelligence/search' // ); } // Add external attributes to 302 sticky and editorial links function extLink() { // Sticky 302 links, this fuction opens the link we send to Medium on a new tab and adds a "noopener" rel to them var stickyLinks = document.querySelectorAll('.grid-item.sticky a'); for (var i = 0; i < stickyLinks.length; i++) { /* stickyLinks[i].setAttribute('target', '_blank'); stickyLinks[i].setAttribute('rel', 'noopener'); */ } // Editorial 302 links, same here var editLinks = document.querySelectorAll( '.grid-item.category-editorial a' ); for (var i = 0; i < editLinks.length; i++) { editLinks[i].setAttribute('target', '_blank'); editLinks[i].setAttribute('rel', 'noopener'); } } // Add current year to copyright notices document.getElementById( 'js-current-year' ).textContent = new Date().getFullYear(); // Call functions after page load extLink(); //addAlly(); setTimeout(function() { //addAlly(); //ideally we should only need to run it once ↑ }, 5000); }; function closeCookieDialog (){ document.getElementById("cookie-consent").style.display = "none"; return false; } setTimeout ( function () { closeCookieDialog(); }, 15000); console.log(`%c 🚀🚀🚀 ███ █████ ███████ █████████ ███████████ █████████████ ███████████████ ███████ ███████ ███████ ┌───────────────────────────────────────────────────────────────────┐ │ │ │ Towards AI is looking for contributors! │ │ Join us in creating awesome AI content. │ │ Let's build the future of AI together → │ │ https://towardsai.net/contribute │ │ │ └───────────────────────────────────────────────────────────────────┘ `, `background: ; color: #00adff; font-size: large`); //Remove latest category across site document.querySelectorAll('a[rel="category tag"]').forEach(function(el) { if (el.textContent.trim() === 'Latest') { // Remove the two consecutive spaces (  ) if (el.nextSibling && el.nextSibling.nodeValue.includes('\u00A0\u00A0')) { el.nextSibling.nodeValue = ''; // Remove the spaces } el.style.display = 'none'; // Hide the element } }); // Add cross-domain measurement, anonymize IPs 'use strict'; //var ga = gtag; ga('config', 'G-9D3HKKFV1Q', 'auto', { /*'allowLinker': true,*/ 'anonymize_ip': true/*, 'linker': { 'domains': [ 'medium.com/towards-artificial-intelligence', 'datasets.towardsai.net', 'rss.towardsai.net', 'feed.towardsai.net', 'contribute.towardsai.net', 'members.towardsai.net', 'pub.towardsai.net', 'news.towardsai.net' ] } */ }); ga('send', 'pageview'); -->