Настройки

Укажите год
-

Небесная энциклопедия

Космические корабли и станции, автоматические КА и методы их проектирования, бортовые комплексы управления, системы и средства жизнеобеспечения, особенности технологии производства ракетно-космических систем

Подробнее
-

Мониторинг СМИ

Мониторинг СМИ и социальных сетей. Сканирование интернета, новостных сайтов, специализированных контентных площадок на базе мессенджеров. Гибкие настройки фильтров и первоначальных источников.

Подробнее

Форма поиска

Поддерживает ввод нескольких поисковых фраз (по одной на строку). При поиске обеспечивает поддержку морфологии русского и английского языка
Ведите корректный номера.
Ведите корректный номера.
Ведите корректный номера.
Ведите корректный номера.
Укажите год
Укажите год
Применить Всего найдено 7262. Отображено 100.
11-10-2017 дата публикации

Терминал для печати предварительного проездного документа

Номер: RU0000174353U1
Автор: Владимир Анатольевич Козлов
Принадлежит: Общество с ограниченной ответственностью "ТрансРейлСнаб"

Полезная модель относится к билетопечатающим терминалам и может использоваться для автоматизированной системы контроля посадки.Технический результат предлагаемой полезной модели заключается в повышении срока службы внутреннего оборудования терминала за счет его надежной защиты от воздействия окружающей среды.Терминал для печати посадочного талона включает внешний антивандальный корпус и внутренний терморегулируемый корпус, выполненный с возможностью размещения печатного модуля и модуля управления, при этом внешний корпус включает вентиляционные отверстия с защитной сеткой и карманом. Ц 1 174353 ко РОССИЙСКАЯ ФЕДЕРАЦИЯ (19) (11) ад а (13) (51) МПК СОбЕ 17/00 (2006.01) НО5К 7/20 (2006.01) СОбЕ 1/16 (2006.0Т) ФЕДЕРАЛЬНАЯ СЛУЖБА ПО ИНТЕЛЛЕКТУАЛЬНОЙ СОБСТВЕННОСТИ (12) ОПИСАНИЕ ПОЛЕЗНОЙ МОДЕЛИ К ПАТЕНТУ (21)(22) Заявка: 2017116930, 16.05.2017 (24) Дата начала отсчета срока действия патента: 16.05.2017 Дата регистрации: 11.10.2017 Приоритет(ы): (22) Дата подачи заявки: 16.05.2017 (45) Опубликовано: 11.10.2017 Бюл. № 29 Адрес для переписки: 109456, Москва, Рязанский пр-кт, 75, корп. 4, 1-я башня, 7 этаж, КГ "Вайзэдвайс", ООО "ФПБ Гардиум", Епифанцевой Н.А. (72) Автор(ы): Козлов Владимир Анатольевич (КО) (73) Патентообладатель(и): Общество с ограниченной ответственностью "ГрансРейлСнаб" (КО) (56) Список документов, цитированных в отчете о поиске: ВО 94035 01, 10.05.2010. ВО 67745 01, 27.10.2007. ВО 96678 01, 10.08.2010. ВО 2390845 СТ, 27.05.2010. 05 4818854 А, 04.04.1989. (54) ТЕРМИНАЛ ДЛЯ ПЕЧАТИ ПРЕДВАРИТЕЛЬНОГО ПРОЕЗДНОГО ДОКУМЕНТА (57) Реферат: Полезная модель ОТНОСИТСЯ К билетопечатающим терминалам и может использоваться для автоматизированной системы контроля посадки. Технический результат предлагаемой полезной модели заключается в повышении срока службы внутреннего оборудования терминала за счет его надежной защиты от воздействия окружающей Стр.: 1 среды. Терминал для печати посадочного талона включает внептний антивандальный корпус и внутренний терморегулируемый ...

Подробнее
Номер записи: 1
12-04-2012 дата публикации

Automated and self-adjusting data protection driven by business and data activity events

Номер: US20120089572A1
Автор: David G. Van Hise, Eran Raichstein, Gregory J. Tevis, James P. Smith, Oren WOLF
Принадлежит: International Business Machines Corp

Techniques for adjusting the frequency of data backups and initiating event-driven backups in a storage system are disclosed herein. In one embodiment, a self-adjusting backup frequency, known as a “Change Rate Objective,” is defined to conduct or delay backups for one or more volumes in the storage system on the basis of an associated policy value. The Change Rate Objective may be tied to one or more business or data activity events, such as the amount and type of data changes since a last backup. The storage system may also be tailored to conduct or delay full or incremental backups on the basis of a Change Rate Objective that measures whether a full or incremental or differential backup is more appropriate. Various data or system failures, or data or business events may also be used to adjust the retention periods of continuous data protection (CDP) data and delay a rollup of CDP data.

Подробнее
Номер записи: 2
26-07-2012 дата публикации

Deferring Classification of a Declared Record

Номер: US20120191711A1
Автор: Frank R. Ayars, Li Zhou, Yi-Jen Lin, Yvonne W. Santiago
Принадлежит: International Business Machines Corp

A records management system classifies records according to a file plan. Record are declared, and then classified. Some records have in initially indeterminate classification and classification is deferred, either by request or due to a lack of sufficient information to classify the record according to the file plan. Unclassified records are placed into a temporary container. At some time while in the temporary container a classification event occurs with a given record which allows the records management system to classify the record and place it into a container corresponding to its classification.

Подробнее
Номер записи: 3
16-08-2012 дата публикации

Resource management using constraint programming with efficient ordering of variables

Номер: US20120209648A1
Автор: Yehuda Naveh, Yossi Richter
Принадлежит: International Business Machines Corp

A method for resource management includes associating respective variables with resource consumers, and identifying resources as values applicable to the variables. A group of the variables are identified as preferred variables. An assignment of the values to the variables that satisfies constraints applying to the allocation of the resources is found by repeatedly performing the steps of choosing a variable from the group, instantiating the chosen variable with a value, removing the chosen variable from the group, and pruning the domains of the other variables by propagation of the constraints. The resources are assigned to the resource consumers responsively to the assignment of the values to the variables.

Подробнее
Номер записи: 4
16-08-2012 дата публикации

Document encryption and decryption

Номер: US20120210126A1
Автор: Kenneth L. Wilson, Michael E. Johnson
Принадлежит: Securencrypt LLC

A document encryption and decryption system and method for selectively encrypting and decrypting files and attachments, electronic mail, text messages, and any other items to protect or secure its contents by helping to prevent unauthorized individuals from viewing data in human-perceivable or readable form. The encryption and decryption system includes remote authentication to verify user credentials stored on a remote database hosted by a web server. The encryption system further includes remote deletion to automatically delete at least encrypted items stored on the user's computer, handheld or portable device, smartphone, tablet, and any other computer of any kind when enabled and logged onto a network. The encryption and decryption system includes selectively decrypting items by retrieving a decryption key and decrypting the item, and/or typing a decryption key if the item cannot be decrypted with the key, and/or sending an invitation to a recipient using the web server.

Подробнее
Номер записи: 5
30-08-2012 дата публикации

Logging scheme for column-oriented in-memory databases

Номер: US20120221528A1
Автор: Frank Renkes, Joos-Hendrik Böse
Принадлежит: SAP SE

According to some embodiments, a column-oriented in-memory database structure may be established. The database structure may, for example, include a main store and a dictionary compressed delta store. Moreover, the delta store may comprise a value identifier vector and a delta dictionary associated with a column of the database. A transaction associated with the column may then be received and recorded within the delta store. According to some embodiments, entries associated with the transaction may be added to a value log of the value identifier vector and, independently, to a dictionary log of the delta dictionary.

Подробнее
Номер записи: 6
20-12-2012 дата публикации

Generating Predictions From A Probabilistic Process Model

Номер: US20120323827A1
Автор: Davood Shamsi, Geetika T. Lakshmanan, Yurdaer Nezihi Doganata
Принадлежит: International Business Machines Corp

A method for predictive analytics in a semi-structured process including updating, iteratively, at least one probability of a probabilistic process model based on a completed task, wherein updating the at least one probability of the probabilistic process model includes receiving the probabilistic process model associated with a todo list including a plurality of tasks of the semi-structured process, defining a cost of each of the plurality of tasks, prioritizing the plurality of tasks according to the costs, and recommending a next task from the todo list according to a prioritization

Подробнее
Номер записи: 7
20-12-2012 дата публикации

Efficient development of a rule-based system using crowd-sourcing

Номер: US20120323866A1
Автор: L. Venkata Subramaniam, Snigdha Chaturvedi, Tanveer Afzal Faruquie
Принадлежит: International Business Machines Corp

Described herein are methods, systems, apparatuses and products for efficient development of a rule-based system. An aspect provides a method including accessing data records; converting said data records to an intermediate form; utilizing intermediate forms to compute similarity scores for said data records; and selecting as an example to be provided for rule making at least one record of said data records having a maximum dissimilarity score indicative of dissimilarity to already considered examples.

Подробнее
Номер записи: 8
17-01-2013 дата публикации

System and Method for Enhancing and Sustaining Operational Efficiency

Номер: US20130018689A1
Автор: Diego Guicciardi
Принадлежит: Individual

The instant specification discloses methods and means for enhancing and sustaining performance efficiencies within an organization, the methods and means including at least an operational methodology and a software package. Using the Methodology with the related software enables an organization to effectively plan, document, manage and continuously improve its operations in order to achieve (and possibly exceed) its business goals. Therefore, the Methodology and the related System enable an organization to safely and efficiently achieve business excellence and sustain it over time.

Подробнее
Номер записи: 9
17-01-2013 дата публикации

Speculative Begin Transaction

Номер: US20130018988A1
Автор: Daniel Nota Peek
Принадлежит: Individual

Speculative processing of begin transaction database messages may include receiving a begin transaction message from a database client, transmitting an acknowledgement of the begin transaction message to the database client prior to forwarding the begin transaction message to the database server, forwarding the begin transaction message to the database server, and receiving an acknowledgement of the begin transaction message from the database server. In some implementations, the acknowledgement of the begin transaction message to the database client is transmitted substantially without delay after receiving the begin transaction message from the database client.

Подробнее
Номер записи: 10
07-02-2013 дата публикации

Metadata management for fixed content distributed data storage

Номер: US20130036088A1
Автор: David E. Chavez, Jack A. Orenstein
Принадлежит: Hitachi Data System Corp

An archival storage cluster of symmetric nodes includes a metadata management system that organizes metadata objects. Each metadata object may have a unique name, and metadata objects are organized into regions. A region is selected by hashing one or more object attributes and extracting a given number of bits of the resulting hash value. The number of bits may be controlled by a configuration parameter. Each region is stored redundantly. A region comprises a set of region copies. In particular, there is one authoritative copy of the region, and zero or more backup copies. The number of backup copies may be controlled by a configuration parameter. Region copies are distributed across the nodes of the cluster to balance the number of authoritative region copies per node, and the number of total region copies per node. Backup region copies are maintained synchronized to their associated authoritative region copy.

Подробнее
Номер записи: 11
28-02-2013 дата публикации

Verifying a data recovery component using a managed interface

Номер: US20130054533A1
Автор: Howard Hao, James Robert Benton, Thothathri Vanamamalai
Принадлежит: Microsoft Corp

The subject disclosure is directed towards verifying a data recovery component of a volume snapshot service using a managed interface. The managed interface enables interoperability between the data recovery component and one or more complementary data recovery components by converting compatible instructions for the data recovery component and a complementary data recovery component into native data recovery operations for the volume snapshot service and vice versa. Via the managed interface, the complementary data recovery component emulates the native data recovery operations. Using status information associated with such an emulation, the data recovery component is verifiable.

Подробнее
Номер записи: 12
11-04-2013 дата публикации

Identifying unknown parameter and name value pairs

Номер: US20130091152A1
Автор: Iosif V. Onut, Paul Ionescu
Принадлежит: International Business Machines Corp

Identifying parameter and name/value pair separators within two or more strings of data. The identifying is performed by selecting at least one name/value pair separator candidate from the two or more strings of data, and filtering the at least one name/value pair separator candidate using one or more rules, thereby removing any of the name/value pair separator candidates that do not conform to any of the one or more rules. The identifying additionally includes selecting at least one parameter separator candidate from the two or more strings of data, and filtering the at least one parameter separator candidate using one or more rules, thereby removing any of the at least one parameter separator candidates that do not conform to any of the one or more rules. The result is a set of tuples that includes a name/value separator candidate, and a parameter separator candidate.

Подробнее
Номер записи: 13
18-04-2013 дата публикации

SYSTEM AND METHOD FOR LOGISTICS OPTIMIZATION USING LANE ORDER PATTERN FLEXING

Номер: US20130096973A1
Автор: DeFrances Anthony, Hennington, IV Boyett Judgson, LaVoie Steven, Michalski John William, Sale Shrinivas, Swihart Michael Robb, Valsaraj Varunraj
Принадлежит:

A system and method is provided which determines optimal logistics solutions by allowing a purchaser of goods to vary order frequency and amount of goods ordered so as to lower logistics costs while still meeting inventory constraints. The logistics solution uses several models to search for the most optimal solution in any of a variety of metrics, including total cost, percentage trailer utilization, number of truck used, and miles driven. 1. A method for computerized logistics optimization , said method including: wherein said current inbound order history represents the order history for a predetermined order history time,', 'wherein said inbound order history includes at least one shipment of a first product,', 'wherein the number of times said at least one shipment of said first product takes place during said predetermined order history time is known as the first product order frequency,', 'wherein the amount of said first product contained in said at least one shipment of said first product is known as the first product amount,', 'wherein said inbound order history includes at least one shipment of a second product,', 'wherein the number of times said at least one shipment of said second product takes place during said predetermined order history time is known as the second product order frequency,', 'wherein the amount of said second product contained in said at least one shipment of said second product is known as the second product amount,, 'electronically receiving a current inbound order history for a receiver of goods,'}wherein each of said at least one shipment of a first product and said at least one shipment of a second product utilizes a percentage of the available space of the trailer used to transport said shipment and wherein the average of all such percentages is known as the overall trailer utilization; andelectronically calculating a logistics solution set by altering at least one of said first product order frequency, said second product ...

Подробнее
Номер записи: 14
18-04-2013 дата публикации

Methods, Systems, And Computer-Readable Media For Determining A Plurality Of Turfs From Where To Reallocate A Workforce To A Given Turf

Номер: US20130096974A1
Автор: Cole Robert, Ingman Robert, Miller Richard
Принадлежит: AT&T Intellectual Property I, L.P.

Methods, systems, and computer-readable media provide for determining a plurality of turfs from where to reallocate a workforce to a given turf. According to embodiments, a method for determining a plurality of turfs from where to reallocate a workforce to a given turf is provided. According to the method, an indication of the given turf is received. Optimal turfs from where to reallocate technicians to the given turf are determined from a plurality of turfs. Visual cues for identifying at least a portion of the optimal turfs are generated. 1. A method for determining a plurality of turfs from where to reallocate a workforce to a given turf , the method comprising:displaying, by a computer having a processor and a memory, a graphical user interface, the graphical user interface displaying a plurality of turfs in a map presentation that provides a visual mapping of physical distances between each of the plurality of the turfs, wherein each of the plurality of turfs comprises a geographic area, and wherein each of a plurality of telecommunications technicians are assigned to one of the plurality of turfs;receiving, via the computer, a selection of the given turf from the plurality of turfs through the graphical user interface; determining, by the computer, other turfs of the plurality of turfs that are optimal turfs from where to reallocate telecommunications technicians to the given turf, and', 'displaying, by the computer via the graphical user interface, contact information of a field supervisor associated with the given turf;, 'upon receiving the selection of the given turf from the plurality of turfs,'}determining, by the computer, a level of optimality for each of the optimal turfs with respect to reallocating the telecommunications technicians from each of the optimal turfs to the given turf; andgenerating, by the computer, visual cues in the graphical user interface highlighting each of the optimal turfs associated with a different shade of highlighting ...

Подробнее
Номер записи: 15
18-04-2013 дата публикации

METHOD AND SYSTEM FOR ADAPTING A PRODUCTION FLOW SCHEDULE FOR A PRODUCTION PROCESS

Номер: US20130096975A1
Автор: SCHUH Lothar, STICH Christian
Принадлежит: ABB TECHNOLOGY AG

A method and system are disclosed for adapting a production flow schedule for one or more production processes, each having one or more process steps that use power for the execution thereof. An exemplary method includes identifying at least one availability time window in which there is a predetermined minimum power availability within a predetermined optimization time period based on a piece of availability information which indicates a forecast power availability during the optimization time period; providing an indication of one or more flexible process steps, which can be executed in a plurality of alternative time windows within the optimization time period; and for each of the flexible process steps, temporally rearranging the corresponding flexible process step into one of the corresponding alternative time windows if the rescheduling is within the availability time window in order to obtain an adapted production flow schedule. 1. A method for adapting a production flow schedule for one or more production processes , at least some of the one or more processes including one or more process steps that use energy for their execution , the method comprising:identifying at least one availability time window in which a predetermined minimum energy availability is present within a predetermined optimization period based on availability information that indicates a forecast energy availability during the optimization period;indicating one or more flexible process steps, wherein the one or more flexible process steps specify those process steps that can be executed in one or more alternative time windows within the optimization period without impairing one or more optimization variables on which preparation of the production flow schedule is based; andfor each of the flexible process steps, rescheduling an appropriate flexible process step into a relevant alternative time window if the rescheduling is within the at least one availability time window, in order to ...

Подробнее
Номер записи: 16
02-05-2013 дата публикации

Context-sensitive query enrichment

Номер: US20130106695A1
Автор: Clarence T. Tegreene, Daniel Reed, Edward K.Y. Jung, Harry Shum, Jordin T. Kare, Lowell L. Wood, JR., Marc E. Davis, Mark A. Malamud, Matthew G. Dyor, Nathan P. Myhrvold, QI Lu, Roderick A. Hyde, Royce A. Levien, Satya Nadella, William Gates, Xuedong Huang
Принадлежит: ELWHA LLC

