УСТРОЙСТВО И СПОСОБ ОБРАБОТКИ ИНФОРМАЦИИ

Изобретение относится к устройствам и способам обработки информации, в которых информация записывается, например, на дисковом носителе записи для однократной записи. Техническим результатом является возможность перезаписывания носителя записи, изначально предназначенного для однократной записи, и возможность контроля полезной остающейся емкости этого носителя. Устройство содержит управляющее средство для обеспечения соответствия физического положения данных файлов логическому положению, формирования таблицы этого соответствия и управления таким образом при изменении физического положения соотношением указанного соответствия, записывающее средство, вычислительное средство, сравнивающее средство и средство вывода. Способ описывает работу данного устройства. 2 с. и 5 з.п.ф-лы, 32 ил.

ИНТЕГРАЦИЯ РЕКЛАМЫ И РАСШИРЯЕМЫЕ ТЕМЫ ДЛЯ ОПЕРАЦИОННЫХ СИСТЕМ

Предложены компьютерная система и способ обеспечения интеграции рекламы с пользовательским интерфейсом. Устройство содержит компонент получения, компонент выбора и компонент конфигурации. Компонент получения получает рекламный контент, включающий в себя рекламу продукта или услуги, от рекламодателя. Рекламный контент приспособлен для изменения пользовательского интерфейса, ассоциированного с операционной системой. Компонент выбора выбирает рекламный контент для отображения и определяет незанятое пространство отображения, связанное с пользовательским интерфейсом, ассоциированным с операционной системой, для отображения рекламного контента. Компонент конфигурации, который поставляет рекламный контент операционной системе для представления в сочетании с упомянутым незанятым пространством отображения пользовательского интерфейса, ассоциированного с операционной системой. Техническим результатом является облегчение интеграции расширяемых тем с рабочим столом. 2 н. и 17 з.п. ф-лы, 11 ил.

КОНТЕКСТНЫЙ ПОИСК В МУЛЬТИМЕДИЙНОМ КОНТЕНТЕ

Изобретение относится к компьютерной технике. Технический результат – повышение эффективности контекстного поиска в мультимедийном контенте. Способ осуществления контекстного поиска в мультимедийном контенте, содержащий: извлечение элементов предметной области, ассоциированных с мультимедийным контентом; формирование для перезаписи запроса вариантов перезаписи на основе извлеченных элементов предметной области и терминов в запросе; предоставление вариантов перезаписи запроса в поисковый механизм; количественная оценка вариантов перезаписи запроса на основе характеристик наборов результатов, полученных в результате упомянутого предоставления; ранжирование вариантов перезаписи запроса на основе их количественных показателей; перезапись запроса на основе возможного варианта перезаписи запроса с конкретным рангом; предоставление набора результатов из поискового механизма на основе перезаписанного запроса. 3 н. и 15 з.п. ф-лы, 5 ил.

СИСТЕМА ПОИСКА ИДЕНТИЧНЫХ ВЫБОРОК СИГНАЛОВ

Изобретение относится к автоматике и вычислительной технике и может использоваться в системах ассоциативной обработки и хранения информации. Цель - расширение функциональных возможностей. Система содержит входной блок памяти, блок памяти вспомогательный блок памяти, регистр, вычитатель, блок умножения, сумматор, счетчик, счетчик адресов вспомогательного блока памяти, счетчик равных чисел, группы элементов И, ИЛИ, дополнительный вычитатель, устройство хранения условных распределений, устройство управления. Система поиска осуществляет поиск идентичных выборок, увеличивая последовательно на единицу длину выборки и используя поочередно последовательности управляющих сигналов для поиска выборок нечетной и четной длины. 1 з. п. ф-лы, 8 ил., 3 табл.

УСТРОЙСТВО СЕЛЕКЦИИ МЕНЬШЕГО ИЗ ДВУХ ДВОИЧНЫХ ЧИСЕЛ

Изобретение относиться к области вычислительной техники. Технический результат заключается в упрощении схемы устройства за счет уменьшения ее цены по Квайну при сохранении функциональных возможностей. Устройство селекции меньшего из двух двоичных чисел предназначено для обработки n-разрядных двоичных чисел, задаваемых двоичными сигналами, и может быть использовано в системах цифровой вычислительной техники как средство логической обработки многозначных операндов. Устройство содержит элементов И (111,…, 13(n–1), 11n), элементов ИЛИ (212,…, 24(n–1), 21n, 22n) и элементов НЕ (31,…, 3n–1). 1 ил.

УСТРОЙСТВО СОРТИРОВКИ ДВОИЧНЫХ ЧИСЕЛ

Изобретение относится к вычислительной технике и может быть использовано в системах цифровой вычислительной техники как средство предварительной обработки информации. Техническим результатом является расширение функциональных возможностей за счет правильного распознавания переменной x1=0. Устройство содержит n-1 постоянных запоминающих устройств, n-1 регистров и 2n-2 инверторов и выполнено с возможностью сортировки n m-разрядных двоичных чисел, задаваемых двоичными сигналами, а также с возможностью распознавания сортируемых чисел по принципу «дубликат - не дубликат». 2 табл., 2 ил.

СИСТЕМА ПОВТОРНОГО УПОРЯДОЧЕНИЯ

Изобретение относится к системе повторного упорядочения для повторного упорядочения элементов данных потока элементов данных, передаваемых через последовательное соединение первого коммутационного узла, буферного регистра и второго коммутационного узла. Техническим результатом является устранение на выходе средства повторного упорядочения дрожания задержки, вызванное буфером, которoe достигается тем, что система содержит средство повторного упорядочения, соединенное со вторым коммутационным узлом, схему измерения задержки, соединенную с буферным регистром и приспособленную для измерения временной задержки, которой подвергается каждый из элементов данных в буферном регистре; средство для передачи таким образом измеренной задержки для каждого элемента данных на средство повторного упорядочения. После переключения элемента данных вторым коммутационным узлом средство повторного упорядочения подвергает этот элемент данных временной задержке, равной разности между заданной постоянной величиной ...

УСТРОЙСТВО СЕЛЕКЦИИ ДВОИЧНЫХ ЧИСЕЛ

Изобретение предназначено для выполнения селекции и идентификации меньшего, либо селекции и идентификации большего, либо селекции произвольно назначенного из двух n-разрядных двоичных чисел, задаваемых двоичными сигналами, и может быть использовано в системах цифровой вычислительной техники как средство предварительной обработки информации. Техническим результатом является уменьшение аппаратурных затрат. Устройство содержит n групп элементов, каждая из которых содержит пять мажоритарных элементов и элемент НЕ. 1 ил., 1 табл.

Устройство для поиска числа, ближайшего к заданному

Изобретение относится к автоматике и вычислительной технике и может быть использовано в цифровых вычислительных системах, например в системах осуществляющих контроль радиационной обстановки окружающей среды. Цель изобретения - упрощение устройства при анализе многоразрядных чисея Устройство содержит регистры 1 и 2 большего и меньшего значений, схемы сравнения 3, 4. коммутатор 5, регистр заданного числа 10, триггеры 12,13,14.15. 4 ил.

АВТОНОМНЫЙ МОБИЛЬНЫЙ КОМПЛЕКС ИДЕНТИФИКАЦИИ ЛИЧНОСТИ

Изобретение относится к медицинской технике. Автономный мобильный комплекс идентификации личности содержит электронно-вычислительное устройство, по меньшей мере одно устройство передачи данных, по меньшей мере одно устройство считывания биометрических данных, по меньшей мере одно мобильное устройство и автономный источник питания. Электронно-вычислительное устройство и устройство передачи данных выполняются в едином герметичном корпусе с герметично закрывающимися портами для подсоединения периферийных устройств и источников питания. Устройством считывания биометрических данных является одна или несколько видеокамер. Мобильным устройством является любое мобильное устройство с возможностью установки на него программного обеспечения для дистанционного управления комплексом. При этом видеопоток с устройства считывания биометрических данных с помощью устройства передачи данных поступает в электронно-вычислительное устройство для создания «шаблона» биометрических данных субъекта и автоматического ...

СИСТЕМА АССОЦИАТИВНОГО ПОИСКА ПО КЛЮЧУ

Система ассоциативного поиска по ключу относится к автоматике и вычислительной технике. Цель изобретения - расширение функциональных возможностей системы путем обеспечения возможности ассоциативного поиска по ключу. Система содержит входной блок памяти, блок памяти, вспомогательный блок памяти, регистр, вычислитель, блок умножения, сумматор, счетчик адресов вспомогательного блока памяти, счетчик равных числе, блок синхронизации, две группы элементов И, группу элементов ИЛИ, элементы И и ИЛИ, информационные входы, входы начальной установки и запуска, выходы запроса числа, синхронизации и конца работы и выходы координаты. В отличие от известного устройства система содержит блок памяти ключа, дополнительный выключатель, счетчик длины ключа, восемь групп элементов И и пять групп элементов ИЛИ.

КОМАНДА СОРТИРОВКИ И ОБЪЕДИНЕНИЯ ДЛЯ УНИВЕРСАЛЬНОГО ПРОЦЕССОРА

СИСТЕМА АССОЦИАТИВНОГО ПОИСКА ПО КЛЮЧУ

Система ассоциативного поиска по ключу относится к автоматике и вычислительной технике. Цель изобретения - расширение функциональных возможностей системы путем обеспечения возможности ассоциативного поиска по ключу. Система содержит входной блок памяти, блок памяти, вспомогательный блок памяти, регистр, вычислитель, блок умножения, сумматор, счетчик адресов вспомогательного блока памяти, счетчик равных числе, блок синхронизации, две группы элементов И, группу элементов ИЛИ, элементы И и ИЛИ, информационные входы, входы начальной установки и запуска, выходы запроса числа, синхронизации и конца работы и выходы координаты. В отличие от известного устройства система содержит блок памяти ключа, дополнительный выключатель, счетчик длины ключа, восемь групп элементов И и пять групп элементов ИЛИ.

ЭЛЕМЕНТ СОРТИРОВОЧНОЙ СЕТИ

Изобретение относится к автоматике и цифровой вычислительной технике и предназначено для построения на его основе сетей сортировки и коммутации данных, а также может быть использовано в устройствах управления ЭВМ и устройствах обработки данных. Цель изобретения - расширение функциональных возможностей за счет возможности производить сортировку по возрастанию или убыванию, а также уменьшение аппаратных затрат. Элемент сортировочной сети, содержащий схему сравнения, мультиплексор, коммутаторы, информационные входы чисел А и В, управляющие входы, задающие режимы сортировки и коммутации сети, информационные выходы, позволяет, в зависимости от комбинации, подаваемой на управляющие входы, производить сортировку входных данных по убыванию или возрастанию, а также в режиме коммутации передавать входные данные на выход элемента сортировочной сети прямо либо накрест, независимо от значений входных данных.

СПОСОБ ОБРАБОТКИ ВЫСОКОЧАСТОТНОГО СИГНАЛА

Изобретение относится к области обработки данных. Технический результат изобретения заключается в повышении скорости обработки высокочастотного сигнала. Способ обработки высокочастотного сигнала, осуществляемый с применением системы обработки высокочастотного сигнала, состоящей из устройства сбора данных для токовых сигналов и устройства сбора данных для вибрационных сигналов, соединённых с устройством для обработки и передачи данных, при этом входные формирователи сигнала промышленного оборудования подключены к аналого-цифровым преобразователям устройства сбора данных для токовых сигналов и устройства сбора данных для вибрационных сигналов, характеризуется тем, что к аналого-цифровым преобразователям устройств сбора данных подключают входные формирователи сигнала промышленного оборудования, после чего посылают высокочастотный сигнал от устройства сбора данных к устройству для обработки и передачи данных, затем высокочастотный сигнал преобразуют в колонковое представление и разделяют на ...

Устройство для сортировки чисел

Устройство для определения наименьшего из @ чисел

Устройство для упорядочивания чисел

Устройство для выбора наименьшего из @ чисел

Устройство для сортировки чисел

УСТРОЙСТВО ДЛЯ СОРТИРОВКИ ЧИСЕЛ по авт.св. 9 1051531, отличающееся тем, что, с цепью расширения функциональных воз1« жностей за счет формирования условий сортировки в зависимости от величины сортируемого числа, оно содержит группу элементов ШШ, группу элементов НЕ, группы элементов И и группу выходных элементов ИЛИ, выходы которых подключены к соответствующим установочным входам третьего регистра, входы выходных элементов ИЛИ группы соединены с выходами соответствуннцих разрядов элементов И всех групп сортировки, информационные входы которых подключены к шинам ввода допустимой погрешности сравнения соответствующей группы , входы разрешения записи разрядов элементов И -и группы, где i 1,2... Я, ...

Устройство отождествления наборов данных

Изобретение относится к вычислительной технике и радиолокации и предназначено для установления попарного соответствия (отождествления) между двума наборами данных, например пеленгами целей (углами места и азимута), полученными двумя измерителями . Цель изобретения - расширение функциональных возможностей за ...

Устройство для классификации чисел

Устройство для определения локальных экстремумов

УСТРОЙСТВО ДЛЯ ОПРЕДЕЛЕНИЯ Л01еАЛЬНЫХ ЭКСТРЕМУМОВ, содержащее распределитель импульсов, два регистра , две схемы сравнения, регистры порога и номера канала, счетчик номера канала, причем входы кода выборки исходной функции устройства подключены к установочным входам первого регистра, выходы которого соединены с первой группой входов первой схемы сравнения и с установочными входами второго регистра, выходы которого подключены к второй группе входов первой схемы сравнения и первой группе входов второй схемы сравнения, выходы задания порога устройства соединены с установочными входами регистра порога, выходы которого подключены к второй группе входов второй схемы сравнения, вход запуска устройства подключен к входу запуска распределителя импульсов , пёрвьй, второй и третий выходы которого соединены соответственно с входами разрешения записи первого и второго регистров.и счетным входом счетчика номера канала, выходы разрядов которого соединены с установочными входами регистра номера канала, ...

Устройство для сортировки чисел

Изобретение относится к области вычислительной техники и может буть использовано в информационно-поисковых системах и системах статистической обработки данных. Цель изобретения - расширение функциональных возможностей за счет интегрального и дифференциального распределения чисел. Устройство содержит входной регистр ...

Устройство для сортировки чисел

Изобретение относится к автоматике и вычислительной технике и может быть использовано в устройствах обработки данных. Цель изобретения - повьпнение быстродействия. Устройство содержит регистр сдвига 1, три триггера 3, 2, 9, элемент задержки 5, три элемента И 4, 6, 8 и элемент- Р1ПИ 7. Предлагаемое устройство осуществляет прием двоичных последовательностей и контроль их длины. В слзгчае верной длины принятая двоичная последовательность может быть выдана в некоторое обрабатьшающее устройство. В случае kopOTKoro сообщения устройство заканчивает работу после приема признака конца сообщения , а в случае длинного - после приема числа разрядов, равного требуемому . 1 ил.

Устройство для сортировки информации

Предлагаемое устройство относится к области вычислительной техники и может быть использовано, например , при построении отладочных комплексов для определения частотности команд в отладочной программе. Цель изобретения - упрощение устройства. Устройство содержит триггеры 4 и 5, ...

Устройство для упорядочения массива чисел

