Abstract: In accordance with embodiments of the present disclosure, an information handling system may include two processor sockets comprising a first processor socket and a second processor socket, a first information handling resource communicatively coupled to the first processor socket, second information handling resource, and a bus exchange switch communicatively coupled to the first processor socket, the second processor socket, and the second information handling resource such that: if the second processor socket is unpopulated, the bus exchange switch creates a first electrically conductive path between the first processor socket and the second information handling resource, and if the second processor socket is populated, the bus exchange switch creates a second electrically conductive path between the first processor socket and the second processor socket and creates a third electrically conductive path between the second processor socket and the second information handling resource.

Abstract: Disclosed is a server system having a hot plug motherboard. The server system includes a motherboard module, at least one midplane board and at least one hard disk module. The motherboard module includes a plurality of motherboards. The midplane board is coupled by means of hot plugging to each of the motherboards. The midplane board includes at least one Peripheral Component Interconnect Express (PCIe) slot, and the PCIe slot is configured to be plugged with a PCIe card. The hard disk module includes a plurality of hard disks being coupled to the PCIe card through a signal wire.

Abstract: Systems, methods, and apparatus are described that provide for communicating coexistence messages over a multi-drop serial bus. A method performed at a first device coupled to a serial bus includes receiving first coexistence information directed to a second device, selecting a communication link to carry the first coexistence information to the second device, generating a first datagram that includes the first coexistence information, transmitting the first datagram to the second device over a point-to-point link in a first mode of operation, and transmitting the first datagram to the second device over a multi-drop serial bus in a second mode of operation. The first datagram may be configured according to a protocol associated with the communication link selected to carry the first coexistence information.

Abstract: Systems, methods, and devices can include a first die comprising a first arbitration and multiplexing logic, a first protocol stack associated with a first interconnect protocol, and a second protocol stack associated with a second interconnect protocol. A second die comprising a second arbitration and multiplexing logic. A multilane link connects the first die to the second die. The second arbitration and multiplexing logic can send a request to the first arbitration and multiplexing logic to change a first virtual link state associated with the first protocol stack. The first arbitration and multiplexing logic can receive, from across the multilane link, the request from the first die indicating a request to change the first virtual link state; determine that the first interconnect protocol is ready to change a physical link state; and change the first virtual link state according to the received request while maintaining a second virtual link state.

Abstract: An arrangement and method for accommodating a reversible connector in a device that does not require the use of a controller or firmware comprises detection circuitry for detection of an orientation of an external connector connected to the reversible connector. Two switches allow to connect electrical wiring of the device to either one of a set of pins of the reversible connector according to the detected orientation. The switches operate independently and each comprise separate detection circuitry.

Abstract: A hot swap control circuit is utilized for detecting operating status of an NVMe storage module to generate a detection report to a storage server, wherein the detection report indicates at least one of a hot remove event and a hot add event. The hot remove event happens when at least one NVMe storage device of the NVMe storage module is removed, and the hot swap control circuit reports the hot remove event to the storage server by the detection report. Moreover, the hot add event happens when a new NVMe storage device is added to the NVMe storage module, and the hot swap control circuit reports the hot add event to the storage server by the detection report.

Abstract: The present disclosure relates generally to serial communication links and, more specifically, to events communicated on serial communication links and the timing of those events, for example, to achieve uniform delay among multiple event transmissions.

Abstract: The present disclosure relates generally to serial communication links and, more specifically, to events communicated on serial communication links and the timing of those events, for example, to achieve uniform delay among multiple event transmissions.

Abstract: A system and method for facilitating segmented notifications relating to a virtual space are disclosed. Such notifications may be segmented for different user segments within the virtual space. In some examples, the segmentation of the notification may be at least in part with respect to contents included in notification for different user segments. The content segmentation may be with respect to a communication style, pattern, format, a language expressed in, one or more culture references used and/or any other aspects related to contents that may be included in notifications for the different user segments. In some examples, the notifications may include incentive offers and may be segmented with respect to parameters of the incentive offers for presentation to the different user segments. In some implementations, transmission frequencies for transmitting notifications to the different user segments may be determined.