Structures and protocols are presented for facilitating a search partly based on a movement status of a search-capable device or on a position of a person's limb or on an association with another search-capable device.

Подробнее
Номер записи: 17
09-05-2013 дата публикации

Primary Data Storage System with Quality of Service

Номер: US20130117286A1
Автор: Ashmore Paul A., Gallant David A., Long Kelly E., Sobolewski Sebastian Piotr
Принадлежит: NEXGEN STORAGE, INC.

The invention is directed to a primary data storage system for use in a computer network in which a network allows user computers to transfer data to/from the primary data storage system. In one embodiment, the primary data storage system allows an administrator of the computer network to define two or more volumes on the primary data storage system and define quality of service goals for each volume. The primary data storage system operates so as allocate resources within the primary data storage system to the volumes based upon criticality and performance goals specified for each of the volumes. 1. A primary data storage system for use in a computer network and having a quality of service capability , the system comprising:an input/output port for receiving a block command packet that embodies one of a read block command and a write block command and transmitting a block result packet in reply to a block command packet;a data store system having at least one data store capable of receiving and storing data in response to a write block command and retrieving and providing data in response to a read block command;wherein the data store system is capable of having at least a first volume with a first criticality and first quality of service goals and a second volume with a second criticality and a second quality of service goals;a statistical database for receiving, storing, and providing data for use in making decisions related to the pursuit of the first and second quality of service goals; anda sorting processor for sorting an input string comprised of multiple read/write block commands into an output string of multiple read/write block commands using data from the statistical database, wherein the order of the read/write block commands in the output string reflects the pursuit of the first and second quality of service goals.2. A primary data storage system claim 1 , as claimed in claim 1 , wherein:the sorting processor includes:a sub-string processor for sorting ...

Подробнее
Номер записи: 18
09-05-2013 дата публикации

INSTRUCTION AND LOGIC FOR PROCESSING TEXT STRINGS

Номер: US20130117534A1
Автор: Chennupaty Srinivas, Gray Jeffrey D., Julier Michael A., Mirkes Sean P., Seconi Mark P.
Принадлежит:

Method, apparatus, and program means for performing a string comparison operation. In one embodiment, an apparatus includes execution resources to execute a first instruction. In response to the first instruction, said execution resources store a result of a comparison between each data element of a first and second operand corresponding to a first and second text string, respectively. 2. The processor as in claim 1 , wherein each of the first and second data elements includes 8 bits.3. The processor as in claim 1 , wherein each of the first and second data elements includes 16 bits.4. The processor as in claim 1 , wherein each of the first and second data elements includes 32 bits. This is a continuation of U.S. patent application Ser. No. 13/164,715, entitled, “Instruction And Logic For Processing Text Strings” filed Jun. 20, 2011, which is a continuation of U.S. patent application Ser. No. 11/525,981, filed Sep. 22, 2006, which is hereby incorporated by reference in its entirety into this application.The present disclosure pertains to the field of processing apparatuses and associated software and software sequences that perform logical and mathematical operations.Computer systems have become increasingly pervasive in our society. The processing capabilities of computers have increased the efficiency and productivity of workers in a wide spectrum of professions. As the costs of purchasing and owning a computer continues to drop, more and more consumers have been able to take advantage of newer and faster machines. Furthermore, many people enjoy the use of notebook computers because of the freedom. Mobile computers allow users to easily transport their data and work with them as they leave the office or travel. This scenario is quite familiar with marketing staff, corporate executives, and even students.As processor technology advances, newer software code is also being generated to run on machines with these processors. Users generally expect and demand higher ...

Подробнее
Номер записи: 19
16-05-2013 дата публикации

REPORT AUTHORING

Номер: US20130124527A1
Автор: Cohen-Solal Eric, Lee Michael Chun-chieh
Принадлежит: KONINKLIJKE PHILIPS ELECTRONICS N.V.

A system for aiding report authoring is disclosed. The system comprises a set of associations (), wherein an association links at least one first concept term in a knowledge domain with at least one second concept term in the knowledge domain, wherein the association indicates a frequent co-occurrence of the at least one first concept term and the at least one second concept term in reports in the knowledge domain. The system comprises a concept term extractor () for extracting at least one first concept term () relating to a particular subject from a data record () associated with the particular subject, the data record () comprising an at least partially completed report () relating to the particular subject. The system comprises a missing concept term finder () for finding at least one second concept term () linked to the at least one first concept term () based on the set of associations (), wherein the at least one second concept term () is missing from the at least partially completed report (). 1. A system for aiding report authoring , comprisinga set of associations, wherein an association links at least one first concept term in a knowledge domain with at least one second concept term in the knowledge domain, wherein the association indicates a frequent co-occurrence of the at least one first concept term and the at least one second concept term in reports in the knowledge domain;{'b': '6', 'a concept term extractor for extracting at least one first concept term () relating to a particular subject from an at least partially completed report relating to the particular subject;'}a missing concept term finder for finding at least one second concept term linked to the at least one first concept term based on the set of associations, wherein the at least one second concept term is missing from the at least partially completed report;an indicator for indicating the found at least one second concept term to a user.2. The system according to claim 1 , wherein the ...

Подробнее
Номер записи: 20
16-05-2013 дата публикации

Method and apparatus for updating song playlists based on received user ratings

Номер: US20130124533A1
Автор: Ajit Apte, Amit Khanna, Rakesh YADAV
Принадлежит: Google LLC

Methods, apparatuses, and computer programs are presented for updating song playlists based on received rating inputs from user devices. One method includes receiving information associated with songs in an initial playlist from a host device by a server. The server generates a rating interface for the initial playlist, which is associated with an image code. The image code for the rating interface is sent to the host device so that the user devices can access the rating interface via the image code. After one or more user devices provides rating inputs to the songs in the initial playlist, the received one or more rating inputs are analyzed to produce an adjusted playlist. The method further includes transmitting the adjusted playlist to the host device to be executed.

Подробнее
Номер записи: 21
23-05-2013 дата публикации

Managing information technology solution centers

Номер: US20130132144A1
Автор: Clemens Jacob, Wulf Kruempelmann
Принадлежит: SAP SE

The present disclosure describes methods, systems, and computer program products for managing an information technology (IT) solution center. One method includes determining a list of priorities about activities based on a set of properties related to the activities, optimizing the activities based on the list of priorities, and assigning the optimized activities with correlated actions. The correlated actions can include at least one of (i) appointing one or more entries of the activities to customer relationship management and (ii) transferring one or more entries of the activities to a notification user interface. The method may further include maintaining a database associated with an industry IT solution center, wherein the database includes the activities and the set of properties related to the activities, and displaying issues, technical incidents, and alerts grouped according to a set of definitions.

Подробнее
Номер записи: 22
06-06-2013 дата публикации

Cohort Manipulation and Optimization

Номер: US20130144676A1
Автор: "OSullivan Patrick J.", Thorburn James C.
Принадлежит: INTERNATIONAL BUSINESS MACHINES CORPORATION

An approach is provided to visually depict cohort data to a user. The approach includes receiving a cohort display request (e.g., from a user, etc.). In response to the request, the approach retrieves a plurality of cohort data records, with each of the cohort data records corresponding to a cohort selected from a group of cohorts. In this approach, the group of cohorts represent similar computer systems. The approach displays a set of graphic user interface (GUI) controls on a display device, with each of the GUI controls corresponds to one of the retrieved cohort data records. A user selection is received that corresponds to a selected one of the GUI controls. The system responds by executing a cohort action on the cohort corresponding to the selected GUI control. 1. A method , in a data processing system comprising at least one computing device and a plurality of computing resources , comprising:receiving a cohort display request;retrieving a plurality of cohort data records in response to the received request, wherein each of the cohort data records corresponds to a cohort selected from a plurality of cohorts, and wherein the plurality of cohorts are similar computer systems;displaying a plurality of graphic user interface (GUI) controls on a display device, wherein each of the GUI controls corresponds to one of the retrieved cohort data records;receiving a user selection corresponding to a selected one of the GUI controls; andexecute a cohort action on the cohort corresponding to the selected GUI control.2. The method of further comprising:selecting at one or more computing environment entitlement contract (CEEC) data structures corresponding to one of the displayed cohort GUI controls, wherein each CEEC data structure defining terms of a business level agreement between a contracting party and a provider of the data processing system, wherein the terms of the CEEC specify a set of computing resources having a specified configuration that are to be used by the ...

Подробнее
Номер записи: 23
06-06-2013 дата публикации

METHOD AND APPARATUS FOR PERFORMING EXTENDED SEARCH

Номер: US20130144892A1
Автор: Cai Keke, Guo Hong Lei, Su Zhong, Zhu Hui Jia
Принадлежит: INTERNATIONAL BUSINESS MACHINES CORPORATION

A method and apparatus for performing extended search are provided. The method includes receiving user-inputted keywords; extending the user-inputted keywords according to geographical information to acquire extended keywords; performing a search by using the extended keywords; and returning search results to the user. With the present technical solutions, privilege control can be effectively performed in a cloud storage system. With the present embodiments, more information may be provided to a user for reference. 1. An apparatus for performing an extended search , comprising:a receiving module configured to receive user-inputted keywords;an extending module configured to extend the user-inputted keywords according to geographical information to acquire extended keywords;a searching module configured to perform a search with a processor by using the extended keywords; anda returning module configured to return search results to the user.2. The apparatus of claim 1 , wherein the extending module comprises:a module configured to acquire a location name in the user-inputted keywords;a module configured to determine a geographical entity referred to by the location name as a target geographical entity;a module configured to acquire adjacent geographical entities of the target geographical entity, wherein a distance between the adjacent geographical entities to the target geographical entity satisfies a criterion; anda module configured to take names of the adjacent geographical entities as an extension to the keywords.3. The apparatus of claim 2 , wherein the distance is at least one of the following:straight-line distance, path distance and arrival-time distance.4. The apparatus of claim 2 , wherein the module configured to take names of the adjacent geographical entities as an extension to the keywords comprises:a module configured to sort the adjacent geographical entities according to the corresponding distance to the target geographical entity;a module configured ...

Подробнее
Номер записи: 24
13-06-2013 дата публикации

Methods, Systems, And Computer-Readable Media For Generating A Report Indicating Job Availability

Номер: US20130151304A1
Автор: Cole Robert, Ingman Robert, Miller Richard
Принадлежит: AT&T Intellectual Property I, L.P.

Methods, systems, and computer-readable media provide for generating a report indicating job availability. According to embodiments, a method for generating a report indicating job availability is provided. According to the method, a selected assignment group is displayed. A number of status messages received by a technician in the selected assignment group is displayed. The status messages indicate that no jobs are available for the technician. An amount of lost time associated with the technician in the selected assignment group is determined. The lost time includes a difference between a time at which the technician received one of the status messages and a time at which the technician is dispatched to a next job. The amount of lost time associated with the technician in the selected assignment group is displayed. 1. A method for generating a report indicating job availability , comprising:receiving, by a processor, a selection of an assignment group from a plurality of assignment groups, each of the plurality of assignment groups representing a geographic area, the report being limited to the assignment group;displaying, by the processor in the report, the assignment group;determining, by the processor, a quantity of status messages received by a technician in the assignment group, each of the status messages expressly notifying the technician that no jobs are available for the technician;displaying, by the processor in the report, a first numeric value of the quantity of status messages received by the technician in the assignment group;determining, by the processor, an amount of lost time associated with the technician in the assignment group, the lost time comprising a difference between a time at which the technician received one of the status messages and a time at which the technician is dispatched to a next job;displaying, by the processor in the report, a type of the next job the technician is dispatched to after receiving the one of the status messages; ...

Подробнее
Номер записи: 25
20-06-2013 дата публикации

RECOMMENDING TAGS BASED ON USER RATINGS

Номер: US20130159323A1
Автор: Hua Sheng, Wu Xian, Yuan Quan, Zhao Shiwan
Принадлежит: INTERNATIONAL BUSINESS MACHINES CORPORATION

A method of recommending tags for user includes receiving a current rating of current user on current objects; determining a candidate tag set based on the current user and the current rating; ordering each candidate tag in the candidate tag set based on index value thereof; and recommending tags for the current user based on the ordering. 1. A method of recommending tags for user , the method comprising:receiving, with a processing device, a current rating of a current user on current objects;determining a candidate tag set based on the current user and the current rating;ordering candidate tags in the candidate tag set based on index values thereof; andrecommending tags for the current user based on the ordering.2. The method according to claim 1 , wherein claim 1 , the determining a candidate tag set based on the current user and the current rating comprises: determining history tags of the current user under the current rating as the candidate tag set based on predetermined correlative relationship of the user with history tags under different rating levels.3. The method according to claim 2 , wherein claim 2 , the correlative relationship of the user with content of history tags under different rating levels comprises similarity between each two of the objects claim 2 , which is determined based on content similarity of history tags of the objects and rating similarity of different users on a same object.4. The method according to claim 3 , wherein each object has a first vector and a second vector claim 3 , the first vector is term frequency/inverse document frequency value of that object on corresponding history tags claim 3 , and the second vector is history rating on that object claim 3 , and determination of the similarity between each two of the objects comprises:determining the content similarity Sim1(i, j) based on similarity between the first vectors;determining the rating similarity Sim2(i, j) based on similarity between the second vectors; ...

Подробнее
Номер записи: 26
27-06-2013 дата публикации

METHOD AND APPARATUS FOR PERFORMING LOGICAL COMPARE OPERATIONS

Номер: US20130166883A1
Автор: Buxton Mark, Gottlieb Koby, Kapoor Rajiv, Sperber Zeev, Zohar Ronen
Принадлежит:

A method and apparatus for including in a processor instructions for performing logical-comparison and branch support operations on packed or unpacked data. In one embodiment, instruction decode logic decodes instructions for an execution unit to operate on packed data elements including logical comparisons. A register file including 128-bit packed data registers stores packed single-precision floating point (SPFP) and packed integer data elements. The logical comparisons may include comparison of SPFP data elements and comparison of integer data elements and setting at least one bit to indicate the results. Based on these comparisons, branch support actions are taken. Such branch support actions may include setting the at least one bit, which in turn may be utilized by a branching unit in response to a branch instruction. Alternatively, the branch support actions may include branching to an indicated target code location. 1. A system comprising: a cache to store data;', 'instruction decode logic to decode one or more instructions;', 'a register file including a set of 128-bit packed data registers to store packed single-precision floating point (SPFP) data elements and packed integer data elements;', 'an execution unit to execute a plurality of instructions to operate on the packed data elements including:', 'a first comparison instruction to compare a first SPFP data element and a second SPFP data element and to responsively set at least one bit of data to indicate a result of the first comparison instruction;', 'a second comparison instruction to compare a first integer data element and a second integer data element and to responsively set the at least one bit of data to indicate a result of the second comparison instruction;', 'a branch instruction to indicate a branch operation to be performed based on the at least one bit of data set by the first or second comparison instructions;', 'a universal serial bus (USB) interface to be coupled with the processor;', ' ...

Подробнее
Номер записи: 27
27-06-2013 дата публикации

METHOD AND APPARATUS FOR PERFORMING LOGICAL COMPARE OPERATIONS

Номер: US20130166884A1
Автор: Buxton Mark, Gottlieb Koby, Kapoor Rajiv, Sperber Zeev, Zohar Ronen
Принадлежит:

A method and apparatus for including in a processor instructions for performing logical-comparison and branch support operations on packed or unpacked data. In one embodiment, instruction decode logic decodes instructions for an execution unit to operate on packed data elements including logical comparisons. A register file including 128-bit packed data registers stores packed single-precision floating point (SPFP) and packed integer data elements. The logical comparisons may include comparison of SPFP data elements and comparison of integer data elements and setting at least one bit to indicate the results. Based on these comparisons, branch support actions are taken. Such branch support actions may include setting the at least one bit, which in turn may be utilized by a branching unit in response to a branch instruction. Alternatively, the branch support actions may include branching to an indicated target code location. 1. A system comprising: a cache to store data;', 'instruction decode logic to decode one or more instructions;, 'a processor, comprisinga data register file including a set of 128-bit packed data registers, the packed data registers to store packed single-precision floating point (SPFP) data elements including a first SPFP data element and a second SPFP data element; andan execution unit to execute a comparison instruction to compare the first SPFP data element and the second SPFP data element and to responsively set at least one bit of data to indicate a result of the comparison, the at least one bit of data to control operation of a branch instruction;a universal serial bus (USB) interface to be coupled with the processor; andan input/output (I/O) bridge to be coupled with the processor.2. The system as in wherein the register file comprises one set of physical registers for storing floating point values and vector data elements.3. The system as in wherein the data elements are each a byte in length.4. The system as in wherein the data elements ...

Подробнее
Номер записи: 28
04-07-2013 дата публикации

Techniques for updating join indexes

Номер: US20130173588A1
Автор: Grace Kwan-On Au, Lu MA, Xiaobin Ma
Принадлежит: Teradata US Inc

Techniques for updating join indexes are provided. A determination is made to update date criteria in a join index query statement. The join index is parsed for current date and current time criteria. The join index is revised based on the location of the current date and current time criteria as they appear in the original join index. The revisions include new criteria that minimize the effort in maintaining and using the join index.

Подробнее
Номер записи: 29
04-07-2013 дата публикации

Data export/import from multiple data source to a destination data repository using corresponding data exporters and an importer

Номер: US20130173668A1
Автор: Peter M. Abrams, Vik S. Anantha
Принадлежит: MCKESSON HEALTH SOLUTIONS LLC

Embodiments of the present invention provide methods and systems for exporting data from a number of data sources using a number of corresponding data exporters, and importing the exported data into a destination data repository using a data importer. In various embodiments, the data exporters may be automatically generated using a data exporter generator adapted to generate the data exporters in view of data schemas of the data sources.

