JP4882686B2 - Social networking system and control program thereof - Google Patents

Social networking system and control program thereof Download PDF

Info

Publication number
JP4882686B2
JP4882686B2 JP2006306012A JP2006306012A JP4882686B2 JP 4882686 B2 JP4882686 B2 JP 4882686B2 JP 2006306012 A JP2006306012 A JP 2006306012A JP 2006306012 A JP2006306012 A JP 2006306012A JP 4882686 B2 JP4882686 B2 JP 4882686B2
Authority
JP
Japan
Prior art keywords
user
portable media
media player
best friend
server
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.)
Active
Application number
JP2006306012A
Other languages
Japanese (ja)
Other versions
JP2008123233A (en
Inventor
琢磨 宮崎
Original Assignee
ヤマハ株式会社
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by ヤマハ株式会社 filed Critical ヤマハ株式会社
Priority to JP2006306012A priority Critical patent/JP4882686B2/en
Priority claimed from EP07120319A external-priority patent/EP1921577A1/en
Publication of JP2008123233A publication Critical patent/JP2008123233A/en
Application granted granted Critical
Publication of JP4882686B2 publication Critical patent/JP4882686B2/en
Application status is Active legal-status Critical
Anticipated expiration legal-status Critical

Links

Images

Description

  The present invention relates to a social networking system capable of sharing multimedia data such as music content among a limited number of users and a control program thereof.

In recent years, with the development of a social networking service (SNS) using the Internet, an increasing number of people enjoy communication with friends and people who have a good taste (see Non-Patent Document 1, for example). In particular, music-related SNSs are also increasing, and reproduction history (playlist) of music content owned by each user can be shared among users within the SNS.
http://mixi.jp/

  By the way, sharing of music content itself was not permitted from the viewpoint of copyright protection. In addition, information such as a reproduction history that can be shared can be used on a personal computer and cannot be used by a portable media player (for example, a portable music player). Furthermore, when setting an SNS friend with a new acquaintance on the go, you must set it from a personal computer set at home, etc. could not.

  The present invention is capable of sharing multimedia data such as music contents among a small number of users who can be considered as a range of personal use, and setting the relationship between users who can share such data on the go However, it aims to provide a technique that can be easily performed.

  In order to achieve the above object, the present invention configures a social networking system that provides a communication service between users in which a friendship or a close friendship is set by connecting a server and each user device to a network, The server stores the multimedia data of each user in the storage area for each user, and indicates that a close friend relationship is set between the predetermined users within a predetermined number of people that can be considered as a range of personal use. Store information. Then, when an access request is transmitted from the user device, the multimedia data stored in the storage area of the user who uses the user device and the storage area of the user in which the friendship with the user is set Access control is performed to allow access to stored multimedia data.

  In particular, when a portable media player is used as user equipment, multimedia data of other users who are in a close friend relationship can be streamed and reproduced. Further, if the portable media players have a close friend relationship, the multimedia data stored in the portable media player can be streamed to other portable media players. In addition, even when away from home, the best friendship can be set between portable media players. The best friend list of the portable media player and the best friend list held in the server can be synchronized.

  According to the present invention, in a social networking system, multimedia data can be stored in the network storage of a server for each user, and a limited number of other users who can be considered as a range of personal use can be set as best friends. By providing access to the network storage from other users set as close friends and providing the multimedia data, the multimedia data is shared between the close friends. Thereby, the media file can be legally shared within the range of personal use (for example, within the range of personal use if there are about 4 to 5 people). In addition, since the setting of the best friend relationship can be performed between portable media players, it can be easily performed on the go. Since the best friend list in the portable media player and the best friend list in the server are synchronized, it is guaranteed that the contents of those lists match.

  Embodiments of the present invention will be described below with reference to the drawings.

  FIG. 1 shows the overall system configuration of a social networking system according to an embodiment of the present invention. An SNS server 102 and PCs 103, 104, and 105 of each user are connected to a wide area network 101 such as the Internet. These users of the PCs 103 to 105 are assumed to be users registered in advance in the SNS. Each user has a portable media player (hereinafter referred to as “MMP”) 106A, 107A, 108A. Although three users are assumed here, the number of users is arbitrary.

  The user A stores a multimedia data file (hereinafter referred to as “content”) such as audio data and visual data held on his / her PC 103 in an area (network storage) allocated to the user on the SNS server 102. ) Can be uploaded. Further, the user A can transfer the content on the PC 103 to the MMP 106A and store it in a storage area (local storage) in the MMP 106A. The MMP 106A can reproduce the content in the local storage in accordance with a user instruction. The content uploaded to the network storage of the SNS server 102 can be streamed and downloaded by the personal computer 103. The same applies to PC 104 and MMP 107A of user B, and PC 105 and MMP 108A of user C. Each user can go out with his / her own MMP 106A, 107A, 108A. Reference numerals 106B, 107B, and 108B denote MMPs that the users A, B, and C have when going out. Each MMP can play back the content held in the local storage in its own MMP.

  In this SNS, “friends” and “best friends” can be registered as relationships between users. “Best friends” are registered under the mutual consent of users who are in a “friend” relationship, and here, five users can be registered as “best friends”. There is a limit of up to. Here, it is assumed that the users A, B, and C in FIG. 1 are registered as close friends. The SNS server 102 provides a service for forming an online community among the users set as “friends” or “best friends”. Services provided include communication services such as a diary service and an email service. Since these services are publicly known, detailed description thereof is omitted. The SNS also provides a sharing service that allows music content to be shared only between a limited number of users set as “best friends”.

  A plurality of base stations (hereinafter referred to as “hot spots”) of the wireless LAN 109 are connected to the network 101. Each MMP has a wireless short-range communication function such as Wi-Fi (trademark) and a wireless short-range communication function such as Bluetooth (trademark). For example, the MMP 106B of the user A can access the SNS server 102 via the wireless LAN 109 and the network 101 using the wireless medium range communication function. As a result, the user A's MMP 106B can stream the content of the user A's network storage. In addition, each user can perform streaming playback of the network storage content of the user who is in a close relationship with the user. For example, since the user B is in a close friendship relationship with the user A, the user B's MMP 107B can access the network storage content of the user A of the SNS server 102 via the wireless LAN 109 and the network 101 and perform streaming playback. Furthermore, it is possible to perform streaming playback of content between MMPs of users who are in a close friend relationship. For example, since the users B and C are in a close friend relationship, the MMP 107B of the user B can access the MMP 108B of the user C by the wireless short-range communication function, and can stream and reproduce the local storage content of the user C. It is also possible for the user C's MMP 108B to perform streaming playback of the local storage content in the user B's MMP 107B.

  FIG. 2 is a block diagram illustrating an outline of the hardware configuration of the SNS server 102. The SNS server 102 includes a central processing unit (CPU) 201, a read only memory (ROM) 202, a random access memory (RAM) 203, a storage device 204, a network interface (I / F) 205, an operator 206, a display 207, and A bus line 208 is provided. The units 201 to 207 are connected to each other by a bus line 208 and can exchange various data.

  The CPU 201 is a processing device that controls the operation of the entire server. The ROM 202 is a non-volatile memory that stores various programs executed by the CPU 201 and various data. A RAM 203 is a volatile memory used for a load area and a work area for programs executed by the CPU 201. The storage device 204 is an external storage device such as a hard disk device, and stores various programs executed by the CPU 201 and user data of each user. A network I / F 205 is an interface for connecting the server to the network 101. The operation element 206 is an input device such as a keyboard and a mouse. The display 207 is a display device for displaying various information.

  FIG. 3 is a block diagram showing an outline of the hardware configuration of the MMP possessed by each user. The MMP includes a CPU 301, a ROM 302, a RAM 303, a storage device 304, a wireless short-range communication I / F 305, a wireless medium-range communication I / F 306, a wired communication I / F 307, an operator 308, a display 309, a sound source 310, an audio decoder 311, a sound. A system 312 and a bus line 313 are provided.

  The CPU 301 is a processing device that controls the overall operation of the MMP. The ROM 302 is a nonvolatile memory that stores various programs executed by the CPU 301 and various data. A RAM 303 is a volatile memory used for a load area and a work area for programs executed by the CPU 301. The storage device 304 is a storage device such as a flash memory, and stores user data of each user. The wireless short-range communication I / F 305 is an interface that provides a short-range wireless communication function, and is, for example, Bluetooth (trademark). The wireless medium range communication I / F 306 is an interface that provides a medium range wireless communication function, such as Wi-Fi (trademark). A wired communication I / F 307 is a wired interface for connecting the MMP to a PC, and is, for example, a USB. The operation element 308 is a switch for giving various instructions to the MMP. The display 309 is a display device for displaying various information provided on the external panel of the present MMP. The sound source 310 generates a digital musical tone signal in response to an instruction from the CPU 301. The audio decoder 311 decodes the given audio data in accordance with an instruction from the CPU 301 and outputs it as a digital acoustic signal. The sound system 312 converts a digital sound signal output from the sound source 310 or the audio decoder 311 into an analog sound signal and emits the sound.

  FIG. 4 shows a configuration example of user data for each user.

  FIG. 4A shows user data of each user held in the SNS server 102. The user data in the SNS server 102 includes personal information, best friend list, friend list, music content, mail data, diary data, and the like. The personal information includes a user ID that identifies the user, player IDs 1 to 3, a user name, and the like. The player IDs 1 to 3 are IDs that specify the MMP possessed by the user. Here, up to three MMPs can be registered per user. The best friend list includes the user ID of the user's best friend and additional date / time data indicating the date / time when the user was added as a best friend. Further, since the user ID once deleted from the best friend list may be recovered again as the best friend, the deleted best friend user ID and the date and time of deletion are stored. In addition, the user who is in the best friend relationship is registered as a best friend in the mutual friend list, and the first user registers the second user as the best friend, but the second user is the first friend. It is not possible that the user is not a best friend. In this example, up to five people can be registered as best friends. This is because such a small number of people can legally share content within the scope of personal use. The friend list is a list of user IDs of the user's friends. The music content indicates content data stored in the network storage given to the user. Mail data and diary data are mail and diary data that the user uses in the SNS.

  FIG. 4B shows a configuration of user data in the MMP possessed by each user. This user data includes personal information, a best friend list, and music content. The personal information is information such as a user ID of a user who owns the MMP, a player ID that identifies the MMP, and a user name. The best friend list is the same as the best friend list in the SNS server of the user described with reference to FIG. The music content indicates content data stored in a local storage in the MMP, and is music content data that can be reproduced independently by the MMP.

  FIG. 5 shows a form in which music content is played back by each user's MMP. FIG. 5A shows a form in which the music content read by the user from his / her local storage is played. This corresponds to a case where the user plays music content stored in the storage means (local storage) in the MMP with his / her MMP. FIG. 5B shows a form in which the music content read by the user from his / her network storage is played. This corresponds to the case where the user receives the music content read from the storage area (network storage) in the SNS server 102 assigned to the user using his / her own MMP using the medium-range wireless communication function and performs streaming playback. . FIG. 5C shows a form in which the music content read out from the best friend's network storage by the user is played. This corresponds to the case where the user receives the music content read from the storage area in the SNS server 102 assigned to his / her best friend by using his / her MMP using the mid-range wireless communication function and performs streaming playback. FIG. 5D shows a form in which the music content read by the user from the local storage of the best friend is played. This corresponds to the case where the user receives the music content read from the storage area in the MMP of his / her best friend using the short-range wireless communication function and performs streaming playback with his / her MMP.

  FIG. 6 is a flowchart showing a procedure for registering a best friend by a PC. Here, a case will be described as an example where user A issues a request to user B to become a best friend.

  In step 601, the user A inputs a request that the user A wants to be a close friend with the user B on the PC 103 of the user A. At this time, if five best friends are already registered in the best friend list of the user A, the user A is allowed to designate one of the five best friends as a deletion reserved user. If the user B approves to become a best friend, the deletion reservation user is deleted from the best friend list, and the user B is registered in the best friend list. When the user B refuses to become a best friend, the deletion reservation user remains a best friend. Of course, if there is a vacancy in the user A's best friend list, there is no need to designate a deletion reserved user.

  In step 601, the user A's PC 103 transmits the request to the SNS server 102 via the network 101. In step 602, the SNS server 102 that has received the request transmits a message (email) indicating that there is a request from the user A to become a close friend with the user B, to the PC 104 of the user B. User B receives the message at his / her PC 104, and sends an approval or rejection response to the request to the SNS server 102 at step 603. The SNS server 102 receives the answer and determines in step 604 whether the answer is approved or rejected.

  In the case of approval, in step 605, the SNS server 102 updates the best friend lists of the user A and the user B (FIG. 4A). This is a process of registering user B in user A's best friend list and registering user A in user B's best friend list. In step 606, the SNS server 102 notifies the user A's PC 103 of the update. User A's PC 103 receives and displays the notification in step 609. When the answer of the user B is rejected in step 604, the SNS server 102 restores the user ID reserved for deletion to the original best friend in step 607 (step 607 is skipped when there is no deletion reserved user). In step 608, the PC 103 of the user A is notified that the reply from the user B is rejected. The user A's PC 103 receives and displays the notification in step 609.

  FIG. 7 shows an example of a screen when user A issues a request to become a best friend with user B in step 601 of FIG. User A uses his / her PC 103 to connect to the SNS server 102 via the network 101 and displays a screen for registering / updating his / her friend and best friend. Reference numeral 701 denotes an example of a screen displayed on the user A's PC 103. 711 is a list display of all users, 714 is a list display of best friends of the user A, and 715 is a list display of friends of the user A. A friend button 712 and a best friend button 713 are displayed corresponding to each user in the all user list display 711. The user A can register the user as a friend by turning on the friend button 712 of the user who wants to be a friend. Further, by turning on the best friend button 713 of a user registered as a friend, the user can be registered as a friend.

  It is assumed that the user A has turned on the best friend button 713 of the user B in the all user list display 711. At this time, if the registered number of the user A's best friend list is less than five, it means that the best friend list is empty, so the user A's PC 103 displays a message 705 and displays a message 705 from the user A to the user B. A request for friend registration is transmitted to the SNS server 102. The transmission of this request corresponds to the transmission of the request in step 601 in FIG.

  When the registered number of the user A's best friend list is five, a list 703 of the user A's best friends is displayed as shown on the screen 702, and the user A is designated to be deleted. Reference numeral 731 denotes a delete reservation button for each best friend. When the user A turns on the delete reservation button 731 of the user X who is a best friend, the user A's PC 103 displays a screen 704 and transmits a request for the best friend registration from the user A to the user B to the SNS server 102. The transmission of this request corresponds to the transmission of the request in step 601 in FIG.

  FIG. 8 shows a screen example when the user B's PC 104 receiving the message transmitted by the SNS server 102 in step 602 of FIG. The message transmitted from the SNS server 102 to the PC 104 of the user B in step 602 is a mail as indicated by 801 in FIG. User B who has received this mail 801 uses his / her PC 104 to connect to the URL (SNS server 102) described in the mail 801. When there is an access request for this URL, the SNS server 102 recognizes that the user B has accessed to answer the friend registration request from the user A, and checks the number of registered users in the friend list of the user B. To do. When the registered number is less than 5, the SNS server 102 returns the screen 811 to the PC 104 of the user B. The user B turns on the NO button 813 when rejecting the registration as the best friend of the user A. In this case, the user B's PC 104 displays a message 815 and transmits a “reject” reply to the SNS server 102. This answer corresponds to the part of sending a rejection answer in step 603 of FIG.

  When the user B approves the registration as the best friend of the user A on the screen 811, the YES button 812 is turned on. In this case, the PC 104 of the user B displays a message 814 and transmits an “approval” response to the SNS server 102. This answer corresponds to the part for sending the approval answer in step 603 of FIG. The SNS server 102 that has received the approval reply performs the processing of steps 605 and 606 in FIG. A message 809 shows an example of an email that is a notification sent to the user A by the SNS server 102 in step 606, and particularly shows an example of an email when the user A has reserved deletion of the user X. An OK button 810 is displayed in the mail. When the user A turns on the OK button 810, the user A's PC 103 notifies the SNS server 102 of the fact, and the SNS server 102 receives the notification and receives the user A The user X that has been reserved for deletion is deleted from the list of best friends, and an email indicating that is sent to the user X.

  Although the method for realizing the deletion reservation processing is arbitrary in the data structure of the user friend's best friend list shown in FIG. 4A, here, the best friend user ID reserved for deletion from the current best friend list is shown. , Move to the deleted best friend user ID1 column at the top of the deleted list (deleted best friend user ID1 to ID4 before this move are copied to the deleted best friend user ID2 to ID5 columns, respectively, and delete the deleted best friend user ID1 column) If the deletion is confirmed, the deletion date and time of the deleted best friend user ID1 is set, and when the user is restored without deleting, the user ID of the deleted best friend user ID1 may be returned to the current best friend list (deleted best friend user ID2 ID5 is also returned to the deleted best friend user ID1 to ID4). Alternatively, when a deletion reservation flag is provided for each best friend user in the current best friend list, the flag is turned on when the deletion is reserved, and when the deletion is confirmed, the best friend user whose flag is turned on is deleted and revived without being deleted. May return the flag to OFF.

  When the registered number of the user B's best friend list is 5, the SNS server 102 returns a screen 802 to the user B's PC 104. Reference numeral 803 denotes a list display of the best friend of the user B, and a delete button 831 is displayed for each best friend. User B turns on delete button 831 for the best friend to be deleted and turns on YES button 804. Now, assume that the delete button 831 of the user Y is turned on. User B's PC 104 notifies the SNS server 102 to that effect. In response to the notification, the SNS server 102 deletes the user Y from the best friend list of the user B, newly registers the user A, and transmits an email indicating that the user Y is deleted from the best friend list of the user B to the user Y. In this case, it is assumed that the SNS server 102 also performs a process of deleting the user B from the best friend list of the user Y. The user B's PC 104 displays a message 807 and transmits an “approval” response to the SNS server 102. This answer corresponds to the part for sending the approval answer in step 603 of FIG. The subsequent processing procedure is the same as that described in the message 814 and thereafter.

  When the user B turns on the cancel button 805 on the screen 802, the screen 802 is deleted and the friend registration process is cancelled. In this case, it is necessary to redo the processing from the received mail 801 again. When the user B turns on the NO button 806 on the screen 802, the PC 104 of the user B displays a message 808 and transmits a “reject” reply to the SNS server 102. This answer corresponds to the part of sending a rejection answer in step 603 of FIG.

  FIG. 9 shows a process for registering a best friend in the MMP. When the users A and B want to register as close friends with each other on the go, first, in steps 901 and 911, the near field communication function is used to connect the MMPs, and in steps 902 and 912, personal information (see FIG. 4B). Exchange of the personal information in the indicated MMP that is permitted to be disclosed to others). In step 903, a request to be a close friend with user B is transmitted from the MMP of user A to the MMP of user B using the short-range communication function. In step 913, the user B's MMP that has received the request returns an approval or rejection response. In step 904, the MMP of the user A who has received the reply checks whether the answer is approval or rejection. If it is approved, in step 905, user B is added to the best friend list in the user A's MMP (FIG. 4B), and in step 906, a message indicating that the update has been made is displayed, and the process is terminated. If rejected in step 904, that effect is displayed in step 907, and the process is terminated. In the MMP of the user B, in step 914, it is checked whether the returned answer is approval or rejection. If it is approved, in step 915, user A is added to the best friend list in user B's MMP (FIG. 4B), and the process ends. If the answer is refusal, the process ends. When five best friends have already been registered in the best friend list in the MMP, it is assumed that the user selects a best friend to be deleted and creates a vacancy in the best friend list for registration.

  FIG. 10 shows the process of synchronizing the best friend list. Since the registration of the best friend by the PC in FIG. 6 and the registration of the best friend by the MMP in FIG. 9 are performed completely independently, the content of the best friend list in the SNS server 102 and the content of the best friend list in the MMP are determined for a certain user. May be different. Therefore, when the MMP becomes communicable with the SNS server (for example, when the user connects his / her MMP to his / her PC or when the MMP connects to a hot spot of the wireless LAN 109), the synchronization processing of FIG. Synchronize your best friend list. This synchronization processing may be executed when the user instructs from the MMP side, or may be automatically executed when the MMP and the SNS server 102 are connected.

  In step 1001, the MMP transmits the synchronization request and the best friend list in the own MMP to the SNS server 102. In step 1011, the SNS server 102 compares and updates the received best friend list with the user's best friend list in the SNS server 102. This process is performed when the best friend user ID registered in the best friend list in the MMP and the best friend user ID registered in the best friend list of the SNS server 102 are merged. As a result of the merge, the number of best friends exceeds five. Is a process in which the best friend user IDs for five new addition dates are used as the best friend list, and the other best friend user IDs are deleted. If the best friend list is updated in step 1011, the updated best friend list may need to be updated. In step 1012, the process is performed. In step 1013, the updated best friend list is transmitted to the MMP. In step 1002, the MMP receives the best friend list, stores it in the MMP, and ends.

  FIG. 11 shows the process of updating the best friend list on the PC and updating the best friend list during synchronization. This process is executed by the SNS server 102 when the best friend list is updated in step 605 of FIG. 6 and the updated best friend list of the best friend also needs to be updated. For example, when user B is deleted from the best friend list of user A, it is necessary to delete user A from the best friend list of user B, and such processing is performed in FIG. Further, even when the best friend list is updated in step 1011 of the synchronization processing in FIG. 10, it may be necessary to update the updated best friend list on the user side. In that case, the processing of FIG.

  In step 1101, it is determined whether deletion from the update target best friend list has occurred. This is to determine whether or not deletion from the best friend list is executed in step 605 or step 1011. When deletion has occurred, in step 1102, the deletion cause user (that is, a user having the friend list that has been deleted in step 605 or 1011 as user data) is deleted from the deleted user's best friend list. . In step 1103, the deleted user is notified by e-mail that the user has been deleted due to the circumstances of the user who caused the deletion. If no deletion has occurred in step 1101, the process proceeds to step 1104.

  In step 1104, it is determined whether an addition to the update target best friend list has occurred. This is to determine whether the addition to the close friend list is executed in step 605 or 1011. When the addition has occurred, in step 1105, the additional cause user (that is, the user having the friend list that has been added in step 605 or step 1011 as user data) is added to the added user's best friend list. . In step 1106, the added user is notified by e-mail that it has been added as a best friend of the additional cause user. If no deletion has occurred in step 1104, the process ends.

  FIG. 12 shows reproduction processing by MMP. When the user instructs the MMP to play back, the MMP checks in step 1201 whether communication by wireless LAN is possible. If possible, in step 1202, music content (stored in the user's network storage and stored in the user's best friend's network storage) from the SNS server 102 by the communication (medium-range wireless communication) ) List. In step 1203, it is checked whether communication by short-range wireless communication is possible. If possible, in step 1204, a list of music contents (stored in the local storage in the MMP of the best friend) is acquired from the MMPs of all the close friends by the short-range wireless communication.

  Next, in step 1205, a content list is displayed. This is a process for displaying the music content stored in the local storage in the local MMP and the music content list acquired in steps 1202 and 1204 together. When the user selects a song that the user wants to reproduce from the displayed list in step 1206, reproduction is started in step 1207. This playback is a process of reading and playing the music content stored in the local storage in the local MMP as it is, and the music stored in the local storage in the SNS server 102 or another user's MMP. If the content is to be reproduced, it is a process of reproducing by a streaming reproduction process described later with reference to FIG.

  FIG. 13 shows a display example when the music content list is displayed in step 1205. When displaying by storage, first, as shown in FIG. 13A, in addition to the self MMP, information specifying the storage from which the list is acquired in step 1202 or 1204 is displayed as a menu. When the user selects one of these storages, a list of music content in that storage is displayed. FIG. 13B shows a list display example of music contents by song. The storage in which the song is stored is displayed for each song.

  FIG. 14 shows a music content list acquisition process from the SNS server 102 using the medium-range communication function executed in step 1202 of FIG. In step 1411, the MMP transmits the user ID and player ID to the SNS server 102. In step 1401, the SNS server 102 receives them and searches for user personal information in which the user ID is registered. In step 1402, it is checked whether or not the player ID is registered in the personal information of the searched user ID. If it is not registered, the process proceeds from step 1403 to 1408, and a warning that the user or MMP is not registered is transmitted to the MMP. The MMP receives the warning and proceeds from step 1412 to 1414 to display the warning.

  If registered in step 1403, in step 1404, a friend list synchronization process (FIG. 10) is performed to match the contents of the friend list in the MMP with the contents of the user's friend list in the SNS server. Next, in step 1405, a list of music contents in the user data of the user is created, and in step 1406, a list of music contents in the user data of the user registered in the user's best friend list is created. In step 1407, the created music content list is transmitted to the MMP. The MMP receives the list at step 1413.

  FIG. 15 shows a music content list acquisition process from the MMP of the best friend using the short-range communication function executed in step 1204 of FIG. In step 1511, the self MMP transmits the user ID to another MMP. In step 1501, the other MMP determines whether the received user ID is registered in the best friend list in the other MMP. If not registered, in step 1504, a warning is transmitted from the other MMP. The self MMP receives the warning and proceeds from step 1512 to step 1514 to display the warning. If registered in step 1501, a list of music contents stored in the other MMP is created in step 1502, and the list is transmitted to the own MMP in step 1503. The local MMP receives the list in step 1513.

  FIG. 16 shows processing for streaming playback of music data of the SNS server 102 among the playback processing executed in step 1207 of FIG. In step 1601, the MMP requests the SNS server 102 to stream the selected song. In step 1611, the SNS server 102 that has received the request performs streaming distribution of the song data. In step 1602, the MMP receives the distributed music data and performs streaming playback. The same applies to the case where music data in another MMP owned by the best friend user is received and streamed by the own MMP.

  In the above embodiment, the number of people who can be registered as best friends is up to 5, but the number is arbitrary as long as it can be interpreted as being within the range of personal use. In addition, when registering a new best friend with the number of registrations that can be registered in the best friend list, the user is allowed to specify the best friend to be deleted. You may decide the best friend to delete. For example, deleting a close friend with few exchanges such as e-mail. When deleted from the best friend list, it is preferable to leave it as a friend.

  In the above embodiment, when streaming playback of music between MMPs, a request is issued from the MMP of the user who wants to listen to the music to the MMP of the user who provides the music. It may not be a form. For example, if it is confirmed that MMPs are connected to each other and are close friends with each other, one MMP may select a song and transmit it to the other MMP for streaming delivery for playback.

  Moreover, although the said embodiment demonstrated the example which shares a music content, not only a music content but this invention is applicable to various multimedia data.

Overall system configuration diagram of social networking system of embodiment The block diagram which shows the outline of the hardware constitutions of a SNS server Block diagram showing outline of hardware configuration of MMP The figure which shows the structural example of the user data for every user The figure which shows the form which reproduces | regenerates music content by MMP Flow chart showing the procedure for best friend registration The figure which shows the example of a screen at the time of issuing the request | requirement that the user A wants to become the best friend with the user B The figure which shows the example of the screen when the user who receives the request answers Flow chart of best friend registration process in MMP Flow chart of best friend list synchronization process Flow chart showing processing for updating the best friend list and updating the best friend list during synchronization Flow chart showing playback processing by MMP The figure which shows the example of a display at the time of displaying the list of music contents Flow chart of music content list acquisition processing from SNS server Flowchart of music content list acquisition processing from MMP Flowchart of processing for streaming playback

Explanation of symbols

  DESCRIPTION OF SYMBOLS 101 ... Wide area network, 102 ... SNS server, 103, 104, 105 ... PC of each user, 106A, 107A, 108A, 106B, 107B, 108B ... Portable media player (MMP).

Claims (10)

  1. A social networking system comprising a server connectable via a network and each user device, and providing a communication service between users for which a friendship or close friendship is set,
    The server
    The multimedia data of each user is stored in a storage area provided for each user who uses the user device, and a close friendship relationship is set between predetermined users within a predetermined number of people that can be considered as a range for personal use. Storage means for storing relational information representing what is being done;
    When an access request is transmitted from the user equipment, the multimedia data stored in the storage area of the user who uses the user equipment, and the storage area of the user in which the friendship relationship with the user is set Means for allowing access to the recorded multimedia data,
    The user equipment is
    A social networking system comprising: means for issuing an access request for multimedia data stored in the storage means of the server.
  2. A social networking system comprising a server connectable via a network and a portable media player of each user, and providing a communication service between users for which a friendship or a close friendship is set,
    The server
    The multimedia data of each user is stored in a storage area provided for each user who uses the portable media player, and the user is assigned to each user within a predetermined number of people that can be considered as a range of personal use. Storage means for storing a best friend list, which is a list of user IDs for identifying users for whom a best friend relationship is set between
    When a playback request is transmitted from the portable media player, the multimedia data stored in the storage area of the user who uses the portable media player, and the storage area of the user in which a close friend relationship with the user is set Means for allowing access to multimedia data stored in
    Means for streaming the multimedia data permitted to be accessed to a portable media player that has issued the playback request;
    The user equipment is
    Means for issuing a reproduction request for multimedia data stored in the storage means of the server;
    A social networking system comprising: means for reproducing multimedia data that the server performs streaming distribution in response to the reproduction request.
  3. The social networking system according to claim 2,
    The portable media player is:
    A means of communicating with other portable media players;
    Means for storing a best friend list, which is a list of user IDs for identifying a user who has a close friend relationship with the user of the portable media player;
    Means for storing multimedia data of the user of the portable media player;
    It is checked whether the user of the other portable media player to be communicated has a close friend relationship with the user of the own portable media player. If the user is in a close friend relationship, the multimedia data stored in the own portable media player is transferred to the other portable media player. A social networking system comprising: means for streaming distribution to a player.
  4. The social networking system according to claim 3.
    The portable media player is:
    Means for setting a best friend relationship between a user of the portable media player and a user of another portable media player;
    Means for adding the set best friend relationship to the best friend list stored in the portable media player;
    The server
    In a state where communication with the portable media player is possible, the best friend list stored in the portable media player and the best friend list of the user of the portable media player stored in the storage means in the server are synchronized. A social networking system comprising: means.
  5. The social networking system according to claim 3.
    The server
    In a state where communication with the portable media player is possible, the best friend list stored in the portable media player and the best friend list of the user of the portable media player stored in the storage means in the server are synchronized. A social networking system comprising: means.
  6. A control program executed on a server in a social networking system that includes a server connectable via a network and each user device, and provides a communication service between users for which a friendship or a close friendship is set ,
    To the server,
    The multimedia data of each user is stored in a storage area provided for each user who uses the user device, and a close friend relationship is set between predetermined users within a predetermined number of people that can be considered as a range of personal use. Storing relationship information indicating that
    When an access request is transmitted from the user equipment, the multimedia data stored in the storage area of the user who uses the user equipment, and the storage area of the user in which the friendship relationship with the user is set A control program for a social networking system, comprising: allowing access to the multimedia data that has been made.
  7. A control program executed on a server in a social networking system that includes a server connectable via a network and a portable media player of each user, and provides a communication service between users for which a friendship or close friendship is set Because
    To the server,
    The multimedia data of each user is stored in a storage area provided for each user who uses the portable media player, and the user is assigned to each user within a predetermined number of people that can be considered as a range of personal use. Storing a best friend list that is a list of user IDs for identifying users for whom a best friend relationship is set between
    When a playback request is transmitted from the portable media player, the multimedia data stored in the storage area of the user who uses the portable media player, and the storage area of the user in which a close friend relationship with the user is set Allowing access to multimedia data stored in
    And a step of streaming the multimedia data permitted to be accessed to a portable media player that has issued the reproduction request.
  8. And a portable media player can connect server and each user via the network uses, in a social networking system that provides communication services between those users, a control program executed by the portable media player ,
    The portable media player;
    A means of communicating with other portable media players;
    It is a best friend list that is a list of user IDs for identifying users who have a close friend relationship with a user of the portable media player, and the close friend relationship is a predetermined number of people within a range of personal use that can be considered as a range of personal use. A best friend list storage means for storing a best friend list as relationship information set between users ;
    Means for storing multimedia data of the user of the portable media player;
    It is checked whether the user of the other portable media player to be communicated has a close friend relationship with the user of the own portable media player. If the user is in a close friend relationship, the multimedia data stored in the own portable media player is transferred to the other portable media player. Means for streaming to the player ;
    In a state in which communication with the server is possible, the best friend list stored in the best friend list storage means of the portable media player and the portable media player stored in a storage area provided for each user of the server users of the friend list, the portable media player control program in a social networking system, characterized in that to function as a means for synchronizing.
  9. The control program for a portable media player according to claim 8,
    The portable media player;
    Means for setting a best friend relationship between a user of the portable media player and a user of another portable media player;
    A program for controlling a portable media player in a social networking system, characterized in that the set friendly friend function functions as means for adding to the best friend list stored in the portable media player.
  10. The control program for a social networking system according to claim 7,
    To the server,
    In a state where communication with the portable media player is possible, the best friend list stored in the portable media player and the best friend list of the user of the portable media player stored in the storage means in the server are synchronized. A control program for a social networking system, characterized by causing a step to be executed.
JP2006306012A 2006-11-10 2006-11-10 Social networking system and control program thereof Active JP4882686B2 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP2006306012A JP4882686B2 (en) 2006-11-10 2006-11-10 Social networking system and control program thereof

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
JP2006306012A JP4882686B2 (en) 2006-11-10 2006-11-10 Social networking system and control program thereof
EP07120319A EP1921577A1 (en) 2006-11-10 2007-11-09 Social networking system
CN 200710165952 CN101179462A (en) 2006-11-10 2007-11-09 Social networking system
US11/938,385 US20080114834A1 (en) 2006-11-10 2007-11-12 Social networking system

Publications (2)

Publication Number Publication Date
JP2008123233A JP2008123233A (en) 2008-05-29
JP4882686B2 true JP4882686B2 (en) 2012-02-22

Family

ID=39405559

Family Applications (1)

Application Number Title Priority Date Filing Date
JP2006306012A Active JP4882686B2 (en) 2006-11-10 2006-11-10 Social networking system and control program thereof

Country Status (2)

Country Link
JP (1) JP4882686B2 (en)
CN (1) CN101179462A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2014162920A1 (en) 2013-04-01 2014-10-09 Necカシオモバイルコミュニケーションズ株式会社 Information terminal, access system, information processing method, and program

Families Citing this family (34)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP4893694B2 (en) * 2008-06-02 2012-03-07 日本電気株式会社 Information processing apparatus, information processing method, and program
US20090327035A1 (en) * 2008-06-28 2009-12-31 Microsoft Corporation Media content service for renting jukeboxes and playlists adapted for personal media players
US8719258B2 (en) * 2008-08-20 2014-05-06 Yahoo! Inc. Information sharing in an online community
US20100241580A1 (en) * 2009-03-19 2010-09-23 Tagged, Inc. System and method of selecting a relevant user for introduction to a user in an online environment
KR101562972B1 (en) 2009-03-26 2015-10-26 삼성전자 주식회사 Picture jointing apparatus and method providing differential picture according to jointing level
JP5452055B2 (en) * 2009-03-31 2014-03-26 株式会社バンダイナムコゲームス Network system, server, program, and information storage medium
US20100262550A1 (en) * 2009-04-08 2010-10-14 Avaya Inc. Inter-corporate collaboration overlay solution for professional social networks
US9277021B2 (en) * 2009-08-21 2016-03-01 Avaya Inc. Sending a user associated telecommunication address
EP3301592A1 (en) 2009-08-21 2018-04-04 Samsung Electronics Co., Ltd. Shared data transmitting method, server, and system
EP2479702A4 (en) 2009-09-17 2016-04-13 Fujitsu Ltd Base station, web application server, system and method
KR101629257B1 (en) * 2009-09-28 2016-06-10 엘지전자 주식회사 Mobile terminal and method for searching people
KR101666031B1 (en) * 2009-11-12 2016-10-14 한국전자통신연구원 Method for contents sharing based on Social Networking Service(SNS)
WO2011080549A1 (en) * 2009-12-28 2011-07-07 Telefonaktiebolaget Lm Ericsson (Publ) A social web of objects
US8666826B2 (en) * 2010-02-12 2014-03-04 Microsoft Corporation Social network media sharing with client library
US20110258556A1 (en) * 2010-04-16 2011-10-20 Microsoft Corporation Social home page
CN101841491A (en) * 2010-05-01 2010-09-22 深圳市专才信息技术有限公司 Social network-based system and method for establishing contact relationship
WO2012046670A1 (en) * 2010-10-05 2012-04-12 日本電気株式会社 Personal-information transmission/reception system, personal-information transmission/reception method, personal-information provision device, preference management device, and computer program
US8694656B2 (en) * 2010-11-09 2014-04-08 Sony Corporation System and method for creating a viewing social network
KR101232855B1 (en) * 2010-12-07 2013-02-13 경북대학교 산학협력단 Social network system for sharing resources, method of building and maintaining the same
US20120158935A1 (en) * 2010-12-21 2012-06-21 Sony Corporation Method and systems for managing social networks
CN102082740A (en) * 2010-12-29 2011-06-01 北京开心人信息技术有限公司 Method and system for adding friends in invitation link mode
KR101729633B1 (en) 2011-03-03 2017-04-24 삼성전자주식회사 Apparatus and method for sharing contents of social network service in communicatino system
CN102915309B (en) * 2011-08-03 2016-05-11 腾讯科技(深圳)有限公司 In JICQ, good friend is closed tethers matching process and equipment
US9069856B1 (en) * 2011-11-04 2015-06-30 Google Inc. Evaluating access control list data for a social network
JP6064376B2 (en) 2012-06-06 2017-01-25 ソニー株式会社 Information processing device, computer program, and terminal device
JP2014021949A (en) * 2012-07-24 2014-02-03 Seiko Epson Corp Service providing system, service management device, and information processing method of service management device
CN103812753B (en) * 2012-11-07 2018-05-22 腾讯科技(深圳)有限公司 A kind of social networks exchange method and application platform
CN103002020B (en) * 2012-11-15 2016-07-06 广州酷狗计算机科技有限公司 Music sharing method and system thereof
CN103078855B (en) * 2012-12-29 2016-07-06 四川长虹电器股份有限公司 A kind of realize equipment access method, Apparatus and system
KR101818004B1 (en) 2013-02-01 2018-01-15 한국전자통신연구원 Apparatus and method for sharing data
CN104283761A (en) * 2013-07-05 2015-01-14 深圳中兴网信科技有限公司 Friend list maintenance method, client, server and system
CN104010033A (en) * 2014-05-26 2014-08-27 上海大学 Data transmission system and method of user request response in mobile social network
CN104679833B (en) * 2015-02-06 2019-11-08 贵阳语玩科技有限公司 Realize the method and device of user interaction
CN105991411A (en) * 2015-02-13 2016-10-05 深圳积友聚乐科技有限公司 Social method and social network system

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6976028B2 (en) * 2001-06-15 2005-12-13 Sony Corporation Media content creating and publishing system and process
JP2003085084A (en) * 2001-09-12 2003-03-20 Sony Corp Contents delivery system and method, portable terminal, delivery server, and recording medium
US8302164B2 (en) * 2004-07-22 2012-10-30 Facebook, Inc. Authorization and authentication based on an individual's social network
JP2006185257A (en) * 2004-12-28 2006-07-13 J Brain:Kk Device and program for limiting browsing web page

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2014162920A1 (en) 2013-04-01 2014-10-09 Necカシオモバイルコミュニケーションズ株式会社 Information terminal, access system, information processing method, and program

Also Published As

Publication number Publication date
CN101179462A (en) 2008-05-14
JP2008123233A (en) 2008-05-29

Similar Documents

Publication Publication Date Title
US9883254B2 (en) Adding to a remote playlist
US9967246B2 (en) Cloud queue access control
US10235012B2 (en) Method and apparatus for providing recommendations to a user of a cloud computing service
US8880714B2 (en) Method and system for use in coordinating multimedia devices
US10097893B2 (en) Media experience social interface
US9798457B2 (en) Synchronization of media interactions using context
US9218413B2 (en) Venue-related multi-media management, streaming, online ticketing, and electronic commerce techniques implemented via computer networks and mobile devices
US8935279B2 (en) Venue-related multi-media management, streaming, online ticketing, and electronic commerce techniques implemented via computer networks and mobile devices
JP6313736B2 (en) Apparatus, method, product, and method performed by mobile device for providing chart of content items
US8752195B2 (en) Information processing apparatus and method, recording medium, and program
US10575056B2 (en) System and method for sharing user content through a set-top box
KR101595628B1 (en) System and method for sharing event information using icons
US20170178034A1 (en) Automated, conditional event ticketing, reservation, and promotion techniques implemented over computer networks
US20140289283A1 (en) System and method for audio and video portable publishing system
US8756304B2 (en) Relationship based presence indicating in virtual area contexts
USRE46258E1 (en) Communication terminals, systems, methods, and computer program products for publishing, sharing and accessing media files
Kruse Local identity and independent music scenes, online and off
KR101505335B1 (en) System and method for providing video clips, and the creation thereof
KR101694478B1 (en) Media asset recommendation service
Edmond All platforms considered: Contemporary radio and transmedia engagement
US9449523B2 (en) Systems and methods for narrating electronic books
JP2016048584A (en) Networked system supporting media access and social networking
KR100998792B1 (en) Communication system and method, information processing apparatus and method, information managing apparatus and method, recording medium, and program
US20160105519A1 (en) Identifying Highly Valued Recommendations Of Users In A Media Recommendation Network
US20160173642A1 (en) System And Method For Generating A Call For Media In A Communication System

Legal Events

Date Code Title Description
A621 Written request for application examination

Free format text: JAPANESE INTERMEDIATE CODE: A621

Effective date: 20090918

A977 Report on retrieval

Free format text: JAPANESE INTERMEDIATE CODE: A971007

Effective date: 20110817

A131 Notification of reasons for refusal

Free format text: JAPANESE INTERMEDIATE CODE: A131

Effective date: 20110822

A521 Written amendment

Free format text: JAPANESE INTERMEDIATE CODE: A523

Effective date: 20111021

TRDD Decision of grant or rejection written
A01 Written decision to grant a patent or to grant a registration (utility model)

Free format text: JAPANESE INTERMEDIATE CODE: A01

Effective date: 20111108

A01 Written decision to grant a patent or to grant a registration (utility model)

Free format text: JAPANESE INTERMEDIATE CODE: A01

A61 First payment of annual fees (during grant procedure)

Free format text: JAPANESE INTERMEDIATE CODE: A61

Effective date: 20111121

FPAY Renewal fee payment (event date is renewal date of database)

Free format text: PAYMENT UNTIL: 20141216

Year of fee payment: 3

R150 Certificate of patent or registration of utility model

Ref document number: 4882686

Country of ref document: JP

Free format text: JAPANESE INTERMEDIATE CODE: R150

Free format text: JAPANESE INTERMEDIATE CODE: R150