Abstract: An apparatus is described. The apparatus includes logic circuitry embedded in at least one of a memory controller, network interface and peripheral control hub to process a function as a service (FaaS) function call embedded in a request. The request is formatted according to a protocol. The protocol allows a remote computing system to access a memory that is coupled to the memory controller without invoking processing cores of a local computing system that the memory controller is a component of.

Abstract: In one embodiment, a system on chip includes: a plurality of intellectual property (IP) agents formed on a semiconductor die; a mesh interconnect formed on the semiconductor die to couple the plurality of IP agents, and a plurality of mesh stops each to couple one or more of the plurality of IP agents to the mesh interconnect. The mesh interconnect may be formed of a plurality of rows each having one of a plurality of horizontal interconnects and a plurality of columns each having one of a plurality of vertical interconnects;, where at least one of the plurality of rows includes an asymmetrical number of mesh stops. Other embodiments are described and claimed.

Abstract: Systems and methods for learning differentially private machine-learned models are provided. A computing system can include one or more server computing devices comprising one or more processors and one or more non-transitory computer-readable media that collectively store instructions that, when executed by the one or more processors cause the one or more server computing devices to perform operations. The operations can include selecting a subset of client computing devices from a pool of available client computing devices; providing a machine-learned model to the selected client computing devices; receiving, from each selected client computing device, a local update for the machine-learned model; determining a differentially private aggregate of the local updates; and determining an updated machine-learned model based at least in part on the data-weighted average of the local updates.

Abstract: Technologies for providing a scalable architecture to efficiently perform compute operations in memory include a memory having media access circuitry coupled to a memory media. The media access circuitry is to access data from the memory media to perform a requested operation, perform, with each of multiple compute logic units included in the media access circuitry, the requested operation concurrently on the accessed data, and write, to the memory media, resultant data produced from execution of the requested operation.

Abstract: An execution unit to execute instructions using a time-lag sliced architecture (TLSA). The execution unit includes a first computation unit and a second computation unit, where each of the first computation unit and the second computation unit includes a plurality of logic slices arranged in order, where each of the plurality of logic slices except a lattermost logic slice is coupled to an immediately following logic slice to provide an output of that logic slice to the immediately following logic slice, where the immediately following logic slice is to execute with a time lag with respect to its immediately previous logic slice. Further, each of the plurality of logic slices of the second computation unit is coupled to a corresponding logic slice of the first computation unit to receive an output of the corresponding logic slice of the first computation unit.

Abstract: The execution engine is a new organization for a digital data processing apparatus, suitable for highly parallel execution of structured fine-grain parallel computations. The execution engine includes a memory for storing data and a domain flow program, a controller for requesting the domain flow program from the memory, and further for translating the program into programming information, a processor fabric for processing the domain flow programming information and a crossbar for sending tokens and the programming information to the processor fabric.

Abstract: Systems and methods use a ZFS file system in a Windows-based computing environment without protocol conversion or native ZFS support on Windows-based computing devices. Windows-based computing devices may obtain native Windows-based access to data in a storage volume that is managed by a Unix-based storage management server executing a ZFS volume manager and file system. ZFS clones may be served as logical unit numbers to Windows-based computing devices. The ZFS nature of the accessed storage volume is unbeknownst to the Windows-based machines. This enables Windows-based utilities, applications, and tools executing on a Windows-based computing device to operate upon the data in ZFS-managed space the same as they might have operated on a workspace in an array-created hardware snapshot in the prior art. Users may use storage space from their Windows-based computing devices according to a Windows-based file system such as NTFS.

Abstract: In general, embodiments of the technology relate to a method and system for implementing a dynamic content type (DCT) in a content management system. More specifically, embodiments of the technology relate to using a DCT in order to change and/or extend the functionality of the content management system.

Abstract: Methods, apparatuses, and embodiments related to improving security of data that is stored and distributed over a data network. In an example, source data to be protected is partitioned into multiple files, and each file is obfuscated, such as by being encrypted, to created multiple obfuscated data files. Information as to how each obfuscated data file was obfuscated is stored in an associated trace file. The multiple obfuscated data files are moved around a data network via a data movement process that includes sending each of the multiple obfuscated data files to a different randomly selected computer, where the computer further obfuscates the obfuscated data the trace file, and sends the further obfuscated data and trace file to a next randomly selected computer. In an example, the various operations for improving security may be performed by an integrated circuit, such as a system-on-chip (SoC) or application-specific integrated circuit (ASIC).