Подробнее
Номер записи: 30
11-07-2013 дата публикации

SYSTEM AND METHOD FOR ORGANIZING, PROCESSING AND PRESENTING INFORMATION

Номер: US20130179457A1
Автор: Gold David P.
Принадлежит:

In a method for organizing information in a database, abstractions are separated from expressions of the abstractions to obtain a first set of information corresponding to the abstractions and a second set of information corresponding to at least one set of characteristics relating to the expressions of the abstractions. Each abstraction is arranged within the first set of information hierarchically within the database. Each set of characteristics relating to an expression of an abstraction within the second set of information is associated with an abstraction within the database. 1. A method for organizing information in a database , comprising:separating abstractions from expressions of the abstractions to obtain a first set of information corresponding to the abstractions and a second set of information corresponding to at least one set of characteristics relating to the expressions of the abstractions, wherein the abstractions include legal theories and the expressions of the abstractions include judicial decisions;arranging each abstraction within the first set of information hierarchically within the database; andassociating each set of characteristics relating to an expression of an abstraction within the second set of information with an abstraction within the database.2. The method according to claim 1 , wherein each abstraction is a proposition of law.3. The method according to claim 1 , wherein each set of characteristics relating to an expression of an abstraction is a judicial decision.4. The method according to claim 1 , wherein the arrangement of each abstraction within the first set of information hierarchically within the database creates a taxonomy having a plurality of levels.5. The method according to claim 4 , wherein each level in the taxonomy includes at least one node.6. The method according to claim 5 , wherein each node is a legal theory or a proposition of law.7. The method according to claim 5 , wherein each node that is not a top level ...

Подробнее
Номер записи: 31
11-07-2013 дата публикации

System and method for provenance function window optimization

Номер: US20130179464A1
Автор: Chitra Venkatramani, II John Sidney Davis, Maria Rene Ebling, Min Wang
Принадлежит: International Business Machines Corp

A system and method for managing provenance data are disclosed. In accordance with one method, input data elements assessed by a processing element are evaluated. The method further includes determining whether an input window comprising the input data elements includes a sufficient amount of relevant input data. If the input window does not include a sufficient amount of relevant input data, then the input data elements are designated for reference in response to a provenance query.

Подробнее
Номер записи: 32
18-07-2013 дата публикации

WELL WORK OPPORTUNITY SYSTEM

Номер: US20130185113A1
Автор: Culp Randi Jo, Freyre Jairo, Jarrell Perry, Lazaro Gloria Esperanza, Venugopalan Mahesh
Принадлежит: BP CORPORATION NORTH AMERICA INC.

A non-transitory, computer-readable storage device comprises software that, when executed by a computer, causes the computer to track one or more well work opportunities. For example, the software may cause the computer to receive input, from a user input device, information pertaining to well work opportunity for an existing production rig, and perform an analysis of the well work opportunity based on the information to compute an incremental increase in rate of production from the production rig and a time period by which an investment will be paid back. The software may also cause the computer to compare the incremental increase in rate of production and the time period to a table that cross references incremental rates of production to time periods, assign a ranking to the well work opportunity based on the comparison, and display the ranking. 1. A non-transitory , computer-readable storage device comprising software that , when executed by a computer , causes the computer to:receive input, from a user input device, information pertaining to a well work opportunity for an existing production rig;perform an analysis of said well work opportunity based on said information to compute an incremental increase in rate of production from said production rig and a time period by which an investment will be paid back;compare said incremental increase in rate of production and said time period to a table that cross references incremental rates of production to rate protection time periods;assign a ranking to said well work opportunity based on said comparison; anddisplay said ranking.2. The non-transitory claim 1 , computer-readable storage device of wherein the software causes the computer to receive input from a user for a priority level for the well work opportunity.3. The non-transitory claim 1 , computer-readable storage device of wherein each well work opportunity includes multiple stages and wherein the software causes the computer to display how long a particular ...

Подробнее
Номер записи: 33
01-08-2013 дата публикации

MULTIPLE-LEVEL TREATMENT FOR OPTIMIZING ONE OR MORE FLUID SEPARATION UNITS

Номер: US20130197962A1
Автор: Guillet Gaetan, Kontopoulos Athanasios J., Roba Thierry
Принадлежит: L'Air Liquide Societe Anonyme pour I'Etude et I'Exploitation des Procedes Georges Claude

The invention relates to the optimized management of one or more fluid production units, especially those involving fluid separation treatment, comprising: a) a data collection step, the data being on one or more values of current parameters defining a current operating point of the production unit, on a future production demand and on at least one optimization criterion; and b) a computation step for computing one or more parameters defining a new operating point of the unit, at least in accordance with this demand. The computation step b) comprises at least: 1) an estimation of at least one optimum solution for defining the new operating point; and 2) a validity test carried out on this optimum solution, at least in accordance with an analysis of the transition of the production unit from the current operating point to the new operating point. 115-. (canceled)16. A method implemented by computing means , for optimizing the management of one or more units producing at least one fluid by co-production of fluids , the method comprising the steps of: one or more current parameter values defining a current operating point of the production unit,', 'a future production demand, and', 'at least one optimization criterion; and, 'a) collecting data, the data comprisingb) computing one or more parameters defining a new operating point of the unit, at least according to said demand, b1) an estimation of at least one optimum solution for the definition of the new operating point, and', 'b2) a test of validity of said optimum solution comprising an analysis of transition of the production unit from the current operating point to the new operating point., 'wherein step b) further comprises17. The method as claimed in claim 16 , wherein the validity test further comprises at least one criterion based on trade rules for operating equipment of the unit.18. The method as claimed in claim 16 , wherein the validity test further comprises at least one criterion based on an analysis of ...

Подробнее
Номер записи: 34
01-08-2013 дата публикации

System And Method For Processing Data In Diverse Storage Systems

Номер: US20130198238A1
Автор: Istiak Ahmed, Mohammed Masudul Haque Mondle
Принадлежит: Bank of America Corp

In an exemplary embodiment, a system includes a memory and a processor communicatively couple to the memory. The processor is operable to receive a first indication that a first database table is selected from a plurality of database tables, wherein each database table is comprised of rows and columns, and retrieve a first plurality of columns, wherein each column is associated with the first database table. The processor is further operable to facilitate the display of the first plurality of columns, receive a second indication that a first column is selected from the first plurality of columns, and receive a third indication that at least one cell in the first column is selected. The processor is further operable to receive an expected data set, store the expected data set in the at least one cell, and compare a sample data set to the expected data set.

Подробнее
Номер записи: 35
22-08-2013 дата публикации

POWER PLAN SUPPORTING APPARATUS AND COMPUTER READABLE STORAGE MEDIUM

Номер: US20130218624A1
Автор: IKEDA Motohide, NAGAO Taka, WATANABE Ken
Принадлежит: ENERES CO.,LTD.

Provided is a power plan supporting apparatus comprising a power difference information acquiring section that acquires power difference amount information indicating a power difference amount between a planned power amount planned in advance by a power consumer for one unit interval within a planned period of a power usage plan and a power usage amount that is actually used during the one unit interval; and a compensation information registering section that, when the power difference amount information indicates that the power usage amount is less than the planned power amount, registers the power difference amount in the compensation information holding section as a compensation power amount that can be used by another power consumer by being added to another planned power amount of the other power consumer planned in advance for another unit interval that is later than the one unit interval. 1. A power plan supporting apparatus comprising:a power difference information acquiring section that acquires power difference amount information indicating a power difference amount between a planned power amount planned in advance by a power consumer for one unit interval within a planned period of a power usage plan and a power usage amount that is actually used during the one unit interval; anda compensation information registering section that, when the power difference amount information indicates that the power usage amount is less than the planned power amount, registers the power difference amount in the compensation information holding section as a compensation power amount that can be used by another power consumer by being added to another planned power amount of the other power consumer planned in advance for another unit interval that is later than the one unit interval.2. The power plan supporting apparatus according to claim 1 , further comprising:a registration selecting section that, when the power difference amount information indicates that the power ...

Подробнее
Номер записи: 36
22-08-2013 дата публикации

Adaptively Optimizing Order Entry System

Номер: US20130218910A1
Автор: DeHaan Jan
Принадлежит:

A system continuously improves the sensitivity, specificity, precision, and accuracy of treatment ordering templates. A repository of information comprises multiple candidate order sets individually including multiple candidate items for order and associated corresponding related order parameters. An individual item for order is associated with multiple related order parameters. A data entry monitor monitors user selection of candidate items from a candidate order set and records candidate item usage data identifying items selected by a user for order from individual particular candidate order sets for multiple different candidate order sets. A data processor determines from the candidate item usage data at least one of, (a) data indicative of the number or proportion of candidate items of a particular candidate order set that were selected by a user during order entry and (b) data indicative of the number or proportion of candidate items of a particular candidate order set that were not selected by a user during order entry. 1. A system for use in adaptively updating template candidate order sets , comprising:a repository of information comprising a plurality of candidate order sets individually including a plurality of candidate items for order and associated corresponding related order parameters, an individual item for order being associated with a plurality of related order parameters;a data entry monitor for monitoring user selection of candidate items from a candidate order set acquired from said repository and recording candidate item usage data identifying items selected by a user for order from individual particular candidate order sets for a plurality of different candidate order sets; anda data processor for determining from the recorded candidate item usage data parameters comprising at least one of, (a) data indicative of the number or proportion of candidate items of a particular candidate order set that were selected by a user during order entry and ...

Подробнее
Номер записи: 37
05-09-2013 дата публикации

COMPARE AND EXCHANGE OPERATION USING SLEEP-WAKEUP MECHANISM

Номер: US20130232499A1
Автор: HAMMARLUND PER, Merten Matthew C., Saha Bratin
Принадлежит:

A method, apparatus, and system are provided for performing compare and exchange operations using a sleep-wakeup mechanism. According to one embodiment, an instruction at a processor is executed to help acquire a lock on behalf of the processor. If the lock is unavailable to be acquired by the processor, the instruction is put to sleep until an event has occurred. 1. A method , comprising:executing an instruction at a processor to help acquire a lock on behalf of the processor; andputting the instruction at the processor to sleep if the lock is unavailable, wherein the instruction sleeps until an event occurs.2. The method of claim 1 , further comprising monitoring a memory address corresponding to the lock claim 1 , wherein the lock is to control processor access to a shared memory space of a memory.3. The method of claim 1 , wherein the instruction comprises a compare and exchange instruction to perform a compare and exchange operation for acquisition of the lock by the processor claim 1 , the compare and exchange operation including an atomic compare and exchange operation.4. The method of claim 1 , further comprising:monitoring a destination having a lock value to determine whether the event has occurred, the monitoring of the destination includes observing one or more of the following: a change in the lock value and an attempt to change the lock value, wherein the destination includes a register or a memory location;detecting the occurrence of the event;waking up the instruction when the event has occurred, wherein the event comprises one or more of the following: the lock becoming available if the lock value has changed, and the lock potentially becoming available if the attempt to change the lock value has occurred; andthe processor acquiring the available lock.5. The method of claim 1 , wherein the putting of the instruction to sleep comprises relinquishing of resources for the processor to use to perform other tasks including one or more of the following: ...

Подробнее
Номер записи: 38
03-10-2013 дата публикации

METHOD AND SYSTEM FOR THE OPERATION OF PLANTS

Номер: US20130262172A1
Автор: Blümler Sven
Принадлежит:

A method for operation of plants includes a) Registering those operating resources which are present in a plurality of plants and have an influence on the functional capability of said plants, b) Specifying in each case first and second availability criteria for these operating resources, c) Registering availability data relating to the operating resources, d) comparing the availability data with the availability criteria, in order to determine operating resources which do not satisfy the availability criteria, e) For those operating resources that do not satisfy the first availability criterion: identifying measures by means of which the functional capability of the plants is extended by increasing the availability of the operating resource or by providing an alternate operating resource, and implementing these measures, f) For those operating resources that do not satisfy the second availability criterion: requesting and registering current availability data and repeating d. 1. A method for the operation of plants , comprising:a) registering operating resources which are present in a plurality of plants and have an influence on the functional capability of said plants;b) specifying in each case first and second availability criteria for the operating resources;c) registering availability data relating to the operating resources;d) comparing the availability data relating to the operating resources with the availability criteria, in order to determine operating resources which do not satisfy the availability criteria;e) for those operating resources that do not satisfy the first availability criterion: identifying measures by means of which the functional capability of the plants is extended by increasing the availability of the operating resource or by providing an alternate operating resource, and implementing these measures; andf) for those operating resources that do not satisfy the second availability criterion: requesting and registering current availability ...

Подробнее
Номер записи: 39
17-10-2013 дата публикации

Real-Time Publishing of Finite Schedules and Real-Time Response to Schedule Changes

Номер: US20130275173A1
Автор: Johnston Lenrick
Принадлежит: BIOPRODUCTION GROUP

A method for real-time publishing of a finite schedule that includes a plurality of activities and a plurality of resources is presented. The method utilizes at least one master schedule derived from an output of the finite schedule and at least one published schedule associated with the at least one master schedule. The at least one master schedule includes at least one master activity instance and the at least one published schedule includes at least one published activity instance. The method creates a schedule mapping table and an activity instance-mapping table. The schedule mapping table stores at least one relationship between the at least one master schedule and the at least one published schedule. Furthermore, the method updates the finite schedule and communicates schedule deviations in real-time with the finite schedule. 1. A method for real-time publishing of a feasible finite schedule comprising a plurality of activities and a plurality of resources , the method comprising the steps of:{'sub': a', 'a', 'a, '(a) deriving at least one master schedule a, a=1 . . . A from an output of a finite schedule, the at least one master schedule comprising at least one master activity instance i, i=1 . . . Iassociated therewith;'}{'sub': b', 'b', 'b, '(b) providing at least one published schedule b, b=1 . . . B associated with the at least one master schedule a, the at least one published schedule b including at least one published activity instance i, i=1 . . . Iassociated therewith;'}(c) creating a schedule mapping table to store at least one relationship between the at least one master schedule a and the at least one published schedule b;{'sub': a', 'b, '(d) creating an activity instance mapping table for the at least one master schedule a, the activity instance mapping table including at least one unique identifier to map the at least one master activity instance iand the at least one published activity instance iin the at least one master schedule a and the at ...

Подробнее
Номер записи: 40
24-10-2013 дата публикации

INFORMATION PROVIDING APPARATUS AND SYSTEM

Номер: US20130282738A1
Автор: KAMEYAMA Shogo
Принадлежит:

An information providing system is disclosed. The system includes a management apparatus having a database storing facility-event information of facilities or events, and a portable apparatus communicatable with the management apparatus. The portable apparatus sets each place, at which a movement stop time exceeds a prescribed staying time, as a stay place. The management apparatus estimates that a living area of a user of the portable apparatus is a collective area covering all of the stay places of the user. The management apparatus sets the collective area as the search scope, extracts the facility-event information matching the search scope from the database, and transmits the extracted facility-event information to the portable apparatus. 1a management apparatus that includes a database, wherein the database stores facility-event informations for a plurality of facilities or a plurality of events by associating the facility-event informations with respective location data of the facilities or the events; andan in-vehicle apparatus that is mounted to a vehicle and communicable with the management apparatus,wherein: acquires present position information indicating present position of the vehicle,', 'transmits vehicle source information, which is based on the present position information, to the management apparatus, and', 'provides a user, who drives the vehicle, with at least one of the facility-event informations transmitted from the management apparatus;, 'the in-vehicle apparatus'} sets, based on the vehicle source information transmitted from the in-vehicle apparatus, a search scope parameterized by the location data,', 'extracts the facility-event informations matching the search scope from the database, and', 'transmits the extracted facility-event informations to the in-vehicle apparatus;, 'the management apparatus'} measures a parking time of the vehicle,', 'sets a stay place of the user based on the present position information and the parking time of ...

Подробнее
Номер записи: 41
07-11-2013 дата публикации

MANUFACTURING OPTIMIZER BASED ON PRODUCTION AND CONSUMPTION TARGETS

Номер: US20130297367A1
Автор: Baramov Lubomir
Принадлежит:

An optimizer is used to help manage a process that has multiple consumption inputs with differing costs, multiple production outputs with differing sale prices and intermediates. The process may have storage capabilities for some consumption inputs, production outputs and intermediates. Further, there may be multiple production and consumption targets for the total amount of consumption inputs/production outputs, consumed/produced over a fixed period of time. The optimizer finds the most economical solution while staying in a region from which the contract target is reachable for any combination of uncertain fixed trajectories from pre-selected intervals. 1. A method of optimizing a manufacturing process having source materials , intermediates , products and media storages , the method comprising:obtaining a model describing relations between source materials, intermediates and product flows;setting upper and lower bounds for each of the source materials, intermediates and product flows, for storage capacities and for combinations of multiple flows;obtaining a set of external flows constrained to specified values including at least one source whose supply has to be fully consumed and at least one product whose demand has to be fully satisfied;determining estimates of future values of these constrained external flows as well as estimates of the upper and lower bound of those flows;determining a set of external flows with requirements on total production or consumption for fixed periods of time, where these requirements are subject to contracts, periodically negotiated with distribution network operators;obtaining varying costs of raw materials and products and their predictions;computing flows of sources, intermediates and products so that all constraints are satisfied and the profit is maximized over a time horizon and, produced/consumed amounts of media under contract since the beginning of contracting period are within a region guaranteeing satisfying the contract ...

Подробнее
Номер записи: 42
28-11-2013 дата публикации

METHOD AND SYSTEM FOR ANALYZING DATA IN ARTIFACTS AND CREATING A MODIFIABLE DATA NETWORK

Номер: US20130318104A1
Автор: Nair Sanal Kumar Sundaresan
Принадлежит: INFOSYS LIMITED

