Dynamic computer systems and their use

Through the distributed communication network and the weighting mechanism of favorability function, the real-time and relevance problems of content propagation in dynamic networks are solved, and efficient content distribution and user preference matching are achieved.

CN111797047BActive Publication Date: 2024-11-26THE MICHAEL HARRISON TRETTER AUERBACH TRUST
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202010663343.1
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Priority Date
2014-10-12
Filing Date
2015-05-11
Publication Date
2024-11-26
Estimated Expiration
2035-05-11

AI Technical Summary

Technical Problem

Existing computer systems are difficult to spread content in real time on the location proximity of client computers connected to the network in a dynamic network through the location proximity of networks, and lack effective content recommendation and distribution mechanisms.

Method used

A computer system was designed that connects multiple client computers through a distributed communication network, uses the favorability function to weight and distribute content based on parameters such as proximity, voting, distance, time, etc., and stores and Present content to ensure that the distribution and presentation of content meets user preferences and network bandwidth limitations.

Benefits of technology

Real-time and proximity weighted distribution of content is realized, the relevance and user experience of content is improved, and network bandwidth requirements are controlled, ensuring effective dissemination and storage of content.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN111797047B_ABST
    Figure CN111797047B_ABST
Patent Text Reader

Abstract

Dynamic Computer Systems and Uses Thereof. The present invention relates to computer systems specifically adapted for disseminating content in substantially real time over a dynamic network by proximity of location of client computers connected to the network. Preferably, the content will also be proximity weighted, and more preferably also rank weighted, topic weighted, time weighted, query weighted, vote weighted, and / or location weighted. The present invention particularly relates to such computer systems employing more than one such weighting. The invention particularly relates to such computer systems, which operate particularly for distributed computing applications, including social media applications and communication applications, conducted over a restricted computer network, using or through a mobile device.
Need to check novelty before this filing date? Find Prior Art

Description

[0001] This application is a divisional application of the Chinese national phase patent application with international application number PCT / US2015 / 030147, international application date May 11, 2015, and invention name “Dynamic computer system and its use”, which entered the Chinese national phase on November 18, 2016 and has application number 201580026328.3.

[0002] CROSS-REFERENCE TO RELATED APPLICATIONS

[0003] This application claims priority to U.S. Patent Application Nos. 62 / 000,015 (filed May 19, 2014; pending) and 14 / 512,442 (filed October 12, 2014), each of which is hereby incorporated by reference in its entirety. Background of the Invention Field of the Invention

[0005] The present invention relates to computer systems specifically adapted for disseminating content in substantially real time over a dynamic network based on the location proximity of network-connected client computers. Preferably, the content will also be proximity-weighted, and more preferably also rank-weighted, topic-weighted, time-weighted, query-weighted, vote-weighted, and / or location-weighted. The present invention particularly relates to such computer systems employing one or more such weightings. The present invention particularly relates to such computer systems operating using or through mobile devices, particularly for distributed computing applications, including social media applications and communication applications, conducted over a constrained computer network.

[0006] Related technical description

[0007] Online social media services, such as social networking sites, search engines, news aggregators, and blogs, provide users with a rich environment for commenting on events of interest and communicating with other users. Examples of social media services include:43 Blauk, Blogster, Bolt.com, Eons.com, Experience Project, Exploroo, Focus.com, Friendica, Friends Reunited, MEETin, My ReverbNation.com, Spaces, Stage Talkbiznow, TravBuddy.com, Travelerspoint, tribe.net, and

[0008] Proximity analysis of social networks has been used in advertising and marketing, for example, to allow businesses to more effectively market their products and services to users (see, for example, U.S. Patent No. 8,306,921 and U.S. Patent Publication Nos. 2009 / 015747, 2009 / 0204600, 2011 / 0196801, 2012 / 0084807, 2012 / 0084811, and 2012 / 0136723 and PCT Publication Nos. WO 2011 / 097510 and WO 2013 / 052081). Conversely, methods for sharing multimedia that measure the distance (“hops”) between sending and receiving computers have been developed, providing a measure of the level of interest in the multimedia by members of the social network (with multimedia having a greater hop distance indicating a higher level of interest) (see, for example, U.S. Patent No. 8,260,882 and U.S. Patent Publication No. 2009 / 0157845). Proximity analysis has been proposed as a means for providing enhanced safety oversight (see, for example, U.S. Patent Nos. 2009 / 0292549 and 2010 / 0036875). Methods for sharing information associated with event locations are disclosed in U.S. Patent Nos. 8,204,759 and 8,510,383 and U.S. Patent Publication Nos. 2011 / 0066743 and 2011 / 0131144. U.S. Patent Publication Nos. 2011 / 02387463 and 2011 / 0282793 describe social networks in which participants seek help or the behavior of others near a user.

[0009] Content recommendation systems have been described that allow users to identify friends in their current or planned future geographic locations, or to recommend content or activities to friends (see, for example, U.S. Patent No. 8,108,414 and U.S. Patent Publication Nos. 2011 / 0288912, 2012 / 0124059, 2013 / 0218967, 2013 / 0267251, and 2014 / 0047357; and PCT Publication No. WO 2013 / 126293).

[0010] Examples of computer system architectures for social networking or for location determination are described in U.S. Patent Nos. 7,818,394, 7,831,684, 7,844,671, 7,949,611, 8,073,807, 8,108,414, 8,219,500, 8,224,727, 8,266,145, 8,311,289, 8,341,162, 8,407,282, 8,419,611, 473,386, 8,473,500, 8,489,516, 8,495,095, 8,504,507, 8,521,180, 8,554,868, 8,566,605, 8,601,378, 8,607,146, 8,612,869, and 8,620,828, and in U.S. Patent Publication Nos. 2014 / 0052544, 2014 / 0052795, and U.S. 2013 / 0073473, and in European Patent Publication No. EP 2151793, and in PCT Publication Nos. WO 2013 / 154679, WO 2013 / 170082, WO 2013 / 181662, WO 2013 / 184407, and WO 2013 / 184957. In particular, such a computer system architecture may have a server-centric architecture (e.g., U.S. Patent Nos. 8,676,667, 8,695,077, 8,694,579, 8,693,982, 8,693,464, 8,683,565, 8,670,414, 8,677,418, 8,676,934, 8,667,081, 8,662,386, 8 ,656,421、8,647,207、8,635,499、8,630,867、8,599,848、8,601,265、8,606,930、8,615,010、8,612,646、8,619,822;8,583,781、8,577,954、8,582,727、8,560,939、8,571,526, etc.) or a point-to-point architecture (e.g., U.S. Patent Nos. 8,694,587, 8,693,484, 8,693,431, 8,693,392, 8,693,391, 8,690,050, 8,689,307, 8,688,803, 8,688,801, 8,688,789, 8,688,780, 8,688,7 79, 8,688,111, 8,688,038, 8,687,536, 8,683,551, 8,682,495, 8,677,017, 8,676,925, 8,676,882, 8,676,855, 8,676,165, 8,671,208, 8,671,202, 8,671,188, etc.).

[0011] Methods for searching, sorting, and grouping data in response to user-defined criteria and displaying the data on computers and mobile devices have also been described (see, for example, European Patent Publication Nos. EP 2441039, EP 2452247, and EP 2569716, U.S. Patent Nos. 8,091,032 and 8,145,637, and U.S. Patent Publication Nos. 2010 / 0045705, 2010 / 0082618, 2011 / 0238408, 2013 / 0127748, 2013 / 0182963, 2013 / 0218902, 2014 / 0046955, 2014 / 0052281, and 2014 / 0053228 and PCT Publication Nos. WO 2010 / 144766, WO 2011 / 005318, WO 2011 / 119171 and WO 2011 / 021202).

[0012] Despite all of these advantages, a need exists for a computer system specifically adapted to propagate content over a dynamic network in substantially real time based on the location proximity of client computers connected to the network. This invention addresses this need and others. Summary of the Invention

[0013] The present invention relates to computer systems specifically adapted for disseminating content in substantially real time over a dynamic network based on the location proximity of network-connected client computers. Preferably, the content will also be proximity-weighted, and more preferably also rank-weighted, topic-weighted, time-weighted, query-weighted, vote-weighted, and / or location-weighted. The present invention particularly relates to such computer systems employing one or more such weightings. The invention particularly relates to such computer systems operating using or through mobile devices, particularly for distributed computing applications, including social media applications and communication applications, conducted over a constrained computer network.

[0014] Specifically, the present invention provides a computer system for distributing content between interconnected client computers, wherein the computer system includes: two or more client computers digitally interconnected to form a distributed communication network, wherein:

[0015] (A) each of the interconnected client computers includes: means for inputting data; means for receiving content provided by another client computer; means for providing content to another client computer; computer-addressable memory for storing content and programming instructions; and a processor for processing data and for executing the programming instructions;

[0016] (B) client computers are interconnected with each other directly or through one or more other client computers; and

[0017] (C) Each of the interconnected client computers receives content from and / or provides content to another of the interconnected client computers, thereby distributing such content over the distributed network.

[0018] The present invention additionally relates to a computer system in which client computers of the computer system store received content in a content stack memory; wherein in response to an increase in the favorability value of the content, the content stored in the content stack memory goes up, and in response to a decrease in the favorability value, the content stored in the content stack memory goes down, wherein the favorability value is determined by a favorability function that takes into account client-selected or network-selected favorability parameters such that the amount or quantity of content stored in the content stack memory and provided to other client computers of the network is maintained within available processing and bandwidth parameters.

[0019] The present invention additionally relates to a computer system wherein a client computer of the computer system presents a subset of stored content to a user thereof, wherein the presented content is stored in a presentation stack memory; wherein the content stored in the presentation stack memory:

[0020] (A) Raising in presentation stack memory in response to:

[0021] (1) an increase in proximity between a content-receiving client computer and a content-providing client computer that is providing such content;

[0022] (2) the content's favorability value increases; and

[0023] (3) changes in weighted preferences applied by the content-receiving client computer to increase the user's desirability for such content; and

[0024] (B) In response to the following, the presentation stack memory is dropped:

[0025] (1) a decrease in proximity between a content-receiving client computer and a content-providing client computer that is providing such content;

[0026] (2) the content's favorability value decreases; and

[0027] (3) a change in the weighted preference applied by the content receiving client computer to reduce the user's expectations for such content;

[0028] The number or amount of content stored in the presentation stack memory of the client computer is maintained within user-selected parameters.

[0029] The present invention additionally relates to any computer system wherein the favorability parameters of a selected client or a selected network include one or more of the following favorability parameters: vote, distribution, distance, hop distance, time, and premium.

[0030] The present invention additionally relates to a computer-implemented method for distributing content between interconnected client computers, wherein the method comprises:

[0031] (A) digitally interconnecting three or more client computers via a distributed communications network to form a computer system, wherein:

[0032] (1) Each of the interconnected client computers includes: means for inputting data; means for receiving content provided by another client computer; means for providing content to another client computer; computer-addressable memory for storing content and programming instructions; and a processor for processing data and for implementing the programming instructions;

[0033] (2) wherein the client computers are interconnected with each other directly or through one or more other client computers such that content received from and / or provided to another of the interconnected client computers is provided to all other interconnected client computers of the distributed network;

[0034] (B) providing content to one of the interconnected client computers and allowing the distributed network of client computers to distribute such content over the network.

[0035] The invention additionally relates to a computer-implemented method in which a client computer of a computer system stores received content in a content stack memory; wherein in response to an increase in the favorability value of the content, the content stored in the content stack memory is increased, and in response to a decrease in the favorability value, the content stored in the content stack memory is decreased, wherein the favorability value is determined by a favorability function that takes into account a client-selected or network-selected favorability parameter such that the amount or quantity of content stored in the content stack memory and provided to other client computers of the network is maintained within available processing and bandwidth parameters.