Abstract: Embodiments of the present invention relate to a data-oriented architecture (DOA) system comprising a data resource pool, which includes multiple data management modules, for storing data, a management center which includes an interface management module and multiple data interfaces, and each data interface corresponds to one data management module, wherein the interface management module is configured to configure the corresponding data interface for the data management modules, and get routing information of a requested data according to a data request information, the data request information includes attribute information of an application which initiates the data request information, the data interface is configured to obtain the requested data stored in the data management modules according to the routing information, compile and process the requested data to obtain data of a data structure that supported by the application according to the attribute information, and a DOA resource bus, connected to the

Abstract: An electronic apparatus is provided. The electronic apparatus includes a camera, a storage, and a processor configured to store an image photographed by the camera and metadata of the image in the storage, the processor is further configured to identify whether first information related to the image is obtainable, based on the first information not being obtainable, generate metadata related to the first information based on second information, and store the generated metadata as metadata of the image.

Abstract: A computer-implemented environment for creating, curating, sharing and storing document contents in a concise, structured, modular, standardized and story-like format. The environment enables users to define content with a set of Cards, and arrange, connect and disconnect Cards so as to define a distinct Story. The environment additionally provides a user-adjustable Card content separator configured so that content below the separator is not instantly visible to the user. Furthermore, the environment enables the automatic conversion of files, data feeds and search results into Cards and Stories.

Abstract: According to certain aspects, a client computing system can be configured to map stored database data into a plurality of second data units having a second level of granularity larger than first data units; store a mapping of the second data units to the first data units; monitor writes to the database data by the database application; identify of the writes changed first data units of the first data units which have changed as a result of the writes; use the mapping to identify changed second data units of the second data units which each include at least one of the changed first data units; maintain a table listing the changed second data units; and in response to instructions to create a secondary copy of the database data, consult the table to identify the changed second data units, and forward the changed second data units to secondary storage controller computer(s).

Abstract: Two different representations of content are maintained, at least one of which is a composite representation of the content. The composite representation is multiple different components, each component stored as a separate file and each component including some of the data of the content. The composite representation also includes a manifest that identifies the various components. Different devices can edit the content, and access to the content is coordinated via a synchronization system. The synchronization system manages generation of one or more representations of the content. The synchronization system also manages synchronization of the different representations of the content, allowing changes made on various different computing devices to be reflected in the different representations of the content, and managing situations in which different computing devices may attempt to change the content concurrently.

Abstract: Reducing time required to write a file to tape is provided. Synchronous processing is performed in a file system implementing a Linear Tape File System (LTFS) file format, wherein the synchronous processing includes writing, to a tape medium of a tape cartridge, index information and one or more files. A type of the synchronous processing is determined, wherein the type is either an index-MAM sync type or an index-only sync type. Updated information is stored to a media auxiliary memory of the tape cartridge in response to determining that the synchronous processing is of the index-MAM sync type.

Abstract: Systems and methods for managing electronic data are disclosed. Various data management operations can be performed based on a metabase formed from metadata. Such metadata can be identified from an index of data interactions generated by a journaling module, and obtained from their associated data objects stored in one or more storage devices. In various embodiments, such processing of the index and storing of the metadata can facilitate, for example, enhanced data management operations, enhanced data identification operations, enhanced storage operations, data classification for organizing and storing the metadata, cataloging of metadata for the stored metadata, and/or user interfaces for managing data. In various embodiments, the metabase can be configured in different ways. For example, the metabase can be stored separately from the data objects so as to allow obtaining of information about the data objects without accessing the data objects or a data structure used by a file system.

Abstract: Systems and methods for increasing computing efficiency include a compiler configured to compress a variant table into a variant decomposition diagram (VDD). VDDs are compact representations of one or more variant tables and comprise a series of nodes and links that can be used to evaluate (e.g., filter, iterate, access) the variant table.