Изобретение относится к области автоматики и вычислительной техники и может быть использовано при реализации технических средств ЭВМ. Цель изобретения - уменьшение аппаратур- , ных затрат с увеличением количества сортируемых чисел. Устройство содержит три регистра, в которые записаны адрес начала и конца зоны ЗУ и анализируемое число, регистр результата, счетчики, схемы сравнения, элементы И, ИЛИ, триггеры, группы элементов И.переписи, группы выходных элементов И, группы выходных элементов ИЛИ. Предлагаемое устройство позволяет организовать запись отсортированных чисел с адреса начала зоны в ЗУ„общего назначения и заканчивает работу при совпадении адреса текущего числа с адресом конца зоны сортировки. 1 ил. о (Л ...

Устройство для сортировки двоичных чисел

Устройство для перебора перестановок

УСТРОЙСТВО ДЛЯ ПЕРЕБОРА ПЕРЕСТАНОВОК, содержащее п-1 счетчиков , где п- число переставляемых элементов, две группы элементов И, матрицу элементов И, первый элемент ИЛИ, первую группу элемен- тов ИЛИ, два элемента задержки, регистр сдвига и п регистров, причем выход каждого л-го ...

Диодно-магнитный дешифратор

Многоканальное устройство для выборки информации

Устройство для записи и считывания последовательных кодов

УCTPOЙCTBO OБPAБOTKИ ИHФOPMAЦИИ KOMПЛEKCHOЙ ИЗMEPИTEЛЬHOЙ CИCTEMЫ

INFORMATION SORTER

NUMBER SORTER

Переключательная матрица

Устройство для определения максимального числа в последовательности случайных чисел

DEVICE FOR ARRANGING IN SEQUENCE NUMBER FILES

Устройство для сортировки чисел

Изобретение относится к вычислительной технике и может быть использовано в специализированных устройствах , предназначенных для сортировки массивов данных, поступающих параллельными кодами одно за другим в реальном масштабе времени,. Целью изобретения является расширение функциональных возможностей за счет обеспечения возможности задания диа / е f тава сл в , ...

Устройство для определения значений функции принадлежности

Устройство для сортировки информации

Устройство для ввода информации

Изобретение относится к области автоматики, вычислительной техники и может быть использовано в системах ввода информации на терминальные устройства с различного рода носителей, в том числе, с перфоленты. Целью изобретения является расширение области применения за счет возможности селективной выборки алфавитно-цифровой информации из потока данных. Устройство содержит блок 1 считывания. блок 8 памяти, два регистра 7, 9, мультиплексор 2, триггер 5, генератор 6 и распределитель 4 импульсов. Цель изобретения достигается тем, что с помощью микрокоманд, располо- женньк в ячейках, запоминающее устройство производит считьшание алфавитно-цифровой информации и селекти- рование ее от служебной информации, что позволяет использовать устройст-, во в режиме разделения терминальных устройств путем закрепления за каждым из них информации в соответствующих зонах ИЛИ загрузки информации в устройства, содержащие элементы , требующие раздельной загрузки, например устройства, содержащие множество ОЗУ ИЛИ регистров ...

Устройство для выделения выборочной медианы из @ чисел

Изобретение относится к автоматике и вычислительной технике и может быть использовано при создании цифровых систем переработки информации . Целью изобретения является повышение быстродействия. Устройство содержит m прямых преобразователей 2п-разрядного кода в 2 -разрядный код (где m - количество п-разрядных двоичных чисел), один обратный преобразователь 5 2 -разрядного кода в т-1 п-разрядный код, -т- групп узлов анализа по 3,4-2 анализа в группе. Прямой преобразователь кодов преобразует п-разрядный двоичный код А в 2 -разрядный код, содержащий единицы в первых А разрядах и нули в остальных . разрядах. Схема устройства позволяет проводить одновременный анализ всех разрядов анализируемых чисел. 6 ил. (Л Гт ...

Устройство для загрузки защищеннных файлов

Изобретение относится к вычислительной технике и может быть ис- п-ользовано в вычислительных системах для связи процессоров с запоминающими устройствами, а также в автоматиг. зированнык банках данных. Цель изобретения - расширение функциональных возможностей устройства за счет фор (Л ...

Устройство для формирования гистограммы

УСТРОЙСТВО ДЛЯ ФОРМИРОВАНИЯ ГИСТОГРАММЫ, содержащее блок элементов ИЛИ, N регистров границ интервалов , N схем сравнения, первую группу блоков элементов и и регистр приема числа, группа входов которого является первым информационньам входом устройства, а выход подключен к первым входам N ckeM сравнения , первый выход каждой из которых подключен к первому .входу соответствующего блока элементов и первой группй, отличающееся тем, что, с целью повышения быстродействия и расширения функциональных возможностей эа счет определения положения числа на числовой оси, разделенной на N+1 интервал, оно содержит группу элементов И, счетчик числа формирований гистограммы, вторую группу блоков элементов И, эл.;мент задержки, триггер, элемент И, блок деления, счетчик импульсов опроса , дешифратор, N+1 счетчиков и блок памяти, входы которого подключены к выходам соответствующих блоков элементов И второй группы, информационные входы которых соединены соответственно с выходами блока деления, разрядные входы ...

Устройство для упорядочения @ чисел

Изобретение относится к автоматике и вычислительной технике и может быть использовано при построении средств обработки данных. Цель изобретения расширение области применения за счет сортировки чисел большей разрядности. Устройство содержит N блоков 1 выделения наименьшего числа, (N-1) блоков 2 исключения наименьшего числа и (N-2) групп элементов ИЛИ 3. Блок выделения наименьшего числа содержит матрицу (N.M) схем анализа. Схема анализа содержит два элемента ИЛИ и элемент ИСКЛЮЧАЮЩЕЕ ИЛИ. Устройство построено по комбинационной схеме, не требует синхронизации, отличается простотой, однородностью структуры и высоким быстродействием. Быстродействие устройства зависит от количества одновременно обрабатываемых чисел. 1 з.п. ф-лы, 4 ил.

Устройство для сортировки информации

Изобретение относится к автоматике и вычислительной технике. Цель изобретения - расширение области применения устройства путем обеспечения возможности сортировки информации по признакам. Устройство содержит блоки памяти (БП) 1, 2, счетчики 3, 4, входной регистр 5, регистры признака 6, размера 7, адреса 8, перезаписи 9, коррекции адреса 10, группу элементов И 11, мультиплексор 12, триггер 13, блок синхронизации 14 и имеет информационные входы 15, входы разрешения записи информации 16, признака 17, размера 18, количества страниц 19, входы выбора режима 20, вход окончания записи-считывания 21, информационные выходы 22, выходы готовности 23 и синхронизации 24. Устройство последовательно принимает пачки слов, первое из которых является признаком, а следующие - данными, относящимися к этому признаку. Данные размещаются в БП 1, логически разбитом на страницы, количество которых не меньше, чем количество возможных значений признака. Адрес первой свободной ячейки каждой страницы содержится в БП ...

Устройство для сортировки чисел

Изобретение относится к области вычислительной техники и может быть использовано для построения устройств сортировки, ранжировки и упорядочиЁания чисел. Цель изобретения - повышение быстродействия. Устройство содержит блок 1 управления, первую, вторую, третью, четвертую и пятую группы из п элементов И 2, 5, б, 8, 10, где п - количество сортируемых чисел, п регистров 7 сдвига, первую и вторую группы из п элементов ИЛИ 3, J1, первую и вторую группы из п триггеров 5, 9, элемент И-ИЛИ 12 и триггер № задержки. Повышение быстродействия устройства происходит за счет того , что начало поиска следующего по рангу числа совмещено с исключением из просмотра уже найденного максимального числа . 1 з.п. ф-лы, 2 ил.

Устройство для сортировки чисел

Изобретение относится к автоматике и вычислительной технике. Цель изобретения - повышение быстродействия. Устройство содержит блоки сравнения, счетчики, IK- триггери, группы элементов ИЛИ, группу элементов ИЛИ-НЕ, группу элементов И, группы коммутаторов, элементы НЕ, информационные входы, тактовый вход, выход окончания работы, информационные выходы . БС сравнивают каждое число с каждым, счетчики подсчитывают количество равных чисел. По каждому тактовому сигналу на один информационный выход устройства выдаются последовательно все числа в порядке убывания, а на другой информационный выход - количество этих чисел в массиве минус единица. 4 ил ...

Устройство для сортировки чисел

Изобретение относится к автоматике и вычислительной технике. Цель изобретения - повышение быстродействия. Устройство содержит регистры 1, блоки сравнения 2, блоки выбора кодов 3, коммутатор 4, счетчики 5, дешифраторы 6, блок загрузки 21, элементы ИЛИ 24, 25, 26, 29, элементы НЕ 27, 28, триггер 30. Первоначально 1-м числам присваиваются ранги, равные I, которые записываются в счетчики 5. Затем числа, ранги которых отличаются на ёдЫй- цу, попарно сравниваются друг с другом; и в результате сравнения меняются их ранги. Сравнивание чисел производится до тех пор, пока ранги не перестают изменяться. 6 ил., 3 табл. w/TTT ...

Устройство для вычисления экстремумов

Изобретение относится к вычислительной технике и может быть использовано для цифровой фильтрации сигналов и изображений или в устройствах распознавания сигналов. Цель изобретения - расширение функциональных возможностей устройства. Устройство содержит входные регистры 1,2,3 и коммутаторы 4,5, три компараторных переключателя 6,7,8, элементы 9 задержки, элементы И 10, блок 11 выбора номера числа , сумматор 12 трех чисел и генератор 13 тактовых импульсов. За счет параллельно- конвейерного режима работы устройство обладает возможностью работы в реальном времени. 2 ил.

Устройство для упорядочения массива чисел

Изобретение относится к автоматике и вычислительной технике и может быть использовано при реализации технических средств ЭВМ. Целью изобретения является расширение функциональных возможностей устройства за счет упорядочения по нескольким разрядам. Устройство содержит регистры начала и конца зоны, счетчики начала и конца зоны, блок подготовки адресов начала и конца зоны, блок формирования номера разряда упорядочения массива чисел , блок памяти номера разряда, элементы сравнения, мультиплексоры, группы элементов И, ИЛИ. Устройство осуществляет упорядочение массива чисел по нескольким расположенным подряд двоичным разрядам . 2 з.п. ф-лы, 4 ил., 1 табл.

Устройство для определения числа, ближайшего к заданному

Устройство для определения положения числа на числовой оси

УСТРОЙСТВО ДЛЯ ОПРЕДЕЛЕМЮ ПОЛОЖЕНИЯ ЧИСЛА НА ЧИСЛОВОЙ ОСИ, содержащее и счетчиков, п элементов НЕ, 2п элементов И и узел приоритета , где п - число границ диапазонов, причем установочный вход кадцого счетчика подключен к шине начальной установки устройства, информационный вход устройства подключен к первым входам элементов И, с первого по п-й, вторые входы которых подключены к выходам соответствующих элементов НЕ, вход i-го элемента НЕ (где i 1, 2, ..,,h) подключен к выходу ( i + п )-го элемента И, входы которого подключены к выходам разрядов i -го счетчика, выход i-ro элемента И подключен к счетному входу i-ro счетчика, информационные входы узла приоритета соединены с выходами элементов И, с (п+ 1)-го по 2п -и, а выходы являются выходами указателя диапазона устройства, о тличающееся тем, что, с целью уменьшения аппаратурных затрат и устранения ложных срабатываний, третий вход первого элемента И подключен к третьему входу устройства и к управляющему входу узла приоритета , а выходы элементов ...

Устройство для выбора упорядоченной последовательности данных

УСТРОЙСТВО ДЛЯ BbfBOPA УПОРЯДОЧЕННОЙ ПОСЛЕДОВАТЕЛЬНОСТИ ДАННЫХ, содержащее п входных регистров, п дешифраторов,и регистров результата, (пп| групп элементов Н, h групп элементов ИЛИ, коммутатор, выходы которого являются выходами устройства, блок анализа, включающий поразрядные узлы анализа, каждый из которых содержит (п-1 )элементов И, (г -1 j элеMiEHTOB № и многовходовый элемент ИЛИ, причем выходы каждого i-го регистра, входы которого являются входами i-го сортируемого числа устройства , где ,2,...,h, п - число сортируемых чисел, соединены с входами i-ro дешифратора и с информационными входами i-x элементов И каждой -й группы, j-и выход каждого -го дешифратора соединен с i-M входом j-ro поразрядного узла анализа, где ,2,...,m , m- число разрядов сортируемых чисел, в каждом J-M поразрядном узле анализа k-й вход, где 1 1 ,2,... ..., (п-1)через k-й элемент НЕ соединен с (k+l)-ми входами k-ro, (k + l)-го,. .., ()-го элементов И, каждый р-й вход поразрядного узла анализа подключен к первому ...

Устройство для перебора сочетаний, перестановок и размещений

Изобретение относится к вычислительной технике и позволяет значительно повысить быстродействие при формировании сочетаний и размещений. Устройство содержит генератор I тактовых иь1пульсов, п узлов 4 выделения первой едини1Уз1, каждый из которых состоит из группы 5 элементов ИЛИ и группы 6 элементов И, п - 1 групп 7 элементов ИСКЛЮЧАЮЩЕЕ ИЛИ и п элементов И-ИЛИ 8, выходы 9. В режиме перебора перестановок сигналы снимаются с выходов блока 2 формирования перестановок , в режиме перебора сочетаний сигналы снимаются с выходов блока 3 формирования сочетаний,в режиме перебора размещений сигналы снимаются с выходов 9. Блоком 3 выбирается сочетание элементов И-ИПИ 8, а блок 2 осуществляет все перестановки очередности появления импульсов на выходах выбранных элементов И-ИЛИ 8. 1 ил. 1C (Л ...

Устройство для сортировки чисел

Устройство для ввода информации

Изобретение относится к области вычислительной техники и может быть использо.вано в системах ввода информации на терминальные устройства с различного вида носителей, в том числе с перфоленты. Цель изобретения - увеличение быстродействия устройства . Устройство содержит блок 1 счи- тьшания, регистр 2, распределитель 3 импульсов, триггер 4, генератор 5 импульсов , блок 6 постоянной памяти. Цель изобретения достигается за счет параллельной дешифрации блоком 6 служебных и информационных символов, поступающих из блока 1 считьтания. 2 табл.2. ил.

Устройство для сортировки чисел

Устройство для выделения среднего из нечетного количества чисел

Изобретение относится к вычисли тельной технике. Цель изобретения - повышение быстродействия. Устройство содержит блок ассоциативной памяти (БАЛ) 1, сумматоры 2, 3, регистр 4 маски, регистр 5 суммы, регистр 6 уп 16 23 АI п равления, блок сравнения 7, группу регистров п (п - количество разрядов анализируемых чисел), группу элементов И , дешифратор 10, счетчик 11, триггер 12 управлений, элементы И 13,14, элемент НЕ 15, информационные 16 и адресные 17 входы , вход 18 начальной установки, вход 19 задания количества чисел, входы задания режимов питания 20 и записи 21, тактовый вход 22, информационные выходы 23, выходы разрядов среднего числа. На каждом j-м такте (,2,..n) БАЛ 1 производит поиск чисел, разряды которого с 1-го по j-1-й равны уже выделенному, а j-й разряд равен нулю. Если выделенное количество таких чисел в сумме с количеством ранее исключенных из рассмотрения - s(m+1)/2 (m - количество анализируемых чисел), то j-й разряд среднего числа равен нулю, в противном случае - единице.

Устройство для сортировки информации

Изобретение относится к автоматике и вычислительной технике и может быть использовано в специализированных: цифровых устройствах для обработки данных. Цель изобретения - увеличение достоверности работы. Устройство содержит блок анализа количества единиц,блок сравнения, триггер результата, два элемента задержки, блок синхронизации , блок памяти, блок управления,, регистр, группу элементов ШШ и счетчик. Входная информация в виде менягаищхся во времени логических единиц и нулей синхронизируется и делится во времени на р временных каналов. Для каждого временного канала в блоке памяти отведена соответствующая ячейка памяти. .В блок памяти записывается п чисел, разрядность которых определяется разрядностью счетчика. Числа в параллельном виде считываются из блока памяти в регистр. Значения чисел в текупц-1Й и предыдущий моменты времени склас дываются по ИЛИ и поступают на блок анализа количества единиц.Сумма единиц сравнивается с константой в блое ке сравнения и результат записывает-ся в пример ...

Устройство для сортировки информации

Устройство для определения наименьшего из @ чисел

Изобретение относится к автоматике и вычислительной технике и может быть использовано при реализации технических средств цифровых систем контроля, систем обработки данных в автоматизированных систем управления . Цель изобретения - упрощение устройства. Устройство содержит регистры , дешифраторы, группы элементов И,ИЛИ, элементы НЕ, многовходо- вые элементы И, регистр результата. Устройство выполняет преобр.ёзование чисел в распределительные коды с помощью дешифраторов и анализ этих кодов с формированием наименьшего числа и записью его в, регистр результата . 1 ил. (Л с ел ...

Устройство для сортировки информации

Изобретение относится к вычислительной технике, может быть использовано в системах обработки информации и является усовершенствованием устройства по а.с. № 1183956. Цель изобретения - расширение области применения устройства за счет нахождения числа заданного ранга. Цель изобретения достигается тем, что в устройство, содержащее генератор импульсов 1, счетчик 2, блок памяти 3, коммутатор 5, элемент НЕ 6 и группу элементов И 4, дополнительно введены вычитающий счетчик 14, дополнитель- ньй элемент НЕ 17, элемент И 15 и элемент ИЛИ 16. Упорядочивание чисел производится за счет отождествления величины числа с кодом адреса ячейки блока памяти, в которую записывается единичный код. Введение вычитающего счетчика, в который записывается код искомого по величине числа (числа заданного ранга), позволяет при наличии любого числа в последовательности уменьшать его содержимое на единицу. При нахождении искомого по величине числа вычитающий счетчик обнуляется и за счет элементов И и ИЛИ фомируется разрешающий ...

Устройство для обработки массивов чисел

Изобретение относится к вычислительной технике и может использоваться при построении систем сбора и обработки информации, представленной массивами чисел, например, в цифровых устройствах обработки изображений. Цель изобретения - расширение функциональных возможностей за счет выполнения операции объединения, пересечения и дополнения над L - множествами. Устройство содержит регистр 8, реверсивный счетчик 9, блок памяти 12, блок логической обработки 13, элементы задержки 10 и 11, элемент И 14, группу элементов И 15. Блок логической обработки содержит информационные регистры, элементы И, элемент ИЛИ, коммутатор, элементы И-НЕ. Работа устройства основана на записи в ЗУ единичных признаков наличия конкретного числа в каждом из вводимых массивов по адресу, задаваемому с выхода счетчика, используемого как регистр. Восстановление чисел производится выделением соответствующих стробовых сигналов, осуществляемым за счет фиксации начала отсчета и исключения из серии тактовых импульсов тех по порядку ...

Устройство для сортировки чисел

УСТРОЙСТВО ДЛЯ СОРТИРОВКИ ЧИСЕЛ, содержащее регистр совига, первый и второй триггеры, являкициеся пополнительными разрядами регистра сдвига, дешифратор, элемент И, причем прямые выходы первого и второго триггера соединены соответственно с первым и вторым входами дешифратора, тактовый вход устройства соединен с первым входом элемента И, второй вход которого соединен с инверсным выходом ()-го разряда регистра, отличающееся тем, что, с целью расширения функциональных возможностей путем обеспечения возможности обработки чисел разньк форматов, оно содержит элементы НЕ, ИЛИ, группу элементов ИЛИ, группы элементов И, причем первый вход элемента ИЛИ соединен с выходом элемента И, а второй вход - с дополнител ным тактовым входом устройства, выход элемента ИЛИ соединен с входами управления записью всех разрядов регистра сдвига, информационный вход устройствас первым входом первого элемента И первой группы, выход i -го разряда регистра сцвига - с первым входом ({ 41)-го элемента И первой группы (, ...

Комбинаторное устройство

Изобретение относится к области автоматики и вычислительной техники и предназначено для использования в устройствах, решающих комбинаторные задачи, связанные с определением числа сочетаний и размещений. Цель изобретения - расширение функциональных возможностей за счет определения числа размещений. Устройство содержит регистры 1, 4, 19, 22, блоки вычитания 9, умножения 17, деления 24, счетчик 11, схему 12 сравнения, коммутатор 23, триггер 29, блоки 5, 8, 10, 13, 15, 16, 18, 20, 25, 27, 30 элементов И, блок 31 элементов ИЛИ, элемент ИЛИ 26. Дополнительно к функции определения числа сочетаний элементов предлагаемое устройство определяет и число размещений. Это достигается ценою ввода в конструкцию дополнительных блоков: коммутатора, триггера, блока элементов И, блока элементов ИЛИ и элемента ИЛИ. 1 ил.

Устройство для сортировки чисел

УСТРОЙСТВО ДЛЯ СОРТИРОВКИ ЧИСЕЛ, содержащее управляющий счетчик, триггер, элемент И, элемент ИЛИ, счетчик чисел, причем выходы счетчиков чисел соединены с заходами эле- . мента ИЛИ, а входы - с выходом элеме та И и входом управляющего счетчика, о тли ч а ю щ е е с я тем, что, с целью повьпиёния бьютродействия, оно содержит счетчик номера переменной, генератор импульсов, регистры, элементы задержки, группы элементов И причем выходы счетчиков чисел соединены с входами соответствующих элементов задержки, выходы соединегад с , входами элементов И срответст } вуквдих групп, Ьторые входы которых соединены с соответствуюпшми выходами счетчика номера переменной, а выходы с входами соответствующих регистров , входы сброса регистров и счетчика номера переменной соединены с входом управления устройства, единичным входом триггера и входом запуска ген1&ратора , импульсов, выход которого соединен: с пе{жым входом элемента И, второй Вход которого соединен с прямым вы (Л ходом триггера, инверсный выход ...

Устройство для поиска чисел с заданным рангом

Изобретение относится к вычислительной технике и может быть использовано в системах обработки изображений. Цель изобретения - повышение быстродействия. Устройство содержит блоки памяти (БП) 1, 2, генератор импульсов 3, счетчики 4, 5, 6, БП маски 7, БП признака 8, сумматор 9, преобразователь кода 10, накапливающий сумматор 11, триггеры 12, 13, элементы И 14, 15, элемент сравнения 16, информационные вход 17 и выход 18, входы задания ранга 19 и маски 20, входы начальной установки 21, 22, 23, входы разрешения записи данных 24, маски 25 и ранга 26, выходы состояния 27, 28, вход запуска 29. Исходный набор данных записывается в БП 2, затем в БП 1 строится гистограмма этого набора данных до тех пор, пока не будет достигнуто число заданного ранга, которое устанавливается на выходе 18. При изменении набора данных гистограмма только модифицируется, а не строится заново. Часть элементов набора данных может быть замаскирована. 1 ил.

Устройство для определения положения числа на числовой оси

УСТРОЙСТВО ДЛЯ ОПРЕДЕЛЕНИЯ ПОЛОЖЕНИЯ ЧИСЛА НА ЧИСЛОВОЙ ОСИ, содержащее входной счетчик, шифраторы , регистры, элементы сравнения, триггер, счетчик номера поддиапазона, элементы И, формирователь импульсов, причем входы начальной установки входного счетчика, триггера и первый упра;вляк1дий вход счетчика номера поддиапазона подключены к входу начальной установки устройства, счетный вход входного счетчика является информационным входом устройства, выходы младших разрядов входного счетчика соединены с первыми гр$шпами входов первого и второго элементов сравнения , выходы старших разрядов входного счетчика соединены с первыми группами входов третьего и четвертого элементов сравнения, выходы первого и второго элементов сравнения соединены с входами переноса третьего и четвертого элем1Энтов сравнения соответственно , первый и второй выходы третьего элемента сравнения соединены с первыми входами первого и второго элементов И соответственно, первый и второй выходы четвертого элемента сравнения соединены ...

Устройство для сортировки чисел

Изобретение относится к вычислительной технике и может быть использовано в специализированных устройствах обработки информации, предназначенных для параллельной сортировки массивов данных, поступающих последовательным кодом в реальном масштабе времени. Целью изобретения является повышение быстродействия. Устройство содержит тактовый вход 1, информационные входы 2, вход начальной установки 3, блок сравнения 4, блок дешифрации 5, блок коммутации 6, информационные выходы 7. Сортируемые числа поступают последовательным кодом на вход устройства старшими разрядами вперед. На выходе устройство получают отсортированный массив в последовательном коде. 3 з.п. ф-лы, 5 ил.

Устройство для сортировки чисел

Изобретение относится к вычислительной технике и может быть использовано в системах, ориентированных на обработку упорядоченных массивов данных. Цель изобретения - повышение быстродействия устройства при увеличении количества чисел за счет одновременного попарного их анализа. Устройство содержит N блоков 1 анализа, каждый из которых со второго по (N-1)-й включает два элемента И 3 и 8, элемент ИЛИ, схему сравнения, регистр 2 и две группы элементов И 4, 5. Первый блок анализа содержит два элемента И 3 и 8, схему 7 сравнения, регистр 2 и группу элементов И 5, а N-й блок анализа - элемент И 3 регистр 2 и группу элементов И 4. Изобретение обеспечивает сортировку чисел в возрастающем либо убывающем порядке путем одновременного сравнения пар чисел с последующей при необходимости перезаписью их в соответствующие регистры в чередующихся тактах генератора импульсов. В четных тактах производится сравнение чисел нечетного слева и четного справа, а в нечетных - четного справа и нечетного слева. Такое ...

Устройство для ранжирования чисел

... li УСТРОЙСТВО ДЛЯ РАНЖИРОВАНИЯ ЧИСЕЛ, содержащее регистр сдвига , схему сравнения, блок подсчета номера ранга, причем выход регистра сдвига соединен с первым входом схемы сравнения, отличающеес я тем, что, с целью повышения быстродействия устройства, регистр сдвига выполнен пг-разрядным, ще m - количество разрядов сортируемых чисел, в устройство введешь (N-2) регистров сдвига, где N - число сортируемых чисел, (N-2) схем сравнения , (N-lL блоков подсчета ранга, одноразрядных регистров и элементов НЕ, причем выход 1-го регистра, где i « « 2,3,. ., (N-1), соединен, с первым входом i-й схемы сравнения, вторые входы схем сравнения соединены с пкной входных чисел и с входом первого регистра сдвига, вход f-ro регистра сдвига соединен с выходом (J-l)-ro регистра сдвига, выход j-й схемы сравнения, где j - I, 2,...,(N-1), подключен к входу первого одноразрадного регистра из цепочки последовательно соединенных (N-1-J) одноразрядных регистров, к одному из входов первого блока подсчета номера ранга ...

Устройство для сортировки данных

Устройство для загрузки файлов

Изобретение относится к вычислительной технике и может быть использовано в вычислительных системах для связи процессоров с запоминающими устройствами, в автоматизированных банках данных в устройствах классификации . Целью изобретения является расширение области применения у трой- ства за счет формирования форматированных файлов. Устройство содержит группу входных регистров, регистр признака файла, группу схем сравнения , три группы блоков элементов И, группу выходных регистров, генератор импульсов, счетчик, дешифратор, триггер управления, элемент ИЛИ-НЕ, два элемента И, группу элементов ИЛИ, группу элементов И, блок элементов И, две группы элементов з.апрета, три элемента задержки и элемент ИЛИ. Новым в устройстве является использование второй группы элементов И, блока управляющих регистров, второй группы схем сравнения, четвертой группы блоков элементов И, схемы сравнения и их связей, что обеспечивает достижение цели изобретения. Устройство работает следзтощим образом. Во входные регистры ...

Устройство для упорядочения переменных

УСТРОЙСТВО ДЛЯ ОПРЕДЕЛЕНИЯ ПОЛОЖЕНИЯ ЧИСЛА НА ЧИСЛОВОЙ ОСИ

Устройство для ранжирования чисел

УСТРОЙСТВО ДЛЯ РАНЖИРОВАНИЯ ЧИСЕЛ, содержащее (,М-1|гг -разрядных регистров сдвига, где N - число сортируемых чисел,(N-nсхем сравнения двух тп разрядных чисел и блок подсчета номера ранга входного числа, причем выход i-ro т-разрядного регистра сдвига, где ,2(N-1), соединен с первым входом i-й схемы сравнения,выход j-ro m-разрядного .регистра сдвига .где j 1,2,... Дм -2), соединен с входом j+l)-го т-разрядного регистра сдвига, вторые входы всех схем сравнения подключены к шине входных чисел и входу первого m -разрядного регистра сдвига, a выходы - к входам блока подсчета номера ранга входного числа, шина сдвига устройства соединена с синхронизирующими входами всех m -разрядных регистров сдвига, отличающееся тем, что, с целью сокращения аппаратурных затрат при больших значениях N , устройство содержит | -разрядных регистров сдвига, где .г - количество разрядов ранга, и IN - lJ KOppeKTopoB ранга, корректор содержит две схемы сравнения и Ъ -разрядный сумматор, причём выходы блока подсчета номера ...

SORTIERMODUL FUER BELEGSORTIERUNG.

A multichannel input feeds channels formed by the comb-shaped front edge (45) of an assembly (45). Wedge shaped tin strips (47) forming funnel like openings (56a) are fitted to this edge and are attached to the front ends of long tin strips (37) that form the guides through which the sorted items are transported to their respective trays. In front of these guides are two brackets (57,58) that form a single entrance channel (56). A stepper motor rotates the assembly (45,39) so as to position the required guide in line with the entrance channel. The items have previously passed through an encoder that controls the motor movement.

Verfahren und Vorrichtung zur Auswertung von binaeren Aufzeichnungen auf magnetischen Aufzeichnungstraegern

MACHINE FOR SORTING RECORDING MEDIA

... 1,243,833. Feeding and delivering sheets. KOMBINAT ZENTRONIK VEB. 30 Oct., 1968, No. 51412/68. Heading B8R. [Also in Division G4] Records, e.g. punched cards or coded mail are fed on to a rotating vacuum drum 4 which conveys them past a sensing station to a series of deflectors 14 and sorting pockets 14. The drum may be transparent and houses a lamp 13 cooled by air entering suction ports 10 and photodiodes 12 which may be moved into registration with a selected card column, the sending of the card producing pulses controlling magnets 17 for the deflectors 15. The cards which may be of varying lengths, thickness and width are fed by belts 1 which urge plate 5 against the cards and which are driven by a motor until the pressure exerted by the cards is sufficient to operate a pair of contacts (not shown). The vacuum ports 10 slide over the surface of the foremost card until it is bowed sufficiently to escape from plate 6. Rollers 18 ensure continued driving of a card after its leading edge ...

Document processing and sorting apparatus

... 1,001,563. Sorting machines for cheques. NATIONAL CASH REGISTER CO. July 20, 1961 [Aug. 30, 1960], No. 26410/61. Heading G4M. In a sorting machine for cheques or like documents the cheques are passed in succession past a sensing station to derive sorting signals for each document, a first store receiving their signals, a second store for receiving signals read out from the first store, means for developing a first synchronizing signal just before sensing a cheque to reset the first store, a second synchronizing signal just before the end of sensing each cheque to reset the second store and a third synchronizing signal shortly after the second for transferring the signals from the first store to the second store. The cheques to be sorted are placed on edge in a hopper 16, Fig. 2B, and fed one by one between forwarding belts 17, 18 to a turning device 19 which ensures that the leading edges of the cheques will be uniformly spaced. The cheques then move to the left and pass through the sensing ...

SORTING AND STACKING APPARATUS

SORT MODULE FOR PROOF ASSORTMENT.

Procedure and device for sorting arc-shaped materials

CIRCUIT FOR DATA MEDIA FOR THE REDUCTION OF CURRENT CONSUMPTION

REMOTE TERMINAL CARD INDENTIFICATION

System and method for auditing a network

Automatic calibration of chemical product dispense systems

Automatic calibration of dispense parameters of a product dispense system is accomplished via electronic communication of product information. A chemical product includes an electronically readable tag or label that stores and communicates chemical product data concerning the chemical product to a chemical product dispenser. The chemical product data may include, for example, the name of the chemical product, the type or class of the chemical product, manufacturing information regarding the chemical product (e.g., manufacturing date, location, serial number, lot number, etc.), concentration of active ingredient(s), weight, volume, viscosity, density, hardness, specific gravity, shape, color, and/or other data concerning the chemical product. A controller within the dispenser automatically calibrates the dispense parameters based on the chemical product data.

EVENT CORRELATION

Event correlation may include identifying a feature set for each log file of a plurality of log files, and extracting the feature set for each event of a plurality of events in each log file of the plurality of log files. Event correlation may further include determining a plurality of trace event pairs linkage strength values for an event from a first log file of the plurality of log files and a plurality of events from a second log file of the plurality of log files. The trace event pairs linkage strength values may represent an overlap of the feature set for the event from the first log file and the feature set for each of the plurality of events from the second log file. -a . a > 3 1.. - .0 co e 2 -Z 75a oa o.o -JLuJ o o o czo So -0 n> Li 83 COI cco co Ua z8 0 2 xc a toLL o - o C)) a C E 8U Ec _ cMo W(o 1 Li-g o o o o o a) a ...

Apparatus and method for analysing the condition of a machine having a rotating part

An apparatus for analysing the condition of a machine having a part rotating with a speed of rotation (f ROT), comprising: a first sensor (10) adapted to generate an analogue electric measurement signal (S ...

PAPER COLLATOR AND DISTRIBUTOR

SYSTEM FOR DOCUMENT CODING AND IDENTIFICATION

SECURE PROPERTY DOCUMENT AND SYSTEM

A secure property document and system are provided which prevents the use of fraudulent credit cards and other documents. The documents each include optical and magnetic data sets. Each data set contains data elements having a spacial relationship to at least some of the data elements contained in the other data set. T? system reads and processes the data to determine whether or not the spacial relationship corresponds to that recorded for the particular document. If the special relationship codes do not agree within predetermined limits, the document is rejected by the system, whereby the transaction may be refused or additional information requested from the document holder.

IDENTITY VERIFICATION METHOD AND APPARATUS

IMPROVED IDENTITY VERIFICATION METHOD AND APPARATUS An improved method for verifying the identity of a prospective terminal user presenting an identification card or a credit card and a memorized personal identification number. Only part of the information necessary to correlate an account number to a personal identification on number is available at any accessible place in the operating system. Neither the credit card, the host computer, nor the transmission link will ever have sufficient information to completely correlate an account number to a personal identification number.

DOCUMENT TRANSPORT SYSTEM

SYSTEM FOR IDENTIFYING COMMON DIGITAL SEQUENCES

A system and method for unorchestrated determination of data sequences using "sticky byte" factoring to determine breakpoints in digital sequences such that common sequences can be identified. Sticky byte factoring provides an efficient method of dividing a data set into pieces that generally yields near optimal commonality. This is effectuated by employing a rolling hashsum and, in an exemplary embodiment disclosed herein, a threshold function to deterministically set divisions in a sequence of data. Both the rolling hash and the threshold function are designed to require minimal computation. This low overhead makes it possible to rapidly partition a data sequence for presentation to a factoring engine or other applications that prefer subsequent synchronization across the data set.

AUTOMATION SYSTEM AND METHOD

A computer-implemented method, computer program product and computing system for executing a description model when utilizing a website; detecting a failure associated with the execution of the description model; re-executing the description model one or more times in an attempt to utilize the website; and if a failure is detected one or more times, reporting the failure to a user. 1. A computer-implemented method , executed on a computing device , comprising:executing a description model when utilizing a website;detecting a failure associated with the execution of the description model;re-executing the description model one or more times in an attempt to utilize the website; andif a failure is detected one or more times, reporting the failure to a user.2. The computer-implemented method of wherein the description model includes a data description model3. The computer-implemented method of wherein the description model is associated with an ontology that defines acceptable values for the data description model.4. The computer-implemented method of wherein the description model includes a function description model.5. The computer-implemented method of wherein the function description model includes an ontology that defines acceptable values for the function description model.6. The computer-implemented method of wherein detecting a failure associated with the execution of the description model includes:detecting a failure of the description model.7. The computer-implemented method of wherein detecting a failure associated with the execution of the description model includes:detecting a failure of the website.8. The computer-implemented method of wherein detecting a failure associated with the execution of the description model includes one or more of:detecting the unavailability of the website;detecting data incongruities with respect to the website;detecting missing data with respect to the website; anddetecting unacceptable data with respect to the website.9. A ...

TRANSFORMING AN EXPRESSION TREE HIERARCHY OF A DATABASE QUERY FOR DYNAMIC DATA OF A DATABASE

A system can generate an expression tree hierarchy based on a database query that refers to dynamic data of a database having a data model. The dynamic data is undefined in the data model of the database. The system can invoke a process that traverses the expression tree hierarchy to transform the expression tree hierarchy and iteratively or recursively translate multiple expression fragments of the expression tree hierarchy in accordance with the process while maintaining a contextual type stack. A particular iteration or recursion operates on a particular expression fragment of the multiple expression fragments to convert the particular expression fragment into another expression fragment for another expression tree hierarchy. 1. At least one computer-readable storage medium , excluding transitory signals and carrying instructions , which , when executed by at least one data processor , cause the data processor to:generate an expression tree hierarchy based on a database query that refers to dynamic data of a database having a data model, wherein the dynamic data is undefined in the data model of the database,invoke a process that traverses the expression tree hierarchy to transform the expression tree hierarchy into another expression tree hierarchy; 'wherein a particular iteration or recursion operates on a particular expression fragment of the multiple expression fragments to convert the particular expression fragment into another expression fragment for the other expression tree hierarchy.', 'iteratively or recursively translate multiple expression fragments of the expression tree hierarchy in accordance with the process while maintaining a contextual type stack,'}2. The at least one computer-readable storage medium of claim 1 , wherein the data processor is further caused to:determine that the particular expression fragment refers to a lambda expression;creating a typed lambda expression based upon one or more types that are at a top of the contextual type ...

SERVING MULTIPLE CONTENT ITEMS RESPONSIVE TO A SINGLE REQUEST

When a client device loads a resource, a request for a first content item for a first content item slot is transmitted to a content item selection system. The content item selection system uses a predictive model to determine a predicted content item slot based on a document object model position of the first content item slot and a URL of the resource or a publisher identifier. Parameters for the predicted content item slot are used to select a subsequent content item for the predicted content item slot. The first content item and the subsequent content item are transmitted to the client device responsive to the request. The subsequent content item includes metadata indicative of the parameters of the predicted content item slot to be matched to a subsequent content item slot of the resource. 120-. (canceled)21. A method for serving multiple content items responsive to a single content item request comprising:receiving, by one or more data processors, a request for a first content item for a first content item slot of a resource, the request including parameters for the first content item slot and a parameter indicating the request is for one or more serialized content items;selecting, using one or more data processors, a first content item based on the parameters for the first content item slot;determining, using one or more data processors and responsive to the parameter indicating the request for the first content item is for one or more serialized content items, a predicted subsequent content item slot;determining, using one or more data processors, one or more parameters for the predicted subsequent content item slot responsive to determining the predicted subsequent content item slot;selecting, using one or more data processors, a subsequent content item for the predicted subsequent content item slot based on the determined one or more parameters for the predicted subsequent content item slot; andtransmitting, responsive to the request for the first content ...

METHOD, APPARATUS, STORAGE MEDIUM AND ELECTRONIC DEVICE FOR ESTABLISHING QUESTION AND ANSWER SYSTEM

Methods, systems, and devices, including computer programs encoded on computer storage media, for establishing a question and answer (QA) system are provided. One of the methods includes: determining QA pair data according to an extraction template and a target data source; adjusting the extraction template according to anomaly information corresponding to the QA pair data; updating the QA pair data according to the target data source and the adjusted extraction template; and determining a QA index according to the updated QA pair data to establish a QA system. 1. A method for establishing a question and answer (QA) system , comprising:determining QA pair data according to an extraction template and a target data source;adjusting the extraction template according to anomaly information corresponding to the QA pair data;updating the QA pair data according to the target data source and the adjusted extraction template; anddetermining a QA index according to the updated QA pair data to establish a QA system.2. The method according to claim 1 , wherein the target data source includes a target web page group comprising one or more web pages.3. The method according to claim 2 , further comprising:when a preset condition corresponding to the QA pair data is not met, determining that the QA pair data have an anomaly; anddetermining the anomaly information according to the QA pair data having the anomaly.4. The method according to claim 3 , wherein the preset condition includes at least one of: a condition that a number of questions and a number of answers are the same in QA pair data corresponding to a same web page; and a threshold of storage space occupied by the QA pair data.5. The method according to claim 2 , wherein the determining QA pair data according to an extraction template and a target data source comprises:matching the one or more web pages with a web page blacklist;filtering out the matched web pages to obtain a filtered target web page group; anddetermining ...

Systems, Methods and Devices for Providing Automated Adaptive Web-Based News Feeds

There is provided a system and method for facilitating automatic customized web feed generation via an aggregator server, the server having a processor, a communication subsystem and a memory each in communication with the processor, the memory storing instructions, which when executed by the processor, configure the aggregator server to: communicate with a plurality of web feed sources to request and retrieve web feeds of a plurality of web sites having web pages; aggregate the web feeds from the plurality of web feed sources and web sites into an aggregated web feed; automatically scan web content of each web page within the aggregated web feed and tag each web page within the aggregated web feed having a pre-defined degree of relevance of information pertaining to at least one pre-defined cryptocurrency to a corresponding at least one cryptocurrency identifier; store mapped sets of each tagged web page and corresponding to least one cryptocurrency identifier in a database of the aggregator server; automatically receive an indication from a computing device of a listing of cryptocurrency assets held by a user of the computing device, said indication indicating an automatic request for web feed information relating to said listing of cryptocurrency assets; automatically provide a custom web feed to the computing device, the custom web feed comprising content from each tagged web page having a corresponding at least one cryptocurrency identifier which exists within the listing of cryptocurrency assets, the custom web feed for subsequent display on the computing device for being associated with the listing of cryptocurrency assets. 1. An aggregator server for facilitating automatic customized web feed generation , the server having a processor , a communication subsystem and a memory each in communication with the processor , the memory storing instructions , which when executed by the processor , configure the aggregator server to:receive web feeds of items of ...

Method and System Governing Interaction Between URL-Possessing Elements of a Mobile Web

A personalized way to digitally record a person's physical activities over time serves web searching, business advertising, nostalgia, security and object tracing purposes. The chronological digital history of the person's physical presence over a time includes (i) digital network entries from other members who hold their portable wireless short range device near the person's device and transmit a URL or other key data and (ii) digital member entries such a digital photograph of a store sign. The digital network entries and digital member entries are automatically transmitted to a database located on a telecommunications network at a time of entry. Advertisers can transmit to members when members enter premises of advertiser's store. Upon sign-up online, the authentication data uniquely associated with an account is provided and key data they want to transmit is associated with the account. Digital histories can be used to improve web searching and networking opportunities. 1. A computer-implemented method governing interaction between URL-possessing elements of a mobile web , the method comprising:maintaining a processing system that is connected to a telecommunications network and is configured to provide an account to individual members of a member network, each of the individual members having a URL associated with the account, each account storing key data, optionally including the URL, for later transmission to another individual member;providing an application that configures a handheld mobile communication device of each individual member of the member network who is mobile, to, upon instances of a physical encounter between a pair of the URL-possessing elements, the pair including a first individual member and a second individual member, transmit the key data of at least one individual member of the pair and a URL of the first individual member and a URL of the second individual member to the processing system automatically as a result of a short range ...

SYSTEM AND METHOD FOR CUSTOMER FEEDBACK PROCESSING

Customers submit reports to a reporting center. Topic sentences are identified. For each of a plurality of values of k, a separate k-grouping matrix is created from a master matrix by the control circuit. Each k-grouping matrix arranges the topic sentences into k groupings based upon the similarity of words as between different topic sentences. Each of the k-grouping matrices is created at least in part by moving or rearranging some of the rows of the master matrix. The most frequent topic sentences are identified and used to identify an action. 1. A system that is configured to determine and take actions based upon consumer reports , the system comprising:an automated vehicle that is disposed in a retail store;a plurality of user electronic devices operated by customers, wherein each of the user electronic devices comprises an electronic interface that is configured to receive consumer reports from a customer;a communication network coupled to the user electronic devices;a smart-bot disposed at a central processing center, the smart-bot being configured to receive and automatically discern the customer reports from the user electronic devices using natural language processing approaches, the received reports being automatically tagged by the smart-bot with issue categories selected from an issue category list, the smart-bot being configured to web-scrape a plurality of web sites via the communication network to collect issue categories from the web sites, and add to or adjust to the issue category list based upon the obtained web-scraped issue categories;wherein the smart-bot is configured to utilize the natural language processing approaches to determine when the consumer reports are missing information, and when the consumer reports are missing information, responsively transmit a first electronic message to one of the user electronic devices for rendering at the electronic interface of the user electronic device, the first electronic message requesting the ...

EFFICIENT MODIFICATION OF STORAGE SYSTEM METADATA

A first plurality of block identifiers is sorted based, at least in part, on a measure of spatial locality. A second plurality of block identifiers is sorted based, at least in part, on the measure of spatial locality. At least the first plurality of block identifiers and the second plurality of block identifiers are incrementally merged into a third plurality of block identifiers based, at least in part, on the measure of spatial locality. A block of data corresponding to metadata associated with a plurality of block identifiers of the third plurality of block identifiers is updated. 1. A method , comprising:utilizing, by a processor, a first structure to store a plurality of block identifiers to identify data blocks as candidates for allocation for storing data in a storage system;reserving, by the processor, additional storage space for the first structure before the first structure reaches a certain size upon addition of a new block identifier;re-arranging, by the processor, block identifiers of a subset of the first structure, when a size of the subset reaches a first threshold value upon addition of the new block identifier;determining, by the processor that the first structure has reached a second threshold value;generating, by the processor, a second structure for storing the re-arranged block identifiers of the subset; andselecting, by the processor, a block identifier from the second structure to free a data block associated with the selected block identifier.2. The method of claim 1 , further comprising:utilizing, by the processor, a number of block identifiers as the first threshold value.3. The method of claim 1 , further comprising:utilizing, by the processor, a number of block identifiers pending insertion in the subset as the first threshold value.4. The method of claim 1 , further comprising:maintaining, by the processor, a count indicating a number of subsets of the first structure that are ready to be re-arranged.5. The method of claim 1 , further ...

Targeting Individuals for Advertising Using Digital Physical Location Histories

A personalized way to digitally record a person's physical activities over time serves web searching, business advertising, nostalgia, security and object tracing purposes. The chronological digital history of the person's physical presence over a time includes (i) digital network entries from other members who hold their portable wireless short range device near the person's device and transmit a URL or other key data and (ii) digital member entries such a digital photograph of a store sign. The digital network entries and digital member entries are automatically transmitted to a database located on a telecommunications network at a time of entry. Advertisers can transmit to members when members enter premises of advertiser's store. Upon sign-up online, the authentication data uniquely associated with an account is provided and key data they want to transmit is associated with the account. Digital histories can be used to improve web searching and networking opportunities. 1. A computer-implemented method of targeting individuals for advertising using digital physical location histories , comprising:maintaining a processing system in communication with a positioning system, the processing system configured to provide an account to an individual member, and to a stationary vendor member, of the member network, the account associated with a URL;providing an application that configures a mobile communication device of each individual member, the device in communication with the positioning system, to, upon instances of a physical encounter between the individual member carrying the device, and a stationary vendor member of the member network, at a physical premises of the stationary vendor member, automatically transmit to, or generate on, the processing system an entry of the physical encounter including the URL of the individual member and a URL of the stationary vendor member, a location of the individual member at the physical premises determined by the ...

Enhancing Digital Search Results for a Business in a Target Geographic Area Using URLs of Location Histories

A personalized way to digitally record a person's physical activities over time serves web searching, business advertising, nostalgia, security and object tracing purposes. The chronological digital history of the person's physical presence over a time includes (i) digital network entries from other members who hold their portable wireless short range device near the person's device and transmit a URL or other key data and (ii) digital member entries such a digital photograph of a store sign. The digital network entries and digital member entries are automatically transmitted to a database located on a telecommunications network at a time of entry. Advertisers can transmit to members when members enter premises of advertises store. Upon sign-up online, the authentication data uniquely associated with an account is provided and key data they want to transmit is associated with the account. Digital histories can be used to improve web searching and networking opportunities. 1. A computer-implemented method of enhancing digital search results for a business in a target geographic area using URLs of location histories , comprising:providing, by at least one processing system in communication with a positioning system, an account to (i) an individual member and (ii) a stationary vendor member, of a member network, the account associated with a URL, the individual member's account associated with a mobile communication device or multiple mobile communication devices,maintaining a communication link between the mobile communication device and the at least one processing system or the positioning system such that the mobile communication device is configured to accumulate a location history on a database maintained by the at least one processing system from physical encounters by the individual member at multiple stationary vendor members upon the mobile communication device being set to enter instances of a physical encounter between the individual member carrying the ...

METHOD FOR INFORMATION RETRIEVAL IN AN ENCRYPTED CORPUS STORED ON A SERVER

A method for information retrieval in an encrypted corpus stored on a server, from a digital request calculated on a customer device, containing a sequence of terms, includes the following steps: encryption of the request on a customer computer device and transmission of same to a database management server; and homomorphic calculation, on the server, of the encrypted response to the encrypted request recorded on the server. The method further comprises an additional requesting step performed on the customer device; and presentation of the result in an ordered form of the documents, in application of the processing of the previous step. The present disclosure also relates to a method for preparing a requestable base and to a method for information retrieval in an encrypted corpus. 1. A method for information retrieval in an encrypted corpus stored on a server , from a digital request calculated on a customer computer device , containing a sequence of terms , comprising the following steps:encryption of the digital request on the customer computer device;transmission of the encrypted request to a database management server;homomorphic calculation on the server of an encrypted response to the encrypted request recorded on the database management server;transmission of the encrypted response to the customer device; and [{'sub': i', 'i, 'claim-text': [{'sub': 'i', 'first table TFcomprising, for each indexed term w of the document i, the number of occurrences of the term w in the document i, and'}, {'sub': 'i', 'the second table Δdfconstituted by the presence or not of each term w in the document i;'}], 'a) calculation steps on the customer device, when introducing a new requestable document i, for each document i belonging to the corpus, a first table TFand a second table Δdf, {'sub': i', 'i, 'b) encrypting document i and the table Δdf, as well as encrypting, by a homomorphic encryption method, the table TF, and transmitting these three encrypted digital information to ...

PRESENTING OPTIONS FOR CONTENT DELIVERY

Methods, systems, and computer program products are provided for presenting an option to have a content item provided to users based on one or more interests. One example method includes providing filtering parameter selection controls, receiving a filtering parameter selection, receiving at least one term corresponding to the one or more interests, and presenting suggestions based on the received term. An estimated number of users having interests matching the suggestions and having user attributes matching the received filtering parameter selection is determined, and the estimated number of users is presented for at least one of the suggestions. A selection of at least one of the suggestions is received, and the content item is delivered to users having interests matching the selected suggestion and having user attributes matching the filtering parameter selection. 123-. (canceled)24. A computer-implemented method comprising:{'claim-text': ['(i) providing one or more controls for selecting one or more filtering parameters, the filtering parameters including user devices and at least one of user locations and user languages;', '(ii) receiving, from the sponsor, a selection of at least one of the one or more filtering parameters;', '(iii) receiving, from the sponsor, at least one term corresponding to the one or more interests;', '(iv) presenting the sponsor with suggestions based on the at least one term received from the sponsor;', '(v) determining, by one or more processors, for at least one of the suggestions, a corresponding estimated number of users having interests matching the suggestion and having user attributes matching the received selection of at least one of the one or more filtering parameters, wherein the corresponding estimated number of users is derived from a log of past usage information that includes information associated with past requests for content by the users and with computing devices used to submit the past requests for content; and', ...

METHOD AND SYSTEM FOR PROVIDING ALTERNATIVE RESULT FOR AN ONLINE SEARCH PREVIOUSLY WITH NO RESULT

A computing device hosting a website of a business may be operable to receive a first search input comprising a term submitted via a search bar on the website. Upon performing an internal search for the term with no result, the computing device may output information on the no-result. The computing device may then perform, using one or more external search engines, a search for the term. Search results of the search, performed using the external search engine(s), may be analyzed. Based on a result of the analysis, one or more particular character strings related to the term may be identified. The computing device may generate and store, based on the identifying of the particular character string(s), one or more alternative search suggestions. Upon subsequently receiving an input comprising at least a portion of the term entered in the search bar, the computing device may output the alternative search suggestion(s). 120-. (canceled)21. A method , wherein the method comprises: receiving a term from a user via a graphical user interface,', 'searching for an item associated with the term,', 'entering the term into one or more external search engines, if no item is associated with the term, and, 'in a computing device hosting a website of a businessassociating one or more particular character strings with the term based on a result from the external search engine, wherein the one or more particular character strings correspond to an item carried by the business22. The method according to claim 21 , wherein the method comprises outputting one or more alternative search suggestions.23. The method according to claim 21 , wherein the term comprises a string of alphanumeric characters.24. The method according to claim 23 , wherein the method comprises determining that the term is a valid term for search if the string of alphanumeric characters comprises at least one digit.25. The method according to claim 24 , wherein the method comprises normalizing the determined valid term ...

MICROSERVICES DATA AGGREGATION SEARCH ENGINE UPDATING

A method to update data of a data view. The data is distributed in multiple microservice databases and aggregated in a data aggregation search engine index. A user makes a request to update data of the data view. In response to the update request, an immediate data update operation is performed to update the data in one or more of the multiple microservice databases. A change queue is used to update the aggregated data in the data aggregation search engine index.

Management Of Cannibalistic Ads To Reduce Internet Advertising Spending

Generating an estimate of reclaimed ad spend for an Internet advertising campaign, by receiving a set of keywords, where each keyword corresponds to a paid ad that is supplied to a search engine, gathering a cannibalism score for each paid ad, where a cannibalism score indicates that the presence of a designated paid ad in a SERP reduces the chance that a user will click on a corresponding unpaid listing, and estimating a reclaimed ad spend as the difference between the actual revenue reported for a period of time and an estimate of the expected ad spend for a comparable period of time when de-cannibalizing actions were taken; and reporting the estimate of the reclaimed ad spend.

SYSTEMS AND METHODS FOR VULNERABILITY-BASED CYBER THREAT RISK ANALYSIS AND TRANSFER

A computing device configured for predictive functions related to cyber threat risk accesses historical cybersecurity event data that lists past attacks on particular companies in different industry vertical classifications. Using vulnerability data associated with each attack, enhanced by metadata specifying vulnerable hardware and/or software stacks associated with the attacks, exemplary technology configurations are created that map industry vertical classifications to vulnerable hardware and/or software stacks. These exemplary technology configurations are used as bases for comparison to subject technology configurations under evaluation. A comparison of a subject technology configuration parameters to parameters of the plurality of exemplary technology configurations can reveal similarities that indicate that the subject technology configuration is vulnerable one or more same threats that the exemplary technology configurations are known to be vulnerable to or that the subject technology configuration is susceptible to heightened cyber threat risk, based on historical cybersecurity event data. 1. A method of vulnerability-based cyber risk transfer for improved cyber security , comprising:{'claim-text': ['a plurality of cyber-attacks with each of the plurality of cyber-attacks applied to a respective company of a plurality of companies,', 'vulnerabilities exploited for each of the set of cyber-attacks, and', 'an industry vertical identifier associated with each company of the plurality of companies;'], '#text': 'preprocessing a dataset accessed from a network to extract operational input data, the operational input data defining'}augmenting, by the processor, the operational input data with metadata;generating, by the processor, a first intermediate mapping of the vulnerabilities to each of the plurality of companies;generating, by the processor, a second intermediate mapping of an industry vertical comprising one or more of the plurality of companies to at ...

SYSTEMS AND METHODS FOR DISCOVERING SOCIAL ACCOUNTS

Methods and systems allow organizations to discover accounts, subscriptions, properties, sites and other online portals within each distinct social network platform and across disparate social network platforms, publishing platforms and networks that represent, claim to represent or are relevant to their organization and/or brands based on search terms and facilitate the statistical reporting and analysis of activities on the discovered properties. 1. A method , comprising:receiving or obtaining, by a computer, a search string containing terms and a probabilistic weighting that indicates strength of a relationship between the terms, one of the terms associated with a user or an entity;formatting, by the computer, the terms as required by disparate social network platforms;querying, by the computer, the disparate social network platforms on the terms;processing, by the computer, responses from the disparate social network platforms, the processing including identifying metadata that is common across the responses from the disparate social network platforms;storing, by the computer, the metadata in a normalized format in a data store;providing, by the computer through a user interface, the responses from the disparate social network platforms to a user device, the user interface including a filter function;receiving, by the computer through the user interface, an instruction to apply the filter function to the responses from a subset of the disparate social network platforms;applying, by the computer, the filter function to the responses from the subset of the disparate social network platforms;providing, by the computer through the user interface based on a result from the applying, a number of properties within each of the subset of the disparate social network platforms;receiving, by the computer through the user interface, an indication that a subset of the number of properties has been selected;obtaining, by the computer, publicly available content associated ...

METHODS AND SYSTEMS FOR MANAGING THIRD-PARTY DATA RISK

Some embodiments of the present disclosure disclose methods and systems for assessing the data risk management capabilities of data processors that receive second-party data as part of an engagement to provide support services. In some embodiments, the transfer of the second-party data to the data processors can be monitored to identify file transfers including unauthorized personally identifiable information (PII) attributes. In some embodiments, the database of the data processor may be scanned to locate any residual second-party data that should be removed after the data processor's engagement to provide the support services have expired. 1. A system , comprising:a non-transitory memory; and{'claim-text': ['receiving a request including a query to evaluate a data risk management capability of a third-party to provide data of a second-party to the third-party;', 'web-crawling, based on the received request, a World Wide Web to retrieve third-party data related to the data risk management capability of the third-party;', 'parsing the retrieved third-party data to extract information responsive to the query of the request;', 'performing a data risk assessment of the third-party based on the extracted information responsive to the query; and', 'providing the data of the second-party to the third-party based on the data risk assessment of the third-party.'], '#text': 'a hardware processor coupled with the non-transitory memory and configured to read instructions from the non-transitory memory to cause the system to perform operations comprising:'}2. The system of claim 1 , wherein the third-party data includes a privacy policy statement of the of the third-party available on the World Wide Web related to the data risk management capability of the third-party.3. The system of claim 1 , wherein the parsing the retrieved third-party data includes performing natural language processing of the retrieved third-party data to identify the information responsive to the query ...

SYSTEM AND METHOD FOR VALIDATING MONETARY TRANSACTIONS

A system and method for authenticating a monetary transaction may include scanning a website to identify a plurality of products sold at the website and a respective plurality of costs of the products; calculating a set of monetary transactions based on a respective set of combinations of products; receiving details of a monetary transaction and generating an authentication score for the transaction based on relating data in the monetary transaction to data in the set of monetary transactions. 1. A computer-implemented method of authenticating a monetary transaction , the method comprising:scanning a website to identify a plurality of products sold at the website and a respective plurality of costs of the products;calculating a set of monetary transactions based on a respective set of combinations of products, their respective costs, and shipping costs of at least some of the plurality of products;receiving details of a monetary transaction related to a purchase at the website; andgenerating an authentication score for the transaction based on relating data in the monetary transaction to data in the set of monetary transactions.2. The method of claim 1 , wherein the authentication score is generated based on a shipping address.3. The method of claim 1 , wherein the set of monetary transactions is calculated based on one or more discount coupons.4. The method of claim 3 , wherein a discount coupon is identified by relating data in transactions related to the website to data in the set of monetary transactions.5. The method of claim 3 , wherein a discount coupon is identified based on a number of same or similar purchased items.6. The method of claim 1 , wherein the authentication score is generated based on the number of product units purchased.7. The method of claim 1 , wherein the authentication score is generated based on a sequence of transactions.8. The method of claim 6 , wherein the transactions in the sequence include a similar combination of products.9. A ...

Multi-Level Data Structure Comparison Using Commutative Digesting for Unordered Data Collections

Techniques are provided for comparing multi-level data structures using commutative digesting for unordered data collections. One method comprises obtaining two multi-level data structures, wherein at least one multi-level data structure comprises an unordered data collection; determining a data structure digest value for each the two multi-level data structures by accumulating a data element digest value for each data element of the respective multi-level data structure, wherein a data element digest value for a given data element comprising an unordered data collection is determined using a commutative accumulator function; and evaluating a similarity of the two multi-level data structures by comparing the respective data structure digest values. A data element digest value for a given data element comprising an ordered data collection can be determined using a noncommutative accumulator function that aggregates a digest value for each data element using a noncommutative operation. 1. A method , comprising:obtaining at least two multi-level data structures, wherein at least one of the multi-level data structures comprises an unordered data collection;determining a data structure digest value for each of the at least two multi-level data structures by accumulating a data element digest value for each data element of the respective multi-level data structure, wherein a data element digest value, for a given data element comprising an unordered data collection, is determined using a commutative accumulator function; andevaluating a similarity of the at least two multi-level data structures by comparing the respective data structure digest values,wherein the method is performed by at least one processing device comprising a processor coupled to a memory.2. The method of claim 1 , wherein the commutative accumulator function generates a same digest value for the unordered data collection regardless of an iteration order over the unordered data collection.3. The method ...

COGNITIVE SEARCH QUERY VALIDATION

Methods, computer program products, and systems are presented. The methods include, for instance: generating domain language detection models respective to a plurality of domains. A query is mapped to a domain language detection model and intent of the query is determined by use of classification labels of the domain language detection model. Based on the classification labels that may be identified as the intent of the query, alternative queries are formed to be meaningful valid and are produced to a user. 1. A computer implemented method comprising:generating a plurality of domain language detection models respectively corresponding to respective domains from a plurality of domains;obtaining a query as submitted by a user;selecting a domain language detection model applicable to the query from the plurality of domain language detection models;determining intent of the query, wherein the determining intent includes using the domain language detection model from the selecting;formulating alternative queries based on one or more classification label corresponding to the intent of the query from the determining; andproducing the alternative queries.2. The computer implemented method of claim 1 , wherein the plurality of domain language detection models include respective hierarchies of classification labels applicable for respective content of the respective domains.3. The computer implemented method of claim 1 , wherein each of the alternative queries is semantically valid.4. The computer implemented method of claim 1 , wherein the generating a plurality of domain language detection models includes generating a plurality of domain language detection models respectively corresponding to each domain from a plurality of domains claim 1 , wherein different ones of the plurality of domains are differentiated by subject matter.5. The computer implemented method of claim 1 , wherein the method includes receiving feedback from a user as to accuracy of the alternative queries ...

SYSTEM AND METHOD OF CRAWLING WIDE AREA COMPUTER NETWORK FOR RETRIEVING CONTEXTUAL INFORMATION

A system and method for crawling a wide area computer network for retrieving contextual information. The system includes a data processing arrangement including a communication interface for accessing the wide area computer network and a web crawling module. The web crawling module is operable to receive an input file including plurality of Uniform Resource Identifiers (URIs) via a user interface, identify accessible URIs from the plurality of accessible URIs, obtain one or more features associated with accessible URIs, and execute an event for crawling the accessible URIs, the event includes creating resource cluster for executing the event, acquiring electronic record file to be executed by the resource cluster, and crawling the accessible URIs, furthermore, the web crawling module processes the extracted web content to identify contextual data. The system further includes a database arrangement communicably coupled to the data processing arrangement to aggregate contextual data therein. 1. A system that crawls a wide area computer network for retrieving contextual information , wherein the system includes a computer system , wherein the system comprises:a data processing arrangement comprising a communication interface for accessing the wide area computer network and a web crawling module, wherein the web crawling module is operable to:receive an input file via a user interface provided by the data processing arrangement, wherein the input file includes a plurality of Uniform Resource Identifiers, wherein each of the plurality of Uniform Resource Identifiers points to a corresponding web location in the wide area computer network;identify, from the plurality of Uniform Resource Identifiers, accessible Uniform Resource Identifiers based on one or more parameters associated with each of the plurality of Uniform Resource Identifiers;obtain one or more features associated with the accessible Uniform Resource Identifiers; andexecute an event for crawling the ...

SYSTEMS AND METHODS FOR DISCOVERING SOCIAL ACCOUNTS

Methods and systems allow organizations to discover accounts, subscriptions, properties, sites and other online portals within each distinct social network platform and across disparate social network platforms, publishing platforms and networks that represent, claim to represent or are relevant to their organization and/or brands based on search terms and facilitate the statistical reporting and analysis of activities on the discovered properties. 1. A method for discovering social accounts across social network platforms , the method comprising:receiving, by a computer, entity-specific input data from an entity, the entity-specific input data comprising at least one of search strings, configuration parameters, or user credentials associated with the entity;preparing, by the computer based at least on the entity-specific input data, queries for disparate social network platforms;sending, by the computer through a plurality of application programming interfaces, the queries to the disparate social network platforms;receiving, by the computer, responses to the queries from the disparate social network platforms; identifying metadata in the responses that is common across the disparate social network platforms; and', 'formatting the metadata into a common format;, 'normalizing, by the computer, the responses from the disparate social network platforms, the normalizing includingstoring, by the computer, the metadata in the common format in a unified data store;processing, by the computer, the metadata in the common format into discrete categories of brand relevance or affiliation associated with the entity; andgenerating, by the computer, a normalized view of activities across the discrete categories of brand relevance or affiliation on the disparate social networking platforms or a portion thereof.2. The method according to claim 1 , further comprising:adding additional data to the responses from the disparate social network platforms, the additional data including ...

METHOD AND SYSTEM FOR SUGGESTING REVISIONS TO AN ELECTRONIC DOCUMENT

Disclosed is a method for suggesting revisions to a document-under-analysis (“DUA”) from a seed database, the seed database including a plurality of original texts each respectively associated with one of a plurality of final texts. The method includes tokenizing the DUA into a plurality of statements-under-analysis (“SUAs”), selecting a first SUA of the plurality of SUAs, generating a first similarity score for each of the plurality of the original texts, the similarity score representing a degree of similarity between the first SUA and each of the original texts, selecting a first candidate original text of the plurality of the original texts, and creating an edited SUA (“ESUA”) by modifying a copy of the first SUA consistent with a first candidate final text associated with the first candidate original text. 127-. (canceled)28. A computer-implemented method for priming a seed database for suggesting revisions to text data , the method comprising:obtaining a sample database comprising a plurality of sample original texts and a plurality of sample final texts, wherein each sample original text is associated with a respective sample final text;obtaining an input comprising an indication of a user preference;determining that one or more of the plurality of sample originals texts and the plurality of sample final texts is consistent with the user preference;loading, into the seed database, the determined one or more of the plurality of sample texts and the plurality of sample final texts consistent with the user preference;obtaining an electronic document under analysis (DUA); anddetermining, using the seed database, an edit operation to apply to the DUA.29. The method of claim 28 , wherein the determined edit operation is consistent with the user preference.30. The method of claim 28 , further comprising:applying the determined edit operation to the DUA.31. The method of claim 28 , further comprising:providing a questionnaire to a user, wherein the obtained input ...

UPDATING AUTOMATIC PAYMENT METHOD TO AVOID SERVICE DISRUPTION

A device may obtain access to an email account associated with a user. The device may scan a set of emails in the email account associated with the user for one or more indicators related to an expiration status of an automatic payment method. The device may detect one or more emails in the scanned set of emails that contain the one or more indicators related to the expiration status of the automatic payment method. The device may perform one or more actions to maintain continuous service for one or more recurring payment accounts associated with the automatic payment method. The device may communicate with one or more merchant devices associated with the one or more recurring payment accounts to automatically replace the automatic payment method with an updated payment method. 1. A method , comprising:receiving, by a device, a token from an authentication server;providing, by the device, the token to an email server associated with an email account associated with a user;obtaining, by the device, access to the email account associated with the user based on providing the token to the email server;scanning, by the device, a set of emails in the email account associated with the user for one or more first key words related to an expiration status of an automatic payment method;detecting, by the device and based scanning the set of emails, the automatic payment method has expired or will be expiring within a threshold period;identifying, by the device, based on one or more second key words, and based on detecting the automatic payment method has expired or will be expiring within the threshold period, one or more recurring payment accounts associated with the automatic payment method that has expired or will be expiring within the threshold period;sending, by the device and to a user device, one or more messages including information related to the one or more recurring payment accounts associated with the automatic payment method that has expired or will be expiring ...

METHODS AND APPARATUS TO STRUCTURE PROCESSOR SYSTEMS TO DETERMINE TOTAL AUDIENCE RATINGS

Methods, apparatus, systems, and articles of manufacture are disclosed to determine total audience ratings. An example apparatus includes metrics generator circuitry to generate a first audience size for media accessed by first devices of a first media platform at a first level of aggregation, the first level of aggregation corresponding to the media accessed on a first television network and on a first website, generate a second audience size for the media accessed by the first devices of the first media platform at a second level of aggregation, the second level of aggregation corresponding to the media accessed on the first television network and accessed on the first website and a second website, comparator circuitry to compare the first audience size to the second audience size, adjustor circuitry to reduce the first audience size based on the second audience size, and audience determination circuitry to determine a total audience size. 1. An apparatus to determine a total audience size , the apparatus comprising:interface circuitry; and at least one of a central processor unit, a graphic processor unit, or a digital signal processor, the at least one of the central processor unit, the graphic processor unit, or the digital signal processor having control circuitry to control data movement within the processor circuitry, arithmetic and logic circuitry to perform one or more first operations corresponding to instructions, and one or more registers to store a result of the one or more first operations, the instructions in the apparatus;', 'a Field Programmable Gate Array (FPGA), the FPGA including logic gate circuitry, a plurality of configurable interconnections, and storage circuitry, the logic gate circuitry and interconnections to perform one or more second operations, the storage circuitry to store a result of the one or more second operations; or', 'Application Specific Integrate Circuitry (ASIC) including logic gate circuitry to perform one or more third ...

Detection of Warranty Expiration and Forwarding Notification

Aspects described herein may include detecting, by a browser extension, a checkout page for the purchase of an item using a credit card. Product transaction data and a warranty expiration date of the purchased item may be retrieved, and the warranty expiration date of the purchased item may be stored. Creation of a notification to be sent to the user prior to the warranty expiration may be scheduled. The notification, which includes the warranty expiration date of the purchased item, may then be forwarded to the user through the browser extension. 1. A computer-implemented method comprising:detecting, through a browser extension on a user's computer during a first browsing session, that the user has submitted a checkout page for a transaction using a credit card;retrieving, by the browser extension, product transaction data regarding an item purchased by the user with the credit card during the transaction, the product transaction data including a product identification code and a transaction date,retrieving, by the browser extension, a warranty expiration date of the purchased item based on the transaction date;storing the product identification code of the item purchased by the user during the browsing session and the warranty expiration date of the item purchased by the user;scheduling creation of a notification to be sent to the user on a notification date that is a pre-determined number of days before the warranty expiration date of the purchased item; andforwarding to the user on or after the notification date, the notification through the browser extension during a second browsing session, the notification including the warranty expiration date of the purchased item.2. The computer-implemented method of claim 1 , further comprising the step of retrieving product transaction data regarding the purchased item from a vendor selling the purchased item to the user claim 1 , the transaction data including the product identification code and a warranty length.3. The ...

SYSTEMS AND METHODS OF INCREMENTED AGGREGATED DATA RETRIEVAL

Systems and methods are provided for receiving, at a server, a request for data from a plurality of services. The server may receive a first portion of the data that is available from at least one of the plurality of services at a first time, and may transmit the received first portion of data via a communications network. The server may receive a second portion of the data of the data that is newly available from at least one of the plurality of services at a second time that is different from the first time, and may transmit the received second portion of data via the communications network. The requested data from the plurality of services may be provided in separate portions to be processed as the requested data becomes available. 1. A method comprising:receiving, at a server, a request for data from a plurality of services;receiving, at the server, a first portion of the data that is available from at least one of the plurality of services at a first time, and transmitting the received first portion of data via a communications network; andreceiving, at the server, a second portion of the data of the data that is newly available from at least one of the plurality of services at a second time that is different from the first time, and transmitting the received second portion of data via the communications network,wherein the requested data from the plurality of services is provided in separate portions to be processed as the requested data becomes available.2. The method of claim 1 , wherein the transmitting the received second portion of data comprises transmitting the received first portion of data and the received second portion of data as part of the same response.3. The method of claim 1 , further comprising:receiving, at a client device communicatively coupled to the communications network, at least one of the first portion of data and second portion of data; andprocessing, at a processor of the client device, the received at least one of the first portion ...

HYBRID TASK ASSIGNMENT FOR WEB CRAWLING

A computer-implemented method and/or computer program product selectively assigns a task using a hybrid task assignment process. One or more processors direct a working hardware node in a network to crawl a particular application, thus causing the working hardware node to encounter a task in the particular application. The processor(s) selectively handle the task according to whether the task is reserved for dynamic assignment to an other hardware node in the network, such that in response to a determination that the task encountered is not reserved, the task is handled by the working hardware node that is crawling the particular application, and in response to a determination that the task encountered is reserved, the task encountered is sent to a central unit for dynamic assignment to the other hardware node in the network. 1. A computer-implemented method for hybrid task assignment , the computer-implemented method comprising:directing, by one or more processors, a working hardware node in a network to crawl a particular application, wherein crawling the particular application results in the working hardware node encountering a task in the particular application; andselectively handling, by one or more processors, the task according to whether the task is reserved for dynamic assignment to an other hardware node in the network, wherein in response to a determination that the task encountered is not reserved, the task is handled by the working hardware node that is crawling the particular application, and wherein in response to a determination that the task encountered is reserved, the task encountered is sent to a central unit for dynamic assignment to the other hardware node in the network.2. The computer-implemented method of claim 1 , wherein said crawling claim 1 , by the working hardware node claim 1 , the particular application comprises:selecting a mapping function for use with a target application;distributing tasks in a set of tasks according to the ...

DATA FLOW VIEW FOR A SPREADSHEET

The system includes an input interface and a processor. The input interface is to receive a spreadsheet and an indication of a spreadsheet cell of interest. The processor is to determine a first set of spreadsheet cells that the spreadsheet cell of interest depends on, determine a second set of spreadsheet cells that depend on the spreadsheet cell of interest, provide a spreadsheet cell data flow view for the spreadsheet cell of interest based at least in part on the first set of spreadsheet cells and the second set of spreadsheet cells, and in the event an indication of a new spreadsheet cell of interest is received, provide a spreadsheet cell data flow view for the new spreadsheet cell of interest. 1. (canceled)2. A system for a data flow view for a spreadsheet , comprising:an input interface to receive a spreadsheet and an indication of a spreadsheet cell of interest; and determine a first set of spreadsheet cells that the spreadsheet cell of interest depends on;', 'determine a second set of spreadsheet cells that depend on the spreadsheet cell of interest;', 'provide a spreadsheet cell data flow view for the spreadsheet cell of interest based at least in part on the first set of spreadsheet cells and the second set of spreadsheet cells;', 'provide a spreadsheet cell data flow view for the new spreadsheet cell of interest;', 'in the event an indication of a new spreadsheet cell of interest is received, 'receive a set of spreadsheets and an indication of a spreadsheet of interest of the set of spreadsheets;', 'determine spreadsheets of the set of spreadsheets that depend on the spreadsheet of interest;', 'determine spreadsheets of the set of spreadsheets that the spreadsheet of interest depends on; and', 'provide a spreadsheet data flow view for the spreadsheet of interest, wherein spreadsheet data flow information is based at least in part on the spreadsheets of the set of spreadsheets that depend on the spreadsheet of interest and the spreadsheets of the set of ...

Querying Across a Composite Join of Multiple Database Tables Using a Search Engine Index

A computer system executes a user-supplied query across multiple relational database tables linked by a common key. A new query form, called a composite join, takes a user-supplied query including one or more terms optionally joined by logical operations, an identification of two or more tables and an identification of a common join key shared across the tables. The composite join applies the query across the tables such that any of the query terms can be matched by any of the tables. A query is performed across all tables for each query term and any join keys associated with matching records from the tables are identified in a set of join keys associated with the respective term. The logical operations are then performed on the resulting sets of join keys to combine the results of the term queries according to the user query. 1. A system , comprising:a processor; and [ one or more unitary queries;', 'one or more Boolean operations applied to the one or more unitary queries;', 'an identification of a plurality of join tables of a plurality of relational databases; and', 'an identification of a join field;, 'receiving a composite join query comprising, 'generating a Boolean tree based on the composite join query;', 'traversing the generated Boolean tree to generate a plurality of matching join key sets, wherein each respective matching join key set of the plurality of matching join key sets comprises one or more join keys of one or more respective matching documents from the plurality of join tables for a respective query node of the Boolean tree;', 'filtering the matching documents to remove matching documents with join keys that do not match the one or more unitary queries of the composite join query; and', 'providing an identification of the filtered matching documents as results of the composite join query., 'a memory, accessible by the processor, the memory storing instructions that, when executed by the processor, cause the processor to perform actions ...

SYSTEMS AND METHODS FOR CANCELLING A QUERY

Systems and methods for querying a database are disclosed. A server computing device includes a processor and a memory storing instructions that, when executed by the processor, cause the server computing device to: receive a query input from a client device over a network connection; establish a non-blocking socket between the client computing device and the server computing device; generate a database query based on the query input; cause the database query to begin executing against one or more databases; perform a read request on the non-blocking socket; receive a code in response to the read request on the non-blocking socket; determine whether the network connection exists between the client device and the server device based on the received code; and cause the database query to be cancelled when the server determines that the network connection does not exist between the client device and the server device. 120.-. (canceled)21. A method for querying a database , comprising:receiving, by a server computing device, a query input from a client computing device over a network connection;establishing a non-blocking socket between the client computing device and the server computing device wherein the non-blocking socket automatically returns an error code when the client computing device fails to transmit data to the server computing device;generating by the server computing device, a database query against a database based on the input query and causing the database query to begin executing against one or more databases;responsive to the database query executing, performing, by the server computing device, a read request on the non-blocking socket wherein the read request is an automated request for the client computing device to transmit data to the server computing device through the non-blocking socket;receiving the error code in response to the read request on the first non-blocking socket;determining whether the network connection exists between the client ...

OPTIMIZATION APPARATUS AND METHOD OF CONTROLLING OPTIMIZATION APPARATUS

An optimization apparatus includes hardware circuits configured to function as a random number generator configured to operate either in a first operation mode in which to generate a random number sequence after performing an initialization or in a second operation mode in which to generate a random number sequence without performing the initialization, an annealing calculation unit configured to perform an annealing process by use of random numbers generated by the random number generator, and an operation instruct unit configured to cause the random number generator to start operating in the first operation mode when the annealing calculation unit starts the annealing process, to cause the random number generator to stop operating when the annealing calculation unit, suspends the annealing process, and to cause the random number generator to restart operating in the second operation mode when the annealing calculation unit restarts the annealing process. 1. An optimization apparatus comprisinghardware circuits configured to function as:a random number generator configured to operate either in a first operation mode in which to generate a random number sequence after performing an initialization or in a second operation mode in which to generate a random number sequence without performing the initialization;an annealing calculation unit configured to perform an annealing process by use of random numbers generated by the random number generator; andan operation instruct unit configured to cause the random number generator to start operating in the first operation mode when the annealing calculation unit starts the annealing process, to cause the random number generator to stop operating when the annealing calculation unit suspends the annealing process, and to cause the random number generator to restart operating in the second operation mode when the annealing calculation unit restarts the annealing process.2. The optimization apparatus as claimed in claim 1 , ...

BUILDING A BASE INDEX FOR SEARCH

Embodiments of the disclosed technologies are capable of calculating a boundary value N as a function of a parameter M; for each of M first-level partitions of a set of data records, building an index for use by a downstream application by (i) building N second-level partitions using the key; indexing the N second-level partitions to produce N micro-shards; determining a value of a number of tiers parameter, T, and, for each tier, a value of a partitions per merge parameter P, merging the N micro-shards using T tiers and, for each tier, Ppartitions per merge, distributed across a plurality of host machines; where M, N, T, and Pare each a positive integer and a value of M is determined based on the downstream application. 1. A method comprising , by a search index building system:determining a value of a number of partitions parameter, M, based on a downstream application;creating M first-level partitions of a set of data records using a key;calculating a boundary value N as a function of M;for each of the M first-level partitions, building an index for use by the downstream application by(i) building N second-level partitions using the key;(ii) indexing the N second-level partitions to produce N index micro-shards;{'sub': 'MT', '(iii) determining a value of a number of tiers parameter, T, and, for each tier, a value of a partitions per merge parameter P,'}{'sub': 'MT', '(iv) merging the N index micro-shards using T tiers and, for each tier, Ppartitions per merge, distributed across a plurality of host machines;'}{'sub': 'MT', 'wherein M, N, T, and Pare each a positive integer.'}2. The method of claim 1 , further comprising grouping data records of the set of data records according to the key to produce a single data record for each value of the key.3. The method of claim 1 , further comprising calculating N as a co-prime of M.4. The method of claim 1 , further comprising creating the N second-level partitions using hash partitioning and the key as an input to the ...

Method and apparatus for scalable sorting of a data set

Embodiments of the present invention pertain to a method and apparatus for a scalable sorting of a data set in a database on a computer system. A number of contiguous ranges spanning the data set are defined. Each individual data value of the data set is assigned to a range to which it falls into. The values in the ranges are then sorted. The sorting can be performed by different nodes in parallel. Once the sorting is completed, the results are stored in contiguous memory locations. This results the overall data set being sorted.

SERVER, METHOD AND SYSTEM FOR PROVIDING INFORMATION SEARCH SERVICE BY USING SHEAF OF PAGES

Disclosed is a method, system, and server for providing an information search service. The method of providing a group search service includes: creating patterns of position information of collected data by analyzing the position information concerning positions on which the collected data is initially located; grouping the collected data into data groups based on the created position information patterns; and selecting a data group related to a keyword from among the data groups and providing a group search result. 1. A method of providing a group search service , comprising:(a) creating patterns of position information of collected data by analyzing the position information concerning positions on which the collected data is initially located;(b) grouping the collected data into data groups based on the created position information patterns; and(c) selecting a data group related to a keyword from among the data groups and providing a group search result.2. The method of claim 1 , wherein the position information includes Uniform Resource Locator (URL) information of the collected data claim 1 , and the position information pattern includes a grouping field for grouping the data as a predetermined pattern shared by the collected data.3. The method of claim 1 , wherein the operation (b) comprises:(b1) grouping the different position information patterns based on a relation between the position information patterns acquired through position information pattern tree information to create a group of the position information patterns; and(b2) grouping web pages into a web page group based on the grouping field of the position information pattern among the group of position information patterns.4. The method of claim 1 , wherein the group search result is obtained depending on at least one of a correlation between each of the data groups and the keyword claim 1 , the number of documents created during a predetermined time claim 1 , and the number of accesses to each of ...

METHOD FOR EXECUTING A SEARCH AGAINST DEGRADED IMAGES

A method by which degraded images are included in an image search result set is depicted. The method employs a convolutional neural net to analyze and compare a base sample image against all publicly hosted images available on the internet. Well-known AI libraries, such as ResNet 50 are used due to their superior exposure to prevalent images found on the internet. The first and fourth layers as derived by the CNN are reserved as the feature set of the image(s), which are then used for classification and prediction of objects of the image(s). These feature are stored in an ANN-Index to facilitate execution of Euclidean distance calculations and cosign similarity to produce similar images based on features. 1. A method for executing an image search against any and all images hosted to the internet comprising:a computer capturing at least one target subject image for the basis of the image search;the computer executing a broad image search of the internet based on the at least one target subject image;the computer returning a first result set that contains degraded images, against which an artificial intelligence of the computer is equipped to analyze to determine if the degraded images are pertinent results to ultimately display as a final output;the computer returning a second result set that contains non-degraded images, against which an artificial intelligence of the computer is equipped to analyze to determine if the non-degraded images are pertinent results to ultimately display as a final output;the computer running the first result set and second result set through a Convolutional Neural Net (CNN) and preserving the first and fourth layers of the resulting image analysis of the CNN as a feature set of the at least one target image;the computer storing the feature set in at least one Approximate Nearest Neighbor (ANN) index;the ANN-index facilitating the execution of Euclidean distance calculations on objects of the image to eliminate the need for image ...

SYSTEMS AND METHOD FOR SEARCHING AND ANALYZING BIG DATA BACKGROUND

Systems and methods are provided for ranking and querying statistical analysis results of database contents for the purpose of populating search engine query results with novel content. 16-. (canceled)7. A method for analyzing data , comprising:receiving a text search query input by a user; and retrieval of a plurality of stored findings each including records that each include a text field matching the received text search query,', 'calculation of a statistical result of the retrieved plurality of stored findings,', 'normalization of the statistical result, and', 'ranking of query results to be provided to the user by ranking the normalized statistical result based on hits of the received text search query with the text fields of the records., 'in response to receiving the text search query, a processor executing instructions that cause8. The method of claim 7 , further comprising the processor executing instructions that cause a user interface to provide the ranked query results to the user in faceted form for collections of related ones of a plurality of data sources from which the plurality of stored findings were retrieved.9. The method of claim 8 , further comprising the processor executing instructions that cause the user interface to also provide the ranked query results to the user in list form.10. The method of claim 7 , wherein the retrieved plurality of stored findings include findings that are sub-network intersections of findings across a plurality of different data sources.11. The method of claim 7 , wherein the statistical result includes a p-value and a strength of effect;the processor executes instructions that cause calculation of a weighted test result using the strength of effect;the processor executes instructions that cause ranking of the weighted test results from largest to smallest;the processor executes instructions that cause calculation of a relevance score for each weighted test result; andthe normalization of the statistical result ...

AGGREGATING PERSONALIZED SUGGESTIONS FROM MULTIPLE SOURCES

A computer provides a search interface that accesses multiple search providers, and aggregates their suggestions, providing a single, unified suggestion view across the multiple search providers. Suggestions are received from the multiple sources, such as a search engine on the internet or other public resource, and a search tool on the computer that accesses local or private resources. The suggestions are combined, ranked and displayed as a list to the user, from which the user is able to select. 1. A method performed by one more computing devices , the one or more computing devices comprising respective processing hardware and storage hardware , the method comprising:displaying a query input area, receiving a query string inputted therein, and sending the query string to a plurality of search providers;receiving, from each search provider, a respective resource suggestion set, each resource suggestion set comprising a respective set of resource suggestions, each resource suggestion comprising a resource indication and a resource name for a corresponding resource;for each received suggestion set, ranking the resource suggestions therein relative to each other;ranking the resource suggestion sets relative to each other;displaying suggestion set representations, wherein each suggestion set representation comprises resource names of a corresponding suggestion set, wherein each suggestion set representation's resource names are displayed contiguously within the suggestion set representation according to the rankings of the corresponding resource suggestions, wherein the suggestion set representations are displayed in order relative to each other according to the rankings of the corresponding suggestion sets, and wherein each suggestion set representation comprises resource names of only the corresponding suggestion set; andresponding to a user input selecting a displayed resource name by using the corresponding resource indication to access the corresponding resource.2 ...

METHOD AND SYSTEM FOR MANAGING NETWORK OF FIELD-SPECIFIC ENTITY RECORDS

Disclosed is a method of managing a network of field-specific entity records. The method comprises accessing the network of field-specific entity records comprising at least one pair of field-specific entity records within at least one field segment, wherein the at least one pair of field-specific entity records is associated with relations therebetween, and wherein the at least one pair of field-specific entity records comprises a first pair of field-specific entity records and at least one second pair of field-specific entity records; determining a weightage score of each of the relations between the at least one pair of field-specific entity records; determining an importance score of each field-specific entity record; determining a change in the importance score, and/or the weightage score of a relation between field-specific entity records of the at least one second pair of field-specific entity records; and updating the network of field-specific entity records. 1. A method of managing a network of field-specific entity records , wherein the method comprises:a) accessing the network of field-specific entity records comprising at least one pair of field-specific entity records within at least one field segment, wherein the at least one pair of field-specific entity records is associated with relations between the at least one pair of field-specific entity records, and wherein the at least one pair of field-specific entity records comprises a first pair of field-specific entity records and at least one second pair of field-specific entity records;b) determining a weightage score of each of the relations between the at least one pair of field-specific entity records;c) determining an importance score of each field-specific entity record based on a plurality of entity attributes of the field-specific entity record and relations of the field-specific entity record with other field-specific entity records within at least one field segment;d) determining a change in ...

RANKING SEARCH RESULTS BASED UPON CONTENT CREATION TRENDS

Embodiments of the present invention provide a method, system and computer program product for ranking search results based upon content creation trends. In an embodiment of the invention, a method for ranking search results based upon content creation trends includes first receiving a set of results from a search engine produced in response to a search engine query of one or more search terms. The method additionally includes ranking the results of the result set according to at least one ranking factor. The method yet further includes retrieving trend data for terms associated with either or both of the results and/or the search terms. Finally, the method includes weighting the ranked results in the result set according to the retrieved trend data. 1. A method for ranking search results based upon content creation trends , the method comprising:executing a search engine query of a plurality of search terms in a search engine of a computer comprising memory and at least one processor;receiving a result set of results from the search engine produced in response to the search engine query of the plurality of search terms;ranking the results of the result set by the processor in the memory of the computer according to at least one ranking factor;identifying one or more related terms related to the search terms and submitting both the search terms and the related terms by the processor to a trend feed over a computer communications network, and retrieving in response, trend data indicating which of the search terms are trending popular and which of the search terms are not trending popular; and,identifying ones of the results in the result set present in the result set in correspondence to ones of the search terms and the related terms determined to be trending popular according to the retrieved trend data and weighting by the processor the ranked results in the result set according to the retrieved trend data.2. The method of claim 1 , wherein ranking the results of ...

SYSTEM AND METHOD FOR DETERMINATION AND MANAGEMENT OF ROOT CAUSE FOR INVENTORY PROBLEMS

Scans of a selected product on shelves of a retail store are obtained and the scans are transmitted over a network via a transceiver circuit. A perpetual inventory (PI) value is stored for a selected product in a database. A data structure includes a first category and first actions programmatically linked to the first category. When the selected product is out-of-stock and when the PI value is greater than a predetermined threshold, one or more of the first actions associated with the first category are performed. 1. A system configured to determine and manage inventory values of out-of-stock products in a retail store , the system comprising:a product display unit that is disposed at a retail store;a sensor disposed in proximity to the product display unit at the retail store, the sensor configured to obtain scans of a selected product at the product display unit;a database that is configured to store a perpetual inventory (PI) value for a selected product, the database further configured to store a data structure, the data structure including a first category and first actions that are programmatically linked to the first category;wherein the PI value of the selected product relates to the number of a selected products in the retail store and is increased as amounts of the selected product are shipped and received at the store and is decreased as amounts of the selected product are sold and removed from the store; retrieve the PI value for the selected product from the database;', 'receive the scans from the sensor;', 'determine when the selected product is out-of-stock based upon an analysis of the scans;', 'when the selected product is out-of-stock and when the PI value is greater than a predetermined threshold, adjust the PI value of the selected product and perform one or more of the first actions associated with the first category according to the data structure and according to actions performed with respect to the PI of the selected product at other retail ...

Systems and Methods for Cancelling a Query

Systems and methods for querying a database are disclosed. A server computing device includes a processor and a memory storing instructions that, when executed by the processor, cause the server computing device to: receive a query input from a client device over a network connection; establish a non-blocking socket between the client computing device and the server computing device; generate a database query based on the query input; cause the database query to begin executing against one or more databases; perform a read request on the non-blocking socket; receive a code in response to the read request on the non-blocking socket; determine whether the network connection exists between the client device and the server device based on the received code; and cause the database query to be cancelled when the server determines that the network connection does not exist between the client device and the server device. 1. A computer-implemented method when executed by data processing hardware causes the data processing hardware to perform operations comprising:receiving, from a user, a first query requesting query results from a plurality of tables associated with a database storing user data;generating a query processing identifier for the first query;while the first query is executing, determining, using the query processing identifier, that the first query should be canceled; andin response to determining that the first query should be canceled, instructing, using the query processing identifier, the database to stop the first query.2. The method of claim 1 , wherein the plurality of tables associated with the database storing the user data correspond to tables generated by the user.3. The method of claim 1 , wherein the plurality of tables associated with the database storing the user data correspond to a query model claim 1 , wherein each table of the plurality of tables corresponds to a respective node of the query model and comprises one or more data fields.4. The ...

GENERATING SEARCH KEYWORD SUGGESTIONS FROM RECENTLY USED APPLICATION

A computer provides search suggestions by capturing data from a first application, wherein the data includes data displayed on a screen by the first application. The computer segments the data from the first application into blocks. The computer extracts words from the data from the first application. The computer generates tokens of phrases and words using natural language processing tokenization. The computer scores the blocks based upon the data from the first application. The computer scores the tokens based upon the scoring of the blocks and the data from the first application. The computer detects a switch action from the first application to a second application, wherein the second application contains a search function. The computer provides the scored tokens to the search function of the second application. 1capturing, by a computer, data from a first application, wherein the data includes data displayed on a screen by the first application, includes data on user behavior in the first application, includes characters a user selected in the first application, includes one or more locations the user clicked in the first application, and includes one or more locations the user's cursor was located in the first application;segmenting, by the computer, the data from the first application into blocks;extracting, by the computer, words from the data from the first application using natural language processing;generating, by the computer, tokens of phrases and words using natural language processing tokenization;retrieving, by the computer, stored significance data for the first application, wherein the stored significance data is stored on a remote computer, is aggregated from more than one user, includes prior determinations of blocks for the first application, includes significance values for blocks, and includes a number of times a block has resulted in a search by the user;scoring, by the computer, the blocks based upon the data from the first application and ...

METHOD AND SYSTEM FOR AUTOMATICALLY ENRICHING COLLECTED SEEDS WITH INFORMATION EXTRACTED FROM ONE OR MORE WEBSITES

Methods and systems are provided for automatically enriching collected seeds. Each website that is associated with each collected seed is processed via a web crawler that crawls a home webpage for the company associated with that collected seed to verify, based on similarity between company name and website name, that a website associated with that home page belongs to that company. When verification is successful, other webpages on the website are processed to fetch information using different extractor algorithms each being designed to fetch a specific attribute for that company. Search engine(s) and third-party APIs can also be used to collect additional company information that can be added to each collected seed. Each collected seed is then enriched by adding all of the additional company information to the original seed data. 1. A system for automatically generating a repository of company profiles , the system comprising:a plurality of independent seed source services each being configurable to cause crawling of web pages to collect seeds from different web-based sources;a repository configurable to cause store the collected seeds; and receiving the collected seeds from the seed master module, wherein each of the collected seeds comprises: original seed data that includes a plurality of attributes each having a type and an associated value, wherein each value is a specific piece of structured or unstructured information associated with a particular company;', 'fetching additional company information for each of the collected seeds from a plurality of different web-based sources; and', 'adding the additional company information to each of collected seeds to enrich that collected seed to generate an enriched company seed, wherein each enriched company seed comprises: values for each attribute from the original seed data prior to enrichment, one or more websites that are associated with that enriched company seed, and additional values for attributes that have ...

MAINFRAME WORKFLOW MANAGER SYSTEM AND METHOD

A mainframe workflow creation method creates and manages managing workflow tasks in a mainframe workflow management system. The method includes activating a workflow creation engine in the mainframe workflow management system by a user of a computing device using a web dashboard, communicating with the mainframe workflow management system over a communication network, and creating workflow tasks corresponding to a mainframe workflow. The method also includes associating the workflow tasks with a mainframe workflow process, and selecting a target mainframe computing system from a plurality of target mainframe computing systems for execution of the mainframe workflow process. The method further includes transmitting the mainframe workflow process to the selected target mainframe computing system over the communication network, and executing the mainframe workflow process, including plurality of workflow tasks, by the selected target mainframe computing system. 1. A mainframe workflow creation method for creating and managing workflow tasks in a mainframe workflow management system , the method system comprising:activating a workflow creation engine in the mainframe workflow management system by a user of a computing device using a web dashboard, and communicating with the mainframe workflow management system over a first communication network;creating, by a processor in the mainframe workflow management system using the mainframe workflow creation engine, one or more workflow tasks corresponding to a mainframe workflow composed of a plurality of workflow tasks;associating, by the processor using the mainframe workflow creation engine, the one or more workflow tasks with a mainframe workflow process composed of a plurality of workflow tasks;selecting a target mainframe computing system from a plurality of target mainframe computing systems for execution of the mainframe workflow process composed of the plurality of workflow tasks;transmitting the mainframe workflow ...

DATACENTER OPERATIONS USING SEARCH AND ANALYTICS

A datacenter management system uses data collection proxies to collect performance data and configuration data for different physical and virtual entities in the datacenter. A schema is used to represent the different entities, entity relationships, and entity properties in the datacenter. A search engine identifies the intent of a natural language based search query based on the schema and a datacenter dictionary. The search engine then searches the data based on the search query intent. A dictionary manager converts both periodic and aperiodic data into a time series. This allows the search engine to operate as a time machine identifying both performance data and configuration data for any selectable time period. 120-. (canceled)21. A method , comprising:receiving, by a computing device, a natural language based search query for information associated with managing operation of a datacenter;accessing hierarchal relationships of virtual entities relevant to the natural language based search query;performing a natural language based search, by the computing device, of data pertaining to operation of the data center based on the hierarchical relationships; andgenerating, by the computing device, results of the natural language based search other than results from a keyword based search.22. The method of claim 21 , wherein accessing the hierarchal relationships comprises converting a join into a union.23. The method of claim 22 , wherein converting the join into the union includes combining a plurality of parsers in response to the natural language based search query comprising a compound query.24. The method of claim 23 , wherein accessing the hierarchal relationships comprises pushing down a disjunction that is part of the compound query.25. The method of claim 24 , wherein accessing the hierarchal relationships comprises pushing down the disjunction in response to the compound query joining two tables having a same primary key.26. The method of claim 21 , further ...

REWARDS PROGRAM

The rewards program system and method provide an efficient and effective way for customers to enroll in rewards programs, and accrue and redeem rewards at participating merchants. The system generates promotions, analyzes transaction data to identify whether a customer used a promotion, issued by the system (e.g., promotions provider), with a merchant. When the customer redeems a promotion, the system accrues reward amounts in a customer account, and allows the customer to redeem accrued rewards amounts. The system generates credit card profiles and customer profiles, and offers customers subsequent promotions based on the transaction data and/or the customer's customer profile. The system issues the customer subsequent promotions when the amount credited to the rewards account satisfies a redemption threshold. The subsequent promotions may be redeemable at merchants that have promotions issued by the promotion provider, including the merchant where the promotion was used that resulted in the credited amount. 124.-. (canceled)25. A method comprising:receiving transaction data indicative of a transaction;determining whether the transaction data is indicative of a transaction between a non-registered customer and a registered merchant based on a determination that the customer is not registered and that the merchant is the registered merchant;in an instance in which the determination is made that the transaction involves a non-registered customer, determining whether a credit card number matches at least one previously used credit card in a rewards database, and in an instance in which the credit card number does match a previously stored credit card, indicating that that the system has previously reviewed transaction data associated with the credit card number and has previously created a credit card profile from the credit card number, storing the transaction data with the previously created credit card profile, and in an instance in which the credit card number ...

EVALUATING SEMANTIC INTERPRETATIONS OF A SEARCH QUERY

The present disclosure relates to evaluating different semantic interpretations of a search query. One example method includes obtaining a set of search results for a particular search query submitted to a search engine; obtaining a set of semantic interpretations for the particular search query; obtaining, for each semantic interpretation of the set, a canonical search query; generating a modified search query based at least in part on the particular search query and the canonical search query for the semantic interpretation; obtaining a set of search results for the modified search query for the semantic interpretation; and determining, for each semantic interpretation of the set, a degree of similarity between (i) the set of search results of the modified search query for the semantic interpretation, and (ii) the set of search results for the particular search query. 1. A computer-implemented method executed by one or more processors , the method comprising:obtaining a set of search results for a particular search query submitted to a search engine, wherein the particular search query includes a substring that is a subset of terms of the query, and where the subset of terms can identify a plurality of different entities;obtaining a set of semantic interpretations for the particular search query, each semantic interpretation representing a candidate intent associated with a particular entity, wherein each particular entity is different from each other particular entity and is one of the plurality of different entities;obtaining, for each semantic interpretation of the set, a canonical search query; wherein the second set of terms were not included in the particular search query;', 'the substring of terms and the second set of terms identity the particular entity associated with the candidate intent for the canonical query;, 'modifying, in the particular search query, the substring included in the particular search query to include (i) the substring of terms and ( ...

Computerized methods of data compression and analysis

A computerized method and apparatus compresses symbolic information, such as text. Symbolic information is compressed by recursively identifying pairs of symbols (e.g., pairs of words or characters) and replacing each pair with a respective replacement symbol. The number of times each symbol pair appears in the uncompressed text is counted, and pairs are only replaced if they appear more than a threshold number of times. In recursive passes, each replaced pair can include a previously substituted replacement symbol. The method and apparatus can achieve high compression especially for large datasets. Metadata, such as the number of times each pair appears, generated during compression of the documents can be used to analyze the documents and find similarities between two documents. 1. A computerized method of compressing symbolic information organized into a plurality of documents , each document having a plurality of symbols , the method comprising: (i) identifying a plurality of symbol pairs, each symbol pair consisting of two sequential symbols in the input document; and', '(ii) for each unique symbol pair of the plurality of symbol pairs, updating a count identifying the number of appearances of the unique symbol pair; and, '(a) with a first document of the plurality of documents as an input document, automatically with a computer(b) producing a compressed document by causing the compressed document to include, at each position associated with one of the plurality of symbol pairs from the input document, a replacement symbol associated by a compression dictionary with the unique symbol pair matching the one of the plurality of symbol pairs, if the count for the unique symbol pair exceeds a threshold, wherein the replacement symbol comprises an address of an entry in the compression dictionary, which entry stores the unique symbol pair associated with replacement symbol.2. The method of wherein the threshold is two.3. The method of further comprising sorting the ...

SYSTEMS AND METHODS FOR VIDEO CONTENT ASSOCIATION

The present invention describes methods and apparatus to associate video content. An exemplary embodiment of the present invention provides a method for associating video content involving the steps of requesting a webpage by a user computer and determining whether a keyword is present on the webpage requested by the user computer. Furthermore, the method includes the step of creating a link on the webpage from the keyword to the video file. Additionally, the method involves displaying the video file when the link is activated. 120-. (canceled)21. A method for augmenting webpages to provide video content , the method comprising the following operations performed by at least one processor:identifying a plurality of keywords contained in a webpage;modifying the webpage to include a link associated with at least one of the identified keywords, the link providing access to first video content correlated with the at least one keyword;causing the first video content to be presented to a user in response to user interaction with the link on the webpage;updating the link to provide access to second video content, the second video content being different from the first video content; andsubsequent to updating the link, causing the second video content to be presented to a user in response to user interaction with the link on the webpage.22. The method of claim 21 , wherein at least one of the first video content and the second video content comprise video content related to a topic that is associated with the at least one of the identified keywords.23. The method of claim 21 , further comprises updating the link to provide access to second video content claim 21 , wherein the link is updated when the second video content is dynamically prioritized based on the analyzed existing rules claim 21 , over the first video content.24. The method of claim 22 , further comprising displaying a pre-roll advertisement prior to the display of the first video content or the second video ...

INFORMATION PROCESSING DEVICE AND NON-TRANSITORY COMPUTER READABLE MEDIUM

An information processing device includes an acquisition unit, a division unit, and a determination unit. The acquisition unit is configured to acquire content for which index data is to be created. The division unit is configured to divide the content into predetermined blocks. The determination unit is configured to refer to unnecessary term information and determine a region in each block that is not allowed to be referred to when the index data of the content is created. In the unnecessary term information, an unnecessary term is specified among terms included in the content. The unnecessary term is a term that is not allowed to be registered in the index data. 1. An information processing device comprising:an acquisition unit configured to acquire content for which index data is to be created;a division unit configured to divide the content into predetermined blocks; anda determination unit configured to refer to unnecessary term information and determine a region in each block that is not allowed to be referred to when the index data of the content is created, whereinin the unnecessary term information, an unnecessary term is specified among terms included in the content, andthe unnecessary term is a term that is not allowed to be registered in the index data.2. The information processing device according to claim 1 , wherein integrates an appearance frequency of the unnecessary term included in the content for each block, and', 'determines the region in each block in accordance with the appearance frequency of the unnecessary term in the each block., 'the determination unit'}3. The information processing device according to claim 1 , wherein the region is the entirety of each block or a part of each block.4. The information processing device according to claim 1 , further comprising:a generator configured to generate the unnecessary term information in which a term selected by a user from the terms included in the content is set as the unnecessary term.5. The ...

METHOD AND SYSTEM FOR PROVIDING ALTERNATIVE RESULT FOR AN ONLINE SEARCH PREVIOUSLY WITH NO RESULT

A computing device hosting a website of a business may be operable to receive a first search input comprising a term submitted via a search bar on the website. Upon performing an internal search for the term with no result, the computing device may output information on the no-result. The computing device may then perform, using one or more external search engines, a search for the term. Search results of the search, performed using the external search engine(s), may be analyzed. Based on a result of the analysis, one or more particular character strings related to the term may be identified. The computing device may generate and store, based on the identifying of the particular character string(s), one or more alternative search suggestions. Upon subsequently receiving an input comprising at least a portion of the term entered in the search bar, the computing device may output the alternative search suggestion(s). 120-. (canceled)21. A method , comprising: receiving a first search input comprising a term which is submitted via a graphical user interface of a website;', 'upon performing a search, internal to the business, for the received term with no result, outputting information on the no-result of the search;', 'performing, using one or more search engines external to the business, a search for the term, wherein the term that produced the no-result is modified in accordance with one or both of a model number and a part number;', 'analyzing search results of the search performed using the one or more search engines external to the business;', 'identifying, based on a result of the analysis, one or more particular character strings related to the term;', 'generating and storing, based on the identifying of the one or more particular character strings, one or more alternative search suggestions, wherein each of the one or more alternative search suggestions will result in information on an item carried by the business; and', 'upon subsequently receiving an input ...

Decision Making Add-on System

A system, method and computer readable indexing and storage medium, for generating historical data, is provided which, based on historical accounts and records, assist in the decision making process as it relates to human resources and the management of the field supply and demand. The data collected by way of personal entries, provides a personalized experience for the recruitment navigational and the benefit assignment tools. The imported data portion accesses the central database records comprising of employee write-ups, awards, recommendations, pink slips, promotions, etc. Depending on the data attached to a specific profile, the system will rank the hiring potential of a job seeking applicant, the providers of opportunities and the eligibility of the pursuers of program benefits. The system will be designed to interact with all communication platforms (mobile, tablets, PCs, laptops etc.). Other methods and apparatuses are also described. 1. A computer-implemented method for compiling employment data from subscribers and/or registered profile users (Job Seekers , Employers , Employment Tracking Organizations; etc.) , assisting Employers and Employment Tracking Organizations in the decision making process , designed and comprised of:A. detailed work search history profile storage;B. employment application submission(s) storage;C. employment profile status update storage;D. work related report(s) (exchange and submission) profile storage;E. background check reporting for each prospective employee upon the request of an Employer;F. Composite ranking of each prospective Employee based on prior work history;all data points being discoverable and retrievable by Employment Tracking Organizations exclusively;an add-on software interactive interface designed to enhance the capabilities of a bridged Software as a Service (SaaS),an embedded background checking software option; either hosted by the system itself and/or bridged from an outside provider;embedded discoverable ...

SYSTEMS FOR AND METHODS OF FINDING RELEVANT DOCUMENTS BY ANALYZING TAGS

A method of determining relevancies of objects to a search query includes associating multiple tags with multiple objects, recording bookmarks to the multiple objects, or both, and determining a relevance score for each of the multiple objects and a search query. One embodiment of the method combines full-text relevance algorithms with tag relevance algorithms. Other embodiments include statistical relevance algorithms such as statistical classification or rank regression algorithms. When a user executes a search query, a results list containing the objects is returned, with the objects organized based on the relevance scores. The objects are organized by, for example, listing those with the highest relevance scores first or by marking them with an indication of their relevance. Preferably, relevance scores for a tag-object pair are based on a number of times a term in the tag has been associated with the object, a number of tags associated with the object, a number of times that the tag has been associated with the multiple objects, a number of tag-object pairs that contain a term in the tag, a number of tag-object pairs that contain a reference to the object, or any combination of these. 120-. (canceled)21. A computer-implemented method for responding to a search query , as implemented on a computer through an execution of instructions by a processor , the method comprising:maintaining a plurality of objects;receiving a plurality of tags from a plurality of users over a network, wherein each tag comprises one or more tag terms, and each tag term comprises text;associating the plurality of tags with one or more of the plurality of objects, wherein each tag comprises user-provided information regarding an object of the plurality of objects to which the tag is associated;receiving the search query for objects of the plurality of objects, the search query comprising at least one or more search terms, wherein each search term comprises text;identifying a list of ...

APPARATUS AND METHOD FOR ANALYZING SECURITY VULNERABILITIES

A method for analyzing vulnerabilities may include: an analysis target URL receiving step of receiving a plurality of analysis target uniform resource locator (URL) addresses extracted from the analysis target server; an identification key setting step of setting respective identification keys corresponding to the plurality of analysis target URL addresses; a vulnerability analyzing step of performing a simulated attack so as to access the external server by the analysis target server by inserting an analysis hypertext transfer protocol (HTTP) request sentence including a URL address of an external server and the identification key into the analysis target URL address; an access record checking step of requesting an access record of the analysis target server to the external server; and a vulnerability extracting step of extracting a vulnerability of the analysis target server by using the identification key included in the access record. 1. A method for analyzing security vulnerabilities of an analysis target server , using an analysis apparatus , the method comprising:an analysis target URL receiving step of receiving a plurality of analysis target uniform resource locator (URL) addresses extracted from the analysis target server;an identification key setting step of setting respective identification keys corresponding to the plurality of analysis target URL addresses;a vulnerability analyzing step of performing a simulated attack to access an external server by the analysis target server by inserting an analysis hypertext transfer protocol (HTTP) request sentence including a URL address of the external server and the identification key into the analysis target URL address;an access record checking step of requesting an access record of the analysis target server from the external server; anda vulnerability extracting step of extracting a vulnerability of the analysis target server by using the identification key included in the access record.2. The method of ...

SEARCH QUERY-BASED REPLACEMENT PART INTERFACE

The systems and methods disclosed herein can increase the speed and ease with which a user can discover compatible replacement parts for a specified model of a product by automatically determining when the user is interested in replacement parts. A replacement part system can conclude that a user is looking for replacement parts based on the user's search queries, the user's browsing behavior, or the user's prior purchases. By automatically deducing an intention to purchase a replacement part, the replacement part system can make it easier for a user to locate suitable replacement parts. In addition, the replacement part system can be configured to tailor listing set of replacement parts search results it provides to a user. The set of search results can be tailored based on a number of criteria to increase the speed with which the user finds a compatible replacement part. 1. A computer-implemented method comprising:under control of one or more computing devices configured with specific computer-executable instructions,retrieving a set of items from an electronic catalog, the set of items corresponding to items retrieved based on a received electronic search query;providing the set of items to a user computing device;obtaining a specified model of a product;automatically identifying, based at least partly on the electronic search query, a plurality of replacement parts from the set of items;selecting a sorting criteria for sorting the identified plurality of replacement parts, the sorting criteria including a popularity of a replacement part;generating a sorted set of replacement parts, wherein each of the plurality of replacement parts is ranked based at least partly on the popularity of the replacement part; andproviding the sorted set of replacement parts to the user computing device.2. The computer-implemented method of claim 1 , wherein the specified model of the product is obtained from a data store configured to store one or more specified models of products ...

METHOD AND SYSTEM GOVERNING INTERACTION BETWEEN URL-POSSESSING ELEMENTS OF A PHYSICAL WEB THAT INCLUDES A MOBILE WEB

A personalized way to digitally record a person's physical activities over time serves web searching, business advertising, nostalgia, security and object tracing purposes. The chronological digital history of the person's physical presence over a time includes (i) digital network entries from other members who hold their portable wireless short range device near the person's device and transmit a URL or other key data and (ii) digital member entries such a digital photograph of a store sign. The digital network entries and digital member entries are automatically transmitted to a database located on a telecommunications network at a time of entry. Advertisers can transmit to members when members enter premises of advertiser's store. Upon sign-up online, the authentication data uniquely associated with an account is provided and key data they want to transmit is associated with the account. Digital histories can be used to improve web searching and networking opportunities. 1. A computer-implemented method governing interaction between URL-possessing elements of a physical web that includes a mobile web , the method comprising:maintaining a processing system that is connected to a telecommunications network;providing an application that configures a handheld mobile communication device of each individual member of a member network who is mobile, the device in communication with a positioning system, to, upon instances of a physical encounter between a pair of the URL-possessing elements, the pair including the individual member and a stationary vendor member, at a physical premises of the stationary vendor member, the physical premises containing two or more transmitting devices, transmit a URL of the stationary vendor member and a URL of the individual member, to the processing system automatically as a result of a short range communication from one of the two or more transmitting devices to the handheld mobile communication device or from the handheld mobile ...

METHOD AND APPARATUS FOR ENRICHING METADATA VIA A NETWORK

A method and apparatus for enriching metadata are disclosed. For example, the method implemented via a processor monitors metadata associated with a first webpage of a plurality of webpages, the first webpage having been determined to be similar to a second webpage of the plurality of webpages, detects a change to the metadata associated with the first webpage, determines whether the change to the metadata associated with the first webpage invokes an update to a metadata associated with the second webpage, and processes the update of the metadata associated with the second webpage when the change invokes the update to the metadata associated with the second webpage. 1. A method comprising:subscribing, by a processor of a server, a service for enriching metadata with a network service provider of a communications network;receiving, by the processor, a recommendation for an update to metadata associated with a first webpage, the recommendation is received from the network service provider; andproviding, by the processor, an indication to the network service provider indicating whether the recommendation is accepted or rejected.2. The method of claim 1 , wherein the recommendation is generated by the network service provider claim 1 , the generating of the recommendation comprising:monitoring metadata associated with a second webpage of a plurality of webpages, the second webpage having been determined to be similar to the first webpage of the plurality of webpages;detecting a change to the metadata associated with the second webpage;determining whether the change to the metadata associated with the second webpage invokes an update to the metadata associated with the first webpage; andgenerating, via the processor, the recommendation when the change invokes the update to the metadata associated with the first webpage.3. The method of claim 1 , wherein the providing the indication to the network service provider comprises:determining whether the metadata of the first ...

Database Operations and Data Manipulation Using Search-On-The-Fly

A method for searching for data among a plurality of disparate databases includes a processor: displaying an indication of contents of each of the plurality of disparate databases, comprising displaying a data field descriptor for one or more database fields of each of the plurality of disparate databases; receiving a search selection directed to one or more of the one or more database fields; returning a first search result comprising database entries matching the search selection; saving the first search result as a first temporary database; receiving a second search request directed to the first temporary database; returning a second search result comprising entries in the temporary database matching the further search request; and saving the second search result as a second temporary database. 1. A method for searching for data among a plurality of disparate databases , comprising:displaying an indication of contents of each of the plurality of disparate databases, comprising displaying a data field descriptor for one or more database fields of each of the plurality of disparate databases;receiving a search selection directed to one or more of the one or more database fields;returning a first search result comprising database entries matching the search selection;saving the first search result as a first temporary database;receiving a second search request directed to the first temporary database;returning a second search result comprising entries in the temporary database matching the further search request; andsaving the second search result as a second temporary database.2. The method of claim 1 , wherein the search result comprises database entries from at least two disparate databases claim 1 , the method comprising:creating a merged search result by merging first search results from a first disparate database with subsequent search results from one or more additional disparate databases; anddisplaying the merged search result as a third temporary database. ...

ARCHITECTURE AND FUNCTIONAL MODEL OF A GENERIC DATA EXCAVATION ENGINE

A rules-driven data excavation engine for extracting information of interest, primarily from the World Wide Web, comprising: 1. A rules-driven system for extracting information of interest from documents on the World Wide Web , comprising:a. a web crawlerb. a raw data cleanerc. an information parserd. a database import script generatore. a database import script cleanerf. a database management systemg. a webserver/application server2. The system of claim 1 , wherein the information parser reads parsing rules for delineating and correctly tagging information of interest from the data files downloaded by the web crawler.3. The system of claim 2 , wherein the information parser reads parsing rules for delineating and correctly tagging information of interest from the HTML files downloaded by the web crawler.4. The system of claim 2 , wherein the information parser reads parsing rules for delineating and correctly tagging information of interest from the XML files downloaded by the web crawler.5. The system of claim 2 , wherein each parsing rule has a unique identifier.6. The system of claim 3 , wherein the parsing rules specify the following information:a. pattern matching criteria viz. exact match, prefix match, suffix match and substring matchb. begin and end identifiers for an information of interest blockc. offset of an information of interest block, within a pattern block, with designated begin and end pattern identifiersd. instance number of the information of interest block, from a multiplicity of pattern blocks with designated begin and end pattern identifierse. begin and end pattern identifiers of exclusion sub-blocks, within an information of interest block with designated begin and end pattern identifiersf. prefixes and suffixes to add and drop to the information of interest7. The system of claim 4 , wherein the parsing rules specify the following information:a. pattern matching criteria viz. exact match, prefix match, suffix match and substring matchb. ...

METHOD AND SYSTEM FOR CONTENT BIAS DETECTION

The present teaching relates to a method, system, and programming for providing content. A plurality of content items and publication information related thereto are obtained. For each of the plurality of content items, one or more topics are determined in accordance with a model. The related publication information associated with each content item is analyzed to identify at least one source of a plurality of sources that published the content item. A distribution is generated of each of the plurality of content items with respect to the plurality of sources and the one or more topics of the content item, and a bias of a source with respect to publishing content is identified based on the distributions of the plurality of content items. 1. A method , implemented on a machine having at least one processor , storage , and a communication platform capable of connecting to a network for providing content , the method comprising:obtaining a plurality of content items and publication information related thereto;determining, in accordance with a model, one or more topics of each of the plurality of content items;analyzing the related publication information associated with each content item to identify at least one source of a plurality of sources that published the content item;generating a distribution of each of the plurality of content items with respect to the plurality of sources and the one or more topics of the content item; andidentifying, based on the distributions of the plurality of content items, a bias of a source with respect to publishing content.2. The method of claim 1 , wherein the bias of the source is a coverage bias with respect to a topic claim 1 , the coverage bias being determined based on a first number of content items of the topic published by the source.3. The method of claim 2 , wherein the source is determined to have the coverage bias with respect to the topic based on the first number of content items of the topic published by the source ...

Method and Apparatus for a Trusted Localized Peer-to-Peer Services Marketplace

A peer-to-peer services marketplace is described. A search query is received from a service buyer. The query is parsed to identify parameters including a category of service wanted and a desired location. An available services database that includes service seller profiles is searched based on the parameters. The system communicates information to the buyer regarding service sellers that match the parameters, including the description of the service, contact information, the location of the service seller, and the location where the service is offered. A selection of one of the service seller sis received from the buyer, and availability information to the buyer is provided. The buyer requests an available time of the seller and that time is reserved to create a service appointment. The seller is notified of the appointment. 1. A machine-readable storage medium that provides instructions that , if executed by a processor , will cause said processor to perform operations for a trusted localized peer-to-peer services marketplace , the operations comprising:receiving a search query from a potential service buyer, the search query including a plurality of parameters;parsing the search query to identify the plurality of parameters, the plurality of parameters at least including a category of service wanted and a location where the service wanted is desired; a description of a service that service seller offers,', 'contact information for that service seller,', 'a location of the service seller, and', 'a location where the service offered by the service seller is provided;, 'searching an available services database based on the plurality of parameters of the search query, wherein the available services database is populated with available services provided by a plurality of service sellers, wherein each one of the service sellers has a service seller profile for the trusted localized peer-to-peer services marketplace that is associated with at least the following the ...

INFORMATION PROCESSING NETWORK BASED ON UNIFORM CODE ISSUANCE, METHOD THEREFOR, AND SENSING ACCESS DEVICE

The present disclosure relates to an information processing network based on uniform code issuance, a method for the same, and a sensing access device, wherein a releaser sends a corresponding code issuing request to a core administrator, such that the core administrator or a code issuing agency authorized by the core administrator generates a coding medium; in this way, when an accessing party identifies the coding medium with an equipped sensing access device, it may obtain information that matches the identified coding medium and further obtain the following information provided by the releaser, including: information to be released by the releaser, attribute state of the releaser, attribute state of an interacting party associated with the releaser, and information obtained from identifying other coding medium with the sensing access device equipped to the releaser. The present disclosure enables access based on a site-specific motif through various kinds of sensing access manners so as to accurately track respective nodes in the information dissemination process and realize circulation-based value quantization and cashing. 1. An information processing method based on unified code issuance , comprising:transmitting, by an interactive party, an encoding request requesting acquisition of an encoding medium relating to circulation of digital currency;receiving, by a core administrative function, the encoding request;providing, by the core administrative function or a code issuing mechanism authorized by the core administrative function, the encoding medium to the interactive party;obtaining, by the interactive party provided with the encoding medium, a code and identification information by identifying the encoded medium with a sensing access device;transmitting an attribute state of the interactive party to the core administrative function, andadjusting, by the core administrative function, the attribute state received from the interactive party,wherein the ...

SERVICE DISCOVERY AND RENAMING

A provider network implements service discovery and renaming. A provider network includes a domain name service (DNS) and a renaming tool. The DNS receives queries for service names and sends query logs to a data store. Each query log indicates the queried name and a network address (e.g., IP address). A user may request that the service be renamed to a new name. In response, the renaming tool adds a new entry to for the new name to the DNS. The renaming tool retrieves data from the query logs and identifies clients of the service. The renaming tool sends a notification to the identified clients that the name has changed to the new name. The renaming manger retrieves additional data from the query logs to identify how many of the clients have switched to using the new name. After enough clients have switched, the old name may be decommissioned. 120.-. (canceled)21. A system , comprising: subsequent to addition, by a domain name service, of a new entry for a new name of a service, retrieve data from query logs generated by the domain name service, wherein the query logs comprise query logs that indicate an old name of the service as a queried name and query logs that indicate the new name of the service as the queried name;', 'analyze the retrieved data;', 'identify, based on the analysis of the retrieved data, one or more of a plurality of clients of the service that have continued to use the old name of the service after the addition of the new entry for the new name of the service or a plurality of clients of the service that have switched to use the new name of the service;', 'determine, based on the identified plurality of clients and one or more criteria, to decommission the old name of the service; and', 'in response to the determination to decommission the old name of the service, cause the domain name service to delete an entry for the old name of the service., 'one or more computing devices of a provider network comprising respective processors and memory ...

Communication method using customisable banners

A banner management method is provided which operates on a browser user interface on terminals in a network of terminals. The method comprising the steps of: (1) initialising a command file with inputs from a system administrator of the network, including providing an interface by which the system administrator can customize banners displayed on each browser interface, and (2) executing the command file, thus displaying banners as ordered by the command file.

Determining a rating for a collection of documents

On one or more data processing systems, a collection rating is determined for a rating scale for contents of a document collection. A link rating is determined for the rating scale for contents linked to or linked by contents of the document collection. The collection rating for the rating scale for contents of the document collection is then modified, based on the determined link rating for the rating scale for contents linked to or linked by contents of the document collection.

Identifying, cataloging and retrieving web pages that use client-side scripting and/or web forms by a search engine robot

The purpose of the invention is to enable a search engine spider to build an index of web pages from a particular web site that utilizes forms and/or client-side scripting.

Federated search

Methods and media for exchanging data between nodes of disconnected networks

Methods and media for exchanging data between nodes of disconnected networks are provided, including: determining a query type based on whether a query received at a first node includes at least one keyword or at least a portion of a uniform resource identifier; performing a search of a cache based on the query and the query type; converting the query into a formatted query document; storing the formatted query document in a database, if the search of the cache does not yield at least a predetermined number of data items; retrieving the formatted query document from the database at a predetermined interval; multicasting the retrieved formatted query document from the first node to at least a second node; and receiving, at the first node, a formatted response document from the second node, the formatted response document resulting from a search of a cache of the second node.

Internet based method for facilitating networking among persons with similar interests and for facilitating collaborative searching for information

A method in a computer network for identifying users with similar interests is described. The method includes accepting a first query statement from a first user and storing a first item of information related to the first query. The method further includes accepting a second query from a second user and storing a second item of information related to the second query. The method further includes computing a measure of similarity of the first query and the second query by using the first item of information and the second item of information. A system and computer readable medium for carrying out the above method is also described.

Binary numbers selection device

Изобретение относится к вычислительной технике. Технический результат заключается в уменьшении аппаратурных затрат при сохранении функциональных возможностей прототипа. Устройство селекции двоичных чисел предназначено для выполнения селекции минимального либо максимального из двух двухразрядных двоичных чисел, задаваемых двоичными сигналами. Устройство содержит четыре мажоритарных элемента (1, …, 1) и элемент НЕ. 1 ил. РОССИЙСКАЯ ФЕДЕРАЦИЯ (19) RU (11) (13) 2 678 165 C1 (51) МПК G06F 7/02 (2006.01) ФЕДЕРАЛЬНАЯ СЛУЖБА ПО ИНТЕЛЛЕКТУАЛЬНОЙ СОБСТВЕННОСТИ (12) ОПИСАНИЕ ИЗОБРЕТЕНИЯ К ПАТЕНТУ (52) СПК G06F 7/02 (2018.08); G06F 7/06 (2018.08) (21)(22) Заявка: 2018111384, 29.03.2018 (24) Дата начала отсчета срока действия патента: (73) Патентообладатель(и): Андреев Дмитрий Васильевич (RU) Дата регистрации: 23.01.2019 (56) Список документов, цитированных в отчете о поиске: RU 2363038 C1, 27.07.2009. RU 2622841 C1, 20.06.2017. RU 2626329 C1, 26.07.2016. RU 2300133 C1, 27.05.2007. EP 0319421 B1, 07.06.1992. US 5515306 A, 07.05.1996. (45) Опубликовано: 23.01.2019 Бюл. № 3 R U (54) УСТРОЙСТВО СЕЛЕКЦИИ ДВОИЧНЫХ ЧИСЕЛ (57) Реферат: Изобретение относится к вычислительной минимального либо максимального из двух технике. Технический результат заключается в двухразрядных двоичных чисел, задаваемых уменьшении аппаратурных затрат при сохранении двоичными сигналами. Устройство содержит функциональных возможностей прототипа. четыре мажоритарных элемента (11, …, 14) и Устройство селекции двоичных чисел элемент НЕ. 1 ил. предназначено для выполнения селекции Стр.: 1 C 1 C 1 Адрес для переписки: 432002, г. Ульяновск, ул. Островского, 25, кв. 38, Андрееву Дмитрию Васильевичу 2 6 7 8 1 6 5 Приоритет(ы): (22) Дата подачи заявки: 29.03.2018 2 6 7 8 1 6 5 R U 29.03.2018 (72) Автор(ы): Андреев Дмитрий Васильевич (RU) RUSSIAN FEDERATION (19) RU (11) (13) 2 678 165 C1 (51) Int. Cl. G06F 7/02 (2006.01) FEDERAL SERVICE FOR INTELLECTUAL PROPERTY (12) ABSTRACT OF INVENTION (52) CPC G06F 7/02 (2018.08); ...

Method and apparatus for collecting search data by getting various data including web document creation

A method and a device for collecting search data by obtaining diverse information including web document generation are provided to collect the new search data in real-time by checking whether a webpage is generated or updated by inserting a specific image into the webpage when the webpage is generated and checking a request for loading the image in real-time when the webpage is displayed. An image storing part(302) receives a transfer request for the specific image and transmits the image to a web browser(330) as a homepage referring to the image is read/displayed by the web browser. A URL(Uniform Resource Locator) information storing part(308) stores homepage search history information. A determiner(304) determines whether the homepage is appeared in the Internet first or not by referring to URL information of the homepage referring to the image and the URL search history information stored in the URL information storing part. A data collector(306) collects search-related information by connecting to the homepage in case of the first appeared homepage and increases a visit counter of the homepage in other cases.

Binary numbers comparison device

FIELD: computer equipment.SUBSTANCE: invention relates to computing and can be used in digital comparators, associative processors and database machines. Device contains four elements “2OR”, four elements “2AND”, four elements “NOT” and six majority elements.EFFECT: technical result is to simplify the recognition of relations A>B, A=B, A<B, where A, B are four-digit binary numbers, and a decrease in the number of elements of the instrumental composition.1 cl, 1 dwg, 1 tbl РОССИЙСКАЯ ФЕДЕРАЦИЯ (19) RU (11) (13) 2 677 371 C1 (51) МПК G06F 7/02 (2006.01) G06F 7/06 (2006.01) ФЕДЕРАЛЬНАЯ СЛУЖБА ПО ИНТЕЛЛЕКТУАЛЬНОЙ СОБСТВЕННОСТИ (12) ОПИСАНИЕ ИЗОБРЕТЕНИЯ К ПАТЕНТУ (52) СПК G06F 7/02 (2006.01); G06F 7/06 (2006.01); H03K 19/173 (2006.01); H03K 19/23 (2006.01) (21)(22) Заявка: 2017140722, 22.11.2017 (24) Дата начала отсчета срока действия патента: (73) Патентообладатель(и): федеральное государственное бюджетное образовательное учреждение высшего образования "Ульяновский государственный технический университет" (RU) Дата регистрации: 16.01.2019 (56) Список документов, цитированных в отчете о поиске: RU 2363037 C1, 27.07.2009. RU (45) Опубликовано: 16.01.2019 Бюл. № 2 2298220 C1, 27.04.2007. RU 2329530 C1, 20.07.2008. US 2004/0039770 A1, 26.02.2004. US 4899127 A, 06.02.1990. US 4012714 A, 15.03.1977. 2 6 7 7 3 7 1 R U (54) УСТРОЙСТВО СРАВНЕНИЯ ДВОИЧНЫХ ЧИСЕЛ (57) Реферат: Изобретение относится к вычислительной двоичные числа, и уменьшение количества технике и может быть использовано в цифровых элементов аппаратурного состава. Устройство компараторах, ассоциативных процессорах и содержит четыре элемента «2ИЛИ», четыре машинах баз данных. Техническим результатом элемента «2И», четыре элемента «НЕ» и шесть является упрощение распознавания отношений мажоритарных элементов. 1 ил., 1 табл. А>В, А=В, А<В, где А, В есть четырехразрядные Стр.: 1 C 1 C 1 Адрес для переписки: 432027, г. Ульяновск, Северный Венец, 32, УлГТУ, проректору по научной работе 2 6 7 7 3 7 1 Приоритет(ы): ( ...

Method of building persistent polyhierarchical classifications based on polyhierarchies of classification criteria

A method for providing a polyhierarchical classification includes identifying properties of objects useful for distinguishing objects under classification. A plurality of criteria are identified for specializing the identified properties. A form is chosen for attributive expressions that describe classification categories. The attributive expressions are customizable and encode compositions of object properties in terms of attributes from the plurality of criteria. A domain of applicability is identified for each criterion that is representable by attributive expressions, and a dependence relationship between criteria is defined by the inclusion of attributes in the attributive expressions, where a selected criterion depends on another criterion if its domain of applicability includes at least one attribute by the other criterion. A generating polyhierarchy of criteria is automatically established by the dependence relationships between the criteria. The generating polyhierarchy of criteria implicitly defines an induced polyhierarchy of classification categories.

Systems and methods for generating concept units from search queries

Systems and method for enhancing search functionality provided to a user. In certain aspects, a query processing engine automatically decomposes queries into constituent units that are related to concepts in which a user may be interested. The query processing engine decomposes queries into one or more constituent units per query using statistical methods. In certain aspects, no real world knowledge is used in determining units. In other aspects, aspects of world and content knowledge are introduced to enhance and optimize performance, for example, manually using a team of one or more information engineers.

Information search support system, application server, information search method, and program

Information search support system, application server, information search method, and program product

A system includes a vocabulary information processing mechanism for loading an ontology corresponding to a selected service and analyzing the loaded ontology to extract a conceptual structure, an inference processing mechanism for executing an inference operation based on an axiom rule and extending/parsing vocabulary information extracted by the vocabulary information processing mechanism, a conceptual information display section for displaying the extracted conceptual structure on a browser of a user terminal via the Internet, a property information display section for displaying on the browser property information relative to a concept selected from the displayed conceptual structure, a relational information display section for displaying, when a plurality of concepts are selected, relationships between the concepts on the browser, and a search request transmitting section 34 for transmitting a prescribed search request to a search system based on a search request made from the browser.

System and method for incorporating anchor text into ranking search results

네트워크상에서 검색 질의의 검색 결과는 앵커 텍스트를 용어로서 통합하는 스코어링 함수에 따라 랭크된다. 스코어링 함수는, 앵커 텍스트의 타깃 문서가 타깃 문서의 랭킹 내에서 앵커 텍스트 내의 용어의 사용을 반영하도록 조정된다. 초기에, 앵커 텍스트와 관련된 특성들은 네트워크의 크롤 중에 수집된다. 문서의 역 리스트와 앵커 텍스트의 용어를 포함하는 분리 인덱스가 생성된다. 이후에, 인덱스는 문서의 스코어를 계산하기 위해서 질의에 응답하여 참조된다. 스코어는 이후에 문서를 랭크하고 질의 결과를 생성하기 위해서 사용된다. The search results of the search query on the network are ranked according to a scoring function that incorporates anchor text as terms. The scoring function is adjusted such that the target document of the anchor text reflects the use of the term in the anchor text within the ranking of the target document. Initially, properties associated with anchor text are collected during crawling of the network. A separate index is created that contains the inverse list of documents and the term anchor text. The index is then referenced in response to the query to calculate the score of the document. The score is then used to rank documents and generate query results. 검색 질의, 앵커 텍스트, 스코어링 함수, 랭킹, 크롤 Search query, anchor text, scoring function, ranking, crawl

Method and apparatus for the expansible sequence of data set

本发明的实施例涉及一种用于计算机系统上的数据库中的数据集的可扩展排序的方法和设备。界定跨越所述数据集的多个相连范围。将所述数据集的每个个别数据值分配到其所属于的范围。接着对所述范围中的所述值进行排序。可以通过不同节点并行地执行所述排序。一旦完成所述排序，就将结果存储在相连存储器位置中。这使得所述整个数据集经过排序。

Search method by providing search window with an application being used

A network search method through a search window offered when driving an application program is provided to satisfy a desired search request without visiting a separate search site, so that a user can search within an application window which is being operated. A search tool is displayed within the title bar of top window of an application program which is currently being operated(301). A search word inputted from a user is displayed within the search tool(302). The search word is transmitted to a search engine(303). The search result is received from the search engine(304). A search result window is generated(305). The search result is displayed on the search result window(306).

Application system for network-based search service using resemblant words and method thereof

개시된 내용은 네트워크 기반의 유사어 검색기술 응용시스템 및 방법에 관한 것으로서, 운영자가 관리하는 데이터베이스의 한글부분을 언어적 특성에 따라 영문의 형태로 전환시켜 별도의 데이터베이스 필드로 구축하고, 사용자의 검색요청에 따라 언어적 특성을 감안하여 각 음소를 치환한 검색어의 검색식과 전체 음소에서 일부 음소를 제외한 상태에서 나머지 글자의 배열을 유지한 대상을 검색하는 검색식과 사용자가 입력한 검색어보다 작은수의 음소를 가진 명칭을 찾아내는 검색식 등을 바탕으로 검색을 실행하여 사용자가 입력한 검색어와 유사한 글자를 해당 데이터베이스에서 찾아내어 유사한 정도의 순서로 사용자에게 제공한다. The present disclosure relates to an application system and a method for searching a network-based similar word search technology. The Korean part of a database managed by an operator is converted into an English form according to linguistic characteristics, and then constructed as a separate database field. Therefore, in consideration of linguistic characteristics, a search expression for a search term that replaces each phoneme, a search expression for searching a target that maintains an arrangement of remaining letters except some phonemes in all phonemes, and a phoneme having a smaller number than a search word input by a user Based on a search expression that finds a name, a search is executed to find a character similar to the search word entered by the user in a corresponding database and provided to the user in a similar order. 따라서, 본 발명은 출원되거나 공고된 상표, 도메인 및 상호 데이터베이스에 적용할 경우 사용자가 출원한 상표 데이터에 대하여 일괄적으로 유사한 상표가 출원 혹은 공고되거나 임의로 사용되는지를 감시함으로써 상표를 보유한 사용자가 손쉽게 상표 감시 및 통합 업무처리를 수행할 수 있으며, 인터넷 검색엔진에 적용할 경우 사용자가 인지하고 있는 검색단어가 어느 정도 부정확하더라도 유사한 단어가 들어간 검색결과를 얻을 수 있게 하여 원하는 결과물을 쉽게 찾을 수 있다. Accordingly, the present invention, when applied to trademarks, domains, and cross-databases that are filed or notified, makes it easier for a user who owns a trademark to monitor whether or not similar trademarks are filed, published, or used arbitrarily for trademark data filed by the user. Monitoring and integrated business processes can be performed, and when applied to an internet search engine, even if the user's perceived search word is somewhat inaccurate, the search result containing similar words can be easily found.

Bit sequencing parallel comparator

본 발명은 비트순차식 병렬 비교기에 관한 것으로서, 이는 여러개의 데이타를 병렬로 최상위 비트부터 순차적으로 입력받아 주어진 시간내에 병렬 비트을 순차적으로 처리하도록 한 것이다. BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a bit sequential parallel comparator, which receives multiple data sequentially in order from the most significant bit in parallel and sequentially processes the parallel bits within a given time. 이와같은 본 발명은 N개의 레지스터로 부터 순차 입력되는 M비트의 데이타을 입력 클럭 사이클내에 비교하여 최소의 데이타을 검출하는 최소데이타 검출수단과, 상기 최소 데이타 검출수단에서 얻어진 N비트의 데이타 및 외부로 부터 입력되는 인에이블신호에 따라 최소 데이타에 대한 1의 보수를 발생하는 최소데이타 발생수단과 상기 데이타 발생수단에서 얻어진 데이타와 최소데이타 검출수단에서 얻어진 데이타을 이용하여 N개의 레지스터 값중에서 가장 작은 값을 갖는 레지스터의 위치정보를 검출하고 그 검출한 최소 위치정보를 리세트신호로 하여 가장 작은 값에 대응하는 최소데이타 검출수단을 리세트하는 최소 위치정보 검출수단과, 상기 최소위치정보 검출수단에서 검출된 정보를 논리화하여 최소값 위치를 알려주는 최소데이타 발생수단에서 발생된 데이타에 대해 1의 보수를 취하여 최소값을 알려주는 최소위치표시 발생수단으로 이루어짐으로써 달성된다. The present invention compares M bits of data sequentially input from N registers within an input clock cycle to detect minimum data, and N bits of data obtained from the minimum data detecting means and input from outside. In accordance with the enable signal, the minimum data generating means for generating one's complement of the minimum data and the data obtained from the data generating means and the data obtained from the minimum data detecting means are used for the register having the smallest value among the N register values. Minimum position information detection means for detecting position information and resetting the minimum data detection means corresponding to the smallest value by using the detected minimum position information as a reset signal; and the information detected by the minimum position information detection means The minimum data to tell the location of the minimum value By taking the 1's complement of the data generated in the means for indicating the minimum value it is achieved by at least constituted by any display position generating means.

Device for selection of binary numbers

FIELD: physics. SUBSTANCE: device has six inputs devices, two outputs of the device three elements NO, fourteen elements AND, seven items OR. EFFECT: providing the possibility of choosing the average of three binary two-digit numbers, and the minimum or maximum of two binary two-digit numbers. 1 dwg, 2 tbl РОССИЙСКАЯ ФЕДЕРАЦИЯ (19) RU (11) (13) 2 620 991 C1 (51) МПК G06F 7/02 (2006.01) G06F 7/06 (2006.01) ФЕДЕРАЛЬНАЯ СЛУЖБА ПО ИНТЕЛЛЕКТУАЛЬНОЙ СОБСТВЕННОСТИ (12) ФОРМУЛА (21)(22) Заявка: ИЗОБРЕТЕНИЯ К ПАТЕНТУ РОССИЙСКОЙ ФЕДЕРАЦИИ 2016110566, 23.03.2016 (24) Дата начала отсчета срока действия патента: 23.03.2016 (72) Автор(ы): Козелков Олег Александрович (RU) (73) Патентообладатель(и): Козелков Олег Александрович (RU) Дата регистрации: (56) Список документов, цитированных в отчете о поиске: RU 2300133 C1, 27.05.2007. RU Приоритет(ы): (22) Дата подачи заявки: 23.03.2016 (45) Опубликовано: 30.05.2017 Бюл. № 16 Адрес для переписки: 117630, Москва, ул. Академика Челомея, 8, корп. 2, кв. 659А, Козелкову Олегу Александровичу 2 6 2 0 9 9 1 R U (57) Формула изобретения Устройство селекции двоичных чисел, содержащее четыре входа устройства, два выхода устройства, два элемента НЕ, два элемента ИЛИ, четыре элемента И, причем первый вход устройства соединен с первым входом первого элемента И, и через первый элемент НЕ соединен с первым входом второго элемента И, второй вход устройства соединен с первым входом первого элемента ИЛИ, третий вход устройства соединен через второй элемент НЕ с первым входом третьего элемента И, четвертый вход устройства соединен с первым входом второго элемента ИЛИ, выход первого элемента ИЛИ соединен с первым входом четвертого элемента И, отличающееся тем, что дополнительно содержит пятый и шестой входы устройства, третий элемент НЕ, пять элементов ИЛИ, десять элементов И, причем первый вход устройства соединен с первыми входами пятого элемента И, шестого элемента И, седьмого элемента И, и через первый элемент НЕ соединен с первым входом третьего ...

Binary number comparison device

Изобретение относится к области вычислительной техники и может быть использовано в цифровых компараторах, ассоциативных процессорах и машинах баз данных. Техническим результатом является расширение функциональных возможностей устройства за счет обеспечения распознавания отношений A>B, A=В, A<B. Устройство содержит n-1 элементов И, 2×n элементов ИСКЛЮЧАЮЩЕЕ ИЛИ-НЕ и n мажоритарных элементов. 1 ил. РОССИЙСКАЯ ФЕДЕРАЦИЯ (19) RU (11) (13) 2 762 621 C1 (51) МПК G06F 7/02 (2006.01) G06F 7/04 (2006.01) ФЕДЕРАЛЬНАЯ СЛУЖБА ПО ИНТЕЛЛЕКТУАЛЬНОЙ СОБСТВЕННОСТИ (12) ОПИСАНИЕ ИЗОБРЕТЕНИЯ К ПАТЕНТУ (52) СПК G06F 7/02 (2021.08); G06F 7/026 (2021.08); G06F 7/06 (2021.08) (21)(22) Заявка: 2020135551, 28.10.2020 (24) Дата начала отсчета срока действия патента: (73) Патентообладатель(и): федеральное государственное бюджетное образовательное учреждение высшего образования "Ульяновский государственный технический университет" (RU) Дата регистрации: 21.12.2021 (56) Список документов, цитированных в отчете о поиске: RU 2329530 C1, 20.07.2008. RU 2677371 C1, 16.01.2019. RU 2363036 C1, 27.07.2009. RU 2324971 C1, 20.05.2008. KR 101540539 B1, 31.07.2015. US 6014074 A, 11.01.2000. US 4012714 A, 15.03.1977. (45) Опубликовано: 21.12.2021 Бюл. № 36 2 7 6 2 6 2 1 R U (54) УСТРОЙСТВО СРАВНЕНИЯ ДВОИЧНЫХ ЧИСЕЛ (57) Реферат: Изобретение относится к области устройства за счет обеспечения распознавания вычислительной техники и может быть отношений A>B, A=В, A Подробнее

Method and system for correcting error of knowledge involved query

검색 질의 내 지식 오류를 교정하는 방법 및 시스템이 개시된다. 컴퓨터로 구현되는 검색 질의 내 지식 오류 교정 방법은, 데이터베이스에 포함된 어휘들을 조합하여 추천 검색 질의를 도메인 별로 생성하는 단계, 상기 추천 검색 질의에 대한 신뢰도에 기초하여 상기 추천 검색 질의를 검증하는 단계, 및 검증된 추천 검색 질의를 대상으로, 개념 또는 정보의 오류를 나타내는 지식 오류를 교정하기 위한 지식 오류 교정 규칙을 도메인 별로 생성하는 단계를 포함할 수 있다. A method and system for calibrating a knowledge error in a search query is disclosed. A computer-implemented knowledge query error correction method comprising: generating a recommendation search query for each domain by combining vocabularies included in a database; verifying the recommendation search query based on the reliability of the recommendation search query; And generating the knowledge error correction rule for each domain for correcting the knowledge error indicating the concept or the information error for the verified recommended search query.

Apparatus and method for building resource description framework network using ontology schema merged named entity database and mining rule

PURPOSE: A resource technology framework network construction device and a method thereof are provided to perform mining and managing language resources in a unified mode by an ontology schema which is combined with a mining regulation administration module and a class name management module. CONSTITUTION: A class name managing module(120) interlinks and stores the class name corresponding to the concept of the ontology schema, the term classified as the class name, the identifier of term and representative term and the linked data composed the discrimination of the representative term as one. A mining regulation administration module(130) interlinks the property of the ontology schema, the mining pattern corresponding to the property, and the RDF(Resource Description Framework) triple corresponding to the mining pattern and stores.

Representative selector and its implementation

본 발명은 여러개의 값들에서 대표값을 선택하는 방법에 관한 것으로, 특히 동일한 사건에 대한 다양한 해석 또는 동일한 정보를 근거로한 다양한 계산 결과 중에서 1개의 대표값을 선택하는 알고리즘이 내장된 연산장치에 관한 것이다. 입력된 데이타 값을 계산하기 위해 별도의 회로를 구성하지 않고, 기존의 연산장치에 입력데이타 값을 선택하도록 프로그램을 내장함으로써 불필요한 회로의 구성을 피하고, 또한 동일한 상황이나 대상에 대한 측정값이 측정장치 자체의 미세한 차이에 의해서, 정확히 일치하지 않고 오차를 발생하기 때문에 대표값 선택이 불가능한 경우가 발생하는 문제점을 해결하기 위해 일정한 오차범위에 속하는 데이타 값들을 같은 값으로 처리하여 다수분포를 찾아내는 방법을 도입함으로써, 티앰알(TMR;Triple Modular Redundance)시스템의 문제점을 해결하였고, 회로의 구성에 드는 비용을 절감할 수 있어 매우 유용하다.

A method to provide a widget, and TV using the same

위젯 제공방법 및 이를 적용한 TV가 제공된다. 본 위젯 제공방법에 따르면, 복수의 컨텐츠 제공자들로부터 제공되는 위젯들 중에서 특정 키워드와 관련된 위젯들을 검색하고, 검색된 위젯들을 컨텐츠 제공자별로 분류된 위젯 검색 리스트에 표시하게 된다. 이에 따라, 사용자는 다양한 컨텐츠 제공자로부터 제공되는 위젯을 보다 쉽게 검색하여 이용할 수 있게 된다. A widget providing method and a TV using the widget are provided. According to the present widget providing method, widgets related to a specific keyword are searched among widgets provided from a plurality of content providers, and the searched widgets are displayed in a widget search list classified by content providers. Accordingly, the user can more easily search for and use widgets provided from various content providers. 위젯, TV, 키워드 Widgets, TV, Keywords

Device for selecting extreme number of two binary numbers

FIELD: physics. SUBSTANCE: device for selecting an extreme number of two binary numbers contains four information inputs 1, 2, 3, 4, two outputs of the device 5 and 6, three elements NOT 7, 8, 9, a tuning input 10, six majority elements 11, 12, 13, 14, 15, 16. EFFECT: providing selection, depending on the setting of both the minimum and the maximum of two binary numbers. 1 dwg, 1 tbl РОССИЙСКАЯ ФЕДЕРАЦИЯ (19) RU (11) (13) 2 622 841 C1 (51) МПК G06F 7/02 (2006.01) ФЕДЕРАЛЬНАЯ СЛУЖБА ПО ИНТЕЛЛЕКТУАЛЬНОЙ СОБСТВЕННОСТИ (12) ФОРМУЛА (21)(22) Заявка: ИЗОБРЕТЕНИЯ К ПАТЕНТУ РОССИЙСКОЙ ФЕДЕРАЦИИ 2016100204, 11.01.2016 (24) Дата начала отсчета срока действия патента: 11.01.2016 (72) Автор(ы): Козелков Олег Александрович (RU) (73) Патентообладатель(и): Козелков Олег Александрович (RU) Дата регистрации: (56) Список документов, цитированных в отчете о поиске: RU 2300133 C1, 27.05.2007. RU Приоритет(ы): (22) Дата подачи заявки: 11.01.2016 2298219 C1, 27.04.2007. RU 2300130 C1, 27.05.2007. US 3949209 A, 06.04.1976. R U 20.06.2017 (45) Опубликовано: 20.06.2017 Бюл. № 17 2 6 2 2 8 4 1 R U (57) Формула изобретения Устройство селекции экстремального числа из двух двоичных чисел, содержащее четыре информационных входа, два выхода устройства, два элемента НЕ, причем первый информационный вход соединен с входом первого элемента НЕ, третий информационный вход соединен с входом второго элемента НЕ, отличающееся тем, что содержит дополнительно третий элемент НЕ, настроечный вход, шесть мажоритарных элементов, причем настроечный вход соединен с входом третьего элемента НЕ, первым входом первого мажоритарного элемента, первым входом второго мажоритарного элемента, первым входом третьего мажоритарного элемента, первым входом четвертого мажоритарного элемента, выход третьего элемента НЕ соединен с первым входом пятого мажоритарного элемента и первым входом шестого мажоритарного элемента, первый информационный вход соединен с вторым входом третьего мажоритарного элемента и вторым входом ...

Search data processor

A tool to be used with a search engine for a information management system includes methods for refining, filtering, and organizing search queries and search results. A query tuner in the tool allows a user to automatically reformulate a query in order to find a reasonable number of matching documents from the search engine by selectively modifying individual search terms to be weaker or stronger and concurrently requesting a plurality of searches, each with a respectively different modified query. The tool also uses a dynamic filter which employs a dynamic set of record tokens to restrict the results of an arbitrary search query to selectively include or exclude records which correspond to the set of record tokens. The tool also includes a results organizer which aids the user in understanding and visualizing a large number of matching documents returned in response to a search query by clustering like items returned from the search. The query tuner, dynamic filter and results organizer may be used individually or in conjunction. The searched information management system may be consolidated or distributed and may span a global information network such as the Internet.

Method and system for generating a set of search terms

A method and system for providing a set of search terms in response to a user input are disclosed. A first set of search terms is selected from a master set of search terms based upon a match between the input and the search terms or based upon a predefined association between the input and the search terms. A second set of search terms is selected from the first set of search terms in response to a value score that is established for each of the search terms. The value score is selected based at least in part upon the amount of revenue that each search term generates for the system's operator.

Method for displaying search results and contextually related items

A search query is received from a requestor. A results set is determined for the search query. Additional items that are contextually related to the search query are determined. In one aspect, the additional items relate to brand identifiers of sponsors that are contextually related to the search query. A web page is formed containing the result set items and the additional items. The result set items are presorted in a first alignment relative to each other. The first alignment may be a vertical alignment or a horizontal alignment. The additional items are presented in the first alignment relative to the result items, and in a second alignment relative to each other. The second alignment is the other of a vertical alignment and a horizontal alignment. The web page is transmitted to the requestor in response to the search query.

Accuracy measurement of database search algorithms

A system, method and program product for evaluating search algorithms. A method is provided that includes: defining a population of searches and database records from a search history database; applying a sampling method and direct sampling rates to each search/record pair in the population using a computing system, wherein search/record pairs having a higher variability relative to the population are assigned a relatively higher probability; randomly sampling a direct sample of search/record pairs with the computing system using the direct sampling rates to increase a likelihood of obtaining search/record pairs having the higher variability; running a search algorithm and measuring errors for the direct sample and/or for an associated indirect sample; and calculating an estimated error rate for the search algorithm using inverse probability weighting.

Method and apparatus for creating and utilizing information representation of queries

An approach is provided for creating and utilizing information representation of queries. A query application receives a query. The query application expresses the query as a resource description framework graph. The query application causes at least in part storage of the query resource description framework graph.

Method of improving address book of mobile communication means and integrating address book system

FIELD: information technology. SUBSTANCE: mobile communication means with a built-in subscriber directory is used, which is configured to connect and exchange data over the Internet with a remote server, which enables to search contact details of subscribers contained in a remote database. According to criteria set by the user, a search query is made with search of contact details of another subscriber in both the local address book of the mobile communication means and the external subscriber database on the remote server. Based on the search result, a user can select the desired subscriber that best satisfies the search query criteria. EFFECT: high speed of selecting the desired subscriber and easier use of the address book. 7 cl, 1 dwg РОССИЙСКАЯ ФЕДЕРАЦИЯ (19) RU (11) 2 477 885 (13) C1 (51) МПК G06F 17/30 (2006.01) ФЕДЕРАЛЬНАЯ СЛУЖБА ПО ИНТЕЛЛЕКТУАЛЬНОЙ СОБСТВЕННОСТИ (12) ОПИСАНИЕ ИЗОБРЕТЕНИЯ К ПАТЕНТУ (21)(22) Заявка: 2011145034/08, 08.11.2011 (24) Дата начала отсчета срока действия патента: 08.11.2011 (73) Патентообладатель(и): Общество с ограниченной ответственностью "ЯНДЕКС" (RU) R U Приоритет(ы): (22) Дата подачи заявки: 08.11.2011 (72) Автор(ы): Мартынов Александр Александрович (RU) (45) Опубликовано: 20.03.2013 Бюл. № 8 2 4 7 7 8 8 5 (56) Список документов, цитированных в отчете о поиске: RU 2323472 С2, 27.04.2008. RU 2266624 С2, 20.12.2005. RU 2271615 С2, 10.03.2006. EP 1287713 B1, 06.10.2004. WO 2002098146 A2, 05.12.2002. US 2006/0229063 A1, 12.10.2006. 2 4 7 7 8 8 5 R U (54) СПОСОБ УСОВЕРШЕНСТВОВАНИЯ АДРЕСНОЙ КНИГИ СРЕДСТВА МОБИЛЬНОЙ СВЯЗИ И ИНТЕГРИРОВАННАЯ СИСТЕМА АДРЕСНОЙ КНИГИ (57) Реферат: Изобретение относится к функционалу средств мобильной связи и раскрывает способ информационного поиска в удаленных базах данных, подключенных к телекоммуникационным сетям. Техническим результатом является повышение скорости выбора необходимо абонента и повышение удобства использования адресной книги. Согласно предложенному способу используют средство мобильной ...

Effective homepage searching method using similarity recalculation based on url substring relationship

본 발명은 URL 포함 관계에 기반한 유사도 재계산을 통한 효과적인 홈페이지 검색방법에 관한 것이다. 본 발명은 같은 홈페이지에 속하는 웹 문서들의 URL들 간의 포함 관계를 이용하여 웹 문서들 중에서 그 홈페이지의 엔트리 포인트를 찾아내는 기술이다. 본 발명의 핵심은 어떤 문서의 URL이 다른 문서의 URL의 부분열(substring)이면 전자가 후자보다 홈페이지 즉 엔트리 포인트가 될 가능성이 높다는 성질을 이용한 것이다. 즉, 본 발명은 웹 검색에 있어서 종래 정보 검색 기법을 개선하여 홈페이지의 엔트리 포인트가 되는 페이지를 다른 문서들 보다 우선하여 검색되도록 함으로써, 사용자들이 검색된 웹 문서의 URL을 일일이 방문하지 않고도 검색된 웹 문서가 홈페이지인지 여부를 쉽게 알 수 있게 되는 이점이 있으며, 또한 사용자가 입력한 검색 질의가 포함하는 단어를 가지는 웹 문서들의 사이트 정보 즉 홈페이지를 우선적으로 검색하여 줌으로써 홈페이지를 통해서 더욱 많은 정보를 얻을 수 있게 되어 검색이 보다 편리해지는 이점이 있다. The present invention relates to an effective homepage retrieval method through recalculation of similarity based on URL inclusion relationship. The present invention is a technique for finding an entry point of a home page from among web documents by using an inclusion relationship between URLs of web documents belonging to the same home page. The core of the present invention utilizes the property that if the URL of one document is a substring of the URL of another document, the former is more likely to be the homepage or entry point than the latter. That is, the present invention improves the conventional information retrieval technique in the web search so that the page that is the entry point of the homepage is searched before other documents, so that the searched web document can be searched without having to visit the URL of the searched web document. There is an advantage that it is easy to know whether it is a homepage, and more information can be obtained through the homepage by first searching the site information, that is, the homepage of the web documents having the words included in the search query entered by the user. There is an advantage that the search becomes more convenient.

Information retrieval display device

Binary numbers selection device

FIELD: computer equipment. SUBSTANCE: invention relates to the computer equipment. Device is designed to process two-digit binary numbers specified by binary signals. Device comprises five majority elements (1 1, …, 1 5 ) and NOT element (2). EFFECT: broader functional capabilities of the device owing to selection of minimum or maximum of two, or median (middle) of three two-digit binary numbers, given by binary signals. 1 cl, 1 dwg, 1 tbl РОССИЙСКАЯ ФЕДЕРАЦИЯ (19) RU (11) (13) 2 681 693 C1 (51) МПК G06F 7/02 (2006.01) ФЕДЕРАЛЬНАЯ СЛУЖБА ПО ИНТЕЛЛЕКТУАЛЬНОЙ СОБСТВЕННОСТИ (12) ОПИСАНИЕ ИЗОБРЕТЕНИЯ К ПАТЕНТУ (52) СПК G06F 7/02 (2018.08); G06F 7/06 (2018.08) (21)(22) Заявка: 2018114367, 18.04.2018 (24) Дата начала отсчета срока действия патента: (73) Патентообладатель(и): Андреев Дмитрий Васильевич (RU) Дата регистрации: 12.03.2019 (56) Список документов, цитированных в отчете о поиске: RU 2622841 C1, 20.06.2017. RU 2363038 C1, 27.07.2009. RU 2620991 C1, 30.05.2017. RU 2606311 C2, 10.01.2017. US 2003/ 0018672 A1, 23.01.2003. US 3949209 A, 06.04.1976. (45) Опубликовано: 12.03.2019 Бюл. № 8 R U (54) УСТРОЙСТВО СЕЛЕКЦИИ ДВОИЧНЫХ ЧИСЕЛ (57) Реферат: Изобретение относится к вычислительной двоичных чисел, задаваемых двоичными технике. Технический результат заключается в сигналами. Устройство предназначено для расширении функциональных возможностей обработки двухразрядных двоичных чисел, устройства за счет обеспечения селекции задаваемых двоичными сигналами. Устройство минимального либо максимального из двух, либо содержит пять мажоритарных элементов (11, …, медианного (срединного) из трех двухразрядных 15) и элемент НЕ (2). 1 ил., 1 табл. Стр.: 1 C 1 C 1 Адрес для переписки: 432002, г. Ульяновск, ул. Островского, 25, кв. 38, Андрееву Дмитрию Васильевичу 2 6 8 1 6 9 3 Приоритет(ы): (22) Дата подачи заявки: 18.04.2018 2 6 8 1 6 9 3 R U 18.04.2018 (72) Автор(ы): Андреев Дмитрий Васильевич (RU) C 1 C 1 2 6 8 1 6 9 3 2 6 8 1 6 9 3 R U R U Стр.: 2 RUSSIAN FEDERATION (19) RU (11) ( ...

Method and system of configuring user profile based on a concept network and personalized query expansion system using the same

개인화 검색을 위한 개념 네트워크 기반 사용자 프로파일 구성 방법 및 시스템과 이를 이용한 개인화 질의 확장 시스템이 개시된다. 개념 네트워크 기반 사용자 프로파일 구성 시스템은, 사용자 프로파일을 작성하기 위해, 사용자가 검색 엔진을 사용하면서 탐색한 문서들을 대상으로 키워드를 추출하는 키워드 추출부와, 추출된 키워드들을 이용하여 세션 인터레스트를 생성하고, 생성된 세션 인터레스트를 누적하여 사용자 프로파일을 작성하는 세션 인터레스트 작성모듈과, 새로운 세션 인터레스트가 생성될 때마다 생성된 세션 인터레스트와 사용자 프로파일의 개념을 비교하는 비교모듈과, 세션 인터레스트가 사용자 프로파일의 개념과 동일 또는 유사할 경우, 세션 인터레스트와 사용자 프로파일의 개념을 서로 합하고, 상이할 경우, 새로운 사용자 프로파일의 개념으로서 추가하는 사용자 프로파일 갱신모듈을 포함한다. 이에 따라, 사용자가 질의한 단어를 사용자 프로파일과 비교하여, 개인화된 질의 단어를 추천하는 방식으로 검색의 개인화에 활용할 수 있다. A method and system for constructing a network-based user profile for a personalized search and a system for expanding a personalized query using the same are provided. In order to create a user profile, a system for constructing a user profile includes a keyword extractor that extracts keywords from documents searched by a user using a search engine, and generates a session interest using the extracted keywords. A session interest module for accumulating the generated session interest to create a user profile, a comparison module for comparing the concept of the generated session interest and the user profile each time a new session interest is generated, and a session interest Is the same as or similar to the concept of the user profile, the concept of the session interest and the user profile is added to each other, and if different, a user profile update module for adding as a concept of a new user profile. Accordingly, the user's query can be compared with the user's profile and can be used for personalization of the search by recommending personalized query words.