Computer-implemented systems, methods, and computer-readable media for analyzing data in one or more artifacts and creating a modifiable data network includes: extracting the key elements from the one or more artifacts; identifying relationship among the key elements for each of the one or more artifacts; determining a first frequency of each of the key elements; determining a second frequency for each relationship among the key elements; creating a data network showing the key elements and the relationship among the key elements; and enabling a user to modify the data network based on one or more of: the key elements; the relationship among the key elements; the first frequency; and the second frequency. 1. A computer implemented method executed by one or more computing devices for analyzing data in one or more artifacts and creating a modifiable data network , the method comprising:extracting one or more key elements from the one or more artifacts;identifying a relationship among the one or more key elements for each of the one or more artifacts;determining a first frequency of each of the one or more key elements;determining a second frequency for each relationship among the one or more key elements;creating a data network showing the one or more key elements and the relationship among the one or more key elements; and the one or more key elements;', 'the relationship among the one or more key elements;', 'the first frequency; and', 'the second frequency., 'enabling a user to modify the data network based on one or more of2. The method of claim 1 , further comprising enabling the user to modify one or more coordinates of the one or more key elements in the data network.3. The method of claim 1 , further comprising selecting the one or more artifacts from a plurality of artifacts.4. The method of claim 1 , further comprising enabling the user to classify the one or more key elements in one or more classes.5. The method of claim 4 , wherein the modification of the ...

Подробнее
Номер записи: 43
19-12-2013 дата публикации

Windscreen wiper device

Номер: US20130333186A1
Автор: Xavier Boland
Принадлежит: Federal Mogul SA

A windscreen wiper device comprising an elastic, elongated carrier element, as well as an elongated wiper blade of a flexible material, which can be placed in abutment with a windscreen to be wiped, which wiper blade includes opposing longitudinal groove on its longitudinal sides, in which grooves spaced-apart longitudinal strips of the carrier element are disposed, wherein neighbouring ends of said longitudinal strips are interconnected by a respective connection piece, which windscreen wiper device comprises a connecting device for an oscillating arm, wherein said oscillating arm is pivotally connected to said connecting device about a pivot axis near one end, with the interposition of a joint part, wherein said joint part comprises at least one resilient tongue engaging in a correspondingly shaped hole provided in said oscillating arm, and wherein said resilient tongue is rotatable along an hinge axis between an outward position retaining the wiper blade onto the oscillating arm and an inward position releasing the wiper blade form the oscillating arm, characterized in that said resilient tongue is forced in the outward position under the influence of a moment in case a force is exerted on the wiper blade in a direction away from the oscillating arm.

Подробнее
Номер записи: 44
02-01-2014 дата публикации

USING A FORCE-BASED PARADIGM FOR MANAGING OPERATIONAL FULFILLMENT

Номер: US20140006091A1
Автор: Bou-Ghannam Akram, Dockter Michael J.
Принадлежит: INTERNATIONAL BUSINESS MACHINES CORPORATION

Provided are techniques for defining a fulfillment path solution (FPS) comprising items undergoing an operational fulfillment process (OFP); wherein the FPS is associated with milestones to be fulfilled by the items as the items travel the OFP. Each milestone exerts a resistive force on each item. Calculating a plurality of sums, each sum corresponding to a particular item and each sum a total of all resistive forces exerted on the corresponding item by each of the milestones, wherein an item with a deadline closer to the current time is set to a higher resistive force than an item with a deadline farther from the current time; and increasing each resistive force on each item as a corresponding deadline approaches each item; wherein a higher sum indicates a need for more immediate attention. 1. A method , comprising: wherein the FPS is associated with a plurality of milestones to be fulfilled by the plurality of items as the items travel the OFP; and', 'wherein each milestone of the plurality of milestones exerts a resistive force on each item of the plurality of items;, 'defining a fulfillment path solution (FPS) comprising a plurality of items undergoing an operational fulfillment process (OFP);'} setting an initial resistive force, with respect to each item, based upon a difference between a deadline associated with the milestone and the item, wherein an item with a deadline closer to the current time is set to a higher resistive force than an item with a deadline farther from the current time; and', 'increasing each resistive force on each item as a corresponding deadline approaches each item;', 'wherein a higher sum corresponding to a first item and a lower sum corresponding to a second item indicates a need for more immediate attention to the first item than the second item; and, 'calculating a plurality of sums, each sum corresponding to a particular item and each sum a total of all resistive forces exerted on the corresponding item by each of the milestones; ...

Подробнее
Номер записи: 45
09-01-2014 дата публикации

Apparatus for retrieving data from multiple media and method of the same

Номер: US20140008427A1
Автор: Bryan J. Wesolek
Принадлежит: Data Ltd Inc

A method and apparatus for retrieving data and personal identification information from multiple media types in which data is received by an affixed module, is transferred to the operating system, interpreted by a Service Object and delivered to an application as the native form of the medium or to be interpreted by the application as the same or other medium without knowledge of the origin of the data medium.

Подробнее
Номер записи: 46
30-01-2014 дата публикации

SYSTEM AND METHOD FOR SCHEDULE OPTIMIZATION

Номер: US20140032255A1
Автор: HEGAZI Tarek Mohamed Mohamed
Принадлежит:

There is disclosed a system and method for tracking of the progress of scheduled tasks, and for schedule optimization of projects using a heuristic method. In an embodiment, the method comprises: starting the time-cost trade-off (TCT) process by resetting project activities to their cheapest options with the longest project duration; while in any TCT cycle all critical activities are not crashed, selecting and crashing the cheapest critical activities one-by-one to reduce the project's critical path; when in any TCT cycle all critical project activities are crashed, then crashing the cheapest non-critical activities one-by-one; performing a constrained resource scheduling (CRS) analysis at the end of each TCT cycle to meet project resource limits and provide at least one feasible solution for a project duration that does not violate project resource limits; saving the best solution with cheapest total cost from any cycle; and performing a time-cost trade-off (TCT) analysis within each cycle to consider all costs. In another aspect, there is disclosed a system and method for collecting data for schedule optimization, selecting an eligible project activity for which a progress update is required, and obtaining contact information for a user device associated with the project activity; initiating contact with the user device to request a progress update collecting from the user device required progress information for the project activity; and updating progress information for the project activity based on the progress update collected from the user device. 1. A computer implemented method for schedule optimization , comprising:starting a time-cost trade-off (TCT) analysis by resetting project activities to their cheapest options with the longest project duration;in any TCT cycle, while all critical activities are not crashed, selecting and crashing the cheapest critical activities one-by-one to reduce the project's critical path;in any TCT cycle, when all critical ...

Подробнее
Номер записи: 47
30-01-2014 дата публикации

Method and apparatus for creating a record

Номер: US20140033113A1
Автор: Aleksandar Joksimovic, Althea Umali
Принадлежит: Yokogawa Electric Corp

A method and apparatus for creating a record, the method comprising: selecting a point on a screen image, the screen image being displayable on a display device; obtaining input through an interface; creating a record for containing the input; associating the created record with the selected point; activating a predefined event based on the input of the created record; and storing the created record in a memory.

Подробнее
Номер записи: 48
06-02-2014 дата публикации

TRANSPORT SYSTEM AND METHOD

Номер: US20140039953A1
Автор: McQuillan Edward
Принадлежит:

Systems and methods of the invention relate to distributing transports to reduce travel time and/or travel distance for the movement of assets within a distribution center. Embodiments of the present invention include a transport manager that communicates real time transport itineraries that assign transport(s) based on proximity of an employee or equipment and a start location of a transport. Moreover, the transport manager can utilize a geographic location of the equipment and/or the employee to assign transports in order to reduce a distance traveled for a transport or reduce a travel time for a transport. 1. A method , comprising:identifying two or more transports from a work order, wherein the transports comprise respective movements of assets from respective first locations to respective second locations;prioritizing the two or more transports based on a geographic proximity between the movements of the two or more transports; andcommunicating information of the two or more transports as prioritized to equipment to complete the movements.2. The method of claim 1 , further comprising receiving the information of the prioritized two or more transports with at least one device associated with the equipment.3. The method of claim 1 , further comprising generating a transport itinerary that includes the information of the prioritized two or more transports and a set of directions for the movements for the two or more transports.4. The method of claim 1 , further comprising:identifying a location of at least one of the equipment or a worker; andassigning a transfer of the prioritized two or more transports to the equipment or the worker based on the location.5. The method of claim 4 , further comprising calculating a total distance traveled for the two or more transports based on the location of the equipment or the worker.6. The method of claim 5 , further comprising re-assigning a transfer of the prioritized two or more transports to equipment or a worker based on ...

Подробнее
Номер записи: 49
06-02-2014 дата публикации

METHOD AND SYSTEM FOR THE NORMALIZATION, FILTERING AND SECURING OF ASSOCIATED METADATA INFORMATION ON FILE OBJECTS DEPOSITED INTO AN OBJECT STORE

Номер: US20140040286A1
Автор: Bane Adam, Minnear Robert
Принадлежит:

A system and method to prioritize, filter, and normalize metadata from files being transferred from a file system to an object store repository. The metadata is associated with the file (object) when saved to the object store repository. 1. A metadata extraction and normalization system configured to extract and normalize metadata of a plurality of files to be stored on an object store repository copied or moved from a file system , comprising: i. a metadata extractor module, wherein the metadata extractor module is configured to extract metadata from the plurality of files, identify content type of the plurality of files, and create a metadata dictionary for each of the plurality of files, wherein each metadata dictionary contains key pairs comprising a key name and a key value, wherein the key pairs are determined by the content type of the file; and', A. a metadata key mapping module configured to utilize a prioritized list of friendly key names and a configuration file to match the key values of the metadata dictionary to the friendly key names to create a modified metadata dictionary;', 'B. a metadata key filter module configured to utilize the modified metadata dictionary and a configuration filter file to filter the friendly key names and matching key values selected by the user; and', 'C. a metadata size enforcing module to adjust the size of the normalized metadata dictionary to form a final metadata dictionary, wherein the metadata extraction and normalization system is further configured to transfer the final metadata dictionary to the object store repository., 'ii. a metadata normalization module configured to normalize the metadata dictionary, the metadata normalization module comprising], 'a. a metadata extraction and normalization application comprising2. A metadata extraction and normalization system that prioritizes , maps , and filters metadata extracted from a collection of files with a plurality of content types to a normalized set of metatags ...

Подробнее
Номер записи: 50
27-02-2014 дата публикации

ASSORTMENT PLANNING AND OPTIMIZATION

Номер: US20140058781A1
Автор: PADMANABHAN Kishore, Ramanan Sharadha, Rao Shilpa
Принадлежит:

The present subject matter relates to systems and methods for assortment planning and optimization in a retail environment. In one implementation, a method for assortment planning and optimization is described. The method includes receiving assortment parameter data, and input information. The input information includes performance data, product data, fixture data and store data. Further, the method includes ranking product items based at least on the assortment parameter data and the input information. Furthermore, the method includes creating a listing of the product items based at least on the ranking. Such listing of the product items is processed based at least on predefined business rules, to generate one or more assortment solutions for providing optimal gross margins. 1. A computer implemented method for assortment planning and optimization , the method comprising:receiving assortment parameter data, and input information including performance data, product data, fixture data and store data;ranking product items based at least on the assortment parameter data and the input information;creating a listing of the product items based at least on the ranking; andprocessing the listing of the product items based at least on predefined business rules, to generate one or more assortment solutions for providing optimal gross margins.2. The method as claimed in claim 1 , wherein the assortment parameter data comprises details corresponding to at least one of space elasticity claim 1 , cross elasticity claim 1 , customer choice sets and assortment strategy.3. The method as claimed in claim 1 , wherein the performance data is indicative of sales dollars claim 1 , gross margins and sales units of a retail store.4. The method as claimed in claim 1 , wherein the performance data includes regular performance details claim 1 , forecasted performance details claim 1 , and promotional performance details.5. The method as claimed in claim 1 , wherein the ranking is based on ...

Подробнее
Номер записи: 51
06-03-2014 дата публикации

Systems and Methods for Mobile Access to Enterprise Work Area Information

Номер: US20140068445A1
Автор: Dirk Kempf, Norbert Broker, Tobias-Alexander Storz, Uwe Pfisterer, Victor Nakonechny
Принадлежит: SAP SE

Example systems and methods of mobile access to enterprise work area information are presented. In one example, a floor plan of a work area that includes a number of workcenters is displayed. Representations of the workcenters are also displayed with the floor plan according to their physical locations within the work area. Information describing an operational status of at least one of the workcenters is received from an enterprise resource planning system. This information is visibly linked with the representation of its associated workcenter.

Подробнее
Номер записи: 52
03-04-2014 дата публикации

DATA METRIC RESOLUTION RANKING SYSTEM AND METHOD

Номер: US20140095243A1
Автор: Kalush Israel, Solomon Oren Tibi
Принадлежит: Dell Software Inc.

In one embodiment, a method includes identifying a plurality of period combinations for a metric of interest. Each period combination comprises one or more time periods and each of the one or more time periods comprises one or more segments. The method further includes, for each period combination of the plurality of period combinations and each historical value of a plurality of historical values of the metric of interest, incrementally inserting the historical value into corresponding segments of the one or more time periods. Moreover, the method includes ranking the plurality of period combinations based on comparisons of the plurality of historical values to sets of corresponding predicted values. The method also includes selecting a highest-ranked period combination as best characterizing the metric of interest. 1. A method comprising:identifying, by a computer system comprising computer hardware, a plurality of period combinations for a metric of interest;wherein each period combination comprises one or more time periods and each of the one or more time periods comprises one or more segments;for each period combination of the plurality of period combinations and each historical value of a plurality of historical values of the metric of interest, the computer system incrementally inserting the historical value into corresponding segments of the one or more time periods; identifying a corresponding segment for the historical value;', 'computing a predicted value for the corresponding segment;', 'adapting the historical value based on any higher-frequency time periods of the period combination; and', 'inserting the adapted historical value into the corresponding segment;, 'wherein the incrementally inserting comprises, for each time period of the one or more time periodsranking, by the computer system, the plurality of period combinations based on comparisons of the plurality of historical values to sets of corresponding predicted values; andselecting, by the ...

Подробнее
Номер записи: 53
03-04-2014 дата публикации

CALCULATED MEASURES AS ATTRIBUTE FILTERS

Номер: US20140095518A1
Автор: Conradi Christian, SCHNEIDER Thomas
Принадлежит: SAP AG

Systems and methods for using calculated measures as attribute filters are provided. In example embodiments, a query for a result set is processed. The query includes a filter attribute that is absent from a base table from which the result set is to be obtained. A set of measures associated with the filter attribute that is absent from the base table is calculated. The base table is extended to include the calculated set of measures associated with the filter attribute that is absent from the base table to create an extended table. The extended table is filtered based on the filter attribute to create a filtered extended table. The result set is derived using the filtered extended table. 1. A method comprising:triggering processing of a query for a result set, the query including a filter attribute that is absent from a base table from which the result set is to be obtained;calculating, using a processor of a machine, a set of measures associated with the filter attribute that is absent from the base table;extending the base table to include the calculated set of measures associated with the filter attribute that is absent from the base table to create an extended table;filtering the extended table based on the filter attribute to create a filtered extended table; andderiving the result set using the filtered extended table.2. The method of claim 1 , further comprising calculating a second set of measures based on the query claim 1 , wherein the extending of the base table further includes using the second set of measures along with the calculated set of measures to create the extended table.3. The method of claim 2 , wherein the deriving of the result set comprises selecting a portion of the second set of measures that remains in the filtered extended table to create the result set.4. The method of claim 1 , wherein the calculating claim 1 , extending claim 1 , filtering claim 1 , and deriving are performed within memory of a filtering system.5. The method of ...

Подробнее
Номер записи: 54
10-04-2014 дата публикации

ELECTRONIC DEVICE AND MULTIMEDIA FILE SORTING METHOD

Номер: US20140101174A1
Автор: SHIH I-Fen, TSAI Jen-Yu
Принадлежит: HTC CORPORATION

A multimedia file sorting method for use in an electronic device is provided. The method has the following steps of: retrieving time information and location information of multimedia files stored in the electronic device; filtering the multimedia files according to the retrieved time information and the retrieved location information; and sorting the multimedia files into multiple groups according to similarities within both the retrieved time information and the retrieved location information. 1. A multimedia file sorting method for use in an electronic device , comprising:retrieving time information and location information of multimedia files stored in the electronic device;filtering the multimedia files according to the retrieved time information and the retrieved location information; andsorting the multimedia files into multiple groups according to similarities within both the retrieved time information and the retrieved location information.2. The multimedia file sorting method as claimed in claim 1 , further comprising:creating the multimedia files by the electronic device;retrieving local time and a corresponding location of the electronic device; andembedding the local time and the corresponding location of the electronic device to the multimedia files upon creating the multimedia files.3. The multimedia file sorting method as claimed in claim 1 , further comprising:determining the similarities within the retrieved time information according to a predetermined time period; anddetermining the similarities within the retrieved location information according to a reference region.4. The multimedia file sorting method as claimed in claim 3 , further comprising:determining a reference multimedia file from the multimedia files;retrieving reference time information and a reference location of the reference multimedia file;determining the reference region according to the reference location of the reference multimedia file;determining whether the time information ...

Подробнее
Номер записи: 55
06-01-2022 дата публикации

Systems and methods for creating a rich social media profile

Номер: US20220004936A1
Автор: Tyler A. Ziemann
Принадлежит: Salesforce com Inc

Disclosed are systems, apparatus, methods and computer-readable media for updating information stored in a database system over a network. In some implementations, first contact data is retrieved from a first virtual portion of a database system, where the first contact data provides first contact information associated with at least one entity. In some instances, the first contact data is compared with second contact data, where the second contact data provides second contact information associated with the at least one entity. In some instances, at least some of the second contact information is retrieved from a social networking system. In various implementations, at least one difference between the first contact data and the second contact data is identified, where the at least one difference is capable of being presented in a user interface displayed at a computer system. In some instances, a selection identifying contact data to store is received.