Abstract: The present disclosure discloses a file access method of a virtualization instance, including performing union on some image subfiles in a host operating system (host OS) and mounting a united directory to a union directory, and when an application in a library operating system instance needs to access a file in the union directory, causing a central processing unit to generate an exit event such that a hypervisor captures and processes the exit event, and during processing, converts an access request that is from the instance into an access request based on a system call of the host OS, and performs access.

Abstract: A computer-implemented method according to one embodiment includes identifying an accessing of a file within an operating system, checking an in-memory cache for path information associated with the file, checking an external cache for the path information associated with the file, conditionally retrieving the path information associated with the file by performing a file system lookup and adding the path information associated with the file to the in-memory cache and the external cache, returning the path information, and reorganizing the external cache to put file information that is frequently accessed together in a single block or adjacent blocks.

Abstract: A method and a corresponding system for deploying changes in a computer system, in particular an industrial computer system, includes a database and an old version of the system to be updated. The method includes providing a new version of the system and providing a merge view capable of reading data from the database and furnishing the data to the new version. The database contains at least an old table readable by the old version and the merge view can read data from the old table and furnish them to the new version.

Abstract: A method of database data migration is described. A migration task of migrating data from a source database to a target database can be obtained. The migration task can include a network type of a source network with which the source database is connected. The target database can be located in a cloud environment. A network connectivity policy is determined according to the network type of the source network of the source database. The network policy can indicate a configuration of a communication link between the source database and the target database. The communication link between the source database and the target database can be configured according to the network connectivity policy, such that the data can be migrated from the source database to the target database via the communication link.

Abstract: Flexible, high-accuracy data processing techniques and accompanying systems avoid criticality in intermediate computations through intelligent, low cost sanitization of data operations. A data processing operation including one or more plans is received, with each plan having a data operation described as a tree based-structure. The plans that are determined to create criticality on execution are sanitized by transforming the plan itself, ancestors, and/or children of the plan. Determining whether execution of a plan creates criticality is based on the determination of whether a set of criticality conditions includes data signals that are associated with the plan. After sanitization, the data processing operation can be fully executed without criticality arising in intermediate operations.

Abstract: Repairing corrupt database references. Identifying a corrupt reference within a database, whereby the corrupt reference includes a reference with a broken connection between one or more data objects within the database and the corrupt reference is associated with one or more reference corruption types. Recording reference information for the corrupt reference, whereby the reference information includes a location of the corrupt reference within the database and one or more identification numbers of the one or more data objects associated with the corrupt reference. Determining a repair procedure based on the one or more reference corruption types associated with the corrupt reference. Generating one or more lines of computer code associated with the repair procedure and based on the recorded reference information. Executing the one or more lines, whereby the one or more lines are executed in a database manager.

Abstract: An appliance includes a processor, a medium, a registration application, and a monitoring application. The registration application includes instructions in the medium that, when read and executed by the processor, configure the registration application to write a transaction identifier to a start message, the transaction identifier identifying the appliance, write a dataset of interest identifier to the start message, and send the start message to a database. The dataset of interest identifies a group of appliances including the appliance. The monitoring application includes instructions in the medium that, when read and executed by the processor, configure the monitoring application to monitor operations executed on the appliance, write data resulting from the operations to a data message, and send the data message anonymously to the database. The data message is signed with a member key associated with the group of appliances.

Abstract: A data analysis system stores in-memory representation of a distributed data structure across a plurality of processors of a parallel or distributed system. Client applications interact with the in-memory distributed data structure to process queries using the in-memory distributed data structure and to modify the in-memory distributed data structure. The data analysis system creates uniform resource identifier (URI) to identify each in-memory distributed data structure. The URI can be communicated from one client application to another application using communication mechanisms outside the data analysis system, for example, by email, thereby allowing other client devices to interact with a particular in-memory distributed data structure. The in-memory distributed data structure can be a machine learning model that is trained by one client device and executed by another client device. A client application can interact with the in-memory distributed data structure using different programming languages.

