An information processing apparatus includes a memory and a processor coupled to the memory. The memory is configured to store device connection information indicating a connection destination device coupled to a first device among a plurality of devices included in a communication network. The processor is configured to: search physical address learning information of the connection destination device in preference to physical address learning information of search target devices other than the connection destination device on basis of the device connection information. The physical address learning information of a specific device includes physical addresses learned for every port of the specific device. The search target devices are the plurality of devices other than the first device. The processor is configured to: obtain a connection destination port coupled to a first port of the first device on basis of a result of the search.

Embodiments of the present invention provide a time- and space-efficient system for representing and searching a set of intervals to find all the intervals that overlap with a given query interval or point. A new structure called an interval hash table is introduced to significantly reduce the average search time, thereby improving computing and search technology. During operation, the system obtains data indicating a set of intervals to be hashed. The system divides a respective interval into a set of sub-intervals based on a locality-preserving hashing. The system then obtains a hash code associated with a respective sub-interval, and inserts the respective sub-interval into an interval hash table at a location corresponding to the hash code. The system may further search the interval hash table.

A two-step algorithm for conducting near real-time fuzzy searches of a target on one or more large data sets is described. This algorithm includes the simplification of the data by removing grammatical constructs to bring the target search term (and the stored database) to their base elements and then performing a Levenstein comparison to create a subset of the data set that may be a match. Then performing a scoring algorithm while comparing the target to the subset of the data set to identify any matches.

The methods and systems described herein reorder feed items. In one example, the methods and systems store in a memory feed items in a defined sequential order for display in a feed. The methods and systems monitoring a speed of scrolling the feed items (scroll speed) on a user device. The methods and systems also determine that the scroll speed is equal or greater than a scroll threshold and in response to the determination reorder one or more of the feed items in a new order for display in the feed. The methods and systems also generate for display the one or more feed items in the feed in the new order.

A method includes receiving a query expression indicating an expression evaluation for performance upon output of a filtering operator. An operator execution flow indicating performance of the filtering operator serially after the expression evaluation is generated, and execution of this operator execution flow is facilitated by generating an exception column indicating an exception value generated for each of a set of rows based on performing the expression evaluation. The filtering operator of the operator execution flow can be applied by identifying a subset of the set of rows that meet filtering parameters of the filtering operator. When the exception value of at least one row in the subset indicates an error condition, execution of the operator execution flow is aborted. When the exception value of every row in the subset indicates no error, the subset of the set of rows is outputted and execution of the operator execution flow continues.

A component assembly system and method, by which an optimum combination of components can be determined by using inspection information of each component. The system has: an inspection information reading section for reading first and second inspection information regarding assembling of first and second components; a component reserving section for reserving each component; a storing section for storing a relationship between the inspection information of each component and a reserve position of each component; a grouping section for providing at least one first and second groups respectively including the first and second components; a combination determining section for determining a combination of the first and second components on one-to-one correspondence, by using the first and second inspection information; and a component conveying device for conveying the first and second components corresponding to the determined combination from the component reserving section to an assembly device, by using the stored relationship.

A device includes an input array register, a determining component and a computing component. The input array register stores a sorted list of n elements as an input array having size n, n being an integer greater than or equal to two. The determining component creates a list of m elements as a mask array having a size m, m being an integer greater than or equal to one, one of the m elements being based on two adjacent of the n elements of the input array. The computing component performs a mathematical operation between the input array and the mask array to generate a list of p elements as an output array having a size p, p being an integer greater than or equal to 0, the p elements identifying unique elements within the n elements.

An intelligent searching method and system based on a mobile device include acquiring a content and storing the content in a designated folder by a backend, after the mobile device detects that a user operates to duplicate the content; loading contents in the designated folder automatically and displaying the same into a list in a search box by the backend, after a search program in the mobile device is activated; transmitting, by the search program, a broadcast to other applications and performing a search by calling a search function in the applications, when it is detected that one of the contents in the list is selected; displaying an icon or icons of one or more of the applications including the content of the search by the search program, after the search is finished.

There is disclosed a method of and a system for converting a categorical feature value into a numeric representation thereof, the categorical feature being associated with a training object used for training a Machine Learning Algorithm (MLA). The MLA is trained using several models, each model comprising a plurality of decision trees (an ensemble of decision trees). For each model, a respective set of training objects into an ordered list of training objects such that for each given training object there is at least one of: (i) a preceding training object that occurs before the given training object and (ii) a subsequent training object that occurs after the given training object. The method further comprises, for a given categorical feature, using a respective ordered set to generate numeric representation of values of the given categorical feature.

A method of efficiently computing values for a data structure having cells having dependencies is disclosed. The data structure may encode complex system. The complex system data structure is traversed to produce a directed graph. The nodes of the directed graph are assigned a depth and labeled as circular or non-circular. Nodes having a base depth are terminal and correspond to cells having known values. The nodes are assigned to depth lists, which are processed until all values have been calculated or a maximum number of attempts to process the lists is reached.