Подробнее
Номер записи: 56
06-01-2022 дата публикации

DISTRIBUTED ORCHESTRATION FOR SATELLITE GROUPS AND OTHER GROUPS

Номер: US20220004950A1
Автор: Cribbs, III H. Brown
Принадлежит:

A method includes receiving, at a specified device among a plurality of devices, a first request to perform a first task. The method also includes transmitting multiple bid requests associated with the first task to multiple other devices among the plurality of devices. The method further includes receiving, at the specified device, at least one bid response from at least one of the other devices. In addition, the method includes assigning performance of the first task to one or more of the plurality of devices based on the at least one bid response. Each bid response may include a quality and a timeliness associated with the one of the devices' ability to perform the first task. Multiple bid responses may be received, and the method may further include ranking the bid responses based on at least one quality or timeliness factor identified by a party providing the first request. 1. A method comprising:receiving, at a specified device among a plurality of devices, a first request to perform a first task;transmitting multiple bid requests associated with the first task to multiple other devices among the plurality of devices;receiving, at the specified device, at least one bid response from at least one of the other devices; andassigning performance of the first task to one or more of the plurality of devices based on the at least one bid response.2. The method of claim 1 , wherein each bid response comprises a quality and a timeliness associated with the one of the devices' ability to perform the first task.3. The method of claim 2 , wherein:receiving the at least one bid response comprises receiving multiple bid responses; and ranking the bid responses based on at least one quality or timeliness factor identified by a party providing the first request; and', 'selecting a winning bid response based on the ranking., 'the method further comprises4. The method of claim 1 , further comprising:receiving, at the specified device from an auctioneer device among the ...

Подробнее
Номер записи: 57
05-01-2017 дата публикации

MAINTENANCE WORK SUPPORT SYSTEM

Номер: US20170004429A1
Автор: Maenishi Yasuhiro
Принадлежит:

In a maintenance work support system for supporting maintenance works in a component mounting system, a storage stores: priority table information defining a maintenance priority for classifying a priority level at which execution of the maintenance work is necessary, based on an association of the recommended maintenance deadline with a use time or a use count of each of the maintenance targets; and execution history information indicating history of the maintenance work executed on each of the maintenance targets. A maintenance work plan creation unit creates a work plan of the maintenance work, based on the maintenance priority calculated by a priority calculator, changed with date and time, based on the execution history information and the priority table information. 1. A maintenance work support system for supporting maintenance works executed on maintenance targets in a component mounting system including at least one component mounting device , the maintenance work support system comprising:a storage storing maintenance relevant information regarding one or more maintenance works executed on each of the maintenance targets, the maintenance relevant information including a recommended maintenance deadline indicating a deadline by which execution of the maintenance work based on a use limit time or use limit count of each of the maintenance targets is necessary, priority table information defining a maintenance priority for classifying a priority level at which execution of the maintenance work is necessary, based on an association of the recommended maintenance deadline with a use time or a use count of each of the maintenance targets, and execution history information indicating history of the maintenance work executed on each of the maintenance targets;a priority calculator calculating the maintenance priority changed with date and time for each of the maintenance works, based on the execution history information and the priority table information included ...

Подробнее
Номер записи: 58
04-01-2018 дата публикации

RULE-BASED SYSTEM AND METHOD TO ASSOCIATE ATTRIBUTES TO TEXT STRINGS

Номер: US20180004484A1
Автор: KJALLBRING Henrik M., Yehaskel David M.
Принадлежит:

A method implemented in a data processing system includes receiving a plurality of text strings. A plurality of rules are applied to the text strings. If a condition specified in one of the rules exists in a given text string, one or more attributes are associated to that text string as metadata. One or more of the text strings are selected, using the metadata, as a potential title for the content. A final title is prepared based on the potential title, and the content is published online under the final title. 1. A method , comprising:receiving, in a computing apparatus, a plurality of text strings, each of the text strings identifying a separate search query; determining whether the respective text string satisfies a condition of the respective rule, and', 'in response to a determination that the respective text string satisfies the condition of the respective rule, associating a set of metadata of the respective rule with a search query identified by the respective text string;, 'applying, by the computing apparatus, each respective rule of a plurality of rules to each respective text string of the plurality of text strings, including'}sorting, by the computing apparatus, the plurality of text strings based at least in part on metadata associated with the search queries via the applying of the plurality of rules;identifying, by the computing apparatus, a potential title based on the sorting of the plurality of text strings;providing, by the computing apparatus, the potential title to generate content; andpublishing, by the computing apparatus, the content created based on the potential title.2. The method of claim 1 , further comprising:identifying a final title for the content, wherein the content is published under the final title.3. The method of claim 2 , wherein the content is generated in accordance with the potential title and predefined guidelines.4. The method of claim 3 , further comprising:arranging, by the computing apparatus, creation of the content ...

Подробнее
Номер записи: 59
04-01-2018 дата публикации

OPERATION OF A MULTI-SLICE PROCESSOR IMPLEMENTING PRIORITIZED DEPENDENCY CHAIN RESOLUTION

Номер: US20180004527A1
Автор: ADEEB KHANDKER N., BOWMAN JOSHUA W., GODDARD BRANDON R., Nguyen Dung Q., Nguyen Tu-An T., TOLENTINO EULA A., VICTOR BRIAN D., WONG BRENDAN M.
Принадлежит:

Operation of a computer processor that includes: receiving a first instruction indicating a first target register; receiving, from an instruction fetch unit of the computer processor, a first instruction and a branch instruction; responsive to determining that the branch instruction is dependent upon a result of the first instruction, updating a priority value corresponding to the first instruction; and issuing, in dependence upon the priority value for the first instruction having a higher priority than a priority value for another instruction, the first instruction to an execution unit of the computer processor. 1. A method of operation of a computer processor , wherein the method comprises:receiving, from an instruction fetch unit of the computer processor, a first instruction and a branch instruction;responsive to determining that the branch instruction is dependent upon a result of the first instruction, updating a priority value corresponding to the first instruction; andissuing, in dependence upon the priority value for the first instruction having a higher priority than a priority value for another instruction, the first instruction to an execution unit of the computer processor.2. The method of claim 1 , wherein issuing the first instruction is further dependent upon the first instruction being a ready instruction among a plurality of ready instructions.3. The method of claim 2 , wherein the first instruction is a compare instruction claim 2 , and wherein execution of the compare instruction sets a condition code flag within a condition code register claim 2 , and wherein the branch instruction determines whether to branch in dependence upon a value of the condition code flag of the condition code register.4. The method of claim 3 , wherein determining that the branch instruction is dependent upon the result of the first instruction comprises decoding the branch instruction to determine that the branch instruction depends upon the condition code flag of the ...

Подробнее
Номер записи: 60
07-01-2021 дата публикации

DISPLAYING EVENT RECORDS WITH EMPHASIZED FIELDS

Номер: US20210004205A1
Автор: Carasso R. David, Delfino Micah James, HWANG Johnvey
Принадлежит:

Embodiments are directed towards real time display of event records with an indication of previously provided extraction rules. A plurality of extraction rules may be provided to the system, such as automatically generated and/or user created extraction rules. These extraction rules may include regular expressions. A plurality of event records may be displayed to the user, such that text in a field defined by an extraction rule is emphasized in the display of the event record. The same emphasis may be provided for text in overlapping fields, or the emphasis may be somewhat different for different fields. The user interface may enable a user to select a portion of text of an event record, such as by rolling-over or clicking on an emphasized part of the event record. By selecting the portion of the event record, the interface may display each extraction rule associated with the selected portion. 1. A method , comprising:causing display of a set of event records;determining a plurality of extraction rules associated with a first event record of the set of event records;identifying, within the first event record, a first field value of a first field defined by a first extraction rule and a second field value of a second field defined by the second extraction rule; andcausing the first field value to be visually emphasized within the first event record in a first manner and the second field value to be visually emphasized within the first event record in a second manner different from the first manner.2. The method as recited in claim 1 , wherein the first event record comprises at least a portion of one or more lines of data within machine data.3. The method as recited in claim 1 , wherein the first extraction rule comprises a regular expression.4. The method as recited in claim 1 , wherein the plurality of extraction rules are user selected via a graphical user interface.5. The method as recited in claim 1 , wherein at least one of the first manner or the second manner ...

Подробнее
Номер записи: 61
02-01-2020 дата публикации

Analog Sorter

Номер: US20200004501A1
Автор: Cottrill William C., Meredith Sheldon K.
Принадлежит:

A list of digital elements to be sorted are converted to a group of analog signals. The group of analog signals are simultaneously compared to each other to determine the largest analog signal in the group. The largest analog signal is then compared to each of the analog signals in the group to determine which one or more of the analog signals in the group matches the largest analog signal. The matching one or more of the analog signals is removed from the group and the process is repeated until the group of analog signals have been sorted. 1. A sorting apparatus comprising:a sequential loader to load elements of a list to be sorted into a respective plurality of list element blocks; a digital storage to store a digital element value of a list element that has been loaded;', 'a digital to analog converter to convert the digital element value into an analog signal;', 'an analog comparator to compare the analog signal to a peak analog signal and supply a match signal indicative thereof, wherein the analog comparator asserts the match signal when the analog signal matches the peak analog signal; and, 'each of the list element blocks including,'}a peak detect and hold circuit coupled to receive analog signals from the list element blocks, determine the peak analog signal therefrom, and to supply the peak analog signal to the analog comparators of the list element blocks.2. The sorting apparatus as recited in claim 1 , wherein the analog signals are voltages.3. The sorting apparatus as recited in claim 1 , wherein each of the list element blocks claim 1 , responsive to the match signal being asserted claim 1 , set the analog signal supplied from the digital to analog converter to a negative voltage value.4. The sorting apparatus as recited in claim 3 , wherein the analog signal is set to a negative voltage value by writing the digital storage.5. The sorting apparatus as recited in claim 1 , further comprising:an output sorting stage coupled to the list element blocks; ...

Подробнее
Номер записи: 62
02-01-2020 дата публикации

SHARED COMPARE LANES FOR DEPENDENCY WAKE UP IN A PAIR-BASED ISSUE QUEUE

Номер: US20200004546A1
Автор: GENDEN MICHAEL J., Le Hung Q., Nguyen Dung Q., THOMTO BRIAN W.
Принадлежит:

An apparatus for shared compare lanes for dependency wakeup in a double issue queue includes a source dependency module that determines a number of source dependencies for two instructions to be paired in a row of a double issue queue of a processor. A source dependency includes an unavailable status of a dependent source for data required by the two instructions where the data is produced by another instruction. The apparatus includes a pairing determination module that writes each of the two instructions into a separate row of the double issue queue in response to the source dependency module determining that the number of source dependencies is greater than a source dependency maximum and pairs the two instructions in one row of the double issue queue in response to the source dependency module determining that the number of source dependencies is less than or equal to the source dependency maximum. 1. An apparatus comprising:a source dependency module that determines a number of source dependencies for two instructions intended to be paired in a row of a double issue queue of a processor, a source dependency comprising an unavailable status of a dependent source for data required by the two instructions where the data is produced by another instruction; anda pairing determination module that writes each of the two instructions into a separate row of the double issue queue in response to the source dependency module determining that the number of source dependencies is greater than a source dependency maximum and that pairs the two instructions in one row of the double issue queue in response to the source dependency module determining that the number of source dependencies is less than or equal to the source dependency maximum.2. The apparatus of claim 1 , wherein the source dependency maximum is equal to a number of dependency trackers available to the double issue queue claim 1 , the dependency trackers each tracking a source dependency of paired instructions ...

Подробнее
Номер записи: 63
13-01-2022 дата публикации

WORK SUPPORT SYSTEM, INFORMATION PROCESSOR, AND WORK SUPPORT METHOD

Номер: US20220011736A1
Автор: ISHIMURA Akihiro
Принадлежит: Omron Corporation

Upon receipt of a signal indicating occurrence of anomalies, an information processor displays the nature of the anomalies. The information processor accepts for each anomaly, an input operation for assignment of a worker who is to handle an anomaly. Based on the assignment, the information processor notifies a terminal device of the worker of the nature of the anomaly to be handled by the worker. The terminal device displays contents of a remedy for the anomaly. The terminal device transmits progress information to the information processor. The information processor displays the progress information. The information processor further accepts an input operation for updating the assignment of a worker who is to handle the anomaly. Based on the assignment updated, the information processor notifies the terminal device of the worker of the nature of the anomaly to be handled by the worker. 1. A work support system comprising:a controller system of a production facility;an information processor communicable with the controller system; anda plurality of first terminal devices, each of which is communicable with the information processor, whereinupon receipt of a signal indicating occurrence of a plurality of anomalies in the controller system from the controller system, the information processor displays nature of the plurality of anomalies,after displaying the nature of the plurality of anomalies, the information processor accepts, for each anomaly, an input operation for assignment of a worker who is to handle the anomaly among a plurality of workers,upon acceptance of the input operation, the information processor notifies, based on the assignment, a first terminal device used by the worker of nature of the anomaly to be handled by the worker;upon acceptance of the nature of the anomaly from the information processor, each first terminal device displays contents of a remedy for the anomaly,upon acceptance of an input operation for inputting progress information ...

Подробнее
Номер записи: 64
04-01-2018 дата публикации

INCREMENTAL BLOOM FILTER REBUILD FOR B+ TREES UNDER MULTI-VERSION CONCURRENCY CONTROL

Номер: US20180004786A1
Автор: Danilov Mikhail, Fedorov Alexander, Gutsalov Nikita, Malygin Mikhail, Tchoub Ivan
Принадлежит:

A method comprising: processing an update to a search tree and updating statistics, the search tree storing information about one or more objects indexed by corresponding object keys; determining to rebuild a first Bloom filter based on the statistics, the first Bloom filter associated with the search tree; generating a second Bloom filter associated with the search tree; populating the second Bloom filter as part of a tracing garbage collection process; and replacing the first Bloom filter with the second Bloom filter. 1. A method comprising:processing an update to a search tree and updating statistics, the search tree storing information about one or more objects indexed by corresponding object keys;determining to rebuild a first Bloom filter based on the statistics, the first Bloom filter associated with the search tree;generating a second Bloom filter associated with the search tree;populating the second Bloom filter as part of a tracing garbage collection process; andreplacing the first Bloom filter with the second Bloom filter.2. The method of wherein processing the update to the search tree and updating statistics comprises:if the update includes adding an object to the search tree, adding information about the object to the search tree indexed by a corresponding object key, adding the object key to the first Bloom filter, incrementing a tree object count, and incrementing a filter object count; andif the update includes deleting an object to the search tree, deleting information about the object from the search tree and decrementing the tree object count.3. The method of further comprising:determining a target object count for the search tree,wherein determining to rebuild the first Bloom filter based on the statistics comprises determining to rebuild the first Bloom filter based on comparing the target object count and the tree object count.4. The method of further comprising generating the first Bloom filter having a capacity determined using the target ...

Подробнее
Номер записи: 65
03-01-2019 дата публикации

KEY-VALUE COMPACTION

Номер: US20190004768A1
Автор: KHAN Jawad B., Li Peng, TRIKA Sanjeev
Принадлежит: Intel Corporation

One embodiment provides a storage device. The storage device includes a storage I/O (input/output) logic and a storage device controller. The storage I/O logic is to couple the storage device to a host device, the storage I/O logic to receive a sort-merge command the host device. The a storage device controller is to identify a level N SSTable (sorted string table) file, a corresponding level N index file, a first level N+1 SSTable file and a corresponding first level N+1 index file, in response to the sort-merge command to be received from the host device. The storage device controller is further to perform a sort-merge of the level N SSTable file and the first level N+1 SSTable file to produce a first level N+1 output SSTable file and a first level N+1 output SSTable index file. The level N SSTable file includes at least one level N key-value (KV) pair. The level N+1 SSTable file includes at least one level N+1 key-value (KV) pair. The sort-merge command includes a level N SSTable file index, a value corresponding to a number of SSTable files included in level N+1 and a level N+1 start SSTable file index. The identifying is based, at least in part, on the level N SSTable file index and the level N+1 start SSTable file index. 1. A storage device comprising:a storage I/O (input/output) logic to couple the storage device to a host device, the storage I/O logic to receive a sort-merge command the host device; anda storage device controller to identify a level N SSTable (sorted string table) file, a corresponding level N index file, a first level N+1 SSTable file and a corresponding first level N+1 index file, in response to the sort-merge command to be received from the host device; and to perform a sort-merge of the level N SSTable file and the first level N+1 SSTable file to produce a first level N+1 output SSTable file and a first level N+1 output SSTable index file,the level N SSTable file comprising at least one level N key-value (KV) pair, the level N+1 SSTable ...

Подробнее
Номер записи: 66
02-01-2020 дата публикации

BLOCKCHAIN TRACKING OF ORGANIZATIONAL TIME FOR COST ANALYSIS AND SCHEDULING

Номер: US20200005207A1
Автор: Bhattacharya Pamela, Cheung Ben, Fufa Chala Fekadu, III Warren David, Johnson, Lee Charles Yin-Che, Loureiro De Carvalho Neto Mayerber, Pena Ocampo Juliana
Принадлежит:

In non-limiting examples of the present disclosure, systems, methods and devices for indicating time-cost allocation for an organization for a specified time period are presented. A virtual time coin system may be utilized to track temporal transactions made by organizational entities (e.g., organizational groups, organizational employees). A time coin application may track temporal transactions (e.g., meeting invites, meeting cancelations, meeting expansions) made by organizational entities, and those transactions may be stored on blocks of a temporal blockchain that is duplicated across a plurality of nodes in a distributed ledger. Each temporal transaction may be associated with a withdrawal or deposit of time coins from a time coin repository corresponding to the organizational entity or entities that were party to a transaction. The time coin application may analyze bocks in temporal blockchains and cause the results of that analysis to be graphically displayed. 1. A system for indicating time-cost allocation for an organization for a specified time period , comprising:a memory for storing executable program code; and receiving a request to display a graphical representation of a ratio of time coins to be withdrawn from a time repository for the organization for each of a plurality of tasks during the specified time period compared with a number of total time coins remaining in the time repository for the organization during the specified time period;', 'analyzing a plurality of blocks in a blockchain ledger, wherein each of the plurality of blocks indicates one of: at least one time coin that is to be withdrawn from the time repository for the organization and applied to one of the plurality of tasks; and at least one time coin that is to be deposited back into the time repository for the organization; and', 'displaying, based on the analysis, the graphical representation., 'one or more processors, functionally coupled to the memory, the one or more processors ...

Подробнее
Номер записи: 67
27-01-2022 дата публикации

METHOD AND SYSTEM FOR AUTOMATIC RECOMMENDATION OF WORK ITEMS ALLOCATION IN AN ORGANIZATION

Номер: US20220027833A1
Автор: MIARA Oren, Wolfman Gadi, YAFFE Arnon
Принадлежит: DEEPCODING LTD.

A system and a method of automatically allocating by an autonomous orchestration of work items to organizational resource are provided herein. The method may include the following steps: obtaining a stream of work items allocation requests from a delivery management system; analyzing the stream of work items allocation requests, to extract work items specification from the requests; applying an optimization of the human resources vis a vis the work items specifications; and providing recommendation for allocation of said work items to the delivery management system. 1. A method of automatically optimizing work item allocation to organizational resources using a computerized delivery management system (DMS) , the method comprising:obtaining a stream of work items allocation requests from the DMS;analyzing the stream of work items allocation requests, to extract work items specification from the requests;applying an optimization of the organizational resources in view of the work items specifications; andproviding recommendation for allocation or performing automatic allocation of said work items at the DMS.2. The method according to claim 1 , wherein said organizational resources comprise at least one of: a human claim 1 , a team of humans claim 1 , one or more robots claim 1 , and a hybrid team comprising at least one human and at least one robot.3. The method according to claim 1 , wherein said stream of work items allocation requests further comprises at least one of: ticketing system documents claim 1 , emails claim 1 , messages claim 1 , sent between the organizational resources.4. The method according to claim 1 , wherein extracting the work item specification is carried out by applying natural language processing and/or rules.5. The method according to claim 1 , wherein the applying of said optimization factors in at least one of: capacity claim 1 , scoring claim 1 , workload claim 1 , and availability of said organizational resources.6. The method according ...

Подробнее
Номер записи: 68
08-01-2015 дата публикации

METHOD AND APPARATUS FOR PERFORMING SEARCH FUNCTION IN PORTABLE TERMINAL

Номер: US20150012520A1
Автор: AN Jinwan, KIM Jeongseob, OH Jiwoong
Принадлежит:

A method and an apparatus for performing a search function by selecting a specific text displayed on a screen are provided. The method includes selecting a text displayed on a screen, extracting search keywords from the selected text and displaying the extracted search keywords, recognizing selection of at least one of the displayed search keywords, and performing a search using the at least one selected search keyword. Accordingly, a user can easily and conveniently search for desired information without directly inputting a search keyword in the search window. 1. A method of performing a search function in a portable terminal , the method comprising:selecting a text displayed on a screen;extracting search keywords from the selected text;displaying the extracted search keywords;recognizing selection of at least one of the displayed search keywords; andperforming a search using the at least one selected search keyword.2. The method of claim 1 , wherein the selecting of the text comprises performing a preset touch gesture at a point at which the text is located to select the text.3. The method of claim 1 , wherein the extracting of the search keywords comprises:displaying a popup window overlaid on the screen is if the text is selected; anddisplaying the extracted search keywords in the popup window.4. The method of claim 1 , wherein the extracting of the search keywords comprises:when the number of the search keywords extracted from the selected text is greater than or equal to a reference value, selecting search keywords that are to be displayed, the number of which corresponds to the reference value, from the extracted search keywords according to a priority; anddisplaying the selected search keywords.5. The method of claim 4 , wherein the priority comprises at least one of a search frequency in a search engine claim 4 , an extraction order of the search keywords claim 4 , user preferences claim 4 , database storing common keywords claim 4 , and a display ...

Подробнее
Номер записи: 69
11-01-2018 дата публикации

FLASH OPTIMIZED COLUMNAR DATA LAYOUT AND DATA ACCESS ALGORITHMS FOR BIG DATA QUERY ENGINES

Номер: US20180011690A1
Автор: Kaushik Rini
Принадлежит:

A technique relates to flash-optimized data layout of a dataset for queries. Selection columns are stored in flash memory according to a selection optimized layout, where the selection optimized layout is configured to optimize predicate matching and data skipping. The selection optimized layout, for each selection column, is formed by storing a selection column dictionary filled with unique data values in a given selection column, where the unique data values are stored in sorted order in the selection column dictionary. Row position designations are stored corresponding to each row position that the unique data values are present within the given selection column, without duplicating storage of any of the unique data values that occur more than once in the given selection column. 1. A method for flash-optimized data layout of a dataset for queries , the method comprising:storing, by a processor, selection columns in flash memory according to a selection optimized layout, the selection optimized layout being configured to optimize predicate matching and data skipping; storing a selection column dictionary filled with unique data values in a given selection column, the unique data values stored in sorted order in the selection column dictionary; and', 'storing row position designations corresponding to each row position that the unique data values are present within the given selection column, without duplicating storage of any of the unique data values that occur more than once in the given selection column., 'wherein the selection optimized layout, for each selection column, is formed by2. The method of claim 1 , wherein the dataset comprises a table having a plurality of columns claim 1 , the method further comprising:storing projection columns in the flash memory according to a projection optimized layout, the projection optimized layout being configured to optimize random accesses to the projection columns; storing a projection column dictionary filled with ...

Подробнее
Номер записи: 70
11-01-2018 дата публикации

METHOD OF COLLABORATIVE SOFTWARE DEVELOPMENT

Номер: US20180012181A1
Автор: Blincoe Kelly Coyle, Valetto Giuseppe
Принадлежит:

A method of collaboratively developing software includes recording a plurality of developers' tasks relating to a collection of software development files via software executing on a computer. The method further includes calculating a proximity score between a plurality of tasks based on the overlap of the developers' activities via software executing on a computer. The method further includes selecting and capturing a group of task properties that along with the proximity score can be used to select a group of task pairings that require coordination. The method further includes notifying the developers assigned to the task pairings selected that they may need to coordinate their development efforts. 1. A method of collaboratively developing software , comprising:(a) recording a plurality of developers' activities relating to a collection of software development files as the activities occur via software executing on a computer, wherein the activities comprise viewing and editing files;(b) calculating a proximity score between a plurality of tasks based on the overlap of the developers' activities via software executing on a computer, whereinthe proximity score between two tasks is calculated based on an actual proximity score with the following weights:a high amount of weight if a common file was edited by developers conducting both tasks;a low amount of weight if a common file was viewed by developers conducting both tasks; anda middle amount of weight if a common file was viewed by a developer conducting one task and edited by a developer conducting the other task;(c) selecting a group of task pairings that exceed a threshold proximity score; and(d) notifying the developers assigned to the task pairings selected in step (c) that they need to coordinate their development efforts on the task pairings.2. The method of claim 1 , further comprising:(e) collecting information about code file software architecture, operating system, hardware, software design ...

Подробнее
Номер записи: 71
14-01-2021 дата публикации

System and Method for Storing Data Records

Номер: US20210011685A1
Автор: Yue Jonathan Zhanjun
Принадлежит:

The present disclosure discloses systems and methods for storing data records of a table or any data collection in a database system. The records are stored in a plurality of data files on a computer server. The system considers both the sequential I/O and random I/O options in the processing writing data records to a disk, and finds the best approach to writing data to the disk. Under certain conditions, the method analyzes and recognizes that sequential I/O may perform better. Under another condition, the method analyzes and recognize random I/O may perform better. Under other conditions, the method analyzes and recognizes a combination of sequential I/O and random I/O may perform better. The method chooses the option that has the minimum-cost for storing data records in a disk file. In doing so, the method considers and applies system constraints, such as memory resource and I/O latency. 1. A computer-implemented method , comprising:receiving, from a client device, a plurality of data records into an input buffer, wherein the input buffer comprises a block of main memory, and wherein the input buffer acts as a queue to temporarily hold the plurality of data records;providing a complex file comprising a plurality of simple files, wherein data records can be inserted anywhere in the complex file, and wherein each simple file contains independently sorted data records, and wherein the plurality of simple files are sorted in total order in the complex file;merging the input buffer with the complex file, where in the merging further comprises sequentially reading a temporary block of data records into main memory from the plurality of simple files, and are compared to the records in the input buffer, and if a simple file within the plurality of simple files has a remaining size that is less than the size of the temporary block of data records then records in a subsequent simple file are read and fill the temporary block of data records.2. The computer-implemented ...

Подробнее
Номер записи: 72
14-01-2021 дата публикации

PROCESSING CIRCUIT, INFORMATION PROCESSING APPARATUS, AND INFORMATION PROCESSING METHOD

Номер: US20210011716A1
Автор: Shimizu Takashi, Yokoyama Ken
Принадлежит: FUJITSU LIMITED

Information processing circuit includes an accelerator function unit (AFU), an FPGA interface unit (FIU), a tag check unit, and an output control unit. The AFU sequentially obtains write control instructions for a plurality of kinds of data including an output waiting instruction that stops output of a subsequent instruction. The FIU sequentially outputs the write control instructions via a first path or a second path. The tag check unit receives responses to the write control instructions output from the FIU. The output control unit selects one of the first path and the second path based on the storage address of the write control instruction, determines the necessity for mixing write control instructions, mixes write control instructions and causes the FIU to output the result. 1. An information processing circuit comprising:a first path being an output path for an instruction and a second path having a lower transfer rate than that of the first path;an instruction obtaining circuit that sequentially obtains write control instructions including an output waiting instruction that stops output of a subsequent instruction;an output circuit that sequentially outputs the write control instructions via the first path or the second path;a response receiving circuit that receives responses to the write control instructions output from the output circuit; andan output control circuit that selects one of the first path and the second path based on a storage addresses of the write control instructions, determines whether to merge the write control instructions, merges the write control instructions based on the determination and causes the output circuit to output the result.2. The information processing circuit according to claim 1 ,wherein the output control circuit selects the first path when there is no write control instruction that is output from the output circuit and when a response thereto is not received by the response receiving circuit.3. The information ...

Подробнее
Номер записи: 73
14-01-2021 дата публикации

STM32 LOWPOWER SMART CACHE PREFETCH

Номер: US20210011727A1
Автор: Briat Gerald, Giovannini Michael
Принадлежит:

In an embodiment a method for operating an integrated circuit includes sequentially requesting, by a processor of an integrated circuit, different instruction lines; determining, by a first comparator of the integrated circuit, while the processor processes a current instruction line supplied in response to a corresponding request, whether or not at least one of the instructions of the current instruction line is a branch instruction by comparing the at least one of the instructions to reference instructions; executing, by the processor, all instructions of the current instruction line before executing a next instruction line when the at least one instruction is a branch instruction from a program memory of the integrated circuit; and executing, by the processor, all instruction of the current instruction line before executing a next instruction line from first and second volatile memory of the integrated circuit when the at least one instruction is not a branch instruction. 1. An integrated circuit comprising:a processor;a program memory configured to store instruction lines of a program to be executed by the processor, each instruction line including at least one instruction;an instruction memory configured to store reference instructions being interpretable by the processor as branch instructions; anda first comparator;wherein the processor is configured to sequentially request different instruction lines,wherein the first comparator is configured to determine, using the reference instructions, whether or not at least one of the instructions of a current line supplied in response to a corresponding request is a branch instruction, andwherein the processor is further configured to execute the instructions of the current line before sending a request for the next line when at least one instruction is a branch instruction.2. The integrated circuit according to claim 1 , further comprising:a first volatile memory configured to store an address of a next instruction ...

Подробнее
Номер записи: 74
11-01-2018 дата публикации

Bus Stop Systems and Methods of Scheduling

Номер: US20180012312A1
Автор: Joiner Mac, Koski Christine L., Turley William N.
Принадлежит:

Methods of providing services to individual and methods of manufacturing items are described. Data structures to represent priority values for those individuals or items are also described. By ascribing priority values to a set of items, those items can be grouped based on those priority values. Once grouped based on priority values, the items within each group can be manufactured according to group priority as well as according to the characteristics of each item to be manufactured within that group. The same concept applies to providing services to individuals. 1. A data structure to improve manufacturing coordination comprising:a set of digital representations of items to be manufactured, wherein each digital representation comprises a priority value;wherein the priority value comprises a plurality of bits, the plurality of bits broken into at least a first bit group and a second bit group; andwherein the first bit group represents a first business rule and the second bit group represents a second business rule.2. The data structure of claim 1 , wherein each digital representation of an item to be manufactured further comprises at least (1) a first task having a first task value and (2) a second task having a second task value.3. The data structure of claim 1 , wherein the first and second business rules each comprise at least one of an activity indicator claim 1 , an anchoring indicator claim 1 , a due date claim 1 , a duration claim 1 , a job priority claim 1 , an organization priority claim 1 , an item number priority.4. The data structure of claim 1 , wherein the plurality of bits includes at least one of 32 bits claim 1 , 64 bits claim 1 , and 128 bits. This application is a divisional application of U.S. patent application Ser. No. 15/417,922, titled “BUS STOP SYSTEMS AND METHODS OF SCHEDULING”, filed Jan. 27, 2017, which is a continuation of U.S. patent application Ser. No. 13/889,786, titled “BUS STOP SYSTEMS AND METHODS OF SCHEDULING”, filed May 8, 2013. ...

Подробнее
Номер записи: 75
10-01-2019 дата публикации

DIRECTED GRAPH COMPRESSION

Номер: US20190012404A1
Автор: Li Guohua, Liang Qi, Rao Weixiong, Tian Tian, YE Qi
Принадлежит:

In one embodiment of the present disclosure, an original graph including nodes is obtained. The nodes of the original graph are reordered to generate a reordered graph. Non-zero elements in an adjacency matrix for the reordered graph are clustered as compared with an adjacency matrix for the original graph. The adjacency matrix for the reordered graph is encoded with integers. The integers correspond to non-empty blocks in the adjacency matrix for the reordered graph. 17-. (canceled)8. A system for processing a graph , comprising:one or more processors;a memory coupled to at least one of the processors; obtaining an original graph including a plurality of nodes;', 'reordering the plurality of nodes of the original graph to generate a reordered graph, wherein a plurality of non-zero elements in an adjacency matrix for the reordered graph are clustered as compared with an adjacency matrix for the original graph; and', 'encoding the adjacency matrix for the reordered graph with a plurality of integers, wherein each integer of the plurality of integers corresponds to a non-empty block in the adjacency matrix for the reordered graph., 'a set of computer program instructions stored in the memory and executed by at least one of the processors in order to perform actions of9. The system according to claim 8 , wherein the original graph is a directed graph claim 8 , and each element of a plurality of elements in the adjacency matrix for the original graph indicates whether or not a directed edge exists from a first node to a second node of the plurality of nodes.10. The system according to claim 8 , wherein the encoding comprises:dividing the adjacency matrix for the reordered graph into a plurality of blocks, wherein each block includes at least one element of a plurality of elements in the adjacency matrix for the reordered graph; andrepresenting each non-empty block of the plurality of blocks as at least one integer of the plurality of integers, wherein elements in each ...

Подробнее
Номер записи: 76
10-01-2019 дата публикации

DIRECTED GRAPH COMPRESSION

Номер: US20190012406A1
Автор: Li Guohua, Liang Qi, Rao Weixiong, Tian Tian, YE Qi
Принадлежит:

In one embodiment of the present disclosure, an original graph including nodes is obtained. The nodes of the original graph are reordered to generate a reordered graph. Non-zero elements in an adjacency matrix for the reordered graph are clustered as compared with an adjacency matrix for the original graph. The adjacency matrix for the reordered graph is encoded with integers. The integers correspond to non-empty blocks in the adjacency matrix for the reordered graph. 1. A method for processing a graph , comprising:obtaining, by one or more processing units, an original graph including a plurality of nodes;reordering, by one or more processing units, the plurality of nodes of the original graph to generate a reordered graph, wherein a plurality of non-zero elements in an adjacency matrix for the reordered graph are clustered as compared with an adjacency matrix for the original graph; andencoding, by one or more processing units, the adjacency matrix for the reordered graph with a plurality of integers, wherein each integer of the plurality of integers corresponds to a non-empty block in the adjacency matrix for the reordered graph.2. The method according to claim 1 , wherein the original graph is a directed graph claim 1 , and each element of a plurality of elements in the adjacency matrix for the original graph indicates whether or not a directed edge exists from a first node to a second node of the plurality of nodes.3. The method according to claim 1 , wherein the encoding comprises:dividing, by one or more processing units, the adjacency matrix for the reordered graph into a plurality of blocks, wherein each block includes at least one element of a plurality of elements in the adjacency matrix for the reordered graph; andrepresenting, by one or more processing units, each non-empty block of the plurality of blocks as at least one integer of the plurality of integers, wherein elements in each non-empty block are treated as a binary form of the at least one ...

Подробнее
Номер записи: 77
10-01-2019 дата публикации

DIRECTED GRAPH COMPRESSION

Номер: US20190012407A1
Автор: Li Guohua, Liang Qi, Rao Weixiong, Tian Tian, YE Qi
Принадлежит:

