The present invention relates to a method of two-way information exchange for a system for making friends, whereby preconceptions due to a person's appearance can be reduced.
With the advent of the internet, communication between people is not limited by residences. Everyone can immediately communicate with persons living in remote areas through the internet. Due to the trend and convenience of the internet, some internet software providers offer a platform, through which people can exchange their thoughts, so as to increase the internet traffic flow of the web site and gather a lot of information about the preferences and use habits of customers for getting commercial benefits.
Existing internet software require users to provide their photos. Since people tend to select a person by appearance, users may modify their photos for being accepted by their counterparts more easily. As a result, existing internet software cannot provide a fair platform for information exchange.
In some existing internet software, a screening mechanism is implemented by asking questions provided from a client who desires to make friends. If the answers from a person match with the standard of the client, the person may obtain the photo of the client for further information exchange. The screening mechanism is too simple and cannot afford a two-way communication. In addition, a person may figure out the thought of the client to give the answers expected by the client. Therefore, the client fails to know whether the counterpart is a true friend or not.
To prevent persons from being limited or even rejected due to their looks, the present invention provides a method of two-way information exchange for a system for making friends, which can provide a fair platform for information exchange. With the method of the present invention, a client allows access to the counterpart only after the communication between both parties has reached a threshold of time, so that people inclined to make friends by appearance can be reduced, thus alleviating the foregoing problem of the existing internet software.
One object of the present invention is to provide a method of two-way information exchange for intelligent communication devices, which allows a requesting client to be paired with a primary target client blended with a plurality of false target clients, so that the appearance of each client does not play an important role in making friends, and thus more fair information exchange can be achieved.
Another object of the present invention is to provide a method of two-way information exchange for intelligent communication devices, wherein communication between two clients has to reach a threshold of time to be granted with a delete privilege, so that the time and depth of the communication can be increased.
A further object of the present invention is to provide a system for conducting two-way information exchange through intelligent communication devices, whereby the time and depth of communication between both parties can be increased, and thus a fair platform for information exchange can be established.
The method of the present invention comprises: (a) the server receives a connection request and exchange conditions provided from a requesting client by way of an intelligent communication device; (b) the server searches a data storage device for at least one client (primary target client), who is online and meets the exchange conditions; (c) the server searches the data storage device for a plurality of clients (false target clients), who meet the exchange conditions as well; (d) the server connects the primary target client with the requesting client through the intelligent communication device to start a communication activity, and the server sends data of the primary target client and data of the false target clients to the intelligent communication device of the requesting client; (e) the server grants the requesting client a delete privilege when the requesting client communicating with the primary target client reaches a threshold of time; and (0 the server deletes at least one of the false target clients and then sends data of the remaining false target clients and data of the primary target client to the intelligent communication device of the requesting client when receiving a delete request from the requesting client.
Furthermore, for allowing clients to have more options, the method may be provided before step (a) with step (g): the server stores personal data provided from clients, including the requesting client, the primary target client and the false target clients, to the data storage device for registration; the step (e) of the method may further include: the server stores points unused by the requesting client to the data storage device, or the server further grants the requesting client one or more delete privileges corresponding to points unused by the requesting client; the step (e) of the method may further include: the server grants the requesting client a gift privilege; the method may be provided after step (f) with step (f1): the server receiving a request from the requesting client who seeks to continue communicating with the primary target client of step (b) after the communication activity is terminated; the method may be provided between step (e) and step (f) with step (i): the server grants the requesting client at least one replacement privilege, and the server replaces the primary target client with another client and re-executing step (e) when receiving a replacement request from the requesting client.
The system of the present invention may comprise at least one intelligent communication device and information exchange processing equipment. The intelligent communication device has at least one display screen. The information exchange processing equipment includes at least one data storage device, which can store data provided from a plurality of clients, and at least one server connected with the data storage device. The server can receive exchange conditions provided from the requesting client using the intelligent communication device. The server can search the data storage device for at least one client (primary target client), who is online and meets the exchange conditions, and can search the data storage device for a plurality of clients (false target clients), who meet the exchange conditions_as well. The server can connect the primary target client with the requesting client through the intelligent communication device of the requesting client. The server can send data of the primary target client and data of the false target clients to the intelligent communication device of the requesting client. The server grants the requesting client a delete privilege when the requesting client communicating with the primary target client reaches a threshold of time. The server deletes at least one of the false target clients and sends data of the remaining false target clients and data of the primary target client to the intelligent communication device of the requesting client when receiving a delete request from the requesting client. Also, the server may include a statistical unit capable of calculating the count of information exchange of the requesting client communicating with the primary target client, and the server can send a symbol corresponding to the count of information exchange to the intelligent communication device of the requesting client.
The system of the present invention can offer a fair platform for clients who want to conduct information exchange through intelligent communication devices. Since the server of the system can select a primary target client blended with a plurality of false target clients, the both parties may have a fair chance of conducting information exchange with each other without being subject to their looks. Furthermore, the server may grant the requesting client a delete privilege when the requesting client communicating with the primary target client reaches a threshold of time. The server can delete one of the false target clients when receiving a delete request from the requesting client. The requesting client does not know which one of the target clients is the real client until all of the false target clients have been deleted. This way of showing multiple clients simultaneously on the intelligent communication device can increase the time of communication between the two clients, and can replace the method of information exchange employed in existing internet software, so that more in-depth information exchange and sharing can be achieved, and true interpersonal relationship can be established.
The foregoing and other features and advantages of illustrated embodiments of the present invention will be more readily apparent from the following detailed description, which proceeds with reference to the accompanying drawings.
The foregoing and other technical contents, features and advantages of the present invention will be illustrated in detail by way of exemplary embodiments with reference to the accompanying drawings. In the exemplary embodiments, same elements will be indicated by same numerals or labels.
In today's society, due to rapid technological development, intelligent communication devices, such as smartphones and tablet computers, can be used to search data on web promptly and play games, and particularly, with those communication devices, people can communicate with their friends or families around the world and share interesting things through the most interactive applications, such as Facebook or Line. Some internet application providers have developed application software for making friends, such as Pairs, i-Part, BeeTalk, and so on, so that persons engaged in talks via internet are not limited to their own circles of friends.
In using a commonly used internet application for dating or making friends, first of all, a user should register with a server of the application and upload his or her photos and personal information, and the user should provide the dating conditions to the server of the application after logging on the server. Next, the server of the application can search its database for persons who meet the dating conditions and; if a successful search is made, photos of the persons meeting the conditions can be sent to the smartphone of the user so that the user can select one person for communication. However, if the photos of the persons are not attractive, the user is likely to request the server of the application to replace them. Under this circumstance, the search result of the internet application is dominated by a person's appearance.
The present invention provides a solution to mitigate the disadvantages of the above existing applications.
In step 42, the server 121 searches the data storage device 122 for at least one online client (primary target client 321), who meets the exchange conditions provided by the requesting client 31. Also, the server 121 searches the data storage device 122 for a plurality of clients (false target clients 322) (for example: 5 clients), who meet the exchange conditions provided by the requesting client 31. In step 43, the server 121 sends the associated data (such as photos) of the primary target client 321 and the five false target clients 322 to the intelligent communication device 11 of the requesting client 31 so that the intelligent communication device 11 can simultaneously show six head portrait images or avatars (see
In this embodiment, the requesting client 31 is interpreted as a male, and thus the avatars of the primary target client 321 and the false target clients 322 shown on the display screen 111 of the intelligent communication device 11 are female. This means that the server 121 only informs the requesting client 31 of the primary target client 31 being among the six target clients; however, the requesting client 31 does not know which one of the six target clients is the primary target client 31. Therefore, in step 44, if one of the six avatars shown on the intelligent communication device 11 is pretty, the requesting client 31 is unlikely to reject the communication at once. Of course, the requesting client 31 has a right to cancel the communication at any time, or request the server 121 to replace the current primary target client 31 and to send a next primary target client together with a next group of false target clients.
While the requesting client 31 continues communicating with the unknown primary client 321, the requesting client 31 may have a nice talk with the primary target client 321 and want to see the primary target client 321 right now. In step 45, the server 121 checks whether the requesting client 31 is entitled to get a delete privilege according to the time records stored in the data storage device 122, and the server 121 may remind the requesting client 31 to redeem the points unused by the requesting client 31. Alternatively, the server 121 may store the points unused by the requesting client 31 to the data storage device 122, or the server 121 may further grant the requesting client 31 one or more delete privileges corresponding to the points unused by the requesting client 31. Alternatively, the server 121 may confer a delete privilege to the requesting client 31 when the requesting client 31 participates an activity, such as celebration of Valentine's Day. Upon receiving a delete request from the requesting client 31 (see step 48), the server 121 will randomly delete one of the five false target clients 322 (see step 49). As such, the display screen 111 of the intelligent communication device 11 can be updated to show a total of five avatars (see
In step 46, the server 121 checks whether the requesting client 31 in communication with the primary client 321 has reached a threshold of time, for example: 0.5 hour of communication; if the answer is “yes”, the server 121 will grant the requesting client 31 a delete privilege. If the requesting client 31 has to stop the communication, due to an unexpected situation, before reaching the threshold of 0.5 hour, the server 121 will exit step 46 and proceed to step 44; on the other hand, if the requesting client 31 has reached the threshold of 0.5 hour in communication with the primary target client 321, the server 121 will grant the requesting client 31 a delete privilege (step 47). In step 48, the server 121 checks whether the requesting client 31 has sent a delete request; if the requesting client 31 does not send a delete request, the server 121 will save the unused delete privilege of the requesting client 31 to the data storage device 122, and then proceed to step 44; if the server 121 has received a delete request from the requesting client 31, the server 121 will execute step 49, wherein one of the false target clients 322 will be deleted, and then the server 121 will proceed to step 50, wherein the server 121 will check whether all of the false target clients 322 have been deleted; if yes, the requesting client 31 can make sure the identity of the primary target client 321 (see step 51); otherwise, the server 121 will proceed to step 44.
In this embodiment, since a client can be granted with up to two delete privileges per day, the requesting client 31 has to communicate with the primary target client 321 for three consecutive days to allow the server 121 to delete all of the avatars of the false target clients 322 by repeatedly executing steps 44 through 49, and thus the avatar of the primary target client 321 can be made known to the requesting client 31, as shown in
Of course, those skilled in the art can understand that two randomly paired persons do not necessarily get favor from each other, and furthermore, the time of communication between the two persons is not the only basis or standard on which the server 121 decides to grant a delete privilege to the requesting client. The following paragraphs will illustrate a second embodiment of the present invention, wherein the parts same as the first embodiment are omitted.
Unlike the first embodiment, there are two additional steps 52′ and 53′. In step 52′ and step 53′, the server 121 can convert a delete privilege to a gift privilege and send a message of the associated gift to an intelligent communication device of the primary target client 321, after receiving a conversion request from the requesting client 31.
The above embodiments are used for illustrating the technical contents of the present invention, but not for limiting the scope of the present invention. The system and method of the present invention can have various modifications. As an example, after a requesting client has conducted information exchange with a primary target client and leaves the system, if the requesting client logs on the system on the next day for communicating with the same primary target client, the server may give a reward to the requesting client. As another example, when the information exchange between both parties reaches a level, the server may provide a game for them, wherein a graphic interface of the game can be sent to the display screen of the intelligent communication device of each client, and allows them to collaborate with each other to win the game. As a further example, when either client does not want to continue the information exchange, the server can give each of the two parties a right to replace the counterpart. As a still further example, the server can be provided with a statistical unit to calculate the count of information exchange of the requesting client communicating with the primary target client, and the count can be converted into a corresponding emotion symbol and send the symbol to the display screens of the intelligent communication devices of both parties.
With the method of the present invention, the requesting client cannot ensure which one of the photos is the real target client being communicated during a communication activity, so that users inclined to select their counterparts by appearance, can be avoided.
While the invention has been described with reference to the preferred embodiments above, it should be recognized that the preferred embodiments are given for the purpose of illustration only and are not intended to limit the scope of the present invention and that various modifications and changes, which will be apparent to those skilled in the relevant art, may be made without departing from the spirit and scope of the invention.
Number | Date | Country | Kind |
---|---|---|---|
105122498 A | Jul 2016 | TW | national |
Number | Name | Date | Kind |
---|---|---|---|
4173016 | Dickson | Oct 1979 | A |
5086394 | Shapira | Feb 1992 | A |
5963951 | Collins | Oct 1999 | A |
6052122 | Sutcliffe | Apr 2000 | A |
6061681 | Collins | May 2000 | A |
6073105 | Sutcliffe | Jun 2000 | A |
6256503 | Stephens | Jul 2001 | B1 |
6549768 | Fraccaroli | Apr 2003 | B1 |
6735568 | Buckwalter | May 2004 | B1 |
7055103 | Lif | May 2006 | B2 |
7085806 | Shapira | Aug 2006 | B1 |
7092914 | Shear | Aug 2006 | B1 |
7092952 | Wilens | Aug 2006 | B1 |
7203674 | Cohen | Apr 2007 | B2 |
7401098 | Baker | Jul 2008 | B2 |
7592910 | Tuck | Sep 2009 | B2 |
7599802 | Harwood | Oct 2009 | B2 |
7613706 | Terrill | Nov 2009 | B2 |
7676466 | Terrill | Mar 2010 | B2 |
7677970 | O'Kelley, II | Mar 2010 | B2 |
7702685 | Shrufi | Apr 2010 | B2 |
7752054 | Anthony-Hoppe | Jul 2010 | B1 |
7761386 | Teicher | Jul 2010 | B2 |
7818420 | Taylor | Oct 2010 | B1 |
7856360 | Kramer | Dec 2010 | B2 |
7882039 | Weiss | Feb 2011 | B2 |
7929951 | Stevens | Apr 2011 | B2 |
7949611 | Nielsen | May 2011 | B1 |
7958117 | Pettinati | Jun 2011 | B2 |
7970390 | Fraccaroli | Jun 2011 | B2 |
7970712 | Ruvolo | Jun 2011 | B2 |
8010459 | Buyukkokten | Aug 2011 | B2 |
8051013 | Terrill | Nov 2011 | B2 |
8060463 | Spiegel | Nov 2011 | B1 |
8073786 | Solari | Dec 2011 | B2 |
8117091 | Terrill | Feb 2012 | B2 |
8195668 | Drennan | Jun 2012 | B2 |
8209310 | Metcalfe | Jun 2012 | B1 |
8257178 | Shibahara | Sep 2012 | B2 |
8473490 | Bonilla | Jun 2013 | B2 |
8554794 | Brydon | Oct 2013 | B2 |
8583563 | Bonilla | Nov 2013 | B1 |
8615484 | Flinn | Dec 2013 | B2 |
8719354 | Granito | May 2014 | B2 |
8775324 | Zhu | Jul 2014 | B2 |
8868654 | Guha | Oct 2014 | B2 |
8935296 | Taylor | Jan 2015 | B2 |
9064262 | Ianni | Jun 2015 | B2 |
9298826 | Coldicott | Mar 2016 | B2 |
9536221 | Frind | Jan 2017 | B2 |
9537706 | Frind | Jan 2017 | B2 |
9563708 | Gang | Feb 2017 | B2 |
9652114 | Piccionelli | May 2017 | B2 |
9672289 | Frind | Jun 2017 | B1 |
9984386 | Bhatia | May 2018 | B1 |
9992648 | Pan | Jun 2018 | B2 |
10262039 | Ramanathan | Apr 2019 | B1 |
10366090 | Shorman | Jul 2019 | B2 |
20020160339 | King | Oct 2002 | A1 |
20040010608 | Piccionelli | Jan 2004 | A1 |
20040148347 | Appelman | Jul 2004 | A1 |
20040260781 | Shostack | Dec 2004 | A1 |
20050171955 | Hull | Aug 2005 | A1 |
20060059142 | Zvinyatskovsky | Mar 2006 | A1 |
20060059159 | Truong | Mar 2006 | A1 |
20060155566 | Berger | Jul 2006 | A1 |
20060242014 | Marshall | Oct 2006 | A1 |
20080086534 | Bardak | Apr 2008 | A1 |
20090024548 | Zhu | Jan 2009 | A1 |
20090094048 | Wallace | Apr 2009 | A1 |
20100070577 | Relyea | Mar 2010 | A1 |
20100185580 | Zhu | Jul 2010 | A1 |
20100262611 | Frind | Oct 2010 | A1 |
20110219310 | Robson | Sep 2011 | A1 |
20120059850 | Bent | Mar 2012 | A1 |
20140156750 | De Cristofaro | Jun 2014 | A1 |
20160132972 | Fetzer | May 2016 | A1 |
20190058683 | Morrison | Feb 2019 | A1 |
20190318520 | Fletcher | Oct 2019 | A1 |
Number | Date | Country | |
---|---|---|---|
20180020079 A1 | Jan 2018 | US |