US9898716B2 - Social network construction - Google Patents
Social network construction Download PDFInfo
- Publication number
- US9898716B2 US9898716B2 US14/316,916 US201414316916A US9898716B2 US 9898716 B2 US9898716 B2 US 9898716B2 US 201414316916 A US201414316916 A US 201414316916A US 9898716 B2 US9898716 B2 US 9898716B2
- Authority
- US
- United States
- Prior art keywords
- end device
- social
- bit array
- social graph
- relevance
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related, expires
Links
- 238000010276 construction Methods 0.000 title description 3
- 238000000034 method Methods 0.000 claims abstract description 24
- 238000004891 communication Methods 0.000 claims description 36
- 230000006870 function Effects 0.000 claims description 36
- 230000003993 interaction Effects 0.000 claims description 12
- 230000000694 effects Effects 0.000 claims description 7
- 230000004044 response Effects 0.000 claims description 3
- 238000005516 engineering process Methods 0.000 abstract description 4
- 238000003491 array Methods 0.000 description 22
- 230000008569 process Effects 0.000 description 7
- 238000010586 diagram Methods 0.000 description 6
- 230000009471 action Effects 0.000 description 3
- 238000004590 computer program Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 238000012986 modification Methods 0.000 description 3
- 230000002093 peripheral effect Effects 0.000 description 3
- 238000013500 data storage Methods 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 230000001413 cellular effect Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 239000003153 chemical reaction reagent Substances 0.000 description 1
- 150000001875 compounds Chemical class 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 230000004438 eyesight Effects 0.000 description 1
- 239000000835 fiber Substances 0.000 description 1
- 238000007667 floating Methods 0.000 description 1
- 239000000203 mixture Substances 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 239000003607 modifier Substances 0.000 description 1
- 230000006855 networking Effects 0.000 description 1
- 230000008520 organization Effects 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
- 230000007723 transport mechanism Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/10—Office automation; Time management
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/01—Social networking
Definitions
- a social graph is a social structure that may include nodes that connect together via edges or ties to show some sort of interdependency or relationship between the nodes.
- the nodes may represent people, organizations, or other sorts of entities.
- the edges between the nodes may represent interdependency or a relationship between the nodes, such as friends, co-workers, values, visions, dislikes, and/or the like.
- a method performed under control of an end device may include calculating a social relevance on a social graph between the end device and another end device, based on a social graph bit array of the end device and a social graph bit array of the other end device; determining that the calculated social relevance is greater than a predetermined threshold value; and constructing an ad-hoc social network that connects the end device with the other end device.
- an end device may include a social relevance calculator configured to calculate a social relevance on a social graph between the end device and another end device, based on a social graph bit array of the end device and a social graph bit array of the other end device; a device detector configured to determine that the calculated social relevance is greater than a predetermined threshold value; and a social network manager configured to construct an ad-hoc social network that connects the end device with the other end device.
- a computer-readable storage medium having stored thereon computer-executable instructions that, in response to execution, may cause an end device to perform operations including: calculating a social relevance on a social graph between the end device and another end device, based on a social graph bit array of the end device and a social graph bit array of the other end device; determining that the calculated social relevance is greater than a predetermined threshold value; and constructing an ad-hoc social network that connects the end device with the other end device.
- FIG. 1 schematically shows an illustrative example of an environment including a server, an end device and multiple other end devices, arranged in accordance with at least some embodiments described herein;
- FIGS. 2A to 2D schematically show illustrative example social graph bit arrays, arranged in accordance with at least some embodiments described herein;
- FIG. 3 shows a schematic block diagram illustrating an example architecture for an end device, arranged in accordance with at least some embodiments described herein;
- FIG. 4 schematically shows an example flow diagram of a process of an end device for constructing an ad-hoc social network, arranged in accordance with at least some embodiments described herein;
- FIG. 5 illustrates computer program products that may be utilized to provide an ad-hoc social network constructing scheme, arranged in accordance with at least some embodiments described herein;
- FIG. 6 is a block diagram illustrating an example computing device that may be utilized to provide an ad-hoc social network constructing scheme, arranged in accordance with at least some embodiments described herein.
- This disclosure is generally drawn, inter alia, to methods, apparatuses, systems, devices, and computer program products related to an ad-hoc social network constructing scheme.
- Technologies are generally described for a method for computing a social relevance on a social network service (SNS) between multiple end devices by using social graph bit arrays that correspond to each of the multiple end devices and constructing an ad-hoc social network based on the computing result.
- SNS social network service
- I/O input-output
- an end device may be configured to receive, from a social network service (SNS) cloud server, a social graph bit array of the end device.
- the social graph bit array may be a bit array into which a social graph corresponding to the end device on a social network service (SNS) may be translated by the SNS cloud server.
- a length of the social graph bit array may be determined in accordance with the number of users on the SNS.
- the social graph bit array may have 4,294,967,295 bits which are the greatest value in a 32-bit unsigned integer format.
- the social graph may be a social structure that may show interdependency or relationship between multiple devices or users on the SNS.
- the end device may be further configured to receive, from other end devices, via an ultralow-voltage wireless network such as a Bluetooth Low Energy (BLE) network, social graph bit arrays of each of the other end devices.
- the end device may be still further configured to calculate a social relevance or social relationship degrees on the social graph between the end device and respective one of the other end devices, based on the social graph bit array of the end device and the social graph bit arrays of the other end devices.
- the end device may be configured to execute a bitwise logical operation to the social graph bit array of the end device and respective one of the social graph bit arrays of the other end devices.
- the bitwise logical operation may include AND operation or XOR operation.
- the end device may be further configured to determine whether the calculated social relevance is greater than a predetermined threshold value.
- the end device may be further configured to detect one or more end devices having a social relevance greater than the predetermined threshold value from among the other end devices.
- the end device may be still further configured to display identifiers of the detected one or more end devices on a display that may be part of, or communicatively coupled to, the end device. Further, the end device may be configured to receive a user input to select one or more of the displayed identifiers. Then, the end device may be configured to construct an ad-hoc social network that may connect the end device and one or more devices of which the identifiers are selected.
- FIG. 1 schematically shows an illustrative example of an environment 10 including a server 120 , an end device 130 and multiple other end devices 140 , arranged in accordance with at least some embodiments described herein.
- server 120 , end device 130 and other end devices 140 may be communicatively connected to each other via a network 110 .
- Network 110 may include, as non-limiting examples, wireless networks such as a mobile radio communication network, including at least one of a 3rd generation (3G) mobile telecommunications network, a 4th or 5th generation mobile telecommunications network, various other mobile telecommunications networks, a satellite network, WiBro (Wireless Broadband Internet), Mobile WiMAX, HSDPA (High Speed Downlink Packet Access), Bluetooth, Bluetooth Low Energy (BLE) network, or the like.
- 3G 3rd generation
- 4th or 5th generation mobile telecommunications network various other mobile telecommunications networks
- satellite network such as WiBro (Wireless Broadband Internet), Mobile WiMAX, HSDPA (High Speed Downlink Packet Access), Bluetooth, Bluetooth Low Energy (BLE) network, or the like.
- WiBro Wireless Broadband Internet
- HSDPA High Speed Downlink Packet Access
- Bluetooth Bluetooth Low Energy
- server 120 may refer to one or more apparatuses or servers hosted and/or supported by a service providing organization or entity that provides social networking services to end device 130 and other end devices 140 .
- Server 120 may exist on a cloud layer.
- Respective one of end device 130 and other end devices 140 may include, for example, but not as a limitation, a notebook computer, a personal computer, a smart phone, a smart television, a digital camera, a tablet computer, a phablet device, or a personal communication terminal, such as PCS (Personal Communication System), GMS (Global System for Mobile communications), PDC (Personal Digital Cellular), PDA (Personal Digital Assistant), IMT (International Mobile Telecommunication)-2000, CDMA (Code Division Multiple Access)-2000, W-CDMA (W-Code Division Multiple Access) and Wibro (Wireless Broadband Internet) terminal.
- PCS Personal Communication System
- GMS Global System for Mobile communications
- PDC Personal Digital Cellular
- PDA Personal Digital Assistant
- IMT International Mobile Telecommunication
- CDMA Code Division Multiple Access
- W-CDMA Wideband Code Division Multiple Access
- Wibro Wireless Broadband Internet
- end device 130 may be configured to receive, from server 120 , a social graph bit array of end device 130 . Further, end device 130 may be configured to cache and/or store the received social graph bit array in a memory.
- the social graph bit array may be a bit array into which a social graph of end device 130 on a social network service is translated.
- the Social graph bit array may have multiple slots. For example, two types of bit (e.g., one or zero) may be inserted or set in each slot of the social graph bit array.
- a length of the social graph bit array i.e., a number of the slots
- the social graph bit array may have 4,294,967,295 slots which are the greatest value in a 32-bit unsigned integer format.
- server 120 may be configured to add an element of a social graph into ‘k’ number of hash functions.
- the ‘k’ may be an integer.
- the element of a social graph may include a mail address or an identifier of each user or end device.
- server 120 may be configured to set a valid bit (e.g., one) into one or more slots of the social graph bit array, which correspond to results of the ‘k’ number of hash functions.
- server 120 may be configured to assign weights to the social graph bit array of end device 130 in accordance with the social distance or frequency of communications on the SNS between end device 130 and other end devices 140 .
- server 120 may be configured to enter each element (e.g., a mail address or an identifier of respective one of other end devices 140 ) into from (k+1)-th hash function to (k+p)-th hash function.
- the ‘p’ may be an integer, and may be increased as the social distance or frequency of communications on the SNS between end device 130 and respective one of other end devices 140 increases.
- server 120 may be configured to set a valid bit (e.g., one) into one or more slots of the social graph bit array, which correspond to a result of the ‘p’ number of hash functions.
- Server 120 may be configured to set valid bits into one or more slots of the social graph bit array with regard to at least one of acquaintances on the social graph or a frequency of interactions with the acquaintances.
- the social graph bit array of end device 130 may have multiple valid bits which are proportional to at least one of a number of the acquaintances on the social graph or a frequency of interactions with the acquaintances.
- End device 130 may be further configured to receive social graph bit arrays of other end devices 140 from other end devices 140 .
- End device 130 may be configured to receive the social graph bit arrays via an ultralow-voltage wireless network between end device 130 and other end devices 140 .
- the ultralow-voltage wireless network may include a Bluetooth Low Energy (BLE) network.
- End device 130 may be further configured to calculate a social relevance or a social distance on a social graph of end device 130 between end device 130 and other end devices 140 , based on the social graph bit array of end device 130 and the social graph bit arrays of other end devices 140 .
- the social relevance or social distance may refer to degrees or levels to indicate how many or frequently social activities or social communications between multiple end devices on the SNS happen or to indicate how strongly or close multiple end devices are related or tied each other on the SNS.
- end device 130 may be configured to apply bitwise logical operations to the social graph bit array of end device 130 and the social graph bit arrays of other end devices 140 so as to calculate the social relevance.
- the bitwise logical operations may include AND operation or XOR operation.
- end device 130 may be configured to apply bitwise logical operations, such as AND operation, to the social graph bit array of end device 130 and respective one of the social graph bit arrays of other end devices 140 .
- end device 130 may be configured to count a number of slots in which a valid bit (e.g., one) is set as a result of the AND operation.
- End device 130 may be configured to identify and/or determine that the greater the number of slots in which a valid bit (e.g., one) is set is, the greater or closer the social relevance between end device 130 and respective one of other end devices 140 is.
- end device 130 may be configured to calculate a social relevance associated with one social graph bit array “a1” and another social graph bit array “a2” by using the below formula 1.
- a′ may refer to a bit array resulting from the bitwise logical operations, such as AND operation, between the social graph bit array “a1” and the social graph bit array “a2”.
- a′ [i] may refer to i-th bit of the bit array a′.
- bitratio(a)” may refer to a value in a range from zero to one that may represent a ratio of bits at which a valid bit (e.g., one) is set in the bit array “a”.
- end device 130 may be configured to determine whether the calculated social relevance is greater than a predetermined threshold value. For example, end device 130 may be configured to determine whether the counted number of slots in which a valid bit (e.g., one) is set is greater than a predetermined threshold value. For another example, end device 130 may be configured to determine whether a numerical value produced by the formula 1 is greater than a predetermined threshold value.
- End device 130 may be further configured to detect one or more end devices having a social relevance greater than the predetermined threshold value from among other end devices 140 .
- End device 130 may be configured to display a notification to indicate the detection of the one or more devices.
- End device 130 may be further configured to display identifiers of the detected one or more end devices on a display that may be part of, or communicatively coupled to, end device 130 .
- end device 130 may be configured to display the identifiers of the detected one or more end devices on the display in a descending order of the social relevance corresponding to each of the detected end devices.
- end device 130 may be configured to receive a user input to select one or more of the displayed identifiers. End device 130 may be further configured to construct an ad-hoc social network that may connect end device 130 and the one or more end devices, from among end devices 140 , of which the identifiers are selected, based on the received user input.
- FIGS. 2A to 2D schematically show illustrative example social graph bit arrays, arranged in accordance with at least some embodiments described herein.
- Server 120 may be configured to translate a social graph corresponding to end device 130 into a social graph bit array.
- a social graph bit array 200 may have ten thousand slots.
- Social graph bit array 200 may be in an initial state in which zero is inserted or set in all of the ten thousand slots of social graph bit array 200 .
- server 120 may be configured to add an element into social graph bit array 200 .
- the element may include a mail address or an identifier of each user or end devices.
- server 120 may be configured to assign weights to social graph bit array 200 of end device 130 in accordance with social distance or frequency of communications on the SNS between end device 130 and other end devices 140 .
- server 120 may be configured to enter each element (e.g., a mail address or an identifier of respective one of other end devices 140 ) into from (k+1)-th hash function to (k+p)-th hash function.
- the ‘p’ may be an integer, and may be change depending on the social distance or frequency of communications on the SNS between end device 130 and respective one of other end devices 140 . Further, server 120 may be configured to set a valid bit (e.g., one) into one or more slots of social graph bit array 200 , which correspond to a result of the ‘p’ number of hash functions.
- a valid bit e.g., one
- server 120 may be configured to add a first device element (e.g., a mail address of a first device among other end devices 140 , such as “john@example.com”) into social graph bit array 200 .
- a first device element e.g., a mail address of a first device among other end devices 140 , such as “john@example.com”
- server 120 may enter the first device element into relatively more hash functions. For example, server 120 may enter the first device element into from (k+1)-th hash function to (k+4)-th hash function.
- the result of (k+1)-th hash function with the first device element is five, the result of (k+2)-th hash function with the first device element is two, the result of (k+3)-th hash function with the first device element is 9998, and the result of (k+4)-th hash function with the first device element is seven.
- server 120 may be configured to set a valid bit (e.g., one) into second slot 202 , fifth slot 205 , seventh slot 207 and 9998-th slot 209 of social graph bit array 200 , which correspond to the result of the four hash functions.
- a valid bit e.g., one
- server 120 may be configured to add a second device element (e.g., a mail address of a second device among other end devices 140 , such as “scott@example.com”) into social graph bit array 200 .
- a second device element e.g., a mail address of a second device among other end devices 140 , such as “scott@example.com”
- server 120 may enter the second device element into relatively less hash functions.
- server 120 may enter the second device element into from (k+1)-th hash function to (k+2)-th hash function.
- the result of (k+1)-th hash function with the second device element is one and the result of (k+2)-th hash function with the second device element is 9999.
- server 120 may be configured to set a valid bit (e.g., one) into first slot 201 and 9999-th slot 210 of social graph bit array 200 , which correspond to the result of the two hash functions.
- a valid bit e.g., one
- server 120 may be configured to add a third device element (e.g., a mail address of a third device among other end devices 140 , such as “jack@example.com”) into social graph bit array 200 .
- a third device element e.g., a mail address of a third device among other end devices 140 , such as “jack@example.com”
- server 120 may enter the third device element into minimum hash functions. For example, server 120 may enter the third device element into (k+1)-th hash function. The result of (k+1)-th hash function with the third device element is three.
- server 120 may be configured to set a valid bit (e.g., one) into third slot 203 of social graph bit array 200 , which corresponds to the result of the hash function.
- a valid bit e.g., one
- server 120 may be configured to translate a social graph corresponding to end device 130 into social graph bit array 200 by setting or inserting valid bits into multiple slots that may correspond to results of hash functions, which are proportional to at least one of a number of acquaintances on the social graph or a frequency of interactions with the acquaintances.
- FIG. 3 shows a schematic block diagram illustrating an example architecture for an end device, arranged in accordance with at least some embodiments described herein.
- end device 130 may include a bit array manager 310 , a social relevance calculator 320 , a device detector 330 and a social network manager 340 .
- bit array manager 310 may be included in an instance of an application hosted on end device 130 .
- Bit array manager 310 may be configured to receive, from server 120 , a social graph bit array of end device 130 . Further, bit array manager 310 may be configured to cache and/or store the received social graph bit array in a memory.
- the social graph bit array may be a bit array to which a social graph corresponding to end device 130 on a social network service is translated by server 120 .
- the social graph bit array may have multiple slots. For example, two types of bit (e.g., one or zero) may be inserted or set in each slot of the social graph bit array.
- a valid bit (e.g., one) may be set into one or more slots of the social graph bit array, which correspond to a result of multiple hash functions with regard to at least one of acquaintances on the social graph or a frequency of interactions with the acquaintances.
- the social graph bit array of end device 130 may have multiple valid bits which are proportional to at least one of a number of the acquaintances on the social graph or a frequency of interactions with the acquaintances.
- Bit array manager 310 may be further configured to receive social graph bit arrays of other end devices 140 from other end devices 140 . Further, bit array manager 310 may be configured to transmit the social graph bit array of end device 130 to other end devices 140 , periodically. Bit array manager 310 may be configured to receive/transmit the social graph bit arrays from/to other end devices 140 via a ultralow-voltage wireless network between end device 130 and other end devices 140 .
- the ultralow-voltage wireless network may include a Bluetooth Low Energy (BLE) network.
- Social relevance calculator 320 may be configured to calculate a social relevance or a social distance on a social graph of end device 130 between end device 130 and respective one of other end devices 140 , based on the social graph bit array of end device 130 and respective one of the social graph bit arrays of other end devices 140 .
- social relevance calculator 320 may be configured to perform bitwise logical operations to the social graph bit array of end device 130 and respective one of the social graph bit arrays of other end devices 140 so as to calculate the social relevance.
- the bitwise logical operations may include AND operation or XOR operation.
- social relevance calculator 320 may be configured to count a number of slots in which a valid bit (e.g., one) is set as a result of the bitwise logical operations.
- Device detector 330 may be configured to determine whether the calculated social relevance is greater than a predetermined threshold value. For example, device detector 330 may be configured to determine whether the counted number of slots in which a valid bit (e.g., one) is set is greater than a predetermined threshold value. Device detector 330 may be further configured to detect one or more end devices having a social relevance greater than the predetermined threshold value from among other end devices 140 .
- a valid bit e.g., one
- Social network manager 340 may be configured to construct an ad-hoc social network that may connect end device 130 with the detected one or more end devices having a social relevance greater than the predetermined threshold value. Specifically, social network manager 340 may be configured to display identifiers of the detected one or more end devices on a display that may be part of, or communicatively coupled to, end device 130 . In some embodiments, social network manager 340 may be configured to display the identifiers of the detected one or more end devices on the display in a descending order of the social relevance.
- social network manager 340 may be configured to receive a user input to select one or more of the displayed identifiers. Social network manager 340 may be configured to then construct an ad-hoc social network that may connect end device 130 and the one or more end devices, from among end devices 140 , of which the identifiers are selected, based on the received user input.
- FIG. 4 schematically shows an example flow diagram of a process 400 of an end device 130 for constructing an ad-hoc social network, arranged in accordance with at least some embodiments described herein.
- the process in FIG. 4 may be implemented in environment 10 including server 120 , end device 130 and multiple other end devices 140 , as illustrated in FIG. 1 .
- An example process may include one or more operations, actions, or functions as illustrated by one or more blocks 410 , 420 , 430 , 440 and/or 450 . Although illustrated as discrete blocks, various blocks may be divided into additional blocks, combined into fewer blocks, or eliminated, depending on the desired implementation. Processing may begin at block 410 .
- end device 130 may receive, from cloud server 120 , a social graph bit array of end device 130 . Further, at block 410 , end device 130 may cache and/or store the received social graph bit array in a memory.
- the social graph bit array may be a bit array into which a social graph corresponding to end device 130 on a social network service is translated. Processing may proceed from block 410 to block 420 .
- end device 130 may receive social graph bit arrays of other end devices 140 from other end devices 140 .
- End device 130 may receive each of the social graph bit arrays from other end devices 140 via an ultralow-voltage wireless network between end device 130 and other end devices 140 .
- the ultralow-voltage wireless network may include a Bluetooth Low Energy (BLE) network. Processing may proceed from block 420 to block 430 .
- end device 130 may calculate a social relevance on a social graph of end device 130 between end device 130 and respective one of other end devices 140 , based on the social graph bit array of end device 130 and the social graph bit arrays of other end devices 140 .
- end device 130 may perform bitwise logical operations to the social graph bit array of end device 130 and respective one of the social graph bit arrays of other end devices 140 so as to calculate the social relevance.
- the bitwise logical operations may include AND operation or XOR operation. Processing may proceed from block 430 to block 440 .
- end device 130 may detect one or more end devices having close social relevance with end device 130 .
- end device 130 may determine whether the calculated social relevance is greater than a predetermined threshold value. For example, end device 130 may count a number of slots in which a valid bit (e.g., one) is set as a result of the bitwise logical operations performed at block 430 . Further, end device 130 may determine whether the counted number of slots in which a valid bit (e.g., one) is set is greater than a predetermined threshold value. Then, end device 130 may detect one or more end devices having a social relevance greater than the predetermined threshold value from among other end devices 140 . Processing may proceed from block 440 to block 450 .
- end device 130 may construct an ad-hoc social network that may connect end device 130 with the detected one or more end devices having a social relevance greater than the predetermined threshold value. Specifically, at block 450 , end device 130 display identifiers of the detected one or more end devices on a display that may be part of, or communicatively coupled to, end device 130 . In some embodiments, end device 130 may display the identifiers of the detected one or more end devices on the display in a descending order of the social relevance.
- end device 130 may receive a user input to select one or more of the displayed identifiers.
- End device 130 may construct an ad-hoc social network that may connect end device 130 and the one or more end devices, from among end devices 140 , of which the identifiers are selected, based on the received user input.
- FIG. 5 illustrates computer program products that may be utilized to provide an ad-hoc social network constructing scheme, arranged in accordance with at least some embodiments described herein.
- Program product 500 may include a signal bearing medium 510 .
- Signal bearing medium 510 may include one or more instructions 520 that, when executed by, for example, a processor, may provide the functionality described above with respect to FIGS. 1-4 .
- instructions 520 may include: one or more instructions for calculating a social relevance on a social graph between the end device and another end device, based on a social graph bit array of the end device and a social graph bit array of the other end device; one or more instructions for determining that the calculated social relevance is greater than a predetermined threshold value; or one or more instructions for constructing an ad-hoc social network that connects the end device with the other end device.
- end device 130 may undertake one or more of the blocks shown in FIG. 4 in response to instructions 520 .
- signal bearing medium 510 may encompass a computer-readable medium 530 , such as, but not limited to, a hard disk drive, a CD, a DVD, a digital tape, memory, etc.
- signal bearing medium 510 may encompass a recordable medium 540 , such as, but not limited to, memory, read/write (R/W) CDs, R/W DVDs, etc.
- signal bearing medium 510 may encompass a communications medium 550 , such as, but not limited to, a digital and/or an analog communication medium (e.g., a fiber optic cable, a waveguide, a wired communications link, a wireless communication link, etc.).
- program product 500 may be conveyed to one or more modules of end device 130 by an RF signal bearing medium 510 , where the signal bearing medium 510 is conveyed by a wireless communications medium 550 (e.g., a wireless communications medium conforming with the IEEE 802.11 standard).
- a wireless communications medium 550 e.g., a wireless communications medium conforming with the IEEE 802.11 standard.
- FIG. 6 is a block diagram illustrating an example computing device that may be utilized to provide an ad-hoc social network constructing scheme, arranged in accordance with at least some embodiments described herein.
- elements of computing device 600 may be arranged or configured for a device.
- computing device 600 typically includes one or more processors 604 and a system memory 606 .
- a memory bus 608 may be used for communicating between processor 604 and system memory 606 .
- processor 604 may be of any type including but not limited to a microprocessor ( ⁇ P), a microcontroller ( ⁇ C), a digital signal processor (DSP), or any combination thereof.
- Processor 604 may include one more levels of caching, such as a level one cache 610 and a level two cache 612 , a processor core 614 , and registers 616 .
- An example processor core 614 may include an arithmetic logic unit (ALU), a floating point unit (FPU), a digital signal processing core (DSP Core), or any combination thereof.
- An example memory controller 618 may also be used with processor 604 , or in some implementations memory controller 618 may be an internal part of processor 604 .
- system memory 606 may be of any type including but not limited to volatile memory (such as RAM), non-volatile memory (such as ROM, flash memory, etc.) or any combination thereof.
- System memory 606 may include an operating system 620 , an application 622 , and program data 624 .
- Application 622 may include instructions 626 that may be arranged to perform the functions as described herein including the actions described with respect to end device architecture as shown in FIG. 3 or including the actions described with respect to the flow charts shown in FIG. 4 .
- application 622 may be arranged to operate with program data 624 on an operating system 620 such that the schemes for constructing an ad-hoc social network.
- Computing device 600 may have additional features or functionality, and additional interfaces to facilitate communications between basic configuration 602 and any required devices and interfaces.
- a bus/interface controller 630 may be used to facilitate communications between basic configuration 602 and one or more data storage devices 632 via a storage interface bus 634 .
- Data storage devices 632 may be removable storage devices 636 , non-removable storage devices 638 , or a combination thereof. Examples of removable storage and non-removable storage devices include magnetic disk devices such as flexible disk drives and hard-disk drives (HDD), optical disk drives such as compact disk (CD) drives or digital versatile disk (DVD) drives, solid state drives (SSD), and tape drives to name a few.
- Example computer storage media may include volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information, such as computer readable instructions, data structures, program modules, or other data.
- Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disks (DVD) or other optical storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which may be used to store the desired information and which may be accessed by computing device 600 . Any such computer storage media may be part of computing device 600 .
- Computing device 600 may also include an interface bus 640 for facilitating communication from various interface devices (e.g., output devices 642 , peripheral interfaces 644 , and communication devices 646 ) to basic configuration 602 via bus/interface controller 630 .
- Example output devices 642 include a graphics processing unit 648 and an audio processing unit 650 , which may be configured to communicate to various external devices such as a display or speakers via one or more A/V ports 652 .
- Example peripheral interfaces 644 include a serial interface controller 654 or a parallel interface controller 656 , which may be configured to communicate with external devices such as input devices (e.g., keyboard, mouse, pen, voice input device, touch input device, etc.) or other peripheral devices (e.g., printer, scanner, etc.) via one or more I/O ports 658 .
- An example communication device 646 includes a network controller 660 , which may be arranged to facilitate communications with one or more other computing devices 662 over a network communication link via one or more communication ports 664 .
- the network communication link may be one example of a communication media.
- Communication media may typically be embodied by computer readable instructions, data structures, program modules, or other data in a modulated data signal, such as a carrier wave or other transport mechanism, and may include any information delivery media.
- a “modulated data signal” may be a signal that has one or more of its characteristics set or changed in such a manner as to encode information in the signal.
- communication media may include wired media such as a wired network or direct-wired connection, and wireless media such as acoustic, radio frequency (RF), microwave, infrared (IR) and other wireless media.
- RF radio frequency
- IR infrared
- the term computer readable media as used herein may include both storage media and communication media.
- Computing device 600 may be implemented as a portion of a small-form factor portable (or mobile) electronic device such as a cell phone, a personal data assistant (PDA), a personal media player device, a wireless web-watch device, a personal headset device, an application specific device, or a hybrid device that include any of the above functions.
- a small-form factor portable (or mobile) electronic device such as a cell phone, a personal data assistant (PDA), a personal media player device, a wireless web-watch device, a personal headset device, an application specific device, or a hybrid device that include any of the above functions.
- PDA personal data assistant
- Computing device 600 may also be implemented as a personal computer including both laptop computer and non-laptop computer configurations.
- a range includes each individual member.
- a group having 1-3 cells refers to groups having 1, 2, or 3 cells.
- a group having 1-5 cells refers to groups having 1, 2, 3, 4, or 5 cells, and so forth.
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Strategic Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Human Resources & Organizations (AREA)
- Tourism & Hospitality (AREA)
- General Business, Economics & Management (AREA)
- Marketing (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- Economics (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Mobile Radio Communication Systems (AREA)
- Multimedia (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Information Transfer Between Computers (AREA)
Abstract
Description
Claims (15)
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US14/316,916 US9898716B2 (en) | 2014-06-27 | 2014-06-27 | Social network construction |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US14/316,916 US9898716B2 (en) | 2014-06-27 | 2014-06-27 | Social network construction |
Publications (2)
Publication Number | Publication Date |
---|---|
US20150381668A1 US20150381668A1 (en) | 2015-12-31 |
US9898716B2 true US9898716B2 (en) | 2018-02-20 |
Family
ID=54931835
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US14/316,916 Expired - Fee Related US9898716B2 (en) | 2014-06-27 | 2014-06-27 | Social network construction |
Country Status (1)
Country | Link |
---|---|
US (1) | US9898716B2 (en) |
Families Citing this family (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20170111364A1 (en) * | 2015-10-14 | 2017-04-20 | Uber Technologies, Inc. | Determining fraudulent user accounts using contact information |
US11212276B2 (en) * | 2016-07-01 | 2021-12-28 | Intel Corporation | Single pairing for multiple technologies |
US11423362B2 (en) * | 2017-10-26 | 2022-08-23 | Oliver Sterczyk | Method of conducting workplace electronic communication traffic analysis |
US10733473B2 (en) | 2018-09-20 | 2020-08-04 | Uber Technologies Inc. | Object verification for a network-based service |
US10999299B2 (en) | 2018-10-09 | 2021-05-04 | Uber Technologies, Inc. | Location-spoofing detection system for a network service |
Citations (12)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20080031203A1 (en) | 2006-08-03 | 2008-02-07 | Aol Llc | Wireless social networking |
US20100014657A1 (en) | 2008-07-16 | 2010-01-21 | Florian Kerschbaum | Privacy preserving social network analysis |
US20100138443A1 (en) | 2008-11-17 | 2010-06-03 | Ramakrishnan Kadangode K | User-Powered Recommendation System |
CN101860859A (en) | 2009-04-13 | 2010-10-13 | 新康电脑科技(苏州)有限公司 | Short-distance safe and secure communication method for mobile subscribers based on Bluetooth technology |
US20120265703A1 (en) | 2011-04-13 | 2012-10-18 | Verizon Patent And Licensing Inc. | Ad hoc social networking |
US20120290565A1 (en) * | 2011-05-12 | 2012-11-15 | Microsoft Corporation | Automatic social graph calculation |
US20130097180A1 (en) | 2011-10-18 | 2013-04-18 | Erick Tseng | Ranking Objects by Social Relevance |
US20130103765A1 (en) | 2011-10-19 | 2013-04-25 | Matthew Nicholas Papakipos | Social Ad Hoc Networking Protocol and Presentation Layer |
US20140012918A1 (en) * | 2011-03-29 | 2014-01-09 | Nokia Corporation | Method and apparatus for creating an ephemeral social network |
US20150049871A1 (en) * | 2013-08-15 | 2015-02-19 | Broadcom Corporation | Systems and methods for implementing bluetooth low energy communications |
US20150142953A1 (en) * | 2013-11-21 | 2015-05-21 | Facebook, Inc. | Systems and methods for receiving and processing detected events |
US9143393B1 (en) * | 2004-05-25 | 2015-09-22 | Red Lambda, Inc. | System, method and apparatus for classifying digital data |
-
2014
- 2014-06-27 US US14/316,916 patent/US9898716B2/en not_active Expired - Fee Related
Patent Citations (13)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US9143393B1 (en) * | 2004-05-25 | 2015-09-22 | Red Lambda, Inc. | System, method and apparatus for classifying digital data |
US20080031203A1 (en) | 2006-08-03 | 2008-02-07 | Aol Llc | Wireless social networking |
US20100226284A1 (en) | 2006-08-03 | 2010-09-09 | Aol Inc. | Wireless social networking |
US20100014657A1 (en) | 2008-07-16 | 2010-01-21 | Florian Kerschbaum | Privacy preserving social network analysis |
US20100138443A1 (en) | 2008-11-17 | 2010-06-03 | Ramakrishnan Kadangode K | User-Powered Recommendation System |
CN101860859A (en) | 2009-04-13 | 2010-10-13 | 新康电脑科技(苏州)有限公司 | Short-distance safe and secure communication method for mobile subscribers based on Bluetooth technology |
US20140012918A1 (en) * | 2011-03-29 | 2014-01-09 | Nokia Corporation | Method and apparatus for creating an ephemeral social network |
US20120265703A1 (en) | 2011-04-13 | 2012-10-18 | Verizon Patent And Licensing Inc. | Ad hoc social networking |
US20120290565A1 (en) * | 2011-05-12 | 2012-11-15 | Microsoft Corporation | Automatic social graph calculation |
US20130097180A1 (en) | 2011-10-18 | 2013-04-18 | Erick Tseng | Ranking Objects by Social Relevance |
US20130103765A1 (en) | 2011-10-19 | 2013-04-25 | Matthew Nicholas Papakipos | Social Ad Hoc Networking Protocol and Presentation Layer |
US20150049871A1 (en) * | 2013-08-15 | 2015-02-19 | Broadcom Corporation | Systems and methods for implementing bluetooth low energy communications |
US20150142953A1 (en) * | 2013-11-21 | 2015-05-21 | Facebook, Inc. | Systems and methods for receiving and processing detected events |
Non-Patent Citations (10)
Title |
---|
"Akamai Reveals 2 Seconds as the New Threshold of Acceptability for eCommerce Web Page Response Times," Akamai, accessed at http://web.archive.org/web/20140212212815/http://www.akamai.com/html/about/press/releases/2009/press-091409.html, Sep. 14, 2009, pp. 1-3. |
"Your smartphone. Our camera. The perfect match for stunning image quality," Sony, accessed at http://web.archive.org/web/20140409053716/http://www.sony.net/Products/di/en-gb/products/ec8t/, accessed on Jun. 4, 2014, pp. 1-14. |
"Akamai Reveals 2 Seconds as the New Threshold of Acceptability for eCommerce Web Page Response Times," Akamai, accessed at http://web.archive.org/web/20140212212815/http://www.akamai.com/html/about/press/releases/2009/press—091409.html, Sep. 14, 2009, pp. 1-3. |
Bloom, B.H., "Space/Time Trade-offs in Hash coding with Allowable Errors," Communications of the ACM, vol. 13, No. 7, pp. 422-426 (1970). |
Bruck, J., et al., "Weighted Bloom filter," IEEE International Symposium on Information Theory, pp. 2304-2308 (2006 ). |
Juan, L., and Khan, S.U., "MobiSN: Semantics-based Mobile Ad Hoc Social Network Framework," Global Telecommunications Conference, GLOBECOM 2009. IEEE, pp. 1-6 (2009). |
Liu, Z., et al., "Clustering Coefficient Queries on Massive Dynamic Social Networks," WAIM'10 Proceedings of the 11th international conference on Web-age information management, vol. 6184, pp. 115-126, Springer-Verlag Berlin Heidelberg (2010). |
Shankar, P., et al., "SBone: Personal Device Sharing Using Social Networks," Rutgers University, Department of Computer Science, Technical Report DCS-TR-666, pp. 1-9 (Feb. 2010). |
Watanabe, C., and Arai Y., "Privacy-Preserving Queries for a DAS Model Using Encrypted Bloomfilter," Proceedings of International Conference on Database Systems for Advanced Applications, vol. 5463, pp. 491-495 (2009 ). |
Yang, Z., et al., "E-SmallTalker: A Distributed Mobile System for Social Networking in Physical Proximity," IEEE 30th International Conference on Distributed Computing Systems, pp. 468,477 (2010). |
Also Published As
Publication number | Publication date |
---|---|
US20150381668A1 (en) | 2015-12-31 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US9928232B2 (en) | Topically aware word suggestions | |
US9898716B2 (en) | Social network construction | |
US10133725B2 (en) | Learning new words | |
US9444797B2 (en) | Protection of private data | |
US9760619B1 (en) | Generating weighted clustering coefficients for a social network graph | |
US9361378B2 (en) | Determining reliability of online post | |
US8887169B2 (en) | Task assignment in cloud computing environment | |
US11568447B2 (en) | Tunable statistical IDs | |
US20140140331A1 (en) | Schemes for connecting to wireless network | |
US20140112193A1 (en) | Network selection scheme | |
US8929896B2 (en) | Geolocation-based load balancing | |
US20180189404A1 (en) | Identification of documents based on location, usage patterns and content | |
US11269818B2 (en) | Smart versioning for files | |
US9740797B2 (en) | Counting bloom filter | |
US20170155606A1 (en) | Generation of a communication request based on visual selection | |
US9569802B2 (en) | Invitation management based on invitee's behavior | |
US9904738B2 (en) | Web tracking protection | |
US20150234550A1 (en) | Display of data items | |
US9740763B2 (en) | Ontology decomposer | |
US20130339502A1 (en) | Techniques to manage transitions between private and public networks | |
US20160379226A1 (en) | Intelligent identification of multidimensional insights from process data | |
US9444825B2 (en) | Continuous user authentication | |
WO2015160332A1 (en) | Preview determination | |
US9767016B2 (en) | Generation of search index |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AS | Assignment |
Owner name: EMPIRE TECHNOLOGY DEVELOPMENT LLC, DELAWARE Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:KURABAYASHI, SHUICHI;REEL/FRAME:033193/0569 Effective date: 20140523 |
|
STCF | Information on status: patent grant |
Free format text: PATENTED CASE |
|
AS | Assignment |
Owner name: CRESTLINE DIRECT FINANCE, L.P., TEXAS Free format text: SECURITY INTEREST;ASSIGNOR:EMPIRE TECHNOLOGY DEVELOPMENT LLC;REEL/FRAME:048373/0217 Effective date: 20181228 |
|
AS | Assignment |
Owner name: EMPIRE TECHNOLOGY DEVELOPMENT LLC, WASHINGTON Free format text: RELEASE BY SECURED PARTY;ASSIGNOR:CRESTLINE DIRECT FINANCE, L.P.;REEL/FRAME:051404/0769 Effective date: 20191220 |
|
AS | Assignment |
Owner name: CRAVE LICENSING LLC, TEXAS Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:EMPIRE TECHNOLOGY DEVELOPMENT LLC;REEL/FRAME:052570/0027 Effective date: 20191220 |
|
FEPP | Fee payment procedure |
Free format text: MAINTENANCE FEE REMINDER MAILED (ORIGINAL EVENT CODE: REM.); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY |
|
LAPS | Lapse for failure to pay maintenance fees |
Free format text: PATENT EXPIRED FOR FAILURE TO PAY MAINTENANCE FEES (ORIGINAL EVENT CODE: EXP.); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY |
|
STCH | Information on status: patent discontinuation |
Free format text: PATENT EXPIRED DUE TO NONPAYMENT OF MAINTENANCE FEES UNDER 37 CFR 1.362 |
|
FP | Lapsed due to failure to pay maintenance fee |
Effective date: 20220220 |