In one embodiment of the present disclosure, an original graph including nodes is obtained. The nodes of the original graph are reordered to generate a reordered graph. Non-zero elements in an adjacency matrix for the reordered graph are clustered as compared with an adjacency matrix for the original graph. The adjacency matrix for the reordered graph is encoded with integers. The integers correspond to non-empty blocks in the adjacency matrix for the reordered graph. 1obtaining, by one or more processing units, an original graph including a plurality of nodes, wherein the original graph is a directed graph, and each element of a plurality of elements in an adjacency matrix indicates whether or not a directed edge exists from a first node to a second node of the plurality of nodes, and wherein a node identification is assigned to each node of the plurality of nodes; obtaining, by one or more processing units, node degrees for each node of the plurality of nodes in the original graph, wherein the node degrees include an in-degree and an out-degree, wherein the in-degree indicates a degree to which a node is pointed to by the plurality of nodes and the out-degree indicates a degree to which the node points to the plurality of nodes;', sorting, by one or more processing units, the plurality of nodes in the original graph in descending order according to the node degrees; and', 'determining, by one or more processing units, k number of nodes as the set of candidate nodes, wherein k is an integer less than or equal to a total number of nodes in the original graph; and, 'determining, by one or more processing units, a set of candidate nodes from the plurality of nodes in the original graph based on the node degrees, wherein the determining the set of candidate nodes comprises, 'determining, by one or more processing units, an order of the set of candidate nodes and corresponding neighbor nodes based on common neighbor information, wherein the common neighbor information ...

Подробнее
Номер записи: 78
14-01-2021 дата публикации

PLATFORM INTERPRETATION OF USER INPUT CONVERTED INTO STANDARDIZED INPUT

Номер: US20210011972A1
Автор: Corfield Richard, FRY Stephen
Принадлежит:

Disclosed herein is a platform for translating various user input into a standardized input used to cause a database to sort data in a specified manner and present the data in a graphic user interface according to user instruction. User input is a text string that includes a first set of characters and a second set of characters split by a dividing symbol. Based on the choice of dividing symbol and the arrangement of the first set of character and second set of characters the system converts the input into a standardized form. 1. A method interpreting an input string , comprising:displaying, on a graphic user interface, a data set, the data set including a plurality of items that each include a numerically sortable attribute;receiving via a user input a string including a first set of characters and a second set of characters positioned on either side of a dividing symbol;converting the first set of characters into a first standardized input that establishes a set of the plurality of items of the data set to sort into a number of groups based on the numerically sortable attribute of the data set;converting the second set of characters into a second standardized input that establishes how to delineate the set of the plurality of items of the data set into the number of groups based on the numerically sortable attribute of the data set; anddisplaying, on the graphic user interface, the number of groups, each group populated by a subset of the set of the plurality of items of the data set as delineated by the second standardized input.2. The method of claim 1 , wherein the first set of characters is positioned to the left of the dividing symbol claim 1 , and the second set of characters is positioned to the right of the dividing symbol.3. The method of claim 1 , wherein the first set of characters is a single number and said converting the first set of characters comprises:establishing all of the data set as the set of the plurality of items of the data set; ...

Подробнее
Номер записи: 79
14-01-2021 дата публикации

Hierarchical Recursive Workflow Management Platform

Номер: US20210012252A1
Автор: Baba Solomon, Palandro Michael, Wiggerman Christian
Принадлежит:

A hierarchical recursive workflow management platform is a downloadable application presented through a browser or application user interface and stored for use on a personal electronic device. The hierarchical recursive workflow management platform may have a mobile application; and, can have an integrated architecture in which the internal components of the personal electronic device may be able to access a secondary application, local or remotely located on a server containing stored data for implementation. A common user interface screen, providing the user an interface, may access all the functionalities and activities offered by the platform through either the computer, mobile application or the secondary application by accessing the internal components of the personal electronic device to exchange such information, pertinent to the hierarchical recursive workflow management platform. Providing a hierarchical recursive workflow management platform; which manages, tracks, executes and adjust as required; a workflow plan, both horizontally and vertically hierarchical with the capability to apply a recursive dynamic through the conversion of tasks/deliverables (cards) respectively to boards; and furthermore, to re-convert a board comprised of cards back to its original card it was converted from; or, implement a pause status to the card activities associated with a board; as well as, delete a board, comprised of cards. The unique functionalities presented herewith, more closely aligns with efficient workflow management by providing real time visibility and hierarchical permissions to better understand; overall status, progress, needed adjustments and areas of activity where corrective solutions may be required to a workflow activity at all levels. 1. A hierarchical recursive workflow platform , which comprises a system to identify and implement a workflow plan and to manage , track , execute and adjust as required , information through the offered functionalities ...

Подробнее
Номер записи: 80
18-01-2018 дата публикации

Finding k extreme values in constant processing time

Номер: US20180018566A1
Автор: Avidan Akerib, Eli Ehrman, Moshe LAZER
Принадлежит: GSI Technology Inc

A method includes determining a set of k extreme values of a dataset of elements in a constant time irrespective of the size of the dataset. A method creates a set of k indicators, each indicator associated with one multi-bit binary number in a large dataset of multi-bit binary numbers. The method includes arranging the multi-bit binary numbers such that each bit n of each said multi-bit binary number is located in a different row n of an associative memory array, starting from a row storing a most significant bit (MSB), adding an indicator to the set for each multi-bit binary number having a bit with an extreme value in the row and continuing the adding until said set contains k indicators.

Подробнее
Номер записи: 81
17-01-2019 дата публикации

Cognitive thread management in a multi-threading application server environment

Номер: US20190018687A1
Автор: Matthias Falkenberg, Thomas Steinheber
Принадлежит: International Business Machines Corp

Cognitive management of application request processing in a multi-threading application server environment is provided by, in part, obtaining multiple threads based on receiving multiple application execution requests, and determining whether to consolidate processing of at least two threads of the multiple threads based on one or more specified characteristics related to processing of the at least two threads. Based on determining to consolidate processing, the cognitive management approach includes pausing the at least two threads and generating a consolidated thread to determine a common result for the at least two paused threads. Thereafter, execution of the at least two threads is resumed using the common result provided by processing of the consolidated thread. In one embodiment, the at least two threads may be at least two request-level threads, while in another the threads may be at least two method-level threads.

Подробнее
Номер записи: 82
17-01-2019 дата публикации

SMART MEETING SCHEDULER

Номер: US20190019126A1
Автор: Anderson Evelyn R., Bender Michael, Childress Rhonda L., Jan Ea-Ee
Принадлежит:

Embodiments of the present invention provide methods, computer program products, and systems for scheduling a meeting. Embodiments of the present invention can be used to calculate a level of criticality and flexibility for each unavailable member of a set of members of a meeting that can be used to prioritize unavailable members of the meeting. Embodiments of the present invention can be used to identify candidate meeting times based, at least in part, on the level of criticality and flexibility for each unavailable member. 1. A computer-implemented method comprising:receiving a set of meeting parameters for a meeting that include a set of members of the meeting, a subject of the meeting, and content for discussion in the meeting;calculating a level of criticality and a level of flexibility for each unavailable member of the set of members of the meeting;combining the level of criticality and the level of flexibility for each unavailable member and mapping the combined level of criticality and the level of flexibility to respective time slots in a set of time slots specified by the meeting parameters; andidentifying candidate meeting times based, at least in part, on the combined level of criticality and flexibility for each unavailable member.2. The computer-implemented method of claim 1 , further comprising:receiving an indication to generate a list of recommended participants that are not specified as recipients of an electronic message;responsive to receiving an indication to generate a list of recommended participants that are not specified as recipients of an electronic message, calculating a level of criticality for a set of participants that are not specified as recipients of the electronic message; andpopulating a list of participants for the electronic message based on the calculated level of criticality.3. The computer-implemented method of claim 1 , wherein calculating a level of criticality for each unavailable member of the meeting comprises:acquiring ...

Подробнее
Номер записи: 83
17-01-2019 дата публикации

SMART MEETING SCHEDULER

Номер: US20190019127A1
Автор: Anderson Evelyn R., Bender Michael, Childress Rhonda L., Jan Ea-Ee
Принадлежит:

Embodiments of the present invention provide methods, computer program products, and systems for scheduling a meeting. Embodiments of the present invention can be used to calculate a level of criticality and flexibility for each unavailable member of a set of members of a meeting that can be used to prioritize unavailable members of the meeting. Embodiments of the present invention can be used to identify candidate meeting times based, at least in part, on the level of criticality and flexibility for each unavailable member. 1receiving a set of meeting parameters for a meeting that include a set of members of the meeting, a subject of the meeting, and content for discussion in the meeting;calculating a level of criticality and a level of flexibility for each unavailable member of the set of members of the meeting, wherein: acquiring a set of meeting history and a set of electronic message history associated with the set of members of the meeting,', 'calculating a set of similarity scores utilizing the set of meeting parameters and the acquired set of meeting history and the acquired set of electronic message history by determining a similarity index utilizing a weighted cosine distance calculation for each of the set of meeting parameters,', 'calculating a set of similarity indices by combining the set of similarity scores, and', 'calculating a criticality score by summing the set of calculated similarity indices for the set of unavailable members of the meeting, and wherein, 'calculating a level of criticality for each unavailable member of the meeting comprises acquiring a criticality score of a conflicting meeting associated with an unavailable member of the set of members of the meeting, and', 'dividing a predetermined constant, by the acquired criticality score of the conflicting meeting;, 'calculating a level of flexibility for each unavailable member of the set of members of the meeting comprises mapping the level of criticality and the level of flexibility ...

Подробнее
Номер записи: 84
16-01-2020 дата публикации

BITONIC SORTING ACCELERATOR

Номер: US20200019374A1
Автор: GUPTA Pankaj, Prathapan Indu, SABBARWAL Puneet
Принадлежит:

An accelerator for bitonic sorting includes a plurality of compare-exchange circuits and a first-in, first-out (FIFO) buffer associated with each of the compare-exchange circuits. An output of each FIFO buffer is a FIFO value. The compare-exchange circuits are configured to, in a first mode, store a previous value from a previous compare-exchange circuit or a memory to its associated FIFO buffer and pass a FIFO value from its associated FIFO buffer to a subsequent compare-exchange circuit or the memory; in a second mode, compare the previous value to the FIFO value, store the greater value to its associated FIFO buffer, and pass the lesser value to the subsequent compare-exchange circuit or the memory; and in a third mode, compare the previous value to the FIFO value, store the lesser value to its associated FIFO buffer, and pass the greater value to the subsequent compare-exchange circuit or the memory. 1. A hardware accelerator for bitonic sorting , the hardware accelerator comprising:a plurality of compare-exchange circuits; anda first-in, first-out (FIFO) buffer associated with each of the compare-exchange circuits, wherein an output of each FIFO buffer is a FIFO data value; in a first mode of operation, store a previous data value from a previous compare-exchange circuit or a memory to its associated FIFO buffer and pass a FIFO data value from its associated FIFO buffer to a subsequent compare-exchange circuit or the memory;', 'in a second mode of operation, compare the previous data value to the FIFO data value, store the greater of the data values to its associated FIFO buffer, and pass the lesser of the data values to the subsequent compare-exchange circuit or the memory; and', 'in a third mode of operation, compare the previous data value to the FIFO data value, store the lesser of the data values to its associated FIFO buffer, and pass the greater of the data values to the subsequent compare-exchange circuit or the memory., 'wherein the compare-exchange ...

Подробнее
Номер записи: 85
16-01-2020 дата публикации

INFORMATION PROCESSING APPARATUS, RIDING VEHICLE ADJUSTING METHOD, AND RIDING VEHICLE ADJUSTING PROGRAM

Номер: US20200019906A1
Автор: Asano Hiroki, JINNAI Kuniaki, Kobayashi Atsuko, SAITO Harunobu, SUGIMURA Tae, SUGIYAMA Koseki, TSUGE Yoshihiro
Принадлежит: TOYOTA JIDOSHA KABUSHIKI KAISHA

An information processing apparatus according to the present disclosure includes a controller configured to execute: determining whether to change a scheduled riding vehicle for a first user or not based on predetermined position information related to a first user's riding a first vehicle, before a scheduled time on which the first user is to board the first vehicle which the first user is scheduled to board at a first boarding place; extracting one or more candidate vehicles serving as alternative candidates for the first vehicle, when it is determined to change the scheduled riding vehicle for the first user; and changing the scheduled riding vehicle for the first user from the first vehicle to a second vehicle that is one of the one or more candidate vehicles, based on an approval by the first user. 1. An information processing apparatus comprising a controller configured to execute:determining whether to change a scheduled riding vehicle for a first user or not based on predetermined position information related to a first user's riding a first vehicle, before a scheduled time on which the first user is to board the first vehicle which the first user is scheduled to board at a first boarding place;extracting one or more candidate vehicles serving as alternative candidates for the first vehicle, when it is determined to change the scheduled riding vehicle for the first user; andchanging the scheduled riding vehicle for the first user from the first vehicle to a second vehicle that is one of the one or more candidate vehicles, based on an approval by the first user.2. The information processing apparatus according to claim 1 ,wherein when it is determined that at least one of the first user and the first vehicle is to reach the first boarding place with a deviation of a predetermined time period or longer from the scheduled time based on at least one of position information on the first user and position information on the first vehicle that serve as the ...

Подробнее
Номер записи: 86
21-01-2021 дата публикации

VEHICLE HOURS OF SERVICE ACCOMMODATION FOR AVAILABILITY AND FULFILLMENT PLANNING

Номер: US20210019852A1
Автор: Mezaael Abraham
Принадлежит:

A cloud-based system may communicate with a plurality of vehicles to receive operating information from the vehicles. The system may also, based on the vehicle operating information, determine if a first vehicle has hours of service (HOS) remaining, within time period over which HOS are legally mandated, sufficient to complete a requested transportation task. The system further adds the first vehicle to an available vehicle list responsive to determining that sufficient HOS for the first vehicle remain. Then the system presents the vehicle list to a requesting, customer and assigns a customer-selected vehicle to completion of the transportation task. 1. A system comprising:a memory; and communicate with a plurality of vehicles to receive operating information from the vehicles for storage in the memory;', 'based on the operating information stored to the memory, determine if a first vehicle has hours of service (HOS) remaining, within a time period over which HOS are legally mandated, sufficient to complete a requested transportation task;', 'add the first vehicle to an available vehicle list responsive to determining that sufficient HOS for the first vehicle remain;', 'present the vehicle list to a requesting customer; and', 'assign a customer-selected vehicle to completion of the transportation task., 'a processor configured to'}2. The system of claim 1 , wherein the operating information includes a present task in which the vehicle is engaged claim 1 , defined by at least a destination.3. The system of claim 1 , wherein the operating information includes a vehicle-determined calculation of present HOS within a present time period over which HOS are legally limited.4. The system of claim 1 , wherein the processor is further configured to:receive updated HOS remaining for the assigned vehicle within the time period while the assigned vehicle is completing the task;determine that insufficient HOS remain to complete the task within the time period based on the ...

Подробнее
Номер записи: 87
17-04-2014 дата публикации

SECURE PRIVATE DATABASE QUERYING SYSTEM WITH CONTENT HIDING BLOOM FITERS

Номер: US20140108435A1
Автор: Kolesnikov Vladimir Y.
Принадлежит:

Secure private database querying on a database for a query having a formula evaluation on at least two keywords A and B comprises: a server receiving a Bloom filter tree comprised of encrypted Bloom filters of encrypted keywords from the database, wherein each Bloom filter in the Bloom filter tree is separately masked by a random mask pad P; receiving an encrypted version of the keywords A and B from the client; and obtaining masked Bloom filter indices for the keywords A and B. The client and server participate in secure function evaluation (SFE) with the client. The server has an input comprising the masked Bloom filter indices for the keywords A and B and the client has an input comprising the random mask pad P. The secure function evaluation comprises: removing the random mask pad P from the masked Bloom filter indices input by the server; determining if there is a matching Bloom filter for each of the keywords A and B; and applying the formula evaluation to determine if the formula is satisfied. 1. A method performed by a server for secure private database querying by a client on a database for a query having a formula evaluation on at least two keywords A and B , comprising:receiving a Bloom filter tree comprised of encrypted Bloom filters of encrypted keywords from the database, wherein each Bloom filter in the Bloom filter tree is separately masked by a random mask pad P;receiving an encrypted version of the keywords A and B from the client;obtaining masked Bloom filter indices for the keywords A and B;participating in secure function evaluation (SFE) with the client, wherein the server has an input comprising the masked Bloom filter indices for the keywords A and B and wherein the client has an input comprising the random mask pad P and wherein the secure function evaluation comprises the following steps:removing the random mask pad P from the masked Bloom filter indices input by the server;determining if there is a matching Bloom filter for each of the ...

Подробнее
Номер записи: 88
22-01-2015 дата публикации

FINDING A BEST MATCHING STRING AMONG A SET OF STRINGS

Номер: US20150026194A1
Автор: Dziedzicki Tomasz, Kiszkis Marek J., Koksinski Grzegorz, Zarzycki Krzysztof
Принадлежит:

A method for finding a best matching string among a set of strings for a reference string includes representing, for each of the set of strings paired with the reference string, a dynamic programming problem for calculating a final alignment score as a matrix of cells, and calculating a current optimal alignment boundary threshold. The method also includes executing, for each string of the set of strings, a calculation of a prospective final alignment score of a candidate alignment of the each of the set of strings and the reference string for each cell. Based on determining, that prospective final alignment score improves the current optimal alignment boundary threshold, the method includes calculating a final alignment score for the string of the set of strings associated with the cell. Otherwise, the method includes aborting the calculation of a candidate alignment covering the string associated with the cell. 115.-. (canceled)16. A computer-implemented method for finding a best matching string among a set of strings for a reference string , the method comprising:representing, for each of the set of strings paired with the reference string, a dynamic programming problem for calculating a final alignment score as a matrix of cells, each cell representing an intermediate result to be calculated;calculating a current optimal alignment boundary threshold, calculating a prospective final alignment score of a candidate alignment of the each of the set of strings and the reference string for each cell;', 'based on determining, that prospective final alignment score improves the current optimal alignment boundary threshold, calculating a final alignment score for the string of the set of strings associated with the cell; and', 'based on determining, that prospective final alignment score does not improve the current optimal alignment boundary threshold, aborting the calculation of a candidate alignment covering the string of the set of strings associated with the cell., ...