[0036] The invention additionally relates to a computer-implemented method wherein a client computer of a computer system presents a subset of stored content to a user thereof, wherein the presented content is stored in a presentation stack memory; wherein the content stored in the presentation stack memory:

[0037] (A) Raising in presentation stack memory in response to:

[0038] (1) an increase in proximity between a content-receiving client computer and a content-providing client computer that is providing such content;

[0039] (2) the content's favorability value increases; and

[0040] (3) changes in weighted preferences applied by the content-receiving client computer to increase the user's desirability for such content; and

[0041] (B) descending in the presentation stack memory in response to:

[0042] (1) a decrease in proximity between a content-receiving client computer and a content-providing client computer that is providing such content;

[0043] (2) the content's favorability value decreases; and

[0044] (3) a change in the weighted preference applied by the content-receiving client computer to reduce the user's expectations for such content;

[0045] The number or amount of content stored in the presentation stack memory of the client computer is maintained within user-selected parameters.

[0046] The invention additionally relates to any of the computer-implemented methods wherein the client-selected or network-selected favorability parameter comprises a favorability parameter selected from the group consisting of: voting, distribution, distance, hop distance, time, and premium.

[0047] The present invention additionally relates to such a computer system or such a computer-implemented method, wherein the client-selected or network-selected favorability parameters include: two or more, three or more, four or more, five or more of the above-mentioned favorability parameters.

[0048] The present invention additionally relates to such a computer system or such a computer-implemented method, wherein the client-selected or network-selected favorability parameters include the favorability parameters: distance and time.

[0049] The present invention additionally relates to any such computer system or any such computer-implemented method, wherein the presented content is weighted based on a weighting selected from the group consisting of: rank weighting, topic weighting, time weighting, query weighting, vote weighting, and location weighting.

[0050] The present invention additionally relates to any such computer system or any such computer-implemented method in which the presented content is weighted based on more than one weighting, wherein at least one of such additional weightings is selected from the group consisting of: rank weighting, topic weighting, time weighting, query weighting, vote weighting, and location weighting.

[0051] The present invention additionally relates to such a computer system or such a computer-implemented method in which a client computer of the computer system votes to approve or disapprove received content, or provides related content, and provides the vote or related content to another client computer.

[0052] The present invention additionally relates to such a computer system or such a computer-implemented method, wherein the network additionally comprises a content monitoring client computer.

[0053] The invention additionally relates to such a computer system or such a computer-implemented method, wherein the network comprises a restricted computer network. BRIEF DESCRIPTION OF THE DRAWINGS

[0054] Figure 1 A schematic diagram illustrating interconnected client computers of the distributed computer system of the present invention.

[0055] Figure 2 Figure 1 illustrates a data race.

[0056] Figures 3A-3B 1 illustrates how the memory stacks of two client computers (client computer 1 of user A and client computer 2 of user B) change in response to the sharing of the contents of the memory stacks of the two client computers.

[0057] Figures 4A-4B Illustrated is the ability of the present invention to use proximity weighting.

[0058] Figure 5 An illustrative text entry screen for a touch screen mobile phone or tablet client computer device is presented.

[0059] Figure 6 Illustration of the user interface of a touch screen phone or tablet client computer device.

[0060] Figure 7 The illustration shows the capabilities of an example user interface that allows a user to perceive desired content.

[0061] Figure 8 The illustration shows how a person may manipulate an example user interface to perceive desired content, showing an illustrative topic conversation between attendees of a lecture.

[0062] Figures 9A-9C Illustrate use of an example user interface for categorizing and sorting content for presentation to a user on a touch screen mobile phone or tablet client computer device. Figure 9A The use of a sorting graphical element to group content for presentation to a user is shown. Figure 9B The use of drag and drop capabilities to group content for presentation to a user is shown. Figure 9C The use of a graphical element selection capability is shown to group content for presentation to a user.

[0063] Figures 10A-10B The present invention uses location weighting to form the most recent activity ( Figure 10A ) and level activities ( Figure 10B )’s “heat map” capabilities.

[0064] Figure 11 A user interface is shown utilizing the camera functionality of a client computer. Content is shown in generally positioned balloons (to preserve the anonymity of the content provider where not permitted) or in specifically positioned callouts to client computers whose users have granted identification permission to the recipient. DETAILED DESCRIPTION

[0065] The present invention is specifically designed to distribute content over a dynamic network in substantially real time based on the location proximity of network-connected client computers. Preferably, the content will also be weighted by proximity, and more preferably also by rank, topic, time, query, vote, and / or location. The present invention is particularly directed to such a computer system employing such weighting. The present invention is particularly directed to such a computer system operating using or through a mobile device, particularly for distributed computing applications, including social media applications and communication applications, conducted over a constrained computer network.

[0066] I. Preferred Computers for the Computer System of the Present Invention

[0067] The preferred computer of the computer system of the present invention is a "client computer," which will preferably have means for inputting data, means for receiving and providing data to other interconnected client computers of a network, a computer (or machine) addressable memory configured to store content and / or store programming instructions, and a computer "processor" configured to process data (including content) and implement programming instructions.

[0068] Programming instructions stored on a client computer (or otherwise provided to such a client computer) enable the client computer to provide content to other client computers on a public network (acting as a distributed server), receive content provided from other client computers on a public network, and preferably store (permanently, temporarily, or for a user-set duration) content provided from other client computers connected to such a network. The programming instructions can be a computer "APP" stored in a memory, a firmware program, a computer program, etc. Alternatively, the client computer can connect to and join the computer system of the present invention by accessing a website, a LAN, a WLAN, etc. that communicates with the server.

[0069] Additionally, the programming instructions enable the client computer to determine the "proximity" between such client computer and other client computers in the public network based on the location location of such client computer and the location location of such other client computers. The location information can be manually entered (such as through an "app" or input interface), but more preferably, it will be automatically determined by the client computer (for example, using an internal or external global positioning system (GPS) receiver, or reference to cellular signal towers, or reference to fixed ground-based Internet access points, etc.). Preferably, the instruction set stored in the client enables such client to establish a searchable and / or sortable database of received content. The establishment of such a database enables each client to independently and dynamically present content to its user. The content is weighted by proximity and also weighted by topic ranking, topic keywords, time or location of interest.

[0070] Preferably, such client computers will also have output or presentation capabilities (e.g., video output (e.g., LCD or LED screen, etc.), and / or audio presentation (e.g., speakers, audio generator, etc.) so that the user of the client computer can perceive the provided and received content. However, the present invention includes client computers that do not have such output capabilities (e.g., client computers installed in cars, buildings (e.g., towers)), or client computers on drones, aircraft, ships, etc., the purpose of which is to extend the communication range of the computer network formed by the computer system of the present invention. However, such client computers may have output capabilities, so it is optional for such client computers to have such capabilities.

[0071] The client computer of the present invention will preferably be a mobile device such as a smartphone, laptop, tablet, smartwatch (e.g., Moto ), Optical Head-Mounted Displays (OHMD) (e.g., Google Oculus (Oculus / Facebook), sealed helmet visors, night vision goggles vision goggles), in-vehicle heads-up displays, and the like; see, for example, U.S. Patent Nos. 8,594,338; 8,536,776; 8,531,418; 8,487,233; 8,467,133; 8,436,788; 8,431,881; 8,384,999; 8,355,610; 8,269,159; 8,267,691; 8,138,991; 8,136,170; 7,841,026; 7,800,043; 7,791,809; 7,755,831; 7,710,654; 7,598,849; 7,530,704; 7,496,293, etc.). Although particularly well-suited for use with mobile devices that communicate with each other, the client computers of the computer system of the present invention may include any form of computer (including fixed desktop computers and servers). The communication range of the client computers of the present invention may be up to 50 feet, up to 100 feet, up to 250 feet, up to 500 feet, up to 0.25 miles, up to 0.5 miles, up to 1 mile, up to 2 miles, up to 5 miles, up to 10 miles, up to 20 miles, up to 50 miles, up to 100 miles, or more than 100 miles.

[0072] The users of the client computers of the present invention may be unrelated individuals, groups, or entities (such as people visiting a park, groups from different organizations, stores, businesses, etc.). Alternatively, the users of the client computers of the present invention may be related individuals, groups, or entities (such as medical, security, or emergency personnel responding to an accident or other event; or military personnel engaged in a common activity). For example, emergency rescue or other personnel responding to an incident (e.g., a burning building, etc.) may use the present invention to automatically maintain communication with each other (and specifically, to have the ability to automatically communicate with other responders located in their vicinity). Alternatively, as indicated above, the client computer may be installed in a car, building (e.g., a tower), drone, etc., and may not be participated in by any user.

[0073] II. Content Sharing by Client Computers of the Computer System of the Present Invention

[0074] As indicated above, the computer system of the present invention preferably includes: two or more client computers that are digitally interconnected, thereby forming a communication network that is capable of providing "content" to other client computers connected to the network and is capable of receiving "content" from other client computers connected to the network (collectively referred to as "shared" content).

[0075] As used herein, the term "content" is intended to include digital or analog communications related to a particular "topic" (e.g., subject, event, name, etc.). Each topic may have one or more subtopics ("threads"). Content is said to be "related" if it is about, pertains to, or is related to the same topic.

[0076] The term "content" may therefore include one or any combination of the following:

[0077] A: Text (e.g., comments, opinions, speeches, responses, polls, text messages, symbols, letters, emoticons, etc.), provided in, for example, ASCII, UTF-8, MIME, TXT, or other text character file formats. Such text message content will preferably include: short text messages (e.g., text messages with no more than 500 characters (e.g., letters, symbols, emoticons, etc.) no more than 300 characters no more than 200 characters no more than 150 characters, or most preferably, no more than 100 characters);

[0078] B: speech (e.g., recordings, songs, music, tones, notes, sound effects, street sounds, etc.), provided in the format of, for example, 3gp, aac, act, aiff, alac, amr, atrac (.wav), au, awb, dct, dss, dvf, flac, gsm, iklax, IVS, m4a, m4p, mmf, mp3, mpc, msv, ogg, opus, ra&rm, raw, vox, wav, wavpack, wma, or other types of audio files;