Abstract: Using an action registry to edit data across users and devices is described. In one or more implementations, a user editing data in an application requests to share the data with another user or another device for further editing. Responsive simply to the request or based on an exchange of content transfer information, the data is communicated to the selected user or device. Using information maintained by an action registry, a list of applications capable of editing the data is presented to the selected user or via the selected device. Upon selection of an application from the list, the selected application is launched. Once changes are made to the data by the selected user or device, those changes can be saved and the changed data automatically returned to the original user and/or device. The changed data can then be automatically presented to the original user or on the original device.

Abstract: A system according to certain aspects improves the process of managing log data. The system may receive a log data file including one or more log lines that contain information relating to computing operations. At least some of the log lines may include a static portion and a variable portion. The system may process a first log line to identify and extract a static portion from the first log line, and determine a first value for the first log line based on the extracted static portion. The system may process a second log line to identify and extract a static portion from the second log line, and determine a second value for the second log line based on the extracted static portion. The system may compare the first and second values, and based on the comparison, organize the first and second log lines together for presentation to a user.

Abstract: A present invention embodiment relates to inserting data to a data table, where the data table has multiple data records and involves at least one organizing attribute. The embodiment defines a set of data blocks having records of the data table and assigns to each data block of the set of data blocks a predefined maximum number of records of the data table or a predefined maximum amount of storage. Data records for each data block of the set of data blocks may be stored on a storage system. Further data records may be sorted based on values of the organizing attribute in the buffered data records. The sorted data records may be written on the storage system in their order. Attribute value information may be determined for the further data blocks for supporting query processing against the data table.

Abstract: Disclosed are systems and method for machine learning and blockchain-based anti-discrimination validation. The described techniques uses a machine learning model to generate a numerical determination associated with a first person based on an input data set associated with the first person. The numerical determination is further based on a corrective module configured to compensate for prohibited discrimination by the machine learning model. The technique generates a blockchain transaction data structure comprising a state of the machine learning model at the time of generating the numerical determination, a copy of the input data set associated with the person, and an indication of a correction by the machine learning model. The blockchain transaction data structure is recorded or published in a blockchain network.

Abstract: An interactive vehicle information map system is disclosed in which, in various embodiments, geographical, geospatial, vehicle, and other types of data, geodata, objects, features, and/or metadata are efficiently presented to a user on an interactive map interface. In an embodiment, the user may search vehicle-related data via the interactive map by providing search criteria including, for example, information regarding a geographic area, a time period, a vehicle, a vehicle owner, and/or a license plate number, among other items. The map system may provide search results including a list of vehicles that match the search criteria, vehicle information, and/or points on the interactive map that indicate license-plate recognition read locations, among other information. In an embodiment, the user may view detailed information associated with particular vehicles including, for example, captured images, vehicle-owner data, event history, and the like. Further, the user may export data and/or create search alerts.

Abstract: A method of reviewing SQL includes: obtaining slow log data; extracting a SQL sentence to be reviewed and basic information matched with the SQL sentence from the slow log data; identifying and parsing the SQL sentence to obtain a parsed result; reviewing the parsed result and/or the basic information in accordance with review items in a preset review template one by one to obtain a review result; and generating a review result set according to the review result.

Abstract: An accelerator is mounted on each server which is a worker node of a distributed DB system; a query generated by an application of an application server is divided into a first task that should be executed by the accelerator and a second task that should be executed by software and is allocated to the server of the distributed DB system; the server causes the accelerator to execute the first task, and executes the second task based on the software.

Abstract: A secure equijoin technique of generating one table from two tables while curbing the volume of communications traffic is provided. The technique includes: a first permutation generating means 110 that generates a permutation <?> from an element sequence which is generated from the first column of a table L and the first column of a table R; a first column generating means 120 that generates, for j=2, . . . , a, by using the permutation <?>, a prefix sum, and an inverse permutation <??1>, the j-th column of a table J from an element sequence which is generated from the to j-th column of the table L; a join-result element sequence generating means 130 that generates a join-result element sequence from an element sequence ([[1]], . . . , [[1]], [[0]], . . . , [[0]], [[?1]], . . . , [[?1]]) by using the permutation <?>, the prefix sum, and the inverse permutation <??1 >; a second column generating means 140 that generates, for j=a+1, . . .