Подробнее
Номер записи: 89
29-01-2015 дата публикации

Windscreen wiper device

Номер: US20150026911A1
Автор: Xavier Boland
Принадлежит: Federal Mogul SA

A windscreen wiper device comprising an elastic, elongated carrier element, as well as an elongated wiper blade of a flexible material, which can be placed in abutment with a windscreen to be wiped, which wiper blade includes opposing longitudinal groove on its longitudinal sides, in which grooves spaced-apart longitudinal strips of the carrier element are disposed, wherein neighboring ends of said longitudinal strips are interconnected by a respective connection piece, which windscreen wiper device comprises a connecting device for an oscillating arm, wherein said oscillating arm is pivotally connected to said connecting device about a pivot axis near one end, with the interposition of a joint part, wherein said joint part comprises at least one resilient tongue engaging in a correspondingly shaped hole provided in said oscillating arm, and wherein said resilient tongue is rotatable along an hinge axis between an outward position retaining the wiper blade onto the oscillating arm and an inward position releasing the wiper blade form the oscillating arm, characterized in that said resilient tongue is forced in the outward position under the influence of a moment in case a force is exerted on the wiper blade in a direction away from the oscillating arm.

Подробнее
Номер записи: 90
28-01-2021 дата публикации

SYSTEM AND METHOD FOR DETECTING AND FIXING ROBOTIC PROCESS AUTOMATION FAILURES

Номер: US20210023709A1
Автор: EPSTEIN Lior, GEFFEN David, TESLER Gal
Принадлежит:

A system and method for detecting and fixing robotic process automation failures, including collecting tasks from at least one client computerized device, processing the tasks via robotic process automation, collecting tasks that failed to complete per task type, recording successful execution steps per each of the failed tasks, evaluating the recorded successful execution steps with respect to the failed task types, and providing selected execution steps that best fix the failed tasks, thereby fixing the robotic process automation failures. 1. A system for detecting and fixing robotic process automation failures , said system comprising:a task queue database configured to collect and store tasks from at least one client computerized device;a robotic process automation unit configured to pull tasks from the task queue database for replacing a human representative by processing said tasks;a failed tasks queue database configured to collect and store tasks and data on tasks that the robotic process automation unit failed to accomplish; anda failure evaluation processor configured to collect said failed tasks per task type and to receive recordings of successful execution steps per each of the failed tasks; anda real-time database configured to store data on successfully completed tasks by the robotic process automation unit,wherein the failure evaluation processor is further configured to evaluate the recorded successful execution steps with respect to the failed task types, in order to provide selected execution steps that best fix the tasks that the robotic process automation unit failed to accomplish, thereby fixing the robotic process automation failures.2. The system according to claim 1 , wherein the failure evaluation processor is configured to compare execution steps of the same task types.3. The system according to claim 2 , wherein the failure evaluation processor is further configured to aggregate the execution steps of the same task types in order to ...

Подробнее
Номер записи: 91
25-01-2018 дата публикации

Computer-Implemented Engineering Review of Energy Consumption By Equipment

Номер: US20180025302A1
Автор: Brasz Lars Johan, Fontaine Eric James, Kezar Kristi Jo
Принадлежит: Leidos, Inc.

A computer-implemented system and method are disclosed for performing engineering review of energy consumption by one or more equipment. One or more computers are connected to a specifications database. The computers are configured to receive end-user configurations corresponding to first equipment; retrieve one or more second equipment, as well as second equipment specifications from the specifications database; calculate an invoicing statement for the second equipment; and provide an engineering review report of the energy savings realized by implementing the second equipment. The first equipment may be an existing equipment, while the second equipment is one or more energy-efficient replacement alternatives to the first equipment. Each step is performed in real-time, using automated software modules and sub-modules. The engineering review report is applicable as an instant approval or pre-approval, qualifying the end-user for purchase incentives, which apply when the energy-efficient equipment alternatives are adopted by the end-user. 1. A computer-implemented method for generating an engineering review report , including one or more purchase incentives , to facilitate replacement of one or more pieces of energy-use equipment located in a building envelope , the computer-implemented method comprising:receiving, at a computer, end-user configurations corresponding to one or more first energy-use equipment, identification of building envelope configuration information, a zip-code of a geographic location of the one or more first equipment and a selection of one or more enrollment programs, wherein the one or more first equipment is directly or indirectly configured to consume energy from one or more energy sources, and each enrollment program corresponds to one or more methodologies for calculating energy savings obtained when the one or more first energy-use equipment is replaced by one or more second energy-use equipment;determining, by a tracking module on the ...

Подробнее
Номер записи: 92
10-02-2022 дата публикации

Recommender System For Replacing Human Interaction Services

Номер: US20220044171A1
Автор: Chakraborty Ishita Sunity Kumar, Sinha Atanu R.
Принадлежит: Adobe Inc.

A human interaction replacement evaluation system analyzes actions taken by a user with an application on a client device that provides features to replace human interaction services with computer-based services. The results of the action provide an indication of the success of a particular action supported by the application (e.g., whether the action has a positive or negative effect on a key performance indicator) or an indication of how likely the user is to be ready to adopt a particular computer-based service. Recommendations are then provided to the user of the application or a manager of the application indicating actions to use, actions that have negative or positive effects on a key performance indicator, and so forth. 1. In a digital medium environment to cause an item recommendation to be delivered to a client device , a method implemented by at least one computing device , the method comprising:receiving, by an application usage data organization module of the at least one computing device, application usage data describing actions taken by a user with an application;analyzing, by a technology adoption readiness index generation module of the at least one computing device, the application usage data to identify a technology adoption readiness index indicating how likely the user is to be ready to adopt using the application to perform an additional action; andcausing, by a recommendation system of the at least one computing device in response to the technology adoption readiness index indicating the user is ready to adopt using the application to perform the additional action, a recommendation for using the application to perform the additional action to be delivered to the user.2. The method as recited in claim 1 , the analyzing including generating multiple action transition probabilities for the user claim 1 , each action transition probability indicating a probability of the user transitioning from performing one action using the application to ...

Подробнее
Номер записи: 93
10-02-2022 дата публикации

METHOD, SYSTEM AND TERMINAL DEVICE FOR OPERATION MANAGEMENT OF AIRCREW

Номер: US20220044172A1
Автор: Gong Qiang, LIU Chunping, RUAN Zhiyong, XIANG Dubing, XU Ziheng, ZHANG Zheming
Принадлежит: Hangzhou Pi-solution Information Technology Co.,Ltd

A method for operation management of aircrew includes: determining multiple initial duties composed of a number of flights according to an obtained flight schedule, determining multiple initial pairings each including a start half pairing and an end half pairing according to the initial duties, selecting multiple candidate pairings from the multiple initial pairings with the objective of minimum total flight operating cost, and determining a roster schedule of the aircrew with a series of pairings according to the candidate pairings and obtained information of the aircrew. A process of generating the pairings includes: first, building two half pairings, namely a start half pairing and an end half pairing, and then combining the half pairings with tasks of an other base to flexibly connect the pairings of the other base through half pairing bridging. 1. A method for an operation management of aircrew , comprising:determining a plurality of initial duties comprising a number of flights according to an obtained flight schedule, wherein the obtained flight schedule comprises a flight number, a flight departure airport, a flight arrival airport, a flight departure time, and a flight end time;determining a plurality of initial pairings according to the plurality of initial duties, wherein each of the plurality of initial pairings comprises a start half pairing and an end half pairing; the start half pairing and the end half pairing are duties with different departure airports and different arrival airports; a departure base of the start half pairing is the same as an end base of the end half pairing, and the aircrew belong to the departure base of the start half pairing;determining a plurality of candidate pairings from the plurality of initial pairings by taking a minimum total flight operating cost as an objective function; anddetermining a schedule of the aircrew in the plurality of candidate pairings according to the plurality of candidate pairings and information of ...

Подробнее
Номер записи: 94
10-02-2022 дата публикации

IMAGE PROCESSING METHODS

Номер: US20220044370A1
Автор: Sun Bin, Xiong Youjun, Zhao Mingguo
Принадлежит:

Image processing methods are provided. One of the method includes: obtaining a to-be-processed multi-channel feature maps; obtaining multi-channel first output feature maps and multi-channel second output feature maps by processing the multi-channel feature maps through a parallel pointwise convolution and non-pointwise operation, where the non-pointwise convolution is for descripting a spatial feature of each channel and an information exchange between the feature maps; and fusing the multi-channel first output feature maps and the multi-channel second output feature maps to obtain a multi-channel third output feature map. 1. An image processing method , comprising steps of:obtaining to-be-processed multi-channel feature maps, wherein each of the multi-channel feature maps corresponding to a channel;obtaining multi-channel first output feature maps by processing the multi-channel feature maps through a pointwise convolution and multi-channel second output feature maps by processing the multi-channel feature maps through a non-pointwise convolution, wherein the pointwise convolution and the non-pointwise convolution are performed in parallel, and the non-pointwise convolution is for descripting a spatial feature of each channel and an information exchange between the feature maps; andfusing the multi-channel first output feature maps and the multi-channel second output feature maps to obtain multi-channel third output feature maps;wherein, the non-pointwise convolution is an adaptive linear operation, and in response to a first ratio of a channel amount corresponding to the channel feature maps to perform the non-pointwise convolution and a channel amount corresponding to the multi-channel second output feature maps being a positive integer, the multi-channel second output feature maps is obtained by:evenly dividing the channel feature maps into a plurality of feature map groups by channel according to the first ratio, wherein an amount of the feature maps in each ...

Подробнее
Номер записи: 95
23-01-2020 дата публикации

ACCELERATING CONCURRENT ACCESS TO A FILE IN A MEMORY-BASED FILE SYSTEM

Номер: US20200026448A1
Автор: Golander Amit, HARROSH BOAZ, Manole Sagi
Принадлежит:

A method, apparatus and product for accelerating concurrent access to a file in a memory-based file system. The method comprising receiving a request issued by a program, for accessing a file stored in a memory-based file system; and subject to the request being associated with data modification of data within the file, and subject to the modification not necessitating change in a structure of a data structure used for content lookup for the file, acquiring a lock to the file to the program, wherein the lock is acquired in a shared mode. 1. A method , comprising:representing a file, of a memory-based file system and mapped to an address range of memory, using a data structure comprising a data unit accessible by a data lock and a metadata unit with a first portion accessible by a metadata lock and a second portion updateable by an atomic operation without a lock; andutilizing the data lock and the metadata lock in a shared mode based upon an estimate, using a request type of a request, that a data modification of the request changes a structure of the data structure and the data modification is delayed.2. The method of claim 1 , wherein the data lock and the metadata lock are acquired for requests modifying the first portion of the metadata and the structure of the data structure.3. The method of claim 1 , comprising:utilizing the data structure for file content lookup operations.4. The method of claim 1 , wherein the data structure has a hierarchical structure.5. The method of claim 1 , comprising:executing the data modification as a batch operation.6. The method of claim 1 , wherein the data structure comprises a log tree comprising at least one tree element.7. The method of claim 6 , wherein the request comprises a write request executable without shifting a tree element of the log tree.8. The method of claim 1 , wherein the request is associated with a page fault generated by a machine-level store instruction to the memory-based file system that supports direct ...

Подробнее
Номер записи: 96
28-01-2021 дата публикации

UNIVERSAL AUTOMATIC DATA UPDATE DETECTION AND PUBLICATION

Номер: US20210026866A1
Автор: Bahry Brent, Hastie Matthew Duncan, Laethem Jared, Lee Jennifer
Принадлежит:

Universal automatic data update detection and publication may include receiving a request for requested information, which includes an information element associated with a structured data location in a structured data storage unit, identifying a predicate referencing the structured data location, including the predicate in a predicates registry by compiling the predicate into an intermediate representation, creating an asynchronous message bus channel corresponding to the predicate, detecting a data operation for the structured data storage unit, wherein the information element is associated with the data operation, evaluating the intermediate representation, determining a predicate domain change type corresponding to the data operation, generating a change notification including an indication of the change type, and publishing the change notification to the asynchronous message bus channel such that a presentation via the client device is updated in response to the change notification. 1. A system , comprising:a processor; and receiving, from a display device, a request for data to be displayed by the display device;', 'transmitting, to the display device, the requested data, wherein the display device is configured to display the requested data;', storing a predicate associated with the requested data in a predicates registry;', 'creating an asynchronous message bus channel corresponding to the predicate and subscribing the display device to the asynchronous message bus channel after storing the predicate in the predicates registry;', 'detecting a data operation configured to modify the requested data;', 'determining a type of modification to the requested data based on whether a value of the predicate matches the data operation before modification of the requested data by the data operation and the value of the predicate does not match the data operation after modification of the requested data by the data operation; and', 'publishing a notification to the ...

Подробнее
Номер записи: 97
28-01-2021 дата публикации

Enterprise manufacturing inventory management system and method

Номер: US20210027226A1
Автор: Mohun Stephen Carroll
Принадлежит:

A system for enterprise performance management includes an enterprise performance management server, including a processor, a non-transitory memory, an input/output, an account aggregation manager, an account planning manager, an activity id correlation table, and activity id connectivity table with an account calculation procedure, a planning account overview table; an enterprise performance management device; an inventory procurement system; and a plurality of enterprise resource planning/accounting systems with general ledgers, such that the system creates an aggregated chart of activity accounts, each activity account comprising an activity id and associated aggregated planned cost, aggregated actual cost, and aggregated forecasted quantity, which aggregates general ledger accounts. The aggregated forecasted quantity can be used for centralized purchasing via the inventory procurement system. The account planning manager processes updates of aggregated planned cost and automatically updates aggregated planned cost of interconnected activity accounts. 1. A system for enterprise manufacturing inventory management , comprising: [ a planning activity id number; and', 'a planning activity id description;, 'a planning activity id, comprising, 'an aggregated planned cost;', 'an aggregated actual cost; and', 'an aggregated forecasted quantity;, 'a) an enterprise performance management server, comprising a planning account overview table, which specifies an aggregated chart of accounts; wherein the planning account overview table comprises a plurality of activity accounts, each activity account comprising 'wherein the first general ledger and the second general ledger are different, wherein general ledger accounts in the first general ledger and general ledger accounts in the second general ledger are different; and', 'b) a plurality of accounting systems, comprising: a first accounting system, comprising a first general ledger, and a second accounting system, comprising ...

Подробнее
Номер записи: 98
24-04-2014 дата публикации

SYSTEM AND METHOD TO MANAGE A WORKFLOW IN DELIVERING HEALTHCARE

Номер: US20140114685A1
Автор: Sievenpiper Crispian, Solliday-McRoy Jeffery, Warner Adrian
Принадлежит: GENERAL ELECTRIC COMPANY

An example system to allocate a resource to a plurality of patients includes a first agent to track a first property associated with a first patient to obtain first tracking data and a second agent to track a second property associated with a second patient to obtain second tracking data. The example system includes a bidding engine to receive the first tracking data from the first agent and the second tracking data the second agent. In the example system, the bidding agent to dynamically generate a first bid associated with the first patient based on the first tracking data and a second bid associated with the second patient based on the second tracking data. The example system includes a broker to assign the resource to one of the first patient or the second patient. In the example system, the broker is to dynamically communicate with the bidding engine to assign the resource based on at least one of the first bid, the second bid, or a property associated with the resource. 1. A system to allocate a resource to a plurality of patients , the system comprising:a first agent to track a first property associated with a first patient to obtain first tracking data and a second agent to track a second property associated with a second patient to obtain second tracking data;a bidding engine to receive the first tracking data from the first agent and the second tracking data from the second agent, the bidding agent to dynamically generate a first bid associated with the first patient based on the first tracking data and a second bid associated with the second patient based on the second tracking data; anda broker to assign the resource to one of the first patient or the second patient, wherein the broker is to dynamically communicate with the bidding engine to assign the resource based on at least one of the first bid, the second bid, or a property associated with the resource.2. The system of claim 1 , wherein the broker is to optimize at least one of a wait time of one ...

Подробнее
Номер записи: 99
24-04-2014 дата публикации

SYSTEM AND METHOD TO MANAGE A WORKFLOW IN DELIVERING HEALTHCARE

Номер: US20140114686A1
Автор: Sievenpiper Crispian, Solliday-McRoy Jeffery, Warner Adrian
Принадлежит: GENERAL ELECTRIC COMPANY

An example method to assign a plurality of resources to patient progressing through a workflow of events includes tracking a first property of a first resource, tracking a second property of a second resource, calculating a first set of bids for the first and second resources based on the respective first and second properties, assigning one of the first resource or the second resource to the slot in the workflow of events based on the first set of bids, introducing a third resource and tracking a third property of the third resource and calculating a second set of bids for the first, second and third resources based on the respective first, second and third properties, and reassigning one of the first resource, the second resource or the third resource to the slot in the workflow of events based on the second set of bids. 1tracking a first property of a first resource using a first agent;tracking a second property of a second resource using a second agent;calculating a first set of bids for the first and second resources based on the respective first and second properties, the first set of bids representative of priority statuses of the respective first and second resources to a slot in the workflow of events;assigning one of the first resource or the second resource to the slot in the workflow of events based on the first set of bids;introducing a third resource and tracking a third property of the third resource using a third agent;calculating a second set of bids for the first, second and third resources based on the respective first, second and third properties, the second set of bids representative of priority statuses of the respective first, second and third resources to the slot in the workflow of events;reassigning one of the first resource, the second resource or the third resource to the slot in the workflow of events based on the second set of bids.. A method to assign a plurality of resources to patient progressing through a workflow of events, ...

Подробнее
Номер записи: 100