[0079] C: Images (e.g., pixel-based images, vector images, photographs, holograms, virtual reality images, 3D images, etc.) in, for example, JPEG / JFIF, JPEG 2000, Exif, TIFF, RAW, GIF, BMP, PNG, PPM, PGM, PBM, PNM, PFM, PAM, WEBP, HDR raster formats, RGBE, IFF-RGFX, JPEG XR (a new JPEG standard based on Microsoft HD Photo), TGA (TARGA), ILBM (IFF-type format for up to 32 bits in planar representation, plus optional 64-bit extensions, DEEP (IFF-type), AI, IMG (Graphics Environment Manager Image File; planar, run-length encoding), PCX (Personal Computer Exchange), ECW (Enhanced Compressed Wavelet), IMG (ERDAS IMAGINE Image), SID (Multiresolution Seamless Image Database, MrSID), CD5 (Chasys Draw Image), FITS (Flexible Graphics Transport System), PGF (Progressive Graphics File), XCF (eXperimental Computing Facility format (native GIMP format), PSD (Adobe Photoshop document), PSP (Corel Paint Shop Pro), VICAR file format (NASA / JPL image transmission format), HVD (Holographic Universal Disc), 3DM, 3DS, MAX 3DS, OBJ, A2C, B3D, BLEND, BR5, BR6, CCP, CG, CGFX, CHR, DAE, DAZ, DSF, DWF, FACEFX, FBX, FLT, FPF, IV, LND 3D, LWO, LWS, LXO, MA, MB, MDD, MXS, SDB, SHP, SKP, STP, U3D, VUE, PDF, or other image file formats;

[0080] D: Video (e.g., moving images, video images, movies, etc.), which is provided in, for example, 3GP, ASF, AVI, RIFF, DVR-MS, Flash Video (FL, F4V), IFF (first platform independent container format), Matroska (MKV), MJ2, QuickTime, MPEG (including MPEG-, MPEG-2, MPEG-TS and MPEG-4 Part 12), MP4, JPEG 2000 Part 12, Ogg, RM (RealMedia), vrcinema3D or other video file formats.

[0081] Preferably, such text, voice, image or video files will be less than 1GB, less than 500MB, less than 200MB, less than 100MB, less than 50MB, less than 20MB, less than 10MB, less than 5MB, less than 2MB, less than 1MB, less than 500KB, less than 200KB, less than 100KB, less than 50KB, less than 20KB, or less than 10KB in size.

[0082] As described above, the computers of the computer system of the present invention have the ability to receive content from other computers in the computer system, and preferably also have the ability to provide content to such other computers (e.g., the ability to "share content"). As used herein, the term "receiving content" refers to the ability of a client computer to receive, use, or otherwise access content that has been provided by another client computer in the computer system of the present invention, by any means. As used herein, the term "providing content" refers to the ability to send, transmit, retransmit, broadcast, or otherwise distribute or assign content, by any means, so that the content provided by one client computer is accessible or can be made accessible to other client computers in the computer system of the present invention. Such receiving and providing capabilities allow content to be distributed through and among client computers. Furthermore, such receiving and providing capabilities can be used to allow a server or content monitoring client computer (as discussed below) to perform content data mining on the client computer, or to perform content backups (e.g., continuously, automatically at periodic intervals, or manually upon request by a user of such client computer). If a client computer exits the network, such content backups may be desirable in order to recover unsaved content. Furthermore, such receiving and providing capabilities can be used to allow a server or content monitoring client computer or client computer to obtain a log of accessed content.

[0083] Most preferably, the client computer is directed to presenting the content to its user. As used herein, the term "presenting" content means displaying the content (e.g., in the case of content involving text, image, or video content, displaying such content on a screen, projection, or other visible output) or executing or playing the content (e.g., in the case of content involving speech). Preferably, such content will be provided in "real time" (i.e., with sufficient immediacy to provide such content to the receiving client at substantially the same actual time that such content is provided by the providing client). Alternatively, in embodiments in which content is stored (e.g., when a non-distributed computer system with a central server is used), historical content may be provided to allow the user to perceive content that has been provided earlier or during a user-selected time period in the past).

[0084] As discussed below, client computers may need to obtain permission or authorization to join the network of the present invention and may require additional permission or authorization before being able to provide content to other clients of the network. However, more preferably, a client computer will automatically join the network of the computer system of the present invention upon recognizing the presence of a second client computer, without requiring permission from such client computer or other client computers of such computer system. Although client computers of the computer system of the present invention can provide their respective user names or usernames to other client computers, it is preferred that users participating in a public network remain anonymous to other users. To facilitate understanding of content discussions, client computers can attribute transient tokens to content contributors. Thus, for example, a first user contributing content may be identified as "Anon01," and a second user contributing related content may be identified as "Anon02," and so on. Thus, users corresponding to "Anon01" and "Anon02" can converse anonymously with each other.

[0085] III. Preferred Network Configuration of the Computer System of the Present Invention

[0086] As indicated above, the computer system of the present invention includes two or more client computers that have been "networked," and are thus digitally interconnected. Two or more client computers that join the same network are referred to herein as joining a "public" network.

[0087] The communication network of the present invention may be of any type and may have any form of network architecture, including any of the following: a point-to-point network, a broadcast network, a wide area network, a local area network, a telecommunications network, a data communications network, a computer network, an ATM (Asynchronous Transfer Mode) network, a Synchronous Optical Network (Synchronous Optical Network) network, a switched fabric network (e.g., Switched fabric networks), SDH (Synchronous Digital Hierarchy) networks, wireless networks, and wired networks. The network of the present invention may include wireless links, such as channels, radio frequencies, or satellite frequency bands; or may include or contain wired (e.g., Ethernet, fiber optics, etc.) connections or non-wired connections (e.g., laser pulses, etc.). The network may have any topology (e.g., bus, star, or ring topologies, etc.).

[0088] The computer system of the present invention may be any topology known to those skilled in the art that can support the operations described herein. The network connected and included in the connection may include: the Internet, a local area network, a web server, a file server, a router, a database, a computer, a server, a network device, a mobile phone, or any other computing device capable of sending and receiving data, especially digital data. The computer system of the present invention may include: computing devices connected via cables, IR ports, wireless signals, or any other means of connecting multiple computing devices. The individual computers of the computer system of the present invention can communicate with each other via any communication protocol used for communication among or within computing devices, including, but not limited to, radio frequency, Bluetooth, SSL, HTML, XML, RDP, ICA, FTP, HTTP, TCP, IP, UDP, IPX, SPX, NetBIOS, NetBEUI, SMB, SMTP, Ethernet, ARCNET, Fiber Distributed Data Interface (FDDI), RS232, IEEE 802.11, IEEE 802.11a, IEEE 802.11b, IEEE 802.11g, IEEE 802.11n, and direct asynchronous connections, or any combination thereof. Most preferably, the client computers of the present invention will wirelessly join the network using any protocol or protocols used for communication between mobile devices, including AMPS, TDMA, CDMA, GSM, EDGE, GPRS, or UMTS, and participate in content sharing with other client computers of the present invention.

[0089] The network of the present invention can be a "non-distributed network" or a "distributed network." In a "non-distributed network" of the present invention, client computers provide content to a central computer (such as a server) and receive content from the central server. Individual client computers do not participate in distributing content; such distribution occurs when other client computers access the central computer and receive content from the central computer. In contrast, in a "distributed network" of the present invention, each client computer participating in the network mediates the distribution of received content to all other client computers participating in the network (and more preferably, to all other client computers participating in any network) that are within communication range, preferably without any gateway nodes. Content distribution by the distributed network of the present invention is accomplished by having the receiving client computer re-provide such content to such other client computers. Thus, in a non-distributed network of the present invention, content flows from a client computer to a central computer and then from the central computer to other client computers, and the virtual proximity of the client computers (that is, their connectivity to the same central computer) determines their ability to share content. In a distributed network of the present invention, content flows from one client computer to another by "hopping" across the network, preferably without any gateway nodes, and the locational proximity of the client computers determines their ability to share content. A distributed network is the preferred network for the present invention.

[0090] Distributed networks have been described previously in the context of “self-organizing” or “mesh” networks (see generally, Ahtiainen, A et al. (2009) “Awareness Networking In Wireless Environments,” Vehicular Technol. Mag. IEEE 4(3):48, 54; Li, J. et al. (2001) “Capacity of Ad Hoc Wireless Networks,” Proc. 7th ACM Intl. Conf. on Mobile Computing and Networking, Rome, Italy, July 2001(1-9); Broch, J. et al. (1998) “A Performance Comparison Of Multi-Hop Wireless Ad Hoc Network Routing Protocols,” MobiCom '98 Proceedings of the 4th Annual ACM / IEEE Intl. Conf. on Mobile Computing and Networking, pages 85-97; Niazi, M. et al. (2009). “Agent based Tools for Modeling and Simulation of Self-Organization in Peer-to-Peer, Ad Hoc and other Complex Networks, FeatureIssue,” IEEE Commun.Mag.47(3):163–173; Lee, S.-B. et al. (2013) “Content Management InA Mobile Ad Hoc Network: Beyond Opportunistic Strategy,” Intl.J.Commun.NetworksDistributed Syst.10(2):123-145; Steudi, P. et al. (2008) "Demo Abstract Ad Hoc SocialNetworking using MAND," Proc.14th Intl.Conf.on Mobile Computing and Networking (MobiCom'08) pp.1-3; Li, D.et al. (2013) "Opinion Impact Models and Opinion Consensus Methods in Ad Hoc Tactical Social Networks," Discrete Dynamics in Nature and Society (2013): Article ID 758079, pp. 1-6). However, the practicality of such existing networks has not yet been fully established. Network flows have been considered to be limited because the throughput available to applications on each individual node is limited by the forwarding load imposed by distant nodes (Li, J. et al. (2001) "Capacity of Ad Hoc Wireless Networks," Proc. 7. th ACM Intl. Conf. on Mobile Computing and Networking, Rome, Italy, July 2001(1-9). To address network flow issues, previously described ad hoc or mesh networks may be configured to include gateway nodes (see, for example, U.S. Patent Nos. 8,570,990, 8,690,381, 8,654,713, 8,681,655, and 8,638,686), or may limit the ability of nodes to send data in real time (see, for example, U.S. Patent Nos. 6,850,511, 7,002,944, and 8,625,544), or may involve specific packet routing protocols (see, for example, U.S. Patent No. 8,582,502), or involve other restrictions.

[0091] A. Operation of the Preferred Distributed Network of the Present Invention

[0092] As described above, the client computers of the computer system of the present invention preferably form a distributed network in which content provided by one client computer is received by a second client computer, and content from such second client computer is provided to further client computers, such that the network graph includes a set of client computer nodes, each of which communicates with an interlocking subset of the client computers of the distributed network, wherein the area covered by a particular subset reflects the communication range of the client computers ( Figure 1 ). Figure 1A schematic diagram of interconnected client computers is shown; for simplicity of illustration, only three subsets of client computers are shown (dashed circles). However, it should be understood that each client computer server is a node of a subset, so that a large number of interlocking subsets are formed. Client computers within a particular subset (e.g., the client computers of user A and user B in subset 1, or the client computers of user B and user C in subset 2) can provide content to each other and receive content from each other. Therefore, although user C is "out of range" of user A, the present invention allows user C and user A to share content with each other through user B's client computer. User B is within both subset 1 and subset 2, and is therefore within the range of user A and user C. Similarly, the distributed network formed by the present invention allows content to be exchanged and shared between all members of the network, even those located at the farthest distance from each other (e.g., user A and user Z).

[0093] This aspect of the invention allows its distributed network to be "dynamic." The distributed network dynamically and automatically adjusts to continue providing content to clients of the network. For example, Figure 1 In the example, the client computers of user A and user C can share content with each other through the client computer of user B. However, if user A were to move next to user Z, he would continue to be able to maintain the content shared with user C through the other user's client computer throughout such a trip. Indeed, within the communication range of their respective client computers, Figure 1 All users shown can move around freely without changing their content sharing capabilities or the content sharing capabilities of any other user. If at least one client computer is within communication range of another client computer, then the "coverage" of their common network can dynamically grow, change, or migrate in response to changes in the location of all other client computers. Thus, a significant benefit of the distributed network of the present invention is that content can be provided by users throughout the network for access by all other users of the network.

[0094] Users can choose not to perceive specific content, or they can choose to view content related to topics of interest. However, because the content selected is random with respect to what the user has chosen as interesting and is carried across the network, any responsive content creates the potential for a "data race." In response to the occurrence of data races, the present invention provides client computers with the ability to "weight" received content. Users can thus "vote" to promote or disapprove content received on their client computers, which then sends messages to other client computers updating the vote value for such content.

[0095] Therefore, later users may receive data that conflicts with the weighted content ( Figure 2 ). Figure 2 The diagram shows data race. Figure 2 As shown, user A provides content to the network. The content is received by users B, C, and D, who each vote (passively in the case of user B, and actively in the case of users C and D). The client computers of all three users provide the content to user D. In a data race, the first client computer that provides the content to the client computer of user D sets the weighting for the content. Data races can also arise from the provision of dual (or multiple) versions of content that have developed differences during routing on the network. For example, the same content can be provided to other client computers of the network (when it is being routed from one client computer to another on the network). A client computer can therefore, for example, receive content with n votes from one client computer and receive the same content with m votes from a different client computer.

[0096] Data races are not a desirable means of distributing content over the network of the present invention. In order to handle and resolve such data race issues, it is preferred that each client computer (and / or each user) has a unique identifier code. Preferably, each piece of content provided to the network will also have a unique identifier code. Preferably, therefore, when a user votes to promote or disapprove of particular content, the identifier code of the user or client computer is attached to the comment and saved on the user's client computer. When a "copied" version of content is received, or when a vote is received regarding such content, the user's client computer takes a union of the data such that a new version is created that includes the content and the union of the votes between the incoming version and the existing version of the comment (by the user or client computer identifier code). This new version is then provided to other client computers and the process is repeated (until the content "disappears" due to lack of votes or assigned client computers). Thus, in Figure 2In a data race scenario, in order to determine the weights used by user D and propagated by user D to other client computers, user D's client computer will merge the incoming votes. This property of the invention also allows the user to change his / her vote on a comment and allows the computer system to correctly compensate for the change. Due to this scheme, there will be at most N versions of the same content broadcast at a time (but each device will broadcast each content once), where N is the number of client computers, according to the Bellman-Ford algorithm, which proves the stability of the system (Bellman, R. (1958). "On A Routing Problem," Quarterly of Applied Mathematics 16:87-90; Ford, LR, Jr. (1956) "Network Flow Theory," Paper P-923. Santa Monica, California: RAND Corporation). Most preferably, when calculating the merge of data, the client computer weights the data by the proximity of the client computer providing the content, so that votes from nearby users will be counted more heavily than votes from more distant users.

[0097] Alternatively, the data race problem can be solved without requiring and storing unique user identifiers. In such a scenario, each client computer stores the number of received affirmative votes as N F , and store the number of disapproval votes received as N D When receiving a "copy" version of content, or when receiving a vote on such content, the user's client computer compares the most recently received upvote with the stored upvote count and stores the maximum number of upvotes as N F The client computer similarly compares the most recently received disapproval vote with the stored disapproval vote count and stores the maximum number of disapproval votes as N D When the client computer then provides such content to other client computers, it also provides such N F and N D .

[0098] Because distributed networks involve providing data between potentially a large number of client computers, their bandwidth requirements can increase exponentially with the number of client computers and the number of content topics being provided. A further attribute of the computer systems of the present invention is their ability to control such bandwidth requirements. This is preferably accomplished through the information and use of a "content stack". In this regard, the client computers will preferably be limited to providing / re-providing K content per iteration, where K is a positive integer set by the user based on the processing speed, memory attributes, and bandwidth accessibility of his / her client computer. When new content is received, such content is sorted into the content stack by its weight on the receiving client computer, and if necessary, due to memory or processing limitations, the smallest value in the content stack is removed from the client computer's content stack. Preferably, valuable content (e.g., content presented to the user of the client) is stored separately on the user's client computer (e.g., in the client computer's presentation stack) so that it will not be removed by mistake. If bandwidth is not limited, content exceeding K content per iteration can be provided to other client computers. Preferably, as long as bandwidth and / or processing power are not limited, such additional content will be provided to promote dynamic interaction between client computers, rather than similar Serial interaction (Twitter Inc.). The content stack differs from the presentation stack (described below) in size (typically holding more topics than presented to the user in the presentation stack) and content (typically holding content established by the network, e.g., according to the network's general terms of service (or, in the case of a restricted network, according to the restricted network's terms of service), so that the presentation stack holds content based on client computer preferences). The content stack will preferably store 50, 100, 200, 500, 1000, 5000 or more pieces of content.

[0099] In a preferred embodiment, the client computers of the computer system of the present invention store received content in their respective content stack memories, so that the amount of content (e.g., the number of topics, or the amount of memory allocated for content storage) can change in response to bandwidth and / or processing power. As content fills the content stack memory of the client computer, the bottom-most stack contents are pushed down until they fall off the stack and are no longer distributed to the network by the client computer.

[0100] The received content is initially sorted sequentially in the content stack memory of the receiving client computer based on its "favorability value" (see, for example, Bardala, V. et al. (2010) "A Novel Learning Based Solution For Efficient Data Transport In Heterogeneous Wireless Networks," Wireless Networks 16(6):1777-1798; Ramana, B.V. et al. (2008) "A Novel Learning Based Solution for Efficient Data Transport in Heterogeneous Wireless Network," High Performance Computing-HiPC 2008 Lecture Notes in Computer Science 5374:402-414; Bellavista, P. et al. (2007) "Context-Aware Handoff Middleware For Transparent Service Continuity In Wireless Networks," Pervasive and Mobile Computing 3(4):439-466), where content with higher favorability values ​​is placed above content with lower favorability values.

[0101] The favorability value of the content according to the present invention is expressed by the “favorability function” (“F favorability ), a "favorability function" is a function of a set of favorability parameter functions that are related to "favorability parameters" that the network has selected as relevant to favorability values. Thus, the favorability value of content (e.g., content N) is determined according to a favorability function that takes into account the client-selected or network-selected favorability parameters associated with such content:

[0102]

[0103] The favorability function can be static or can be updated. Such updates can be real-time to handle network traffic and capacity limitations.

[0104] Examples of favorability parameter functions include:

[0105] f votea function of a favorability parameter: votes, which weights the number of upvotes / downvotes received for the content; for example, the value of such a function increases as the relative number of upvotes for the content increases;

[0106] f dissemination a function of a favorability parameter: distribution, which weights the reach of the content's distribution on the network (e.g., the number of hops made by such content); for example, the value of such a function may increase as the reach of such content's distribution increases;

[0107] f distance a function of the favorability parameter: distance, which weights the distance between the content originator and the receiving client computer; for example, the value of such a function decreases as the distance between the content originator and the receiving client computer increases;

[0108] f hop-distance a function of a favorability parameter: a hop distance, which is added to the distance between the client computer providing such content and the receiving client computer; for example, the value of such a function increases as the distance between the content originator and the receiving client computer decreases;

[0109] f time a function of a favorability parameter: time, which weights the time interval between the time when the content is originated and the time when such content is received by the receiving client computer; and

[0110] f premium A function of the favorability parameter: premium, which weights the premium-enhanced favorability that the content can earn from commercial, government, social, or other weighted factors (e.g., corporate-sponsored content, advertising, emergency warnings);

[0111] So an exemplary favorability function for content would be:

[0112]

[0113] The favorability parameter function used in the favorability function can be independently linear, logarithmic, exponential, etc. For example, f vote The function may be applied to content such that, in response to an increase in the number of upvotes, the value of the function for such content increases linearly or exponentially, thereby increasing its distribution. dissemination A function may be applied to content such that the value of the function for such content increases linearly or exponentially in response to the extent of distribution of the content on the network, but decreases to allow new content to traverse the network. An inverse linear function, a negative exponential function applied to the content may be employed. distancefunction such that the value of the function for such content decreases to reflect the distance between the content originating and receiving client computers. hop-distance The function is applied to content such that the value of the function for such content may increase linearly or exponentially as the distance between the content originating and receiving client computers decreases, whereas the value of the function for content with a short hop distance or a substantially constant hop distance flattens or decreases. time The function is applied to content such that the value of the function for such content increases, possibly rapidly (e.g., linearly or exponentially), but then flattens or decreases (e.g., inverse linearly, negative exponentially, logarithmically, etc.) over time in order to expedite the distribution of new content and de-distribute older content. premium Functions may be applied to content to fully or partially "overweight" other favorability parameter functions. It will be appreciated that by selecting favorability parameters and favorability parameter functions, the present invention allows favorability functions to be set and adjusted to handle bandwidth and issues with network traffic.

[0114] Thus, when (or if) a client computer re-receives particular content, the position of the content in the content stack memory of such client computer can change to reflect the updated favorability value of the content on the network. For example, re-received content that is found to have acquired a higher (or lower) favorability value but has had less distribution can be given a higher content stack position than such content would be given to have more distribution. The favorability function ensures that content clusters (e.g., does not "cross" endlessly (and exponentially) across the network until it consumes all the bandwidth). As the range of its distribution increases, the function causes the favorability value of the content to decrease until it eventually falls from the content stack memory.

[0115] Thus, in summary, in response to an increase in the favorability value of the content, the content stored in the content stack memory increases, and in response to a decrease in the favorability value, the content stored in the content stack memory decreases, such that the amount or quantity of content stored in the content stack memory and provided to other client computers of the network remains within available processing and bandwidth parameters. Such parameters may additionally be used f premium The favorability value parameter function is used to prioritize (e.g., overweight) content received by a client computer that is provided by a sponsor (e.g., commercial sponsorship, advertising, etc.) or from a restricted computer network, so that such sponsored content or such received restricted computer network content can be preferentially provided to other client computers and therefore preferentially distributed on the distributed network.

[0116] Preferably, a client computer of the computer system of the present invention selects valuable or desirable content to be presented to a user of the client computer from the content received in its content stack memory. Such valuable or desirable content is preferably stored in the client computer's memory in a "presentation stack" memory such that the amount of content (e.g., the number of topics, or the amount of memory allocated to content storage) is user-controllable and changes in response to user-selected parameters (e.g., the user's content weighting preferences) and the receipt of new content. The content stored in the presentation stack memory is preferably determined by the proximity between the content-receiving client computer and the content-providing client computer that provided such content, by the content's favorability value, and by the weighted preferences applied by the content-receiving client computer, such that the number or quantity of content stored in the client computer's presentation stack memory remains within the user-selected parameters.

[0117] The contents stored in the presentation stack memory are thus:

[0118] (A) Raising in presentation stack memory in response to:

[0119] (1) an increase in proximity between a content-receiving client computer and a content-providing client computer that is providing such content;

[0120] (2) the content's favorability value increases; and

[0121] (3) changes in weighted preferences applied by the content-receiving client computer to increase the user's desirability for such content; and

[0122] (B) descending in the presentation stack memory in response to:

[0123] (1) a decrease in proximity between a content-receiving client computer and a content-providing client computer that is providing such content;

[0124] (2) the content's favorability value decreases; and

[0125] (3) a change in the weighted preference imposed by the content-receiving client computer to reduce the user's desire for such content;

[0126] The number or amount of content stored in the presentation stack memory of the client computer is maintained within user-selected parameters.

[0127] Most preferably, new topics (e.g., topics not previously provided to the client computer) that are consistent with the user's weighted preferences are initially placed at the top of the presentation stack upon their receipt, during which the user provides a vote to approve or disapprove of such content. The presentation stack preferably stores the 1, 5, 10, 20, 50, 100, etc., most discussed topics received by the client computer.

[0128] Although the content stack and presentation stack may be stored separately, it is preferred to combine the two stacks to form a single memory stack that internally distinguishes between presented content and other stored content.

[0129] Figures 3A-3B The diagram illustrates how the memory stacks of two client computers (client computer 1 of user A and client computer 2 of user B) change in response to the sharing of the contents of the memory stacks of the two client computers. Figure 3A As shown, both client computers have been instructed to display only five topics (e.g., their presentation stacks are set to display only the five most valuable or desired content). Content from client computer 1 is provided to client computer 2, but based on the instructions of user B, client computer 2 only presents topics that have been weighted. Non-presented content is preferably stored in the memory of client computer 2 (e.g., Figure 3A In gray, the content is presented to user B so that if user B's weighted preferences change, it can be easily presented to user B. Similarly, content from client computer 2 is provided to client computer 1, and topics are presented to user A based on user A's weighted preferences, and non-presented content is preferably stored in the memory of client computer 1 (e.g., Figure 3A gray), so that if user A’s weighted preference changes, it can be easily presented to user A. Figure 3B The diagram illustrates how the respective stacks of client computer 1 and client computer 2 are altered by sharing content between them. New content is added to the top of the stack, and existing content is repositioned in the stack or dropped from the presented content of the stack, reflecting the weighted preferences of the respective users.

[0130] Each upvote received by a particular content enhances its rank weighting and therefore enhances its ability to flow on the network. Likewise, receiving a downvote reduces the rank weighting of the content and therefore reduces its ability to flow on the network. Thus, content with higher upvotes will flow further than content with higher downvotes. As discussed above, a client computer can be configured to present to its users content related to the 1, 5, 10, 20, 50, 100, etc. most discussed topics received by the client computer. As particular content receives additional downvotes (or as other content receives additional more upvotes), such particular content will decrease in rank until it eventually falls from the stack of content presented to the user or stored by the client computer.

[0131] Preferably, the votes associated with a particular content and the physical distance between the content-providing client computer and the content-receiving client computer are used to determine whether to present the content to the user of the content-receiving client computer. Thus, if the distance from the content-providing client computer to the content-receiving client computer is greater than the rank weighting of the content, the content may be dropped and not added to the content of the content-receiving client computer.

[0132] like Figure 4A As shown, content provided by a remote user may not be relevant to content provided by nearby users. The proximity weighting properties of the present invention (discussed below) allow client computers located in close proximity to each other to exchange and share content, thereby providing a more relevant presentation of content ( Figure 4B ).

[0133] However, any user can use keywords (e.g., query weighting) so that content related to such a topic receives a higher ranking and is retained by the recipient's client computer. For example, if user A provides content "apple" with a vote of +10 to users B and C located 10 km away, then the content may be deleted by user B's client computer (and therefore not presented to user B); the content stack of user B's client computer will be adjusted accordingly to present the higher-ranked content. However, if user C has set a query weight for "apple", then the content will not be deleted by user B's client computer (and therefore will be presented to user C). Therefore, considering any user-provided topic weighting or query weighting instructions, determining whether received content will be presented / provided to other client computers (or, alternatively, dropped) preferably depends on the union of the relative location of the providing and content receiving client computers and the voting data for the content, as calculated by the content receiving client computer. The ability to share specific content among all members of the network depends on the ranking of such content, the distance between the client computers, and the ranking of other content provided to the recipient's client computer. Thus, while the computer system of the present invention has the ability to distribute specific content to all client computers of a network, the system (and / or its individual client computers) also has the ability to limit content distribution based on user-selected or system-determined weighted options.

[0134] B. Operation of the Preferred Non-Distributed Computer System of the Present Invention

[0135] The computer system of the present invention can be configured as a non-distributed computer system, such as a centralized or partitioned computer system. In such an embodiment, individual client computers provide central and regional servers with their respective user identifier codes, client computer identifier codes, location locations, and weighted preferences. Content and any votes associated with such content are provided to the servers, which then establish a centralized database accessible by the individual client computers and capable of presenting the received content to such client computers, the received content having been weighted according to each such client computer's respective proximity and other weighted preferences.

[0136] The use of a non-distributed computer system eliminates the possibility of data races, but requires interconnectivity (and preferably, real-time interconnectivity) between each individual client computer and a remote, and potentially distant, server.

[0137] IV. Open Computer Networks and Restricted Computer Networks

[0138] The distributed or non-distributed network of the present invention can be configured as a single open computer network or be configured to include one, two, three or more restricted computer networks. The computer network of the present invention can alternatively be configured to include both a single open computer network and such one, two, three or more restricted computer networks.

[0139] As used herein, an "open computer network" is one in which any client computer within communication range is automatically or preferably eligible to join upon requesting admission to the client and subjecting its user's agreement to general terms of service. As used herein, terms of service are interpreted as "general terms of service" if they are not specific to a particular user but require all users to be within communication range. Such general terms of service may include, for example, restrictions on the terms of copyrighted material, agreements allowing other clients to copy received content and provide such content to additional clients, restrictions on use, restrictions on the nature of content that may be provided, etc.

[0140] In contrast, a "restricted computer network" is one in which any client computer within communication range is automatically or preferably eligible to join upon requesting admission as a client and subjecting the agreement to the restricted computer network's terms of service. As used herein, terms of service are to be construed as "restricted computer network terms of service" if they are specific to a particular restricted computer network. For example, such restricted computer network terms of service may confidentially require or require terms of authentication credentials (e.g., passwords (, voice tones, digital keys, etc.) or biometric credentials selected by and associated with such restricted computer network (e.g., fingerprints, facial recognition matching, DNA matching, palm prints, hand geometry matching, iris recognition matching, retinal pattern matching, scent / olfactory matching, typing rhythm, gait, pitch / accent, voice recognition patterns, etc.).

[0141] Preferably, while only those clients that have been authenticated and accepted by the restricted computer network will be able to receive content provided by other clients of the restricted computer network, all clients within communication range of such accepted clients will be able to provide content to clients of the restricted computer network. Thus, both authenticated and unauthenticated clients facilitate the distribution of restricted computer network content among authenticated clients of the restricted computer network, even though such content is not perceived by users of unauthenticated clients. More preferably, only authenticated clients of the restricted computer network will be able to provide such restricted computer network content to other authenticated clients.

[0142] Clients of a restricted computer network can provide and receive "encrypted" content, which can then be decrypted by other clients of the restricted computer network. For example, the content can be encrypted using AES (128, 192, or 256 bits), Triple DES (2 or 3 keys), CAST5 (80 or 128 bits), and the like, and associated encryption keys (e.g., RSA keys, Diffie-Hellman keys, MQV keys, keys generated using elliptic curve algorithms, etc.), which are at the disposal of the clients of such a restricted computer network. Alternatively, the restricted computer network can provide and receive unencrypted content.

[0143] When the computer system of the present invention includes more than one network, the selection of which network the client computer will use to provide content can be established by the user of the client computer, or can be established by general terms of service (for open computer networks) or such restricted computer network terms of service (for one or more restricted computer networks). Alternatively, the network selection can be determined heuristically based on the user's preferred network selection. Alternatively, unless changed by the client's user, content received from a particular participating network automatically configures the receiving client to use the same network to provide corresponding content, whether open or restricted.

[0144] However, preferably, a client that has joined an open computer network and one or more of such additional restricted computer networks will provide its user with the option of providing content on any of such joined networks, for example, by using a "network selection signal" (NSS). The network selection signal can be an actual button, switch, slider, etc., or can be an on-screen icon of such a button, switch, slider, etc., or other signal or indication recognized by the client computer. The network selection signal can alternatively be configured as a client computer direction; client computer movement (e.g., a "shake" movement); voice command; sound, light or image recognition, etc. Preferably, the network selection signal used will allow the user to easily, quickly, and reliably select the desired network for content provisioning to another. Preferably, the client will provide its user with a feedback signal or other indication indicating which network will be used for content provisioning.

[0145] While the provision of open computer networks of the present invention has particular utility in social media and proximity-based centralized communications, the provision of restricted computer networks of the present invention has particular utility in enhancing the coordination and safety of police, firefighters, and other emergency responders, particularly if configured as a distributed computer network. For example, a restricted computer network available to first responders at an emergency site allows police, firefighters, and other emergency personnel to communicate with each other without being constrained to a centralized server. Instead, network content would "jump" from one responder's client computer to another responder's client computer. Thus, the effective communication range would extend from the on-site command and control center to the most distant responder (see Figure 1 ). Moreover, because access to content is limited to authenticated client computers, information communicated between responders will be secure and confidential. Additionally, because the preferred computer network will also include an open computer network, first responders will be able to communicate with civilians and victims, separate from any communications with other first responders. Example group communications between first responders associated with a fire scene are shown below in Table 1. In Table 1, firefighters have client computers joined to an open ("O") network, thereby enabling their users to communicate with victims and non-emergency responders, whose client computers also join the open ("O") network. Additionally, the firefighters are joined to a restricted "Fire Responder" ("FR") network. The restricted computer network terms of service of the FR network default to providing content to the FR network, and in order to provide content to another network, the firefighter is required to provide a network selection signal ("NSS"). Therefore, as shown in Table 1, in order to provide content on the open computer network, the firefighter provides an NSS of "O". The general network service terms of the open (O) network assume that the content will be provided on an open computer network and therefore does not require any NSS signaling of the network to be adopted. For ease of illustration, the content shown in Table 1 is shown as text, but can be audio, image, video, etc. as discussed above.

[0146]

[0147]

[0148] Significantly, due to the ability of each of the first responders' individual client computers to receive and provide content, Message 1 is relayed from client computer to client computer and is received by the command center at substantially the same time as it is provided by Fire Team 1. Additionally, Message 3 from Victim 1 is automatically received at the command center and is substantially the same time as it is received by Fire Team 1. Thus, information regarding Victim 1 is received at the command center without any active intervention by Fire Team 1. The decision to delay rescuing Victim 1 until Fire Team 2 is in place (Message 4) may reflect the presence of other victims or extenuating circumstances with higher priority. To prevent panic and allow firefighters to triage the emergency response more effectively, Message 4 is provided over a restricted computer network and, therefore, is not perceived by Victim 1. All first responders hear of the successful rescue of Victim 1 via Message 7.

[0149] The use of the restricted computer network of the present invention, particularly if configured as a distributed computer network, is also of particular utility in enhancing the coordination and safety of soldiers and other military personnel engaged in military operations. The distributed configuration of the network allows its scope to be extended from the highest-ranking soldier to the soldier's command and control center. Content provided to the restricted computer network is immediately provided to all client computers that have joined the restricted computer network, thereby facilitating communication between soldiers and between soldiers and their command centers. As discussed above, the present invention relates to computer networks that include multiple restricted computer networks. Thus, it is possible to share information with only a subset of the military (e.g., officers, advance parties, sergeants, supply support groups, internal squads, between nearby squads, all sentries, etc.).

[0150] The use of the restricted computer network of the present invention, particularly if configured as a distributed computer network, also has particular utility in enhancing coordination and security within private enterprises. The distributed configuration of the network allows its scope to extend across the entire implementation of the enterprise. Content provided to the restricted computer network is immediately provided to all client computers that have joined the restricted computer network, thereby facilitating communication between individuals with shared responsibilities. As discussed above, the present invention is concerned with computer networks comprising multiple restricted computers. Thus, information may be shared with only a subset of enterprise personnel (e.g., administration, shipping, sales, security, etc.).

[0151] V. Content Weighting and Presentation of Weighted Content

[0152] As discussed above, the distributed or non-distributed network of the present invention is used to distribute content between client computers that join such a network. One aspect of the present invention relates to the ability of client computers to limit and / or filter received content in order to present content to its users that is weighted according to the user's preferences. Thus, for example, a client computer can be directed to presenting proximity-weighted, rating-weighted, topic-weighted, time-weighted, query-weighted, vote-weighted, and / or location-weighted content. Any combination of such weightings can be employed.

[0153] As used herein, the term "proximity weighting" is intended to mean that a client will "weight" (e.g., sort, rank, etc.) content to be presented to a user of such client such that the content is ranked based on proximity of the location of the content-providing client to the location of the content-receiving client. Thus, for example, a client applying proximity weighting to received content would present to its user content about topics being discussed that were discussed within 5 meters of the content receiving client's location, within 10 meters of the content receiving client's location, within 25 meters of the content receiving client's location, within 50 meters of the content receiving client's location, within 100 meters of the content receiving client's location, within 250 meters of the content receiving client's location, within 500 meters of the content receiving client's location, within 1 kilometer of the content receiving client's location, within 5 kilometers of the content receiving client's location, within 10 kilometers of the content receiving client's location, within 25 kilometers of the content receiving client's location, within 50 kilometers of the content receiving client's location, within 100 kilometers of the content receiving client's location, or at a greater distance from the content receiving client's location. Such a proximity-weighted user would then be able to perceive the most frequently commented-on topics within his / her vicinity.

[0154] As used herein, the term "rank weighting" is intended to mean that a client will weight content presented to a user of such a client so that the content is ranked according to the amount of relevant content received by the client (relative to all content). Thus, for example, a client applying rank weighting to received content would present to the user the topics with the most discussions received by the client 1, 5, 10, 20, 50, 100, etc. Such a rank-weighted user would then be able to perceive the most frequently commented-on topics presented to the client.

[0155] As used herein, the term "topic weighting" is intended to mean that a client will weight content to be presented to a user of such a client so that the content is ranked according to content "topics" (e.g., names, events, themes, persons, occurrences, etc.). Thus, for example, a client applying topic weighting to received content would present the user with relevant content for the topics of the alphabetically sorted list received by the client. Such a topic-weighted user would then be able to perceive content that is relevant to one or more specific topics of interest.

[0156] As used herein, the term "query weighting" is intended to mean that a client will weight the content to be presented to the user of such a client so that the content is ranked according to its perceived relevance to the search terms (keywords) provided by the user. Thus, for example, a client that applies ranking weighting to received content will present its user with content that is relevant to the user's particular interests (e.g., names, events, themes, people, incidences, etc.). A user of such query weighting will then be able to perceive content that is relevant to a particular topic that satisfies the query. A single query or multiple queries may be applied simultaneously. Multiple queries may be applied separately (e.g., "weather" or "Seattle") or in combination (e.g., "weather" and "Seattle"). Queries may employ Boolean connectors (e.g., AND, NOT, OR, NEARBY, TIME, LOCATION, etc.). Thus, while topic weighting presents a user with a list of topics received by the user's client, query weighting presents a user with a list of topics that are specifically relevant to the user.

[0157] As used herein, the term "time weighting" is intended to indicate that a client will weight content to be presented to a user of such client so that the content is ranked according to recency. Thus, for example, a client applying time weighting to received content would present its user with 1, 5, 10, 20, 50, 100, etc. topics that were presented to the client most recently, or that appeared within the last 10 minutes, 30 minutes, hour, day, week, month, year, etc. Such a time-weighted user would then be able to perceive the content presented to the client as recent.

[0158] As used herein, the term "location weighting" is intended to mean that a client is to weight content to be presented to a user of such client so that the content is ranked according to a place or location selected by the user. Thus, for example, a client applying location weighting to received content may present its user with content relevant to a particular area, such as a university or college campus, a neighborhood, an event venue (e.g., an amusement park, a trade show, a cruise ship, a conference, etc.), a city, a state, a country, a subcontinental region (e.g., Northern Europe, the Middle East, etc.), or a continent. Such a location-weighted user may then be able to perceive content relevant to such location.

[0159] As used herein, the term "vote weighting" is intended to mean that a client will weight content to be presented to a user of such client such that the content is ranked according to the percentage of upvotes received (relative to all received votes) that such content has received from other users whose client has previously received such content and whose users have voted their responses or reactions to such content. Thus, for example, a client applying vote weighting to received content would present its user with content that has received votes greater than 50% upvotes, greater than 60% upvotes, greater than 70% upvotes, greater than 80% upvotes, greater than 90% upvotes, greater than 95% upvotes, etc. Such vote-weighted users would then be able to perceive the topics presented to the client as being most likely to be commented on.

[0160] Each of these weightings can be applied individually to present the user with content that is weighted by proximity only, rank only, topic only, time only, query only, vote only, or location only (e.g., to present the client with the nearest 1, 2, 5, 10, 20, 50, 100, etc. topics, regardless of their rank, topic, recency, or location). More preferably, at the user's request, the client can apply any 2, 3, 4, 5, 6, or all 7 of these weightings simultaneously to present the user with relevant content that:

[0161] A: proximity weighting and rank weighting; or proximity weighting and topic weighting; or proximity weighting and time weighting; or proximity weighting and query weighting; or proximity weighting and vote weighting; or proximity weighting and position weighting; or rank weighting and topic weighting; or rank weighting and time weighting; or rank weighting and query weighting; or rank weighting and vote weighting; or rank weighting and position weighting; or rank weighting and time weighting; or topic weighting and query weighting; or topic weighting and vote weighting; or topic weighting and position weighting; or time weighting and query weighting; or time weighting and vote weighting; or time weighting and position weighting; or query weighting and vote weighting; or query weighting and position weighting; or

[0162] B: proximity weighting and rank weighting and topic weighting; or proximity weighting and rank weighting and time weighting; or proximity weighting and rank weighting and query weighting; or proximity weighting and rank weighting and vote weighting; or proximity weighting and rank weighting and position weighting; or proximity weighting and topic weighting and time weighting; or proximity weighting and topic weighting and query weighting; or proximity weighting and vote weighting; or proximity weighting and topic weighting and position weighting; or proximity weighting and time weighting and query weighting; or proximity weighting and time weighting and vote weighting; or proximity weighting and time weighting and position weighting; or proximity weighting and query weighting and vote weighting; or proximity weighting and query weighting or proximity weighting and vote weighting and position weighting; or rank weighting and topic weighting and time weighting; or rank weighting and topic weighting and query weighting; or rank weighting and topic weighting and vote weighting; or rank weighting and topic weighting and position weighting; or rank weighting and time weighting and query weighting; or rank weighting and time weighting and vote weighting; or rank weighting and time weighting and position weighting; or rank weighting and query weighting and vote weighting; or rank weighting and query weighting and position weighting; or rank weighting and vote weighting and position weighting; or topic weighting and time weighting and query weighting; or topic weighting and time weighting and vote weighting; or topic weighting and time weighting and position weighting;

[0163] or topic weighting and query weighting and vote weighting; or topic weighting and query weighting and position weighting; or topic weighting and query weighting and vote weighting and position weighting; or time weighting and query weighting and vote weighting; or time weighting and query weighting and position weighting; or time weighting and vote weighting and position weighting; or query weighting and vote weighting and position weighting; or

[0164] C: proximity weighting and rank weighting and topic weighting and time weighting; or proximity weighting and rank weighting and topic weighting and query weighting; or proximity weighting and rank weighting and topic weighting and vote weighting; or proximity weighting and rank weighting and topic weighting and position weighting; or proximity weighting and rank weighting and time weighting and query weighting; or proximity weighting and rank weighting and time weighting and vote weighting; or proximity weighting and rank weighting and time weighting and position weighting; or proximity weighting and query weighting and vote weighting; or proximity weighting and rank weighting and query weighting and position weighting; or proximity weighting and rank weighting and vote weighting and position weighting; or proximity weighting and topic weighting and time weighting and query weighting; or proximity weighting and Topic weighting and query weighting and vote weighting; or proximity weighting and topic weighting and query weighting and position weighting; or proximity weighting and topic weighting and vote weighting and position weighting; or proximity weighting and time weighting and query weighting and vote weighting; or proximity weighting and time weighting and query weighting and position weighting; or proximity weighting and time weighting and vote weighting and position weighting; or proximity weighting and query weighting and vote weighting and position weighting; or rank weighting and topic weighting and time weighting and query weighting; or rank weighting and topic weighting and time weighting and vote weighting; or rank weighting and topic weighting and time weighting and vote weighting and position weighting; or rank weighting and topic weighting and query weighting and vote weighting; or rank weighting and topic weighting and query weighting and vote weighting; or rank weighting and topic weighting and query weighting and position weighting; or rank weighting and time weighting and query weighting and vote weighting;

[0165] or rank weighting and time weighting and query weighting and position weighting; or rank weighting and time weighting and vote weighting and position weighting; or rank weighting and query weighting and vote weighting and position weighting; or topic weighting and time weighting and query weighting and vote weighting; or topic weighting and time weighting and query weighting and position weighting; or topic weighting and time weighting and vote weighting and position weighting; or topic weighting and query weighting and vote weighting and position weighting; or time weighting and query weighting and vote weighting and position weighting; or

[0166] D. Proximity weighting and rank weighting and topic weighting and time weighting and query weighting; or proximity weighting and rank weighting and topic weighting and time weighting and vote weighting; or proximity weighting and rank weighting and topic weighting and time weighting and position weighting; or proximity weighting and rank weighting and topic weighting and query weighting and vote weighting; or proximity weighting and rank weighting and topic weighting and query weighting and position weighting; or proximity weighting and rank weighting and topic weighting and vote weighting and position weighting; or proximity weighting and rank weighting and time weighting and query weighting and vote weighting; or proximity weighting and rank weighting and time weighting and query weighting and position weighting; or proximity weighting and rank weighting and time weighting and vote weighting and position weighting; or proximity weighting and rank weighting and query weighting and vote weighting and position weighting; or proximity weighting and topic weighting weight and time weight and query weight and vote weight; or proximity weight and topic weight and time weight and query weight and position weight; or proximity weight and topic weight and time weight and vote weight and position weight; or proximity weight and topic weight and query weight and vote weight and position weight; or proximity weight and time weight and query weight and vote weight and position weight; or proximity weight and time weight and query weight and vote weight and position weight; or rank weight and topic weight and time weight and query weight and vote weight; or rank weight and topic weight and time weight and query weight and position weight; or rank weight and topic weight and time weight and vote weight and position weight; or rank weight and topic weight and query weight and vote weight and position weight; or rank weight and topic weight and query weight and vote weight and position weight; or

[0167] E. proximity weighting and rank weighting and topic weighting and time weighting and query weighting and vote weighting; or proximity weighting and rank weighting and topic weighting and time weighting and query weighting and position weighting; or proximity weighting and rank weighting and topic weighting and time weighting and vote weighting and position weighting; or proximity weighting and rank weighting and topic weighting and query weighting and vote weighting and position weighting; or proximity weighting and rank weighting and time weighting and query weighting and vote weighting and position weighting; or proximity weighting and topic weighting and time weighting and query weighting and vote weighting and position weighting; or rank weighting and topic weighting and time weighting and query weighting and vote weighting and position weighting; or

[0168] F. Proximity weighting, rank weighting, topic weighting, time weighting, query weighting, vote weighting, and position weighting.

[0169] By applying multiple weightings simultaneously, the client can, for example, present to its users content related to the top 1, 2, 5, 10, etc. topics being discussed in the space (either currently or at a user-selected wired time), or the current (or prioritized) topics of interest trends in a particular city, etc. Thus, for example, the present invention allows attendees of a meeting to share content related to topics that came up at the meeting, or allows individuals interested in being aware of news affecting a regional area to be able to determine the most important or latest topics regarding such an area. The architecture and configuration of the computer system allows the top trending topics to change as attendees move around the meeting, consistent with local changes in the topic hierarchy. Similarly, individuals concerned about weather or traffic events can communicate with each other using the present invention.

[0170] The client computer will preferably allow its users to respond to content provided by other users in order to allow for content "conversations". The client will also preferably allow users to register votes as to whether such users approve, agree, "like", etc., such content or disapprove, disagree, "dislike", etc. of such content. Such votes facilitate the ability of the computer system of the present invention to establish rating weighted ratings, time weighted ratings, and the like. The client will preferably allow users to respond to such votes in a personalized or aggregated manner in order to allow the voting user to view additional information (such as the user's name, username, etc.). Thus, for example, a user who posts content anonymously can receive an approving vote from another user and respond by allowing the approving user to learn the posting user's identity, location, etc. Preferably, such permission can subsequently be extended or terminated by the posting user.

[0171] VI. Content Monitoring Client Computers and Content Flow Analysis ("Data Mining")

[0172] In a preferred embodiment, one or more of the client computers of the computer system of the present invention will be configured as a "content monitoring client computer" computer. The content monitoring client computer differs from the client computers described above in that it is specifically adapted to analyze network content flows related to one or more specific topics selected by the user of the content monitoring client computer. The content monitoring client computers preferably do not automatically fall off the stack content of their smaller value, but rather retain such content so that time-based changes in the amount or frequency of content can be provided. The content monitoring client computer thus has the ability to monitor the flow of content on the network. The content monitoring client computer will preferably have greater processing power and greater memory capacity than other client computers. The content monitoring client computer can be a non-mobile device, such as a desktop computer, server, etc.

[0173] As used herein, the term "monitoring of content selections" and its variants are intended to refer to the ability of a content monitoring client computer to identify a client computer that is receiving or providing selected content. Preferably, such identification is anonymous, to the extent that the personal identity (e.g., name, username, etc.) and / or attributes (address, age, credit card information, etc.) of the user of such identified client computer are not conveyed to or stored by the content monitoring client computer. Significantly, however, the content monitoring client computer will preferably have access to the user's identity code (or the client computer's identity code). This attribute facilitates the content monitoring client computer's ability to categorize users based on the combination of topics of interest they visit, and to track changes in the recency, magnitude, excitement, or other attributes or characteristics of such users' interactions with each other or with specific products. Thus, the computer system of the present invention can be operated to provide users of content monitoring client computers with the ability to perceive content flows across the entire network or any subregion thereof. In conjunction with query-weighted content presentation requests, such content monitoring client computers can be used to assess the degree to which such selected flows correlate with user-selected attributes (e.g., to facilitate "data mining" of current content flows). Further in conjunction with time-weighted content presentation requests, and when a log or database of past content has been created, such content monitoring client computers allow their users to access content that streamed over the network at specific times in the past, or at specific locations, or during specific time periods, which can be used to assess the degree of relevance of such selected past streams to user-selected attributes (e.g., "data mining" past content streams).

[0174] Thus, for example, a content monitoring client computer that has been instructed to monitor content related to a particular service, event, location, product, etc., would be able to identify the percentage of client computers on the network that have been instructed to receive or provide content related to such service, event, location, product, etc. Preferably, the content monitoring client computer would also be able to access such content to allow its user to perceive the approval / disapproval, rating, recency, topicality, etc., of such content. Thus, for example, a content monitoring client computer that has been instructed to monitor content related to selected products (e.g., fast food products, television, etc.) or selected events (e.g., individuals entering an office building, attending a trade show, or visiting a museum) would be able to identify how many users are reviewing the product or event (in absolute numbers or relative to the total number of client computers on the network), typically anonymously, and the reactions of such users to the selected product. Manufacturers, sponsors, administrators, etc. could then use this information to offer or change product offerings or alter event conditions (e.g., reallocate sales assistance, address depleted inventory, address overcrowding, etc.) in order to increase support for the product or event.

[0175] An additional feature of the present invention is that such content selection monitoring can be cross-correlated with other content to provide the content monitoring client computer with the ability to identify the demographics of the user that the client computer has instructed to receive or provide the selected content and such other content. Thus, for example, a content monitoring client computer can be instructed to monitor content about products (e.g., the selected content). Such additional content can be query-specific, and / or can relate to one, two, or more topics. The content monitoring client computer can then also be instructed to monitor content about specific services, events, or locations. By then instructing the content monitoring client computer to compare identifier codes associated with client computers that receive or provide such content, the content monitoring client computer can identify the number and relative percentage of the intersection of client computers that are receiving or providing content about related products and such specific services, events, or locations. For example, by selecting to monitor " Computer" and then correlated with the adjacent intersection of "North Carolina" or "California", one can identify the computer involved in North Carolina or California. The number or percentage of client computers that are computers. By repeatedly performing such selections over time, it is possible to identify how associations change over time.

[0176] The content monitoring client computer capabilities of the present invention are therefore compatible with social browsing networks such as or Angie's ) are significantly different from those provided by , which are simultaneous, automatic, dynamic and relevant.

[0177] Although the content monitoring client computer is primarily concerned with monitoring network content, the content monitoring client computer may also have the ability to provide content to other client computers. For example, the content monitoring client computer may respond to the monitored content stream by providing inducements to other client computers (e.g., ) to encourage users to comment more favorably about a service, event, location, product, etc. Similarly, an amusement park operator may use a content monitoring client computer to provide client computers with information about less crowded areas of the park in order to direct park visitors away from more congested areas of the park.

[0178] VII. Example User Interfaces of Client Computers of the Computer System of the Invention

[0179] The client computer of the present invention will preferably present a graphical user interface to its user, which will include a text input box sufficient to allow the user to indicate the user's preferences when accessing and using the computer system of the present invention. Such preferences may include: the user's real name, a selected "user name", a selected password, preferences regarding the desired type or types of weight types, and parameters for such weights (e.g., time intervals used in time weighting, distance parameters used in proximity weighting, etc.). Figure 5 Such a text input screen is shown. Additionally, such preferences may include: the user's privacy preferences, such as whether the user's real name or selected username is to be visible to other users, or whether such user's content is to be anonymous to other users.

[0180] Any of a variety of user preferences may be employed to allow a user to efficiently perceive received content or provide content to other users. Such an interface may be textual, such as a thread list, but more preferably, an "atomic" user interface is employed, wherein a user interacts with a user by "grabbing" one or more graphical elements (or selecting such graphical elements) that are tactilely sensitive or voice responsive. Figure 6 ), the screen can cause the interface to "zoom in" to see one or more previously smaller or previously invisible graphical units, representing a smaller range of more selected content. Conversely, by "shrinking" one or more of the graphical units (or selecting such a graphical unit), the user can cause the interface to "zoom in" to present additional content topics ( Figure 7 ). Preferably, the interface allows the user to slide through the graphical units to rotate them and thereby bring additional graphical units into view. The graphical units are preferably sized, colored, labeled, and / or have a certain structure to indicate their associated weighting, so that, for example, if time weighting is applied, graphical units associated with more recent topics will be more prominently colored or displayed, etc. It is also preferred that the graphical units are sized, colored, labeled, and / or have a certain structure to indicate the rate of change of topics related to such weighting. For example, the graphical unit can be a sphere, which directly reflects the weighting of the content, and its color reflects the rate of change of topics related to such weighting. Alternatively, the thickness of the circular outer boundary of such a sphere can be changed in proportion to the rate of change of the topic related to such weighting.

[0181] The interface would additionally preferably allow the user to drag graphical elements so that graphical elements representing topics having a user-perceived or user-defined relationship can be brought closer together or spaced apart relative to each other in a user-desired manner. Figure 8The invention is illustrated by showing how such amplification can be used to ultimately result in the presentation of content, and an illustrative topic conversation among several lecture attendees is shown. Initially, the participants comment anonymously, however, "Anon28" and "Anon12" eventually reveal their identities to each other. Figure 8 As shown, the user can choose to provide text content, image content or sound content.

[0182] Preferably, the user interface will allow the user to drag and drop graphic elements to be placed on the sorting graphic elements ( Figure 9A ) or overlap each other ( Figure 9B ) to allow the user to view related content related to two or more topics. More preferably, the user interface will allow the user to select a graphical element (which may then change color or appearance to indicate such selection) to select and view related content related to the topic of the selected graphical element ( Figure 9C ). Therefore, if Figures 9A-9C As shown, the graphic unit labeled "Seattle" includes all of the topics therein that are related to Seattle in some way, as well as Figures 9A-9C As shown, the graphic cell labeled "Weather" includes multiple topics therein that are all related to weather anywhere in some way. However, by dragging the "Seattle" and "Weather" graphic cells to the sorting graphic cell (as indicated by the star), the user can choose to view content related to weather in Seattle ( Figure 9A Alternatively, the user can drag one graphical element (e.g., the "Seattle" graphical element) so that it overlaps another graphical element (e.g., the "Weather" graphical element) to access content related to Seattle's weather ( Figure 9B Alternatively, the user can "select" a graphical element of interest (e.g., by touching such a graphical element). The interface then preferably changes the appearance of the selected element to indicate their selection, and provides the user with content related to the topic for which the selected graphical element was designed (e.g., Seattle weather; Figure 9C ).

[0183] Specifically, in conjunction with location weighting, a user interface may include a map with locations resized, colored, labeled, and / or structured to indicate their relative weighting (e.g., a "heat map"). Thus, for example, a client computer presenting a time-weighted map of an amusement park may present its user with a gradient of the park's currently most crowded areas. Figure 10AIllustrating this aspect of the invention, Town Square and Future Land are shown as the most crowded parts of the amusement park. The user can then choose to visit other, less crowded areas of the park. The user can then instruct his / her client computer to present a rank-weighted map of the amusement park and thus be able to perceive the gradient of the areas of the park that are currently driving the most discussion. Figure 10B Illustrating this aspect of the invention, something interesting is shown happening in the Magic Land and Adventure Place sections of the park. An amusement park operation can use a content monitoring client computer to assess how such a "heat map" of park traffic changes over time, and thus be able to better allocate park resources to alleviate congestion and promote improved traffic flow. Preferably, such heat map changes are provided to a user of the content monitoring client computer in real time (e.g., as a pseudo video formed from rapidly updating static heat map graphics, or as a continuous video of traffic flow, etc.).

[0184] If such a presentation is on a client computer device, the user interface may exploit a camera or other optical image input. For example, the user interface may use the camera of a client computer including a camera to associate content with a particular location, orientation, or user. Thus, the user interface may be displayed as an image of the surrounding environment including annotations regarding the location or orientation of the content provider and the nature of the content being provided (e.g., the user interface may be displayed as an image of the surrounding environment). Figure 11 ). The client computers of users who have provided permission to the receiving client computer can be clearly positioned on the user interface so as to be individually identified. Conversely, the client computers of users who have not yet granted such permission will preferably be positioned in only one area so as to remain anonymous to the receiving client computer.

[0185] The user interface will preferably symbolize users with multiple upvotes with symbols representing such upvotes (e.g., stars, thumbs-up, etc.) The user interface may additionally symbolize users with multiple downvotes with symbols representing such downvotes.

[0186] All publications and patents mentioned in this specification are incorporated herein by reference to the same extent as if each individual publication or patent application was specifically and individually indicated as being incorporated by reference in its entirety. Although the invention has been described in conjunction with specific embodiments thereof, it should be understood that further modifications are possible and this application is intended to cover any changes, uses, or adaptations of the invention that generally follow the principles of the invention and include such departures from the present disclosure as would be known or conventional to one skilled in the art in the art and that could be applied to the significant features herein before set forth.

Claims

1. A computer system for distributing content between interconnected client computers, wherein the computer system comprises: A content providing client computer and a content receiving client computer, the content providing client computer and the content receiving client computer are digitally interconnected with each other directly or through one or more other client computers to form a distributed communication network, wherein (A) the content providing client computer and the content receiving client computer respectively include: means for inputting data, means for receiving content provided by another client computer, means for providing content to another client computer, a computer addressable memory for storing content and programming instructions, and a processor for processing data and for implementing the programming instructions, and the content receiving client computer additionally includes means for presenting the content to a user; (B)(1) said content providing client computer is adapted to transmit wireless and / or wired signals of text, image and / or audio data to said content receiving client computer directly or through said one or more other client computers of said distributed communication network; (2) the content receiving client computer is adapted to receive at least a subset of the signals transmitted by the content providing client computer and to present at least a subset of the received data to a user of the content receiving client computer; and (C) wherein the content of the received or presented data is adjusted in response to changes in: (i) a favorability value assigned by the content providing client computer; and / or (ii) weighted preferences assigned by the content receiving client computer; and / or (iii) when the content providing client computer and the content receiving client computer are interconnected with each other via one or more of the other client computers, the favorability values ​​assigned by one or more of the other client computers, Such content is thereby distributed through a distributed network; wherein the favorability value is determined by a favorability function, which takes into account one or more client-selected or network-selected favorability parameters; with the proviso that when the selected favorability parameters include both voting and time, the favorability function should additionally take into account one or more additional favorability parameters.

2. A computer system according to claim 1, wherein the client computers of the computer system store received content in a content stack memory; wherein in response to an increase in the favorability value of the content, the content stored in the content stack memory increases, and in response to a decrease in the favorability value, the content stored in the content stack memory decreases, so that the number or amount of content stored in the content stack memory and provided to other client computers of the network remains within available processing and bandwidth parameters.

3. The computer system of claim 2, wherein the client computer of the computer system presents a subset of the stored content to a user thereof, wherein the presented content is stored in a presentation stack memory; wherein the content stored in the presentation stack memory: (A) ascending in the presentation stack memory in response to: (1) the proximity between the content receiving client computer and the content providing client computer that is providing the content increases; (2) the favorability value of the content increases; as well as (3) receiving a change in the weighted preference applied by the content receiving client computer that increases user desire for the content; and (B) descending in the presentation stack memory in response to: (1) the proximity between the content receiving client computer and the content providing client computer that is providing the content is reduced; (2) the favorability value of the content decreases; and (3) receiving a change in the weighted preference applied by the content receiving client computer that reduces the user's desire for the content; The number or amount of content stored in the presentation stack memory of the client computer is maintained within user-selected parameters.

4. The computer system according to any one of claims 1 to 3, wherein the content providing client computer, the content receiving client computer, or both the content providing client computer and the content receiving client computer are mobile devices.

5. The computer system of claim 4, wherein the mobile device is a smartphone, a laptop, a tablet, a smart watch, or a head mounted display mobile device.

6. The computer system according to any one of claims 1 to 3, wherein the content providing client computer, the content receiving client computer, or both the content providing client computer and the content receiving client computer are installed in a car, a ship, or an aircraft.

7. The computer system of any one of claims 1-3, wherein the content providing client computer, the content receiving client computer, or both the content providing client computer and the content receiving client computer are installed in a non-mobile building.

8. The computer system according to any one of claims 1 to 3, wherein the content providing client computer, the content receiving client computer, or both the content providing client computer and the content receiving client computer are installed in a drone or an unmanned device.

9. The computer system of any one of claims 1-3, wherein the network additionally comprises a content monitoring client computer.

10. The computer system of any one of claims 1-3, wherein the network comprises a restricted computer network.

11. The computer system of any one of claims 1-3, wherein the means for presenting content to a user comprises a graphical user interface.

12. A computer-implemented method for distributing content between a content-providing client computer and a content-receiving client computer, said content-providing client computer and said content-receiving client computer being digitally interconnected with each other directly or through one or more other client computers to form a distributed communication network, wherein in said method: (A) The content providing client computer and the content receiving client computer respectively include: means for inputting data, means for receiving content provided by another client computer; means for presenting content to a user, a computer addressable memory for storing content and programming instructions, and a processor for processing data and for implementing the programming instructions, and the content receiving client computer additionally includes means for presenting content to a user; and (B)(1) said content providing client computer is adapted to transmit wireless and / or wired signals of text, image and / or audio data to said content receiving client computer directly or through said one or more other client computers of said distributed communication network; (2) the content receiving client computer is adapted to receive at least a subset of the signals transmitted by the content providing client computer and to present at least a subset of the received data to a user of the content receiving client computer; The method described herein: (1) adjusting the content of received or presented data in response to changes in: (i) a favorability value assigned by the content providing client computer; and / or (ii) a weighted preference assigned by the content receiving client computer; and / or (iii) when the content providing client computer and the content receiving client computer are interconnected with each other via one or more of the other client computers, the favorability values ​​assigned by one or more of the other client computers, wherein the favorability value is determined by a favorability function, the favorability function taking into account one or more client-selected or network-selected favorability parameters; and under the proviso that the selected favorability parameters include both voting and time, the favorability function shall additionally take into account one or more additional favorability parameters; as well as (2) Allowing the content providing client computer to distribute content to the content receiving client computer, thereby allowing the distributed communication network to distribute the content through the network.

13. A computer-implemented method according to claim 12, wherein the method allows a client computer in a computer system to store received content in a content stack memory; wherein the method allows the content stored in the content stack memory to increase in response to an increase in the favorability value of the content, and allows the content stored in the content stack memory to decrease in response to a decrease in the favorability value, so that the number or amount of content stored in the content stack memory and provided to other client computers in the network remains within available processing and bandwidth parameters.

14. The computer-implemented method of claim 13, wherein the method allows the client computer in the computer system to present a subset of the stored content to a user thereof, wherein the presented content is stored in a rendering stack memory; wherein the method allows the content stored in the rendering stack memory to: (A) ascending in the presentation stack memory in response to: (1) the proximity between the content receiving client computer and the content providing client computer that is providing the content increases; (2) the favorability value of the content increases; as well as (3) receiving a change in the weighted preference applied by the client computer through the content that increases the user's desire for the content; and (B) descending in the presentation stack memory in response to: (1) the proximity between the content receiving client computer and the content providing client computer that is providing the content is reduced; (2) the favorability value of the content decreases; and (3) receiving a change in the weighted preference applied by the content receiving client computer that reduces the user's desire for the content; The number or amount of content stored in the presentation stack memory of the client computer is maintained within user-selected parameters.

15. The computer-implemented method of any of claims 12-14, wherein the content-providing client computer, the content-receiving client computer, or both the content-providing client computer and the content-receiving client computer are mobile devices.

16. The computer-implemented method of claim 15, wherein the mobile device is a smartphone, a laptop, a tablet, a smart watch, or a head mounted display mobile device.

17. The computer-implemented method of any of claims 12-14, wherein the content-providing client computer, the content-receiving client computer, or both the content-providing client computer and the content-receiving client computer are installed in an automobile, a boat, or an aircraft.

18. The computer-implemented method of any of claims 12-14, wherein the content-providing client computer, the content-receiving client computer, or both the content-providing client computer and the content-receiving client computer are installed in a non-mobile building.

19. The computer-implemented method of any one of claims 12-14, wherein the content providing client computer, the content receiving client computer, or both the content providing client computer and the content receiving client computer are installed in a drone or an unmanned device.

20. The computer-implemented method of any of claims 12-14, wherein the method allows the network to additionally include a content monitoring client computer.

21. The computer-implemented method of any of claims 12-14, wherein the method allows the network to comprise a restricted computer network.

22. The computer-implemented method of any of claims 12-14, wherein the means for presenting content to a user comprises a graphical user interface.

23. A content receiving and / or content providing CRCP client computer, which: (I) capable of receiving content from a content providing client computer 1 when interconnected with the content providing client computer 1, either directly or through one or more other client computers, by digital or analog, wireless or wired, infrared signals, laser pulses, or radio frequency connections; and / or (II) capable of providing content to content receiving client computer II when interconnected with the content receiving client computer II directly or through one or more other client computers via digital or analog, wireless or wired, infrared signals, laser pulses, or radio frequency connections; The content includes text content, sound content, image content and / or video content; The CRCP client computer is suitable for: (A) presenting to its user at least a subset of content received from an interconnected content providing client computer 1, wherein the received content is adjusted in response to changes in favorability values ​​assigned by a user of the content providing client computer 1 or by a user of the CRCP client computer, and the presented content is adjusted in response to changes in weighted preferences assigned by a user of the CRCP client computer; as well as (B) providing content to an interconnected content receiving client computer II, wherein the provided content is adjusted in response to changes in the favorability values ​​assigned by users of said CRCP client computers, The favorability value is determined by a favorability function, which takes into account one or more favorability parameters. Under the proviso that the selected favorability parameters include both votes and time, the favorability function should additionally take into account one or more additional favorability parameters.

24. A CRCP client computer according to claim 23, wherein the CRCP client computer stores the received content in a content stack memory; wherein the content stored in the content stack memory increases in response to an increase in the favorability value of the content, and / or decreases in response to a decrease in the favorability value, so that the number or quantity of content stored in the content stack memory remains within available processing and bandwidth parameters.

25. The CRCP client computer of claim 24, wherein content presented to a user thereof is stored in a presentation stack memory; wherein the content stored in the presentation stack memory: (A) ascending in the presentation stack memory in response to: (1) the proximity between the CRCP client computer and the content providing client computer 1 increases; (2) The content's favorability value as defined by the following items increases: (i) distributed by a user of the content providing client computer 1; and / or (ii) assigned by a user of the CRCP client computer; and / or (iii) where the client computer 1 and the CRCP client computer are interconnected via one or more other client computers, allocated by one or more users of the other client computers; and / or (3) a change in the weighted preference applied by the CRCP client computer that increases the user's desire for the content; and / or (B) descending in the presentation stack memory in response to: (1) the proximity between the CRCP client computer and the content providing client computer 1 is reduced; (2) The content's favorability value as defined by the following items is reduced: (i) distributed by a user of the content providing client computer 1; and / or (ii) assigned by a user of the CRCP client computer; and / or (iii) where the client computer 1 and the CRCP client computer are interconnected via one or more other client computers, allocated by one or more users of the other client computers; and / or (3) a change in the weighted preference applied by the CRCP client computer that reduces the user's desire for the content; The number or quantity of content stored in the presentation stack memory of the CRCP client computer is maintained within user selected parameters.

26. A CRCP client computer according to claim 25, wherein the presented content is weighted based on one or more weighted preferences, and the one or more weighted preferences are selected from the group consisting of: proximity weighting, rating weighting, topic weighting, query weighting, time weighting, location weighting, venue weighting, voting weighting, segment weighting and geophysical weighting.

27. The CRCP client computer according to any one of claims 23 to 26, which is adapted to be interconnected with the content providing client computer I and / or the content receiving client computer II via infrared signals.

28. The CRCP client computer according to any one of claims 23-26, adapted to be interconnected with the content providing client computer I and / or the content receiving client computer II via laser pulses.

29. The CRCP client computer according to any one of claims 23 to 26, adapted to be interconnected with the content providing client computer I and / or the content receiving client computer II via a radio frequency connection.

30. A CRCP client computer according to any one of claims 23-26, wherein the CRCP client computer is installed in a car, installed in or on a building, or is a component of a drone device.

31. A CRCP client computer according to any one of claims 23-26, wherein the CRCP client computer is additionally adapted to interconnect with a content monitoring computer.

32. The CRCP client computer according to any one of claims 23 to 26, wherein the CRCP client computer is capable of interconnecting with client computers of a restricted computer network.

33. A CRCP client computer according to any one of claims 23-26, wherein the CRCP client computer is adapted to present the received content to a user using a graphical user interface.

34. A CRCP client computer according to any one of claims 23-26, wherein the CRCP client computer, when interconnected with the content providing client computer I directly or through one or more other client computers via digital or analog, wireless or wired, infrared signals, laser pulses, or radio frequency connections, can receive content from the content providing client computer I.

35. A CRCP client computer according to any one of claims 23-26, wherein the CRCP client computer, when interconnected with a content receiving client computer II directly or through one or more other client computers via digital or analog, wireless or wired, infrared signals, laser pulses, or radio frequency connections, is capable of providing content to the content receiving client computer II.

36. A CRCP client computer according to any one of claims 23-26, wherein the CRCP client computer, when interconnected with the content receiving client computer II directly or through one or more other client computers via digital or analog, wireless or wired, infrared signals, laser pulses, or radio frequency connections, is additionally capable of providing content to the content receiving client computer II.