Abstract: Cross-tabulation operation is performed within a columnar database management system. The columnar database management system receives a request to perform a cross-tabulation operation on a set of database tables. The columnar database management system determines values of cross-tabulation operation for each row of the result. The columnar database management system determines a domain for each value of the row dimension corresponding to a row combination. The columnar database management system determines an intersection set of the domains corresponding to values of the row dimensions for the row combination. The columnar database management system determines a value for the result column for the row combination as an aggregate value based on the records of the intersection set.

Abstract: A method of searching tree-structured data can be provided by identifying all labels associated with nodes in a plurality of trees including the tree-structured data, determining which of the labels is included in a percentage of the plurality of trees that exceeds a frequent threshold value to provide frequent labels, defining frequent candidate sub-trees for searching within the plurality of trees using combinations of only the frequent labels, and then searching for the frequent candidate sub-trees in the plurality of trees including the tree-structured data using a plurality of pruning kernels instantiated on a non-deterministic finite state machine to provide a less than exact count of the frequent candidate sub-trees in the plurality of trees.

Abstract: An automation device for process automation, with a server containing one or more process automation variables, wherein the server is configured to receive read and/or write requests from a client in communication with the automation device for at least one variable. The automation device adapted to: specify the time period between two read requests for the same read request variable and/or between two write requests for the same write request variable; specify a sampling time for the read or write request variable as a function of the specified time period; and enable read access to the read request variable in the address space of the server at the respective sampling time, independently of future read requests and/or to prepare write access to the write request variable in the address space of the server at the respective sampling time, independent of the previous write request.

Abstract: A control method for performing a multi-table join operation and a corresponding apparatus are disclosed. Fields in a table whose fields participating in a theta join operation and used in the query statement meet a first preset condition are decomposed, to obtain a plurality of first field groups, so that the theta join operation can be implemented in steps in a form of the plurality of field groups. This can reduce a data amount of Cartesian product calculation during one join operation, greatly reduce network transmission overheads, computing overheads, and memory overheads, and improve execution efficiency.

Abstract: A personalized recommendation system for providing personalized recommendations to a plurality of users, the personalized recommendation system comprising at least one processing resource configured to: obtain a list of Objects of Interest (OOIs) for each of the users, each OOI having one or more corresponding characteristics; calculate relevance scores for each of the OOIs, and for a plurality of other objects not included in the list, the relevance scores calculated utilizing at least one of the characteristics of the OOIs; provide, based on the relevance scores, one or more recommendations to each user, wherein each recommendation is for performing an action relating to a corresponding OOI from the list, or to a corresponding other object; and recalculate at least one of the relevance scores for each user, based at least on performance of the action by the respective user, or lack thereof.

Abstract: In an aspect, a method includes receiving lists of entities, each list (i) having an associated score, (ii) being associated with a respective context fact, and (iii) ranking a subset of the entities, and for each of the lists of entities, generating, for each entity on the list, a data structure that references (i) the entity, (ii) the context fact associated with the list, (iii) the rank of the entity for the context fact, and (iv) the score for the list. The method can also include receiving data identifying a particular entity, selecting a particular data structure that references the particular entity, and providing, for output, data indicating (i) the context fact associated with the particular data structure that references the particular entity, and (ii) the rank of the entity for the context fact associated with the particular data structure that references the particular entity.

Abstract: Methods and systems are disclosed for a sequential federated query for information in residential, commercial, and/or distributed systems.

Abstract: A method for calculating a size of a processing unit in a system, the system being configured to perform a reflection process that includes reflecting information on an operation performed in a row-type database on a column-type database in a predetermined processing unit, the method includes: executing a first calculation process for calculating a reference value based on processing costs of multi-version concurrency control performed in the processing unit by the database management system and information on processing costs of a process of converting the information on the operation performed in the row-type database into a form of the column-type database after the reflection process is executed in a previous time; and executing a second calculation process for calculating a size of a processing unit based on the reference value calculated by the first calculation process and information on a deviation of the number of valid rows.